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
|
|---|---|---|---|---|---|---|
S=input()
T=input()
count=0
ans=0
for s in S:
t=T[count]
#print('t = %s, s = %s'%(t,s))
if(t!=s):
ans+=1
count+=1
print(ans) | def main(S, T):
N = len(S)
ans = 0
for i in range(N//2):
if S[i] != T[i]:
ans += 1
if S[-1-i] != T[-1-i]:
ans += 1
if N%2 == 1:
if S[N//2] != T[N//2]:
ans += 1
return ans
if __name__ == '__main__':
S = input()
T = input()
ans = main(S, T)
print(ans)
| 1 | 10,482,667,281,758 | null | 116 | 116 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
a2 = [0]
for i in range(n):
a2.append(a2[-1] + a[i] - 1)
a2 = [a2[i] % k for i in range(n + 1)]
count = {}
temp = a2[:min(k, len(a2))]
for i in temp:
count.setdefault(i, 0)
count[i] += 1
ans = 0
for i in count.values():
ans += (i * (i - 1) // 2)
for i in range(1, len(a2) - len(temp) + 1):
temp = a2[i: i + len(temp)]
temp2 = temp[:-1]
ans += temp2.count(temp[-1])
print(ans) | import math
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**5+5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
N,K = list(map(int,input().split()))
A = sorted(tuple(map(int,input().split())))
B = tuple(A[i+1]-A[i] for i in range(len(A)-1))
lim = math.ceil(len(B)/2)
L = 10**9+7
ans = 0
multi = cmb(N,K,mod)
for j in range(lim):
front = j + 1
back = N - front
tmp_b = 0
tmp_f = 0
if front >= K:
tmp_f = cmb(front,K,mod)
if back >= K:
tmp_b = cmb(back,K,mod)
if j == (len(B)-1)/2:
ans += (multi - tmp_b - tmp_f)*(B[j]) % L
else:
ans += (multi - tmp_b - tmp_f)*(B[j]+B[len(B)-1-j]) % L
print(ans%L) | 0 | null | 116,598,957,539,610 | 273 | 242 |
import sys
input = sys.stdin.readline
def factors(x: int) -> list:
s, xx = [], x
for i in range(2, int(x ** 0.5 + 1)):
if xx % i == 0:
c = 0
while xx % i == 0: c += 1; xx //= i
s.append((i, c))
if xx != 1: s.append((xx, 1))
if s == []: s.append((x, 1))
return s
n, res = int(input()), 0
f = factors(n)
pre = [1, 3, 6, 10, 15, 21, 28, 36, 43]
flag = False
if len(f) == 1 and f[0][0] == 1: print(0); flag = True
if not flag:
for fact in f:
for i in range(len(pre)):
if pre[i] > fact[1]: res += i; break
print(res) | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
dic = collections.defaultdict(int)
while n != 1:
prime = 0
limit = int(n**(1/2))
for i in range(2,limit+1):
if n%i == 0:
prime = i
break
else:
prime = n
while n%prime == 0:
n //= prime
dic[prime] += 1
ans = 0
for key,value in dic.items():
cnt = 0
while value>=cnt+1:
cnt += 1
value -= cnt
ans += cnt
# print(dic)
print(ans)
main()
| 1 | 16,792,792,476,900 | null | 136 | 136 |
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
A = LI()
ans_list = [0] * N
for a in A:
ans_list[a - 1] += 1
for i in range(N):
print(ans_list[i]) |
N = int(input())
X = list(map(int, input().split()))
ans = [0] * (N + 1)
for v in X:
ans[v] += 1
print(*ans[1:], sep="\n")
| 1 | 32,517,387,171,438 | null | 169 | 169 |
def actual(n, k, h_list):
return len([h for h in h_list if h >= k])
n, k = map(int, input().split())
h_list = map(int, input().split())
print(actual(n, k, h_list)) | n,k=[int(s) for s in input().split()]
h=[int(j) for j in input().split()]
r=0
for i in range(n):
if k<=h[i]:
r=r+1
print(r) | 1 | 179,061,335,817,600 | null | 298 | 298 |
a,b,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=min(a)+min(b)
for i in range(m):
p,q,r=map(int,input().split())
ans=min(a[p-1]+b[q-1]-r,ans)
print(ans)
| # coding: utf-8
def bubblesort(ls):
count = 0
for i in range(1, len(ls)):
for j in reversed(range(i, len(ls))):
if ls[j] < ls[j-1]:
ls[j], ls[j-1] = ls[j-1], ls[j]
count += 1
return count
def main():
trash = input()
ls = list(map(int, input().split(' ')))
i = bubblesort(ls)
print(' '.join((map(str,ls))))
print(i)
if __name__ == '__main__':
main() | 0 | null | 27,162,595,197,220 | 200 | 14 |
from collections import deque
def breadth_first_search(adj_matrix, n):
distance = [0] + [-1] * (n - 1)
searching = deque([0])
while len(searching) > 0:
start = searching.popleft()
for end in range(n):
if adj_matrix[start][end] and distance[end] == -1:
searching.append(end)
distance[end] = distance[start] + 1
return distance
def main():
n = int(input())
adj = [[False for _ in range(n)] for _ in range(n)]
for _ in range(n):
ukv = input().split()
id = int(ukv[0])
dim = int(ukv[1])
if dim > 0:
nodes = map(int, ukv[2:])
for node in nodes:
adj[id - 1][node - 1] = True
distance = breadth_first_search(adj, n)
for i in range(n):
print("{} {}".format(i + 1, distance[i]))
if __name__ == "__main__":
main()
| string = list(input())
times = int(input())
#a = [int(i) for i in range(0,5)]
#print(a)
for i in range(times):
order = input().split()
#print(order)
if order[0] == "replace":
replace_string = order[3]
#print(string)
count = 0
for j in range(int(order[1]), int(order[2]) + 1):
string[j] = replace_string[count]
count += 1
#print(count)
#print(string)
elif order[0] == "reverse":
#print(string)
reverse_string = string[int(order[1]):int(order[2]) + 1]
reverse_string.reverse()
#for j in range(int(order[1]), int(order[2]) + 1):
# string[j] = reverse_string[j]
string = string[:int(order[1])] + reverse_string + string[int(order[2])+1:]
#print(j)
#print(string)
#string[int(order[1]):int(order[2]) + 1].reverse()
#print(string)
#string[int(order[1]):int(order[2])] = string[int(order[1]):int(order[2])].reverse()
elif order[0] == "print":
#print(string)
print("".join(string[int(order[1]):int(order[2]) + 1]))
#print(string) | 0 | null | 1,041,347,473,980 | 9 | 68 |
N = int(input())
if N >=30:
print('Yes')
else :
print('No') | t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
ave_a = t1 * a1 + t2 * a2
ave_b = t1 * b1 + t2 * b2
if ave_a == ave_b:
print('infinity')
exit()
half, all = t1 * (b1 - a1), ave_a - ave_b
ans = half // all * 2 + (half % all != 0)
print(max(0, ans))
| 0 | null | 68,323,562,037,522 | 95 | 269 |
X = input().split()
print(X.index("0") + 1)
| # coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import defaultdict
# import math
# from itertools import product, accumulate, combinations, product
# import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
#from collections import deque
#import numba
def run():
H, N = map(int, sysread().split())
AB = list(map(int, read().split()))
A = AB[::2]
B = AB[1::2]
Amax = max(A)
INF = float('inf')
dp = [[INF] * (H+Amax+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(H+Amax+1):
tmp = j - A[i]
if tmp >= 0:
dp[i+1][j] = min([dp[i][j], dp[i+1][tmp] + B[i]])
elif j == H and tmp < 0:
dp[i + 1][H] = min(dp[i][H], dp[i + 1][0] + B[i])
else:
dp[i+1][j] = dp[i][j]
ret = min(dp[N][H:])
print(ret)
if __name__ == "__main__":
run() | 0 | null | 47,158,539,388,352 | 126 | 229 |
x = int(input())
while x == 0:
x += 1
print(x)
exit(0)
while x == 1:
x -= 1
print(x)
exit(0) | n = int(input())
s = input()
ans = 0
for i in range(0,1000):
num = str(i)
if i < 10:
num = "00"+num
elif i <100:
num = "0" + num
f = 0
for j in range(n):
if s[j] == num[f]:
f += 1
if f == 3:
break
if f==3:
ans +=1
print(ans)
| 0 | null | 65,972,509,707,748 | 76 | 267 |
#test
N,K = map(int,input().split())
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
AF = [A[i]*F[i] for i in range(N)]
l = -1
r = max(AF)
while r-l > 1:
x = (l+r)//2
k =0
#スコアをx以下にするのに必要な最小コストを算出
for i in range(N):
if AF[i]<=x:
continue
else:
k += A[i]-x//F[i]
if k <= K:
r = x
else:
l=x
print(r) | n, k = map(int, input().split())
a = sorted(map(int, input().split()))
f = sorted(map(int, input().split()))[::-1]
# 成績 Σ{i=1~n}a[i]*f[i]
# a[i]小さいの、f[i]でかいの組み合わせるとよい(交換しても悪化しない)
def c(x):
need = 0
for i in range(n):
if a[i] * f[i] > x:
# f[i]を何回減らしてx以下にできるか
diff = a[i] * f[i] - x
need += 0 - - diff // f[i]
return need <= k
l = 0
r = 1 << 60
while r != l:
mid = (l + r) >> 1
if c(mid):
r = mid
else:
l = mid + 1
print(l)
| 1 | 164,455,557,443,580 | null | 290 | 290 |
import math
h = int(input())
n = int(math.log2(h))
a = 2
r = 2
S = (a*(r**n)-a) // (r-1)
print(S + 1) | H, W, M = map(int, input().split())
hallline = [0 for i in range(H)]
wallline = [0 for i in range(W)]
b = {}
for i in range(M):
tmp = list(map(lambda x: int(x) - 1, input().split()))
hallline[tmp[0]] += 1
wallline[tmp[1]] += 1
b[(tmp[0], tmp[1])] = True
t = max(hallline)
s = max(wallline)
a = [i for i in range(H) if hallline[i] == t]
c = [i for i in range(W) if wallline[i] == s]
tmp = False
for i in a:
for j in c:
if (i, j) not in b.keys():
print(t + s)
tmp = True
break
if tmp:
break
if not tmp:
print(t + s - 1)
| 0 | null | 42,370,593,146,350 | 228 | 89 |
import Queue
import sys
class Proc:
def __init__(self, name, time):
self.time = time
self.name = name
def main():
array = map(lambda x: int(x), sys.stdin.readline().strip().split(" "))
p_num = array[0]
q_time = array[1]
p_queue = Queue.Queue()
for i in range(0, p_num):
array = sys.stdin.readline().strip().split(" ")
p_queue.put(Proc(array[0], int(array[1])))
t = 0
while not p_queue.empty():
p = p_queue.get()
if p.time > q_time:
p.time = p.time - q_time
p_queue.put(p)
t += q_time
else:
t += p.time
print p.name + " " + str(t)
if __name__ == "__main__":
main() | n,q = map(int,raw_input().split())
task = []
lst = []
a = 0
for i in range(n):
name,time = raw_input().split()
task.append(int(time))
lst.append(name)
while True:
if task[0] > q:
task[0] = task[0] - q
task.append(task.pop(0))
lst.append(lst.pop(0))
a += q
else:
a += task[0]
print lst[0],a
task.pop(0)
lst.pop(0)
if len(lst) == 0:
break | 1 | 44,849,008,318 | null | 19 | 19 |
n = int(raw_input())
a = 1
b = 1
for i in range(n-1):
tmp = a
a = b
b += tmp
print b | import sys
input = sys.stdin.readline
def main():
n = int(input())
fib = [1] * 46
for i in range(2, 46):
fib[i] = fib[i - 1] + fib[i - 2]
ans = fib[n]
print(ans)
if __name__ == "__main__":
main()
| 1 | 1,932,621,220 | null | 7 | 7 |
import math
def calc_koch_curve(left, right, i):
if i == n:
return
mid1 = (2*left[0] + right[0]) / 3, (2*left[1] + right[1]) / 3
mid2 = (left[0] + 2*right[0]) / 3, (left[1] + 2*right[1]) / 3
mid3_x = (
(mid2[0] - mid1[0]) * math.cos(math.pi/3)
- (mid2[1] - mid1[1]) * math.sin(math.pi/3) + mid1[0])
mid3_y = (
(mid2[0] - mid1[0]) * math.sin(math.pi/3)
+ (mid2[1] - mid1[1]) * math.cos(math.pi/3) + mid1[1])
mid3 = (mid3_x, mid3_y)
calc_koch_curve(left, mid1, i+1)
print(*mid1)
calc_koch_curve(mid1, mid3, i+1)
print(*mid3)
calc_koch_curve(mid3, mid2, i+1)
print(*mid2)
calc_koch_curve(mid2, right, i+1)
def main():
global C
global n
C = [(0, 0)]
n = int(input())
print(0., 0.)
calc_koch_curve((0, 0), (100, 0), 0)
print(100., 0.)
if __name__ == "__main__":
main()
| import math
def koch(d,x1,y1,x2,y2):
if d == 0:
return
xs = (2*x1+x2)/3
ys = (2*y1+y2)/3
xt = (x1+2*x2)/3
yt = (y1+2*y2)/3
xu = (xt-xs)*math.cos(math.pi/3) - (yt-ys)*math.sin(math.pi/3) + xs
yu = (xt-xs)*math.sin(math.pi/3) + (yt-ys)*math.cos(math.pi/3) + ys
koch(d-1,x1,y1,xs,ys)
print(xs,ys)
koch(d-1,xs,ys,xu,yu)
print(xu,yu)
koch(d-1,xu,yu,xt,yt)
print(xt,yt)
koch(d-1,xt,yt,x2,y2)
n = int(input())
print(0.00000000,0.00000000)
koch(n,0.0,0.0,100.0,0.0)
print(100.00000000,0.00000000) | 1 | 126,454,375,090 | null | 27 | 27 |
n = int(input())
s = input()
ans = 0
for i in range(1000):
i = str(i).zfill(3)
a = s.find(i[0])
if a != -1:
b = s.find(i[1], a + 1)
if b != -1:
c = s.find(i[2], b + 1)
if c != -1:
ans += 1
print(ans) | import collections
N = int(input())
S = input()
S_list = [S[i] for i in range(N)]
S_c = collections.Counter(S_list)
list12 = []
list1 = []
ans = 0
for i in range(N-2):
s1 = S_list[i]
S_c[s1] = S_c[s1]-1
if s1 in list1:
continue
S_c23 = S_c.copy()
list1.append(s1)
for j in range(i+1,N-1):
s2 = S_list[j]
S_c23[s2] = S_c23[s2] - 1
if (s1+s2) in list12:
continue
else:
list12.append(s1+s2)
for key in S_c23.keys():
if S_c23[key] != 0:
ans+=1
print(ans) | 1 | 128,553,561,201,660 | null | 267 | 267 |
def do_solve(n, k, c, s):
dp = [0 for i in xrange(n)]
for i in xrange(n):
dp[i] = 1 if s[i] == 'o' else 0
if i - c - 1 >= 0:
dp[i] = max(dp[i], dp[i - c - 1] + 1 if s[i] == 'o' else 0)
if i - 1 >= 0:
dp[i] = max(dp[i], dp[i - 1])
return dp
def solve(n, k, c, s):
dp1 = do_solve(n, k, c, s)
dp2 = do_solve(n, k, c, s[::-1])[::-1]
# print dp1
# print dp2
res = []
for i in xrange(n):
if s[i] == 'x':
continue
l = dp1[i - 1] if i - 1 >= 0 else 0
r = dp2[i + 1] if i + 1 < n else 0
# print i, l, r
if l + r == k - 1:
res.append(i + 1)
# print res
return res
assert solve(16, 4, 3, 'ooxxoxoxxxoxoxxo') == [11, 16]
assert solve(11, 3, 2, 'ooxxxoxxxoo') == [6]
assert solve(5, 1, 0, 'ooooo') == []
assert solve(5, 2, 3, 'ooxoo') == [1, 5]
(n, k, c) = map(int, raw_input().split())
s = raw_input().strip()
for num in solve(n, k, c, s):
print num
| n,k=map(int,input().split())
mod=10**9+7
ans=0
A=[0]*k
for i in range(k,0,-1):
a=0
A[i-1]=pow((k//i),n,mod)
m=i*2
while m<=k:
A[i-1]=(A[i-1]-A[m-1])%mod
m=m+i
ans=(ans+i*A[i-1])%mod
print(ans%mod) | 0 | null | 38,445,539,445,560 | 182 | 176 |
W,H,x,y,r = input().split()
W = int(W)
H = int(H)
x = int(x)
y = int(y)
r = int(r)
if x < 0 or y < 0:
print("No")
else:
if W - x >= r and H - y >= r:
print("Yes")
else:
print("No") | a,b = map(int,input().split())
w = []
t = {}
for i in range(b):
c = int(input())
s = list(map(int,input().split()))
w +=s
t = set(w)
print(a-len(t)) | 0 | null | 12,619,286,546,298 | 41 | 154 |
# 解説見ました。
n = int(input())
ans = 0
if n%2 == 0:
m = 1
for _ in range(25):
ans += n//(m*10)
m *= 5
print(ans) | import math
n = int(input())
cnt = 0
mod = 10
if n%2 == 1:
print(0)
exit()
while mod<=n:
cnt += n//mod
mod*=5
print(cnt)
| 1 | 116,047,266,609,716 | null | 258 | 258 |
X = int(input())
year = 1
yokin = 100
while True:
yokin += yokin//100
if yokin >= X:
print(year)
break
year += 1 | def main():
n = input()
x = "abcdefghijklmnopqrstuvwxyz"
print(x[x.index(n)+1])
if __name__ == '__main__':
main() | 0 | null | 59,639,535,705,788 | 159 | 239 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
money = 100000
d = int(sys.stdin.read())
for i in range(d):
money *= 1.05
if money%1000 != 0:
money -= money%1000
money += 1000
print int(money) | import sys
for num in sys.stdin:
ini = 100000
num = int(num)
for i in range(1, num+1):
ini = ini + ini*0.05
mod = ini % 1000
ini = ini - mod
if mod != 0:
ini += 1000
ini = int(ini)
print(ini) | 1 | 1,052,733,302 | null | 6 | 6 |
import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def main_b():
s = input()
pp=0
na=0
for i, c in enumerate(s[::-1]):
cc=na+int(c)
na=0
if cc <= 4:
pp+=cc
else:
na = 1
if i==len(s)-1:
pp+=1
pp+=10-cc
print(pp)
def main():
s = input()
pmin=1000
mmin=0
s='0'+s
for c in s[::-1]:
v = int(c)
npmin = min(pmin + 10 - (v+1), mmin + 10 - v)
nmmin = min(pmin + v + 1, mmin + v)
pmin = npmin
mmin = nmmin
return min(pmin, mmin)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | N = list(map(int, list(input())))
dp=[[-1,-1] for i in range(len(N)+1)]
dp[0]=[0,1]
b=0
N.insert(0,0)
for i in range(1,len(N)):
up = 10-N[i]
dp[i][0]=min(dp[i-1][0]+N[i],dp[i-1][1]+up)
dp[i][1] = min(dp[i-1][0]+N[i]+1, dp[i-1][1]+up-1)
print(dp[-1][0])
| 1 | 71,242,142,189,660 | null | 219 | 219 |
def digits(n):
if n < 10: return 1
c = 0
while n > 0:
c += 1
n = n // 10
return c
while 1:
try:
inp = input()
except EOFError:
break
else:
n, m = inp.split(' ')
n = int(n)
m = int(m)
print(digits(n + m)) | n = int(input())
a = list(map(int, input().split()))
count = 1
for i in a:
if i == count:
count += 1
if count == 1:
print(-1)
else:
print(n - count + 1) | 0 | null | 57,530,370,179,788 | 3 | 257 |
n=int(input())
a=[0]*10001
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<10001:
a[v]+=1
for m in range(n):
print(a[m+1]) | import collections
import sys
A = []
n = int(input())
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
A.append(i**2+j**2+k**2+i*j+j*k+k*i)
c = collections.Counter(A)
for x in range(1,n+1):
print(c[x])
sys.exit()
| 1 | 7,969,124,503,080 | null | 106 | 106 |
data = list(map(int, list(input().split())))
row = data[0]
column = data[1]
matrix = [[0 for i in range(column)] for j in range(row)]
vector = [[0] for k in range(column)]
vector_multi = [[0] for l in range(row)]
for i in range(row):
data_row = list(map(int, list(input().split())))
for j in range(column):
matrix[i][j] = data_row[j]
for i in range(column):
vector[i] = int(input())
for i in range(row):
element = 0
for j in range(column):
element += matrix[i][j] * vector[j]
vector_multi[i][0] = element
for i in vector_multi:
print(i[0])
|
import copy
import sys
# 再帰上限を引き上げる
sys.setrecursionlimit(10**6)
def dfs(graph, v, d):
seen[v] = True # 訪問済みかどうか
dist[v] = d # 距離を記録
# 頂点vから行ける頂点を全探索
for i in graph[v]:
if seen[i]:
continue
dfs(graph, i, d+1)
# ここから本文
N, u, v = map(int, input().split())
u -= 1
v -= 1
# グラフ構造を作る
graph = [[] for i in range(N)]
for i in range(N - 1):
A, B = map(int, input().split())
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
# 青木くんからの各頂点の距離
seen = [False for i in range(N)]
dist = [0 for i in range(N)]
dfs(graph, v, 0)
aoki_dist = copy.deepcopy(dist)
# 高橋くんからの各頂点の距離
seen = [False for i in range(N)]
dist = [0 for i in range(N)]
dfs(graph, u, 0)
takahashi_dist = copy.deepcopy(dist)
ans = 0
for i in range(N):
if aoki_dist[i] > takahashi_dist[i]:
if aoki_dist[i] - 1 > ans:
ans = aoki_dist[i] - 1
print(ans) | 0 | null | 59,056,438,114,900 | 56 | 259 |
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
s=input()
len_s=len(s)
T=[0]*(len_s+1)
T[-1],T[-2]=0,int(s[-1])
mod=2019
for i in range(len_s-2,-1,-1):
T[i]=(T[i+1]+int(s[i])*pow(10,len_s-i-1,mod))%mod
tc=list(Counter(T).values())
ans=0
for tcc in tc:
ans+=tcc*(tcc-1)//2
print(ans)
if __name__=='__main__':
main() | a,b = input().split()
#print(a,b)
A = int(a)
x,y = b.split('.')
B = int(x)*100+int(y)
print(int(A*B)//100) | 0 | null | 23,683,689,181,362 | 166 | 135 |
ri = lambda S: [int(v) for v in S.split()]
N, M = ri(input())
c = 0
c += (M * (M-1)) / 2
c += (N * (N-1)) / 2
print(int(c)) | import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n, m = inm()
print(n*(n-1) // 2 + m*(m-1) // 2) | 1 | 45,629,019,756,672 | null | 189 | 189 |
n = int( raw_input( ) )
dic = {}
output = []
for i in range( n ):
cmd, word = raw_input( ).split( " " )
if "insert" == cmd:
dic[ word ] = True
elif "find" == cmd:
if not dic.get( word ):
output.append( "no" )
else:
output.append( "yes" )
print( "\n".join( output ) ) | import sys
def h1(key):
return key % M
def h2(key):
return 1 + key % (M - 1)
def H(key, i):
return (h1(key) + i * h2(key)) % M
def my_insert(dic, key):
i = 0
while 1:
j = H(key, i)
if dic[j] is None:
dic[j] = key
return j
else:
i += 1
def my_search(dic, key):
i = 0
while 1:
j = H(key, i)
if dic[j] == key:
return True
elif dic[j] is None or i >= M:
return False
else:
i += 1
def str2int(s):
res = s
res = res.replace("A", "1")
res = res.replace("C", "2")
res = res.replace("G", "3")
res = res.replace("T", "4")
return int(res)
M = 1000003
dic = [None] * M
n = int(sys.stdin.readline())
for k in range(n):
cmd, s = sys.stdin.readline().split()
if cmd == "insert":
my_insert(dic, str2int(s))
else:
print("yes" if my_search(dic, str2int(s)) else "no") | 1 | 77,671,860,320 | null | 23 | 23 |
while True:
h, w = map(int, raw_input().split())
if (h == 0) & (w == 0):
break
line0 = ""
line1 = "."
for i in range(w):
if i % 2 == 0:
line0 += "#"
else:
line0 += "."
line1 += line0[:-1]
for j in range(h):
if j % 2 == 0:
print line0
else:
print line1
print "" | heights=[]
for i in range(0,10):
heights.append(input())
heights.sort()
heights.reverse()
for i in range(0,3):
print heights[i] | 0 | null | 432,430,264,640 | 51 | 2 |
n, m = map(int, input().split())
sugoroku = input()[::-1]
cnt = 0
pos = 0
tmp = 0
lst = []
while pos != n:
pos += 1
cnt += 1
if cnt == m:
if sugoroku[pos] == "0":
lst.append(cnt)
cnt = 0
else:
if tmp == 0:
print(-1)
exit()
lst.append(tmp)
cnt -= tmp
tmp = 0
else:
if sugoroku[pos] == "0":
tmp = cnt
if cnt != 0:
lst.append(cnt)
for num in lst[::-1]:
print(num, end = " ")
| N = int(input()) #入力する整数
A = list(map(int,input().split())) #入力する数列A
SUMA = sum(A) #数列の和
MOD = 10**9 + 7 # mod
C = [0] * (N-1) #累積和数列
for i in range(N-1): #\sum_{j = i+1}^{N}を求めて数列に代入する
SUMA -= A[i]
C[i] = SUMA
ans = 0 #求める答え
for i in range(N-1):
ans += A[i]*C[i]
ans %= MOD #その都度modで割った余りにする
print(ans) #答えを出力する | 0 | null | 71,222,313,027,868 | 274 | 83 |
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
X, Y, Z = MI()
A = [Z, X, Y]
print(' '.join(map(str, A)))
if __name__ == "__main__":
main() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
class SWAG(object):
def __init__(self,dot):
self.__front=[]; self.__back=[]; self.__dot=dot
def __bool__(self):
return bool(self.__front or self.__back)
def __len__(self):
return len(self.__front)+len(self.__back)
def append(self,x):
back=self.__back
if(not back): back.append((x,x))
else: back.append((x,self.__dot(back[-1][1],x)))
def popleft(self):
assert(self)
front=self.__front; back=self.__back
if(not front):
front.append((back[-1][0],back[-1][0]))
back.pop()
while(back):
front.append((back[-1][0],self.__dot(back[-1][0],front[-1][1])))
back.pop()
return front.pop()[0]
def sum(self):
assert(self)
front=self.__front; back=self.__back
if(not front): return back[-1][1]
elif(not back): return front[-1][1]
else: return self.__dot(front[-1][1],back[-1][1])
def resolve():
n,m=map(int,input().split())
S=list(map(int,input()))
dp=[INF]*(n+1) # dp[i] : i から何手でゴールできるか
dp[-1]=0
swag=SWAG(min)
for i in range(n-1,-1,-1):
swag.append(dp[i+1])
if(len(swag)>m): swag.popleft()
if(S[i]==1): continue
dp[i]=swag.sum()+1
if(dp[0]==INF):
print(-1)
return
ans=[]
now=0
turn=dp[0]
for i in range(1,n+1):
if(dp[i]==INF): continue
if(turn>dp[i]):
ans.append(i-now)
now=i
turn=dp[i]
print(*ans)
resolve() | 0 | null | 88,722,969,553,280 | 178 | 274 |
# -*- coding: utf-8 -*-
from sys import stdin
class Dice:
def __init__(self,dicelist):
self.dice_list = dicelist
def roll(self, direction):
work = list(self.dice_list)
if (direction == 'N'):
self.dice_list[0] = work[1]
self.dice_list[1] = work[5]
self.dice_list[2] = work[2]
self.dice_list[3] = work[3]
self.dice_list[4] = work[0]
self.dice_list[5] = work[4]
elif (direction == 'E'):
self.dice_list[0] = work[3]
self.dice_list[1] = work[1]
self.dice_list[2] = work[0]
self.dice_list[3] = work[5]
self.dice_list[4] = work[4]
self.dice_list[5] = work[2]
elif (direction == 'S'):
self.dice_list[0] = work[4]
self.dice_list[1] = work[0]
self.dice_list[2] = work[2]
self.dice_list[3] = work[3]
self.dice_list[4] = work[5]
self.dice_list[5] = work[1]
elif (direction == 'W'):
self.dice_list[0] = work[2]
self.dice_list[1] = work[1]
self.dice_list[2] = work[5]
self.dice_list[3] = work[0]
self.dice_list[4] = work[4]
self.dice_list[5] = work[3]
def getTop(self):
return self.dice_list[0]
dice_list = list(map(int, stdin.readline().rstrip().split()))
dice = Dice(dice_list)
rolls = stdin.readline().rstrip()
for roll in rolls:
dice.roll(roll)
else:
print(dice.getTop())
| import math
a,b,agree=map(float,input().split())
agree=math.radians(agree)
c=(a**2+b**2-2*a*b*math.cos(agree))**0.5
s=0.5*a*b*math.sin(agree)
l=a+b+c
h=b*math.sin(agree)
print("{0:.5f}".format(s))
print("{0:.5f}".format(l))
print("{0:.5f}".format(h))
| 0 | null | 202,530,439,542 | 33 | 30 |
while True:
try:
s = input()
a, b = [int(i) for i in s.split()]
print(len(str(a + b)))
except:
break
| import sys
def solve():
input = sys.stdin.readline
N = int(input())
S = input().strip("\n")
Left = [set() for _ in range(N)]
Right = [set() for _ in range(N)]
Left[0] |= {S[0]}
Right[N-1] |= {S[N-1]}
for i in range(1, N):
Left[i] = Left[i-1] | {S[i]}
Right[N-i-1] = Right[N-i] | {S[N-i-1]}
used = set()
for i in range(1, N - 1):
mid = S[i]
for l in Left[i-1]:
for r in Right[i+1]:
used |= {l + mid + r}
print(len(used))
return 0
if __name__ == "__main__":
solve() | 0 | null | 64,038,475,638,240 | 3 | 267 |
m,d = map(int,input().split())
m2,d2 = map(int,input().split())
print(1 if m != m2 else 0) | from collections import deque
N, D, A = map(int, input().split())
monsters = []
for _ in range(N):
monsters.append(list(map(int, input().split())))
monsters.sort()
d = deque()
ans = 0
damage = 0
for x, h in monsters:
while d:
if d[0][0] >= x - D:
break
_, power = d.popleft()
damage -= power
h -= damage
if h <= 0:
continue
attack = (h - 1) // A + 1
ans += attack
d.append((x + D, attack * A))
damage += attack * A
print(ans)
| 0 | null | 103,720,649,376,540 | 264 | 230 |
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10 ** 9)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
INF=float('inf')
N,M=MAP()
C=LIST()
dp=[INF]*(N+1)
dp[0]=0
for i in range(N):
for j in range(M):
if i+C[j]<=N:
dp[i+C[j]]=min(dp[i+C[j]], dp[i]+1)
print(dp[N])
| import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, M = map(int, readline().split())
C = list(map(int, readline().split()))
# dp[i] := i円払うのに必要な枚数
dp = [INF] * (N+1)
dp[0] = 0
for c in C:
if c<=N:
for i in range(N-c+1):
dp[i+c] = min(dp[i]+1, dp[i+c])
print(dp[N])
if __name__ == '__main__':
main()
| 1 | 142,895,850,158 | null | 28 | 28 |
def mips():
return map(int,input().split())
N,K = mips()
ans = 0
for i in range(K,N+1):
Max_K = (i * (2*N - (i-1)))//2
Min_K = (i * (2*0 + (i-1)))//2
ans += (Max_K-Min_K) + 1
ans %= (10**9 + 7)
print(ans+1) | n, k = map(int, input().split())
su = 0
for i in range(k, n+2):
co = (n+(n-i+1))*i/2 - (i-1)*i/2 + 1
su = (su + int(co)) % (10**9 + 7)
print(su) | 1 | 33,176,522,897,474 | null | 170 | 170 |
s=list(input())
l=len(s)
ans=0
if len(set(s))==1:
for i in range(1,l+1):
ans+=i
print(ans)
exit()
for i in range(l-1):
if s[i]=="<" and s[i+1]==">":
left=1
right=1
for j in range(i):
if s[i-j-1]=="<":
left+=1
else:
break
for j in range(l-i-2):
if s[i+j+2]==">":
right+=1
else:
break
p=max(left,right)
q=min(left,right)
for j in range(p):
ans+=(j+1)
for j in range(q-1):
ans+=(j+1)
if s[0]==">":
ans+=1
for i in range(1,l):
if s[i]==">":
ans+=(i+1)
else:
break
if s[-1]=="<":
ans+=1
for i in range(2,l+1):
if s[-i]=="<":
ans+=i
else:
break
print(ans) | s = input()
A = [0] * (len(s) + 1)
for i, c in enumerate(s):
if c == '<':
A[i+1] = A[i] + 1
for i, c in enumerate(s[::-1]):
if c == '>':
x = len(s) - i
A[x-1] = max(A[x-1], A[x] + 1)
print(sum(A)) | 1 | 156,603,048,388,992 | null | 285 | 285 |
l = input()
s = l[-1]
c = ''
if s == 's':
c = l + 'es'
else:
c = l + 's'
print(c) | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s = input()
if s[-1] != 's':
print(s+'s')
else:
print(s+'es')
if __name__=='__main__':
main() | 1 | 2,382,369,514,620 | null | 71 | 71 |
import sys
input = sys.stdin.readline
import bisect
import collections
from collections import deque
n,d,a= map(int, input().split())
x= [list(map(int, input().split())) for i in range(n)]
x.sort()
y=[]
for i in range(n):
y.append(x[i][0])
x[i][1]=-(-x[i][1]//a)
# どのモンスターまで倒したか管理しながら進める。
# 累積ダメージを管理
qq=deque([])
ans=0
atk=0
for i in range(n):
w=x[i][1]
# iがダメージの有効期限を超過している場合
while len(qq)>0 and i > qq[0][0]:
atk-=qq[0][1]
qq.popleft()
if w-atk>0:
ans+=w-atk
q=bisect.bisect_right(y,x[i][0]+2*d)-1
# 有効期限 ダメージ
qq.append([q,w-atk])
atk += w - atk
print(ans) | from bisect import bisect
n,d,a=map(int,input().split())
monster=[list(map(int,input().split())) for i in range(n)]
monster.sort(key=lambda i:i[0])
r=[monster[i][0] for i in range(n)]
hp=[monster[i][1] for i in range(n)]
#print(r,hp)
d=2*d
i,ans,damages=0,0,[0]*n
while i<n:
if i>0:
damages[i]+=damages[i-1]
s=hp[i]+damages[i]
else:
s=hp[i]
if s>0:
cnt=(s+a-1)//a
ans+=cnt
#print(ans)
damage=cnt*a
damages[i]-=damage
zone=bisect(r,r[i]+d)
if zone<n:
damages[zone]+=damage
i+=1
#print(damages)
#print(hp)
print(ans)
| 1 | 82,313,231,446,508 | null | 230 | 230 |
combined = input().split(" ")
s = int(combined[0])
w = int(combined[1])
if w >= s:
print("unsafe")
else:
print("safe")
| N, A, B = map(int, input().split())
ans = 0
if abs(B-A) % 2 == 0:
ans = abs(B-A) // 2
else:
if B > A:
ans = min(N-A, B-1,(N-B+1) + (B-A-1)//2, (A-1+1) + (B-A-1)//2)
if A > B:
ans = min(N-B, A-1,(N-A+1) + (A-B-1)//2, (B-1+1) + (A-B-1)//2)
print(ans) | 0 | null | 69,596,793,259,880 | 163 | 253 |
s = list(input())
ans = 0
halfidx = int((len(s)/2))
ary = s[0:halfidx]
rary = list(reversed(s))[0:halfidx]
for i in range(0,halfidx):
if (ary[i] != rary[i]):
ans = ans + 1
print(ans) | from sys import stdin, stdout # only need for big input
def solve():
s = input()
left = 0
right = len(s) - 1
count = 0
while left < right:
count += (s[left] != s[right])
left += 1
right -= 1
print(count)
def main():
solve()
if __name__ == "__main__":
main() | 1 | 120,435,768,447,328 | null | 261 | 261 |
import numpy as np
A=[]
for i in range(3):
A.append(list(map(int,input().split())))
A=np.array(A)
n=int(input())
for i in range(n):
b=int(input())
if b in A:
A=np.where(A==b,0,A)
cross=0
if A[0][0]+A[1][1]+A[2][2]==0 or A[2][0]+A[1][1]+A[0][2]==0:
cross=1
print("NYoe s"[0 in np.sum(A,axis=0) or 0 in np.sum(A,axis=1) or cross ::2]) | α=input()
if α.isupper():
print('A')
elif α.islower():
print('a') | 0 | null | 35,688,277,658,110 | 207 | 119 |
while True:
chk_list = input()
if chk_list == "-":
break
num = int(input())
for i in range(num):
n = int(input())
chk_list = chk_list[n:] + chk_list[0:n]
print(chk_list)
| while True:
n = input();
if n == '-':
break;
m = int(input());
N = list(n);
for i in range(0,m):
h = int(input());
for j in range(0,h):
x = [];
x.append(N[0]);
N.pop(0);
N.append(x[0]);
print(''.join(N));
| 1 | 1,946,485,096,960 | null | 66 | 66 |
n, m = list(map(int, input().split()))
print(int((n * (n-1) + m * (m-1)) / 2)) | N,M = (int(a) for a in input().split())
x = N*(N-1)/2
y = M*(M-1)/2
print(int(x+y)) | 1 | 45,554,199,284,776 | null | 189 | 189 |
def main():
inf = 1<<29
n,m = map(int,input().split())
coins = list(map(int,input().split()))
dp = [inf]*(n+1)
dp[0] = 0
for i in range(1,n+1):
for j in range(m):
if i-coins[j]<0:continue
dp[i] = min(dp[i],dp[i-coins[j]]+1)
print (dp[n])
if __name__ == '__main__':
main()
| from collections import defaultdict
from math import gcd as g
n = int(input())
mod = 10**9+7
sardines = set()
Ddic = defaultdict(int)
ans = 1
zcount = 0
for i in range(n):
a,b = map(int,input().split())
if a == 0 and b == 0:
zcount += 1
continue
if a == 0:
Ddic[(0,1)] += 1
sardines.add((0,1))
continue
if b == 0:
sardines.add((1,0))
Ddic[(1,0)] += 1
continue
A,B = abs(a),abs(b)
G = g(A,B)
a //= G
b //= G
if b < 0:
a = -a
b = -b
Ddic[(a,b)] += 1
sardines.add((a,b))
for i in sardines:
if i == (0,0) or (i[0] <= 0 and Ddic[(i[1],-i[0])] != 0):continue
if i[0] <= 0:
ans *= (2**Ddic[i] + 2**(Ddic[(i[1],-i[0])]))-1
else:
ans *= (2**Ddic[i] + 2**(Ddic[(-i[1],i[0])]))-1
ans %= mod
print((ans+zcount-1)%mod)
| 0 | null | 10,519,738,739,620 | 28 | 146 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
X = I()
for i in range(X,1000000):
for j in range(2,int(i**.5)+1):
if i % j == 0:
break
else:
print(i)
break
| s=list(input())
ans=0
for i in range(len(s)//2):
if s[i]==s[len(s)-1-i]:
continue
ans+=1
print(ans) | 0 | null | 112,684,952,809,260 | 250 | 261 |
#https://tjkendev.github.io/procon-library/python/range_query/rmq_segment_tree.html
# N: 処理する区間の長さ
#bit管理
#演算はor
N = int(input())
s = input()
N0 = 1
while N0<=N:
N0*=2
INF = 0
data = [0]*(2*N0)
# a_k の値を x に更新
def update(k, x):
k += N0-1
data[k] = 1<<x
while k >= 0:
k = (k - 1) // 2
data[k] =data[2*k+1]|data[2*k+2]
# 区間[l, r)の最小値
def query(l, r):
L = l + N0; R = r + N0
s = INF
while L < R:
if R & 1:
R -= 1
s = s|data[R-1]
if L & 1:
s = s|data[L-1]
L += 1
L >>= 1; R >>= 1
return s
for i in range(N):
update(i,ord(s[i])-ord("a"))
q = int(input())
for j in range(q):
t,l,r = input().split( )
if t=="1":
update(int(l)-1,ord(r)-ord("a"))
else:
bit = bin(query(int(l)-1,int(r)))[2:]
ans = 0
for i in bit:
ans += int(i)
print(ans) | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
h, w = na()
m = []
m = [ns() for _ in range(h)]
dp = [[inf] * w for _ in range(h)]
dp[0][0] = int(m[0][0] == '#')
for x in range(1, w):
dp[0][x] = dp[0][x-1] + (int(m[0][x]=="#") if m[0][x-1]=="." else 0)
for y in range(1, h):
dp[y][0] = dp[y-1][0] + (int(m[y][0]=="#") if m[y-1][0]=="." else 0)
for x in range(1, w):
dp[y][x] = min(
dp[y][x-1] + (int(m[y][x]=="#") if m[y][x-1]=="." else 0),
dp[y-1][x] + (int(m[y][x]=="#") if m[y-1][x]=="." else 0)
)
print(dp[-1][-1]) | 0 | null | 55,917,140,277,998 | 210 | 194 |
K=int(input());S=""
for i in range(K):
S=S+"ACL"
print(S) | K=int(input())
ans=[]
for i in range(K):
ans.extend("ACL")
print("".join(ans)) | 1 | 2,197,062,772,828 | null | 69 | 69 |
def study_time(h1, m1, h2, m2, k):
result = (h2 - h1) * 60 + m2 - m1 - k
return result
h1, m1, h2, m2, k = tuple(map(int, input().split()))
if __name__ == '__main__':
print(study_time(h1, m1, h2, m2, k)) | H1, M1, H2, M2, K = map(int, input().split())
s = 60 * H1 + M1
e = 60 * H2 + M2
ans = max(0, e - s - K)
print(ans)
| 1 | 18,051,563,716,088 | null | 139 | 139 |
import math
def merge(a,l,m,r):
global cnt
L = a[l:m]+[math.inf]
R = a[m:r]+[math.inf]
i = 0
j = 0
for k in range(l,r):
cnt+=1
if L[i]<=R[j]:
a[k] = L[i]
i+=1
else:
a[k]=R[j]
j+=1
def mergeSort(a,l,r):
if l+1<r:
m = (l+r)//2
mergeSort(a,l,m)
mergeSort(a,m,r)
merge(a,l,m,r)
n = int(input())
a = list(map(int, input().split()))
cnt = 0
mergeSort(a,0,n)
print(*a)
print(cnt)
| N, A, B = list(map(int, input().split()))
try:
blue_num = A * (N // (A + B))
residue = N - ((A + B) * (N // (A + B)))
if(residue > A):
blue_num += A
else:
blue_num += residue
except ZeroDivisionError:
blue_num = 0
print(blue_num) | 0 | null | 28,073,352,414,112 | 26 | 202 |
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") | li = [list(map(int, input().split())) for i in range(2)]
if li[0][0] != li[1][0] :
print(1)
else :
print(0)
| 0 | null | 88,890,147,951,260 | 199 | 264 |
n=input().split()
a=int(n[0])
b=int(n[1])
if a>=2*b:
print(a-2*b)
else:
print("0") | n = int(input())
s = [input() for _ in range(n)]
print(len(list(set(s)))) | 0 | null | 98,071,487,538,092 | 291 | 165 |
a,b,c= (int(x) for x in input().split())
A = int(a)
B = int(b)
C = int(c)
if A+B+C >= 22:
print("bust")
else:
print("win") | H,A = map(int,input().split())
b = H // A
c = H % A
if c != 0:
b += 1
print(b) | 0 | null | 97,787,472,211,090 | 260 | 225 |
X = int(input())
i = 1
while (360*i) % X != 0:
i += 1
ans = 360*i//X
print(ans)
| while True:
H, W = [int(i) for i in input().split()]
if H == W == 0:
break
for h in range(H):
for w in range(W):
if (w + h) % 2 == 0 :
print('#', end='')
else:
print('.', end='')
print()
print() | 0 | null | 7,000,896,428,150 | 125 | 51 |
N = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i**2 + j**2 + k**2 + i*j + j*k + k*i
if v<10050:
ans[v] += 1
for i in range(N):
print(ans[i+1]) | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
A = list(map(lambda n: int(n)-1, input().split()))
visited = [False] * N
visited[0] = True
index = 0
visited_index = [0]
while K:
index = A[index]
if visited[index]:
K -= 1
start = visited_index.index(index)
loop_index = visited_index[start:]
print(loop_index[K % len(loop_index)] + 1)
sys.exit()
visited_index.append(index)
visited[index] = True
K -= 1
print(index + 1)
main() | 0 | null | 15,264,290,080,132 | 106 | 150 |
c = input()
c = chr(ord(c)+1)
print(c) | import heapq
X, Y, A, B, C = map(int, input().split())
apples = []
for x in input().split():
apples.append((int(x), 'r'))
for x in input().split():
apples.append((int(x), 'g'))
for x in input().split():
apples.append((int(x), 'n'))
apples.sort()
apples.reverse()
r_count = 0
g_count = 0
n_count = 0
yummy = 0
for _ in range(A+B+C):
apple = apples[_]
if apple[1] == 'g' and not g_count == Y:
g_count += 1
yummy += apple[0]
elif apple[1] == 'r' and not r_count == X:
r_count += 1
yummy += apple[0]
elif apple[1] == 'n':
n_count += 1
yummy += apple[0]
if g_count + r_count + n_count == X+Y:
break
print(yummy)
| 0 | null | 68,665,543,321,092 | 239 | 188 |
S = list(input())
A = [0]*(len(S)+1)
node_value = 0
for i in range(len(S)):
if S[i] == "<":
node_value += 1
A[i+1] = node_value
else:
node_value = 0
node_value = 0
for i in range(len(S)-1,-1,-1):
if S[i] == ">":
node_value += 1
A[i] = max(A[i], node_value)
else:
node_value = 0
print(sum(A)) | S=input()
A=[0]*(len(S)+1)
for i in range(len(S)):
if S[i]=='<':
A[i+1]=max(A[i+1],A[i]+1)
for i in range(len(S)-1,-1,-1):
if S[i]=='>':
A[i]=max(A[i],A[i+1]+1)
print(sum(A))
| 1 | 156,163,407,255,890 | null | 285 | 285 |
import sys
input = sys.stdin.readline
n = int(input())
plus = []
minus = []
for _ in range(n):
min_s = 0
ts = 0
s = input().strip()
for c in s:
ts += 1 if c == '(' else -1
min_s = min(ts, min_s)
if ts >= 0:
plus.append((-min_s, ts))
else:
minus.append((-(min_s - ts), -ts))
plus.sort()
minus.sort()
s1 = 0
for m, t in plus:
if s1 - m < 0:
print('No')
exit()
s1 += t
s2 = 0
for m, t in minus:
if s2 - m < 0:
print('No')
exit()
s2 += t
if s1 == s2:
print('Yes')
else:
print('No')
| n = int(input())
h_list = list(map(int,input().split()))
a_dict = dict()
b_dict = dict()
for i in range(n):
a = h_list[i]+i
b = i-h_list[i]
if not a in a_dict:
a_dict[a] = 1
else:
a_dict[a] += 1
if not b in b_dict:
b_dict[b] = 1
else:
b_dict[b] += 1
count = 0
for a in a_dict:
if a in b_dict:
count += a_dict[a]*b_dict[a]
print(count)
| 0 | null | 24,930,762,613,822 | 152 | 157 |
n,a,b = map(int, input().split())
blue = a*(n//(a+b))
if n%(a+b) <= a:
blue += n%(a+b)
else:
blue += a
print(blue) | n,A,B=map(int,input().split())
z=A+B
if n%z<=A:
print(int(n/z)*A+n%z)
elif A<=n%z<=z:
print(int(n/z)*A+A) | 1 | 55,438,185,045,360 | null | 202 | 202 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
if N % 2 == 1:
i = N // 2
AB.sort()
L = AB[i][0]
AB.sort(key=lambda x: x[1])
R = AB[i][1]
ans = R - L + 1
else:
i = N // 2 - 1
j = i + 1
AB.sort()
L = AB[i][0] + AB[j][0]
AB.sort(key=lambda x: x[1])
R = AB[i][1] + AB[j][1]
ans = R - L + 1
print(ans) |
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 0:
l = A[N // 2 - 1] + A[N // 2]
u = B[N // 2 - 1] + B[N // 2]
print(u - l + 1)
else:
l = A[N // 2]
u = B[N // 2]
print(u - l + 1)
| 1 | 17,391,008,624,208 | null | 137 | 137 |
s = input()
s = s.replace('hi', "")
if len(s) > 0:
print('No')
else:
print('Yes') | a = input()
hi_cnt = a.count('hi')
if hi_cnt > 0:
if hi_cnt * 2 == len(a):
print('Yes')
else:
print('No')
else:
print('No') | 1 | 53,151,769,847,668 | null | 199 | 199 |
a, b = map(str, input().split())
c, d = map(int, input().split())
e = str(input())
if e==a:
print(c-1, d)
elif e==b:
print(c, d-1)
| S,T=input().split()
A,B=map(int,input().split())
U=input()
if S==U:
print('{} {}'.format(A-1,B))
else:
print('{} {}'.format(A,B-1)) | 1 | 71,848,402,560,968 | null | 220 | 220 |
import math
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
maxA = A[len(A)-1]
valid = [True] * (maxA+1)
for i in range(len(A)):
if valid[A[i]] == False:
continue
if i != 0 and A[i-1] == A[i]:
valid[A[i]] = False
else:
for j in range(A[i]*2, maxA+1, A[i]):
valid[j] = False
count = 0
for i in range(len(A)):
if valid[A[i]] == True:
count += 1
print(count)
| from collections import Counter
n, *A = map(int, open(0).read().split())
A.sort()
c, s = Counter(A), set()
M = max(A) + 1
ans = 0
for a in A:
if a in s:
continue
ans += c[a] == 1
for i in range(a, M, a):
s.add(i)
print(ans) | 1 | 14,327,888,831,740 | null | 129 | 129 |
n,m = map(int,input().split())
a = 0
for i in range(m):
if n % 2 == 0 and n % 4 != 0 and n-4*i-2 == 0:
a = 1
elif n % 4 == 0 and i == (n//2-1) // 2 + 1:
a = 1
print('{} {}'.format(i+1, n-i-a)) | from math import ceil
n, m = (int(x) for x in input().split())
if n % 2 == 1:
for i in range(1, m + 1):
print(i, n - i)
else:
k = (n - 2) // 2
l = ceil(k / 2)
ANS = []
for i in range(1, l+1):
ANS.append((i, n - i + 1))
for i in range(l+2, k+2):
ANS.append((i, n - i + 2))
for a, b in ANS[:m]:
print(a, b) | 1 | 28,820,223,515,958 | null | 162 | 162 |
s = input()
l = len(s)
ss = ""
for x in range(l):
ss = ss+'x'
print(ss) | N = int(input())
S = list(''.join(input()))
t = 1
for i in range(N-1):
if S[i]!=S[i+1]:
t += 1
print(t) | 0 | null | 121,156,893,248,170 | 221 | 293 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n,k = LI()
p = LI()
for i,x in enumerate(p):
if x%2 == 0:
x = x//2+0.5
else:
x = x//2+1
p[i] = x
nowsum = sum(p[:k])
ans = nowsum
for i in range(k,n):
nowsum = nowsum - p[i-k] + p[i]
# print(p,lst)
ans = max(ans,nowsum)
print(ans)
main()
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, k = map(int, readline().split())
p = list(map(int, readline().split()))
tmp = [(i+1)/2 for i in p]
cs = list(np.cumsum(tmp))
if n == k:
print(cs[-1])
exit()
ans = 0
for i in range(n - k):
ans = max(ans, cs[i + k] - cs[i])
print(ans) | 1 | 74,952,582,511,858 | null | 223 | 223 |
N, X, Y = map(int, input().split())
ans = [0]*(N-1)
def cal_dis(i, j):
return min(j-i, abs(i-X)+abs(j-Y)+1)
for i in range(1, N+1):
for j in range(i+1, N+1):
k = cal_dis(i, j)
ans[k-1] += 1
print('\n'.join(map(str, ans)))
| def main():
from collections import deque
import sys
input = sys.stdin.readline
N,M = map(int,input().split())
to = [[] for _ in range(N)]
for _ in range(M):
a,b = map(int,input().split())
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
# print(to)
guide = [0] * N
guide[0] = 1
q = deque()
q.append(0)
while len(q) > 0:
u = q.popleft()
for v in to[u]:
# print(guide)
if guide[v] != 0:
continue
guide[v] = u+1
q.append(v)
print("Yes")
for g in guide[1:]:
print(g)
if __name__ == '__main__':
main()
| 0 | null | 32,409,726,630,808 | 187 | 145 |
input = input()
W,H,x,y,r = map(int ,input.split())
if x - r < 0 or x + r > W or y - r < 0 or y + r > H:
print("No")
if x - r >= 0 and x + r <= W and y - r >= 0 and y + r <= H:
print("Yes")
| a = input()
b = a.split(' ')
W = int(b[0])
H = int(b[1])
x = int(b[2])
y = int(b[3])
r = int(b[4])
if -100 <= x < 0:
print('No')
elif -100 <= y < 0:
print('No')
elif W >= x + r and H >= y + r:
print('Yes')
else:
print('No') | 1 | 449,848,238,762 | null | 41 | 41 |
station = input()
print("Yes" if "AB" in station or "BA" in station else "No") | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=int(input())
edge=[[] for i in range(n+1)]
par=[0]*(n+1)#i番目の頂点とその親を結ぶ辺の色
par[1]=-1
col=[0]*(n-1)#i番目の辺の色
for i in range(n-1):
a,b=mp()
edge[a].append([a,b,i])
edge[b].append([b,a,i])
que=deque([edge[1]])
while len(que):
k=1
q=que.popleft()
for x,y,i in q:
if col[i]==0:
if k==par[x]:
k+=1
col[i]=k
par[y]=k
k+=1
que.append(edge[y])
print(max(col))
for i in range(n-1):
print(col[i])
| 0 | null | 95,353,011,765,634 | 201 | 272 |
x,k,d=map(int,input().split())
x=abs(x)
if k>=round(x/d):
if (k-round(x/d))%2==0:
print(abs(x-d*round(x/d)))
else:
print(d-abs(x-d*round(x/d)))
else:
print(x-d*k) | import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def f(N):
res = 0
while N != 0:
b = format(N, "b").count("1")
N %= b
res += 1
return res
def main():
N = int(input())
X = input().strip()
K = X.count("1")
A = [(1, 1)]
for i in range(N):
a, b = A[-1]
A.append(((a * 2) % (K - 1) if K != 1 else 0, (b * 2) % (K + 1)))
B = [0, 0]
for i, b in enumerate(X[::-1]):
if b == "0":
continue
if K != 1:
B[0] += A[i][0]
B[0] %= K - 1
B[1] += A[i][1]
B[1] %= K + 1
res = [0] * N
for i, b in enumerate(X[::-1]):
if b == "0":
res[i] = (B[1] + A[i][1]) % (K + 1)
else:
if K == 1:
res[i] = 0
continue
res[i] = (B[0] - A[i][0]) % (K - 1)
res[i] = f(res[i]) + 1
for r in res[::-1]:
print(r)
if __name__ == "__main__":
main()
| 0 | null | 6,708,354,876,512 | 92 | 107 |
from collections import deque
def main():
N=int(input())
for n in range(N):
x=ans.popleft()
if x%10!=0:
ans.append(10*x+(x%10)-1) # x equal y-1
ans.append(10*x+(x%10)) # x equal y
if x%10!=9:
ans.append(10*x+(x%10)+1) # x equal y+1
print(x)
if __name__=='__main__':
ans=deque([1,2,3,4,5,6,7,8,9])
main()
| def resolve():
K = int(input())
lunluns = [1, 2, 3, 4, 5, 6, 7, 8, 9]
count = 9
pointer = 0
while K > count:
lunnum = lunluns[pointer]
lunlast = int(str(lunnum)[-1])
if lunlast == 0:
for i in [0, 1]:
lunluns.append(int(str(lunnum)+str(lunlast+i)))
count += 1
elif lunlast == 9:
for i in [-1, 0]:
lunluns.append(int(str(lunnum)+str(lunlast+i)))
count += 1
else:
for i in [-1, 0, 1]:
lunluns.append(int(str(lunnum)+str(lunlast+i)))
count += 1
pointer += 1
print(lunluns[K-1])
if '__main__' == __name__:
resolve() | 1 | 39,957,637,458,898 | null | 181 | 181 |
def check_x(x: int) -> int:
return 1 if x == 0 else 0
if __name__=='__main__':
print(check_x(int(input()))) | n=int(input())
print(1-n) | 1 | 2,970,114,758,922 | null | 76 | 76 |
###2分探索
import sys
N,K = map(int,input().split())
A = list(map(int,input().split()))
p = 0###無理（そこまで小さくできない）
q = max(A)###可能
if K == 0:
print(q)
sys.exit(0)
while q-p > 1:
r = (p+q)//2
count = 0
for i in range(N):
if A[i]/r == A[i]//r:
count += A[i]//r - 1
else:
count += A[i]//r
if count > K:
p = r
else:
q = r
#print(p,q)
print(q) | import copy
def main():
h, o = map(int, input().split(' '))
if h <= o:
print('unsafe')
else:
print('safe')
main() | 0 | null | 17,968,381,619,530 | 99 | 163 |
n, k = map(int, input().split())
mo = 10 ** 9 + 7
ans = 0
def calc(t):
u = (0 + t - 1) * t // 2
v = (n + n - t + 1) * t // 2
return v - u + 1
for i in range(k, n + 2):
ans = (ans + calc(i)) % mo
print(ans) | import bisect
N = int(input())
L = sorted(map(int, input().split(' ')))
ans = 0
for i in range(len(L)):
for j in range(i + 1, len(L)):
a = L[i]
b = L[j]
ans += max(0, bisect.bisect_right(L, a + b - 1) - (j + 1))
print(ans)
| 0 | null | 102,364,914,387,798 | 170 | 294 |
from copy import deepcopy
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
mod = 10 ** 9 + 7
ans = 1
i, j = 0, n - 1
k2 = deepcopy(k)
while k2 > 1:
if a[i] * a[i + 1] > a[j] * a[j - 1]:
ans *= a[i] * a[i + 1]
ans %= mod
i += 2
k2 -= 2
else:
ans *= a[j]
j -= 1
ans %= mod
k2 -= 1
if k2 == 1:
ans *= a[j]
ans %= mod
if a[-1] < 0 and k % 2:
ans = 1
for i in range(n - k, n):
ans *= a[i]
ans %= mod
print(ans) | #coding: utf-8
p = [0,0]
n = int(input())
for i in range(n):
c1 = input().split(" ")
c2 = sorted(c1)
if c1[0] == c1[1]:
p[0] += 1
p[1] += 1
elif c1[0] == c2[0]:
p[1] += 3
else:
p[0] += 3
print(str(p[0]) + " " + str(p[1]))
| 0 | null | 5,744,616,980,518 | 112 | 67 |
S,T=input().split()
num1,num2=map(int,input().split())
throw=input()
if throw==S:
num1-=1
else:
num2-=1
print(num1,num2) | s, t = input().split()
a, b = map(int, input().split())
u = input()
bnum = {s: a, t: b}
bnum[u] -= 1
print('{} {}'.format(bnum[s], bnum[t]))
| 1 | 71,857,875,425,120 | null | 220 | 220 |
def judge():
if t > h:
point["t"] += 3
elif t < h:
point["h"] += 3
else:
point["t"] += 1; point["h"] += 1
n = int(input())
point = {"t": 0, "h": 0}
for i in range(n):
t, h = input().split()
judge()
print(point["t"], point["h"])
| n, k = map(int, input().split())
w = [int(input()) for _ in range(n)]
def check(p):
i = 0
for _ in range(k):
s = 0
while s + w[i] <= p:
s += w[i]
i += 1
if i == n:
return True
return False
ng, ok = 0, 10**9
while ok-ng > 1:
mid = (ng+ok)//2
if check(mid):
ok = mid
else:
ng = mid
print(ok)
| 0 | null | 1,038,688,274,300 | 67 | 24 |
t = input()
n = int(input())
for i in range(n):
orders = input().split()
order = orders[0]
a = int(orders[1])
b = int(orders[2])
if order == "replace":
word = orders[3]
t = t[:a] + word + t[b+1:]
if order == "print":
print(t[a:b+1])
if order == "reverse":
t = t[:a] + t[a:b+1][::-1]+ t[b+1:]
| s=input()
for i in range(int(input())):
sou_com=input().split()
if sou_com[0]=='print':
print(s[int(sou_com[1]):int(sou_com[2])+1])
elif sou_com[0]=='reverse':
s=s[:int(sou_com[1])]\
+s[int(sou_com[1]):int(sou_com[2])+1][::-1]\
+s[int(sou_com[2])+1:]
elif sou_com[0]=='replace':
s=s[:int(sou_com[1])]\
+sou_com[3]\
+s[int(sou_com[2])+1:] | 1 | 2,103,167,813,162 | null | 68 | 68 |
#!/usr/bin/env python3
def main():
N = int(input())
A = list(map(int, input().split()))
p = 10**9 + 7
digit_0 = [0] * 60
digit_1 = [0] * 60
for i in range(N):
for j in range(60):
if (A[i] >> j) & 1:
digit_1[j] += 1
else:
digit_0[j] += 1
ans = 0
for j in range(60):
ans += ((digit_0[j] * digit_1[j] % p) * pow(2,j,p) % p)
ans %= p
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7
# Aの中でd桁目が0,1であるものの個数を求める(p,qとする)
# 全部のd桁目についてループして、ans+=(2**d)*(p*q)
ans = 0
for d in range(60):
p,q = 0,0
for i in range(N):
if A[i]%2==0: p+=1
else: q+=1
A[i] //= 2
ans += ((2**d)*p*q)%MOD
ans %= MOD
print(ans)
main()
| 1 | 122,974,611,046,182 | null | 263 | 263 |
N = int(input())
A = N + N**2 + N**3
print(A) | a = int(input())
print("{}".format(a+a**2+a**3)) | 1 | 10,187,676,454,144 | null | 115 | 115 |
X, Y, a, b, c = map(int, input().split())
A = list(map(int, input().split())) # 赤色
B = list(map(int, input().split())) # 緑色
C = list(map(int, input().split())) # 無色, 赤色にも緑色にもなれる
A.sort(reverse=True)
B.sort(reverse=True)
# C.sort(reverse=True)
top_x_of_A = A[:X]
top_Y_of_B = B[:Y]
top_x_of_A.extend(top_Y_of_B)
C.extend(top_x_of_A)
C.sort(reverse=True)
print(sum(C[:X+Y]))
| x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
s = p[:x] + q[:y]
s.sort()
ans = sum(s)
for si, ri in zip(s, r):
if si < ri:
ans += ri - si
print(ans) | 1 | 45,126,460,817,510 | null | 188 | 188 |
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(K-1,N-1):
a=A[i-K+1]
b=A[i+1]
if(a<b):
print('Yes')
else:
print('No') | import sys
a=[map(int,i.split())for i in sys.stdin]
for i,j in a:
c,d=i,j
while d:
if c > d:c,d = d,c
d%=c
print(c,i//c*j) | 0 | null | 3,524,561,100,090 | 102 | 5 |
n = int(input())
l = [0 for i in range(n)]
r = [0 for i in range(n)]
dat = []
dat2 = []
st = -1
for i in range(n):
s = input()
for ch in s:
if ch == '(':
r[i] += 1
pass
else:
if r[i] > 0:
r[i] -= 1
else:
l[i] += 1
pass
# print(i, l[i], r[i])
if l[i] == 0:
if st == -1 or r[st] < r[i]:
st = i
if r[i] >= l[i]:
dat.append((l[i], i))
else:
dat2.append((r[i], i))
dat.sort()
dat2.sort(reverse=True)
if st == -1:
print("No")
exit()
now = r[st]
# print('now={}'.format(now))
for num, i in dat:
if i == st:
continue
if now < l[i]:
print("No")
exit()
now = now - l[i] + r[i]
for num, i in dat2:
# print('dat2', num, i)
if now < l[i]:
print("No")
exit()
now = now - l[i] + r[i]
if now == 0:
print("Yes")
else:
print("No") | import sys
input = sys.stdin.readline
def main():
n = int(input())
a = []
b = []
for i in range(n):
s = input()
c1, c2 = 0, 0
for i in range(len(s)):
if s[i] == "(":
c2 += 1
if s[i] == ")":
if c2:
c2 -= 1
else:
c1 += 1
if c1 >= c2:
b.append((c2, c1))
else:
a.append((c1, c2))
a.sort()
b.sort(reverse=True)
ans = False
sub = 0
for value in a:
k1, k2 = value[0], value[1]
if sub < k1:
ans = True
break
sub += k2-k1
for value in b:
k2, k1 = value[0], value[1]
if ans or sub < k1:
ans = True
break
sub += k2-k1
print("No" if ans or sub else "Yes")
if __name__ == "__main__":
main() | 1 | 23,860,999,529,600 | null | 152 | 152 |
N,X,Y = list(map(int,input().split()))
ans_dict={}
for n in range(1,N):
ans_dict[n]=0
for n1 in range(1,N+1):
for n2 in range(n1+1,N+1):
ans_1 = abs(n1-n2)
ans_2 = abs(n1-X)+abs(n2-Y)+1
ans_3 = abs(n2-X)+abs(n1-Y)+1
ans=min(ans_1,ans_2,ans_3)
ans_dict[ans]+=1
for k in ans_dict.keys():
print(ans_dict[k]) | n,x,y = map(int,input().split())
cnt_l = [0]*n
from collections import deque
# 幅優先探索
def bfs(start):
queue = deque()
queue.append(start)
step_counts = [-1]*(n+1)
step_counts[start] = 0
while(queue):
i = queue.popleft()
cnt = step_counts[i]
# 隣のグラフを取得
if(i==x):
nex_l = (i-1,y,i+1)
elif(i==y):
nex_l = (i-1,x,i+1)
else:
nex_l = (i-1,i+1)
cnt += 1
for j in nex_l:
# 端より先だと止める
if(j < 1 or n < j):
continue
# 訪問済みだと止める
if(step_counts[j]!=-1):
continue
queue.append(j)
step_counts[j] = cnt
cnt_l[cnt] += 1
for i in range(1,n+1):
bfs(i)
for i in range(1,n):
# (a,b),(b,a)のペアがあるため//2
print(cnt_l[i]//2)
| 1 | 44,293,413,722,710 | null | 187 | 187 |
S = input()
T = input()
if(S == T[0:-1] and len(S) + 1 == len(T)):
print("Yes")
else:
print("No") | # ????????°??¶???????????? s ???????????????????????????????¨????????????£?¶????????????????????????????????????§???????????? p ??????????????????????????????????????°??????
# ????????°??¶????????????s????¨??????\?????????????????????
s = list(input())
# ??????????±??????????p????¨??????\?????????????????????
p = list(input())
# ?????????s??????????????????????????????????????????s?????????s?????????
s = s + s
# print(s)
# ???????????????????????????????????????????????°
flag = 0
for i in range(len(s) // 2):
if s[i] == p[0]:
for j in range(len(p)):
if s[i + j] != p[j]:
break
if j == len(p) - 1:
flag = 1
if flag == 1:
print("Yes")
else:
print("No") | 0 | null | 11,577,716,900,200 | 147 | 64 |
# coding: utf-8
import sys
i = sys.stdin
for line in i:
a,b = map(int,line.split())
if a == 0 and b == 0: break
if a < b:
print(a,b)
else:
print(b,a) | while True:
xy_list = list(map(int, input().split()))
if xy_list[0] == xy_list[1] == 0:
break
print(*sorted(xy_list)) | 1 | 537,171,996,128 | null | 43 | 43 |
import itertools
N,X,Y = list(map(int , input().split()))
combi = list(itertools.combinations(range(1,N+1),2))
ansList = [0 for _ in range(N)]
for i,j in combi:
kyori = min(j-i, abs(j-Y) + abs(X-i) + 1)
ansList[kyori] += 1
# print(i,j,ansList)
for ans in ansList[1:]:
print(ans)
| from collections import Counter
def main():
n,x,y=map(int,input().split())
x,y=x-1,y-1
ans=[]
for i in range(n):
dp = [n]*n
dp[i] = 0
calcstep(i, dp)
dp[y] = min(dp[y], dp[x]+1)
dp[x] = min(dp[x], dp[y]+1)
calcstep(x, dp)
calcstep(y, dp)
#print(i, dp)
ans += dp
ans = Counter(ans)
for i in range(1,n):
print(ans[i]//2)
def calcstep(i, dp):
for j in range(i, len(dp)-1):
if dp[j+1] > dp[j]+1:
dp[j+1] = dp[j]+1
else:
break
for j in range(1,i+1)[::-1]:
if dp[j-1] > dp[j]+1:
dp[j-1] = dp[j]+1
else:
break
if __name__ == "__main__":
main() | 1 | 44,179,886,709,964 | null | 187 | 187 |
a, b, m = map(int, input().split())
a_p = list(map(int, input().split()))
b_p = list(map(int, input().split()))
min_price = min(a_p) + min(b_p)
for i in range(m):
x, y, c = map(int, input().split())
min_price = min(min_price, a_p[x-1] + b_p[y-1] - c)
print(min_price) | A, B, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x = []
y = []
c = []
for i in range(m):
xx, yy, cc = map(int, input().split())
x.append(xx)
y.append(yy)
c.append(cc)
ans = min(a) + min(b)
for i in range(m):
ans = min(ans,a[x[i]-1] + b[y[i]-1] - c[i])
print (ans) | 1 | 54,024,584,592,318 | null | 200 | 200 |
n = int(input())
x = input()
init_pop_cnt = x.count('1')
init_pop_cnt_less = init_pop_cnt - 1
init_pop_cnt_more = init_pop_cnt + 1
valid_l = init_pop_cnt_less != 0
# x's state after f
init_res_less = 0
init_res_more = 0
seed_more = 1
seed_less = 1
for i in range(1, n+1):
xp = x[-1 * i]
if xp == '1':
if valid_l:
init_res_less += seed_less % init_pop_cnt_less
init_res_more += seed_more % init_pop_cnt_more
if valid_l:
seed_less = (seed_less * 2) % init_pop_cnt_less
seed_more = (seed_more * 2) % init_pop_cnt_more
dif_less = [0] * (2 * 10**5 + 100)
dif_more = [0] * (2 * 10**5 + 100)
if valid_l:
dif_less[0] = 1 % init_pop_cnt_less
dif_more[0] = 1 % init_pop_cnt_more
for i in range(1, n+1):
if valid_l:
dif_less[i] = (dif_less[i-1] * 2) % init_pop_cnt_less
dif_more[i] = (dif_more[i-1] * 2) % init_pop_cnt_more
def get_pc(dec):
out = 0
while dec > 0:
if dec % 2 == 1:
out+=1
dec = dec // 2
return out
def f(dec):
pc = get_pc(dec)
return dec % pc
cnt = [0] * (2 * 10**5 + 200)
for i in range(1, 2 * 10**5 + 100):
c = 0
cur = i
while cur > 0:
c += 1
cur = f(cur)
cnt[i] = c
for i in range(n):
xi = x[i]
if xi == '1':
if valid_l:
lx = init_res_less
lx -= dif_less[n-i-1]
lx %= init_pop_cnt_less
print((cnt[lx] % init_pop_cnt_less) + 1)
else:
print(0)
else:
lx = init_res_more
lx += dif_more[n-i-1]
lx %= init_pop_cnt_more
print((cnt[lx] % init_pop_cnt_more) + 1)
| n = int(input())
x = input()
f = [-1] * (n+10)
f[0] = 0
for i in range(1, n+10):
# python bitcount で見つけたこれを参考に https://ameblo.jp/316228/entry-10518720149.html
f[i] = f[i % bin(i).count('1')] + 1
init_bitcount = x.count('1')
# Xを init_bitcount+1とinit_bitcount-1で割った余り
x_mod_01 = 0
for digit in x:
x_mod_01 *= 2
if digit == '1':
x_mod_01 += 1
x_mod_01 %= (init_bitcount+1)
if init_bitcount != 1:
x_mod_10 = 0
for digit in x:
x_mod_10 *= 2
if digit == '1':
x_mod_10 += 1
x_mod_10 %= (init_bitcount-1)
# print(x_mod_01, x_mod_10, init_bitcount)
power_mod_01 = [-1] * (n+10)
power_mod_01[0] = 1
for i in range(1, n+10):
power_mod_01[i] = power_mod_01[i-1] * 2 % (init_bitcount + 1)
if init_bitcount != 1:
power_mod_10 = [-1] * (n+10)
power_mod_10[0] = 1
for i in range(1, n+10):
power_mod_10[i] = power_mod_10[i-1] * 2 % (init_bitcount - 1)
for i in range(n):
if x[i] == '0':
# 0→1
first_residue = (x_mod_01 + power_mod_01[n - i - 1]) % (init_bitcount+1)
print(f[first_residue] + 1)
else:
if init_bitcount == 1:
# 立っているビットの数は0桁、つまりX_i = 0なのでf(X_i) = 0
print(0)
continue
# 1→0
first_residue = (x_mod_10 - power_mod_10[n - i - 1]) % (init_bitcount-1)
print(f[first_residue] + 1)
# https://twitter.com/kyopro_friends/status/1281949470100353024
# https://atcoder.jp/contests/aising2020/editorial 公式
# 1回の操作で桁数以下に落ちることに注意すると、操作の繰り返しで急速に値が小さくなり、少ない回数で0に到着する。
# したがってfの表を作るのは今回不要。愚直にやってもできるので。初回の高速化だけが必要。
| 1 | 8,164,458,303,628 | null | 107 | 107 |
x=int(input())
a=x//500
rem=x%500
b=rem//5
ans=a*1000+b*5
print(ans) | X = int(input())
happy = 0
happy += X // 500 * 1000
X = X % 500
happy += X //5 * 5
print(happy) | 1 | 42,812,690,830,240 | null | 185 | 185 |
n={i:0 for i in range(int(input()))}
for i in list(map(int,input().split())):
n[i-1]+=1
[print(i) for i in n.values()] | N=int(input())
A=list(map(int,input().split()))
n=[0 for x in range(N)]
for i in range(N-1):
n[A[i]-1]+=1
for j in range(N):
print(n[j]) | 1 | 32,552,054,422,080 | null | 169 | 169 |
import math
k=int(input())
if(k%2)==0:
print("-1")
else:
flag=0
for x in range(1,1000001):
if (7%(9*k)*(pow(10,x,k*9)-1)%(9*k))==0:
print(x)
flag=1
break
if flag==0:
print(-1)
| k = int(input())
s = 7
num = 1
res = True
if k == 2:
print(-1)
else:
for i in range(k):
s %= k
if s == 0:
res = False
print(num)
break
num += 1
s *= 10
s += 7
if res:
print(-1) | 1 | 6,127,131,771,380 | null | 97 | 97 |
import string
n = int(input())
alphabet = list(string.ascii_lowercase)
ans = ''
while n > 0:
ans = alphabet[(n-1) % 26] + ans
n = (n-1) // 26
print(ans)
| N=int(input())
ans=[]
while(1):
if N==0:
break
tmp=N%26
if tmp==0:
ans.append(26)
N=N//26-1
else:
N//=26
ans.append(tmp)
new_ans = list(reversed(ans))
ANS=""
for i in new_ans:
ANS+=chr(96+int(i))
print(ANS) | 1 | 11,951,235,251,176 | null | 121 | 121 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
a, b, m =[int(i) for i in input().split(" ")]
res = 0
for i in range(a, b + 1):
if m % i == 0:
res += 1
print(res)
if __name__ == '__main__':
main() | a, b, c = [int(i) for i in input().rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
if c % i == 0:
cnt += 1
print(cnt)
| 1 | 558,944,185,408 | null | 44 | 44 |
import numpy as np
n,t=map(int,input().split())
a=[list(map(int,input().split()))for i in range(n)]
b=np.zeros((n+1,t))
c=np.zeros((n+1,t))
for i in range(n):
b[i+1]=b[i]
b[i+1][a[i][0]:]=np.maximum(b[i+1][a[i][0]:],b[i][:-a[i][0]]+a[i][1])
c[-i-2]=c[-i-1]
c[-i-2][a[-i-1][0]:]=np.maximum(c[-i-2][a[-i-1][0]:],c[-i-1][:-a[-i-1][0]]+a[-i-1][1])
q=0
for i in range(n):
q=max(q,max(b[i]+c[i+1][::-1])+a[i][1])
print(int(q)) | N, T = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
AB.sort()
dp = [0] * T
#print("AB:", AB)
answer = 0
for a, b in AB:
for t in range(T-1, -1, -1):
if dp[t]:
if a + t < T:
dp[a + t] = max(dp[a + t], dp[t] + b)
answer = max(answer, dp[a + t])
else:
answer = max(answer, dp[t] + b)
if a < T:
dp[a] = max(dp[a], b)
answer = max(answer, b)
#print("dp:", dp)
print(answer) | 1 | 151,905,989,623,680 | null | 282 | 282 |
k = int(input())
t = "ACL"*k
print(t) | import sys
import os
# import math
# input = sys.stdin.readline
def int_array():
return list(map(int, input().strip().split()))
def str_array():
return input().strip().split()
def gcd(a,b):
if b == 0:
return a
return gcd(b, a % b);x
def take_input():
if os.environ.get("check"):
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
take_input()
######################### TEMPLATE ENDS HERE #################################
for _ in range(int(input())):
print("ACL", end="") | 1 | 2,145,284,269,352 | null | 69 | 69 |
a, b = map(int, input().split())
x = int(a*(a-1)/2)
y = int(b*(b-1)/2)
print(x+y) | while True:
cards = raw_input()
if cards == '-':
break
n = input()
for _ in xrange(n):
h = input()
cards = cards[h:] + cards[:h]
print cards | 0 | null | 23,704,167,198,532 | 189 | 66 |
S=list(input())
countA=0
countB=0
for i in range(3):
if S[i]=="A":
countA+=1
else:
countB+=1
if countA!=0 and countB!=0:
print("Yes")
else:
print("No") | s = input()
prev = s[0]
for i in range(1, 3):
if s[i] != prev:
print('Yes')
break
else:
print('No')
| 1 | 54,956,066,489,600 | null | 201 | 201 |
import sys
values = []
for line in sys.stdin:
values.append([int(x) for x in line.split()])
digit = 0
for x, y in values:
sum = x + y; digit = 0
while sum >= 1:
sum //= 10
digit += 1
print(digit) | import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n,m=map(int,input().split())
half=n//2
lst=[]
if n%2==1:
for i in range(m):
lst.append([half-i,half+i+1])
else:
for i in range(m):
if i%2==0:
lst.append([half-i//2,half+i//2+1])
else:
lst.append([1+i//2,n-1-i//2])
for i in range(m):
print(*lst[i])
# dic=defaultdict(int)
# for i in range(m):
# tmp=lst[i]
# dic[tmp[1]-tmp[0]]+=1
# dic[n-tmp[1]+tmp[0]]+=1
# print(dic)
| 0 | null | 14,357,809,072,280 | 3 | 162 |
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) | N=int(input())
xp=yp=0
xn=yn=10**9
zs=[0]*N
ws=[0]*N
for i in range(N):
xi,yi=map(int,input().split())
zs[i]=xi+yi
ws[i]=xi-yi
zs.sort()
ws.sort()
ans=max(zs[-1]-zs[0],ws[-1]-ws[0])
print(ans) | 1 | 3,427,566,431,862 | null | 80 | 80 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.