code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
---|---|---|---|---|---|---|
# ABC160-B
import sys
def I(): return int(sys.stdin.readline().rstrip())
X = I()
print(1000*(X//500) + 5*((X % 500)//5))
| x = int(input())
ans = 0
ans += 1000*(x//500)
x %= 500
ans += 5*(x//5)
print(ans) | 1 | 42,773,740,580,820 | null | 185 | 185 |
import sys
import fractions
def lcm(a,b):
return int(a*b/fractions.gcd(a,b))
if __name__ == '__main__':
for line in sys.stdin:
a,b = map(int,line.split())
print(int(fractions.gcd(a,b)),lcm(a,b)) | import sys
def gcd(m, n):
if n > m:
m, n = n, m
if n == 0:
return m
else:
return gcd(n, m % n)
for line in sys.stdin:
try:
a, b = [int(i) for i in line.split()]
g = gcd(a, b)
l = a * b / g
print("%d %d" % (g, l))
except:
break | 1 | 658,497,322 | null | 5 | 5 |
#C
x, n = map(int, input().split())
if n ==0:
print(x)
else:
p = list(map(int, input().split()))
num = list(range(-1, 102))
num_removed=num
for i in range(len(p)):
num_removed=[num_removed for num_removed in num_removed if num_removed != p[i]]
num_list=[]
for i in num_removed:
num_list.append(abs(x-i))
min_index=min([i for i, j in enumerate(num_list) if j == min(num_list)])
print(num_removed[min_index]) | def cal_puddle(puddle):
depth = 0
score = 0
for s in puddle:
if s == "\\":
score += depth + 0.5
depth += 1
elif s == "/":
depth -= 1
score += depth + 0.5
elif s == "_":
score += depth
if depth == 0:
return int(score)
return int(score)
def get_puddles(diagram):
hight = 0
top_list = []
in_puddle = True
for index, s in enumerate(diagram + "\\"):
if s == "/":
in_puddle = True
hight += 1
if s == "\\":
if in_puddle:
in_puddle = False
top_list.append([hight, index])
hight -= 1
puddles = []
prev_hight = 0
hight_list = [h for h, i in top_list]
i = 0
while i < len(top_list) - 1:
cur_top = top_list[i]
next_tops = list(filter(lambda top:cur_top[0] <= top[0], top_list[i + 1:]))
#print(next_tops)
if next_tops:
next_top = next_tops[0]
puddles.append((cur_top[1], next_top[1]))
i = top_list.index(next_top)
else:
cur_top[0] -= 1
cur_top[1] += diagram[cur_top[1] + 1:].index("\\") + 1
#print(hight_list)
#print(top_list)
#print(puddles)
return puddles
def main():
diagram = input()
result = []
for s,e in get_puddles(diagram):
result.append(cal_puddle(diagram[s:e]))
print(sum(result))
print(str(len(result)) + "".join([" " + str(i) for i in result]))
if __name__ == "__main__":
main() | 0 | null | 7,154,285,874,218 | 128 | 21 |
from collections import deque
def calculate_area(lines):
q = deque()
partial_area = 0
areas = []
total_area = 0
for i, line in enumerate(lines):
if line == "\\":
q.append(i)
elif line == "/":
if q:
num = q.pop()
partial_area = i - num
total_area += partial_area
for p_area in areas[::-1]:
if p_area[0] > num:
partial_area += areas.pop()[1]
else:
break
areas.append([num, partial_area])
areas_strigified = [str(v) for i, v in areas]
print(total_area)
if total_area:
print("{} {}".format(len(areas), ' '.join(areas_strigified)))
else:
print(0)
if __name__ == "__main__":
data = input()
calculate_area(data)
| input()
cnt = 0
x = ""
for s in input():
if x != s:
cnt += 1
x = s
print(cnt) | 0 | null | 84,718,680,161,180 | 21 | 293 |
import math
t1,t2 = map(int,(input().split(' ')))
a1,a2 = map(int,(input().split(' ')))
b1,b2 = map(int,(input().split(' ')))
n = t1*a1+t2*a2
m = t1*b1+t2*b2
if(n==m):
print("infinity")
exit(0)
ans1 = max(0,math.ceil((b1-a1)*t1/(n-m)))
ans2 = max(0,math.ceil((t1*(b1-a1)+t2*(b2-a2))/(n-m))-1)
#if((t1*(b1-a1))%(n-m) == 1):
# ans3 = 1
#else:
# ans3 = 0
ans3 = max(0,math.floor(t1*(b1-a1)/(n-m))+1)
print(max(ans1+ans2+ans3-1,0)) | N = int(input())
cnt = 0
for a in range(1, N):
for b in range(a, N, a):
cnt += 1
print(cnt)
| 0 | null | 67,373,728,073,830 | 269 | 73 |
from math import gcd
def lcm(a,b):return (a*b)//(gcd(a,b))
def f(x):
cnt=0
while(x%2==0):
cnt+=1
x=x//2
return cnt
n,m=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x: x//2,a))
t=f(a[0])
for i in range(n):
if(f(a[i])!=t):
print(0)
exit()
a[i]=a[i]//(2**t)
m=m//(2**t)
l=1
for i in range(n):
l=lcm(l,a[i])
if(l>m):
print(0)
exit()
m=m//l
print((m+1)//2) | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 10 ** 9 +7
N, K = map(int, readline().split())
# s = [0] * (N+1)
# g = [0] * (N+1)
# g[0] = N % mod
# for i in range(1,N+1):
# s[i] += (s[i-1] + i ) % mod
# g[i] += (g[i-1] + N - i) % mod
# ans = (sum(g[K-1:]) % mod - sum(s[K-1:]) % mod + N-K+2) % mod
# print(ans)
k = np.arange(K,N+2,dtype = np.int64)
low = k*(k-1)//2
high = k*(2*N - k + 1) //2
cnt = high-low+1
print(sum(cnt)%mod) | 0 | null | 67,499,409,810,140 | 247 | 170 |
import sys
while True:
h, w = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 ==h and 0 == w:
break
for i in range( h ):
print( "#"*w )
print( "" ) | while True:
H, W = map(int, input().split())
if H == 0 and W == 0:
break
square = [['#'] * W] * H
for row in square:
print(''.join(row))
print()
| 1 | 773,569,031,708 | null | 49 | 49 |
s=input()
if len(s)%2!=0:
print("No")
exit()
for i,c in enumerate(s):
if (i%2==0 and c=="h") or (i%2==1 and c=="i"):
continue
else:
print("No")
exit()
print("Yes") | n = int(input())
s = input()
R = s.count("R")
G = s.count("G")
B = s.count("B")
total = R*G*B
for i in range(n-1):
for j in range(i+1,n):
if j*2-i < n:
if s[i] != s[j] and s[j] != s[j*2-i] and s[i] != s[j*2-i]:
total -= 1
else:
continue
print(total) | 0 | null | 44,820,097,960,220 | 199 | 175 |
import collections
MOD = 998244353
def main():
N = int(input())
D = [int(_) for _ in input().split()]
Dmax = max(D)
cc = collections.Counter(D)
if D[0] != 0: return 0
if cc[0] != 1: return 0
for i in range(Dmax+1):
if cc[i] == 0: return 0
output = 1
for i in sorted(cc.keys()):
if i in (0, 1): continue
output *= pow(cc[i-1], cc[i], MOD)
output %= MOD
return output
if __name__ == '__main__':
print(main())
| import sys
read = lambda: sys.stdin.readline().rstrip()
def counting_tree(N, D):
tot = 1
# cnt = collections.Counter(D)
cnt = [0]*N
for i in D:
cnt[i]+=1
for i in D[1:]:
tot = tot * cnt[i-1]%998244353
return tot if D[0]==0 else 0
def main():
N0 = int(read())
D0 = tuple(map(int, read().split()))
res = counting_tree(N0, D0)
print(res)
if __name__ == "__main__":
main() | 1 | 155,130,518,938,340 | null | 284 | 284 |
def cut(S,H,W,K):
cnt,h = 0,0
OP = [[0 for _ in range(W)] for _ in range(H)]
while "#" not in S[h]:
h += 1
burst = False
for i in range(h,H):
if "#" not in S[i]:
OP[i] = [OP[i-1][j] for j in range(W)]
burst = False
else:
cnt += 1
cnt_h = 1
for j in range(W):
OP[i][j] = cnt
if S[i][j] == "#" and cnt_h < S[i].count("#"):
cnt += 1
cnt_h += 1
for i in reversed(range(h)):
for j in range(W):
OP[i][j] = OP[i+1][j]
for i in range(H):
OP[i] = " ".join(map(str,OP[i]))
return OP
def main():
H,W,K = map(int,input().split())
S = [input() for _ in range(H)]
ans = cut(S,H,W,K)
for i in range(H):
print(ans[i])
if __name__ == "__main__":
main()
| from collections import deque
N, M = map(int, input().split())
edge = [[] for _ in range(N)]
sign = [-1] * N
for _ in range(M):
A, B = map(int, input().split())
edge[A - 1].append(B - 1)
edge[B - 1].append(A - 1)
d = deque([0])
while d:
cur = d.popleft()
for adj in edge[cur]:
if sign[adj] == -1:
sign[adj] = cur
d.append(adj)
print("Yes")
for i in range(1, N):
print(sign[i] + 1) | 0 | null | 81,856,731,536,540 | 277 | 145 |
N, P = map(int, input().split())
S = input()
ans = 0
if P == 2 or P == 5 :
for i in range(N) :
if int(S[i])%P == 0 :
ans += i+1
print(ans)
exit()
modP = [0 for _ in range(P)]
modP[0] = 1
now = 0
t = 1
for i in range(N) :
now += int(S[-1-i]) * t
now %= P
modP[now] += 1
t = t * 10 % P
for r in modP :
ans += r*(r-1)//2
print(ans)
| #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N, K = map(int, input().split())
d = [0]*(K+1)
for i in range(1, K+1):
val = K//i
d[i] = pow(val, N, MOD)
# print(d)
for i in range(K, 0, -1):
# print('i', i)
for j in range(K//i, 1, -1):
# print(' j', j)
# print(i, i*j)
d[i] -= d[i*j]
# print(d)
res = 0
for i, v in enu(d):
res += i*v
res %= MOD
print(res)
| 0 | null | 47,416,115,006,744 | 205 | 176 |
import math
def main():
a, b, C = map(int, input().split())
C /= 180
C *= math.pi
S = 1 / 2 * a * b * math.sin(C)
L = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(C)) + a + b
h = 2 * S / a
print(S)
print(L)
print(h)
if __name__ == "__main__":
main() | import math
a, b, C = map(int, input().split())
S = a * b * math.sin(math.radians(C)) / 2
L = a + b + (a ** 2 + b ** 2 - 2 * a * b * math.cos(math.radians(C))) ** 0.5
h = b * math.sin(math.radians(C))
print('%.7f\n%.7f\n%.7f\n' % (S, L, h)) | 1 | 172,318,138,850 | null | 30 | 30 |
H=int(input())
def n_attack(h):
if h==1:return(1)
else:return 1+2*n_attack(h//2)
print(n_attack(H)) | import sys
for i in sys.stdin.readlines():
m, f, r = [int(x) for x in i.split()]
if m == f == r == -1:
break
elif (m == -1 or f == -1) or (m + f < 30):
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65:
print('B')
elif m + f >= 50 or (30 <= m + f <= 50 and r >= 50):
print('C')
elif m + f >= 30:
print('D') | 0 | null | 40,566,752,943,778 | 228 | 57 |
from collections import deque
n,m = map(int, input().split())
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int, input().split())
a,b = a-1, b-1
g[a].append(b)
g[b].append(a)
stack = deque([0])
dist = [-1]*n
dist[0] = 0
while stack:
v = stack.popleft()
for nv in g[v]:
if dist[nv] == -1:
dist[nv] = v+1
stack.append(nv)
print("Yes")
print(*dist[1:], sep= "\n") | from collections import deque
N, M = map(int, input().split())
nodes = [set() for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
nodes[a-1].add(b-1)
nodes[b-1].add(a-1)
ans = [-1 for i in range(N)]
ans[0] = 0
q = deque([])
q.append(0)
cur = 0
done = set()
done.add(0)
while q:
node = q.popleft()
for x in nodes[node]:
if x in done:
continue
q.append(x)
done.add(x)
ans[x] = node + 1
if -1 in ans:
print('No')
else:
print('Yes')
for x in ans[1:]:
print(x) | 1 | 20,589,887,769,760 | null | 145 | 145 |
H1,M1,H2,M2,K = map (int, input ().split ())
S = H1*60+M1
G = H2*60+M2
p = G-S
if p-K < 0:
print (0)
else:
print (p-K) | #!/usr/bin/env python
# coding: utf-8
def ri():
return int(input())
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def main():
h1, m1, h2, m2, k = rli()
mins = (h2-h1)*60+m2-m1
print(mins-k)
if __name__ == '__main__':
main()
| 1 | 18,131,973,222,066 | null | 139 | 139 |
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
import numpy
N = int(input())
A = list(map(int, input().split()))
a = numpy.argsort(A)
b = []
for i in range(N):
b.append(str(a[i]+1))
print(" ".join(b)) | from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
ans = [0]*(n-1)
d = deque()
d.append(1)
while d:
v = d.popleft()
for i in graph[v]:
if ans[i-2] != 0 or i == 1:
continue
ans[i-2] = v
d.append(i)
print('Yes')
print(*ans, sep='\n') | 0 | null | 100,315,416,802,302 | 299 | 145 |
w,h,x,y,r = map(int,raw_input().split())
if w-r >= x and h-r >= y and x-r >= 0 and y-r >= 0:
print "Yes"
else:
print "No" | ins = input().split()
w = int(ins[0])
h = int(ins[1])
x = int(ins[2])
y = int(ins[3])
r = int(ins[4])
if x - r >= 0 and y - r >= 0 and x + r <= w and y + r <= h:
print("Yes")
else:
print("No") | 1 | 466,352,950,940 | null | 41 | 41 |
a, b = map(int, input().split())
print(-1 if a not in range(1, 10) or b not in range(1, 10) else a*b)
| A,B = (int(x) for x in input().split())
if A <= 9 and B <= 9:
print(A*B)
else:
print(-1) | 1 | 158,295,034,757,180 | null | 286 | 286 |
import math
def koch(n, p1_x, p1_y, p2_x, p2_y):
if n == 0:
print(f"{p1_x:.8f} {p1_y:.8f}")
return
# p1, p2からs, t, uを計算
# 与えられた線分(p1, p2) を3等分点s、tを求める
s_x = (2 * p1_x + 1 * p2_x) / 3
s_y = (2 * p1_y + 1 * p2_y) / 3
t_x = (p1_x + 2 * p2_x) / 3
t_y = (p1_y + 2 * p2_y) / 3
# 線分を3等分する2点 s,t を頂点とする正三角形 (s,u,t) を作成する
u_x = (
(t_x - s_x) * math.cos(math.pi / 3) - (t_y - s_y) * math.sin(math.pi / 3) + s_x
)
u_y = (
(t_x - s_x) * math.sin(math.pi / 3) + (t_y - s_y) * math.cos(math.pi / 3) + s_y
)
# 線分 (p1,s)、線分 (s,u)、線分 (u,t)、線分 (t,p2)に対して再帰的に同じ操作を繰り返す
koch(n - 1, p1_x, p1_y, s_x, s_y)
koch(n - 1, s_x, s_y, u_x, u_y)
koch(n - 1, u_x, u_y, t_x, t_y)
koch(n - 1, t_x, t_y, p2_x, p2_y)
n = int(input())
koch(n, 0, 0, 100, 0)
print("100.00000000 0.00000000")
| def solve(i,x1,x2,y1,y2):
global n
if i == n:
return print(x2,y2)
X1 = (2*x1+x2)/3
Y1 = (2*y1+y2)/3
X3 = (x1+2*x2)/3
Y3 = (y1+2*y2)/3
X2 = (X3+X1)/2+3**(0.5)*(Y1-Y3)/2
Y2 = (3**(0.5)*(X3-X1)+(Y1+Y3))/2
solve(i+1,x1,X1,y1,Y1)
solve(i+1,X1,X2,Y1,Y2)
solve(i+1,X2,X3,Y2,Y3)
solve(i+1,X3,x2,Y3,y2)
n = int(input())
print(0,0)
solve(0,0,100,0,0)
| 1 | 126,989,691,960 | null | 27 | 27 |
N=int(input())
ls={}
max_ch=0
for i in range(N):
ch=input()
if not ch in ls:
ls[ch]=1
else:
ls[ch]+=1
if max_ch<ls[ch]:
max_ch=ls[ch]
S=[]
for j in ls:
if max_ch==ls[j]:
S.append(j)
S=sorted(S)
for i in S:
print(i) | import math
def prime(num):
if num==1 or num==2 or num==3:
return True
for i in range(2,int(math.sqrt(num))+1):
if num%i==0:
return False
else:
return True
n=int(input())
ans=0
for i in range(n):
tmp=int(input())
if prime(tmp):
ans+=1
print(ans)
| 0 | null | 34,910,164,231,072 | 218 | 12 |
n = int(input())
c = {}
m = 0
for i in range(n):
s = input()
if s in c:
c[s] += 1
else:
c[s] = 1
if m < c[s]:
m = c[s]
ans = []
for i in c:
if m == c[i]:
ans.append(i)
ans = sorted(ans)
for i in ans:
print(i)
| N = int(input())
d = {}
for i in range(N):
s = input()
if s in d.keys():
d[s] += 1
else:
d[s] = 1
mx = 0
for i in d.values():
mx = max(mx, i)
for i in sorted(d.items()):
if i[1] == mx:
print(i[0]) | 1 | 70,240,162,676,448 | null | 218 | 218 |
a=[s for s in input()]*2
b=input()
w=False
for j in range(len(a)):
if a[j]==b[0]:
total=1
if len(b)==1:
print("Yes")
w=True
break
for i in range(1,len(b)):
if j+i==len(a):
print("No")
w=True
break
else:
if a[j+i]==b[i]:
total+=1
if total==len(b):
print("Yes")
w=True
break
else:
break
if w==True:
break
if w==False:
print("No")
| #!/usr/bin/env python3
x, y = [int(x) for x in input().split()]
p = [300000, 200000, 100000]
if x == 1 and y == 1:
print(1000000)
elif x <= 3 and y <= 3:
print(p[x - 1] + p[y - 1])
elif x <= 3:
print(p[x - 1])
elif y <= 3:
print(p[y - 1])
else:
print(0)
| 0 | null | 70,884,266,058,498 | 64 | 275 |
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
key = c.keys()
comb = 0
for i in key:
comb += (c[i]) * (c[i]-1) // 2
for i in A:
ans = comb - (c[i]-1)
print(ans)
| from collections import deque
from sys import stdin
input = stdin.readline
def main():
N = int(input())
G = [[] for _ in range(N)]
dic = {}
for i in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
G[a].append(b)
G[b].append(a)
dic[(a, b)] = i
dic[(b, a)] = i
color = [0]*(N-1)
upcol = [0]*(N)
upcol[0] = None
visited = set()
q = deque([0])
max_col = 0
while len(q):
now = q.popleft()
visited.add(now)
c = 0
for next_ in G[now]:
if next_ in visited:
continue
c += 1
if upcol[now] == c:
c += 1
color[dic[(now, next_)]] = c
upcol[next_] = c
q.append(next_)
max_col = max(max_col, c)
print(max_col)
print(*color, sep='\n')
if(__name__ == '__main__'):
main()
| 0 | null | 91,782,618,896,850 | 192 | 272 |
def mpow(a,b,m):
ans=1
while b >0 :
if b&1:
ans = (ans*a)%m
a=(a*a)%m
b=b>>1
return ans
def calcmod(X,m,N):
mod=0
X=X[::-1]
# print(X)
for i in range(N):
if X[i] == '1':
# if X & (1<<i) >0:
mod += mpow(2,i,m)
mod%=m
return mod
def popcount(m):
return bin(m).count("1")
def findsteps(mm):
cnt=0
while mm !=0:
cnt+=1
mm=mm%popcount(mm)
return cnt
N=int(input())
x=input()
X=int(x,2)
##we need to find X%(m-1) and X%(m+1)
m=popcount(X)
m1=m+1
m2=m-1
firstmod=calcmod(x,m1,N)
if m2 !=0:
secondmod=calcmod(x,m2,N)
fans=[0 for i in range(N)]
k=0
for i in range(N-1,-1,-1):
if X & (1<<i) >0:
##the bit was set
##we need to find X%(m-1) - (2^i)%(m-1)
if m2 == 0:
ans=0
else:
mm=secondmod - mpow(2,i,m2)
if mm < 0:
mm+=m2
mm=mm%m2
ans=1+findsteps(mm)
else:
mm = firstmod + mpow(2,i,m1)
mm=mm%m1
ans=1+findsteps(mm)
fans[k] = ans
k+=1
##the bit was not set
for i in fans:
print(i) | def pop_count(n):
return bin(n).count("1")
def f(n):
if n == 0:
return 0
return f(n % pop_count(n)) + 1
N = int(input())
X = list(map(int, input()))
X_m = 0
X_p = 0
pop_X = X.count(1)
for i in range(N):
if X[i] == 0:
continue
X_p += pow(2, N - i - 1, pop_X + 1)
X_p %= pop_X + 1
if pop_X > 1:
X_m += pow(2, N - i - 1, pop_X - 1)
X_m %= pop_X - 1
for i in range(N):
ans = 1
if X[i] == 0:
ans += f((X_p + pow(2, N - i - 1, pop_X + 1)) % (pop_X + 1))
elif pop_X > 1:
ans += f((X_m - pow(2, N - i - 1, pop_X - 1)) % (pop_X - 1))
else:
ans = 0
print(ans)
| 1 | 8,289,953,156,904 | null | 107 | 107 |
print(''.join(map(str, ["ACL" for _ in range(int(input()))]))) | N = int(input())
ans = "ACL"*N
print(ans) | 1 | 2,218,078,816,228 | null | 69 | 69 |
import sys
input = sys.stdin.readline
import numpy as np
from scipy.sparse.csgraph import floyd_warshall
n,m,l=map(int,input().split())
ans=[[0]*n for i in range(n)]
for i in range(m):
a,b,c=[int(j) for j in input().split()]
ans[a-1][b-1]=c
ans[b-1][a-1]=c
q=int(input())
st=[]
for i in range(q):
st.append([int(j)-1 for j in input().split()])
ans=floyd_warshall(ans)
for i in range(n):
for j in range(n):
if ans[i][j]<=l:
ans[i][j]=1
else:
ans[i][j]=0
ans=floyd_warshall(ans)
for i,j in st:
if ans[i][j]==float("inf"):
print(-1)
else:
print(int(ans[i][j])-1)
| import sys
from scipy.sparse.csgraph import floyd_warshall
import numpy as np
def solve():
infinity = 10 ** 10
n, m, le = map(int, input().split())
paths = np.full((n, n), infinity)
for i in range(n):
paths[i, i] = 0
for _ in range(m):
a, b, c = map(int, input().split())
paths[a - 1, b - 1] = paths[b - 1, a - 1] = c
paths = floyd_warshall(paths)
paths = floyd_warshall(paths <= le)
paths[np.isinf(paths)] = 0
q = int(input())
answer = []
for _ in range(q):
s, t = map(int, input().split())
answer.append(int(paths[s - 1][t - 1] - 1))
print(*answer, sep='\n')
#print("\n".join(map(str, answer)))
if __name__ == "__main__":
solve()
| 1 | 172,971,550,829,478 | null | 295 | 295 |
N = [int(c) for c in input()]
dp = 0,1
for n in N:
a = min(dp[0]+n,dp[1]+10-n)
b = min(dp[0]+n+1,dp[1]+10-(n+1))
dp = a,b
print(dp[0]) | #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: str):
# 下の桁から貪欲?
N = "0" + N
ans = 0
kuriagari = 0
for i in reversed(range(len(N))):
n = int(N[i])
if kuriagari == 1:
kuriagari = 0
n += 1
if 0 <= n <= 4:
ans += n
elif n == 5:
# print("上の桁を見て決める")
k = i-1
if 0 <= int(N[k]) <= 4:
# print("桁上がらない")
ans += 5
else:
# print("桁上がる")
ans += 5
kuriagari = 1
else:
ans += 10 - n
kuriagari = 1
# print("現状", ans, kuriagari)
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
a = next(tokens)
N = str(a) # type: str
solve(N)
if __name__ == '__main__':
main()
| 1 | 71,174,029,968,410 | null | 219 | 219 |
import sys
while(1):
H, W = map(int, raw_input().split())
if(H == 0 and W == 0):
break
else:
for i in range(H):
for j in range(W):
if(i%2==0 and j%2==0):
sys.stdout.write("#")
elif(i%2==0 and j%2==1):
sys.stdout.write(".")
elif(i%2==1 and j%2==0):
sys.stdout.write(".")
else:
sys.stdout.write("#")
print
print | import sys
def input(): return sys.stdin.readline().rstrip()
class UnionFind():
def __init__(self, n):
self.n=n
self.parents=[-1]*n # 親(uf.find()で経路圧縮して根)の番号。根の場合は-(そのグループの要素数)
def find(self,x):
#グループの根を返す
if self.parents[x]<0:return x
else:
self.parents[x]=self.find(self.parents[x])
return self.parents[x]
def unite(self,x,y):
#要素x,yのグループを併合
x,y=self.find(x),self.find(y)
if x==y:return
if self.parents[x]>self.parents[y]:#要素数の大きい方をxに
x,y=y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x #要素数が大きい方に併合
def size(self,x):
#xが属するグループの要素数
return -self.parents[self.find(x)]
def same(self,x,y):
#xとyが同じグループ?
return self.find(x)==self.find(y)
def members(self,x):
#xと同じグループに属する要素のリスト
root=self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
#全ての根の要素のリスト
return [i for i, x in enumerate(self.parents) if x<0]
def group_count(self):
#グループの数
return len(self.roots())
def all_group_members(self):
#各ルート要素のグループに含まれる要素のリストの辞書
return {r: self.members(r) for r in self.roots()}
def all_group_members_list(self):
#各ルート要素のグループに含まれる要素のリストのリスト
#[[0, 2], [1, 3, 4, 5]]
return list(self.all_group_members().values())
def __str__(self):
#各ルート要素のグループに含まれる要素のリストをprint()
return '\n'.join('{}: {}'.format(r,self.members(r)) for r in self.roots())
def main():
n,m,k=map(int,input().split())
AB=[tuple(map(int,input().split())) for i in range(m)]
CD=[tuple(map(int,input().split())) for i in range(k)]
un=UnionFind(n)
friend=[[] for _ in range(n)]
for a,b in AB:
un.unite(a-1,b-1)
friend[a-1].append(b-1)
friend[b-1].append(a-1)
blockc=[0]*n
for c,d in CD:
if un.same(c-1,d-1):
blockc[c-1]+=1
blockc[d-1]+=1
for i in range(n):
print(un.size(i)-1-blockc[i]-len(friend[i]))
if __name__=='__main__':
main() | 0 | null | 31,362,809,949,640 | 51 | 209 |
matrix = []
while True:
values = input()
if '0 0' == values:
break
matrix.append([int(x) for x in values.split()])
for height, width in matrix:
for i in range(height):
print('#' * width)
print() | N,K=map(int,input().split())
A=[int(x)-1 for x in input().split()]
t,i,dist=0,0,{0:0}
while K>0:
K,i,t=K-1,i+1,A[t]
if t in dist:
K%=i-dist[t]
else:
dist[t]=i
print(t+1)
| 0 | null | 11,827,486,769,892 | 49 | 150 |
#!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate
sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7
def main():
N, T = map(int, input().split())
AB = []
for _ in range(N):
AB.append(list(map(int, input().split())))
AB.sort()
dp = [0] * (T + 1)
ans = 0
for i in range(N-1):
for j in range(T, -1, -1):
if j + AB[i][0] <= T:
dp[j + AB[i][0]] = max(dp[j + AB[i][0]], dp[j] + AB[i][1])
ans = max(ans, dp[T-1]+AB[i+1][1])
print(ans)
if __name__ == "__main__":
main()
| import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, T = mapint()
AB = [list(mapint()) for _ in range(N)]
AB.sort()
maxtime = AB[-1][0]
Bs = [b for a, b in AB]
dp = [0]*(T)
ans = 0
for n in range(N-1):
a, b = AB[n]
newdp = [0]*(T)
for i in range(T):
if a<=i and i-a<T:
newdp[i] = max(dp[i], dp[i-a]+b)
dp = newdp
ans = max(ans, max(dp)+max(Bs[n+1:]))
print(ans) | 1 | 151,529,733,435,070 | null | 282 | 282 |
#!/usr/bin/python3
def find(id, V, d, dist):
i = id - 1
dist[i] = d
for v in V[i]:
if dist[v - 1] == -1 or dist[v - 1] > d + 1:
find(v, V, d + 1, dist)
n = int(input())
# [isFind, d, f]
A = [[False, 0, 0] for i in range(n)]
U = []
V = []
dist = [-1] * n
for i in range(n):
l = list(map(int, input().split()))
U.append(l[0])
V.append(l[2:])
find(1, V, 0, dist)
for u in U:
print(u, dist[u - 1]) | from collections import deque
N = int(input())
graph = [list(map(int, input().split())) for _ in range(N)]
seen = [-1]*(N+1)
todo = deque()
def bfs(v):
u = v-1
next_v = graph[u][2:]
for i in next_v:
if seen[i] == -1:
seen[i] = seen[v] + 1
todo.append(i)
todo.append(1)
seen[1] = 0
while len(todo) > 0:
bfs(todo.popleft())
for i in range(1, N+1):
print(i, seen[i])
| 1 | 4,046,369,652 | null | 9 | 9 |
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in A:
N -= i
if N >= 0:
print(N)
else:
print(-1)
| def line(): return [int(i) for i in input().split(" ")]
n = line()[0]
for i in line(): n -= i
print(max(-1, n)) | 1 | 31,954,728,108,060 | null | 168 | 168 |
from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if x < min_:
return 0
else:
return int((min(max_, x) - min_)/10) + 1
def main():
N = int(input())
if len(str(N)) == 1:
print(N)
return
sum_ = 0
for l in range(1, 10):
for r in range(l, 10):
temp = sum_
min_ = int(str(l) + '0'*(len(str(N))-2) + str(r))
max_ = int(str(l) + '9'*(len(str(N))-2) + str(r))
A = check(min_, max_, N)
# max_ = int(str(l) + '9'*(len(str(N))-3) + str(r))
for gap in range(len(str(N))-2):
A += (10**gap)
min_ = int(str(r) + '0'*(len(str(N))-2) + str(l))
max_ = int(str(r) + '9'*(len(str(N))-2) + str(l))
B = check(min_, max_, N)
for gap in range(len(str(N))-2):
B += (10**gap)
if l == r:
A += 1
B += 1
sum_ += A*B
else:
sum_ += 2*A*B
# print(l, r, sum_ - temp)
print(sum_)
if(__name__ == '__main__'):
main()
| import sys
#import time
from collections import deque, Counter, defaultdict
#from fractions import gcd
import bisect
import heapq
#import math
import itertools
import numpy as np
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**18
MOD = 1000000007
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
k = ri()
reses=[]
cnt = 1
tmp = 7
for i in range(k+1):
res = tmp % k
if res==0:
print(cnt)
sys.exit(0)
tmp = res * 10 + 7
cnt += 1
print(-1) | 0 | null | 46,470,372,536,574 | 234 | 97 |
A = input().split()
a = A.count(A[0])
b = A.count(A[1])
c = A.count(A[2])
if a == 2 or b == 2 or c == 2:
print("Yes")
else:
print("No")
| s = input()
t = input()
ans = 10 ** 8
for i in range(len(s)-len(t)+1):
check = 0
for j in range(len(t)):
if s[i+j] != t[j]:
check = check + 1
if ans > check:
ans = check
print(ans) | 0 | null | 35,755,456,922,110 | 216 | 82 |
N, K = map(int, input().split())
A = list(map(lambda x: int(x)-1, input().split()))
now = 0
route = [now]
visited = set()
visited.add(now)
while A[now] not in visited:
route.append(A[now])
visited.add(A[now])
now = A[now]
L = len(route)
looplen = L-route.index(A[now])
if K < L:
print(route[K]+1)
else:
print(route[L-looplen+(K-L)%looplen]+1) | from math import factorial
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
def cnt(x):
pattern = 0
numbers = list(i for i in range(1, n+1))
for i in range(n):
if x[i] > min(numbers):
pattern += numbers.index(x[i]) * factorial(n-i-1)
numbers.remove(x[i])
return pattern
print(abs(cnt(p) - cnt(q))) | 0 | null | 61,681,287,695,730 | 150 | 246 |
n,m = map(int,input().split())
if n%2 ==1:
for i in range(1,m+1):
print(i,n-i)
else:
left_end = 1+m if m%2 == 1 else m
left_start = left_end//2
right_start = left_end+m//2
for i in range(1,m+1):
if i%2 == 1:
print(left_start,left_start+i)
left_start-=1
else:
print(right_start,right_start+i)
right_start-=1 | n, k = (int(n) for n in input().split())
count = 0
while True:
n = n // k
count += 1
if n == 0:
break
print(count) | 0 | null | 46,547,934,563,370 | 162 | 212 |
def solve(x):
if x >= 30:
return "Yes"
else:
return "No"
def main():
x = int(input())
res = solve(x)
print(res)
def test():
assert solve(25) == "No"
assert solve(30) == "Yes"
if __name__ == "__main__":
test()
main()
| n = int(input())
a = list(map(int, input().split()))
ns = [0] * (n + 1)
for i in a:
ns[i] += 1
ans = 0
for i in ns:
if i > 1:
ans += i * (i - 1) // 2
for i in a:
print(min(ans - (ns[i] - 1), ans))
| 0 | null | 26,944,389,640,238 | 95 | 192 |
while True:
n,x = map(int,input().split())
s = 0
if n==0 and x==0:
break
if x <= 3*n-3 and x >= 6:
for i in range(1,min(n-1,x//3)):
s += len(range(max(i+1,x-i-n),min(n,(x-i+1)//2)))
print(s) | while True:
[n, m] = [int(x) for x in raw_input().split()]
if [n, m] == [0, 0]:
break
data = []
for x in range(n, 2, -1):
if 3 * x - 2 < m:
break
for y in range(x - 1, 1, -1):
for z in range(y - 1, 0, -1):
s = x + y + z
if s < m:
break
if s == m:
data.append(s)
print(len(data)) | 1 | 1,277,315,411,496 | null | 58 | 58 |
n = int(input())
a = list(map(int, input().split()))
def f():
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 3 != 0 and a[i] % 5 != 0:
return "DENIED"
return "APPROVED"
print(f()) | def move(up,bottom,right,left,front,back,direction):
if direction == "N":
return (front,back,right,left,bottom,up)
elif direction == "S":
return (back,front,right,left,up,bottom)
elif direction == "E":
return (left,right,up,bottom,front,back)
elif direction == "W":
return (right,left,bottom,up,front,back)
up,front,right,left,back,bottom = input().split()
direction = list(input())
for i in range(len(direction)):
up,bottom,right,left,front,back = move(up,bottom,right,left,front,back,direction[i])
print(up) | 0 | null | 34,589,026,257,678 | 217 | 33 |
# coding: utf-8
from math import sqrt
def solve(*args: str) -> str:
k = int(args[0])
l = 9*(k//7 if 0 == k % 7 else k)
if 0 == l % 2 or 0 == l % 5:
return '-1'
r = phi = l
for i in range(2, int(sqrt(l)+1)):
if 0 == r % i:
phi = phi*(i-1)//i
while 0 == r % i:
r //= i
if 1 < r:
phi = phi*(r-1)//r
D = set()
for d in range(1, int(sqrt(phi)+1)):
if 0 == phi % d:
D.add(d)
D.add(phi//d)
ret = -1
for m in sorted(D):
if 1 == pow(10, m, l):
ret = m
break
return str(ret)
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
| k = int(input())
a = [7 % k]
if a[0] == 0:
print(1)
exit()
for i in range(1, k):
a.append((10*a[i - 1] + 7) % k)
if a[i] % k == 0:
print(i + 1)
exit()
print(-1) | 1 | 6,097,434,121,000 | null | 97 | 97 |
N = int(input())
X = list(map(int, input().split()))
cur = 1000
stock = 0
state = 0 # 1=increase, 0=decrease
for i in range(N - 1):
if state == 1 and X[i] > X[i + 1]:
cur += X[i] * stock
stock = 0
state = 0
elif state == 0 and X[i] < X[i + 1]:
n = cur // X[i]
cur -= X[i] * n
stock += n
state = 1
print(cur + stock * X[-1])
| n = int(input())
a = list(map(int, input().split()))
a = a + [0]
state = a[0]
money = 1000
stock = 0
for i in range(1, n+1):
if state < a[i] and stock == 0:
stock += (money // state)
money %= state
elif state > a[i] and stock > 0:
money += (stock * state)
stock = 0
state = a[i]
print(money)
| 1 | 7,304,777,880,400 | null | 103 | 103 |
a,b=list(map(int ,input().split()))
print(a*b) | #!/usr/bin/env python
"""AtCoder Beginner Contest 169: A - Multiplication 1
https://atcoder.jp/contests/abc169/tasks/abc169_a
"""
def main():
A, B = list(map(int, input().split()))
print(A * B)
if __name__ == '__main__':
main()
| 1 | 15,828,170,033,648 | null | 133 | 133 |
from collections import deque
N,u,v = map(int,input().split())
u -= 1
v -= 1
adj = [ [] for _ in range(N) ]
for _ in range(N-1):
a,b = map(int,input().split())
a -= 1
b -= 1
adj[a].append(b)
adj[b].append(a)
def bfs(v):
visited = [False] * N
q = deque([v])
span = [-1] * N
s = 0
while q:
l = len(q)
newq = deque([])
for _ in range(l):
node = q.popleft()
visited[node] = True
span[node] = s
for nei in adj[node]:
if not visited[nei]:
newq.append(nei)
q = newq
s += 1
return span
t = bfs(u)
a = bfs(v)
ans = 0
for i in range(N):
if t[i] <= a[i]:
ans = max(ans, a[i]-1)
print(ans) | import sys
sys.setrecursionlimit(2*10**5)
n, u, v = map(int, input().split())
edge = [tuple(map(int, input().split())) for _ in range(n-1)]
u -= 1
v -= 1
connect = [set() for _ in range(n)]
for a, b in edge:
connect[a-1].add(b-1)
connect[b-1].add(a-1)
du = [0] * n
dv = [0] * n
def dfs(v, dis, ng, d):
d[v] = dis
ng.add(v)
for w in connect[v]:
if w not in ng:
dfs(w, dis+1, ng, d)
dfs(u, 0, set(), du)
dfs(v, 0, set(), dv)
ans = 0
for i in range(n):
if du[i] < dv[i]:
ans = max(ans, dv[i]-1)
print(ans) | 1 | 117,718,996,072,132 | null | 259 | 259 |
# import bisect
from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
h, w, k = list(map(int,ipti().split()))
s = [list(input()) for i in range(h)]
empty_row = []
exist_row = []
berry_id = 1
for row in range(h):
is_empty = True
for col in range(w):
if s[row][col] == "#":
s[row][col] = berry_id
berry_id += 1
is_empty = False
if is_empty:
empty_row.append(row)
else:
exist_row.append(row)
# まず空ではない行を埋める
for row in range(h):
if row in exist_row:
berry_col = deque()
for col in range(w):
if s[row][col] != ".":
berry_col.append(col)
first = 0
fill_id = 0
while berry_col:
last = berry_col.popleft()
fill_id = s[row][last]
for j in range(first, last+1):
s[row][j] =fill_id
first = last + 1
for j in range(first, w):
s[row][j] = fill_id
for row in empty_row:
is_filled = False
for row2 in range(row+1, h):
if row2 in exist_row:
for col in range(w):
s[row][col] = s[row2][col]
is_filled = True
break
if not is_filled:
for row2 in range(row-1, -1 , -1):
if row2 in exist_row:
for col in range(w):
s[row][col] = s[row2][col]
is_filled = True
break
for row in range(h):
print(*s[row])
if __name__ == '__main__':
main() | nums = []
while True:
in_line = raw_input().split()
if int(in_line[0]) == 0 and int(in_line[1]) == 0:
break
nums.append([int(in_line[0]),int(in_line[1])])
for n in nums:
n.sort()
print n[0],
print n[1] | 0 | null | 71,780,925,517,600 | 277 | 43 |
n = int(input())
xy = [list(map(int, input().split())) for _i in range(n)]
x = [i+j for i, j in xy]
y = [i-j for i, j in xy]
x.sort()
y.sort()
print(max(abs(x[0]-x[-1]), abs(y[0]-y[-1]))) | n = int(input())
u = []
v = []
ans = 0
for i in range(n):
x, y = map(int, input().split())
u.append(x+y)
v.append(x-y)
ans = max(max(u) - min(u), max(v) - min(v))
print(ans) | 1 | 3,415,562,984,602 | null | 80 | 80 |
n=int(input())
s=0
for i in range(n+1):
s=(10*s+7)%n
if(s==0):
print(i+1)
exit()
print(-1)
| MOD = 1e9 + 7
n = int(input())
ans = [[0, 1, 1, 8]]
for i in range(n-1):
a, b, c, d = ans.pop()
a = (a * 10 + b + c) % MOD
b = (b * 9 + d) % MOD
c = (c * 9 + d) % MOD
d = (d * 8) % MOD
ans.append([a, b, c, d])
a, b, c, d = ans.pop()
print(int(a)) | 0 | null | 4,649,726,136,394 | 97 | 78 |
h,w = map(int, input().split())
if h == 1 or w == 1:
print(1)
else:
if h % 2 == 0:
print(int((h / 2) * w))
else:
if w % 2 == 0:
print(int(((h//2) * w/2) + ((h//2 + 1) * w/2)))
else:
print(int(((h//2 + 1) * (w//2+1)) + ((h//2) * (w//2))))
| H, W = list(map(int, input().split()))
if H == 1 or W == 1:
print(1)
else:
print(H*W//2 + (H*W)%2)
| 1 | 50,915,187,349,390 | null | 196 | 196 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
def yes():
print("Yes") # type: str
def no():
print("No") # type: str
def solve(N: int, S: "List[str]"):
def seq_positive(ls):
state = 0
for l, st in ls:
if state+l < 0:
return False
state += st
return True
# 部分括弧列の特徴量を計算する。
# 経過中の最小値と、最終到達値
left_seq = []
right_seq = []
total = 0
for s in S:
state = 0
lower = 0
for c in s:
if c == "(":
state += 1
else:
state -= 1
lower = min(lower, state)
if state > 0:
left_seq.append((lower, state))
else:
right_seq.append((lower-state, -state))
total += state
left_seq.sort(reverse=True)
right_seq.sort(reverse=True)
# print(left_seq)
# print(right_seq)
if seq_positive(left_seq) and seq_positive(right_seq) and total == 0:
yes()
else:
no()
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = [next(tokens) for _ in range(N)] # type: "List[str]"
solve(N, S)
if __name__ == '__main__':
main()
| # +1/-1の折れ線で表したとき
# 「0で終わる」かつ「途中で0未満にならない」を満たせば良い
# あとは貪欲を上手い事使う
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
import math
#from math import gcd
#inf = 10**17
#mod = 10**9 + 7
n = int(input())
a = []
b = []
for _ in range(n):
s = input().rstrip()
# 最終的に上がる量/最下点
up, down = 0, 0
for i in s:
if i == ')':
up -= 1
if down > up:
down = up
else:
up += 1
if up >= 0:
a.append((down, up))
else:
b.append((up-down, down, up))
a.sort(reverse=True)
b.sort(key=lambda a: a[0],reverse=True)
c = 0
for d, u in a:
if c+d < 0:
print('No')
break
else:
c += u
else:
for _, d, u in b:
if c+d < 0:
print('No')
break
else:
c += u
else:
if c == 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 1 | 23,563,107,916,792 | null | 152 | 152 |
string = input()
numbers = string.split(' ')
numbers.sort()
print(numbers[0], numbers[1], numbers[2])
| a,b,c=map(int,raw_input().split())
if a>b:
a,b=b,a
if b>c:
b,c=c,b
if a>b:
a,b=b,a
print a,b,c | 1 | 416,228,017,600 | null | 40 | 40 |
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(num):
k = input()
if k == "AC":
ac += 1
elif k == "WA":
wa += 1
elif k == "TLE":
tle += 1
elif k == "RE":
re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re)) | import bisect
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
time = 0
cnt = 0
C = []
SA =[0]
SB =[0]
for a in A:
SA.append(SA[-1] + a)
for b in B:
SB.append(SB[-1] + b)
for x in range(N+1):
L = K - SA[x]
if L < 0:
break
y_max = bisect.bisect_right(SB, L) - 1
C.append(y_max + x)
print(max(C)) | 0 | null | 9,817,774,030,130 | 109 | 117 |
A, B, C = map(int, input().split())
Z = A + B + C
if Z >= 22:
print("bust")
else:
print("win")
| list = input().split(" ")
a = int(list[0])
b = int(list[1])
print(a * b) | 0 | null | 67,198,792,307,142 | 260 | 133 |
def main():
from collections import deque
N, M, K = map(int, input().split())
f = [set() for _ in range(N + 1)]
b = [set() for _ in range(N + 1)]
for _ in range(M):
i, j = map(int, input().split())
f[i].add(j)
f[j].add(i)
for _ in range(K):
i, j = map(int, input().split())
b[i].add(j)
b[j].add(i)
visited = [False] * (N + 1)
ans = [0] * (N + 1)
for i in range(1, N+1):
if visited[i]:
continue
visited[i] = True
link = {i}
todo = deque([i])
while len(todo) != 0:
c = todo.pop()
for p in f[c]:
if not(visited[p]):
link.add(p)
todo.append(p)
visited[p] = True
for j in link:
ans[j] = len(link) - len(link & f[j]) - len(link & b[j]) - 1
print(*ans[1:])
if __name__ == '__main__':
main() | from collections import defaultdict
from collections import deque
n,m,k = map(int,input().split())
f_set = {tuple(map(int,input().split())) for _ in range(m)}
b_set = {tuple(map(int,input().split())) for _ in range(k)}
friends_counts = {key:[] for key in range(1,n+1)}
blocks_counts = {key:[] for key in range(1,n+1)}
for f in f_set:
friends_counts[f[0]].append(f[1])
friends_counts[f[1]].append(f[0])
for b in b_set:
blocks_counts[b[0]].append(b[1])
blocks_counts[b[1]].append(b[0])
friends_groups_list = [set() for _ in range(n+1)]
#dfs
que = deque()
groups_count = 0
checked_dict = {key:0 for key in range(1,n+1)}
#que.appendleft(1)
for i in range(1,n+1):
if checked_dict[i] == 1:
continue
que.appendleft(i)
checked_dict[i] = 1
while que:
x = que.popleft()
friends_groups_list[groups_count].add(x)
for i in range(len(friends_counts[x])):
if checked_dict[friends_counts[x][i]] == 0:
que.appendleft(friends_counts[x][i])
checked_dict[friends_counts[x][i]] = 1
groups_count += 1
result_list=[0]*n
#print(blocks_counts)
#print(friends_groups_list)
for i in range(len(friends_groups_list)):
mini_set = friends_groups_list[i]
for ms in mini_set:
result_list[ms-1] = len(mini_set) - 1 - len(friends_counts[ms])
block_counter_in_minilist = 0
for k in blocks_counts[ms]:
if k in mini_set:
block_counter_in_minilist += 1
result_list[ms-1] -= block_counter_in_minilist
print(" ".join(map(str,result_list)))
#cの配列の解釈が違ったらしい。。。
#f_set = {tuple(map(int,input().split())) for _ in range(m)}
#
#b_set = {tuple(map(int,input().split())) for _ in range(k)}
#
#c_list = [0] * (n-1)
#
#result_dict = {key:0 for key in range(1,n+1)}
#
#for f in f_set:
# if abs(f[0]-f[1]) == 1:
# c_list[min(f[0],f[1]) - 1] = 1
# #ここでelseで飛び石での友達のsetを作ってもよいが、そもそもsetなのでinでの探索にそんなに時間かからないし、いったんこのままやってみる。
#
#for start in range(0,n-2):
# if c_list[start] == 0:
# #c[start]が1になるまで飛ばす
# continue
#
# for end in range(start+1,n-1):
# if c_list[end] == 0:
# #友人同士ではないペアまできたらstartをインクリメント
# break
#
# #もし「友人候補」の候補者が、「友人関係でない」かつ「ブロック関係でない」ことをチェックしている。
# if not (start+1,end+2) in f_set and not (end+2,start+1) in f_set and not (start+1,end+2) in b_set and not (end+2,start+1) in b_set:
# result_dict[start+1] += 1
# result_dict[end+2] += 1
#
#for i in range(1,n+1):
# print(result_dict[i])
#
#print(c_list)
| 1 | 61,909,420,545,518 | null | 209 | 209 |
import collections
import math
def cmb_factorial(s):
return math.factorial(s) // (math.factorial(2) * math.factorial(s - 2))
n = int(input())
a = list(map(int, input().split()))
c = collections.Counter(a)
f = {}
cmb = 0
for x in c.values():
f[1] = 0
f[2] = 1
if x >= 3:
f[x] = cmb_factorial(x)
if x - 1 not in f:
f[x - 1] = cmb_factorial(x - 1)
cmb += f.get(x)
for z in a:
y = c.get(z)
ans = cmb
if y >= 2:
ans = cmb - f.get(y) + f.get(y - 1)
print(ans) | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
kosu = Counter(A)
tempSum = 0
for v in kosu.values():
tempSum += v * (v - 1) // 2
for a in A:
print(tempSum - kosu[a]+1)
| 1 | 47,604,314,640,558 | null | 192 | 192 |
n = int(input())
my_dict = {}
for i in range(n):
order, key = input().split(' ')
if order == 'insert':
my_dict[key] = True
elif order== 'find':
if key in my_dict.keys():
print('yes')
else:
print('no')
| s = set()
for _ in range(int(input())):
c = input().split()
if c[0] == 'insert':
s.add(c[1])
else:
print('yes' if c[1] in s else 'no') | 1 | 75,773,026,128 | null | 23 | 23 |
XY=list(map(int,input().split()))
prize=0
for xy in XY:
if xy==1:
prize+=300000
elif xy==2:
prize+=200000
elif xy==3:
prize+=100000
if sum(XY)==2:
prize+=400000
print(prize) | x = list(map(int, input().split()))
ans = 0
for i in x:
if i == 1:
ans += 300000
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if sum(x) == 2:
ans += 400000
print(ans)
| 1 | 140,481,571,694,560 | null | 275 | 275 |
N=int(input())
K=int(input())
import sys
sys.setrecursionlimit(10**6)
def solve(N, K):
if K==1:
l=len(str(N))
ans=0
for i in range(l):
if i!=l-1:
ans+=9
else:
ans+=int(str(N)[0])
#print(ans)
return ans
else:
nextK=K-1
l=len(str(N))
ini=int(str(N)[0])
res=ini*(10**(l-1))-1
#print(res)
if l>=K:
ans=solve(res, K)
else:
ans=0
if l-1>=nextK:
nextN=int(str(N)[1:])
ans+=solve(nextN, nextK)
return ans
return ans
ans=solve(N,K)
print(ans) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = input()
k = int(input())
# 桁DP
def digit_DP(S, K):
L = len(S)
# dp[決定した桁数][未満フラグ][0以外の数字を使った個数]
dp = [[[0 for _ in range(4)] for _ in range(2)] for _ in range(101)]
dp[0][0][0] = 1
for i in range(L): # 今見ている桁
D = int(S[i])
for j in range(2): # 未満フラグ(0 or 1)
for k in range(4): # 0以外の数字を使った個数が0~3
for d in range(10 if j else D + 1):
cnt = k
if d != 0:
cnt += 1
if cnt > K:
continue
dp[i + 1][j or (d < D)][cnt] += dp[i][j][k]
return dp[L][0][K] + dp[L][1][K]
print(digit_DP(n, k))
if __name__ == '__main__':
resolve()
| 1 | 75,910,226,698,592 | null | 224 | 224 |
n=int(input())
print(len(set([input() for _ in range(n)]))) | ch = input()
if ch == 'a' or ch == 'b' or ch == 'c' or ch == 'd' or ch == 'e' or ch == 'f' or ch == 'g' or ch == 'h':
print('a')
elif ch == 'i' or ch == 'j' or ch == 'k' or ch == 'l' or ch == 'm' or ch == 'n' or ch == 'o':
print('a')
elif ch == 'p' or ch == 'q' or ch == 'r' or ch == 's' or ch == 't' or ch == 'u' or ch == 'v':
print('a')
elif ch == 'w' or ch == 'x' or ch == 'y' or ch == 'z':
print('a')
else:
print('A')
| 0 | null | 20,800,296,830,610 | 165 | 119 |
N=int(input())
L=list(map(int,input().split()))
sort_L=sorted(L,reverse=True)
ans=0
for n in range(N-2):
for o in range(n+1,N-1):
lar=sort_L[n]
kouho=sort_L[o+1:]
mid=sort_L[o]
sa=lar-mid
left=0
right=N-o-2
if kouho[-1]>sa:
ans+=right+1
else:
while right > left + 1:
half = (right + left) // 2
if kouho[half] <= sa:
right = half
else:
left = half
if kouho[right]<=sa and kouho[left]<=sa:
continue
elif kouho[right]>sa:
ans+=right+1
else:
ans+=left+1
print(ans)
| class BIT:
def __init__(self, n):
self.n = n
self.data = [0]*(n+1)
def to_sum(self, i):
s = 0
while i > 0:
s += self.data[i]
i -= (i & -i)
return s
def add(self, i, x):
while i <= self.n:
self.data[i] += x
i += (i & -i)
def get(self, i, j):
return self.to_sum(j)-self.to_sum(i-1)
N = int(input())
A = list(map(int,input().split()))
A.sort()
M = pow(10,6)+ 100
Tree = BIT(M)
for x in A:
Tree.add(x,1)
ans = 0
for i in range(N):
for j in range(i+1,N):
x = A[i]; y = A[j]
Tree.add(x,-1);Tree.add(y,-1)
MIN = abs(x-y)+1; MAX = (x+y)-1
#print(x,y,MIN,MAX)
ans += Tree.get(MIN,MAX)
Tree.add(x,1);Tree.add(y,1)
#print(ans)
print(ans//3) | 1 | 172,649,034,835,840 | null | 294 | 294 |
# -*- coding: utf-8 -*-
while True:
n = int(input())
if n == 0:
break
l = [int(x) for x in list(str(n))]
print(sum(l))
| '''
ITP-1_8-B
??°?????????
?????????????????°???????????????????¨??????????????????°?????????????????????????????????
???Input
?????°??????????????????????????\?????¨??????????????????????????????????????????????????????????????´??° x ?????????????????§?????????????????????
x ??? 1000 ?????\????????´??°??§??????
x ??? 0 ?????¨?????\?????????????????¨??????????????????????????????????????????????????????????????£????????????????????????
???Output
????????????????????????????????????x ???????????????????????????????????????????????????
'''
while True:
# inputData
inputData = input()
if inputData == '0':
break
# outputData
outputData = 0
for cnt0 in inputData:
outputData += int(cnt0)
print(outputData) | 1 | 1,585,790,166,950 | null | 62 | 62 |
def main():
N = int(input())
A = [int(_n) for _n in input().split()]
if N == 0:
print(1 if A[0]==1 else -1)
return
l = A[-1]
L = [(1,1)]
for i in range(1,N):
L.append((A[i]+1, (L[i-1][1]-A[i-1])*2))
if (L[i-1][1]-A[i-1])*2 < A[i]:
print(-1)
return
L.append((A[N], (L[N-1][1]-A[N-1])*2))
# print(L)
if (L[N-1][1]-A[N-1])*2 < A[N]:
print(-1)
return
R = [(A[-1],A[-1])]
for i in reversed(range(N)):
R.append(((R[-1][0]+1)//2+A[i], R[-1][1]+A[i]))
res = 0
for i in range(N+1):
r = R[i]
l = L[N-i]
if r[0] > l[1] or r[1] < l[0]:
print(-1)
return
# print(r,l)
res += min(r[1], l[1])
print(res)
main() | n=int(input())
mod=1000000007
import math
ab=[]
n0=0
for i in range(n):
a,b = map(int,input().split())
if a==0 and b==0:
n0+=1
continue
if b==0:
ab.append( (1,0) )
elif a==0:
ab.append( (0,1) )
else:
gc = math.gcd(a,b)*b//abs(b)
ab.append( (a//gc,b//gc) )
n_eff = n-n0
from collections import Counter
c=Counter(ab)
pairs =[]
for cc in c:
n_dual = c[(-cc[1],cc[0])]
if n_dual>0:
# print(cc)
pairs.append( (c[cc],n_dual) )
ans=1
for p in pairs:
ans = ans*(pow(2,p[0],mod)+pow(2,p[1],mod)-1 ) %mod
amari = n_eff - sum(sum(p) for p in pairs)
ans=ans * pow(2,amari,mod) %mod
ans=ans+n0-1
print(ans%mod) | 0 | null | 19,827,434,137,062 | 141 | 146 |
s = list(input())
num = 0
n = len(s)
l = 0
i = 0
while i < n:
if s[i] == '<':
l+=num
num+=1
i+=1
if i==n:
l+=num
else:
cur = 0
while i < n and s[i]=='>':
i+=1
cur+=1
if cur <= num:
l+=num
cur-=1
l+=(cur*(cur+1))//2
num = 0
print(l) | def main():
S = input()
N = len(S)
ret = [0] * (N + 1)
for i, c in enumerate(S, start=1):
if c == '<':
ret[i] = max(
ret[i],
ret[i - 1] + 1
)
for i, c in enumerate(reversed(S), start=1):
i = N - i
if c == '>':
ret[i] = max(
ret[i],
ret[i + 1] + 1
)
print(sum(ret))
if __name__ == '__main__':
main()
| 1 | 156,630,304,624,192 | null | 285 | 285 |
S=input()
T=input()
lenS=len(S)
lenT=len(T)
count=[]
for i in range(lenS-lenT+1):
c=0
for j in range(lenT):
if T[j]!=S[i+j]:
c=c+1
j=j+1
count.append(c)
i=i+1
print(min(count)) | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,x,y=map(int,input().split())
x-=1; y-=1
E1=[[] for _ in range(n)]
E2=[[] for _ in range(n)]
for _ in range(n-1):
u,v=map(int,input().split())
u-=1; v-=1
E1[u].append(v)
E1[v].append(u)
E2=E1
# E2 において、y-rooted tree とみて、depth,par を計算
par=[None]*n # x の必勝頂点を判定するのに必要
par[y]=y
depth2=[None]*n
depth2[y]=0
Q=[y]
while(Q):
v=Q.pop()
for nv in E2[v]:
if(depth2[nv] is not None): continue
depth2[nv]=depth2[v]+1
par[nv]=v
Q.append(nv)
# E1の辺で、E2での距離が 3 以上のものは必勝
win=[0]*n
for v in range(n):
for nv in E1[v]:
if(par[v]==nv or par[nv]==v or par[v]==par[nv] or par[par[v]]==nv or par[par[nv]]==v): continue
win[nv]=win[v]=1
# E1 において、x-rooted tree とみて探索
# depth1 < depth2 -> 以降も探索できる
# depth1 = depth2 -> そこで捕まる
ans=depth2[x]
depth1=[None]*n
depth1[x]=0
Q=[x]
while(Q):
v=Q.pop()
if(win[v]): # 探索できる状態 & 必勝頂点にいれば勝ち
print(-1)
return
for nv in E1[v]:
if(depth1[nv] is not None): continue
depth1[nv]=depth1[v]+1
ans=max(ans,depth2[nv])
if(depth1[nv]<depth2[nv]): Q.append(nv)
print(ans-1)
resolve() | 0 | null | 60,616,757,684,390 | 82 | 259 |
ans = 100000
n = int(raw_input())
for i in xrange(n):
ans *= 1.05
ans = int((ans+999)/1000)*1000;
print ans | m = 100000
n = int(input())
while n > 0:
n -= 1
m = m + (m * 5 // 100)
m = ((m-1) // 1000 + 1) * 1000
print(m)
| 1 | 1,172,488,328 | null | 6 | 6 |
def main():
S = str(input())
n = len(S)
frontN = (n - 1) // 2
backN = (n + 3) // 2
checkFN = frontN // 2
checkFNW = S[0:frontN]
for i in range(checkFN):
temp = (i + 1) * -1
if checkFNW[i] == checkFNW[temp]:
continue
else:
print('No')
return
checkBN = n - backN
checkBNW = S[backN - 1:n]
for i in range(checkBN // 2):
temp = (i + 1) * -1
if checkBNW[i] == checkBNW[temp]:
continue
else:
print('No')
return
for i in range(n // 2):
temp = (i + 1) * -1
if S[i] == S[temp]:
continue
else:
print('No')
return
print('Yes')
main() |
N, A, B = map(int, input().split())
MAX = 2 * 10 ** 5 + 1
MOD = 10 ** 9 + 7
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
# Factorial for large
facl = [0] * (MAX + 1)
facl[0] = N
for i in range(1, MAX + 1):
facl[i] = facl[i - 1] * (N - i) % MOD
# Solution
ans = pow(2, N, MOD) - 1
ans -= facl[A - 1] * finv[A] % MOD
ans %= MOD
ans -= facl[B - 1] * finv[B] % MOD
ans %= MOD
print(ans)
| 0 | null | 56,214,490,927,360 | 190 | 214 |
X = int(input())
m = 100
a = 0
while m < X:
m = m + m // 100
a += 1
print(a) | a=int(input())
cnt=0
t=100
while t<a:
t=(t*101)//100
cnt+=1
print(cnt) | 1 | 27,196,114,706,828 | null | 159 | 159 |
import numpy as np
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
N, M = map(int, input().split())
uf = UnionFind(N)
for i in range(M):
A, B = map(int, input().split())
uf.union(A-1, B-1)
print(uf.group_count()-1) | N = int(input())
def dfs(s, mx):
if len(s) == N:
print(s)
else:
c = 'a'
while ord(c) <= ord(mx):
if c == mx:
dfs(s + c, chr(ord(mx) + 1))
else:
dfs(s + c, mx)
c = chr(ord(c) + 1)
dfs('', 'a') | 0 | null | 27,344,836,531,840 | 70 | 198 |
n,m=map(int,input().split())
k=m//2
for i in range (0,k):
a=i+1
b=2*k+1-i
print (a,b)
c=2*k+2
k=(m+1)//2
j=1
#print(c,k)
for i in range (c,c+k):
a=i
b=c+2*k-j
j+=1
print(a,b) | N,M = map(int,input().split())
ans = []
s = 1
e = M+1
while e>s:
ans.append([s,e])
s += 1
e -= 1
s = M+2
e = 2*M+1
while e>s:
ans.append([s,e])
s += 1
e -= 1
for s,e in ans:
print(s,e)
| 1 | 28,674,846,523,708 | null | 162 | 162 |
print((lambda x:(1/2 if (x%2 == 0) else (x//2+1)/x))(int(input())))
| from math import gcd
magic = [2, 7, 61]
def mul(a, b, n):
# calculate (a * b) % n
r, a, b = 0, a % n, b % n
while b:
if b & 1:
r = (a + r) % n
a = (a + a) % n
b >>= 1
return r
def bigmod(a, p, n):
# calculate (a ** p) % n
if p == 0:
return 1
if p == 1:
return a % n
return mul(bigmod(mul(a, a, n), p // 2, n), a if p % 2 else 1, n)
def miller_rabin(n, a):
if gcd(a, n) == n:
return True
if gcd(a, n) != 1:
return False
d, r = n-1, 0
while d % 2 == 0:
d /= 2
r += 1
res = bigmod(a, d, n)
if res == 1 or res == n-1:
return True
while r:
r -= 1
res = mul(res, res, n)
if res == n-1:
return True
return False
def isPrime(n):
for a in magic:
if not miller_rabin(n, a):
return False
return True
num = int(input())
ans = sum(map(int, [isPrime(int(input())) for _ in range(num)]))
print(ans)
| 0 | null | 88,328,265,122,548 | 297 | 12 |
import numpy as np
data = np.array([int(x) for x in str(input())])
if data.sum() % 9 == 0:
print("Yes")
else:
print("No")
| S = int(input())
if S % 9 == 0:
W = 'Yes'
else:
W = 'No'
print(W)
| 1 | 4,466,901,473,450 | null | 87 | 87 |
H = int(input())
W = int(input())
N = int(input())
cnt, paint = 0, 0
while paint < N:
paint += max(H,W)
cnt += 1
print(cnt) | K,N=map(int,input().split())
lis=list(map(int,input().split()))
dt=[lis[i+1]-lis[i] for i in range(N-1)]+[lis[0]+(K-lis[-1])]
print(K-max(dt)) | 0 | null | 65,858,552,625,120 | 236 | 186 |
N = int(input())
for i in range(1, 10):
m = N/i
if(m.is_integer() and m <= 9):
print("Yes")
break
else:
print("No")
| N = int(input())
XY = []
for _ in range(N):
A = int(input())
xy = []
for _ in range(A):
x, y = map(int, input().split())
x -= 1
xy.append((x, y))
XY.append(xy)
ans = 0
for s in range(1<<N):
for i in range(N):
if s>>i&1:
for x, y in XY[i]:
if s>>x&1 != y:
break
else:
continue
break
else:
ans = max(ans, bin(s).count("1"))
print(ans)
| 0 | null | 140,336,820,940,580 | 287 | 262 |
n = int(input())
if n % 2 == 0:
n5 = 1
y = 10
c = []
while y <= n:
c.append(n//y)
if len(c) > 1:
c[-2] -= c[-1]
y *= 5
cnt = 0
for i in range(len(c)):
cnt += c[i]*(i+1)
print(cnt)
else:
print(0) | s = input()
print("Yes" if ("A" in s and "B" in s) else "No") | 0 | null | 85,115,583,971,222 | 258 | 201 |
#E
import math
n = int(input())
ans = 0
i = 1
if n % 2 == 0:
tmp = 5 ** i * 2
while tmp <= n:
tmp = 5 ** i * 2
ans += n //tmp
i += 1
print(ans)
else:
print(0) | def partpall(s,n):
if s!=s[::-1]:
return False
else:
return True
def pall(s,n):
if s!=s[::-1]:
return False
return partpall(s[n//2 +1 :],n) and partpall(s[:n//2 ],n)
# s=input("enter:")
s=input()
# print("sucess",s,s[::-1])
# revStr=s[::-1]
n=len(s)
# print(n)
if pall(s,n):
print("Yes")
else:
print("No") | 0 | null | 81,330,617,183,508 | 258 | 190 |
def main():
s = input()
n = int(input())
for i in range(n):
cmds = input().split(' ')
if 'reverse' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
s = s[:a]+''.join(reversed(s[a:b]))+s[b:]
if 'replace' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
res = cmds[3]
s = s[:a]+res+s[b:]
if 'print' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
print(s[a:b])
if __name__ == '__main__': main() | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, n = map(int, readline().split())
x = min(b - 1, n)
# if b == n:
# x = b - 1
# if x == 0:
# print(a)
# exit()
ans = math.floor((a * x) / b) - a * math.floor(x / b)
print(ans) | 0 | null | 15,158,739,364,450 | 68 | 161 |
import collections,sys
def s():
d = collections.deque()
input()
for e in sys.stdin:
if "i"==e[0]: d.appendleft(e[7:-1])
else:
if " "==e[6]:
m = e[7:0-1]
if m in d: d.remove(m)
elif "i"==e[7]: d.popleft()
else: d.pop()
print(*d)
s()
| A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c0 = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
x -= 1
y -= 1
cnext = a[x] + b[y] - c
c0 = min(c0, cnext)
print(c0) | 0 | null | 27,018,178,384,260 | 20 | 200 |
a, b, c, d = map(int, input().split())
e = []
for i in [a, b]:
for j in [c, d]:
e += [i * j]
print(max(e)) | a, b, c, d = map(int, input().split())
L = [a*c, a*d, b*c, b*d]
ans = max(L)
print(ans) | 1 | 3,064,826,518,236 | null | 77 | 77 |
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code :
"""
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
#define all($) begin($), end($)
#define rall($) rbegin($), rend($)
class UnionFind {
public:
UnionFind(int n) : n_(n) { init(); }
int root(int x) {
assert(0 <= x && x < n_);
if (par_[x] == -1)
return x;
else
return par_[x] = root(par_[x]);
}
bool same(int x, int y) {
assert(0 <= x && x < n_ && 0 <= y && y < n_);
return root(x) == root(y);
}
void unite(int x, int y) {
assert(0 <= x && x < n_ && 0 <= y && y < n_);
x = root(x);
y = root(y);
if (x == y) return;
if (rank_[x] < rank_[y]) std::swap(x, y);
if (rank_[x] == rank_[y]) ++rank_[x];
par_[y] = x;
return;
}
private:
const int n_;
std::vector<int> par_;
std::vector<int> rank_;
void init() {
par_.assign(n_, -1);
rank_.assign(n_, 0);
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m; cin >> n >> m;
UnionFind uf(n);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b;
--a;
--b;
uf.unite(a, b);
}
set<int> st;
for (int i = 0; i < n; ++i) {
st.emplace(uf.root(i));
}
cout << (int)st.size() - 1 << endl;
return 0;
}
"""
import base64
import subprocess
import zlib
exe_bin = "c%0>1eRxw<n!oud4YVXd3l;^5ZeR;YY@lERGB#}kH=05hiZTjb(j=vkG^xoA6xNT<wngrQKp%HTSyxAPbf0Br$7h&b_YvKFlv2K&QKx=9E<276vomTUepFE8OS12K?m5Z5w~6!d%zt}%()Yf<`+l7FJ?}a9-g6HRdVI_DIvvLj1NSWsxsz2g-$3zwH|9kEtLMhU-)p()+&JKk3OOx3r&Ci?-jA$Tua|i(oyMuDPC?7K(uZl9nsS^iuZL~5O{eH|n~I*Jem9h<_4HJ)p6b<8c}A^Nk5Lw%k^b5!uBFYKni?r>eP0Zcd`^{lEe&#N%JlvQ^u}?2{9&bZ74=stFDGex8D;%&V<g<ZsP4u{a9$)FP4>*|sb4g2QJo_ZbId1gvQpXQE7lNs>~FoI%~ce`>-EOWSI?Z1HqU$MrR~<?OLrVd%)B3Er*MUS!wl;{a|*RlwWqQv@klu{Ip+9h_+3#1H|dJwH6`!~;Nkir_&p`;uPK3lR>J<*CGhJ?;6e%fp%VCeCGb!Q{MHiq2Cg_hgJUB_eH<xaXR5w9ZY^PFNeO(kM0@TBzmvGBT!T&4veJV6kdyHZ*U5M_D`cqSgcuCWor|@*h!cd3U9qT;5dCpc5IDix)*=K$@zBO_LJY;*TACuUXsFHK9tp|UieI^N#p-Z8;aL?Xr?E)FgJ-M7x==J2@dj3lPG_Lg9~Z>9KP)D^0gq=DU<=y)iEu!OCB%5h-{ox++G+*Q>O}%ko$nG>wSz(^B!r`h5VX!84TAf2f5aaRgxXudKz&{$8ViO5Fc(@~E38^ATUZbXM@f6c`fw~kuGV>@VX@ii*-QkSHwl8+8INs&YeB&uiNpeUAsA`htkH8WOl*w?ge_sQ6H*ln$2{$rxt<=OI}}gEqW(x&+$wCY1-0mwu3}D`nA5sIEGf$F3(XIP0`X8+C@PkS3VUs1ARr{L)0~{JCb}gI*;o}yB)iDP0P9WY$iOBc(78$I@P{J+_!A^~lneCu1-}^T35%5J2xH^7K_3ceh89AXA5yoxsYzJisO6UXyp2u5d`DgWY`$Y5*R*!6yU{B+9SdZ5?OG77<8ao)e+K&3KzSql%IMw2KnhXDb@1;wU12=5&e~dmGIR6uubz90Uay5;RX98mXVe9H8B1Or9*;BYQiZ&ZE6n$A{&Z6r-a)-oUYz}~34OEs5}WtgeeC39nbv6V{q*^uR)g=Q@+O-aXZ*+vnX=~wcAQY)Rt0`ifh)&*MuA_cz(*B$l>$Gfz$YtkD{U9%$gIHG{DF@HQxrIxKM=o4iBtRKT;U#xN2dZ;-mJP6xIuyUC~)O-POk!2-sg8H@Nxw{sK8AMe2)SjufX>z@Cgchp8~H?;QJMLr2;>oz$Ys3g9_ZDz>h2NNeZ0r``E;%$~=>896xYS)aOR{zQd+rF1PTpDjS!Z`8fQw%xHi!<U3I%dol;d%!iT3F364${=3Ly>azz4|98k^%Cq|kzYTdT#q3_f$C1a>X9o#?5AvAuY%k&4k;mp{y9s|M@|fc62EwmG9#flbCH$?(V@k6Pgl|M1Q<<$L{9@!Wg;^Wn=Od4)%UTIP2l$RbmKXOO?%SO?_ZoNGn$`SwK0X0ZkWU$B)?m)0e*1Bt&V!jU(B#viy_HWd-HJIpR(AUoIn%!Mv-Uwk@3U{nT)Hd^w(-)j%xB01K+Btcz~qxI@W=Y?dsv6S`Ci5OKE?Td#rXln`9XRv$sUh2+ewNtH$gi1fDH2Kh<zRSv%%GML{a)EGX(@vZT7Z-H!Qp2(3j44eCeQltuH<ACy<R(T^$a~jD9(qz>s(7q<%%ZvfQ20^_|OE2Bw07>veI7FD18(4;=CZ{)Z=0RZpN&OS+PCr<_eo>h|0>$udw0)zEiT=aWXH*WHp+sx0pt*16W%+bp}jL>JNrKIyZ}8(%|mq)#zV$KW*8Y+svhMY3+-4XF(nJ}3F?>nuA~LNTS};H2YUjkr!XSROw%l$p`cf6UT9A1=B+x1{F)<x~Gf((4Nxl4GcX81xuJ|4c}e>*xbD0|$HTzQFOuRMqaj3lQ5AP{`6Dw{!({0H$`HCtWykeg!6T;V&__>80-idEu`>A~OdXTgVp}eA6|0|1bH#@n$gUCRQhdRkx&*hO&pjmSqOKlt5gqE$NLW=#@^nJDcs@tY3G~e)UN~dyh|g+TKenTXucQ<wGAhYuVKSQ8+&#_VTf&Z+M23#Hm};RX57f4%`Ag_7YZb=9x>moG%rzck|LwX|1hg;FILF*|l()wcnfaSf9tyjkCfOuXMznT4Qs)dEbX{q1yQ}pvjN=U$zV!#^n6!zFJ=TD#L@(v`6QHkRDh`o5%MZ(YcOVb_bz}*%wLFy`(e-J`sP>;(Grj^kErzl|=blAJpW-7a`4ka_~B8?!lj>WB@XL+G^v{-MP%1OIRnzWcie6@AgT#Ovr?GzRFB2$KlDR9w!4e$S;^iMy_SxL#&7I9LDi{*LwFl_j>o;Zeh4%(6=OF@3HjX1I>gY<R#H=%Iu+*O{rE}_NpAVor73*eFZ%Yy|Cjmtkl4XROOR>=OMcfW4iUyaP}V{Oqe^CthZrBX6>Lk=yO3Awn*<M|A|DLwGc-z5VBuF9B$WXOL{Mu^T0^l@hF_M1b*I_GVUhb_HUrjELH8s!PhK}WS@uYuD30_V%QFl-w4zfcmw1g1^MLNjYPJpJbN<=ylmOA3>99p?D`gI@at60ELA><#UUNfddM)a?3zv^n@j|uax0;7F}CM1Hshnx(5au}b!;=re}a7w7->#Td(_=`F_#Q9qR^r2HncZtNxynYws!=}Eikf-$yI{fZZ`<x`11_BW7+W($-)^+`Y|~128Ma58S-v?h$P_0;C-1i?a^lG#Hk}hTm-3R*L#*-n~I1(L-Iw$vzu}#2(dR_LQjwk*CovEP@^oJoZBo_?rw%0Oea(M#6&q6-lOA4u}uc<1$_R?+;(0L<-$cd^wSqHq~j3MZW2-#g!GUb67*A)dh4Q`fLDmr37@piZUxaNiD-lrm0KE?jL(tkKzl#DDBFLmn8v+Ijq6y>Vi#!=Ixb>JZ?Xc|2D#de!H1co=OWGS%@_0Os%GiJy9W>RkQH+F5UQ<bYG&r3tcaRHr%_v*lOs5BL5^tT0*RzCRrh4y<($|G;}WB)^}#G&<AXWe=0kftoLPCmOqpYP#RQf@(G-fNP&9?2DHH|F1j&99YYkG8HPd3-a6$IJR_%8M^~<B*2J~BxE^E<w4M4U`tHv#lZX3{TJ$kG~-!%Z)&@1*tHSLL`m*q%5ptbSd`Qn~=*>jt{-dFGpL1o_7X*~0?XOt{>_Ko%2ceya>@zQXn%OKBtc!%Mo-(;qL1-JjqS)3t<Pkn$c$Q@c5<_B_OS>^|Lh5AM0mCQ~+P8})Szo7OHO|+56!_0mnz0_F&e0uU?LKZ$vt{ygJ8{ullpz{;2^!nYr^uK)H??+qPeCe|98qmtbD+yWp6OhVHetUwA`$E1?rI+f!&>B8nb{;_9b&i+b7pKCb=#MAJkD?RT=S~*dvwj$#LRIY>nm`)z!UQxk`!eYBLzfM_G|CTUZsB!D`PVOtP%>rrQiGLfu#~;trLR}Qb6fI8zHjLaPymzAo=OP&R^T%4ehK;HA%vr4KLR-&s+0TJnc)r+4~nnP;*D752hQS?W6%1Og_pi|ef~fjpL)>52j1g{ey8WtRWryPIXV6=X%y~4aQ}hl1*dE1fqA~bNhqIxf&NWa!mU{^jpA);c#wxDqkT9-rPg5a|B%=H>eO!_y-(}Obmb;w=}J9&8hQK+<<m&V;A&pF2u-lj{{I3k{jCYPiFajpf04g0-^Jn~3Vk0#0&n3{O;&#PIezGzo`-UOsFzf0lPRV5NkjbX^Zd|xxbWJRx%|LcaSAV;=cUt<j_(^X@_iral3(!Yo1fz)@YZ*@`Yy~I*!Q`PiB`CuO67dtF{9UYF8O6j&(D4hElQ_529^5Wv~fQ#HL3K`)h7NxPCjmdc5Mmp=^Oq-ezJubf|u&-n6%+D7%Bp(I=e4ztVvDar9*?#1itSO*#8vUms$de;3b0(oWRd2eqVN#-F$}ir}Lo4dGOSUjPVSns)6`l;BNCumoQUj_*A0WCw-WCpLEeCD~>@IdLH<Mmrf;5l1@ZDRxkK|;g$XyUod>>nU{@ZD9jsIX5&`7rLVoxS>NpU$-CLm*M`g;r->!e=6omrJT6`ENoSj-&)m7HU-R%B&AZ-BeuM*3@mMohsDLxW^j(j<-HknP{h~=|ibbQLfG9MD#c(L$2y}OIwYHm=+InoWX2GAEZBc>BYhgSi*j7B-suU$hI4auKM8mP@vT!uGcyT-y6KepQ&8}~bg@a0gWHc;>P~rv~5z}2`Sb}Tu_(IqHc`k?3*#<}pKFD<g{WZ*_-Efzxg%Pk9DAwqHxYOhMWdl6T;JR}+KGgsngvoO!&=H(OK_1^12kD{#Tg%XGTgB;mth#F|%T0s2ax3EasiPWf&sD@#T%P0XRQ|xI+y>5UU1qMn)l#v=)XUv+^^!RY?AJ4W{5H`GF)7y%a77DW(++??(u2)r>rTDfT)o}kHrx7)?Gwz^O=fGO+0;~V7o5Avd1D3o{2u(Q5c?d|gA09nkTCfw+-4K`Ui2*dY;b*=PQJb!?e-a#n``weWm6!ztfEJ8t`Fpy+bV7VwR7;h1U43<kLB35=6u_NtT~?Hqpxs^Z%f-+eI!fe|EPmPzlP<im6P+e6LNJHl3@H#U>eQV-TFpz^)5rR*_Jjonrn8Jxy`lP$GOe*edWu|gL=b=VS>3HFt@p;(QE_RMw$?s*T=zjJ=~HV==?Ub^=^nCbNwvfz0md$r}E>;`{B_KkA7Or4e??=$lBQ@u(J>BDA${EIo-5bOE~VZZq}=lxbu4J@k!i!Wh1($CUGxL`lb(R|IZJ${>j!m+4`pPd!&*+r&IH9(G#{twudgRv9+=OYMIi{d-?U(YbejwLa(Njt+%q;Wn=Tp%efe_Pdh!|rSycY86Kq9*&5#l%CogS+8osyDIRQ%lBer+thQQdd~Cj9YmjVhlpn9gttNH5>#06li)8+<<<xR8-H`Zn6uM0LL25WhdDhNR%5R|8&r@Ex=KPmD*!N)Vag-+dZAw3&^em<0XyT_(I*ZaplrE$6c1k-a-Aw6rN*_@!&i)w(Tc2mg@}{Q6wwg8V$*7pL-Q-y4sGYYUNjT>N&U!~}-E0~CV{99s*XoOWsWm9RJE(C3Cl<wx`TADlW%;^R<Kv2M7BE0HZYVE?oAULf#>eODR*g@{*S8w4$d7Y1Udin*icjSB7U@3&XXf@7#Vz@HLycRxy+!d!`TYZG{0eSgQT$3Sb4@Y4DnCD|@yYplNsUh_IxY+_JFs~~jYH#Y#qh%STs4067!0QqBlmeui_3cntoezSh22PT8wHpbT<g?h{^`W#pm;x#pUQ2$-j?@=$KRLm`vYpns+mytQoL1z|2xI^YVen--yV(M6Xbks{&UpMNsXNf9m<dG$5QQ|L*%dEeqW>>ipk6K`Ph29jo2Am4{b!gYE1h>6xX)1hu9fgKf6loH+WZv`!~#7Fa3x&hvJ`+Z>ZH=wWh9S8?gq)*5O&Qub?o#*nOm|#D0dkCGa~->?e7UL;1pZKTGGE%_Z!-2>2v@^_Y447bWC>R|3Bb_;p~1eFtUJ+~hKpA3M)nZIJUhLT~VkDSnTkxc&YT_&lQ=FWYCv-d*;TkpI^bc%}p%BlgG6!$zZ=H*LRLjm7tk{IyZ86Ky?gAoVkq>%Cr$*BND8Yrnx*Vjm98gO%nvMDb(^`A16N&lrpElX<y>{BMnNKkldFVj7LNqD*d2FKrLItzJ`BeE*EIthoKwvf|^ey{vdU@1^pibiV4R`1TU=drSB&zE~jKdFKjO{w=-^-|{_SkJBXxt*bn3ZQmA_ty$63=3Ti0xBRGN7m^o#Pq?J?a^K2Ew@(lf$#%gjZxq4JEWUa{2*<*p%mw0NLQHmaI09T@Cy^j_2?5+Ol;8v*7!x)|V(tEj5ENtagy2v1aDiA?cO)c+f{vROx$27x;ck_%;E%`sTZK?mjBn*S;{L9X5KMM;Z3PttCty=lqJpq&mAl0wcvduH9K!MyYXlEZLB4qvCp3S1g}cSu1lLr`K{Y^j$mH{|a@n%go;IP)-RSfD1vV}<G$=RI2+E#mo{u|-LP5Xi=LGLcvJWXLBom=v$<0h-tbOyACXKjie-OP!H~;+kd%Ltgf{B>W2?<i|BGU>f_Asg2(R_y^9_nzE*ouYWvP65s;nku`@CKn6K)@UJKm?IcB7tXq_~WS;T7*y>GULG>TA=D7xUSkfrOgIz8Pg^^x}{4C{YiViv`J9!>?*VXueG%_vASkk%*G@d>W0;>(4I)J^Wt08wAy5ESRj!k1EJ{Fw}uAAj<EbLK#iSm+FhvH(*}BU_Zey6qRlYD#p2$u+*Qsx=&O!!B!ZO@-Wc_Ct-39&Y$eVU`8|L|V=3%&)Apru$dOHZnjMlwX4XHjHL}S5Lv@=tM`CN2=x+xq#%0>c&cabJ+08kkF)`$T{LT~o8!5Ljnsl@$!;#>;aF8Qhr$5ojIf7fGU{9uET)wgyItv=DVg$Gr4@LYaNYA<>BD#b=##6_}7@R=G!(Wn8M?6O6A4jN@PPU!Fc!2}!fq)R|352>uK_u}z3Nxo{gPns<e^)pFC&VCBB<Fy801k*^x4A#{z{hvIWwZNvsr~ls&}n%5c%$6IrrpnO)5vSrS)3Yu_I}T({SWBl`smqQF2?lPIsl_J6lbsd+Sm0JoV>=x^x1j=qYaeeI+;$P&mMno=hS=H^NuLppjm&==I?G!UZY}SZ2f^zwvfWi>NRu|C$D)io~=_b+RGK%Z{Wtpzm1b~%JkWK2BT~pPMbd#e?Qf4q&!>qV6;`Ce^n9vU7T_+e_<VzQRQArjvL$ml187cqcA$Ek+*8-_cZ!!y@gS2zDyeWgw}tBn!cgj1j(uQu;THQMxVV`F{)ig(#HQIPCb6vduX0&<ZT-MXBz!d|F5K!|CcoSY~6^_22K5I^ZBwypRF%3s%@`!{Jg`-`*Yd)ZsGr_$h<b++Wy1+{}zQlTW_eHUc9|p{WDx)Y~fM(e?Zi~V*XI-v3BjDF=^M)`57|LwoR7ue@UaCe;=hpyX>cpM^6{dnLc~Zt)}|g{%g?am+NHz+67;xKU;$r`#w_aKkM*Re+O;wH0nb;e~eeOU3rYqiT{XZomX2wlS=4+pDyfKH40k&{{yGp2ZR"
open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True) | import math
n=int(input())
a=100000
for i in range(n):
a=a+a*0.05
if a%1000==0:
a=a
else:
a=(math.floor(a/1000))
a=a*1000+1000
print(a)
| 0 | null | 1,137,269,571,014 | 70 | 6 |
import sys
n=int(input())
data=list(map(int,input().split()))
for i in data:
if i%2==1:
continue
if i%3!=0 and i%5!=0:
print("DENIED")
sys.exit()
print("APPROVED") | N = int(input())
A = list(map(int,input().split()))
for i in range(N):
if A[i] % 2 ==0:
if A[i] % 3 ==0 or A[i] % 5 ==0:
pass
if i == N-1:
print('APPROVED')
else:
pass
else:
print('DENIED')
break
else:
if i == N-1:
print('APPROVED')
else:
pass | 1 | 69,034,374,948,740 | null | 217 | 217 |
#AIsing2020 d
def f(n):
cnt = 0
while n:
cnt+= 1
n = n%bin(n).count('1')
return cnt
def main():
N = int(input())
X = input()
X10 = int(X,2)
X10_num1 = X.count('1')
X10_pulse = X10%(X10_num1+1)
X10_ninus = X10%(X10_num1-1) if X10_num1 >1 else 0
for i in range(N,0,-1):
if (X10>>(i-1) & 1) and X10_num1 >1:
mod = X10_num1-1
amari = (X10_ninus - pow(2,i-1,mod))%(mod)
elif (X10>>(i-1) & 1) and X10_num1 ==1:
print(0)
continue
else:
mod = X10_num1+1
amari = (X10_pulse + pow(2,i-1,mod))%(mod)
print(1+f(amari))
main()
| def search(n):
res = 0
while n:
n %= bin(n).count("1")
res += 1
return res
def main():
n = int(input())
x = list(input())
x_decimal = int("".join(map(str, x)), 2)
first_mod = sum(map(int, list(x)))
increase_mod = first_mod + 1
increase_base = x_decimal % increase_mod # 反転させる桁が元々0だった場合
decrease_mod = first_mod - 1
if decrease_mod:
decrease_base = x_decimal % decrease_mod # 反転させる桁が元々1だった場合
for i in range(n):
cnt = 0
if x[i] == "1" and decrease_mod:
cnt = 1 + search((decrease_base - pow(2, n - i - 1, decrease_mod)) % decrease_mod)
elif x[i] == "0":
cnt = 1 + search((increase_base + pow(2, n - i - 1, increase_mod)) % increase_mod)
print(cnt)
if __name__ == '__main__':
main()
| 1 | 8,220,674,977,800 | null | 107 | 107 |
from bisect import *
N = int(input())
L = sorted(map(int,input().split()))
a = 0
for i in range(N):
for j in range(i+1,N):
a+=bisect_left(L,L[i]+L[j])-(j+1)
print(a) | from math import atan, radians, degrees
a, b, x = map(int, input().split())
h = x/(a**2)
he = b - h
if 2*h >= b:
ans = degrees(atan((2*b-2*h)/a))
print(ans)
else:
ans = degrees(atan(b**2/(2*h*a)))
print(ans)
| 0 | null | 167,344,404,305,948 | 294 | 289 |
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
k, n = LI()
a = LI()
# 一周kメートルの円形湖があり、n軒の家がある。
# i番目のいえは北端から時計回りにAメートルのところにある。
# いずれかの家から出発してn件すべての家に尋ねるための最短移動距離を求めよ
# 円形で考えるからややこしい
# 一番距離が長い家と家の区間を除外した直線状と考えればよいのでは。
far = []
for i in range(0,n):
if i == 0:
d = a[0] + k - a[-1]
else:
d = a[i] - a[i-1]
far.append(d)
longest = 0
for i in range(n):
if far[i] > longest:
longest = far[i]
longest_i = i
del far[longest_i]
print(sum(far)) | k=int(input())
que=list(range(1,9+1))
while True:
if len(que)>=k:
break
k-=len(que)
for q in que[:]:
que.remove(q)
lq=int(str(q)[-1])
for r in (lq-1,lq,lq+1):
if 0<=r<=9:
que.append(int(str(q)+str(r)))
if len(que)>=k:
break
que.sort()
print(que[k-1]) | 0 | null | 41,888,759,198,692 | 186 | 181 |
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
def inp():
'''
一つの整数
'''
return int(input())
def inpl():
'''
一行に複数の整数
'''
return list(map(int, input().split()))
s, t = input().split()
a, b = inpl()
u = input()[:-1]
if u == s:
print(a - 1, b)
else:
print(a, b - 1)
| s,t = [x for x in input().split()]
a,b = [int(x) for x in input().split()]
ss = input()
if ss == s:
print(a-1,b)
else:
print(a,b-1)
| 1 | 71,825,299,621,440 | null | 220 | 220 |
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
def main():
n = int(input().strip())
print('1' if n == 0 else '0')
if __name__ == "__main__":
main()
| for i in range(10000):
x=int(input())
if x==0:
break
print("Case "+str(i+1)+": "+str(x))
| 0 | null | 1,728,021,575,180 | 76 | 42 |
s1 = []
s2 = []
a = 0
s = input()
for i in range(len(s)):
if s[i] == "\\":
s1.append(i)
elif s[i] == "/" and len(s1)>0:
j = s1.pop()#position of nearest \
a += i-j
a_splt = i-j
while(len(s2) > 0 and s2[-1][0] > j):
a_splt += s2.pop()[1]
s2.append([j, a_splt])
print(a)
ans = ""
ans += str(len(s2))
for area in s2:
ans += " " + str(area[1])
print(ans)
| import itertools
n,m = map(int, input().split())
ball = [2*i for i in range(1,n+1)] + [(2*j)-1 for j in range(1,m+1)]
cnt = 0
for c in itertools.combinations(ball,2):
cnt += sum(c)%2 == 0
print(cnt) | 0 | null | 22,640,937,798,480 | 21 | 189 |
x = {"S": list(range(1, 14)), "H": list(range(1, 14)),
"C": list(range(1, 14)), "D": list(range(1, 14))}
n = int(input())
for i in range(n):
tmp = input().split()
key = tmp[0]
num = int(tmp[1])
x[key].remove(num)
keys = ["S", "H", "C", "D"]
for key in keys:
if len(x[key])==0:
pass
else:
for i in x[key]:
print(key, i) | n = input()
a = [raw_input() for _ in range(n)]
b = []
for i in ['S ','H ','C ','D ']:
for j in range(1,14):
b.append(i+str(j))
for i in a:
b.remove(i)
for i in b:
print i | 1 | 1,048,066,578,592 | null | 54 | 54 |
n = int(raw_input())
intervals = [[u-l,u+l] for u,l in [map(int, raw_input().split()) for _ in range(n)] ]
intervals.sort(key = lambda x:x[1])
count = 1
i = 1
cur= intervals[0]
while(i < len(intervals)):
while(i < len(intervals) and cur[1] > intervals[i][0]): i += 1
if i < len(intervals):
cur = intervals[i]
count +=1
print count | import sys
input = sys.stdin.readline
N = int(input())
imo = []
xlmin = 0
xlmax = 0
for _ in range(N):
x,l = map(int,input().split())
imo.append([x-l,x+l-1])
imo = sorted(imo,key = lambda x: x[1])
cnt = 1
ls = imo[0][1]
for i in range(1,N):
if imo[i][0]<=ls:
continue
else:
cnt += 1
ls = imo[i][1]
print(cnt)
| 1 | 90,103,374,860,620 | null | 237 | 237 |
X = int(input())
happy = 0
happy += X // 500 * 1000
X = X % 500
happy += X //5 * 5
print(happy) | b=[]
i=-1
while True:
a=input()
if a=="-":
break
else:
b.append(a)
i+=1
c=int(input())
for j in range(c):
a=int(input())
d=b[i][a:]
b[i]=b[i][0:a]
b[i]=d+b[i]
for i in b:
print(i)
| 0 | null | 22,438,603,347,360 | 185 | 66 |
N,K=map(int,input().split())
if N > K:
N %= K
ans = min(N, K-N)
print(ans) | while True:
x = int(input())
if x == 0:
break
SCORE = len(str(x))
ans = 0
amari=x
for i in range(SCORE+1):
ans += amari//10**(SCORE-i)
amari = amari%10**(SCORE-i)
print(ans)
| 0 | null | 20,519,288,962,688 | 180 | 62 |
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
a, b = map(int, input().split())
print(max(0, a - 2 * b))
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| A,B = map(int,input().split())
print(max(0,A-B*2)) | 1 | 166,952,755,691,712 | null | 291 | 291 |
#162D
#RGB Triplets
import collections
n=int(input())
S=input()
s=collections.Counter(S)
ans=s['R']*s['G']*s['B']
for i in range(n):
for d in range(n):
j=i+d
k=j+d
if k>n-1:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans-=1
print(ans) | import sys
input=sys.stdin.buffer.readline
mod=10**9+7
n=int(input())
d={}
z=0
from math import gcd
for i in range(n):
x,y=map(int,input().split())
if x==y==0:z+=1
else:
f=gcd(x,y)
x//=f;y//=f
if x<0:x*=-1;y*=-1
if x==0 and y<0:y=-y
if (x,y)not in d:d[(x,y)]=1
else:d[(x,y)]+=1
ans=1
for (a,s) in d:
if d[(a,s)]==0:continue
ng=0
if (s,-a)in d:ng+=d[(s,-a)];d[(s,-a)]=0
if (-s,a)in d:ng+=d[(-s,a)];d[(-s,a)]=0
ans*=(pow(2,d[(a,s)],mod)-1 + pow(2,ng,mod)-1 +1)%mod
ans%=mod
d[(a,s)]=0
print((ans+z-1)%mod) | 0 | null | 28,733,108,894,210 | 175 | 146 |
n, m = list(map(int, input().split(' ')))
c = list(map(int, input().split(' ')))
table = [[0 for j in range(n+1)] for i in range(m+1)]
table[0][1:] = [float('inf') for j in range(1, n+1)]
for i in range(1, m+1):
for j in range(1, n+1):
if j - c[i-1] < 0:
table[i][j] = table[i-1][j]
else:
table[i][j] = min(table[i-1][j], table[i][j-c[i-1]]+1)
print(table[-1][-1])
| n, m = map(int, input().split())
d = list(map(int, input().split()))
dp = [10000 for i in range(n + 1)]
dp[0] = 0
for i in range(0, n + 1):
if dp[i] < 10000:
for j in d:
if i + j <= n:
dp[i + j] = min(dp[i] + 1, dp[i + j])
print(dp[n]) | 1 | 144,465,355,598 | null | 28 | 28 |
import math
n = int(input())
mod = 10**9+7
d = {}
zero = 0
for i in range(n):
a,b = map(int,input().split())
if a == 0 and b == 0:
zero += 1
else:
g = math.gcd(a,b)
a //= g
b //= g
if b < 0:
a = -a
b = -b
if b == 0 and a == -1:
a = 1
if a > 0:
if (a,b) in d:
d[(a,b)][0] += 1
else:
d[(a,b)] = [1,0]
else:
if (b,-a) in d:
d[(b,-a)][1] += 1
else:
d[(b,-a)] = [0,1]
ans = 1
for (a,b),(c,d) in d.items():
count = (pow(2,c,mod)+pow(2,d,mod)-1)%mod
ans *= count
ans %= mod
print((ans+zero-1)%mod)
| N=int(input())
AB=[list(map(int,input().split())) for i in range(N)]
from collections import defaultdict
d=defaultdict(int)
d2=defaultdict(int)
a0=0
b0=0
c0=0
from math import gcd
for a,b in AB:
if a==b==0:
c0+=1
elif a==0:
a0+=1
elif b==0:
b0+=1
else:
if a<0:
a,b=-a,-b
g=gcd(a,b)
a,b=a//g,b//g
if b>0:
d[(a,b)]+=1
else:
d2[(-b,a)]+=1
m=10**9+7
a=1
for k,v in d.items():
if k in d2:
a=a*(pow(2,v,m)+pow(2,d2[k],m)-1)%m
else:
a=a*pow(2,v,m)%m
for k,v in d2.items():
if k not in d:
a=a*pow(2,v,m)%m
print((a*(pow(2,a0,m)+pow(2,b0,m)-1)-1+c0)%m) | 1 | 20,960,001,856,890 | null | 146 | 146 |
class Dice:
def __init__(self, d1, d2, d3, d4, d5, d6):
self.d1 = d1
self.d2 = d2
self.d3 = d3
self.d4 = d4
self.d5 = d5
self.d6 = d6
def S(self):
tmp = self.d1
self.d1 = self.d5
self.d5 = self.d6
self.d6 = self.d2
self.d2 = tmp
def N(self):
tmp = self.d1
self.d1 = self.d2
self.d2 = self.d6
self.d6 = self.d5
self.d5 = tmp
def E(self):
tmp = self.d1
self.d1 = self.d4
self.d4 = self.d6
self.d6 = self.d3
self.d3 = tmp
def W(self):
tmp = self.d1
self.d1 = self.d3
self.d3 = self.d6
self.d6 = self.d4
self.d4 = tmp
def output(self):
print(self.d1)
d1, d2, d3, d4, d5, d6 = map(int, input().split())
dice = Dice(d1, d2, d3, d4, d5, d6)
M = input()
for i in range(len(M)):
if M[i] == 'S':
dice.S()
elif M[i] == 'N':
dice.N()
elif M[i] == 'E':
dice.E()
elif M[i] == 'W':
dice.W()
dice.output()
| N = int(input())
ans = 0
MOD = 10**9+7
ans = 10**N-2*9**N+8**N
ans %= MOD
print(ans) | 0 | null | 1,708,367,934,340 | 33 | 78 |
from bisect import bisect_left
N=int(input())
y=list(map(int, input().split()))
y.sort()
ans=0
for i in range(N-2):
for j in range(i+1, N-1):
tmp=y[i]+y[j]
ans+=bisect_left(y,tmp)-j-1
print(ans)
| n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0
for ai in range(n):
for bi in range(ai+1,n):
ok,ng = bi,n
while ng-ok>1:
mid = (ng+ok)//2
if l[mid]<l[ai]+l[bi]:
ok = mid
else:
ng = mid
ans += ok-bi
print(ans) | 1 | 171,526,407,790,498 | null | 294 | 294 |
N, K, C = map(int, input().split())
S = input()
L, R = [-1] * K, [-1] * K
k = 0; temp = -C
for i, s in enumerate(S, 1):
if s == 'o' and i > temp + C: L[k] = i; k += 1; temp = i
if k == K: break
k = K - 1; temp = N + C + 1
for i, s in reversed(list(enumerate(S, 1))):
if s == 'o' and i < temp - C: R[k] = i; k -= 1; temp = i
if k == -1: break
ans = []
for l, r in zip(L, R):
if l == r: ans.append(l)
for a in ans: print(a) | k=int(input())
if k==4 or k==6 or k==9 or k==10 or k==14 or k==21 or k==22 or k==25 or k==26:
print(2)
elif k==8 or k==12 or k==18 or k==20 or k==27:
print(5)
elif k==16:
print(14)
elif k==24:
print(15)
elif k==32:
print(51)
elif k==28 or k==30:
print(4)
else:
print(1)
| 0 | null | 45,337,283,988,568 | 182 | 195 |
class Combination(): # nCr(mod p) #n<=10**6
def __init__(self, N, MOD): # cmbの前処理
self.mod = MOD
self.FACT = [1, 1] # 階乗
self.INV = [0, 1] # 各iの逆元
self.FACTINV = [1, 1] # 階乗の逆元
for i in range(2, N + 1):
self.FACT.append((self.FACT[-1] * i) % self.mod)
self.INV.append(pow(i, self.mod - 2, self.mod))
self.FACTINV.append((self.FACTINV[-1] * self.INV[-1]) % self.mod)
def calculate(self, N, R): # nCr(mod p) #前処理必要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
return self.FACT[N] * self.FACTINV[R] * self.FACTINV[N-R] % self.mod
n, m, k = map(int, input().split())
mod = 998244353
cmb = Combination(n,mod)
cnt = 0
for i in range(k + 1):
cnt += (m * pow(m - 1, n - i - 1, mod) * cmb.calculate(n - 1, i)) % mod
print(cnt % mod)
| def combs_mod(n,k,mod):
#nC0からnCkまで
inv = [1]*(k+1)
for i in range(1,k+1):
inv[i] = pow(i,mod-2,mod)
ans = [1]*(k+1)
for i in range(1,k+1):
ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
return ans
def solve():
ans = 0
mod = 998244353
N, M, K = map(int, input().split())
top = min(K,N-1)
combs = combs_mod(N-1,top,mod)
for k in range(top+1):
ans += M*combs[k]*pow(M-1,N-1-k,mod)
ans %= mod
return ans
print(solve()) | 1 | 23,209,761,319,040 | null | 151 | 151 |
N = int(input())
A = list(map(int, input().split()))
if N == 0:
if A[0] == 1:
print(1)
else:
print(-1)
exit()
elif A[0] != 0:
print(-1)
exit()
leaf = A
not_leaf = [0] * (N + 1)
not_leaf[0] = 1
for i, a in enumerate(A[1:-1], 1):
not_leaf[i] = not_leaf[i - 1] * 2 - a
for i in reversed(range(1, N + 1)):
total = not_leaf[i] + leaf[i]
prev = not_leaf[i - 1]
if prev > total:
not_leaf[i - 1] -= prev - total
if not_leaf[i - 1] * 2 < total:
print(-1)
break
else:
print(sum(leaf) + sum(not_leaf)) | import math
ceil = math.ceil
def main(N, A):
A.reverse()
pos = [(A[0], A[0])]
for i in range(len(A)-1):
tmpmin = ceil(pos[-1][0]/2) + A[i+1]
tmpmax = pos[-1][1] + A[i+1]
pos.append((tmpmin, tmpmax))
l,r = pos.pop()
if l > 1:
return -1
ki = [1]
A.reverse()
for j in range(N):
m = (ki[j]-A[j])*2
l, r = pos.pop()
if m < l:
return -1
ki.append(min(r, m))
return sum(ki)
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
ans = main(N, A)
print(ans)
| 1 | 18,773,175,491,952 | null | 141 | 141 |
S = input()
if S[1] == 'R':
print('ABC')
elif S[1] == 'B':
print('ARC') | #166A
#1.入力をちゃんと受け取ること
contest=input()
#2.結果を出力する
if contest =='ABC' :
print('ARC')
elif contest =='ARC':
print('ABC') | 1 | 24,281,736,419,864 | null | 153 | 153 |
#coding:utf-8
#1_3_B
from collections import deque
n, quantum = map(int, input().split())
q = deque()
total_time = 0
for i in range(n):
name, time = input().split()
q.append([name, int(time)])
while q:
ps_name, ps_time = q.popleft()
if ps_time <= quantum:
total_time += ps_time
print(ps_name, total_time)
else:
total_time += quantum
ps_time -= quantum
q.append([ps_name, ps_time]) | import math
d=100
for _ in[0]*int(input()):
d=math.ceil(d*1.05)
print(int(d*1e3))
| 0 | null | 22,768,520,400 | 19 | 6 |
def is_prime(x):
if x <= 1:
return False
i = 2
while i * i <= x:
if x % i == 0:
return False
i += 1
return True
cnt = 0
for _ in range(int(input())):
if is_prime(int(input())):
cnt += 1
print(cnt) | (A,B)=input().split()
(A,B)=(int(A),int(B))
if 1<=A<=9 and 1<=B<=9:
print(A*B)
else:
print(-1) | 0 | null | 79,025,076,054,078 | 12 | 286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.