input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
... | n, m = list(map(int,input().split()))
G = [[] for _ in range(n)]
for i in range(m):
a,b = [int(x)-1 for x in input().split()]
G[a].append(b)
G[b].append(a)
SAW = [False] * n
def dfs(v,SAW):
global res
end = True
for i in range(n):
if not SAW[i] and i != v:
end =... | p03805 |
import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: list(map(int, read().split()))
in_s = lambda: readline().rstrip().deco... | import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: list(map(int, read().split()))
in_s = lambda: readline().rstrip().deco... | p03805 |
import sys
sys.setrecursionlimit(10000000)
import copy
n, m = list(map(int, input().split()))
graph = [list() for i in range(n+1)]
for i in range(m):
a, b = list(map(int, (input().split())))
graph[a] += [b]
graph[b] += [a]
ans = 0
def dfs(visited, now):
tv = copy.copy(visited)
tv[now-... | import copy
n, m = list(map(int, input().split()))
graph = [list() for i in range(n+1)]
for i in range(m):
a, b = list(map(int, (input().split())))
graph[a] += [b]
graph[b] += [a]
def dfs(visited, now):
tv = copy.copy(visited)
tv[now-1] = 1
if all(tv) == 1:
return 1
co... | p03805 |
# 頂点および辺の数を入力
N, M = list(map(int, input().split()))
# 辺のリストを作成
list_edge = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = list(map(int, input().split()))
list_edge[a].append(b)
list_edge[b].append(a)
# パス（リスト）のリストを初期化
list_path = [[1]]
# パスが存在する、かつパスの長さが頂点の数未満である場合に繰り返し
while list_path != ... | # 頂点および辺の数を入力
N, M = list(map(int, input().split()))
# 辺のリストを作成
list_edge = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = list(map(int, input().split()))
list_edge[a].append(b)
list_edge[b].append(a)
# パスの数を返す関数を定義
def count_path(node, path, list_edge, N):
# パスの数を初期化
count = 0
... | p03805 |
import os,re,sys,operator
from collections import Counter,deque
from operator import itemgetter
from itertools import accumulate,combinations,groupby
from sys import stdin,setrecursionlimit
from copy import deepcopy
import heapq
setrecursionlimit(10**6)
def dfs(now,depth):
global used
global gragh... | import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
n,m=list(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... | p03805 |
num_ver, num_edge = list(map(int,input().split()))
# 隣接行列
graph_mat = [[0]*num_ver for _ in range(num_ver)]
for i in range(num_edge):
start, goal = list(map(int,input().split()))
start -= 1
goal -= 1
graph_mat[start][goal] = 1
graph_mat[goal][start] = 1
visited = [0] * num_ver
#再帰関... | num_ver, num_edge = list(map(int,input().split()))
# 隣接行列
graph_mat = [[0]*num_ver for _ in range(num_ver)]
for i in range(num_edge):
start, goal = list(map(int,input().split()))
start -= 1
goal -= 1
graph_mat[start][goal] = 1
graph_mat[goal][start] = 1
visited = [0] * num_ver
def df... | p03805 |
from itertools import permutations
n_ver,n_edge = list(map(int,input().split()))
path_mat = [[0]*n_ver for _ in range(n_ver)]
for i in range(n_edge):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
path_mat[a][b] = 1
path_mat[b][a] = 1
ans = 0
vers = [i for i in range(n_ver)]
for path ... | import sys
sys.setrecursionlimit(10**7)
n_ver, n_edge = list(map(int,input().split()))
ad_ls = [[] for _ in range(n_ver)]
for i in range(n_edge):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
ad_ls[a].append(b)
ad_ls[b].append(a)
done_ls = [0] * n_ver
def dfs(ver):
done_ls[ver] ... | p03805 |
import itertools
n,m = list(map(int,input().split()))#頂点の数、辺の数
graph = [[False for i in range(n)] for j in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
graph[a][b] = True
graph[b][a] = True
ans = 0
for i in itertools.permutations(list(range(n))):
... | import itertools
n,m = list(map(int,input().split()))
path = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int,input().split()))
path[a].append(b)
path[b].append(a)
ans = 0
l = [i for i in range(2,n+1)]
for v in itertools.permutations(l,n-1):
flag = True
if v[0] not in pa... | p03805 |
import itertools
N,M=list(map(int,input().split()))
route=[list(map(int,input().split())) for _ in range(M)]
candidate=list(itertools.permutations(list(range(1,N+1))))
ans=0
for c in candidate:
if c[0]==1:
for i in range(N-1):
l=sorted([c[i], c[i+1]])
if l not in route:
break
... | import itertools
N, M = list(map(int, input().split()))
G = {k: set() for k in range(N+1)}
for _ in range(M):
a, b = list(map(int, input().split()))
# 無向グラフ
G[a].add(b)
G[b].add(a)
ans = 0
for p in itertools.permutations(list(range(2, N+1))):
c = 1
for n in p:
if n not in... | p03805 |
from collections import deque
N, M = list(map(int, input().split()))
V = []
for i in range(M):
a, b = list(map(int, input().split()))
V.append((a-1, b-1))
def bfs(G):
visited = [False] * N
visited[0] = True
que = deque([(0, -1, 0)])
r = 0
while que:
ci, p, d = que.pop... | import sys
sys.setrecursionlimit(1000000)
N, M = list(map(int, input().split()))
G = {k: [] for k in range(N)}
for _ in range(M):
a, b = list(map(int, input().split()))
# 無向グラフ
G[a-1].append(b-1)
G[b-1].append(a-1)
visited = [False]*N
visited[0] = True
def dfs(v):
if all(visited):
... | p03805 |
import sys
sys.setrecursionlimit(1000000)
N,M = list(map(int, input().split()))
P = [list(map(int, input().split())) for _ in range(M)]
vis_N = [-1]*(N+1)
count = 0
vis_N[1] = 1
def search(a):
global count,vis_N,vis_Nij
#print(count,vis_N)
if sum(vis_N)+1 == N:
count = count + 1
... | N, M = list(map(int, input().split()))
adj_matrix = [[0]* N for _ in range(N)]
for i in range(M):
a, b = list(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):
... | p03805 |
# 基本課題 3．経路探索の解を求める
#
# 5 つの地点 0 ～ 4 を結ぶ道路網が図のようにある ( 図は授業支援システム参照 )
# 始点を 0 とし終点を 4 とした時、0 から 4 に至る経路をすべて求めなさい。
# ただし、同じ地点を２度通ってはいけない
#
# -*- coding: utf-8 -*-
ANS2=[] #0から4までの経路列挙(2次元配列)
#引数
#G:道路網を表す2次元配列(隣接リスト)
#LT:今のところの経路(だんだん広げていく)(最初は[[0]])
#返り値
#広げられなくなるまで広げた経路
#副作用
#ANS2を更新
#ANS2:0から4までの経路
... | # 基本課題 3．経路探索の解を求める
#
# 5 つの地点 0 ～ 4 を結ぶ道路網が図のようにある ( 図は授業支援システム参照 )
# 始点を 0 とし終点を 4 とした時、0 から 4 に至る経路をすべて求めなさい。
# ただし、同じ地点を２度通ってはいけない
#
# -*- coding: utf-8 -*-
ANS2=[] #0から4までの経路列挙(2次元配列)
#引数
#G:道路網を表す2次元配列(隣接リスト)
#LT:今のところの経路(だんだん広げていく)(最初は[[0]])
#返り値
#広げられなくなるまで広げた経路
#副作用
#ANS2を更新
#ANS2:0から4までの経路
... | p03805 |
import copy
N, M = [ int(x) for x in input().split()]
class Node:
def __init__(self, id):
self.id = id
self.path = []
self.passed = False
def __str__(self):
return "id: " + str(self.id) + " path: " + str(self.path) + " passed: " + str(self.passed)
nodes = []
for i... | import copy
N, M = [ int(x) for x in input().split() ]
class Node:
def __init__(self, id):
self.id = id
self.path = []
def __str__(self):
return "id: " + str(self.id) + " path: " + str(self.path)
nodes = []
for i in range(N):
nodes.append(Node(i))
for i in range(M)... | p03805 |
import itertools
n, m=list(map(int, input().split()))
ab=[set(map(int, input().split())) for _ in range(m)]
root=list(itertools.permutations(ab, n-1))
cnt=0
for r in root:
trace=[i+1 for i in range(n)]
other=1
for i in range(0, n-1):
if other in r[i]:
try:
trac... | N, M = list(map(int, input().split()))
adj_matrix = [[0]* N for _ in range(N)]
for i in range(M):
a, b = list(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):
... | p03805 |
import itertools
n, m = list(map(int, input().split()))
path = [[False] * n for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
ans = 0
for i in itertools.permutations(list(range(n)), n):
# 頂点1が始点
... | def main():
N, M = list(map(int, input().split()))
matrix = [[0] * N for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
matrix[a-1][b-1] = 1
matrix[b-1][a-1] = 1
def dfs(v, used):
if False not in used:
return 1
... | p03805 |
import itertools
n, m = list(map(int, input().split()))
v = []
for i in range(m):
tpl = tuple(map(int, input().split()))
v.append(tpl)
v.append((tpl[1], tpl[0]))
perms = list(itertools.permutations(v, n-1))
c = 0
for i in perms:
if i[0][0] != 1:
continue
visited = []
for j in range(len(... | import itertools
n, m = list(map(int, input().split()))
v = []
for i in range(m):
tpl = tuple(map(int, input().split()))
v.append(tpl)
v.append((tpl[1], tpl[0]))
perms = list(itertools.permutations(list(range(1, n+1))))
c = 0
for i in perms:
if i[0] != 1:
continue
for j in range(len(i)-1):... | p03805 |
from itertools import permutations
n,m = list(map(int,input().split()))
D = [[0]*n for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
D[a-1][b-1] = 1
D[b-1][a-1] = 1
cnt = 0
for a in permutations(list(range(n))):
if a[0] != 0:
break
tmp = 1
for i in range(n-1):
tmp = tmp... | n,m = list(map(int, input().split()))
D = [list() for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
D[a-1].append(b-1)
D[b-1].append(a-1)
d = [0]*n
d[0] = 1
cnt = 0
def dfs(x):
global cnt
if all(d):
cnt += 1
return
for i in D[x]:
if d[i] == 0:
d... | p03805 |
def main():
N, M = (int(i) for i in input().split())
edge = [set() for _ in range(N)]
for i in range(M):
a, b = (int(i) for i in input().split())
edge[a-1].add(b-1)
edge[b-1].add(a-1)
from itertools import permutations
ans = 0
for p in permutations(list(range(1, ... | def main():
import sys
input = sys.stdin.buffer.readline
from itertools import permutations
N, M = (int(i) for i in input().split())
edge = [[] for _ in range(N)]
for i in range(M):
a, b = (int(i) for i in input().split())
edge[a-1].append(b-1)
edge[b-1].append(a... | p03805 |
import copy
N, M = list(map(int,input().split()))
E = [list(map(int, input().split())) for _ in range(M)]
def dfs(flg, E, i):
q = []
for e in E:
if e[0] == i:
if flg[e[1]-1] == 0:
q.append(e[1])
if e[1] == i:
if flg[e[0]-1] == 0:
q.append(e[0])
if len(q) == 0:
if flg.count(0)... | N, M = list(map(int, input().split()))
E = [[] for _ in range(N)]
for _ in range(M):
ta, tb = list(map(int, input().split()))
E[ta-1].append(tb-1)
E[tb-1].append(ta-1)
def next_permutation(out, cnt, flg):
if cnt == N:
for i in range(N-1):
if out[i+1] not in E[out[i]]:
return 0
return 1
... | p03805 |
import itertools
N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
a, b = list(map(int, input().split()))
ab.append({a-1, b-1})
ans = 0
for v in itertools.permutations(list(range(1, N))):
ok = True
a = 0
for b in v:
if {a, b} not in ab:
ok = False
... | N, M = list(map(int, input().split()))
ab = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
ab[a-1].append(b-1)
ab[b-1].append(a-1)
ans = 0
def dfs(x, visited):
global ans
if len(visited) == N:
ans += 1
return
for b in ab[x]:
... | p03805 |
import copy
import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
ans = 0
def dfs(start,path):
next_path = copy.copy(path)
... | def dfs(start,path):
res = 0
path.append(start)
if len(path) == N:
res += 1
return res
for i in graph[start]:
if i not in path:
res += dfs(i,path)
path.pop()
return res
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]... | p03805 |
import sys
from itertools import permutations
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
cnt = 0
def dfs(N, Adj, p, pos, mask):
global cnt
if pos == N:
for... | import sys
from itertools import permutations
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def do_dp(N, Adj):
univ = 2**N - 1
dp = [[0]*N for i in range(univ + 1)]
dp... | p03805 |
import sys
from itertools import permutations
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def do_dp(N, Adj):
univ = 2**N - 1
dp = [[0]*N for i in range(univ + 1)]
dp... | import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def do_dp(N, Adj):
univ = 2**(N-1) - 1
dp = [[0]*(N-1) for i in range(univ + 1)]
for u in range(N - 1):
... | p03805 |
# -*- coding: utf-8 -*-
from collections import deque
N, M = list(map(int, input().split()))
Ms = {i:set() for i in range(1, N + 1)}
for _ in range(M):
a, b = list(map(int, input().split()))
Ms[a].add(b)
Ms[b].add(a)
all = set(range(1, N + 1))
q = deque()
q.append((1, [1]))
ans = 0
while... | N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
path, ans = [[0]], 0
while len(path) > 0:
p = path.pop()
if len(p) == N:
ans += 1
else:
for g in... | p03805 |
import itertools as it
import sys
N, M = list(map(int, input().split()))
if N==0 or M==0:
print((0))
sys.exit()
a=[]
for i in range(M):
x,y=list(map(int,input().split()))
a.append([x,y])
a.append([y,x])
ans=0
for e in it.permutations(list(range(N))):
if e[0]!=0:
break... | import itertools as it
import sys
N, M = list(map(int, input().split()))
a=[]
for i in range(M):
x,y=list(map(int,input().split()))
a.append([x,y])
a.append([y,x])
ans=0
for e in it.permutations(list(range(N))):
if e[0]!=0:
break
count=1
for j in range(N-1)... | p03805 |
n,m=list(map(int,input().split()))
edges=[[] for i in range(n)]
for i in range(m):
s,t = list(map(int,input().split()))
edges[s-1].append(t-1)
edges[t-1].append(s-1)
cnt =[0]
def dfs(V,s):
V[s]=1
if sum(V)==n:
cnt[0]+=1
else:
for adj in edges[s]:
if V[adj] == 0:
... | n,m=list(map(int,input().split()))
edges=[[] for i in range(n)]
for i in range(m):
s,t = list(map(int,input().split()))
edges[s-1].append(t-1)
edges[t-1].append(s-1)
cnt =0
V=[0]*n
def dfs(V,s):
global cnt
V=V[:]
V[s]=1
if sum(V)==n:
cnt+=1
else:
for v in edges[s]:
... | p03805 |
n,m=list(map(int,input().split()))
edges=[[] for i in range(n)]
for i in range(m):
s,t = list(map(int,input().split()))
edges[s-1].append(t-1)
edges[t-1].append(s-1)
cnt =0
V=[0]*n
def dfs(V,s):
global cnt
V=V[:]
V[s]=1
if sum(V)==n:
cnt+=1
else:
for v in edges[s]:
... | n,m=list(map(int,input().split()))
edges=[[0]*n for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
visited=[False]*n
count=0
def dfs(u,visited):
global count
visited=visited[:]
visited[u]=True
if all(visited):
count+=1
... | p03805 |
import array
import itertools
from collections import defaultdict, deque
def log(s):
# print("| " + str(s), file=sys.stderr)
pass
def output(x):
print(x, flush=True)
def input_ints():
return map(int, input().split())
def solve():
num_nodes, num_edges = tuple(input_ints())
... | import array
import itertools
from collections import defaultdict, deque
def log(s):
# print("| " + str(s), file=sys.stderr)
pass
def output(x):
print(x, flush=True)
def input_ints():
return map(int, input().split())
def solve():
num_nodes, num_edges = tuple(input_ints())
... | p03805 |
from itertools import permutations
N, M = list(map(int, input().split()))
edges = []
for i in range(M):
a, b = list(map(int, input().split()))
edges.append([a-1, b-1])
mat = [[0]*N for _ in range(N)]
for s, g in edges:
mat[s][g] = 1
mat[g][s] = 1
P = permutations(list(range(N)))
ans... | def bit_dp(N, Adj):
dp = [[0]*N for i in range(1 << N)]
#dp[{0},0] = 1
dp[1][0] = 1
for S in range(1 << N):
for v in range(N):
# v がSに含まれていないときはパス
if (S & (1 << v)) == 0:
continue
#sub = S - {v}
sub = S ^ (1 << v)
... | p03805 |
import itertools
N, M = list(map(int, input().split()))
adj_matrix = [[0]*N for _ in range(N)]
# 隣接行列を作る
for i in range(M):
a, b = list(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(list(range(N))):
if each[0] !=... | N, M = list(map(int, input().split()))
adj_matrix = [[0]*N for _ in range(N)]
for i in range(M):
a, b = list(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):
i... | p03805 |
N, M = list(map(int, input().split()))
adj_matrix = [[0]*N for _ in range(N)]
for i in range(M):
a, b = list(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):
i... | N, M = list(map(int, input().split()))
g = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
memo = {}
All_used = (1 << N) - 1
def dfs(v, used):
if used == All_used:
return 1
key = (v, used)
if key in memo:
retur... | p03805 |
from collections import deque
from copy import deepcopy as dc
import sys
def main():
input = sys.stdin.readline
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
g = [[] for i in range(n+1)]
for i in ab:
g[i[0]].append(i[1])
g... | from collections import deque
from copy import copy as dc
import sys
def main():
input = sys.stdin.readline
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
g = [[] for i in range(n+1)]
for i in ab:
g[i[0]].append(i[1])
g[i[1... | p03805 |
from collections import deque
from copy import copy as dc
import sys
def main():
input = sys.stdin.readline
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
g = [[] for i in range(n+1)]
for i in ab:
g[i[0]].append(i[1])
g[i[1... | import sys
sys.setrecursionlimit(4100000)
def Dfs(G, v, n, visited):
all_visited = True
for i in range(n):
if visited[i] == False:
all_visited = False
if all_visited:
return 1
ret = 0
for i in range(n):
if not G[v][i]:
continue
... | p03805 |
from itertools import permutations
from copy import deepcopy
N,M = [int(i) for i in input().split()]
links = [[int(i) for i in input().split()] for _ in range(M)]
ans = 0
for path in permutations(list(range(2,N+1))):
l = deepcopy(links)
p_node = 1
for n_node in path:
if sorted([p_nod... | from itertools import permutations
from copy import deepcopy
N,M = [int(i) for i in input().split()]
links = set([input().strip() for _ in range(M)])
ans = 0
for path in permutations(list(range(2,N+1))):
l = deepcopy(links)
p_node = 1
for n_node in path:
e_l = " ".join([str(s) for s ... | p03805 |
import itertools
n,m=list(map(int,input().split()))
path=[[False]*n for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
a-=1
b-=1
path[a][b]=True
path[b][a]=True
ans=0;
for i in itertools.permutations(list(range(n)),n):
if i[0]==0:
for j in range(n):
... | def dfs(a,count,seen):
nseen=seen[:]
ans=0
nseen[a] = 1;
if count==n-1:
return 1
else:
for i in g[a]:
if not seen[i]:
ans+=dfs(i,count+1,nseen)
return ans
n,m=list(map(int,input().split()))
g=[[]*n for i in range(n)]
for i in range(m):... | p03805 |
N, M = list(map(int, input().split()))
E = [[] for i in range(M)]
for i in range(M):
E[i] = [int(x) - 1 for x in input().split()]
cnt = 0
for p in range(1, 2 ** M):
V = [[] for i in range(N)]
idx = 0
while p:
if p % 2:
V[E[idx][0]].append(E[idx][1])
V[E[idx][1]].append(E[idx][0])
... | N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
def dfs(V, v):
_V = [v for v in V]
_V[v] = 1
cnt = 0
if sum(_V) == N:
return 1
else:
for adj in G[v]:
if _... | p03805 |
n,m=list(map(int, input().split()))
alist=[]
for i in range(m):
a,b=list(map(int, input().split()))
alist.append([a,b])
alist.append([b,a])
ans=0
import itertools
t=[i for i in range(1,n+1)]
blist=list(itertools.permutations(t,n))
ans=0
for i in blist:
flag=True
for j in range(n-1):
if [i[j]... | n,m=list(map(int, input().split()))
alist=[]
for i in range(m):
a,b=list(map(int, input().split()))
alist.append([a,b])
alist.append([b,a])
ans=0
import itertools
t=[i for i in range(1,n+1)]
blist=list(itertools.permutations(t,n))
ans=0
for i in blist:
flag=True
for j in range(n-1):
if [i[j]... | p03805 |
import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
def dfs(i, d, fr, used):
global lis, ans
if i in used:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
used.append(i)
... | import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
visited = []
def dfs(i, d, fr):
global lis, ans, visited
if visited[i] == 1:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
... | p03805 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
# N = 頂点の数(= 数字の数)
# M = 辺の数(= aの行数)
N, M = list(map(int, input().split()))
graph = [ [0 for _ in range(N)] for _ in range(N) ]
visited = [False] * N
for i in range(M):
a, b = list(map(int, input().sp... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
# https://atcoder.jp/contests/abc054/tasks/abc054_c
# N = 頂点の数(= 数字の数)
# M = 辺の数(= aの行数)
N, M = list(map(int, input().split()))
graph = [ [0 for _ in range(N)] for _ in range(N) ]
visited = [False] * N
... | p03805 |
#制約が小さいので全探索する
n,m=list(map(int,input().split()))
#辺があるかどうかが知りたい→隣接行列表現
es=[[0]*n for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
es[a-1][b-1]=1
es[b-1][a-1]=1
#順列を作る
from itertools import permutations
per=[i+1 for i in range(n-1)]
per=list(permutations(per,n-1))
#全探索する
a... | n,m=list(map(int,input().split()))
# 再帰の深さが1000を超えそうなときはこれをやっておく
import sys
sys.setrecursionlimit(10**7)
#隣接行列表現
es=[[0 for i in range(n)] for j in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
es[a-1][b-1]=1
es[b-1][a-1]=1
#深さ優先探索
def dfs(v,visited):
ans=0
#自分が今いる... | p03805 |
N, M = list(map(int, input().split()))
E = [[] for _ in range(N)]
for m in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
check = [False] * N
check[0] = True
def dfs(v):
if sum(check) == N:
return 1
ans = 0
for u in E[... | from itertools import permutations
N, M = list(map(int, input().split()))
E = [set() for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
E[a-1].add(b-1)
E[b-1].add(a-1)
ans = 0
for p in permutations([i for i in range(1, N)]):
i = 0
for j in p:
if j not... | p03805 |
from collections import deque
def dfs(G, visited, s, n, ans):
# すべての頂点を訪れた場合の処理
if all(visited) :
ans += 1
return ans
# 次の頂点の探索
for i in G[s] :
if visited[i] == False :
visited[i] = True
ans = dfs(G, visited, i, n, ans)
visited[i] = False
return ans
# グラフGの入力
n,... | # -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
graph = [[] for j in range(n)]
for i in range(m):
a,b = list(map(int, input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
used = [False]*n
used[0] = True
def DFS(v,used):
if all(used):
return 1
ans = ... | p03805 |
N,M = list(map(int,input().split()))
P=[]
for m in range(M):
P.append(list(map(int,input().split())))
from itertools import combinations
ans=0
for c in combinations(list(range(M)),N-1):
visit = [1]
P_visit=[]
v=0
start=visit[0]
while v < 100:
v+=1
for c_ in c:
... | from itertools import permutations
N,M = list(map(int,input().split()))
P=[]
for m in range(M):
P.append(list(map(int,input().split())))
ad={}
for _ in range(1,N+1):
ad[_]=set()
for p in P:
ad[p[0]].add(p[1])
ad[p[1]].add(p[0])
ans=0
for p in permutations(list(range(2,N+1)),N-1):... | p03805 |
from collections import defaultdict
from itertools import permutations
N, M = list(map(int, input().split()))
dic = defaultdict(list)
for i in range(M):
a, b = list(map(int, input().split()))
dic[a-1] += [b-1]
dic[b-1] += [a-1]
ans = 0
ls = permutations(list(range(1,N)))
for l in ls:
l = [0]+list(l... | from itertools import permutations
N, M, *L = list(map(int, open(0).read().split()))
dic = [[] for i in range(N+1)]
for a, b in zip(*[iter(L)]*2):
dic[a].append(b)
dic[b].append(a)
ans = 0
for l in permutations(list(range(2,N+1))):
l = [1]+list(l)
for i in range(N-1):
if l[i+1] not in dic[l[i]]:... | p03805 |
import sys
from itertools import permutations
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
link = [[False] * N for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
link[a-1][b-1] = True
link[b-1][a-1] = True
... | from itertools import permutations
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
link = [[False] * N for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
link[a-1][b-1] = True
link[b-1][a-1] = True
... | p03805 |
N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N+1)]
for _ in range(M):
a, b = [int(v) for v in input().split()]
tbl[a][b] = 1
tbl[b][a] = 1
ans = 0
paths = [[1, ]]
while paths:
p = paths.pop()
for i in range(1, N + 1):
if p[-1] == i: continue
... | N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N + 1)]
def dfs(v, visited):
if len(visited) == N:
return 1
ans = 0
for i in range(1, N + 1):
if i == v: continue
if tbl[i][v] == 1 and i not in visited:
visited.append(i)
... | p03805 |
import sys
input_int = lambda:int(eval(input()))
input_ints = lambda:list(map(int,input().split()))
input_ints_list = lambda:list(input_ints())
input_str = lambda:eval(input())
input_strs = lambda:input().split()
input_lines = lambda n,f:[f() for _ in range(n)]
import functools,fractions
gcd = lambda a:func... | import sys
input_int = lambda:int(eval(input()))
input_ints = lambda:list(map(int,input().split()))
input_ints_list = lambda:list(input_ints())
input_str = lambda:eval(input())
input_strs = lambda:input().split()
input_lines = lambda n,f:[f() for _ in range(n)]
import functools,fractions
gcd = lambda a:func... | p03805 |
#!/usr/bin/python
# -*- Coding: utf-8 -*-
n,m = list(map(int,input().split()))
H = [[0 for _ in range(n)] for _ in range(n) ]
edge_list = []
for _ in range(m):
a, b = list(map(int,input().split()))
edge_list.append([a-1,b-1])
H[a-1][b-1] = 1
H[b-1][a-1] = 1
l = [0 for _ in range(n)... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
H = [[0 for _ in range(n)] for _ in range(n) ]
for _ in range(m):
a, b = list(map(int,input().split()))
H[a-1][b-1] = 1
H[b-1][a-1] = 1
l = [0 for _ in range(n)]
ans = 0
def dfs(node,visited):
globa... | p03805 |
def abc054_c_one_stroke_paths():
import copy
N, M = list(map(int, input().split()))
# create graph G
G = {}
for m in range(M):
a, z = list(map(int, input().split()))
G[a] = G.get(a, [])
G[a].append(z)
G[z] = G.get(z, [])
G[z].append(a)
# pri... | def abc054_c_one_stroke_paths():
N, M = list(map(int, input().split()))
# create graph G
G = {}
for m in range(M):
a, z = list(map(int, input().split()))
G[a] = G.get(a, [])
G[a].append(z)
G[z] = G.get(z, [])
G[z].append(a)
# print(G)
# fi... | p03805 |
N,M=list(map(int,input().split()))
inp=[list(map(int,input().split())) for _ in range(M)]
g=[[] for _ in range(N)]
[g[a-1].append(b-1) for a,b in inp]
[g[b-1].append(a-1) for a,b in inp]
from itertools import permutations
seq=[i for i in range(N)]
test=list(permutations(seq))
cnt=0
for t in test:
if t[... | n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in [0]*m]
g=[[] for _ in [0]*n]
[g[a-1].append(b-1) for a,b in ab]
[g[b-1].append(a-1) for a,b in ab]
from itertools import permutations
cnt=0
for i in permutations(list(range(1,n))):
i=(0,)+i
for j in range(n-1):
... | p03805 |
import itertools
N, M = list(map(int, input().split()))
ab = []
for i in range(M):
ab.append(list(map(int, input().split())))
ans = 0
if M >= N - 1:
for i in list(itertools.combinations(ab, N - 1)):
g = {}
for j in range(N):
g[j + 1] = []
for j, k in i:
... | import itertools
N, M = list(map(int, input().split()))
e = set([])
for i in range(M):
a, b = list(map(int, input().split()))
e.add((a, b))
ans = 0
for i in list(itertools.permutations(list(range(2, N + 1)))):
a = 1
for b in i:
if (a, b) in e or (b, a) in e:
a = b
... | p03805 |
def na(): return list(map(int, input().split()))
n, m = na()
edges = [[False for _ in range(n)] for _ in range(n)]
for i in range(m):
a, b = na()
a -= 1
b -= 1
edges[a][b] = True
edges[b][a] = True
pathes = {'0'}#permutationで求めたpath
for i in range(n-1):
buf = set()
for pre_path... | def ary(r, c, v): return [[v for _ in range(c)] for _ in range(r)]
n, m = list(map(int, input().split()))
e = ary(n, n, False)
for i in range(m):
a, b = list(map(int, input().split()))
#頂点を0-indexedに変換
a -= 1
b -= 1
e[a][b] = True
e[b][a] = True
ps = set()
ps.add('0')
for cnt in ra... | p03805 |
def ary(r, c, v): return [[v for _ in range(c)] for _ in range(r)]
n, m = list(map(int, input().split()))
e = ary(n, n, False)
for i in range(m):
a, b = list(map(int, input().split()))
#頂点を0-indexedに変換
a -= 1
b -= 1
e[a][b] = True
e[b][a] = True
ps = set()
ps.add('0')
for cnt in ra... | def main():
import sys
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
g = tuple(set() for _ in range(N))
for _ in range(M):
a, b = (int(x) - 1 for x in input().split())
g[a].add(b)
g[b].add(a)
def dfs(v=0, visited=1 << 0):
... | p03805 |
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
ai,bi=list(map(int,input().split()))
a.append([ai,bi])
ni=[0]*n
nii=[]
def pathm(n,a,bi,pcnt,ni):
if n==1:
pcnt=pcnt+1
# print("2:","n:",n,"bi:",bi,"pcnt:",pcnt)
return pcnt
else:
... | 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... | p03805 |
import logging
logger = logging.getLogger(__name__)
logger.setLevel(logging.DEBUG)
h = logging.FileHandler("logtest.log")
logger.addHandler(h)
N, M = list(map(int, input().split()))
open_list = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
... | N, M = list(map(int, input().split()))
open_list = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
open_list[a].append(b)
open_list[b].append(a)
# 探索済みリスト
closed_list = [False] * N
closed_list[0] = True
cnt = 0
level = 1
# 深さ優先探索
def d... | p03805 |
# -*- coding: utf-8 -*-
# DFSでやる版
N, M = list(map(int, input().split()))
# 入力値の頂点ペア(辺)を格納する配列
a = [0] * M
b = [0] * M
# 頂点ペアが隣接しているかどうかを格納する配列
graph = [[False for i in range(N)] for j in range(N)]
# 入力値の頂点ペア(辺)を格納していくループ
for i in range(M):
a[i], b[i] = list(map(int, input().split()))
# 添字に合... | # -*- coding: utf-8 -*-
import sys
from itertools import permutations
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in ra... | p03805 |
# -*- coding: utf-8 -*-
import sys
from itertools import permutations
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in ra... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03805 |
#DFS
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
stack = deque([(0, 0)])
visited = [0] * N
depth = 0
ans = 0
while stack:
now, depth = stack.pop(... | #順列全探索
from itertools import permutations
N, M = list(map(int, input().split()))
G = [[0]*N for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a-1][b-1] = 1
G[b-1][a-1] = 1
perms = permutations(list(range(1, N)))
ans = 0
for perm in perms:
now = 0
for v in perm:... | p03805 |
from collections import defaultdict
from itertools import permutations
def main():
N, M = list(map(int, input().split()))
g = defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
g[a].append(b)
g[b].append(a)
ans = 0
for route in permutati... | from collections import defaultdict
from itertools import permutations
def main():
N, M = list(map(int, input().split()))
graph = defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
ans = 0
for rout... | p03805 |
from collections import defaultdict
from itertools import permutations
def main():
N, M = list(map(int, input().split()))
graph = defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
ans = 0
for rout... | from collections import defaultdict
from itertools import permutations
def main():
N, M = list(map(int, input().split()))
s = set()
for _ in range(M):
a, b = list(map(int, input().split()))
s.add((a, b))
s.add((b, a))
ans = 0
for x in permutations(list(range(2, ... | p03805 |
import itertools
n,m=list(map(int,input().split()))
edge=[[]for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
ans=0
for i in itertools.permutations(list(range(1,n+1))):
if i[0]!=1:
continue
for j in range(n-1):
... | from itertools import permutations
n,m=list(map(int,input().split()))
graph=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
graph[a].append(b)
graph[b].append(a)
ans=0
for i in permutations(list(range(1,n+1))):
if i[0]!=1:
continue
for j in... | p03805 |
import itertools
N, M = list(map(int, input().split()))
edges = {tuple(sorted(map(int, input().split()))) for _ in range(M)}
answer = 0
for pattern in itertools.permutations(list(range(2, N+1)), N-1):
l = [1] + list(pattern)
answer += sum(1 for edge in zip(l, l[1:]) if tuple(sorted(edge)) in edges)==N-1
... | import itertools
N, M = list(map(int, input().split()))
edges = {tuple(sorted(map(int, input().split()))) for _ in range(M)}
answer = 0
for i in itertools.permutations(list(range(2, N+1)), N-1):
l = [1] + list(i)
answer += sum(1 for edge in zip(l, l[1:]) if tuple(sorted(edge)) in edges) == N-1
print(... | p03805 |
import itertools
N, M = list(map(int, input().split()))
edges = [tuple(sorted(map(int, input().split()))) for _ in range(M)]
answer = 0
for i in itertools.permutations(list(range(2, N+1)), N-1):
l = [1] + list(i)
answer += sum(1 for x in zip(l, l[1:]) if tuple(sorted(x)) in edges) == N-1
print(answer... | from itertools import permutations
N, M = list(map(int, input().split()))
AB = set([tuple(sorted(map(int, input().split()))) for _ in range(M)])
answer = 0
for pattern in permutations(list(range(2, N+1)), N-1):
pattern = [1] + list(pattern)
for i in zip(pattern[:-1], pattern[1:]):
if tuple(so... | p03805 |
import itertools
n, m = list(map(int, input().split()))
h = [[0]*n for _ in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
h[a-1][b-1] = 1
h[b-1][a-1] = 1
ans = 0
x = list(itertools.permutations(list(range(1, n+1))))
for i in range(len(x)):
if x[i][0] == 1:
fo... | import itertools
n, m = list(map(int, input().split()))
g = [[0]*n for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a][b] = 1
g[b][a] = 1
a = list(itertools.permutations(list(range(n))))
ans = 0
for i in a:
if i[0] != 0:
break
... | p03805 |
import sys
from itertools import permutations
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
Edge = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
Edge[a-1].append(b-1)
Edge[b-1].append(a-1)
count... | import sys
from itertools import permutations
def solve():
N, M = list(map(int, input().split()))
Edge = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
Edge[a-1].append(b-1)
Edge[b-1].append(a-1)
count = 0
for order in permutation... | p03805 |
# -*- coding: utf-8 -*-
line = input().split(" ")
n = int(line[0])
m = int(line[1])
edge = [[] for _ in range(n+1)]
for _ in range(m):
line = input().split(" ")
a = int(line[0])
b = int(line[1])
edge[a].append(b)
edge[b].append(a)
visited = [False for _ in range(n+1)]
visited[0... | # -*- coding: utf-8 -*-
n,m = list(map(int, input().split()))
edge = [[] for _ in range(n+1)]
for _ in range(m):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
edge[a].append(b)
edge[b].append(a)
visited = [False for _ in range(n)]
def dfs(v):
if all(visited):
return 1... | p03805 |
n,m=list(map(int,input().split()))
e=[[]for _ in[0]*-~n]
for _ in[0]*m:
a,b=list(map(int,input().split()))
e[a]+=[b]
e[b]+=[a]
candy=[[1]]
for _ in[0]*~-n:
tmp=[]
for c in candy:
for next in e[c[-1]]:
tmp+=[c+[next]]
candy=tmp
print((sum(c==set(range(1,n+1))for c... | from itertools import permutations
N, M = list(map(int, input().split()))
edges = set()
for _ in range(M):
a, b = list(map(int, input().split()))
edges.add((a, b))
edges.add((b, a))
cnt = 0
for p in permutations(list(range(2, N + 1))):
cnt += all(move in edges for move in zip((1,) + p, p))
... | p03805 |
# 入力
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03805 |
N,M = list(map(int,input().split()))
G = {}
for _ in range(M):
a,b = list(map(int,input().split()))
if a not in G:
G[a] = []
G[a].append(b)
if b not in G:
G[b] = []
G[b].append(a)
hist = [0 for _ in range(N+1)]
stack = [1]
hist[1] = 1
cnt = 0
F = {}
while stack:
c... | from itertools import permutations
def check(i,j):
if j==N-2 and x[j] in G[i]:
return True
if x[j] in G[i]:
return check(x[j],j+1)
return False
N,M = list(map(int,input().split()))
G = {i:[] for i in range(1,N+1)}
for _ in range(M):
a,b = list(map(int,input().split()))
... | p03805 |
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7
import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(eval(input()))
def i_map(): return list(map(int, input().split()))
def i_list(): return list(i_m... | import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7
import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(eval(input()))
def i_map(): return list(map(int, input().split()))
def i_list(): return list(i_m... | p03805 |
from collections import defaultdict
import itertools
n, m = list(map(int, input().split()))
connected_dict = defaultdict(lambda: [])
for i in range(m):
a, b = list(map(int, input().split()))
connected_dict[a].append(b)
connected_dict[b].append(a)
count = 0
for permutation in list(itertools.pe... | # One-stroke Path
import itertools
n, m = list(map(int, input().split()))
ab = {}
for i in range(n+1):
ab[i] = []
for i in range(m):
a, b = list(map(int, input().split()))
ab[a].append(b)
ab[b].append(a)
count = 0
for values in list(itertools.permutations(list(range(2, n+1)))):
pre =... | p03805 |
import itertools
N,M=list(map(int,input().split()))
ab=list(list(map(int,input().split())) for _ in range(M))
l=list(l for l in range(1,N+1))
numlist=list(itertools.permutations(l))
ans=0
for I in numlist:
if I[0]==1 and all(sorted([I[j],I[j+1]]) in ab for j in range(N-1)):
ans+=1
print(ans)
| import itertools
n, m = list(map(int, input().split()))
path = [[False] * n for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
path[a][b] = True
path[b][a] = True
ans = 0
for i in itertools.permutations(list(range(n)), n):
if i[0] == 0:
... | p03805 |
from copy import deepcopy
def solve(road, num, ans, n):
pattern = 0
test = deepcopy(road)
if ans.count(str(num)) > 1:
return 0
if len(ans) is n:
return 1
if len(road[num - 1]) == int(0):
return 0
else:
for i in range(len(road[num - 1])):
... | from copy import deepcopy
def solve(road, num, ans, n):
pattern = 0
test = deepcopy(road)
for s in test:
if num in s:
s.remove(num)
if len(ans) is n:
return 1
if len(test[num - 1]) == int(0):
return 0
else:
for i in range(len(test[num -... | p03805 |
from copy import deepcopy
def solve(road, num, ans, n):
pattern = 0
test = deepcopy(road)
for s in test:
if num in s:
s.remove(num)
if len(ans) is n:
return 1
if len(test[num - 1]) == int(0):
return 0
else:
for i in range(len(test[num -... | N, M = [int(i) for i in input().split()]
road = [list() for i in range(N + 1)]
for i in range(M):
a, b = [int(i) for i in input().split()]
road[a].append(b)
road[b].append(a)
def solve(before, visited, now):
visited.append(now)
if len(visited) is N:
return 1
pattern = 0
... | p03805 |
N,M=list(map(int,input().split()))
edges=[[] for _ in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
edges[a-1]+=[b-1]
edges[b-1]+=[a-1]
vis=[1]+[0]*(N-1)#訪問フラグ
ans=0
def DFS(v):
global ans
if vis==[1]*N:
ans+=1
return 0
for u in edges[v]:
if vis[u]==0:
v... | N,M=list(map(int,input().split()))
edges=[[] for _ in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
edges[a-1]+=[b-1]
edges[b-1]+=[a-1]
vis=[1]+[0]*(N-1)#訪問フラグ
def DFS(v):
if vis==[1]*N:
return 1
ret=0
for u in edges[v]:
if vis[u]==0:
vis[u]=1
ret+=DFS(... | p03805 |
import itertools
N, M = list(map(int, input().split()))
adj_matrix = [[0]* N for _ in range(N)]
for i in range(M): #隣接行列
a, b = list(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(list(range(N))):
if each[0] != 0... | N, M = list(map(int, input().split()))
matrix=[[0]*N for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
matrix[a-1][b-1]=1
matrix[b-1][a-1]=1
import itertools
count=0
for i in itertools.permutations(list(range(N))):
if i[0]==0:
result=1
for j in rang... | p03805 |
import copy
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = 0
def dfs(node, finished):
#print("node {} finished {}".format(node, finished))
... | import copy
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = 0
def dfs(node,f):
f.add(node)
global ans
if len(f) == n:
ans += 1... | p03805 |
import copy
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = 0
def dfs(node,f):
f.add(node)
global ans
if len(f) == n:
ans += 1... | n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
adjacent_list[a].append(b)
adjacent_list[b].append(a)
ans = 0
def dfs(node,f):
global ans
if len(f) == n:
ans += 1
else:
for i in ... | p03805 |
# -*- coding: utf-8 -*-
import copy
n,m = list(map(int,input().split()))
rinset = [[0]*(n+1) for _ in range(n+1)]
for _ in range(m):
a,b = list(map(int,input().split()))
rinset[a][b]=b
rinset[b][a]=a
cnt = 0
def solve(start,visitted):
global cnt
visitted = copy.deepcopy(visitted)
... | # -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
#逆順にしたもの追加
ab += [[b,a] for a,b in ab]
#辺id付きで、idがfrom,abi[from]=[to1,to2,...] のリスト
abi = [[] for _ in range(n+1)]
for i,(a,b) in enumerate(ab):
abi[a].append(b)
#再起のlimitを上げる
imp... | p03805 |
import itertools
N, M = list(map(int, input().split()))
E = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
count = 0
for V in itertools.permutations(list(range(1, N))):
if V[0] in E[0] and all(V[i] in E[... | from itertools import permutations
def int0(s):
return int(s) - 1
def main():
N, M = list(map(int, input().split()))
edges = [tuple(map(int0, input().split())) for _ in range(M)]
to = [[False]*N for _ in range(N)]
for a, b in edges:
to[a][b] = True
to[b][a] = True
... | p03805 |
import itertools
N, M = list(map(int, input().split()))
edges = [list([int(x) - 1 for x in input().split()]) for _ in range(M)]
res = 0
if M < N - 1:
print(res)
else:
for path in itertools.permutations(edges, N - 1):
vertex = [True] * N
v = 0
vertex[v] = False
fo... | N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
def dfs(node, track):
if len(track) == N:
global res
res += 1
else:
for dst i... | p03805 |
import itertools
N, M = list(map(int, input().split()))
edges = [tuple([int(x) - 1 for x in input().split()]) for _ in range(M)]
res = 0
if M < N - 1:
print(res)
else:
for course in itertools.combinations(edges, N - 1):
num_of_v = [0] * N
for edge in course:
num_of_... | def main():
import sys
from itertools import permutations
# readline = sys.stdin.buffer.readline
readlines = sys.stdin.readlines
N, M = list(map(int, input().split()))
edge = [[0] * N for _ in range(N)]
for s in readlines():
a, b = list(map(int, s.split()))
a -= 1; b... | p03805 |
import itertools
N,M=list(map(int,input().split()))
edges={tuple(sorted(map(int,input().split()))) for i in range(M)}
ans=0
for i in itertools.permutations(list(range(2,N+1)),N-1):
l=[1]+list(i)
ans+=sum(1 for edge in zip(l,l[1:]) if tuple(sorted(edge)) in edges)==N-1
print(ans) | import itertools
N,M=list(map(int,input().split()))
edges={tuple(sorted(map(int,input().split()))) for i in range(M)}
ans=0
for i in itertools.permutations(list(range(2,N+1))):
l=[1]+list(i)
ans+=sum(1 for edge in zip(l,l[1:]) if tuple(sorted(edge)) in edges)==N-1
print(ans) | p03805 |
import copy
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
cnt = 0
fin = set([i + 1 for i in range(n)])
def path(now, edges, past):
global cnt
if set(past) == fin:
cnt += 1
return 0
for i in range(len(edges)):
if now == edge... | import itertools
n, m = list(map(int, input().split()))
ab = set()
for _ in range(m):
a, b = list(map(int, input().split()))
ab.add((a, b))
ab.add((b, a))
cnt = 0
for x in itertools.permutations(list(range(1, n + 1))):
if x[0] != 1:
break
flag = True
for i in range(len(x)... | p03805 |
N,M = list(map(int,input().split()))
vertex = [[0 for j in range(N+1)] for i in range(N+1)]
AB = [list(map(int,input().split())) for _ in range(M)]
for i in range(M):
a,b = AB[i]
vertex[a][b] = 1
vertex[b][a] = 1
from itertools import permutations
ans = 0
for v in permutations([i+2 for i in r... | N,M = list(map(int,input().split()))
vertex = [[0 for j in range(N+1)] for i in range(N+1)]
for i in range(M):
a,b = list(map(int,input().split()))
vertex[a][b] = 1
vertex[b][a] = 1
from itertools import permutations
ans = 0
for v in permutations([i+2 for i in range(N-1)], N-1):
v = [1] +... | p03805 |
import itertools
N,M=list(map(int,input().split()))
edges={tuple(sorted(map(int,input().split()))) for i in range(M)}
ans=0
for i in itertools.permutations(list(range(2,N+1)),N-1):
l=[1]+list(i)
ans+=sum(1 for edge in zip(l,l[1:]) if tuple(sorted(edge)) in edges)==N-1
print(ans) | import itertools
N,M=list(map(int,input().split()))
edges=set()
for _ in range(M):
a,b =list(map(int,input().split()))
edges.add((a,b))
edges.add((b,a))
answer=0
for p in itertools.permutations(list(range(1,N+1))):
if p[0] !=1:
continue
bl=True
for i in range(N-1):
if(p[i],p... | p03805 |
N, M = list(map(int, input().split()))
v = []
for i in range(M):
line = list(map(int, input().split()))
v.append([x - 1 for x in line])
conn = []
for _ in range(N):
conn.append([False] * N)
visited = [False] * N
for start, end in v:
conn[start][end] = conn[end][start] = True
def d... | N, M = list(map(int, input().split()))
d = [[False for i in range(N)] for i in range(N)]
visited = [False] * N
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a][b] = True
d[b][a] = True
def dfs(now, depth):
if visited[now]:
return 0
if dep... | p03805 |
import itertools
def sonzai(path, start, goal):
for i in path:
if start in i:
if start > goal:
if i[0] == goal:
return True
else:
if i[1] == goal:
return True
return False
n, m = list(map(int, ... | import itertools
n, m = list(map(int, input().split()))
graph = [[0 for i in range(n)] for j in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
graph[a - 1][b - 1] = 1
graph[b - 1][a - 1] = 1
ans = 0
for i in itertools.permutations(list(range(2, n + 1))):
if not graph[0][i... | p03805 |
import itertools as it
N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
graph[a].append(b)
graph[b].append(a)
ans = 0
for path in it.permutations(list(range(N))):
if path[0] != 0:
... | import itertools as it
N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
graph[a].append(b)
graph[b].append(a)
ans = 0
for path in it.permutations(list(range(N))):
if path[0] != 0:
... | p03805 |
from itertools import permutations
def main():
n, m = list(map(int, input().split()))
edge = set()
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
edge.add((a, b))
edge.add((b, a))
#全ノード間に辺が張っていると仮定する
#このとき全てのノードを廻る順番は順列の数だけある
#ここから条件を絞って数えるべ... | #python3
from itertools import permutations
def main():
n, m = list(map(int, input().split()))
edge = set()
for _ in range(m):
a, b = list(map(int, input().split()))
edge.add((a-1, b-1))
edge.add((b-1, a-1))
node = []
for i in range(n):
node.append(... | p03805 |
from itertools import permutations
n, m = list(map(int, input().split()))
edges = [tuple(map(int, input().split())) for _ in range(m)]
ans = 0
for i in permutations(list(range(2, n+1)), n-1):
load = [1]+list(i)
ans += sum(1 for edge in zip(load, load[1:])
if tuple(sorted(edge)) in edges)... | from itertools import permutations
n, m = list(map(int, input().split()))
edges = {tuple(map(int, input().split())) for _ in range(m)}
ans = 0
for i in permutations(list(range(2, n+1)), n-1):
load = [1]+list(i)
ans += sum(1 for edge in zip(load, load[1:])
if tuple(sorted(edge)) in edges)... | p03805 |
from sys import stdin
def dfs(e, ans, done, N, graph):
if (1 << N) - 1 == done:
ans += 1
return ans
for s in graph[e]:
if done >> s & 1:
continue
done ^= 1 << s
ans = dfs(s, ans, done, N, graph)
done ^= 1 << s
return ans
def mai... | from sys import stdin
N = int()
memo = {}
graph = []
def dfs(e, done):
if (1 << N) - 1 == done:
return 1
key = (e, done)
if key in memo:
return memo[key]
ret = 0
for s in graph[e]:
if done >> s & 1:
continue
done ^= 1 << s
ret +=... | p03805 |
n,m=list(map(int,input().split()))
road=[[] for _ in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
road[a].append(b)
road[b].append(a)
dp=[[0]*(n+1) for _ in range(2**n)]
dp[1][1]=1
for i in range(1,2**n):
for j in range(1,n+1):
for k in road[j]:
if not... | n,m=list(map(int,input().split()))
root=[[] for _ in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
root[a].append(b)
root[b].append(a)
s=[0]*(n+1)
s[0]=1
s[1]=1
ans=0
def f(a,x):
global ans
for i in root[a]:
if x[i]==0:
x[i]=1
f(i,x)... | p03805 |
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
visit = [0] * (n + 1)
def dfs(now, depth):
if visit[now]:
return 0
if depth == n:
return 1
... | n, m = list(map(int, input().split()))
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
visit = [0] * (n + 1)
ans = 0
def dfs(now, depth):
global ans
if visit[now]:
pass
if depth == n:
... | p03805 |
n,m = list(map(int,input().split()))
graph = [[]for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
a -=1
b-=1
graph[a].append(b)
graph[b].append(a)
def all_visited(l):
a = 0
for i in range(n):
if l[i]:
a+=1
if a == n:
... | import sys
sys.setrecursionlimit(10**8)
n,m = list(map(int,input().split()))
graph = [[]for i in range(n)]
visited = [0]*n
def all_v(visited):
cnt = 0
for x in visited:cnt+=x
return cnt == n
def dfs(now):
visited[now] = 1
if all_v(visited):return 1
res = 0
for next in graph[no... | p03805 |
N,M=list(map(int,input().split()))
import copy
a=[0]*M
b=[0]*M
for i in range(M):
a[i],b[i]=list(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... | N,M=list(map(int,input().split()))
import copy
a=[0]*M
b=[0]*M
for i in range(M):
a[i],b[i]=list(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... | p03805 |
N,M=list(map(int,input().split()))
import copy
a=[0]*M
b=[0]*M
for i in range(M):
a[i],b[i]=list(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... | 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]):
... | p03805 |
import sys
sys.setrecursionlimit(1000000)
N, M = list(map(int, input().split()))
ab = [list([int(x)-1 for x in input().split()]) for _ in range(M)]
adlist = [[] for _ in range(N)]
for a, b in ab:
adlist[a] += [b]
adlist[b] += [a]
used = [0]*N
global ans
ans = 0
def dfs(v):
global ans
used... | import sys
sys.setrecursionlimit(1000000)
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x)-1 for x in input().split()]
graph[a] += [b]
graph[b] += [a]
used = [0]*n
global ans
ans = 0
def dfs(u):
global ans
used[u] = 1
if sum(used) == n... | p03805 |
n, m = list(map(int, input().split()))
paths = set()
for i in range(m) :
_a, _b = list(map(int, input().split()))
paths.add((_a - 1, _b - 1))
paths.add((_b - 1, _a - 1))
full_mask = "".join(["1" for x in range(n)])
zero_mask = "".join(["0" for x in range(n)])
p_cnt = 0
def dfs(cur_idx, mask) ... | n, m = list(map(int, input().split()))
paths = set()
zero_mask = "".join(["0" for x in range(n)])
full_mask = "".join(["1" for x in range(n)])
paths_cnt = 0
for i in range(m) :
_a, _b = list(map(int, input().split()))
paths.add((_a - 1, _b - 1))
paths.add((_b - 1, _a - 1))
def mask_idx(s, i... | p03805 |
N, M = list(map(int, input().split()))
paths = set()
for i in range(M) :
_f, _t = list(map(int, input().split()))
paths.add((_f - 1, _t - 1))
paths.add((_t - 1, _f - 1))
zeromask = "".join(['0' for x in range(N)])
fullmask = "".join(['1' for x in range(N)])
cnt = 0
def do_mask(m, idx) :
... | N, M = list(map(int, input().split()))
a, b = [], []
for i in range(M) :
_a, _b = list(map(int, input().split()))
a.append(_a - 1)
b.append(_b - 1)
zero_mask = "".join(['0' for x in range(N)])
full_mask = "".join(['1' for x in range(N)])
paths_cnt = 0
paths_set = set()
def do_mask(m, i... | p03805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.