인프런 커뮤니티 질문&답변

n,m = map(int, input().split())

gp=[[0]*n for _ in range(n)]

for _ in range(m):

    a,b = map(int, input().split())

    gp[a-1][b-1]=1

def DFS(L):

  global cnt

  if res[L]==n:

    cnt+=1

  else:

    for i,x in enumerate(gp[res[L]-1]):

      if x==1 and tmp[i]==0:

        res.append(i+1)

        tmp[i]=1

        DFS(L+1)

        res.pop()

        tmp[i]=0

cnt=0

res=[1]

tmp=[0]*n

tmp[0]=1

DFS(0)

print(cnt)