input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import Counter
n = int(eval(input()))
v = list(map(str, input().split()))
f = Counter(v[::2])
s = Counter(v[1::2])
ans = []
for i in list(f.keys()):
for j in list(s.keys()):
if i == j:
continue
else:
ans.append(f[i] + s[j])
if ans:
... | from collections import Counter
n = int(eval(input()))
v = list(map(str, input().split()))
f = Counter(v[::2]).most_common(2)
s = Counter(v[1::2]).most_common(2)
if f[0][0] != s[0][0]:
print((n - f[0][1] - s[0][1]))
else:
if len(f) == 1 or len(s) == 1:
print((n // 2))
else:
... | p03244 |
mod = 10 ** 9 + 7
mod2 = 2**61+1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is not None:
print(ans)
def solve():
N = iip(False)
V = iip()
v1 = V[1::2]... | mod = 10 ** 9 + 7
mod2 = 2**61+1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is not None:
print(ans)
def solve():
N = iip(False)
V = iip()
v1 = V[1::2]... | p03244 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = a[0::2]
b1 = sorted(b, key=lambda x: b.count(x))
c = a[1::2]
c1 = sorted(c, key=lambda x: c.count(x))
if b == c:
print((n//2))
else:
print((n - b1.count(b1[-1]) - c1.count(c1[-1]))) | n = int(eval(input()))
v = list(map(int,input().split()))
v1 = sorted(v[0::2])
v2 = sorted(v[1::2])
s1 = set(v1)
s2 = set(v2)
## 偶数項・奇数項ごとに最大数および次点の値を保持
eve = [[0,0]]
odd = [[0,0]]
cnt_eve = 1
cnt_odd = 1
for i in range(1,n//2):
## 偶数
if v1[i] == v1[i-1]:
cnt_eve += 1
else:
... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
odds = []
evens = []
for i in range(n):
if i % 2 == 0:
evens.append(v[i])
else:
odds.append(v[i])
evens_c = Counter(evens).most_common()
odds_c = Counter(odds).most_common()
ans = n... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
odds = []
evens = []
for i in range(n):
if i % 2 == 0:
evens.append(v[i])
else:
odds.append(v[i])
evens_c = Counter(evens).most_common(2)
odds_c = Counter(odds).most_common(2)
if ev... | p03244 |
n = int(eval(input()))
lst = list(map(int, input().split()))
ma = {}
mb = {}
for i in range(0, n, 2):
lst[i] in ma
if lst[i] in ma:
ma[lst[i]] += 1
else:
ma[lst[i]] = 1
lst[i+1] in mb
if lst[i+1] in mb:
mb[lst[i+1]] += 1
else:
mb[lst[i+1]] = 1
if ma... | n = int(eval(input()))
lst = list(map(int, input().split()))
m1 = {}
m2 = {}
for i in range(0, n, 2):
if lst[i] in m1:
m1[lst[i]] += 1
else:
m1[lst[i]] = 1
if lst[i+1] in m2:
m2[lst[i+1]] += 1
else:
m2[lst[i+1]] = 1
if max(m1, key=m1.get) != max(m2, key=m2.ge... | p03244 |
from itertools import permutations
import collections
N = int(eval(input()))
nums = list(map(int, input().split()))
odd_nums = []
even_nums = []
for i, num in enumerate(nums):
if i % 2 == 1:
even_nums.append(num)
else:
odd_nums.append(num)
useable_nums = set(nums)
even_length = len... | from itertools import permutations
import collections
N = int(eval(input()))
nums = list(map(int, input().split()))
odd_nums = []
even_nums = []
for i, num in enumerate(nums):
if i % 2 == 1:
even_nums.append(num)
else:
odd_nums.append(num)
useable_nums = set(nums)
even_length = len... | p03244 |
from collections import defaultdict
N = int(eval(input()))
L = list(map(int, input().split()))
if len(set(L)) == 1:
print((N//2))
exit()
if N == 2:
print((0))
exit()
d_even = defaultdict(int)
d_odd = defaultdict(int)
for i in range(N):
v = L[i]
if i % 2 == 0:
d_ev... | from collections import defaultdict
N = int(eval(input()))
L = list(map(int, input().split()))
if len(set(L)) == 1:
print((N//2))
exit()
if N == 2:
print((0))
exit()
d_even = defaultdict(int)
d_odd = defaultdict(int)
for i in range(N):
v = L[i]
if i % 2 == 0:
d_ev... | p03244 |
from collections import defaultdict
N = int(eval(input()))
L = list(map(int, input().split()))
if len(set(L)) == 1:
print((N//2))
exit()
if N == 2:
print((0))
exit()
d_even = defaultdict(int)
d_odd = defaultdict(int)
for i in range(N):
v = L[i]
if i % 2 == 0:
d_ev... | from collections import Counter
N = int(eval(input()))
L = list(map(int, input().split()))
odd = [v for i, v in enumerate(L) if i % 2 == 0]
even = [v for i, v in enumerate(L) if i % 2 == 1]
if len(set(L)) == 1:
print((N//2))
exit()
if N == 2:
print((0))
exit()
c_odd = sorted(list(dict... | p03244 |
from collections import Counter
n = int(eval(input()))
num = list(map(int, input().split()))
num1 = []
num2 = []
ans = 0
for i in range(0, n, 2):
num1.append(num[i])
for i in range(1, n, 2):
num2.append(num[i])
num1 = Counter(num1).most_common()
num2 = Counter(num2).most_common()
if ... | from collections import Counter
n = int(eval(input()))
V = list(map(int, input().split()))
X = Counter([V[i] for i in range(0, n, 2)]).most_common()
Y = Counter([V[i] for i in range(1, n, 2)]).most_common()
ans = 0
if X[0][0] != Y[0][0]:
ans = n - X[0][1] - Y[0][1]
else:
if len(X) == 1 and len(Y)... | p03244 |
from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
A0 = []
A1 = []
for i in range(0, n, 2):
A0.append(A[i])
A1.append(A[i + 1])
C0 = Counter(A0).most_common()
C1 = Counter(A1).most_common()
if C0[0][0] != C1[0][0]:
ans = n - C0[0][1] - C1[0][1]
... | from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = Counter(A[0::2]).most_common()
T = Counter(A[1::2]).most_common()
if S[0][0] != T[0][0]:
ans = n - S[0][1] - T[0][1]
elif S[0][0] == T[0][0]:
if len(S) == 1 and len(T) > 1:
ans = n // 2 - T[0][1... | p03244 |
from sys import stdin
from itertools import groupby
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li1 = []
li2 = []
for i in range(n):
if i % 2 == 0:
li1.append(li[i])
else:
li2.append(li[i])
li1.sort()
li2.sort()
lin = []
lin2... | from sys import stdin
from itertools import groupby
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li1 = []
li2 = []
for i in range(n):
if i % 2 == 0:
li1.append(li[i])
else:
li2.append(li[i])
li1.sort()
li2.sort()
lin = []
lin2... | p03244 |
#!/usr/bin/env python3
import collections
N = int(eval(input()))
V = list(map(int, input().split()))
V1 = V[::2]
V2 = V[1::2]
if len(set(V1)) == 1 and len(set(V2)) == 1 and V1[0] == V2[0]:
print((len(V1)))
exit()
C1 = collections.Counter(V1)
C2 = collections.Counter(V2)
C1_s = sorted(list(C... | #!/usr/bin/env python3
import collections
N = int(eval(input()))
V = list(map(int, input().split()))
V1 = V[::2]
V2 = V[1::2]
C1 = collections.Counter(V1)
C2 = collections.Counter(V2)
C1_s = sorted(list(C1.items()), key=lambda x:x[1])[::-1]
C2_s = sorted(list(C2.items()), key=lambda x:x[1])[::-1]
ma... | p03244 |
#!/usr/bin/env python3
import collections
N = int(eval(input()))
V = list(map(int, input().split()))
V1 = V[::2]
V2 = V[1::2]
C1 = collections.Counter(V1)
C2 = collections.Counter(V2)
C1_s = sorted(list(C1.items()), key=lambda x:x[1])[::-1]
C2_s = sorted(list(C2.items()), key=lambda x:x[1])[::-1]
ma... | #!/usr/bin/env python3
import collections
N = int(eval(input()))
V = list(map(int, input().split()))
V1 = V[::2]
V2 = V[1::2]
C1 = collections.Counter(V1)
C2 = collections.Counter(V2)
C1_s = C1.most_common()
C2_s = C2.most_common()
max1 = C1_s[0][1]
index1 = C1_s[0][0]
max2 = C2_s[0][1]
index2 ... | p03244 |
a, b, c = list(map(int, input().split()))
if min(a, b) < c and c < max(a, b):
print('Yes')
else:
print('No') | a, b, c = list(map(int, input().split()))
if a <= c <= b or b <= c <= a:
print('Yes')
else:
print('No')
| p03067 |
A, B, C = list(map(int,input().split()))
print(('Yes' if A<C<B or A>C>B else 'No')) | A, B, C = list(map(int, input().split()))
print(('Yes' if A-C>0 and C-B>0 or A-C<0 and C-B<0 else 'No')) | p03067 |
a, b, c = list(map(int, input().split()))
if a < c < b or b < c <a:
print("Yes")
else:
print("No") | A, B, C = list(map(int, input().split()))
if A < C < B or B < C < A:
print("Yes")
else:
print("No") | p03067 |
A, B, C = list(map(int, input().split()))
if A < C and C < B:
ans = "Yes"
elif B < C and C < A:
ans = "Yes"
else:
ans = "No"
print(ans)
| def LI():
return list(map(int, input().split()))
A, B, C = LI()
if A < C < B or B < C < A:
ans = "Yes"
else:
ans = "No"
print(ans)
| p03067 |
while True:
n = int(eval(input()))
if n == 0:
break
tlst = []
qlst = []
for _ in range(n):
m, a, b = list(map(int, input().split()))
qlst.append((m, a, b))
tlst.append(a)
tlst.append(b)
tlst.append(b - 1)
tlst = sorted(list(set(tlst)))
tlst.sort()
tdic = {}
for i... | while True:
n = int(eval(input()))
if n == 0:
break
tlst = []
qlst = []
for _ in range(n):
m, a, b = list(map(int, input().split()))
qlst.append((m, a, b))
tlst.append(a)
tlst.append(b)
tlst = sorted(list(set(tlst)))
tlst.sort()
tdic = {}
for i, t in enumerate(tlst):
... | p00231 |
# from line_profiler import LineProfiler
from collections import deque
def main():
while(True):
W, H = list(map(int, input().split()))
# print(W,H)
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]... | # from line_profiler import LineProfiler
from collections import deque
def main():
while(True):
W, H = list(map(int, input().split()))
# print(W,H)
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]... | p00223 |
from collections import deque
while(True):
W, H = list(map(int, input().split()))
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]*(W+2) for _ in range(H+2)]
for i in range(1,H+1):
for j,a in enumerate(input().split()... | # from line_profiler import LineProfiler
from collections import deque
def main():
while(True):
W, H = list(map(int, input().split()))
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]*(W+2) for _ in range(... | p00223 |
# from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | p00223 |
# from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | p00223 |
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def cmp1(a,b,stt):
l = ... | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def cmp1(a,b):
l = []
... | p02745 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
from functools import lru_cache
from itertools import permutations
import bisect
INF = 2**62-1
def read_str():
return input().strip()
def slv(A, B, C):
@lru_cache(maxsize=None)
def g(x, y):
m = []
for i in range(len(x)):
for j in range(min(... | p02745 |
def match(ch1, ch2):
return ch1 == ch2 or ch1 == '?' or ch2 == '?'
def solve():
MAXLEN = 2000
a = input()
b = input()
c = input()
lA = len(a); lB = len(b); lC = len(c)
MAXLEN = max(lA, lB, lC)
ab = [True for i in range(10*MAXLEN)]
ac = [True for i in range(10*MAXLEN)]
... | def match(ch1, ch2):
return ch1 == ch2 or ch1 == '?' or ch2 == '?'
def solve():
MAXLEN = 2000
a = input()
b = input()
c = input()
lA = len(a); lB = len(b); lC = len(c)
MAXLEN = max(lA, lB, lC)
ab = [True for i in range(10*MAXLEN)]
ac = [True for i in range(10*MAXLEN)]
... | p02745 |
def solve(N):
d = 10 ** 7
index = d // 2
while True:
k1 = index * (index - 1) // 2
k2 = index * (index + 1) // 2
if k1 <= N < k2:
break
elif k1 < N:
index = (index + d) // 2
else:
d = index
index = index // 2... | def solve(N):
d = 10 ** 7
index = d // 2
while True:
k1 = index * (index - 1) // 2
k2 = index * (index + 1) // 2
if k1 < N <= k2:
break
elif k1 <= N:
index = (index + d) // 2
else:
d = index
index = index // ... | p03920 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
for k in range(1,n+1):
s = k*(k+1)//2
if s==n:
res = set(range(1,k+1))
break
if s>=n and (s-n)<=k:
res = set(range(1,k+1))
res.remove(s-n)
for r in res:
print(r)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
for k in range(1,n+1):
s = k*(k+1)//2
if s==n:
res = set(range(1,k+1))
break
if s>=n and (s-n)<=k:
res = set(range(1,k+1))
res.remove(s-n)
break
for r in res:
print(r)
| p03920 |
N = int(eval(input()))
n = tri = 1
while tri < N:
n += 1
tri += n
for i in range(1,n+1):
if i == tri - N: continue
print(i) | N = int(input())
m = s = 1
while s < N:
m += 1
s += m
ans = [m]
rem = N-m
if rem:
for n in range(m-1,0,-1):
if n <= rem:
ans.append(n)
rem -= n
if rem==0: break
print(*reversed(ans), sep='\n')
| p03920 |
n = int(eval(input()))
s = 0
cnt = 1
while True:
s += cnt
if s < n <= s+cnt+1:
use = cnt+1
sub = use*(use+1)//2 - n
for i in range(use):
if i+1 == sub:
continue
print((i+1))
exit()
else:
cnt += 1
| n = int(eval(input()))
if n == 1:
print((1))
exit()
s = 0
cnt = 1
while True:
s += cnt
if s < n <= s+cnt+1:
use = cnt+1
sub = use*(use+1)//2 - n
for i in range(use):
if i+1 == sub:
continue
print((i+1))
exit()
el... | p03920 |
# Author: cr4zjh0bp
# Created: Sun Mar 22 23:25:40 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf ... | # Author: cr4zjh0bp
# Created: Sun Mar 22 23:25:40 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf ... | p03698 |
s = input()
l = list(s)
ans = "yes"
l.sort()
for i in range(len(s)-1):
if l[i] == l[i+1]:
ans = "no"
break
print(ans) | L = list(input())
print("yes" if len(L) == len(set(L)) else "no")
| p03698 |
def dist(a,b,c,d,n):
L=3**n
area1=(a//L)*3+b//L
if area1==2:
b=3*L-b-1
d=3*L-d-1
if area1==3:
a,b=b,a
c,d=d,c
if area1==5:
a,b=3*L-b-1,a
c,d=3*L-d-1,c
if area1 in [6,7]:
a=L*3-a-1
c=L*3-c-1
if area1==8:
a... | def dist(a,b,c,d,n):
L=3**n
area1=(a//L)*3+b//L
if area1==2:
b=3*L-b-1
d=3*L-d-1
if area1==3:
a,b=b,a
c,d=d,c
if area1==5:
a,b=3*L-b-1,a
c,d=3*L-d-1,c
if area1 in [6,7]:
a=L*3-a-1
c=L*3-c-1
if area1==8:
a... | p02746 |
def solve(a, b, c, d):
for k in range(29, -1, -1):
block_size = 3**k
box_size = block_size * 3
x1, y1, x2, y2 = [x//block_size for x in (a, b, c, d)]
x1, x2 = sorted([x1, x2])
y1, y2 = sorted([y1, y2])
if x1!=x2 and y1!=y2:
return abs(a-c)+abs(b-d)
if x1==x2 and x1%3==1 and ... | def solve(a, b, c, d):
a, c = sorted([a, c])
b, d = sorted([b, d])
for k in range(30, 0, -1):
block_size = 3**k
box_size = block_size // 3
x1, y1, x2, y2 = [x//box_size for x in (a, b, c, d)]
if x1 != x2 and y1 != y2:
return c-a + d-b
elif x1 == x2 and x1%3 == 1 and (y1+1)//3*3+... | p02746 |
from sys import stdin, stdout
import math
import bisect
import re
s, w = list(map(int, stdin.readline().strip().split()))
stdout.writelines('unsafe\n' if w >= s else 'safe\n')
| a, b = [int(a) for a in input().split()]
print(("unsafe" if a <= b else "safe")) | p02699 |
s,w = list(map(int,input().split()))
if s <= w:
print("unsafe")
else:
print("safe") | s,w = list(map(int,input().split()))
if w >= s:
print("unsafe")
else:
print("safe") | p02699 |
import sys
input = lambda: sys.stdin.readline().rstrip()
safe = lambda boolean: print('safe') if boolean else print('unsafe')
ints = lambda: list(map(int, input().split()))
s,w = ints()
safe(s>w)
| s,w=map(int,input().split());print('safe')if s>w else print('unsafe')
| p02699 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
s, w = list(map(int, readline().split()))
if w >= s:
print("unsafe")
else:
print("safe")
if __name__ == '__main__':
main()
| s, w = list(map(int, input().split()))
if w >= s:
print("unsafe")
else:
print("safe") | p02699 |
a, b = [int(a) for a in input().split()]
print(("unsafe" if a <= b else "safe")) | a, b=[int(yy) for yy in input().split()]
if b>=a:
print('unsafe')
else:
print("safe")
| p02699 |
def main():
ans = 'safe'
s,w = list(map(int, input().split()))
if w >= s:
ans = 'unsafe'
print(ans)
if __name__ == '__main__':
main() | s,w = list(map(int, input().split()))
if s <= w:
print('unsafe')
else:
print('safe') | p02699 |
s , w = list(map(int, input().split()))
if w>=s:
print("unsafe")
else:
print("safe") | S, W =list(map(int,input().split()))
if W>=S:
print("unsafe")
else:
print("safe") | p02699 |
s, w = list(map(int, input().split()))
if w >= s:
print('unsafe')
else:
print('safe') | s, w = map(int, input().split())
print('unsafe') if w >= s else print('safe')
| p02699 |
s,w = (int(x) for x in input().split())
# xl = map(int, input().split())
if w >= s:
print('unsafe')
else:
print('safe')
| s,w = (int(x) for x in input().split())
if w >= s:
print('unsafe')
else:
print('safe')
| p02699 |
S, W = list(map(int, input().split()))
if S>W:
print("safe")
else:
print("unsafe") | s, w = list(map(int, input().split()))
if s>w:
print("safe")
else:
print("unsafe") | p02699 |
def main():
s,w = list(map(int,input().split()))
if s <= w:
print("unsafe")
else:
print("safe")
if __name__ == '__main__':
main()
| def main():
s,w = list(map(int,input().split()))
answer = "unsafe" if w >= s else "safe"
print(answer)
if __name__ == '__main__':
main()
| p02699 |
s,w = list(map(int,input().split()))
print((["safe","unsafe"][w>=s])) | s,w=list(map(int,input().split()));print((["","un"][w>=s]+"safe")) | p02699 |
import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
s, w = list(map(int, rl().split()))
if s > w:
print('safe')
else:
print('unsafe')
if __name__ == '__main__':
solve()
| def solve():
S, W = list(map(int,input().split()))
if S > W:
print("safe")
else:
print("unsafe")
if __name__ == '__main__':
solve()
| p02699 |
s,w=list(map(int,input().split()))
if s>w:
print("safe")
else:
print("unsafe") | s,w=list(map(int,input().split()))
if s>w:
print("safe")
elif s<=w:
print("unsafe") | p02699 |
S, W = list(map(int, input().split()))
if W >= S:
print('unsafe')
else:
print('safe') | S, W = input().split()
if int(W) >= int(S):
print('unsafe')
else:
print('safe')
| p02699 |
def issafe(S,W):
if S > W:
return "safe"
return "unsafe"
S,W = list(map(int,input().split()))
print((issafe(S,W)))
| def main():
s,w = list(map(int,input().split()))
if s>w:
print("safe")
else:
print("unsafe")
main()
| p02699 |
s, w = list(map(int,input().split()))
if s <= w:
print('unsafe')
else:
print('safe') | s,w = list(map(int,input().split()))
if s <= w:
print('unsafe')
elif s > w:
print('safe')
| p02699 |
MAX_VAL = 99999999999
while 1:
n,m = list(map(int,input().split()))
if n == 0:break
costs = {x:[] for x in range(1,n+1)}
min_cost = [[MAX_VAL for x in range(2)] for y in range(n+1)]
for i in range(m):
a,b,c = list(map(int,input().split()))
costs[a].append((b,c))
cost... | MAX_V = 999999999999999999999
while 1:
n,m = list(map(int,input().split()))
if n == 0:break
costs = {x:[] for x in range(1,n+1)}
passed = [[0 for x in range(2)] for y in range(n+1)]
result = [MAX_V,MAX_V]
for i in range(m):
a,b,c = list(map(int,input().split()))
costs[a]... | p00244 |
def resolve():
n,x=list(map(int, input().split()))
l=list(map(int, input().split()))
l.sort()
num=0
cnt=0
for i in range(n-1):
if num+l[i]<=x:
num+=l[i]
cnt+=1
if l[n-1]==x-num:
cnt+=1
print(cnt)
resolve() | def resolve():
import sys
n,x=list(map(int, input().split()))
l=list(map(int, input().split()))
l.sort()
cnt=0
for i in range(n):
if l[i]<=x:
x-=l[i]
cnt+=1
else:
print(i)
sys.exit()
if cnt==n and x>0:
cnt-... | p03254 |
def memoize(f):
table = dict()
def wrapper(x, i, a):
key = (x, i)
if key in table:
return table[key]
else:
v = f(x, i, a)
table[key] = v
return v
return wrapper
@memoize
def solve(x, i, a):
if i == len(a) - 1:
... | def main():
n, x = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
a.sort()
cnt = 0
for i, y in enumerate(a):
if x < y:
break
x -= y
cnt += 1
else:
# distribute to all child
if x != 0:
cnt -= 1... | p03254 |
n,x=list(map(int,input().split()))
List=list(map(int,input().split()))
List.sort()
ans=0
if sum(List)==x:
print(n)
exit()
else:
for i in range(len(List)-1):
if x>=List[i]:
ans+=1
x-=List[i]
else:
break
print(ans) | n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
cnt=0
if sum(a)==x:
print(n)
exit()
else:
for i in range(n-1):
if a[i]<=x:
x-=a[i]
cnt+=1
print(cnt) | p03254 |
n, x = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
i = 0
ans = 0
while x > 0 and i<= n-1:
if x >= l[i]:
x -= l[i]
if i == n-1:
if x == 0:
ans += 1
break
else:
break
else:
i += 1
ans += 1
else:
x = 0
... | n, x = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
ans = 0
for i, a in enumerate(A):
if i != n-1:
if x >= a:
ans += 1
x -= a
else:
break
else:
if x == a:
ans += 1
else:
bre... | p03254 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest-
# Atcoder_Grand_Contest-
# TODO https://atcoder.jp/contests/abc/tasks/abc_
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title,t... | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest027-a
# https://atcoder.jp/contests/agc027/tasks/agc027_a
def countJoyChild(haveCookie,joyMeterList):
joyMeterList.sort()
childsCount = len(joyMeterList)
sendCookieRangeMax = list(range(0,childsCount,+1))
sendCookieChilds = 0
for i in sendCookieRangeMax :
... | p03254 |
n,x= list(map(int, input().split()))
a= sorted(list(map(int, input().split())))
cnt=0
for i in range(n):
if x>=a[i]:
cnt+=1
x-=a[i]
else:
break
if i==n-1 and x>0:
cnt-=1
print(cnt) | n,x=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
if a[0]>x:
print((0))
exit()
cnt=1
for i in range(1,n):
a[i]+=a[i-1]
if a[i]>x:
break
cnt+=1
if cnt==n and a[-1]!=x:
cnt-=1
print(cnt) | p03254 |
N, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(N):
if x >= a[i]:
ans += 1
x -= a[i]
else:
break
if i == N - 1:
if x != 0:
ans -= 1
print(ans) | n, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(n):
x -= a[i]
if x < 0:
break
if i == n-1:
if x > 0:
break
ans += 1
print(ans) | p03254 |
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans = 0
if x > sum(a):
print((n-1))
else:
for _a in a:
x -= _a
if x < 0:
print(ans)
exit()
else:
... | n, x = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
ans = 0
for a in A:
x -= a
if x < 0:
break
else:
ans += 1
if 0 < x:
ans -= 1
print((max(ans, 0)))
| p03254 |
import itertools
n,x=list(map(int,input().split()))
a=list(map(int, input().split()))
if sum(a)<x:
print((len(a)-1))
else:
ans=0
for i in range(1,n+1):
for v in itertools.combinations(a,i):
if sum(v)<=x:
ans=len(v)
print(ans) | n,x=list(map(int,input().split()))
a=list(map(int, input().split()))
ans=0
rest=x
target=sorted(a)
if sum(target)<x:
print((n-1))
elif sum(target)==x:
print(n)
else:
for i in range(n):
rest-=target[i]
if rest<0:
ans=i
break
if rest==0:
... | p03254 |
N,x = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if x < min(A):
print((0))
exit()
A.sort()
ans = 0
i = 0
while x > 0 and ans < N:
if x >= A[i]:
x -= A[i]
ans += 1
i += 1
if x > 0:
ans -= 1
print(ans)
| N,x = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if x < min(A):
print((0))
exit()
A.sort()
ans = 0
i = 0
while x > 0 and ans < N:
if x >= A[i]:
x -= A[i]
ans += 1
i += 1
else:
x = 0
break
if x > 0:
ans -= 1
... | p03254 |
n, x = [int(i) for i in input().split()]
A = sorted([int(i) for i in input().split()])
ans = 0
for i in range(n):
if A[i] <= x:
if i == n - 1:
if x == A[i]:
ans += 1
else:
x -= A[i]
ans += 1
else:
break
print(ans)
| # https://atcoder.jp/contests/agc027/tasks/agc027_a
n, x = [int(i) for i in input().split()]
A = sorted([int(i) for i in input().split()])
if sum(A) == x:
ans = n
elif sum(A) < x:
ans = n - 1
else:
ans = 0
for i in range(n):
if A[i] <= x:
if i == n - 1:
... | p03254 |
import itertools
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(0)
comb=list(itertools.combinations_with_replacement(a,n))
ans=[]
for i in comb:
per=sum(i)
if per==x:
if 0 in i:
ans.append(len(set(i))-1)
else:
ans.append(len(set(i... | cnt=0
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
for i,j in enumerate(a):
if x>=j:
x-=j
cnt+=1
if i==(n-1) and x>0:
cnt-=1
print(cnt)
| p03254 |
n,x=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
if x>=a[i]:
ans+=1
x-=a[i]
else:
break
if ans == n:
if x!=0:
ans-=1
print(ans) | n,x=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
ans=0
a.sort()
for i in range(n):
if x>=a[i]:
if i == n-1:
if a[i]==x:
ans+=1
else:
x-=a[i]
ans+=1
else:
break
print(ans) | p03254 |
N, V = list(map(int, input().split()))
C = list(map(int, input().split()))
assert len(C)==N
W = [1 for i in range(N)]
F = [0 for i in range(V+1)]
def pack01(F, c, w):
"""
f: states
c: cost
w: value
v: volume
"""
for v in range(c, V+1)[::-1]:
F[v] = max(F[v], F[v-... | N, V = list(map(int, input().split()))
C = list(map(int, input().split()))
N = len(C)
if sum(C)==V:
print(N)
else:
cnt = 0
for c in sorted(C):
if V-c>0:
cnt += 1
V -= c
elif V-c==0:
cnt += 1
break
else:
break
print((min(cnt, N-1)))
| p03254 |
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
use_list = []
for i in range(2**N):
use_list.append(list(map(int, list(bin(i)[2::].zfill(N)))))
for u in use_list:
s = 0
for i in range(N):
if u[i] == 1:
s += a[i]
if s < x:
... | N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [[]]
a.sort()
ans = 0
f = False
for b in a:
if b <= x:
ans += 1
x -= b
f = True
else:
f = False
if x > 0 and f:
ans -= 1
print(ans)
| p03254 |
n, x = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
cnt = 0
flag = False
for i in a:
if i <= x:
x -= i
cnt += 1
if x == 0:
flag = True
else:
break
else:
if not flag:
cnt -= 1
print(cnt) | n, x = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
cnt = 0
flag = False
for i in a:
if i <= x:
x -= i
cnt += 1
if x == 0:
break
else:
break
else:
cnt -= 1
print(cnt) | p03254 |
from collections import Counter,defaultdict,deque
from heapq import heapify,heappop,heappush
import sys,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return ... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))... | p03254 |
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
count = 0
for i in range(n):
if i == n-1:
if x == a[i]:
count += 1
elif x >= a[i]:
count += 1
x -= a[i]
print(count) | n,x = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
cnt = 0
while a[cnt] <= x:
x = x - a[cnt]
cnt += 1
if cnt >= len(a):
break
if x > 0 and len(a) == cnt:
cnt -= 1
print(cnt) | p03254 |
N, x = [int(i) for i in input().split(" ")]
lst = [int(i) for i in input().split(" ")]
lst.sort()
cnt = 0
for i in range(0,N-1):
if x >= lst[i]:
x -= lst[i]
cnt += 1
else:
break
if x == lst[N-1]:
cnt +=1
print(cnt) | N, x = [int(i) for i in input().split(" ")]
lst = [int(i) for i in input().split(" ")]
lst.sort()
cnt = 0
for i in range(0,N-1):
if x >= lst[i]:
x -= lst[i]
cnt += 1
else:
break
print((cnt+(x==lst[N-1])))
| p03254 |
import sys
input = lambda :sys.stdin.readline().rstrip()
N, x = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
if x > sum(A):
cnt = -1
else:
cnt = 0
for i in range(N):
if x - A[i] >= 0:
cnt += 1
x -= A[i]
if x <= 0:
break
#print(... | n, x = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
if sum(A) < x:
cnt = -1
else:
cnt = 0
for a in A:
x -= a
if x >= 0:
cnt += 1
if x <= 0:
print(cnt)
exit()
print(cnt) | p03254 |
#!/usr/bin/env python
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a = sorted(a)
if x < a[0]:
print((0))
exit()
cnt = 0
al = False
for i in range(n):
if x >= a[i]:
x -= a[i]
cnt += 1
else:
break
if i == n-1:
al = Tr... | #!/usr/bin/env python
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a = sorted(a)
if x < a[0]:
print((0))
exit()
if sum(a) < x:
print((n-1))
exit()
cnt = 0
for i in range(n):
if x >= a[i]:
x -= a[i]
cnt += 1
ans = cnt
print(ans... | p03254 |
from itertools import permutations
n, m = list(map(int, input().split()))
list_AB = [ list(map(int,input().split(" "))) for i in range(m)]
list_MAP = [[0]*n for _ in range(n)]
list_N = [i for i in range(2, n+1)]
for a, b in list_AB:
list_MAP[a-1][b-1] = 1
list_MAP[b-1][a-1] = 1
ans = 0
for l in p... | n, m = list(map(int, input().split()))
list_MAP = [[0]*n for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
list_MAP[a-1][b-1] = 1
list_MAP[b-1][a-1] = 1
dp = [[0]*n for _ in range(1<<n)]
dp[1][0] = 1
for num in range(1<<n):
for v in range(n):
if num & (1<<v... | p03805 |
n, m = list(map(int, input().split()))
list_MAP = [[0]*n for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
list_MAP[a-1][b-1] = 1
list_MAP[b-1][a-1] = 1
dp = [[0]*n for _ in range(1<<n)]
dp[1][0] = 1
for num in range(1<<n):
for v in range(n):
if num & (1<<v... | n, m = list(map(int, input().split()))
list_MAP = [[0]*n for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
list_MAP[a-1][b-1] = 1
list_MAP[b-1][a-1] = 1
dp = [[0]*n for _ in range(1<<n)]
dp[1][0] = 1
for num in range(1<<n):
for v in range(n):
if num & (1<<v... | p03805 |
import itertools
n, m = list(map(int, input().split()))
AB = []
for i in range(m):
AB.append(list(map(int, input().split())))
ct = 0
N_lis = [(i + 2) for i in range(n - 1)]
Pat = itertools.permutations(N_lis)
for one_case in Pat:
tmp = 1
all_flag = True
for j in one_case:
flag = Fa... | n, m = list(map(int, input().split()))
P = [[0] * n for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
P[a-1][b-1] = 1
P[b-1][a-1] = 1
#dp[S][v] := 頂点０から出発し、集合Sに含まれる頂点を全て訪れるpathのうち、頂点vが最後になるようなpathの総数
dp = [[0] * n for _ in range(1 << n)]
#dpの初期化 dp({0}, 0) = 1
dp[1]... | p03805 |
import copy
n,m = list(map(int, input().split()))
paths = [[] for _ in range(n)]
for i in range(m):
a,b = list(map(int, input().split()))
paths[a-1].append(b-1)
paths[b-1].append(a-1)
ans = 0
checked = [False for _ in range(n)]
def solve(i, c):
c[i] = True
global ans
if c.count(F... | N, M = list(map(int, input().split()))
if M == 0:
print((0))
exit()
es = [[] for i in range(M+1)]
for i in range(M):
a, b = list(map(int, input().split()))
a,b = a-1, b-1
es[a].append(b)
es[b].append(a)
def dfs(v, visited, es, cnt):
#print("--------------")
#print((v,... | p03805 |
def perm(k,x):
v=[]
for i in range(x):
c=k%x+2
if c not in v:
v.append(c)
k//=x
else:
return []
return v
N,M=list(map(int,input().split()))
e=[[False for i in range(N+1)] for i in range(N+1)]
for i in range(M):
a,b=list(ma... | import itertools as it
N,M=list(map(int,input().split()))
e=[[False for j in range(N+1)] for i in range(N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
e[a][b]=e[b][a]=True
# print(e) #DB
ans=0
l=list(range(2,N+1))
for p in it.permutations(l,N-1):
q=(1,)+p
# print(q) #DB
... | p03805 |
from typing import List, Tuple
def main():
n, m = list(map(int, input().split()))
g = []
for _ in range(m):
a, b = list(map(int, input().split()))
g.append((a, b))
print((osp(n, g)))
def osp(n: int, g: List[Tuple[int, int]]) -> int:
v = [False] * n
return dfs(... | from typing import List, Tuple
def main():
n, m = list(map(int, input().split()))
g = []
for _ in range(m):
a, b = list(map(int, input().split()))
g.append((a, b))
print((osp(n, g)))
def osp(n: int, g: List[Tuple[int, int]]) -> int:
v = [False] * n
g = set(g)
... | p03805 |
N,M=list(map(int,input().split()))
original_paths={}
for n in range(1,N+1):
original_paths[n]=[]
for m in range(1,M+1):
s,e=list(map(int,input().split()))
original_paths[s].append(e)
original_paths[e].append(s)#以上地図(原本)作り
visited=[1]
current_point=1
answer=0
import copy
paths=copy.deep... | N,M=list(map(int,input().split()))
original_paths={}
paths={}
for n in range(1,N+1):
original_paths[n]=[]
paths[n]=[]
for m in range(1,M+1):
s,e=list(map(int,input().split()))
original_paths[s].append(e)
original_paths[e].append(s)
paths[s].append(e)
paths[e].append(s)#以上地図作り
... | p03805 |
ans = 0
def dfs(v, visitedNode, graph):
visitedNode[v] = 1
if all(visitedNode):
global ans
ans += 1
return
for node in graph[v]:
if visitedNode[node]:
continue
else:
dfs(node, visitedNode[:], graph)
N, M = list(map(int, input().... | ans = 0
def dfs(v, visitedNode, graph):
visitedNode[v] = 1
# print(visitedNode)
if all(visitedNode):
global ans
ans += 1
return
for node in graph[v]:
if visitedNode[node]:
# 探索済みならば、ほかの隣接候補へ。
continue
else:
# 未探索ならば... | p03805 |
n,m=list(map(int, input().split()))
q=[]
for i in range(m):
a,b=list(map(int, input().split()))
q.append([a,b])
q.append([b,a])
p=[[1]]
count=0
route=set()
while len(p)!=0:
p1=p.pop()
for i,j in q:
#print(i,j)
if i == p1[-1]:
if j not in p1:
... | n,m=list(map(int, input().split()))
q=[]
for i in range(m):
a,b=list(map(int, input().split()))
q+=[[a,b],[b,a]]
p=[[1]]
count=0
while p:
p1=p.pop()
if len(p1)==n:count+=1
else:
for i,j in q:
if i == p1[-1] and j not in p1:
p.append(p1+[j])
#prin... | p03805 |
from collections import deque
import copy
# https://atcoder.jp/contests/abc054/tasks/abc054_c
# n!の全探索が答えというのは知っているが、自分の開放の誤りを見つけるために自分のやり方でといてみる。
N, M = list(map(int, input().split()))
V = [[] for _ in range(N)]
cont = [0 for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
V... | import itertools
N, M = list(map(int, input().split()))
V = [[] for _ in range(N)]
bag = set()
for _ in range(M):
a, b = list(map(int, input().split()))
bag.add(a)
bag.add(b)
V[a-1].append(b)
V[b-1].append(a)
count = 0
for c in itertools.permutations(bag):
if not c[0] == 1:
... | p03805 |
N, M=list(map(int,input().split()))
a=[0]*0
b=[0]*0
choice=[0]*(N-1)
chosen_a=[0]*(N-1)
chosen_b=[0]*(N-1)
c_patern=0
for i in range(M):
a_tmp, b_tmp=list(map(int,input().split()))
a.append(a_tmp)
b.append(b_tmp)
# for i in range(M):
# c_point = [0] * N
# if a[i]==1:
# c_point[... | #ABC054C
import itertools
N, M=list(map(int,input().split()))
a=[0]*0
b=[0]*0
order=list(itertools.permutations(list(range(N-1)) ) )#0～N-2のN-1個の順列ができる。2を足すと、2～Nの配列。
c_patern=0
for i in range(M):
a_tmp, b_tmp=list(map(int,input().split()))
a.append(a_tmp)
b.append(b_tmp)
for i in range(len(order))... | p03805 |
def dfs(parent, connect, passed, N): #深さ優先探索
cnt = 0
passed.append(parent) #通った点をメモ
if len(passed) == N: #全ての点を通過したかの判定
cnt = 1
for next_ in connect[parent]:
if next_ in passed:
continue
cnt += dfs(next_, connect, passed, N) #全ての点を通るまで再帰. 戻り値の和で何通りかカウント
p... | N, M = list(map(int, input().split()))
Edge = [tuple(map(int, input().split())) for _ in range(M)]
Graph = [[] for _ in range(N)]
for a,b in Edge:
Graph[a-1].append(b-1)
Graph[b-1].append(a-1)
def dfs(v, seen):
global Graph
seen.add(v)
if len(seen) == N:
seen.remove(v)
... | p03805 |
N, M = list(map(int, input().split()))
Edge = [tuple(map(int, input().split())) for _ in range(M)]
Graph = [[] for _ in range(N)]
for a,b in Edge:
Graph[a-1].append(b-1)
Graph[b-1].append(a-1)
seen = set()
def dfs(v):
global Graph, seen
seen.add(v)
if len(seen) == N:
seen.remo... | N, M = list(map(int, input().split()))
Edge = [tuple(map(int, input().split())) for _ in range(M)]
Graph = [[] for _ in range(N)]
for a,b in Edge:
Graph[a-1].append(b-1)
Graph[b-1].append(a-1)
seen = set()
def dfs(v):
seen.add(v)
if len(seen) == N:
seen.remove(v)
return 1
... | p03805 |
# ABC054C - One-stroke Path
# graph theory
# an undirected unweighted graph is given
# -> count up paths which visit all the vertices exactly once
import sys
input = sys.stdin.readline
from itertools import permutations as perm
def main():
N, M = tuple(map(int, input().split()))
A = set(tuple(map... | # ABC054C - One-stroke Path
# an undirected unweighted graph is given
# -> count up paths which visit all the vertices exactly once
# exhaustive search
from itertools import permutations as perm
def main():
N, M = tuple(map(int, input().split()))
E = set(tuple(map(int, input().split())) for _ in rang... | p03805 |
import itertools
n, m = list(map(int, input().split()))
ab_list = [tuple(map(int, input().split())) for _ in range(m)]
path_list = sorted(iter for iter in itertools.permutations(list(range(2, n+1)), n-1))
counter = 0
for path_i in path_list:
path = (1, )+path_i
result_list = [True for s_e in zip(pa... | import itertools
n,m = list(map(int, input().split()))
edge_set = {tuple(map(int, input().split())) for _ in range(m)}
counter = 0
for i in itertools.permutations(list(range(2, n+1)), n-1):
path = [1] + list(i)
path_set = {tuple(sorted(edge)) for edge in zip(path, path[1:])}
if path_set <= edge_set... | p03805 |
n, m = list(map(int, input().split()))
sign = []
for i in range(n):
sign.append("o")
graph = []
for i in range(n):
graph.append([])
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
for j in range(n):
if a == j:
graph[j].append... | ###入力
n, m = list(map(int, input().split()))
###到達しているか否かのサイン
sign = []
for i in range(n):
sign.append("o")
###グラフ
graph = []
for i in range(n):
graph.append([])
###隣接行列
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
for j in range(n):
if a ... | p03805 |
import collections
def main():
N, M = list(map(int, input().split()))
graph = collections.defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
cur = [[1, set([1])]]
for _ in range(N-1):
temp = []... | import collections
def main():
N, M = list(map(int, input().split()))
graph = collections.defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
# print(graph)
cur = [[1, 1 << 1]]
for _ in range(N-... | p03805 |
import itertools
n, m = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(m)]
r = [[] for i in range(n + 1)]
ans = 0
for i in range(m):
r[l[i][0]].append(l[i][1])
r[l[i][1]].append(l[i][0])
p = []
for i in range(n):
p.append(i + 1)
p = list(itertools.permutations... | import itertools
n, m = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(m)]
r = [[] for i in range(n + 1)]
ans = 0
for i in range(m):
r[l[i][0]].append(l[i][1])
r[l[i][1]].append(l[i][0])
p = "2345678"[:n-1]
p = list(itertools.permutations(p))
for i in range(len(p... | p03805 |
n,m=list(map(int,input().split()))
edge=[list(map(int,input().split())) for i in range(m)]
ans=0
rout=[[0 for i in range(n)]]
rout[0][0]=1
for i in range(2,n+1):
rout2=[]
for j in range(len(rout)):
for k in range(n):
if rout[j][k]==0:
r=rout[j][:]
r[k]=i
rout2.append(r)... | import itertools
n,m=list(map(int,input().split()))
edge=[list(map(int,input().split())) for i in range(m)]
ans=0
nums=[i for i in range(1,n+1)]
rout=itertools.permutations(nums,n)
for r in rout:
if r[0]!=1:
continue
lim=0
while lim<n-1:
if [r[lim],r[lim+1]] in edge or [r[lim+1],r[lim]] in edge... | p03805 |
f=lambda:list(map(int,input().split()))
n,m=f()
g=[[0]*n for _ in range(n)]
for i in range(m):
a,b=f(); g[a-1][b-1]=g[b-1][a-1]=1
import itertools as it
c=0
for t in it.permutations(list(range(1,n))):
p,d=0,1
for q in t: d*=g[p][q]; p=q
c+=d
print(c) | f=lambda:list(map(int,input().split()))
n,m=f()
g=[[0]*n for _ in range(n)]
for i in range(m):
a,b=f(); g[a-1][b-1]=g[b-1][a-1]=1
import itertools as it
c=0
for t in it.permutations(list(range(1,n))):
p=0
for q in t:
if g[p][q]<1: break
p=q
else: c+=1
print(c) | p03805 |
f=lambda:list(map(int,input().split()))
n,m=f()
g=[[0]*n for _ in range(n)]
for _ in range(m):
a,b=f()
g[a-1][b-1]=1
g[b-1][a-1]=1
from itertools import *
p=[*permutations(list(range(1,n)))]
a=0
for t in p:
v=0
for c in t:
if g[v][c]: v=c
else: break
else: a+=1
print(a) | f=lambda:list(map(int,input().split()))
n,m=f()
g=[[] for _ in range(n)]
for _ in range(m):
a,b=f()
g[a-1]+=[b-1]
g[b-1]+=[a-1]
from itertools import *
p=[*permutations(list(range(1,n)))]
a=0
for t in p:
v=0
for c in t:
if c in g[v]: v=c
else: break
else: a+=1
print(a) | p03805 |
from itertools import permutations
n, m = list(map(int, input().split()))
pair = [tuple(map(int, input().split())) for i in range(m)]
num = [i+1 for i in range(n)]
box = []
for p in permutations(num):
if p[0] == 1:
box.append(p)
ans = 0
for p in box:
already = []
state = True
for i i... | from itertools import permutations
n, m = list(map(int, input().split()))
pair = [tuple(map(int, input().split())) for i in range(m)]
num = [i for i in range(1,n+1)]
ans = 0
for p in permutations(num):
if p[0] != 1:
continue
already = []
state = True
for i in range(n-1):
if p[... | p03805 |
def dfs(t):
if 0 not in already:
return 1
allReach=0
for i in range(n):
if connect[t][i]==1 and already[i]==0:
already[i]=1
allReach+=dfs(i)
already[i]=0
return allReach
n,m=list(map(int,input().split()))
connect=[[0 for i in range(n)]for ... | def dfs(t):
if 0 not in already:#全ての辺を訪問していた場合
return 1
allReach=0
for i in range(n):
if connect[t][i]==1 and already[i]==0:#辺があり、訪問しいない場合
already[i]=1
allReach+=dfs(i)
already[i]=0
return allReach
n,m=list(map(int,input().split()))
connec... | p03805 |
def dfs(v,n,visited):
all_visted=1
for i in range(n):
if visited[i]==0:
all_visted=0
if all_visted==1:
return 1
ret=0
for i in range(n):
if path[v][i]==0:
continue
if visited[i]==1:
continue
visited[i]=1
... | def dfs(v,n,visited):
all_visted=1
for i in range(n):
if visited[i]==0:
all_visted=0
if all_visted==1:
return 1
count=0#全ての辺を訪問する回数を格納する変数
for i in range(n):
if path[v][i]==0:#辺がないとき、つまり隣接していない時
continue
if visited[i]==1:#既に訪問している
... | p03805 |
n,m=list(map(int,input().split()))
def dfs(now,depth):
if used[now]:
return 0
if depth==n:
return 1
used[now]=1
ans=0
for i in range(n):
if connect[now][i]:
ans+=dfs(i,depth+1)
used[now]=0
return ans
edge=[[int(i)for i in input().split()]for i... | n,m=list(map(int,input().split()))
def dfs(now,depth):#現在見ている点、今まで列挙した頂点数
if used[now]:
return 0
if depth==n:
return 1
used[now]=1#使用済みグラフを立てる
ans=0#出力値を数える変数
for i in range(n):#全部の遷移先を調べる
if connect[now][i]:#nowから繋がっている頂点であれば遷移を試す。
ans+=dfs(i,depth+1)
... | p03805 |
n,m=list(map(int,input().split()))
def dfs(now,depth):#現在見ている点、今まで列挙した頂点数
if used[now]:
return 0
if depth==n:
return 1
used[now]=1#使用済みグラフを立てる
ans=0#出力値を数える変数
for i in range(n):#全部の遷移先を調べる
if connect[now][i]:#nowから繋がっている頂点であれば遷移を試す。
ans+=dfs(i,depth+1)
... | def dfs(now,depth):
if visited[now]:
return 0
if depth==n:
return 1
visited[now]=1
ans=0
for i in range(n):
if connect[now][i]==1:
ans+=dfs(i,depth+1)
visited[now]=0
return ans
n,m=list(map(int,input().split()))
visited=[0]*n
edge=[[int(i)for... | p03805 |
import itertools
N, M = list(map(int, input().split()))
ab=[]
for _ in range(M):
ab.append(tuple(map(int, input().split())))
lst=[[] for _ in range(N+1)]
for el in ab:
lst[el[0]].append(el[1])
lst[el[1]].append(el[0])
#print(lst)
count=0
for permu in itertools.permutations(list(range(1,N+1)... | N, M = list(map(int, input().split()))
ab=[]
for _ in range(M):
ab.append(tuple(map(int, input().split())))
lst=[[] for _ in range(N+1)]
for el in ab:
lst[el[0]].append(el[1])
lst[el[1]].append(el[0])
#print(lst)
seen=[False]*(N+1)
todo=[]
counter=0
def func(n):
global counter
... | p03805 |
from itertools import permutations
n,m=list(map(int,input().split()))
es=set()
for _ in range(m):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
es|={(u,v),(v,u)}
res=0
for p in permutations(list(range(n))):
if p[0]!=0: continue
if all((p[i],p[i+1]) in es for i in range(n-1)):
... | from itertools import permutations
n,m=list(map(int,input().split()))
es=set()
for _ in range(m):
u,v=list(map(int,input().split()))
es|={(u-1,v-1),(v-1,u-1)}
print((sum(all((u,v) in es for u,v in zip(p,p[1:]))
for p in permutations(list(range(n))) if p[0]==0)))
| p03805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.