s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s775028738 | p03805 | u344065503 | 1589590007 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 365 | import itertools
n,m = map(int,input().split())
path=[[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(n),n):
if i[0]==0:
for j in rannge(n):
if j ==n-1:
ans+=1
if not path[i[j]][i[j+1]]:
break
print(ans) |
s314864085 | p03805 | u344065503 | 1589589451 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 368 | import itertools
n,m = map(int,input().split())
path=[[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(n),n):
if i[0]==0:
for j in rannge(n-1):
if j ==n-1:
ans+=1
if not path[i[j]][i[j+1]]:
break
print(ans)
|
s622681569 | p03805 | u344065503 | 1589589338 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38384 | 368 | import itertools
n,m = map(int,input().split())
path=[[False]*n for _ in range(m)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(n),n):
if i[0]==0:
for j in rannge(n-1):
if j ==n-1:
ans+=1
if not path[i[j]][i[j+1]]:
break
print(ans)
|
s493526910 | p03805 | u127499732 | 1589474351 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 722 | def main():
_, __ = map(int, input().split())
___ = [[] for _ in range(_)]
for _ in range(__):
____, _____ = map(lambda ______: int(_____) - 1, input().split())
___[____].append(_____)
___[_____].append(____)
_______ = [False] * _
________ = ___________(0, ___, _______, 0)
print(________)
def ___________(_____, ___, _______, _________):
_______[_____] = True
if all(_______):
return _________ + 1
for __________ in ___[_____]:
if _______[__________]:
continue
_________ = ___________(__________, ___, _______, _________)
_______[__________] = False
return _________
if __name__ == '__main__':
main()
|
s858110290 | p03805 | u047796752 | 1589457767 | Python | PyPy3 (7.3.0) | py | Runtime Error | 65 | 68744 | 417 | from itertools import *
N, M = map(int, input().split())
G = [set() for _ in range(M)]
for _ in range(M):
a, b = map(int, input().split())
G[a-1].add(b-1)
G[b-1].add(a-1)
ans = 0
for p in permutations(range(N)):
if p[0]!=1:
continue
flag = True
for i in range(N-1):
if p[i+1] not in G[p[i]]:
flag = False
if flag:
ans += 1
print(ans) |
s885983300 | p03805 | u318233626 | 1589436134 | Python | PyPy3 (7.3.0) | py | Runtime Error | 69 | 68848 | 960 | from sys import setrecursionlimit
setrecursionlimit(4100000)
n, m = map(int, input().split())
P = [[] for i in range(m)] #Pass
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
P[a].append(b)
P[b].append(a)
#print(P)
c = 0 #cursol
R = [0 for i in range(m)] #Record
tm = 1 #time
def all_search_dfs(c:int, tm:int, R:list):
if R[c] == 0:
R[c] = 1
if tm < n:
return point_calculate(c, tm, R)
elif tm == n:
return 1
else:
return 0
else:
return 0
def point_calculate(c:int, tm:int, R:list):
#print('c = ', c)
p = 0
#print('check = ', P[c])
for i in range(len(P[c])):
R2 = R[:]
#print('before = ', R2)
tmp = all_search_dfs(P[c][i], tm + 1, R2)
#print('after = ', R2)
#print('tmp = ', tmp)
p += tmp
#print('p = ', p)
return p
print(all_search_dfs(c, tm, R)) |
s434121574 | p03805 | u318233626 | 1589435749 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8988 | 961 | from sys import setrecursionlimit
setrecursionlimit(10 ** 10)
n, m = map(int, input().split())
P = [[] for i in range(m)] #Pass
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
P[a].append(b)
P[b].append(a)
#print(P)
c = 0 #cursol
R = [0 for i in range(m)] #Record
tm = 1 #time
def all_search_dfs(c:int, tm:int, R:list):
if R[c] == 0:
R[c] = 1
if tm < n:
return point_calculate(c, tm, R)
elif tm == n:
return 1
else:
return 0
else:
return 0
def point_calculate(c:int, tm:int, R:list):
#print('c = ', c)
p = 0
#print('check = ', P[c])
for i in range(len(P[c])):
R2 = R[:]
#print('before = ', R2)
tmp = all_search_dfs(P[c][i], tm + 1, R2)
#print('after = ', R2)
#print('tmp = ', tmp)
p += tmp
#print('p = ', p)
return p
print(all_search_dfs(c, tm, R)) |
s787411019 | p03805 | u318233626 | 1589435710 | Python | Python (3.8.2) | py | Runtime Error | 38 | 9264 | 960 | from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n, m = map(int, input().split())
P = [[] for i in range(m)] #Pass
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
P[a].append(b)
P[b].append(a)
#print(P)
c = 0 #cursol
R = [0 for i in range(m)] #Record
tm = 1 #time
def all_search_dfs(c:int, tm:int, R:list):
if R[c] == 0:
R[c] = 1
if tm < n:
return point_calculate(c, tm, R)
elif tm == n:
return 1
else:
return 0
else:
return 0
def point_calculate(c:int, tm:int, R:list):
#print('c = ', c)
p = 0
#print('check = ', P[c])
for i in range(len(P[c])):
R2 = R[:]
#print('before = ', R2)
tmp = all_search_dfs(P[c][i], tm + 1, R2)
#print('after = ', R2)
#print('tmp = ', tmp)
p += tmp
#print('p = ', p)
return p
print(all_search_dfs(c, tm, R)) |
s798440859 | p03805 | u318233626 | 1589435626 | Python | Python (3.8.2) | py | Runtime Error | 37 | 9100 | 960 | from sys import setrecursionlimit
setrecursionlimit(4100000)
n, m = map(int, input().split())
P = [[] for i in range(m)] #Pass
for i in range(m):
a, b = map(int, input().split())
a, b = a - 1, b - 1
P[a].append(b)
P[b].append(a)
#print(P)
c = 0 #cursol
R = [0 for i in range(m)] #Record
tm = 1 #time
def all_search_dfs(c:int, tm:int, R:list):
if R[c] == 0:
R[c] = 1
if tm < n:
return point_calculate(c, tm, R)
elif tm == n:
return 1
else:
return 0
else:
return 0
def point_calculate(c:int, tm:int, R:list):
#print('c = ', c)
p = 0
#print('check = ', P[c])
for i in range(len(P[c])):
R2 = R[:]
#print('before = ', R2)
tmp = all_search_dfs(P[c][i], tm + 1, R2)
#print('after = ', R2)
#print('tmp = ', tmp)
p += tmp
#print('p = ', p)
return p
print(all_search_dfs(c, tm, R)) |
s374202184 | p03805 | u880128069 | 1589342668 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 665 | import itertools
n,m = map(int,input().split())
path = [[False] * n for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
ans = 0
#頂点を並び替える順列を生成してループ
for i in itertools.permutations(range(n),n):
#頂点1が始点
if i[0] == 0:
#生成した順列の中をさらにループ
for j in range(n):
# n-1まで続いたら条件を満たすパスが存在する
if j == n-1:
ans += 1
break
#i[j]からi[j+1]に行くパスがなければ終了
if not path[i[j][j+1]]:
break
print(ans) |
s149898478 | p03805 | u197457087 | 1589338228 | Python | Python (3.4.3) | py | Runtime Error | 91 | 8052 | 708 | import itertools
import sys
N, M = map(int,input().split())
if M < N-1:
print(0)
sys.exit()
p = [i for i in range(N)] #0スタート
root = []
for i in range(M):
a,b = map(int,input().split())
root.append([a-1,b-1])
#print(root)
pattern = list(itertools.permutations(p))
ans = 0
for i in range(len(pattern)):
Flag = [0]*N
Flag[0] = 1
now = 0
last = False
for j in range(N-1):
if now == root[pattern[i][j]][0]:
now = root[pattern[i][j]][1]
elif now == root[pattern[i][j]][1]:
now = root[pattern[i][j]][0]
else:
break
if Flag[now] != 0:
break
else:
Flag[now] = 1
if j == N-2:
last = True
if last:
ans += 1
print(ans) |
s183126472 | p03805 | u197457087 | 1589338129 | Python | Python (3.4.3) | py | Runtime Error | 90 | 8052 | 660 | import itertools
N, M = map(int,input().split())
p = [i for i in range(N)] #0スタート
root = []
for i in range(M):
a,b = map(int,input().split())
root.append([a-1,b-1])
#print(root)
pattern = list(itertools.permutations(p))
ans = 0
for i in range(len(pattern)):
Flag = [0]*N
Flag[0] = 1
now = 0
last = False
for j in range(N-1):
if now == root[pattern[i][j]][0]:
now = root[pattern[i][j]][1]
elif now == root[pattern[i][j]][1]:
now = root[pattern[i][j]][0]
else:
break
if Flag[now] != 0:
break
else:
Flag[now] = 1
if j == N-2:
last = True
if last:
ans += 1
print(ans) |
s038320816 | p03805 | u085910248 | 1589252858 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 575 | n, m = map(int, input().split())
color = [0] * n
path = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
path[a-1].append(b)
path[b-1].append(a)
print(path)
def rec(c, p, crnt, d):
d += 1
if c[crnt] == 1:
if len(list(filter(lambda x: x == 1, c))) == m and d == m+1:
return 1
else:
return 0
elif c[crnt] > 1:
return 0
else:
c[crnt] += 1
sm = 0
for i in p[crnt]:
sm += rec(c, p, i-1, d)
return sm
print(rec(color, path, 0, 0))
|
s677539521 | p03805 | u085910248 | 1589250929 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 518 | n, m = map(int, input().split())
color = [0] * n
path = [[] for _ in range(m)]
for i in range(m):
a, b = map(int, input().split())
path[a-1].append(b)
path[b-1].append(a)
def rec(c, p, crnt, d):
d += 1
if c[crnt]:
if len(list(filter(lambda x: x == 1, c))) == m and d == m+1:
return 1
else:
return 0
else:
c[crnt] = 1
sm = 0
for i in p[crnt]:
sm += rec(c, p, i-1, d)
return sm
print(rec(color, path, 0, 0))
|
s465874868 | p03805 | u905203728 | 1589158468 | Python | PyPy3 (2.4.0) | py | Runtime Error | 298 | 44816 | 392 | def DFS(num):
global ans,color
color[num]="black"
if "white" not in color:
ans +=1
for i in M[num]:
DFS(i)
color[num]="white"
n,m=map(int,input().split())
AB=[list(map(int,input().split())) for _ in range(m)]
M=[[] for _ in range(n)]
color=["white" for _ in range(n)]
for a,b in AB:
M[a-1].append(b-1)
M[b-1].append(a-1)
ans=0
DFS(0)
print(ans) |
s720303112 | p03805 | u845650912 | 1588798582 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 638 | N,M = map(int,input().split())
A = [list(map(int, input().split())) for i in range(M)]
graph_data = [[0] * N for i in range(N)]
for i in range(M):
if A[i][0] > A[i][1]: A[i][0], A[i][1] = A[i][1], A[i][0]
graph_data[A[i][0]-1][A[i][1]-1] = graph_data[A[i][1]-1][A[i][0]-1] = 1
visited = [False] * N
def dfs(now, depth):
if visited[now]:
return 0
if depth == N - 1:
return 1
visite[now] = True
total_path = 0
for i in range(0,N):
if graph_data[now][i] == 1:
total_path += dfs(i, depth + 1)
visited[now] = False
return total_path
print(dfs(0,0)) |
s003999034 | p03805 | u393486651 | 1588788067 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3064 | 712 |
def dfs(node, paths, visited, n):
# 全て訪問済みだったら全部を訪問できる経路として1を返す
if not False in visited:
return 1
count = 0
for nn in paths[node]:
# 既に訪問済みなら処理をしない
if(visited[nn]):
continue
visited[nn] = True
count += dfs(nn, paths, visited, n)
visited[nn] = False
return count
def main():
N, M = list(map(int, input().split()))
paths = [[] for i in range(M)]
visited = [False] * M
for i in range(M):
a, b = list(map(int, input().split()))
paths[a-1].append(b-1)
paths[b-1].append(a-1)
visited[0] = True
print(dfs(0, paths, visited, N))
if __name__ == "__main__":
main() |
s523501003 | p03805 | u092387689 | 1588750806 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3064 | 495 | from itertools import permutations
n,m = map(int,input().split())
#rel = [list(map(int,input().split())) for i in range(n)]
rel_t = [[False for i in range(n)] for j in range(n)]
for i in range(n):
a,b = map(int,input().split())
rel_t[a-1][b-1]=True
rel_t[b-1][a-1]=True
cnt=0
n_list = [i for i in range(n)]
for l in permutations(n_list,len(n_list)):
if(l[0]!=1):
continue
judge=[rel_t[l[i]][l[i+1]] for i in range(n-1)]
if all(judge):
cnt+=1
print(cnt) |
s779446457 | p03805 | u344065503 | 1588727242 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 389 | import itertools
n,m = map(int,input().split())
path=[[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(6), 6):
if i[0] == 0:
for j in range(n):
if j==n-1:
ans+=1
break
if not path[i[j]][i[j+1]]:
break
print(ans) |
s131948160 | p03805 | u344065503 | 1588727196 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 389 | import itertools
n,m = map(int,input().xplit())
path=[[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(6), 6):
if i[0] == 0:
for j in range(n):
if j==n-1:
ans+=1
break
if not path[i[j]][i[j+1]]:
break
print(ans) |
s290444346 | p03805 | u344065503 | 1588727149 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38256 | 389 | import itertools
n,m = map(int,input().xplit())
path=[[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0
for i in itertools.permutations(range(6), 6):
if i[0] == 0:
for j in range(n):
if j==n-1:
ans+=1
break
if not path[i[j-1]][i[j]]:
break
print(ans) |
s836262708 | p03805 | u091489347 | 1588724836 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 392 | n, m = map(int, input().split())
l = [[0 for _ in range(n)] for _ in range(n)]
for i in range(m):
a,b = map(int, input().split())
l[a-1][b-1] = 1
l[b-1][a-1] = 1
import itertools
li = [i for i in range(1,n)]
count = 0
for p in itertools.permutations(li, len(li)):
for i in range(len(p) -1)
if l[p[i]][p[i + 1]] == 0:
break
count += 1
print(count) |
s917800470 | p03805 | u390727364 | 1588625798 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 713 | def dfs(g, seen, n):
all_seen = True
for si in seen:
if si == False:
all_seen = False
if all_seen:
return 1
ans = 0
for m in g[n]:
if seen[m]:
continue
seen[m] = True
ans += dfs(g, seen, m)
seen[m] = False
return ans
def main():
n, m = map(int, stdin.readline().split())
ab = [map(int, stdin.readline().split()) for _ in range(n)]
g = [[] for _ in range(n)]
for abi in ab:
a, b = abi
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
seen = [False for _ in range(n)]
seen[0] = True
ans = dfs(g, seen, 0)
print(ans)
if __name__ == "__main__":
main()
|
s221473672 | p03805 | u390727364 | 1588625460 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 770 | from sys import stdin
def dfs(g, seen, n, ans):
all_seen = True
for si in seen:
if si == False:
all_seen = False
if all_seen:
ans += 1
return ans
for m in g[n]:
if seen[m]:
continue
seen[m] = True
ans = dfs(g, seen, m, ans)
seen[m] = False
return ans
def main():
n, m = map(int, stdin.readline().split())
ab = [map(int, stdin.readline().split()) for _ in range(n)]
g = [[] for _ in range(n)]
for abi in ab:
a, b = abi
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
seen = [False for _ in range(n)]
seen[0] = True
ans = 0
ans = dfs(g, seen, 0, ans)
print(ans)
if __name__ == "__main__":
main()
|
s499821726 | p03805 | u390727364 | 1588625427 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 746 | def dfs(g, seen, n, ans):
all_seen = True
for si in seen:
if si == False:
all_seen = False
if all_seen:
ans += 1
return ans
for m in g[n]:
if seen[m]:
continue
seen[m] = True
ans = dfs(g, seen, m, ans)
seen[m] = False
return ans
def main():
n, m = map(int, stdin.readline().split())
ab = [map(int, stdin.readline().split()) for _ in range(n)]
g = [[] for _ in range(n)]
for abi in ab:
a, b = abi
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
seen = [False for _ in range(n)]
seen[0] = True
ans = 0
ans = dfs(g, seen, 0, ans)
print(ans)
if __name__ == "__main__":
main()
|
s919501787 | p03805 | u390727364 | 1588624349 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 743 | from sys import stdin
def dfs(g, seen, n):
all_seen = True
for si in seen:
if si == False:
all_seen = False
if all_seen:
return 1
count = 0
for m in g[n]:
if seen[m]:
continue
seen[m] = True
count += dfs(g, seen, m)
seen[m] = False
return count
def main():
n, m = map(int, stdin.readline().split())
ab = [map(int, stdin.readline().split()) for _ in range(n)]
g = [[] for _ in range(n)]
for abi in ab:
a, b = abi
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
seen = [False for _ in range(n)]
seen[0] = True
ans = dfs(g, seen, 0)
print(ans)
if __name__ == "__main__":
main()
|
s242946836 | p03805 | u390727364 | 1588624301 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38512 | 743 | from sys import stdin
def dfs(g, seen, n):
all_seen = True
for si in seen:
if si == False:
all_seen = False
if all_seen:
return 1
count = 0
for m in g[n]:
if seen[m]:
continue
seen[m] = True
count += dfs(g, seen, m)
seen[m] = False
return count
def main():
n, m = map(int, stdin.readline().split())
ab = [map(int, stdin.readline().split()) for _ in range(n)]
g = [[] for _ in range(n)]
for abi in ab:
a, b = abi
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
seen = [False for _ in range(n)]
seen[0] = True
ans = dfs(g, seen, 0)
print(ans)
if __name__ == "__main__":
main()
|
s932242060 | p03805 | u761154175 | 1588621268 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3188 | 411 | import itertools
M, N = map(int, input().split())
lis = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
lis[a-1].append(b-1)
lis[b-1].append(a-1)
count = 0
for i in itertools.permutations(list(range(1,N)),N-1):
s = 0
for j in range(N-1):
if i[j] not in lis[s]:
break
s = i[j]
else:
count += 1
print(count) |
s079405042 | p03805 | u870841038 | 1588102924 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 493 | N, M = map(int, input().split()) #頂点, 辺
g = [[] for _ in range(M)] #iはjと繋がっている
for i in range(M):
u, v = map(int, input().split())
if u > v:
u, v = v, u
g[u-1].append(v-1)
g[v-1].append(u-1)
is_checked = [False] * N
def dfs(i):
cnt = 0
is_checked[i] = True
for j in g[i]:
if not(is_checked[j]):
dfs(j)
if not(False in is_checked):
cnt += 1
return cnt
ans = dfs(0)
print(ans) |
s905087904 | p03805 | u576432509 | 1587784639 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 920 | q=[]
qq=[]
def dfs(j,q,icnt,count,n,qq):
if len(qq)==n:
count+=1
# print("1",n,j,icnt,count,q[j],qq)
return count
icnt+=1
for j2 in q[j]:
if not j2 in qq:
qq.append(j2)
# print("2",n,j,icnt,count,q[j],qq)
count=dfs(j2,q,icnt,count,n,qq)
qq.pop()
# print("3",n,j,icnt,count,q[j],qq)
return count
n,m=map(int,input().split())
q=[[0]*2 for i in range(m)]
for i in range(m):
q[i]=list(map(int,input().split()))
#n=3
#m=3
#ab=[[1,2],[1,3],[2,3]]
#n=7
#m=7
#ab=[[1,3],[2,7],[3,4],[4,5],[4,6],[5,6],[6,7]]
q=[[]*2 for i in range(n)]
for i in range(m):
if not q[ab[i][1]-1] in q[ab[i][0]-1]:
q[ab[i][0]-1].append(ab[i][1]-1)
if not q[ab[i][0]-1] in q[ab[i][1]-1]:
q[ab[i][1]-1].append(ab[i][0]-1)
#print(q)
count=0
j=0
qq=[j]
icnt=1
count=dfs(j,q,icnt,count,n,qq)
print(count)
|
s596676646 | p03805 | u576432509 | 1587784563 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 919 | q=[]
qq=[]
def dfs(j,q,icnt,count,n,qq):
if len(qq)==n:
count+=1
# print("1",n,j,icnt,count,q[j],qq)
return count
icnt+=1
for j2 in q[j]:
if not j2 in qq:
qq.append(j2)
# print("2",n,j,icnt,count,q[j],qq)
count=dfs(j2,q,icnt,count,n,qq)
qq.pop()
# print("3",n,j,icnt,count,q[j],qq)
return count
n,m=map(int,input().split())
q=[[0]*2 for i in range(m)]
for i in range(m):
q[i]=set(map(int,input().split()))
#n=3
#m=3
#ab=[[1,2],[1,3],[2,3]]
#n=7
#m=7
#ab=[[1,3],[2,7],[3,4],[4,5],[4,6],[5,6],[6,7]]
q=[[]*2 for i in range(n)]
for i in range(m):
if not q[ab[i][1]-1] in q[ab[i][0]-1]:
q[ab[i][0]-1].append(ab[i][1]-1)
if not q[ab[i][0]-1] in q[ab[i][1]-1]:
q[ab[i][1]-1].append(ab[i][0]-1)
#print(q)
count=0
j=0
qq=[j]
icnt=1
count=dfs(j,q,icnt,count,n,qq)
print(count)
|
s854971830 | p03805 | u379716238 | 1587707310 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 532 | N, M = map(int, input().split())
adj_matrix = [[0]*N for _ in range(N)]
for i in range(N):
a, b = map(int, input().split())
adj_matrix[a-1][b-1] = 1
adj_matrix[b-1][a-1] = 1
def dfs(v, used):
if not False in used:
return 1
ans = 0
for i in range(N):
if not adj_matrix[v][i]:
continue
if used[i]:
continue
used[i] = True
ans += dfs(i, used)
used[i] = False
return ans
used = [False] * N
used[0] = True
print(dfs(0, used)) |
s270701463 | p03805 | u038887660 | 1587670817 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 538 | N, M = map(int, input().split())
def add_node(a, b, dic):
if a-1 in dic.keys():
dic[a-1].append(b-1)
else:
dic[a-1] = [b-1]
def dfs(point, c):
global count
if c == N:
count +=1
return
if passlist[point] == 1:
return
passlist[point] = 1
for n in node[point]:
dfs(n, c+1)
passlist[point] = 0
node = {}
for n in range(N):
a, b = map(int, input().split())
add_node(a, b, node)
add_node(b, a, node)
passlist = [0]*N
count = 0
dfs(0, 0)
print(count) |
s451831342 | p03805 | u038887660 | 1587670421 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 514 | N, M = map(int, input().split())
def add_node(a, b, dic):
if a-1 in dic.keys():
dic[a-1].append(b-1)
else:
dic[a-1] = [b-1]
def dfs(point, c):
global count
if c == N:
count +=1
return
if passlist[point] == 1:
return
passlist[point] = 1
for n in node[point]:
dfs(n, c+1)
node = {}
for n in range(N):
a, b = map(int, input().split())
add_node(a, b, node)
add_node(b, a, node)
passlist = [0]*N
count = 0
dfs(0, 0)
print(count) |
s385658301 | p03805 | u038887660 | 1587669988 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 508 | N, M = map(int, input().split())
def add_node(a, b, dic):
if a in dic.keys():
dic[a].append(b)
else:
dic[a] = [b]
def dfs(point, c):
global count
if c == N:
count +=1
return
if passlist[point-1] == 1:
return
passlist[point-1] = 1
for n in node[point]:
dfs(n, c+1)
node = {}
for n in range(N):
a, b = map(int, input().split())
add_node(a, b, node)
add_node(b, a, node)
passlist = [0]*N
count = 0
dfs(1, 0)
print(count) |
s619121648 | p03805 | u379716238 | 1587612515 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 482 | import itertools
N, M = map(int, input().split())
adj_matrix = [[0]*N for _ in range(N)]
# 隣接行列を作る
for i in range(N):
a, b = map(int, input().split())
adj_matrix[a-1][b-1] = 1
adj_matrix[b-1][a-1] = 1
cnt = 0
for each in itertools.permutations(range(N)):
if each[0] != 0: # 始点は1でないといけないから
break
factor = 1
for i in range(N-1):
factor *= adj_matrix[each[i]][each[i+1]]
cnt += factor
print(cnt) |
s554589871 | p03805 | u379716238 | 1587612207 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 462 | import itertools
N, M = map(int, input().split())
adj_matrix = [[0]*N for i in range(N)]
# 隣接行列を作る
for i in range(N):
a, b = map(int, input().split())
adj_matrix[a-1][b-1] = 1
adj_matrix[b-1][a-1] = 1
cnt = 0
for each in itertools.permutations(range(N)):
if each[0] != 0: # 始点は1でないといけないから
break
factor = 1
for i in range(N-1):
factor *= adj_matrix[each[i]][each[i+1]]
cnt += factor
print(cnt) |
s732895564 | p03805 | u934868410 | 1587248580 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3316 | 418 | from collections import defaultdict
import itertools
n,m = map(int,input().split())
e = [[False]*n for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
e[a-1][b-1] = True
e[b-1][a-1] = True
ans = 0
l = [i for i in range(1,n)]
for p in itertools.permutations(l):
p = [0] + p
reach = 1
for i in range(n-1):
if not e[p[i]][p[i+1]]:
reach = 0
break
ans += reach
print(ans) |
s144085238 | p03805 | u201802797 | 1587233909 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 353 | from itertools import permutations
nim,mike = list(map(int,input().split()))
array = [list(map(int,input().split())) for i in range(mike)]
counter = 0
for i in permutations(range(1,nim+1)):
boo = True
if i[0]==1:
for i in range(nim-1):
if sorted([i[i],i[i+1]]) not in array:
boo = False
if boo:
counter+=1
print(counter) |
s397544594 | p03805 | u523545435 | 1587156191 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3064 | 712 | N,M=map(int,input().split())
G=[[False]*(M+1) for _ in range(N+1)]
for i in range(M):
a,b=map(int,input().split())
G[a][b]=True
G[b][a]=True
visited=[False]*(N+1)
visited[1]=True
def dfs(start):
global N
global visited
all_visited=True
sum=0
for p in range(1,N+1):
if not visited[p]:
all_visited=False
if all_visited:
return 1
else:
for next in range(1,N+1):#N小より全探索
if not G[start][next]:
continue
if visited[next]:
continue
visited[next]=True
sum+=dfs(next)
visited[next]=False #backtrack
return sum
print(dfs(1))
|
s222908465 | p03805 | u523545435 | 1587155961 | Python | Python (3.4.3) | py | Runtime Error | 38 | 3064 | 708 | N,M=map(int,input().split())
G=[[False]*(M+1) for _ in range(N+1)]
for i in range(M):
a,b=map(int,input().split())
G[a][b]=True
G[b][a]=True
visited=[False]*(N+1)
visited[1]=True
def dfs(start):
global N
global visited
all_visited=True
sum=0
for p in range(1,N+1):
if not visited[p]:
all_visited=False
if all_visited:
return 1
else:
for next in range(1,N+1):#N小より全探索
if not G[start][next]:
continue
if visited[next]:
continue
visited[next]=True
sum+=dfs(next)
visited[next]=False #backtrack
return sum
print(dfs(1))
|
s327901185 | p03805 | u971124021 | 1586752750 | Python | Python (3.4.3) | py | Runtime Error | 28 | 3064 | 450 | import itertools
n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(m)]
ab = [[False]*n for _ in range(n)]
for i in range(n):
ab[AB[i][0]-1][AB[i][1]-1] = 1
ab[AB[i][1]-1][AB[i][0]-1] = 1
ans = 0
for que in itertools.permutations(range(n), n):
if que[0] == 0:
for k in range(n):
if k == n-1:
ans += 1
else:
if ab[que[k]][que[k+1]] != 1:
break
print(ans) |
s939219594 | p03805 | u971124021 | 1586752205 | Python | Python (3.4.3) | py | Runtime Error | 34 | 3064 | 448 | import itertools
n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(m)]
ab = [[False]*n for _ in range(n)]
for i in range(n):
ab[AB[i][0]-1][AB[i][1]-1] = 1
ab[AB[i][1]-1][AB[i][0]-1] = 1
ans = 0
for i in itertools.permutations(range(n), n):
if i[0] == 0:
que = i
cnt = 1
for k in range(n-1):
if ab[que[k]][que[k+1]] == 1:
cnt += 1
if cnt == n:
ans += 1
print(ans) |
s675005553 | p03805 | u971124021 | 1586744825 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 444 | import itertools
n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(m)]
ab = [[] for _ in range(n)]
for i in range(n):
ab[AB[i][0]-1].append(AB[i][1]-1)
ab[AB[i][1]-1].append(AB[i][0]-1)
ans = 0
for i in itertools.permutations(range(n), n):
if i[0] == 0:
que = i
cnt = 1
for k in range(n-1):
if que[k+1] in ab[que[k]]:
cnt += 1
if cnt == n:
ans += 1
print(ans) |
s202536144 | p03805 | u476124554 | 1586739159 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 494 | import sys
sys.setrecursionlimit(10**6)
n,m = map(int,(input().split()))
graph = [[] for i in range(m)]
flg = [0 for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1)
ans = [0]
def dfs(v):
if all(flg):
ans[0] +=1
return 0
for i in graph[v]:
flg[v] = 1
if flg[i] == 0:
flg[i] = 1
dfs(i)
flg[i] = 0
return 0
dfs(0)
print(ans[0]) |
s251257026 | p03805 | u476124554 | 1586738932 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 454 | n,m = map(int,(input().split()))
graph = [[] for i in range(m)]
flg = [0 for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1)
ans = [0]
def dfs(v):
if all(flg):
ans[0] +=1
return 0
for i in graph[v]:
flg[v] = 1
if flg[i] == 0:
flg[i] = 1
dfs(i)
flg[i] = 0
return 0
dfs(0)
print(ans[0]) |
s991512252 | p03805 | u693391925 | 1586486628 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3444 | 821 | #最初に置いておくもの
import copy
import sys
sys.setrecursionlimit(50000000)
#入出力関係
N, M = map(int, input().split())
l = []
for i in range(N):
l.append(list(map(lambda x: int(x)-1 , input().split())))
lis = [[] for i in range(N)]
for i in range(M):
lis[l[i][0]].append(l[i][1])
lis[l[i][1]].append(l[i][0])
def dfs():
re=0
q1 =[[0]*N]
q2=[0]
while len(q1) != 0:
visited=q1.pop()
v=q2.pop()
visited[v]=1
if all(visited[c]==1 for c in range(N)):
re += 1
elif len(lis[v]) != 0:
for i in lis[v]:
if visited[i] == 0:
hoge=copy.deepcopy(visited)
q1.append(hoge)
q2.append(i)
return re
print(dfs())
|
s495246799 | p03805 | u693391925 | 1586486513 | Python | Python (3.4.3) | py | Runtime Error | 27 | 4080 | 907 | #最初に置いておくもの
import queue
import copy
import sys
from astropy.io.fits.convenience import append
sys.setrecursionlimit(50000000)
input=sys.stdin.readline
#入出力関係
N, M = map(int, input().split())
l = []
for i in range(M):
l.append(list(map(lambda x: int(x)-1 , input().split())))
lis = [[] for i in range(N)]
for i in range(M):
lis[l[i][0]].append(l[i][1])
lis[l[i][1]].append(l[i][0])
def dfs():
re=0
q1 =[[0]*N]
q2=[0]
while len(q1) != 0:
visited=q1.pop()
v=q2.pop()
visited[v]=1
if all(visited[c]==1 for c in range(N)):
re += 1
elif len(lis[v]) != 0:
for i in lis[v]:
if visited[i] == 0:
hoge=copy.deepcopy(visited)
q1.append(hoge)
q2.append(i)
return re
print(dfs())
|
s139771221 | p03805 | u185896732 | 1586484094 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 485 | import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
n,m=map(int,input().split())
G=[[False]*n for _ in range(n)]
used=[False]*n
def dfs(now,depth):
if used[now]:
return 0
if n==depth:
return 1
used[now]=True
ans=0
for i in range(n):
if G[now][i]:
ans+=dfs(i,depth+1)
used[now]=False
return ans
for _ in range(n):
a,b=map(int,input().split())
G[a-1][b-1]=True
G[b-1][a-1]=True
print(dfs(0,1)) |
s684873941 | p03805 | u227082700 | 1586481218 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 335 | n,m=map(int,input().split())
edge=[n*[0]for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
a-=1
b-=1
edge[a][b]=edge[b][a]=1
from itertools import permutations
ans=0
for i in permutations([j for j in range(1,n)],n-1):
f=True
t=[0]+i
for j in range(1,n):
if edge[t[j-1]][t[j]]==0:f=False
if f:ans+=1
print(ans) |
s581598895 | p03805 | u787449825 | 1586475931 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 481 | from itertools import permutations
n, m = map(int, input().split())
ans = 0
path = [[False]*n for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
for i in permutations(range(n), n):
if i[0] == 0:
for j in range(n):
if j == n - 1:
ans += 1
break
if not path[i[j]][i[j+1]]:
break
print(ans)
|
s568000202 | p03805 | u787449825 | 1586475887 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 476 | from itertools import permutations
n, m = map(int, input().split())
ans = 0
path = [[False]*n for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
for i in permutations(range(n), n):
if i[0] == 0:
for j in range(n):
if j == 1:
ans += 1
break
if not path[i[j]][i[j+1]]:
break
print(ans) |
s244942967 | p03805 | u787449825 | 1586475621 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3064 | 463 | from itertools import permutations
n, m = map(int, input().split())
ans = 0
path = [[False]*n for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
for i in permutations(range(n), n):
if i[0] == 0:
for j in range(n):
if not path[i[j]][i[j+1]]:
break
if j == n-1:
ans += 1
break
print(ans)
|
s826206354 | p03805 | u100665987 | 1586425980 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 566 | import itertools
n,m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(m)]
#ab=Input.split()
#d：隣接行列
print(ab)
print(type(ab))
d = [[] for i in range(n)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
d[a-1].append(b-1)
d[b-1].append(a-1)
#per：順列列挙
per= list(itertools.permutations(range(1,n)))
cnt=0
for i in range(len(per)):
x = [0]+per[i]
for j in range(n):
#隣接していなければ終了
if not x[j+1] in d[x[j]]:
break
cnt+=1
print(cnt)
|
s452903305 | p03805 | u100665987 | 1586425952 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38640 | 568 | import itertools
n,m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(m)]
#ab=Input.split()
#d：隣接行列
print(ab)
print(type(ab))
d = [[] for i in range(n)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
d[a-1].append(b-1)
d[b-1].append(a-1)
#per：順列列挙
per= list(itertools.permutations(range(1,n)))
cnt=0
for i in range(len(graph)):
x = [0]+per[i]
for j in range(n):
#隣接していなければ終了
if not x[j+1] in d[x[j]]:
break
cnt+=1
print(cnt)
|
s659748486 | p03805 | u100665987 | 1586425919 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38512 | 570 | import itertools
n,m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(m)]
#ab=Input.split()
#d：隣接行列
print(ab)
print(type(ab))
d = [[] for i in range(n)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
d[a-1].append(b-1)
d[b-1].append(a-1)
#per：順列列挙
per= list(itertools.permutations(range(1,n)))
cnt=0
for i in range(len(graph)):
x = [0]+graph[i]
for j in range(n):
#隣接していなければ終了
if not x[j+1] in d[x[j]]:
break
cnt+=1
print(cnt)
|
s643885586 | p03805 | u100665987 | 1586425633 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38384 | 526 | n,m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(m)]
#ab=Input.split()
#d：隣接行列
d = [[] for i in range(n)]
for i in range(m):
a = ab[i][0]
b = ab[i][1]
d[a-1].append(b-1)
d[b-1].append(a-1)
#per：順列列挙
per= list(itertools.permutations(range(1,n)))
cnt=0
for i in range(len(graph)):
x = [0]+graph[i]
for j in range(n):
#隣接していなければ終了
if not x[j+1] in d[x[j]]:
break
cnt+=1
print(cnt)
|
s515633621 | p03805 | u840310460 | 1586282061 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 459 | N,M = map(int, input().split())
L = [list(map(int,input().split())) for _ in range(M)]
graph = [[False] * (N + 1) for _ in range(N + 1)]
#%%
for i in L:
graph[i[0]][i[1]] = True
graph[i[1]][i[0]] = True
graph[0][1] = True
graph[1][0] = True
#%%
ans = 0
for i in permutations(range(1, N + 1)):
if i[0] != 1:
continue
for j in range(1, N):
if not graph[i[j - 1]][i[j]]:
break
else:
ans += 1
print(ans)
|
s174679062 | p03805 | u301624971 | 1586282028 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 830 | import itertools
import sys
N,M=map(int,input().split())
dic={}
for _ in range(N):
a,b=map(int,input().split())
if(a in dic.keys()):
if((b in dic[a])==False):
dic[a].append(b)
else:
dic[a]=[b]
if(b in dic.keys()):
if((a in dic.values())==False):
dic[b].append(a)
else:
dic[b]=[a]
if(M==0):
print(0)
sys.exit()
node=[i for i in range(N)]
ans=0
strokes=itertools.permutations(node,M)
def judge(A,B):
values=dic[A]
if(B in values):
return True
else:
return False
for stroke in strokes:
stroke=list(stroke)
if(stroke[0]==0):
pre=stroke.pop(0) + 1
for s in stroke:
if(judge(pre,s+1)==False):
break
pre=s+1
else:
ans+=1
print(ans)
|
s666068605 | p03805 | u301624971 | 1586281525 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3064 | 752 | import itertools
import sys
N,M=map(int,input().split())
dic={}
for _ in range(N):
a,b=map(int,input().split())
if(a in dic.keys()):
dic[a].append(b)
else:
dic[a]=[b]
if(b in dic.keys()):
dic[b].append(a)
else:
dic[b]=[a]
if(M==0):
print(0)
sys.exit()
node=[i for i in range(N)]
ans=0
strokes=itertools.permutations(node,M)
def judge(A,B):
values=dic[A]
if(B in values):
return True
else:
return False
for stroke in strokes:
stroke=list(stroke)
if(stroke[0]==0):
pre=stroke.pop(0) + 1
for s in stroke:
if(judge(pre,s+1)==False):
break
pre=s+1
else:
ans+=1
print(ans) |
s005904709 | p03805 | u301624971 | 1586281188 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3064 | 705 | import itertools
N,M=map(int,input().split())
dic={}
for _ in range(N):
a,b=map(int,input().split())
if(a in dic.keys()):
dic[a].append(b)
else:
dic[a]=[b]
if(b in dic.keys()):
dic[b].append(a)
else:
dic[b]=[a]
node=[i for i in range(N)]
ans=0
strokes=itertools.permutations(node,M)
def judge(A,B):
values=dic[A]
if(B in values):
return True
else:
return False
for stroke in strokes:
stroke=list(stroke)
if(stroke[0]==0):
pre=stroke.pop(0) + 1
for s in stroke:
if(judge(pre,s+1)==False):
break
pre=s+1
else:
ans+=1
print(ans) |
s066789998 | p03805 | u015597249 | 1586107586 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 945 | from collections import defaultdict
# dfs, check path len, count paths
# test = 2
n, m = map(int, input().split())
edges = [map(int, input().split()) for i in range(n)]
graph = defaultdict(list)
for k,v in edges:
graph[k].append(v)
graph[v].append(k)
cnt = 0
# dfs
def dfs(node, visited):
global cnt
if node in visited:
return None
elif len(visited) + 1 == n:
cnt += 1
return None
else:
for v in graph[node]:
dfs(v, visited+[node])
dfs(1, [])
print(cnt)
|
s905789626 | p03805 | u519939795 | 1585919537 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 9 | Not found |
s387818660 | p03805 | u756195685 | 1585543817 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 688 | import math
import itertools
def main():
N, M = map(int, input().split())
P = [list(map(int, input().split())) for i in range(M)]
result = 0
for L in itertools.permutations(list(range(M))):
remain = list(range(1, N+1))
next = 1
for j in range(len(L)):
if next == P[L[j]][0]:
remain.remove(next)
next = P[L[j]][1]
elif next == P[L[j]][1]:
remain.remove(next)
next = P[L[j]][0]
else:
break
if len(remain) == 0:
result += 1
break
print(result)
if __name__ == "__main__":
main()
|
s600263420 | p03805 | u756195685 | 1585543671 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 558 | import math
import itertools
N, M = map(int, input().split())
P = [list(map(int, input().split())) for i in range(M)]
result = 0
for L in itertools.permutations(list(range(M))):
remain = list(range(1, N+1))
next = 1
for j in range(len(L)):
if next == P[L[j]][0]:
remain.remove(next)
next = P[L[j]][1]
elif next == P[L[j]][1]:
remain.remove(next)
next = P[L[j]][0]
else:
break
if len(remain) == 0:
result += 1
break
print(result)
|
s295053727 | p03805 | u888337853 | 1585530978 | Python | Python (3.4.3) | py | Runtime Error | 47 | 5640 | 1550 | import math
import copy
from copy import deepcopy
import sys
import fractions
# import numpy as np
from functools import reduce
# import statistics
import decimal
import heapq
import collections
import itertools
from operator import mul
sys.setrecursionlimit(100001)
# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)
# ===FUNCTION===
def getInputInt():
inputNum = int(input())
return inputNum
def getInputListInt():
outputData = []
inputData = input().split()
outputData = [int(n) for n in inputData]
return outputData
def getSomeInputInt(n):
outputDataList = []
for i in range(n):
inputData = int(input())
outputDataList.append(inputData)
return outputDataList
def getSomeInputListInt(n):
inputDataList = []
outputDataList = []
for i in range(n):
inputData = input().split()
inputDataList = [int(n) - 1 for n in inputData]
outputDataList.append(inputDataList)
return outputDataList
# ===CODE===
n, m = map(int, input().split())
d = getSomeInputListInt(n)
path = []
for p in itertools.permutations(range(1, n), n-1):
tmp = (0,) + p
path.append(tmp)
def pathsearch(a, b):
flga = False
for tmp_d in d:
if a in tmp_d and b in tmp_d:
flga = True
break
return flga
ans = 0
for p in path:
flg = True
for i in range(1, n, 1):
tmp = pathsearch(p[i - 1], p[i])
if not tmp:
flg = False
break
if flg:
ans += 1
print(ans)
|
s124210061 | p03805 | u888337853 | 1585530410 | Python | Python (3.4.3) | py | Runtime Error | 48 | 5684 | 1547 | import math
import copy
from copy import deepcopy
import sys
import fractions
# import numpy as np
from functools import reduce
# import statistics
import decimal
import heapq
import collections
import itertools
from operator import mul
sys.setrecursionlimit(100001)
# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)
# ===FUNCTION===
def getInputInt():
inputNum = int(input())
return inputNum
def getInputListInt():
outputData = []
inputData = input().split()
outputData = [int(n) for n in inputData]
return outputData
def getSomeInputInt(n):
outputDataList = []
for i in range(n):
inputData = int(input())
outputDataList.append(inputData)
return outputDataList
def getSomeInputListInt(n):
inputDataList = []
outputDataList = []
for i in range(n):
inputData = input().split()
inputDataList = [int(n) - 1 for n in inputData]
outputDataList.append(inputDataList)
return outputDataList
# ===CODE===
n, m = map(int, input().split())
d = getSomeInputListInt(n)
path = []
for p in itertools.permutations(range(1, n), n-1):
tmp = (0,) + p
path.append(tmp)
def pathsearch(a, b):
flg = False
for tmp_d in d:
if a in tmp_d and b in tmp_d:
flg = True
break
return flg
ans = 0
for p in path:
flg = True
for i in range(1, n, 1):
tmp = pathsearch(p[i - 1], p[i])
if not tmp:
flg = False
break
if flg:
ans += 1
print(ans)
|
s520845284 | p03805 | u540877546 | 1585466825 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 468 | import sys
sys.setrecursionlimit(10 ** 6)
n, m = list(map(int, input().split()))
data = [[] for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
data[a-1].append(b-1)
data[b-1].append(a-1)
ans = 0
def dfs(pos, cnt, his):
global ans
his[pos] = 1
if cnt == n:
if sum(his) == n:
ans += 1
return
for next in data[pos]:
dfs(next, cnt+1, his[:])
return
dfs(0, 1, [0]*n)
print(ans)
|
s191937464 | p03805 | u540877546 | 1585466346 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 490 | import sys
sys.setrecursionlimit(10 ** 6)
n, m = list(map(int, input().split()))
data = [[] for _ in range(n)]
done = [False for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
data[a-1].append(b-1)
data[b-1].append(a-1)
ans = 0
def dfs(pos, cnt, his):
global ans
his[pos] = 1
if cnt == n:
if sum(his) == n:
ans += 1
return
for next in data[pos]:
dfs(next, cnt+1, his[:])
dfs(0, 1, [0]*n)
print(ans)
|
s587559067 | p03805 | u540877546 | 1585465815 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38384 | 394 | n, m = list(map(int, input().split()))
data = [[] for _ in range(n)]
done = [False for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
data[a-1].append(b-1)
ans = 0
def dfs(pos, cnt):
global ans
done[pos] = True
if cnt >= n-1:
ans += 1
for next in data[pos]:
if not done[next]:
dfs(next, cnt+1)
dfs(0, 0)
print(ans+1)
|
s762066558 | p03805 | u540877546 | 1585465705 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 410 | n, m = list(map(int, input().split()))
data = [[] for _ in range(n)]
done = [False for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
data[a-1].append(b-1)
def dfs(pos, cnt):
done[pos] = True
if cnt >= n-1:
return 1
ans = 0
for next in data[pos]:
if not done[next]:
ans += dfs(next, cnt+1)
return ans
ans = dfs(0, 0)
print(ans+1)
|
s950695826 | p03805 | u968846084 | 1585186101 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 392 | n,m=map(int,input().split())
A=[["."]*n for i in range(n)]
B=[["."]*m for i in range(m)]
for i in range(n):
A[i]=list(input())
for i in range(m):
B[i]=list(input())
for i in range(n-m+1):
for j in range(n-m+1):
a=0
for x in range(m):
for y in range(m):
if A[i+x][j+y]!=B[x][y]:
a=1
break
if a==0:
print("Yes")
exit()
print("No") |
s762285659 | p03805 | u488401358 | 1585094758 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 562 | N,M=map(int,input().split())
hen=[[] for i in range(0,N)]
for i in range(0,N):
a,b=map(int,input().split())
hen[a-1].append(b-1)
hen[b-1].append(a-1)
def onestrokepath(start,visited=[]):
flag=0
count=0
for next in hen[start]:
if not next in visited:
flag=1
count+=onestrokepath(next,visited+[next])
if flag==0:
check=[i for i in range(0,N)]
visited.sort()
if check==visited:
return 1
else:
return 0
return count
print(onestrokepath(0,[0]))
|
s448684158 | p03805 | u841623074 | 1585004716 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 660 | def bit_DP(N.Adj):
dp=[[0]*N for i in range(1<<N)]
dp[1][0]=1
for S in range(1<<N):
for v in range(N):
if (S&(1<<v))==0:
continue
sub=S^(1<<v)
for u in range(N):
if (sub&(1<<u)) and (Adj[u][v]):
dp[S][v]+=dp[sub][u]
ans=sum(dp[(1<<N)-1][u] for u in range(1,N))
return ans
def main():
N,M=map(int,input().split())
Adj=[[0]*N for i in range(N)]
for _ in range(M):
a,b=map(int,input().split())
Adj[a-1][b-1]=1
Adj[b-1][a-1]=1
ans=bit_dp(N,Adj)
print(ans)
if __name__=='__main__':
main() |
s594889353 | p03805 | u934442292 | 1584922029 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 645 | # https://img.atcoder.jp/abc054/editorial.pdf
N, M = map(int, input().split())
graph = [[False for _ in range(N)] for i in range(N)]
for i in range(N):
a, b = map(int, input().split())
graph[a-1][b-1] = graph[b-1][a-1] = True
def dfs(v, visited):
all_visited = True
for i in range(N):
if not visited[i]:
all_visited = False
if all_visited:
return 1
ret = 0
for i in range(N):
if not graph[v][i]: continue
if visited[i]: continue
visited[i] = True
ret += dfs(i, visited)
visited[i] = False
return ret
visited = [False] * N
visited[0] = True
ans = dfs(0, visited)
print(ans)
|
s102420300 | p03805 | u256833330 | 1584908948 | Python | Python (3.4.3) | py | Runtime Error | 77 | 4208 | 727 | n,m=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(m)]
l.sort(key=lambda l:(l[0]))
c=0
used=[]
def find_num(itr,target):
for j in range(itr, m):
if target in l[j]:
next_target=[k for k in l[j] if k!=target][0]
used.append(next_target)
if len(used) == n:
return True
if find_num(j,next_target):
return True
else:
return False
return False
for i in range(m):
used=[]
if 1 in l[i]:
used.append(1)
next_target = [k for k in l[i] if k != 1][0]
used.append(next_target)
rtn=find_num(i, next_target)
if rtn:
c+=1
print(c)
|
s723143389 | p03805 | u822961851 | 1584499520 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 492 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0] * n for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
S[a - 1][b - 1] = 1
S[b - 1][a - 1] = 1
ans = 0
for p in itertools.permutations(range(n)):
if p[0] != 0:
break
tmp = 1
for i, v in enumerate(n-1):
tmp *= S[p[i]][p[i + 1]]
ans += tmp
print(ans)
if __name__ == '__main__':
resolve() |
s202470872 | p03805 | u822961851 | 1584499120 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3064 | 525 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0] * m for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
S[a - 1][b - 1] = 1
S[b - 1][a - 1] = 1
ans = 0
for p in itertools.permutations(range(n)):
if p[0] != 0:
break
tmp = 1
for i in range(n-1):
tmp *= S[p[i]][p[i + 1]]
if tmp == 0:
break
ans += tmp
print(ans)
if __name__ == '__main__':
resolve() |
s217993614 | p03805 | u822961851 | 1584499036 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3064 | 581 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0] * m for i in range(m)]
for i in range(m):
a, b = map(int, input().split())
S[a - 1][b - 1] = 1
S[b - 1][a - 1] = 1
ans = 0
for p in itertools.permutations(range(n)):
if p == (0, 2, 3, 4, 5, 6, 1):
pass
if p[0] != 0:
break
tmp = 1
for i in range(n-1):
tmp *= S[p[i]][p[i + 1]]
if tmp == 0:
break
ans += tmp
print(ans)
if __name__ == '__main__':
resolve() |
s391067835 | p03805 | u822961851 | 1584498898 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 654 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0] * m for i in range(m)]
MOD = (10 ** 9) + 7
for i in range(m):
a, b = map(int, input().split())
S[a - 1][b - 1] = 1
S[b - 1][a - 1] = 1
ans = 0
for p in itertools.permutations(range(m)):
if p == (0, 2, 3, 4, 5, 6, 1):
pass
if p[0] != 0:
break;
tmp = 1
for i, v in enumerate(p):
if i + 1 < m:
tmp *= S[v][p[i + 1]]
if tmp == 0:
break;
ans += tmp
print(ans % MOD)
if __name__ == '__main__':
resolve() |
s120644548 | p03805 | u822961851 | 1584498518 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 506 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0]*m for i in range(m)]
for i in range(m):
a, b = map(int, input().split())
S[a-1][b-1] = 1
S[b-1][a-1] = 1
ans = 0
for p in itertools.permutations(range(n)):
if p[0] != 0:
break;
tmp = 1
for i, v in enumerate(p):
if i > m:
tmp *= S[[i+1]][p[i+1]]
ans += tmp
print(ans)
if __name__ == '__main__':
resolve() |
s564047712 | p03805 | u822961851 | 1584497686 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 637 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0]*m for i in range(m)]
MOD = (10 ** 9) + 7
for i in range(m):
a, b = map(int, input().split())
S[a-1][b-1] = 1
S[b-1][a-1] = 1
ans = 0
for p in itertools.permutations(range(0, m)):
if p == (0,2,3,4,5,6,1):
pass
if p[0] != 0:
break;
tmp = 1
for i, v in enumerate(p):
if i + 1 < m:
tmp *= S[v][p[i+1]]
if tmp == 0:
break;
ans += tmp
print(ans % MOD)
if __name__ == '__main__':
resolve() |
s225334039 | p03805 | u822961851 | 1584497609 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2106 | 42300 | 589 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0]*m for i in range(m)]
MOD = (10 ** 9) + 7
for i in range(m):
a, b = map(int, input().split())
S[a-1][b-1] = 1
S[b-1][a-1] = 1
ans = 0
for p in itertools.permutations(range(0, m)):
if p == (0,2,3,4,5,6,1):
pass
if p[0] != 0:
break;
tmp = 1
for i, v in enumerate(p):
if i + 1 < m:
tmp *= S[v][p[i+1]]
ans += tmp
print(ans % MOD)
if __name__ == '__main__':
resolve() |
s674228612 | p03805 | u822961851 | 1584497520 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 593 | import itertools
def resolve():
n, m = map(int, input().split())
S = [[0]*m for i in range(m)]
MOD = (10 ** 9) + 7
for i in range(m):
a, b = map(int, input().split())
S[a-1][b-1] = 1
S[b-1][a-1] = 1
ans = 0
for p in itertools.permutations(range(0, m)):
if p == (0,2,3,4,5,6,1):
pass
if p[0] != 0:
break;
tmp = 1
for i, v in enumerate(p):
if i + 1 < m:
tmp *= S[v][p[i+1]]
ans += tmp
print(ans % MOD)
if __name__ == '__main__':
resolve() |
s582744565 | p03805 | u223663729 | 1584480910 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 404 | n, m = map(int, input().split())
G = [[] for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
a-=1; b-=1
G[a].append(b)
G[b].append(a)
flag = (1<<n)-1
def dfs(v=0, visited=1):
if visited == flag:
return 1
cnt = 0
for to in G[v]:
if visited & 1<<to:
continue
cnt += dfs(to, visited^(1<<to))
return cnt
print(dfs()) |
s256400868 | p03805 | u223663729 | 1584480899 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 404 | n, m = map(int, input().split())
G = [[] for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
a-=1; b-=1
G[a].append(b)
G[b].append(a)
flag = (1<<n)-1
def dfs(v=0, visited=1):
if visited == flag:
return 1
cnt = 0
for to in G[v]:
if visited & 1<<to:
continue
cnt += dfs(to, visited^(1<<to))
return cnt
print(dfs()) |
s506201732 | p03805 | u672898046 | 1584480406 | Python | Python (3.4.3) | py | Runtime Error | 35 | 3064 | 562 | N, M = map(int, input().split())
#無向行列
path_matrix = [[False]*N for _ in range(M)]
for _ in range(M):
line = map(int, input().split())
paths = [x-1 for x in line]
path_matrix[paths[0]][paths[1]] = True
path_matrix[paths[1]][paths[0]] = True
visited = [False]*N
def dfs(now, depth):
if visited[now]:
return 0
if depth == N-1:
return 1
visited[now] = True
total_paths = 0
for i in range(N):
if path_matrix[now][i]:
total_paths += dfs(i, depth+1)
visited[now] = False
return total_paths
print(dfs(0,0)) |
s499291993 | p03805 | u672898046 | 1584480360 | Python | Python (3.4.3) | py | Runtime Error | 35 | 3064 | 562 | N, M = map(int, input().split())
#無向行列
path_matrix = [[False]*N for _ in range(M)]
for _ in range(M):
line = map(int, input().split())
paths = [x-1 for x in line]
path_matrix[paths[0]][paths[1]] = True
path_matrix[paths[1]][paths[0]] = True
visited = [False]*N
def dfs(now, depth):
if visited[now]:
return 0
if depth == N-1:
return 1
visited[now] = True
total_paths = 0
for i in range(N):
if path_matrix[now][i]:
total_paths += dfs(i, depth+1)
visited[now] = False
return total_paths
print(dfs(0,0)) |
s724058556 | p03805 | u589381719 | 1584211505 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3316 | 472 | from collections import deque
N,M = map(int,input().split())
G=[[] for i in range(M+1)]
for i in range(M):
n,m=map(int,input().split())
G[n].append(m)
G[m].append(n)
visited=[0]*(N+1)
ans=0
def dfs(now, num_visited=0):
global ans
visited[now] = 1
num_visited+=1
if num_visited==N:
ans+=1
for i in G[now]:
next=i
if visited[next]!=1:dfs(next,num_visited)
visited[now] = 0
dfs(1)
print(ans) |
s054453500 | p03805 | u841623074 | 1584114451 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4212 | 722 | N,M=map(int,input().split())
import copy
a=[0]*M
b=[0]*M
for i in range(M):
a[i],b[i]=map(int,input().split())
D=[[1]]
def route(D):
E=[]
D1=copy.deepcopy(D)
for j in range(len(D)):
x=D[j][-1]
for i in range(M):
if a[i]==x:
if not b[i] in D1[j]:
D=copy.deepcopy(D1)
D[j].append(b[i])
E.append(D[j])
elif b[i]==x:
if not a[i] in D1[j]:
D=copy.deepcopy(D1)
D[j].append(a[i])
E.append(D[j])
return E
for i in range(N-1):
D=copy.deepcopy(route(D))
if len(D[0])!=N:
print(0)
exit()
print(len(D))
|
s590765174 | p03805 | u202826462 | 1584047516 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3064 | 486 | n, m = map(int, input().split())
graph = {i: [] for i in range(1, m + 1)}
for _ in range(m):
u, v = map(int, input().split())
graph[u].append(v)
graph[v].append(u)
def dfs(i):
ret = 0
if all(han):
return 1
for j in range(1, n + 1):
if han[j] == False and j in graph[i]:
han[j] = True
ret += dfs(j)
han[j] = False
return ret
han = [False] * (n + 1)
han[0] = True
han[1] = True
ans = dfs(1)
print(ans) |
s825364282 | p03805 | u013956357 | 1584040407 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 511 | [n,m] = [int(x) for x in input().split()]
data = [[int(x) for x in input().split()] for _ in range(m)]
total = 0
for x in itertools.permutations(range(2,n+1)):
route = [1,]+list(x)
for x in range(len(route)-1):
flg = False
for y in data:
if {route[x],route[x+1]} == set(y):
flg = True
break
if flg == False:
break
else:
total += 1
print(total)
|
s538992694 | p03805 | u101442050 | 1583962063 | Python | PyPy3 (2.4.0) | py | Runtime Error | 227 | 45296 | 457 | import itertools
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
#M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
#print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s437386583 | p03805 | u101442050 | 1583962005 | Python | Python (3.4.3) | py | Runtime Error | 46 | 8052 | 457 | import itertools
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
#M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
#print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s175036633 | p03805 | u101442050 | 1583961442 | Python | Python (3.4.3) | py | Runtime Error | 243 | 17008 | 475 | import itertools
import numpy as np
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
#print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s432548054 | p03805 | u101442050 | 1583961396 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38484 | 475 | import itertools
import numpy as np
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
#print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s912162744 | p03805 | u101442050 | 1583961341 | Python | Python (3.4.3) | py | Runtime Error | 295 | 20676 | 474 | import itertools
import numpy as np
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s667767329 | p03805 | u101442050 | 1583961304 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 474 | import itertools
import numpy as np
n,m = map(int,input().split())
M = [[0] * n for i in range(m)]
for i in range(m):
a,b = map(int,input().split())
M[a-1][b-1] = 1
couse = list(itertools.permutations(range(n)))
result = 0
M = np.array(M)
for c in couse:
con = 0
if(c[0] == 0):
for i in range(len(c)-1):
if(M[c[i]][c[i+1]] == 1 or M[c[i+1]][c[i]] == 1):
con += 1
print(c[i],c[i+1])
if (len(c)-1 == con):
result += 1
print(result) |
s039980076 | p03805 | u568576853 | 1583891692 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38384 | 356 | import itertools
for i in range(m):
a,b=map(int,input().split())
link[a-1].append(b-1)
link[b-1].append(a-1)
s=list(range(1,n))
res=0
for perm in list(itertools.permutations(s)):
last=0
ok=True
for i in range(n-1):
if perm[i] not in link[last]:
ok=False
break
else:
last=perm[i]
if ok==True:
res=res+1
print(res) |
s330232161 | p03805 | u568576853 | 1583891623 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38384 | 339 | for i in range(m):
a,b=map(int,input().split())
link[a-1].append(b-1)
link[b-1].append(a-1)
s=list(range(1,n))
res=0
for perm in list(itertools.permutations(s)):
last=0
ok=True
for i in range(n-1):
if perm[i] not in link[last]:
ok=False
break
else:
last=perm[i]
if ok==True:
res=res+1
print(res) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.