code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
L,R,d = [int(i) for i in input().split()]
ans = 0
for i in range(L,R+1):
if i%d == 0:
ans += 1
print(ans)
| import math
def LI():
return list(map(int, input().split()))
L, R, d = LI()
Ld = (L-1)//d
Rd = R//d
ans = Rd-Ld
print(ans)
| 1 | 7,485,406,050,304 | null | 104 | 104 |
import sys
input = sys.stdin.readline
N, D, a = [int(x) for x in input().split()]
XH = []
for _ in range(N):
XH.append([int(x) for x in input().split()])
XH.sort()
#####segfunc######
def segfunc(x,y):
return x + y
def init(init_val):
#set_val
for i in range(n):
seg[i+num-1]=init_val[i]
#built
for i in range(num-2,-1,-1) :
seg[i]=segfunc(seg[2*i+1],seg[2*i+2])
def update(k,x):
k += num-1
seg[k] = x
while k:
k = (k-1)//2
seg[k] = segfunc(seg[k*2+1],seg[k*2+2])
def query(p,q):
if q<=p:
return ide_ele
p += num-1
q += num-2
res=ide_ele
while q-p>1:
if p&1 == 0:
res = segfunc(res,seg[p])
if q&1 == 1:
res = segfunc(res,seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = segfunc(res,seg[p])
else:
res = segfunc(segfunc(res,seg[p]),seg[q])
return res
#入力
n = N
A = [0] * N
#####単位元######
ide_ele = 0
#num:n以上の最小の2のべき乗
num =2**(n-1).bit_length()
seg=[ide_ele]*2*num
#init
init(A)
import bisect
X = []
H = []
for i in XH:
X.append(i[0])
H.append(i[1])
ans = 0
for i in range(N):
x, h = X[i], H[i]
idx_left = bisect.bisect_left(X, x - 2 * D)
idx_right = i
tmp = query(idx_left, idx_right)
if tmp < h:
h -= tmp
cnt = h // a + int(h % a != 0)
ans += cnt
update(i, a * cnt)
print(ans)
| n = int(input())
r = n // 2
a = n % 2
print(r + a) | 0 | null | 70,395,004,532,160 | 230 | 206 |
score = list(map(int,input().split()))
if score[0] < 10:
answer = score[1] + 100*(10-score[0])
else:
answer = score[1]
print(answer) | # -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil, atan, pi
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')
import string
# string.ascii_lowercase
from bisect import bisect_left
MOD = int(1e9)+7
INF = float('inf')
g = defaultdict(list)
n = 0
ans = defaultdict(int)
def bfs(x):
q = deque([(x, 0)])
w = set([x])
while q:
v, dis = q.popleft()
if v > x:
ans[dis] += 1
for to in g[v]:
if to not in w:
w.add(to)
q.append((to, dis + 1))
def solve():
# n, m = [int(x) for x in input().split()]
n, X, Y = [int(x) for x in input().split()]
X -= 1
Y -= 1
g[X].append(Y)
g[Y].append(X)
for i in range(1, n):
g[i].append(i-1)
g[i-1].append(i)
for i in range(n-1):
bfs(i)
for i in range(1, n):
print(ans[i])
t = 1
# t = int(input())
for case in range(1,t+1):
ans = solve()
"""
azyxwvutsrqponmlkjihgfedcb
"""
| 0 | null | 53,512,303,662,400 | 211 | 187 |
from math import pi
x=float(input())
ans=2*pi*x
print(ans) | r = float(input())
pi = 3.1415
print(r * 2 * pi) | 1 | 31,160,091,817,120 | null | 167 | 167 |
while True:
m,f,r= map(int,input().split())
if m+f+r==-3:break
if m==-1 or f==-1:s="F"
elif m+f>=80:s="A"
elif m+f>=65:s="B"
elif m+f>=50:s="C"
elif m+f>=30 and r>=50:s="C"
elif m+f>=30:s="D"
else:s="F"
print(str(s))
| N = int(input())
li = list(map(int, input().split()))
minL = 2 * (10**6)
count = 0
for l in li:
if (minL >= l):
count += 1
minL = l
print(count) | 0 | null | 43,314,082,883,472 | 57 | 233 |
numbers = []
n = raw_input()
numbers = n.split(" ")
for i in range(3):
numbers[i] = int(numbers[i])
flag = 1
while flag:
flag = 0
for i in range(2, 0, -1):
if numbers[i] < numbers[i - 1]:
numbers[i], numbers[i - 1] = numbers[i - 1], numbers[i]
flag = 1
print ' '.join([str(a) for a in numbers]) | # local search is all you need
# 「日付 d とコンテストタイプ q をランダムに選び、d 日目に開催するコンテストをタイプ q に変更する」
# このデメリット→変化させる量が小さすぎるとすぐに行き止まり (局所最適解) に陥ってしまい、逆に、変化させる量が 大きすぎると闇雲に探す状態に近くなって、改善できる確率が低くなってしまう。
# 今回ならば、開催日が全体的に遠すぎず近すぎない感じのlocal minimumに収束する∵d日目のコンテストをi→jに変更したとする。iの開催期間はすごく伸びると2乗でスコアが下がるため、iの開催期間が比較的近いところのiしか選ばれない
# →じゃ2点スワップを導入して改善してみよう
# あといっぱい回すためにinitやscoreも若干高速化
from time import time
t0 = time()
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(read())
def ints(): return list(map(int, read().split()))
def read_col(H):
'''H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return tuple(map(list, zip(*ret)))
def read_tuple(H):
'''H is number of rows'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
from functools import reduce
from random import randint, random
def score(D, C, S, T):
'''2~3*D回のループでスコアを計算する'''
# last = [-1] * 26
date_by_contest = [[-1] for _ in range(26)]
for d, t in enumerate(T):
date_by_contest[t].append(d)
for i in range(26):
date_by_contest[i].append(D) # 番兵
# print(*date_by_contest, sep='\n')
score = 0
for d in range(D):
score += S[d][T[d]]
for c, dates in enu(date_by_contest):
for i in range(len(dates) - 1):
dd = (dates[i + 1] - dates[i])
# for ddd in range(dd):
# score -= C[c] * (ddd)
score -= C[c] * (dd - 1) * dd // 2
return score
D = a_int()
C = ints()
S = read_tuple(D)
def maximizer(newT, bestT, bestscore):
tmpscore = score(D, C, S, newT)
if tmpscore > bestscore:
return newT, tmpscore
else:
return bestT, bestscore
def ret_init_T():
'''greedyで作ったTを初期値とする。
return
----------
T, score ... 初期のTとそのTで得られるscore
'''
def _make_T(n_days):
# editorialよりd日目の改善は、改善せずにd+n_days経過したときの関数にしたほうが
# 最終的なスコアと相関があるんじゃない？
T = []
last = [-1] * 26
for d in range(D):
ma = -INF
for i in range(26):
tmp = S[d][i]
dd = d - last[i]
tmp += C[i] * (((dd + n_days + dd) * (n_days) // 2))
if tmp > ma:
t = i
ma = tmp
last[t] = d # Tを選んだあとで決める
T.append(t)
return T
T = _make_T(2)
sco = score(D, C, S, T)
for i in range(3, 16):
T, sco = maximizer(_make_T(i), T, sco)
return T, sco
bestT, bestscore = ret_init_T()
def add_noise(T, thre_p, days_near):
'''確率的にどちらかの操作を行う
1.日付dとコンテストqをランダムに選びd日目に開催するコンテストのタイプをqに変更する
2.10日以内の点でコンテストを入れ替える
thre_pはどちらの行動を行うかを調節、days_nearは近さのパラメータ'''
ret = T.copy()
if random() < thre_p:
d = randint(0, D - 1)
q = randint(0, 25)
ret[d] = q
return ret
else:
i = randint(0, D - 2)
j = randint(i - days_near, i + days_near)
j = max(j, 0)
j = min(j, D - 1)
if i == j:
j += 1
ret[i], ret[j] = ret[j], ret[i]
return ret
while time() - t0 < 1.92:
bestT, bestscore = maximizer(add_noise(bestT, 0.8, 8), bestT, bestscore)
bestT, bestscore = maximizer(add_noise(bestT, 0.8, 8), bestT, bestscore)
bestT, bestscore = maximizer(add_noise(bestT, 0.8, 8), bestT, bestscore)
bestT, bestscore = maximizer(add_noise(bestT, 0.8, 8), bestT, bestscore)
bestT, bestscore = maximizer(add_noise(bestT, 0.8, 8), bestT, bestscore)
# print(bestscore)
# print(score(D, C, S, T))
print(*mina(*bestT, sub=-1), sep='\n')
| 0 | null | 5,017,199,507,018 | 40 | 113 |
import math
import itertools
for i in range(int(input())):
a, b, c = sorted(map(int, input().split()))
print('YES' if a*a+b*b==c*c else 'NO') | s=input()
lis=list(s)
n=len(lis)
X=["x" for i in range(n)]
print("".join(X)) | 0 | null | 36,439,356,326,308 | 4 | 221 |
h,n = map(int,input().split())
a = map(int,input().split())
if sum(a) >= h:
print("Yes")
else:
print("No") | N = list(input())
num = 0
ans = 0
for i in range(len(N)-1, -1, -1):
n = int(N[i])
if n+num == 5 and i > 0 and int(N[i-1]) >= 5:
ans += 5
num = 1
elif n+num < 6:
ans += n+num
num = 0
else:
ans += 10-(n+num)
num = 1
ans += num
print(ans) | 0 | null | 74,367,625,554,518 | 226 | 219 |
n=int(input())
l =[]
for i in range(n):
s =input()
l.append(s)
l = set(l)
print(len(l)) | n = int(raw_input())
in_line = raw_input().split()
a = []
for i in in_line:
a.append(int(i))
a.sort()
print a[0],
print a[len(a)-1],
print sum(a) | 0 | null | 15,517,955,423,952 | 165 | 48 |
import math
def insertionSort(A, n, g):
cnt = 0
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt += 1
A[j + g] = v
return cnt
def shellSort(A, n):
cnt = 0
j = int(math.log(2 * n + 1, 3)) + 1
G = list(reversed([(3 ** i - 1)// 2 for i in range(1, j)]))
m = len(G)
for i in range(m):
cnt += insertionSort(A, n, G[i])
return A, cnt, G, m
n = int(input())
A = [int(input()) for i in range(n)]
ans, count, G, m = shellSort(A, n)
print(m)
print(' '.join(map(str,G)))
print(count)
[print(i) for i in A] | n=input()
print([n+"s",n+"es"][n[-1]=="s"]) | 0 | null | 1,187,140,970,600 | 17 | 71 |
# D - Moving Piece
n, k = map(int, input().split())
p = list(map(int, input().split()))
c = list(map(int, input().split()))
assert len(p) == len(c) == n
visited = [False] * n
scc = []
for i in range(n):
if not visited[i]:
scc.append([])
j = i
while not visited[j]:
visited[j] = True
scc[-1].append(j)
j = p[j] - 1
n_scc = len(scc)
subsum = [[0] for i in range(n_scc)]
for i in range(n_scc):
for j in scc[i]:
subsum[i].append(subsum[i][-1] + c[j])
for j in scc[i]:
subsum[i].append(subsum[i][-1] + c[j])
def lister(k):
for i in range(n_scc):
l = len(scc[i])
loop_score = max(0, subsum[i][l])
for kk in range(1, min(k, l) + 1):
base = loop_score * ((k - kk) // l)
for j in range(kk, l + kk + 1):
yield base + subsum[i][j] - subsum[i][j - kk]
print(max(lister(k)))
| N, K = [int(x) for x in input().split()]
P = [0] + [int(x) for x in input().split()]
C = [0] + [int(x) for x in input().split()]
max_score = max(C[1:])
for init in range(1, N + 1): # 初めの場所をinitとする
score = [0] # k回移動後のスコア
i = init
for k in range(1, K + 1):
i = P[i] # k回移動後に着くところ
score.append(score[-1] + C[i])
max_score = max(max_score, score[k])
if i == init: # ループ検出
loop_score = score[-1]
loop_len = k
if loop_score < 0:
max_score = max(max_score, max(score[1:]))
else:
max_score = max(max_score, max(score[j] + loop_score * ((K - j) // loop_len) for j in range(1, loop_len + 1)))
break
print(max_score) | 1 | 5,380,263,126,940 | null | 93 | 93 |
from math import ceil
A, B, C, D = map(int, input().split())
E = ceil(C/B)
F = ceil(A/D)
print('Yes' if E <= F else 'No')
| N, K = map(int, input().split())
H = sorted(map(int, input().split()))[:max(0, N-K)]
print(sum(H))
| 0 | null | 54,235,533,169,962 | 164 | 227 |
N = int(input())
def S(x):
return(x*(x+1)//2)
print(S(N) - 3*S(N//3) - 5*S(N//5) + 15*S(N//15)) | MOD = 1000000007
def mod_inv(mod, a):
old_t, t = 0, 1
old_r, r = mod, a
while r != 0:
quotient = old_r // r
old_r, r = r, old_r - quotient * r
old_t, t = t, old_t - quotient * t
return old_t % mod
def combine(n, k, mod):
if k > n // 2:
k = n - k
u = 1
for i in range(n - k + 1, n + 1):
u = u * i % mod
v = 1
for i in range(1, k + 1):
v = v * i % mod
return u * mod_inv(mod, v) % MOD
def main():
X, Y = map(int, input().split())
m1 = X + Y
if m1 % 3 == 0:
m = m1 // 3
if X < m or Y < m:
print(0)
else:
print(combine(m, X - m, MOD))
else:
print(0)
if __name__ == '__main__':
main()
| 0 | null | 92,809,024,046,682 | 173 | 281 |
a, b = input().split()
if a < b:
print(a * int(b))
elif a > b:
print(b * int(a))
else:
print(a * int(a)) | # -*- coding: utf-8 -*-
import io
import sys
import math
def solve(a,b):
# implement process
s = str(min(a,b))
n = max(a,b)
return s * n
def main():
# input
a,b = map(int, input().split())
# process
ans = str( solve(a,b) )
# output
print(ans)
return ans
### DEBUG I/O ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
7 7
"""
_EXPECTED = """\
7777777
"""
def logd(str):
"""usage:
if _DEB: logd(f"{str}")
"""
if _DEB: print(f"[deb] {str}")
### MAIN ###
if __name__ == "__main__":
if _DEB:
sys.stdin = io.StringIO(_INPUT)
print("!! Debug Mode !!")
ans = main()
if _DEB:
print()
if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
else: print(f"!! Failed... !!\nANSWER: {ans}\nExpected: {_EXPECTED}") | 1 | 84,281,435,614,070 | null | 232 | 232 |
from sys import stdin
w = str(input()).lower()
t = stdin.read().split()
counter = 0
for i in t:
i = i.lower()
if i == w:
counter += 1
print(counter)
| import sys
W = sys.stdin.readline().strip()
num = 0
while True:
T = sys.stdin.readline().strip()
if T == 'END_OF_TEXT':
break
t = T.lower()
T_line = t.split()
for i in T_line:
if W == i:
num += 1
print(num)
| 1 | 1,843,190,125,306 | null | 65 | 65 |
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline.rstrip()
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return tuple(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
P = inpl()
Q = inpl()
i = 0
a = 0
b = 0
for p in permutations(range(1,n+1)):
i += 1
if p == P:
a = i
if p == Q:
b = i
print(abs(a-b)) | n, k, c = map(int, input().split())
s = list(str(input()))
def getpos(s):
l = []
i = 0
while i <= n-1 and len(l) < k:
if s[i] == 'o':
l.append(i)
i += c+1
else:
i += 1
return l
l = getpos(s)
s.reverse()
r = getpos(s)
for i in range(len(r)):
r[i] = n-1-r[i]
#print(l)
#print(r)
lastl = [-1]*(n+1)
lastr = [-1]*(n+1)
for i in range(k):
lastl[l[i]+1] = i
for i in range(n):
if lastl[i+1] == -1:
lastl[i+1] = lastl[i]
for i in range(k):
lastr[r[i]] = i
for i in reversed(range(n)):
if lastr[i] == -1:
lastr[i] = lastr[i+1]
#print(lastl)
#print(lastr)
ans = []
s.reverse()
for i in range(n):
if s[i] != 'o':
continue
cnt = 0
cnt += lastl[i]+1
cnt += lastr[i+1]+1
if lastl[i] != -1 and lastr[i+1] != -1 and r[lastr[i+1]] - l[lastl[i]] <= c:
cnt -= 1
if cnt < k:
ans.append(i+1)
for i in range(len(ans)):
print(ans[i]) | 0 | null | 70,546,251,178,612 | 246 | 182 |
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
counter = Counter(A)
B = [1] * (max(A) + 1)
for a in A:
for k in range(a * 2,len(B),a):
B[k] = 0
print(sum(B[a] == 1 and counter[a] == 1 for a in A))
| import copy
def main():
N = int(input())
A = list(map(int, input().split()))
A.sort()
A_max = A[N-1]
div_count = [0] * (A_max + 1)
for a in A:
for n in range(a, A_max+1, a):
div_count[n] += 1
exists = [False] * (A_max + 1)
for a in A:
exists[a] = True
result = 0
for i, d in enumerate(div_count):
if d == 1 and exists[i]:
result += 1
print(result)
main()
| 1 | 14,285,566,817,538 | null | 129 | 129 |
t1,t2=map(int,input().split())
a1,a2=map(int,input().split())
b1,b2=map(int,input().split())
if (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)>0:print(0)
elif (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)==0:print('infinity')
else:print(-(a1*t1-b1*t1)//(a1*t1+a2*t2-b1*t1-b2*t2)*2+((a1*t1-b1*t1)%(a1*t1+a2*t2-b1*t1-b2*t2)!=0)) | N = int(input())
if N % 2 != 0:
print('0')
else:
count = 0
i = 1
while True:
dif = (N // 2) // (5 ** i)
count += dif
if dif == 0:
break
i += 1
print(count)
| 0 | null | 123,407,451,428,052 | 269 | 258 |
A, B, K = map(int, input().split())
if A <= K:
B -= K - A
if B < 0:
B = 0
A = 0
else:
A -= K
print(A, B)
| A,B,K = map(int,input().split())
A,rem = max(A-K,0),max(K-A,0)
B = max(B-rem,0)
print(A,B) | 1 | 104,451,305,103,236 | null | 249 | 249 |
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
N = I()
S = SS()
ans = [chr((ord(i) - ord('A') + N) % 26 + ord('A')) for i in S]
print(''.join(ans))
if __name__ == '__main__':
resolve()
| n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for k in range(60):
t=1<<k
z=o=0
for i in a:
if i&t:o+=1
else:z+=1
ans=(ans+(z*o*t))%mod
print(ans)
| 0 | null | 128,390,979,061,190 | 271 | 263 |
while 1:
try:
a,b=map(int,input().split())
print(len(str(a+b)))
except:
break | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
class com:
def __init__(self,max, mod = 1000000007):
self.fac = [0] * max
self.inv = [0] * max
self.finv = [0] * max
self.mod = mod
self.fac[0] = self.fac[1] = 1
self.finv[0] = self.finv[1] = 1
self.inv[1] = 1
for i in range(2,max):
self.fac[i] = self.fac[i-1] * i % mod
self.inv[i] = mod - self.inv[mod%i] * (mod//i) % mod
self.finv[i] = self.finv[i-1] * self.inv[i] % mod
def com(self, n, k):
if n < k: return 0
if n < 0 or k < 0: return 0
return self.fac[n] * (self.finv[k] * self.finv[n - k] % self.mod) % self.mod
def main():
x,y = mi()
if (x+y) % 3 != 0:
print(0)
return
step = (x+y)//3
if x < step or y < step:
print(0)
return
c = com(step+1)
ans = c.com(step, x - step)
print(ans)
main() | 0 | null | 75,007,332,627,840 | 3 | 281 |
#submit 16999743
a, b = input().split()
a = int(a)
b1, b2 = b.split('.')
ans = a * (int(b1) * 100 + int(b2)) // 100
print(ans)
| a,b= input().split()
a = int(a)
b,c = map(int,b.split("."))
print(a*(100*b+c)//100)
| 1 | 16,569,614,086,168 | null | 135 | 135 |
o = list()
top = -1
for s in input().split():
if s.isdigit():
o.append(int(s))
top += 1
else:
if s is "+":
n = o[top]+o[top-1]
o.pop(top)
top-=1
o.pop(top)
top-=1
o.append(n)
top+=1
if s is "-":
n = o[top-1] - o[top]
o.pop(top)
top -= 1
o.pop(top)
top -= 1
o.append(n)
top+=1
if s is "*":
n = o[top]*o[top-1]
o.pop(top)
top -= 1
o.pop(top)
top -= 1
o.append(n)
top+=1
print(o[0]) | import operator
func = {'+':operator.add, '-':operator.sub, '*':operator.mul}
stack = []
for symbol in input().split():
if symbol.isdigit():
stack.append(int(symbol))
else:
a = stack.pop()
b = stack.pop()
stack.append(func[symbol](b, a))
print(stack[0]) | 1 | 36,832,387,310 | null | 18 | 18 |
N = input()
if len(N) == 1:
if N == '3':
print('bon')
elif N == '0' or N == '1' or N == '6' or N == '8':
print('pon')
else:
print('hon')
elif len(N) == 2:
if N[1] == '3':
print('bon')
elif N[1] == '0' or N[1] == '1' or N[1] == '6' or N[1] == '8':
print('pon')
else:
print('hon')
elif len(N) == 3:
if N[2] == '3':
print('bon')
elif N[2] == '0' or N[2] == '1' or N[2] == '6' or N[2] == '8':
print('pon')
else:
print('hon') | print("pphbhhphph"[int(input())%10]+"on") | 1 | 19,272,804,389,440 | null | 142 | 142 |
k = int(input())
s = str(input())
if len(s) > k:
s = s[:k] + '...'
print(s) | s = int(input())
c = s // 500
d = s % 500
e = d //5
h = c*1000 + e*5
print(h) | 0 | null | 31,203,707,744,670 | 143 | 185 |
from collections import deque
alfabet=deque(input())
n=int(input())
reverse=0
for i in range(n):
operation_list=list(input().split())
if int(operation_list[0])==1:
reverse+=1
else:
if int(operation_list[1])==2 and reverse%2==0:
alfabet.append(operation_list[2])
elif int(operation_list[1])==2 and reverse%2==1:
alfabet.appendleft(operation_list[2])
elif int(operation_list[1])==1 and reverse%2==0:
alfabet.appendleft(operation_list[2])
elif int(operation_list[1])==1 and reverse%2==1:
alfabet.append(operation_list[2])
if reverse%2!=0:
alfabet.reverse()
print(''.join(alfabet)) | import itertools
n, m, q = map(int, input().split())
a, b, c, d = [0] * q, [0] * q, [0] * q, [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = map(int, input().split())
aa = [i for i in range(1, m+1)]
maxv = -1
for i in itertools.combinations_with_replacement(aa, n):
cnt = 0
for j in range(q):
if i[b[j]-1] - i[a[j]-1] == c[j]:
cnt += d[j]
maxv = max(maxv, cnt)
print(maxv) | 0 | null | 42,415,526,680,800 | 204 | 160 |
import sys
n = sys.stdin.readline()
s = sys.stdin.readline().split()
q = sys.stdin.readline()
t = sys.stdin.readline().split()
cnt = 0
for i in t:
if i in s:
cnt += 1
print(cnt) | import numpy as np
N,K=map(int, input().split())
A=np.array(list(map(int, input().split())))
for i in range(K,N):
if A[i]/A[i-K]>1:
print('Yes')
else:
print('No')
| 0 | null | 3,545,109,785,230 | 22 | 102 |
import math
N, D= list(map(int,input().split()))
cnt = 0
for i in range(N):
x, y = list(map(int, input().split()))
#print(math.sqrt((x^2)+(y^2)))
if math.sqrt((x*x)+(y*y)) <= D:
cnt+=1
print(cnt) | N = int(input())
S, T = input().split()
ans = ''
for s, t in zip(S, T):
ans += s
ans += t
print(ans)
| 0 | null | 58,972,852,094,308 | 96 | 255 |
class findroop:
def __init__(self, n, nex):
self.n = n
self.next = nex
#遷移start回でループに入る、end回でループする
#A->B->C->D->B: return=(1, 4)
#C->D->B->C : return=(0, 3)
#O(n)
def findroop(self, start):
roopstart = -1
roopend = -1
visited = [False for i in range(self.n)]
visitlist = []
now = start
for i in range(self.n):
if visited[now]:
roopend = i
break
else:
visited[now] = True
visitlist.append(now)
now = self.next(now)
for i in range(len(visitlist)):
if visitlist[i] == now:
roopstart = i
return (roopstart, roopend)
N,X,M = list(map(int, input().split()))
fr = findroop(M, lambda x: x**2 % M)
roopstart, roopend = fr.findroop(X)
ans = 0
if N <= roopstart:
for i in range(N):
ans += X
X = (X**2)%M
else:
for i in range(roopstart):
ans += X
X = (X**2)%M
N -= roopstart
roopsum = 0
for i in range(roopend-roopstart):
roopsum += X
X = (X**2) % M
ans += (N // (roopend-roopstart)) * roopsum
N = N % (roopend-roopstart)
for i in range(N):
ans += X
X = (X**2) % M
print(ans) | import sys
from sys import stdin
def I():
return stdin.readline().rstrip()
def MI():
return map(int,stdin.readline().rstrip().split())
def LI():
return list(map(int,stdin.readline().rstrip().split()))
#main part
n,x,m=MI()
stock=[]
for _ in range(1,n+1):
if x not in stock:
stock.append(x)
x=(x**2)%m
continue
else:
start=stock.index(x)
repeat=stock[start:]
l=len(repeat)
n-=start
sho=n//l
amari=n%l
s=sum(repeat)
rest=0
if amari!=0:
for j in range(amari):
rest+=repeat[j]
print(s*sho+rest+sum(stock[:start]))
sys.exit()
print(sum(stock)) | 1 | 2,823,294,166,280 | null | 75 | 75 |
from collections import deque
S = deque(input())
Q = int(input())
reverse_count = 0
for _ in range(Q):
Query = input().split()
if Query[0] == "1":
reverse_count += 1
else:
F, C = Query[1], Query[2]
if F == "1":
if reverse_count % 2 == 0:
S.appendleft(C)
else:
S.append(C)
else:
if reverse_count % 2 == 0:
S.append(C)
else:
S.appendleft(C)
if reverse_count % 2 == 1:
S.reverse()
print("".join(S))
| val = [int(i) for i in input().split()]
result = 0
for i in range(val[0], val[1] + 1):
if val[2] % i == 0:
result += 1
print(result)
| 0 | null | 28,970,565,365,302 | 204 | 44 |
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
n,m,x = I()
book = [l() for i in range(n)]
money = []
for i in range(2**n):
ccc = 0
bag = [0]*(m+1)
for j in range(n):
for k in range(m+1):
if ((i>>j)&1):
bag[k] += book[j][k]
for p in range(1,m+1):
if bag[p] >= x:
ccc += 1
if ccc == m:
money.append(bag[0])
if len(money) == 0:
print(-1)
else:
print(min(money))
| def main():
n,m,x = map(int,input().split())
c = []
a = []
for _ in range(n):
ca = [int(v) for v in input().split()]
c.append(ca[0])
a.append(ca[1:])
INTHIGH = 1<<32
pricemin = INTHIGH
for i in range(1<<n):
sm = [0]*m
sc = 0
for j in range(n):
if i & 1<<j:
sc += c[j]
for k in range(m):
sm[k] += a[j][k]
if min(sm)>=x:
pricemin = min(pricemin, sc)
break
print(pricemin if pricemin<INTHIGH else -1)
main() | 1 | 22,276,659,727,670 | null | 149 | 149 |
s = list(input())
t = list(input())
ans = 1000
sub = 0
flag = False
for i in range(len(s)):
if s[i] != t[sub]:
sub = 0
continue
else:
if sub == len(t) - 1:
print(0)
flag = True
break
sub += 1
if not flag:
for i in range(len(s) - len(t) + 1):
sub = 0
an = 0
for j in range(len(t)):
if s[i + j] != t[sub]:
an += 1
sub += 1
ans = min(an, ans)
print(ans) | s = input()
t = input()
numlist = []
for i in range(len(s)-len(t)+1):
a = s[i:i+len(t)]
count = 0
for j in range(len(t)):
if a[j] != t[j]:
count += 1
numlist.append(count)
print(min(numlist)) | 1 | 3,684,764,248,750 | null | 82 | 82 |
n = int(input())
lis = list(map(int, input().split()))
t = lis[0]
for i in range(1, n):
t ^= lis[i]
ans = [0] * n
for i , j in enumerate(lis):
ans[i] = t ^ j
print(*ans) | from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
from collections import Counter,defaultdict
n=IN()
a=LI()
ans=0
for i in range(n):
ans^=a[i]
for i in range(n):
print(ans^a[i],end=" ")
| 1 | 12,503,049,690,750 | null | 123 | 123 |
while True:
try:
a = map(int,raw_input().split(' '))
s = a[0] + a[1]
c = 0
while s > 0:
s = s / 10
c = c + 1
if s <= 0:
print c
break
except (EOFError):
break | N = input()
R = [int(raw_input()) for _ in xrange(N)]
S = [0 for i in xrange(N)]
S[N-1] = R[N-1]
for i in xrange(N-2, -1, -1):
S[i] = max(R[i], S[i+1])
ans = float('-inf')
for i in xrange(N-1):
ans = max(ans, S[i+1]-R[i])
print ans | 0 | null | 6,847,138,810 | 3 | 13 |
from collections import deque
n = int(input())
q = deque(["a"])
# 最後に最新の文字数のセットだけ拾う
for i in range(n - 1):
next_q = deque()
for curr in q:
suffix = ord(max(curr)) + 1
for x in range(ord("a"), suffix + 1):
next_q.append(curr + chr(x))
q = next_q
print(*q, sep="\n") | K=int(input())
S=input()
if len(S) <= K :
print(S)
else:
print(S[:K]+'...',end='') | 0 | null | 36,135,454,553,624 | 198 | 143 |
A,B,C,K = [int(x) for x in input().split()]
result = 0
if K > A:
result += A
else:
print(K)
exit()
if K < A + B:
print(result)
exit()
print(result - (K - A - B)) | a,b,c,k = map(int,input().split())
if k < a:
print(str(k))
elif k < (a + b):
print(str(a))
else:
print(str(2*a + b - k)) | 1 | 21,969,476,736,928 | null | 148 | 148 |
H,W,K = map(int,input().split())
C = [[int(i) for i in input()] for _ in range(H)]
ans = float("inf")
for i in range(1<<(H-1)):
start = [0]
end = []
for j in range(H-1):
if i & (1 << j):
j += 1
start.append(j)
end.append(j)
end.append(H)
L = len(end)
cnt = [0]*L
dcnt = L-1
fail = False
for w in range(W):
div = False
idx = 0
tmp = [0]*L
for s,e in zip(start,end):
for h in range(s,e): tmp[idx] += C[h][w]
if tmp[idx] > K:
fail = True
break
if cnt[idx] + tmp[idx] > K:
div = True
cnt = tmp[:]
else:
cnt[idx] += tmp[idx]
idx += 1
if fail: break
if div: dcnt += 1
if fail: continue
ans = min(dcnt,ans)
print(ans) | n = input()[-1]
if n in '24579':
print('hon')
elif n in '0168':
print('pon')
else:
print('bon') | 0 | null | 33,836,907,192,864 | 193 | 142 |
def main():
_, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
if K == 0:
print(max(A))
return
def is_ok(x):
need = 0
for a in A:
if a % x == 0:
need += a//x - 1
else:
need += a//x
if need <= K:
return True
else:
return False
def binary_search():
ng = 0
ok = 10**9
while abs(ok - ng) > 1:
mid = ng + (ok - ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
print(binary_search())
if __name__ == '__main__':
main()
| def resolve():
N, D = map(int, input().split())
P = [list(map(int, input().split())) for x in range(N)]
cnt = 0
for p in P:
d = (p[0] ** 2 + p[1] ** 2) ** 0.5
if d <= D:
cnt += 1
print(cnt)
resolve() | 0 | null | 6,267,411,162,522 | 99 | 96 |
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, T = lr()
AB = [lr() for _ in range(N)]
AB.sort()
# 時間のかかる物は後ろへ
dp = np.zeros(T, np.int64)
answer = 0
for a, b in AB:
answer = max(answer, dp.max() + b)
prev = dp
dp[a:] = np.maximum(prev[a:], prev[:-a] + b)
print(answer)
| import sys
import math
import copy
from heapq import heappush, heappop, heapify
from functools import cmp_to_key
from bisect import bisect_left, bisect_right
from collections import defaultdict, deque, Counter
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = float("inf")
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
def solve():
n, t = getList()
li = []
for i in range(n):
li.append(getList())
li.sort(key=lambda x: 30000 * x[0] + x[1])
dp = [0] * t
ans = 0
for a, b in li:
tmp = copy.copy(dp)
ans = max(ans, dp[-1] + b)
for idx, dd in enumerate(dp):
# tmp[idx] = max(tmp[idx], dd)
if idx + a < t:
tmp[idx + a] = max(dp[idx + a], dp[idx] + b)
dp = tmp
for j in range(len(dp) - 1):
dp[j+1] = max(dp[j], dp[j+1])
# print(dp)
# print(li)
print(ans)
def main():
n = getN()
for _ in range(n):
solve()
return
if __name__ == "__main__":
# main()
solve()
| 1 | 151,718,451,184,928 | null | 282 | 282 |
N = int(input())
ints = map(int, input().split())
for i in ints:
if i % 2 == 0:
if i % 3 != 0 and i % 5 != 0:
print('DENIED')
exit()
print('APPROVED') | import math
N = int(input())
def mass_search(x):
divisor = 0
limit = math.floor(math.sqrt(x))
for i in range(1,limit+1):
if N % i == 0:
divisor = max(divisor, i)
x = divisor
y = N//divisor
return x+y-2
print(mass_search(N)) | 0 | null | 115,719,251,915,180 | 217 | 288 |
N = int(input())
x = []
for i in range(N):
s, t = input().split()
x.append([s, int(t)])
X = input()
count = False
ans = 0
for i in range(N):
if count:
ans += x[i][1]
if x[i][0] == X:
count = True
print(ans)
| n = int(input())
a = list(map(int, input().split()))
length = len(a)
total = sum(a)
ans = 0
for i in range(0,length):
total -= a[i]
ans += (a[i] * total)
print(ans % (10**9 + 7)) | 0 | null | 50,404,120,619,232 | 243 | 83 |
N,K = map(int,input().split())
R,S,P = map(int,input().split())
T = input()
ans = 0
memo = [0 for i in range(N)]
for i in range(N):
check = T[i]
if i >= K and T[i-K] == check and memo[i-K] == 0:
memo[i] = 1
continue
if check == "r":
ans += P
elif check == "p":
ans += S
elif check == "s":
ans += R
print(ans) | from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n,k = readInts()
r,s,p = readInts()
t = list(input())
his = ["-1"]
ans = 0
for i in range(len(t)):
if t[i]=="r":
me = "p"
point = p
elif t[i]=="s":
me = "r"
point = r
else:
me = "s"
point = s
if his[max(0,i-k+1)]==me:
his.append(i)
else:
ans+=point
his.append(me)
print(ans) | 1 | 106,590,674,141,960 | null | 251 | 251 |
cnt = int(input())
print("ACL" * cnt) | n = input()
xi = map(int, raw_input().split())
print ("%d %d %d") %(min(xi), max(xi), sum(xi)) | 0 | null | 1,466,739,408,306 | 69 | 48 |
s = input()
ans = 'Yes'
num = len(s)
if num % 2 != 0:
ans = 'No'
pass
else:
for i in range(0, num, 2):
if s[i] + s[i+1] != 'hi':
ans = 'No'
print(ans) | S = input()
List1= []
List2 = []
n1 = 0
n2 = 0
for i in range(0,len(S),2):
List1.append(S[i])
for i in range(1,len(S),2):
List2.append(S[i])
n1 = List1.count("h")
n2 = List2.count("i")
if n1 == len(List1) and n2 == len(List2) and n1 == n2:
print("Yes")
else:
print("No")
| 1 | 53,199,802,284,028 | null | 199 | 199 |
n = int(input())
f = list(map(int,input().split()))
f.sort(reverse = True)
ans = 0
if n%2 == 0:
for i in range(n//2):
ans += f[i] * 2
ans -= f[0]
else:
for i in range(n//2):
ans += f[i] * 2
ans += f[n//2]-f[0]
print(ans)
| n,m = (int(i) for i in input().split())
array = [[int(i) for i in input().split()] for i in range(n)]
b = [int(input()) for i in range(m)]
for i in range(n):
ans = 0
for i2 in range(m):
ans += array[i][i2]*b[i2]
print(ans) | 0 | null | 5,169,779,242,528 | 111 | 56 |
n=int(input())
a=list(map(int,input().split()))
ans=[0]*(n+1)
for i in range(n-1):
ans[a[i]]+=1
ans.pop(0)
for j in ans:
print(j) | def main():
N = int(input())
A = list(map(int,input().split()))
buka_num = [0]*(N+1)
for i in range(N-1):
buka_num[A[i]] += 1
for i in range(1,N+1,1):
print(buka_num[i])
main()
| 1 | 32,332,898,168,352 | null | 169 | 169 |
n = int(input())
cnt = [-1] + [1] + [2] * 10000000
for i in range(2, 10000002 // 2):
for j in range(2 * i, 10000001, i):
cnt[j] += 1
ans = 0
for i in range(1, n + 1):
ans += i * cnt[i]
print(ans) | m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
if m1 in [1,3,5,7,8,10,12] and d1==31:
print(1)
elif m1 in [4,6,9,11] and d1==30:
print(1)
elif m1==2 and d1 in [28,29]:
print(1)
else:
print(0) | 0 | null | 67,656,697,502,438 | 118 | 264 |
from collections import deque
n, u, v = map(int, input().split())
u-=1; v-=1;
a = []; b = [];
dist = [[] for i in range(n)]
for i in range(n-1):
a, b = map(int, input().split())
a -= 1; b -= 1
dist[a].append(b)
dist[b].append(a)
def bfs(u):
d = [-1]*n
stack = deque([u])
d[u] = 0
while len(stack)!=0:
s = stack.popleft()
for t in dist[s]:
if d[t]==-1:
d[t] = d[s]+1
stack.append(t)
return d
A = bfs(v)
T = bfs(u)
ans=0
for i in range(n):
if A[i]>T[i]:
ans = max(A[i]-1, ans)
print(ans) | import sys
input = sys.stdin.readline
I=lambda:int(input())
MI=lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
from collections import deque
res=0
INF=10**9
N,u,v=MI()
G=[[] for _ in [0]*(N+1)]
for i in range(N-1):
a,b=MI()
G[a].append(b)
G[b].append(a)
def bfs(a):
q=deque()
q.append(a)
d=[INF]*(N+1)
d[a]=0
res=0
while q:
r=q.popleft()
for nr in G[r]:
if d[nr]==INF:
q.append(nr)
d[nr]=d[r]+1
res+=1
return d
aoki=bfs(v)
taka=bfs(u)
m=0
for i in range(1,N+1):
if taka[i]<aoki[i]:
m=max(aoki[i],m)
print(m-1) | 1 | 117,433,254,255,940 | null | 259 | 259 |
import sys
X = int(sys.stdin.readline())
a = X // 500
b = (X - a * 500) // 5
print(a * 1000 + b * 5) | #!/usr/bin/env python3
import sys
import math
from collections import defaultdict
def main():
mod = 1000000007 # 10^9+7
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def lmi(): return list(map(int, input().split()))
class Eratos:
def __init__(self, num):
self.table_max = num
# self.table[i] は i が素数かどうかを示す (bool)
self.table = [False if i == 0 or i == 1 else True for i in range(num+1)]
for i in range(2, int(math.sqrt(num)) + 1):
if self.table[i]:
for j in range(i ** 2, num + 1, i): # i**2 からスタートすることで定数倍高速化できる
self.table[j] = False
# self.table_max 以下の素数を列挙したリスト
self.prime_numbers = [2] if self.table_max >= 2 else []
for i in range(3, self.table_max + 1, 2):
if self.table[i]:
self.prime_numbers.append(i)
def is_prime(self, num):
if num > self.table_max:
raise ValueError('Eratos.is_prime(): exceed table_max({}). got {}'.format(self.table_max, num))
return self.table[num]
def prime_factorize(self, num):
if num > self.table_max:
raise ValueError('Eratos.prime_factorize(): exceed table_max({}). got {}'.format(self.table_max, num))
factorized_dict = defaultdict(int) # 素因数分解の結果を記録する辞書
candidate_prime_numbers = [i for i in range(2, int(math.sqrt(num)) + 1) if self.is_prime(i)]
# n について、√n 以下の素数で割り続けると最後には 1 or 素数となる
# 背理法を考えれば自明 (残された数が √n より上の素数の積であると仮定。これは自明に n を超えるため矛盾)
for p in candidate_prime_numbers:
# これ以上調査は無意味
if num == 1:
break
while num % p == 0:
num //= p
factorized_dict[p] += 1
if num != 1:
factorized_dict[num] = 1
return factorized_dict
# import time
# s = time.time()
n = ii()
L = lmi()
a_max = max(L)
# O(AlglgA) で前処理
eratos = Eratos(a_max)
# print('preprocessed (Eratostenes)')
# print(time.time() - s)
# O(n) * O(√A) で LCM を素因数分解した形で保存する
lcm_dict = eratos.prime_factorize(L[0])
for i in range(1, n):
d = eratos.prime_factorize(L[i])
for k, v in d.items():
lcm_dict[k] = max(lcm_dict[k], v)
# print('prime factorized')
# print(time.time() - s)
# O(√A)
lcm_mod = 1
for k, v in lcm_dict.items():
lcm_mod = (lcm_mod * pow(k, v, mod)) % mod
# O(n)
ans = 0
for a in L:
# a^p-2 ≡ 1/a
inverse_element = pow(a, mod-2, mod)
ans = (ans + lcm_mod * inverse_element) % mod
print(ans)
# print(time.time() - s)
if __name__ == "__main__":
main() | 0 | null | 64,956,531,670,940 | 185 | 235 |
ans = []
for s in open(0).readlines():
if "?" in s:
break
ans.append(eval(s.strip().replace("/", "//")))
print(*ans, sep='\n')
| while True:
a, b, c = map(str, input().split())
a = int(a)
c = int(c)
if(b == '+'):
print(a + c)
elif(b == '-'):
print(a - c)
elif(b == '*'):
print(a * c)
elif(b == '/'):
print(a // c)
else:
break
| 1 | 696,367,931,070 | null | 47 | 47 |
# -*- coding:utf-8
def main():
N = int(input())
A = list(map(int, input().split()))
insertionSort(A, N)
print(' '.join(map(str, A)))
def insertionSort(A, N):
for i in range(1, N):
print(' '.join(map(str, A)))
v = A[i]
j = i-1
while(j>=0 and A[j]>v):
A[j+1] = A[j]
j -= 1
A[j+1] = v
if __name__ == '__main__':
main() | def insertion_sort(A, N):
for i in range(N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j + 1] = A[j]
j -= 1
A[j + 1] = v
print(' '.join(map(str, A)))
def main():
N = int(input().rstrip())
A = list(map(int, input().rstrip().split()))
insertion_sort(A, N)
if __name__ == '__main__':
main() | 1 | 5,665,856,438 | null | 10 | 10 |
import sys
def gcd(a,b):
if a%b == 0:
return b
else:
return gcd(b, a%b)
for line in sys.stdin:
a,b = map(int, line.split())
if a<b:
tem = a
a = b
b = tem
gc = gcd(a,b)
print(gc, a*b//gc) | def main():
N = int(input())
l = list(map(int, input().split()))
ans = 0
m = 10**9 + 7
for i in range(60):
x = 0
for j in l:
x += 1 & j >> i
tmp = x * (N - x) % m
tmp *= 2 ** i % m
ans += tmp
ans %= m
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 61,247,147,860,350 | 5 | 263 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 998244353
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
return [[] for _ in range(col)]
elif col == 1:
return [I() for _ in range(row)]
else:
read_all = [LI() for _ in range(row)]
return map(list, zip(*read_all))
#################
N,S = LI()
A = LI()
beki = [1]*(N+1)
for i in range(1,N+1):
beki[i] = beki[i-1]*2
beki[i] %= mod
inv2 = pow(2,mod-2,mod)
d = [0]*(S+1)
d[0] = beki[N]
ans = 0
for i in range(N):
if 0 <= S-A[i] <= S:
ans += d[S-A[i]]*inv2
ans %= mod
diff = [0]*(S+1)
for k in range(S-A[i]+1):
diff[k+A[i]] = d[k]*inv2
for k in range(S+1):
d[k] += diff[k]
d[k] %= mod
print(ans) | inputEnzan=input().split()
def keisan(inputEnzan):
while True:
stockFornumber=[]
index=0
length=len(inputEnzan)
if length==1:
break
while index<length:
if inputEnzan[index]=="+" or inputEnzan[index]=="-" or inputEnzan[index]=="*":
if len(stockFornumber)==2:
if inputEnzan[index]=="+":
inputEnzan[index]=stockFornumber[0]+stockFornumber[1]
stockFornumber=[]
inputEnzan[index-1]="null"
inputEnzan[index-2]="null"
elif inputEnzan[index]=="-":
inputEnzan[index]=stockFornumber[0]-stockFornumber[1]
stockFornumber=[]
inputEnzan[index-1]="null"
inputEnzan[index-2]="null"
else:
inputEnzan[index]=stockFornumber[0]*stockFornumber[1]
stockFornumber=[]
inputEnzan[index-1]="null"
inputEnzan[index-2]="null"
else:
stockFornumber=[]
pass
else:
if len(stockFornumber)==2:
del stockFornumber[0]
stockFornumber.append(int(inputEnzan[index]))
index+=1
while "null" in inputEnzan:
inputEnzan.remove("null")
print(inputEnzan[0])
keisan(inputEnzan)
| 0 | null | 8,926,844,513,586 | 138 | 18 |
#!/usr/bin/env python3
s = input()
k = int(input())
n = len(s)
b = [0] * n
c = [0] * n
c[0] = 1
for i in range(n):
if s[i - 1] == s[i] and not c[i - 1]:
c[i] = 1
if i and s[i - 1] == s[i] and not b[i - 1]:
b[i] = 1
s1 = sum(b)
s2 = sum(c)
if s[-1] != s[0] or b[-1]:
print(s1 * k)
else:
if c[-1]:
print((s1 + s2) * (k // 2) + s1 * (k % 2))
else:
print(s1 + (k - 1) * s2)
| S = input()
K = int(input())
INNER = 0
if len(set(list(S))) == 1:
print(K*len(S)//2)
else:
i = 0
while i < len(S)-1:
if S[i] == S[i+1]:
INNER += 1
i += 1
i += 1
if (S[0] != S[-1]):#最初の文字と最後の文字が違うなら、
print(INNER*K)
else:
same_from_start = 0
same_from_end = 0
count_from_start = 0
count_from_end = 0
flag_same_from_start = 0
flag_same_from_end = 0
while flag_same_from_start == 0:
if S[count_from_start] == S[count_from_start+1]:
count_from_start += 1
else:
count_from_start += 1
flag_same_from_start = 1
while flag_same_from_end == 0:
if S[len(S)-count_from_end-1] == S[len(S)-count_from_end-2]:
count_from_end += 1
else:
count_from_end += 1
flag_same_from_end = 1
print(INNER*K + (K -1) * ((count_from_start+count_from_end)//2 -\
count_from_start//2- count_from_end//2)) | 1 | 175,110,299,201,292 | null | 296 | 296 |
def solve(T, R, S, P, K):
N = len(T)
Z =[None for i in range(N)]
for i in range(N):
if T[i] == 'r':
Z[i] = P
elif T[i] == 's':
Z[i] = R
else:
Z[i] = S
if i - K >= 0:
if T[i-K] == T[i] and Z[i-K] != 0:
Z[i] = 0
return sum(Z)
N, K = map(int,input().split(' '))
R, S, P = map(int,input().split(' '))
T = str(input())
print(solve(T, R, S, P, K)) | N, K = [int(x) for x in input().split()]
r, s, p = [int(x) for x in input().split()]
win_point = {
'r': r,
's': s,
'p': p,
}
next_hands = {
'r': ['s', 'p'],
's': ['r', 'p'],
'p': ['r', 's'],
}
enemy_hands = input()
def can_win(enemy_hand, my_hands):
# 勝てる場合にはTrueと勝てる手を教えてくれる
if enemy_hand == 'r' and 'p' in my_hands:
return True, 'p'
if enemy_hand == 's' and 'r' in my_hands:
return True, 'r'
if enemy_hand == 'p' and 's' in my_hands:
return True, 's'
# 勝てる手がない場合
return False, None
point = 0
for index in range(K):
now_hands = ['r', 'p', 's']
for i in range(index, N, K):
win, hand = can_win(enemy_hands[i], now_hands)
if win:
point += win_point[hand]
now_hands = next_hands[hand]
else:
# 勝てない場合次似邪魔しない手を選ぶ
# 勝てない回の次は必ず勝てるため全手出せる前提とする
now_hands = ['r', 'p', 's']
print(point)
| 1 | 107,105,944,831,300 | null | 251 | 251 |
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():
s = S()
k = I()
same = len(set(list(s)))==1
ans = None
if same:
ans = len(s)*k//2
else:
if s[0]!=s[-1]:
cnt = 0
change = False
for i in range(1,len(s)):
if s[i] == s[i-1] and not change:
cnt += 1
change = True
else:
change = False
ans = cnt*k
else:
char = s[0]
start = len(s)
goal = -1
cnt = 0
while s[start-1] == char:
start -= 1
while s[goal+1] == char:
goal += 1
lenth = len(s)-start + goal+1
cnt += lenth//2 * (k-1)
ccnt = 0
change = False
for i in range(goal+1+1,start):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt * (k-2)
ccnt = 0
change = False
for i in range(1,start):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt
ccnt = 0
change = False
for i in range(goal+1+1, len(s)):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt
ans = cnt
print(ans)
main()
| H, W, M = map(int, input().split())
R = [0]*H #各行にある爆弾の個数
C = [0]*W #各列にある爆弾の個数
bombs = []
for _ in range(M):
h, w = map(lambda x: int(x)-1, input().split())
R[h] += 1
C[w] += 1
bombs.append((h, w))
R_max = max(R)
C_max = max(C)
### Rが最大かつCが最大な座標であって、
# そこに爆弾がない場合があれば
# 答えがR_max+C_max
# なければR_max+C_max-1
count = 0 # 爆弾がある座標であって、Rが最大かつCが最大の組の個数
for bx, by in bombs:
if R[bx] == R_max and C[by] == C_max:
count += 1
count_R = R.count(R_max)
count_C = C.count(C_max)
if count >= count_R*count_C:
ans = R_max + C_max - 1
else:
ans = R_max + C_max
print(ans) | 0 | null | 89,737,837,662,528 | 296 | 89 |
from collections import deque
n,x,y=map(int,input().split())
l=[[1]]
for i in range(1,n-1):
l.append([i-1,i+1])
l.append([n-2])
x,y=x-1,y-1
l[x].append(y)
l[y].append(x)
#print(l)
p=[0 for i in range(n)]
for j in range(n):
s=[-1 for i in range(n)]
s[j]=0
q=deque([j])
while len(q)>0:
a=q.popleft()
for i in l[a]:
if s[i]==-1:
s[i]=s[a]+1
q.append(i)
for i in s:
if i!=0:
p[i]+=1
print(*map(lambda x:x//2,p[1:]),sep='\n') | import sys
for d in sys.stdin:
x, y = map(int, d.split())
if (x, y) == (0, 0): break
print("{0} {1}".format(min(x, y), max(x, y))) | 0 | null | 22,276,810,752,636 | 187 | 43 |
s=input()
s.lower()
print(s[0:3]) | K = str(input())
print(K[0:3]) | 1 | 14,735,363,980,220 | null | 130 | 130 |
for i in range(1, 10):
for j in range(1, 10):
print("{}x{}={}".format(i, j, i*j))
| import sys
for i in range(1,10):
for j in range(1,10):
print("{0}x{1}={2}".format(i,j,i*j)) | 1 | 2,243,880 | null | 1 | 1 |
X, Y = map(int, input().split())
ans = 0
if X <= 3:
ans += (4-X) * 100000
if Y <= 3:
ans += (4-Y) * 100000
if X == Y == 1:
ans += 400000
print(ans) | a = list(input().split())
l = []
for c in a:
if c == '+':
l.append(l.pop() + l.pop())
elif c == '-':
l.append((l.pop() - l.pop()) * -1)
elif c == '*':
l.append(l.pop() * l.pop())
else:
l.append(int(c))
print(l.pop()) | 0 | null | 70,284,056,657,572 | 275 | 18 |
n,m=map(int,input().split())
li=[]
if n==1:
score="0"
else:
score="1"+"0"*(n-1)
for i in range(m):
s,c=map(int,input().split())
if n!=1 and (s,c)==(1,0):
print("-1")
quit()
li.append([s,c])
for j in range(len(li)):
if li[j][0]==s and li[j][1]!=c:
print("-1")
quit()
score=score[:s-1]+str(c)+score[s:]
print(int(score))
|
def main():
n, m = map(int, input().split(" "))
s = [0] * m
c = [0] * m
for i in range(m):
s[i], c[i] = map(int, input().split(" "))
ans = [-1] * n
for i in range(m):
if ans[s[i]-1] != -1 and ans[s[i]-1] != c[i]:
print(-1)
return
ans[s[i]-1] = c[i]
if ans[0] == 0:
if n == 1:
print(0)
return
print(-1)
return
for i in range(n):
if ans[i] == -1:
if i == 0:
if n == 1:
print(0)
return
print(1, end="")
else:
print(0, end = "")
else:
print(ans[i], end ="")
print()
if __name__ == "__main__":
main() | 1 | 60,637,731,863,628 | null | 208 | 208 |
n = int(input())
ret = ''
for i in range(1,n+1):
str = repr(i)
if (i % 3 == 0): ret += ' ' + repr(i)
elif ('3' in str): ret += ' ' + repr(i)
print(ret) | a=int(input())
x=(a-2)/2
if int(x) ==x:
print(int(x))
else:
print(int(x+1)) | 0 | null | 77,446,678,964,802 | 52 | 283 |
N=int(input())
A = list(map(int,input().split()))
val = 0
for i in range(N):
val = val ^ A[i]
ans = []
for i in range(N):
s = val ^ A[i]
ans.append(s)
print(*ans) | N, K = [int(_) for _ in input().split()]
s = 0
e = 0
ans = 0
MOD = 10 ** 9 + 7
for i in range(N+1):
s += i
e += N - i
if i + 1 >= K:
ans += e - s + 1
ans %= MOD
print(ans)
| 0 | null | 22,913,788,644,490 | 123 | 170 |
N, K = map(int, input().split())
snuke = [False] * (N + 1)
for _ in range(K):
d = int(input())
A = list(map(int, input().split()))
for a in A:
snuke[a] = True
ans = 0
for i in range(1, N + 1):
if snuke[i] == False:
ans += 1
print(ans)
| import math
import sys
from functools import reduce
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
A[i] = A[i] // 2
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
C = lcm_list(A)
B = [0 for _ in range(N)]
for i in range(N):
B[i] = C // A[i]
if B[i] % 2 == 0:
print(0)
sys.exit()
print( (M // C + 1) // 2) | 0 | null | 62,999,496,354,342 | 154 | 247 |
import sys
def check(x_list, f, r, v):
x_list[f][r] += v
def peo(x_list):
for i in range(3):
for j in range(10):
sys.stdout.write(" %d" %(x_list[i][j]))
print ("")
A_bill = [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]]
B_bill = [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]]
C_bill = [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]]
D_bill = [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]]
n = input()
for i in range(n):
x = raw_input()
b, f, r, v = x.split()
b = int(b)
f = int(f)
r = int(r)
v = int(v)
if b == 1:
check(A_bill, f-1,r-1,v)
elif b == 2:
check(B_bill, f-1,r-1,v)
elif b == 3:
check(C_bill, f-1,r-1,v)
elif b == 4:
check(D_bill, f-1,r-1,v)
peo(A_bill)
print("####################")
peo(B_bill)
print("####################")
peo(C_bill)
print("####################")
peo(D_bill) | import sys
# sys.setrecursionlimit(100000)
from collections import deque
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
s = deque(list(input()))
q = input_int()
inverse = False
for _ in range(q):
data = input().split()
if len(data) == 1:
inverse = not inverse
else:
if (data[1] == "1" and not inverse) or (data[1] == "2" and inverse):
s.appendleft(data[2])
else:
s.append(data[2])
if inverse:
print("".join(reversed(s)))
else:
print("".join(s))
return
if __name__ == "__main__":
main()
| 0 | null | 29,401,578,311,650 | 55 | 204 |
import sys
ERROR_INPUT = 'input is invalid'
ERROR_INPUT_NOT_UNIQUE = 'input is not unique'
def main():
S = get_input1()
T = get_input2()
count = 0
for t in T:
for s in S:
if t == s:
count += 1
break
print(count)
def get_input1():
n = int(input())
if n > 10000:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
li.append(x)
return li
def get_input2():
n = int(input())
if n > 500:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
elif int(x) in li:
print(ERROR_INPUT_NOT_UNIQUE)
sys.exit(1)
li.append(x)
return li
main() | # coding: utf-8
# input
n = int(input())
s = list(map(int,input().split()))
q = int(input())
t = list(map(int,input().split()))
cnt = 0
for i in t:
if i in s:
cnt += 1
print(cnt) | 1 | 67,405,361,838 | null | 22 | 22 |
n = int(input())
a = n // 1000
if n % 1000 != 0:
b = a + 1
print(f"{1000*b-n}")
else:
print("0") | N = int(input())
ans = N%1000
if ans == 0:
print(0)
else:
print(1000-ans) | 1 | 8,433,433,946,918 | null | 108 | 108 |
a = [];
for i in range(0, 10):
a.append(int(input()));
a.sort(reverse = True);
for i in range(0, 3):
print(a[i]); | N,K=map(int,input().split())
P=list(map(int,input().split()))
C=list(map(int,input().split()))
P=[i-1 for i in P]
idle_max=-10**27
for s in range(0,N):
k=K-1
score=0
s=P[s]
score+=C[s]
count=1
idle_max=max(idle_max,score)
visited={s:[count,score]}
while k and not P[s] in visited:
k-=1
count+=1
s=P[s]
score+=C[s]
visited[s]=[count,score]
idle_max=max(idle_max,score)
#print(visited)
if k:
c1,score1=visited[s]
c2,score2=visited[P[s]]
c1+=1
s=P[s]
score1+=C[s]
score+=C[s]
k-=1
n=c1-c2
score+=(score1-score2)*(k//n)
k%=n
idle_max=max(idle_max,score)
while k:
k-=1
s=P[s]
score+=C[s]
idle_max=max(idle_max,score)
print(idle_max)
| 0 | null | 2,690,279,977,430 | 2 | 93 |
S = input()
for i in range(len(S)):
tmp = S[i]
S = S.replace(tmp,"x")
print(S) | a, b, c, d = map(int, input().split())
if d < a:
print(d)
exit()
elif d < a + b:
print(a)
exit()
else:
print(a+(-1)*(d-a-b)) | 0 | null | 47,489,938,906,008 | 221 | 148 |
def main():
N,K=map(int,input().split())
M={}
mod=pow(10,9)+7
res=0
for i in range(K,0,-1):
syou=K//i
mc=pow(syou,N,mod)
if syou>=2:
for sub_m in range(2,syou+1):
mc-=M[sub_m*i]
res+=(i*mc)%mod
M[i]=mc
print(res%mod)
if __name__=="__main__":
main() | n,k,s=map(int,input().split())
ans=[0]*n
if s!=10**9:
for i in range(k):
ans[i]=s
for i in range(k,n):
ans[i]=10**9
else:
for i in range(k):
ans[i]=s
for i in range(k,n):
ans[i]=1
print(*ans)
| 0 | null | 64,015,826,393,770 | 176 | 238 |
x,k,d = map(int,input().split())
count = abs(x)//d
if x<0:
before_border = x+d*count
after_border = x+d*(count+1)
else:
before_border = x-d*count
after_border = x-d*(count+1)
if count >= k:
if x<0:
print(abs(x+d*k))
else:
print(abs(x-d*k))
else:
if (count-k)%2 == 0:
print(abs(before_border))
else:
print(abs(after_border)) | X,K,D=map(int,input().split())
import math
X=abs(X)
U=min(math.floor(X/D),K)
K=K-U
A=X-U*D
if K%2==0:
print(A)
else:
print(abs(A-D)) | 1 | 5,181,759,631,568 | null | 92 | 92 |
def dfs(G,n):
global ptr
#探索済
seen[n] = True
#行き
F[n] = ptr
ptr += 1
for i in G[n]:
#次に行けるかを判定
if seen[i] == True :
continue
dfs(G,i)
#帰り
L[n] = ptr
ptr += 1
if __name__ == '__main__':
n = int(input())
G = [[] for _ in range(n+1)]
F = [0 for _ in range(n+1)]
L = [0 for _ in range(n+1)]
#深さ優先探索
#探索済配列
seen = [False for _ in range(n+1)]
for i in range(n):
cmd = list(map(int,input().split()))
m = cmd[1]
if m != 0:
for j in range(m):
G[i+1].append(cmd[j+2])
ptr = 1
for i in range(1,n):
if seen[i] == False :
dfs(G,i)
for i in range(1,n+1):
print(i,F[i],L[i])
| n=int(input())
#V[u]=[k,[v],d,f]
V=[[0,[],0,0]]
for i in range(n):
v=[int(i) for i in input().split(" ")]
u=v.pop(0)
k=v.pop(0)
v.sort()
V.append([k,v,0,0])
def is_finished(Id):
k=V[Id][0]
v=V[Id][1]
for i in range(k):
if V[v[i]][2]==0:
return v[i]
return -1
time=1
while time<=2*n:
for i in range(1,n+1):
if V[i][2]==0:
cur=i
log=[i]
break
while len(log)>0:
if V[cur][2]==0:
V[cur][2]=time
time+=1
x=is_finished(cur)
if x!=-1:
cur=x
log.append(cur)
else:
try:
log.pop(-1)
V[cur][3]=time
time+=1
if V[cur][3]==V[cur][2]:
time+=1
V[cur][3]+=1
cur=log[-1]
except:
pass
for i in range(1,n+1):
print(i,V[i][2],V[i][3]) | 1 | 3,030,931,232 | null | 8 | 8 |
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
D1 = abs(A-B)
D2 = (V-W)*T
if (D1 - D2) <=0:
print("YES")
else:
print("NO")
| a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
ans = "NO"
if a > b: a,b = a*(-1), b*(-1)
if a == b: ans = "YES"
elif a < b:
if v > w and (b-a) <= (v-w)*t: ans = "YES"
print(ans) | 1 | 15,090,684,955,960 | null | 131 | 131 |
s = input()
n = len(s)
if n % 2 == 1:
print("No")
exit(0)
for i in range(n):
if i % 2 == 0:
if s[i] != "h":
print("No")
break
elif s[i] != "i":
print("No")
break
else:
print("Yes")
| S = input()
if len(S) % 2 != 0:
print('No')
exit()
tmp = [S[i:i+2] for i in range(0, len(S), 2)]
for s in tmp:
if s != 'hi':
print('No')
exit()
print('Yes')
| 1 | 53,052,662,927,768 | null | 199 | 199 |
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, d=DVSR): return pow(x, d - 2, d)
def DIV(x, y, d=DVSR): return (x * INV(y, d)) % d
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
N=II()
LSTP=[]
LSTN=[]
for i in range(N):
cnt = 0
cntMin = 0
s = input()
for c in s:
if c == "(":
cnt += 1
else:
cnt -= 1
cntMin = min(cntMin, cnt)
# print(cntMin)
if cnt >= 0:
LSTP.append((cntMin, cnt))
else:
LSTN.append((-(cnt-cntMin), -cnt))
LSTP.sort(reverse=True)
LSTN.sort(reverse=True)
res = 0
for cntMin, cnt in LSTP:
if res + cntMin < 0:
print("No")
exit(0)
res += cnt
res2 = 0
for cntMin, cnt in LSTN:
if res2 + cntMin < 0:
print("No")
exit(0)
res2 += cnt
if res - res2 == 0:
print("Yes")
else:
print("No")
| # import itertools
S = input()[::-1]
# l = len(S)
# nums = range(1, l+1)
count = [0]*2019
count[0] = 1
num = 0
d = 1
for i in S:
num += int(i)*d
num %= 2019
count[num] += 1
d *= 10
d %= 2019
ans = 0
for i in count:
ans += i*(i-1)//2
print(ans)
| 0 | null | 27,178,466,943,552 | 152 | 166 |
N = int(input())
X = input()
def popcnt1(n):
return bin(n).count("1")
k = [0,1,1,2,1,2,1,2,1,2,1,2,1,2,2,3,1,2,1] #18まで
c = 0
for i in range(N):
if X[i] == "1":
c += 1
m1 = 0
p1 = 0
for i in range(N):
if c != 1:
if X[i] == "1":
m1 += pow(2,N-1-i,c-1)
m1 %= c-1
p1 += pow(2,N-1-i,c+1)
p1 %= c+1
else:
if X[i] == "1":
p1 += pow(2,N-1-i,c+1)
p1 %= c+1
for i in range(N):
if c != 1:
if X[i] == "0":
B2 = p1 + pow(2,N-1-i,c+1)
B2 %= c+1
else:
B2 = m1 - pow(2,N-1-i,c-1)
B2 %= c-1
else:
if X[i] == "0":
B2 = p1 + pow(2,N-1-i,c+1)
B2 %= c+1
else:
print(0)
continue
S = len(bin(B2))
c2 = popcnt1(B2)
if c2 == 0:
print(1)
else:
print(2+k[B2%c2]) | n=int(input())
s=input()
ans=""
for i in s:
ans+=chr(ord("A")+(ord(i)-ord("A")+n)%26)
print(ans) | 0 | null | 71,041,249,810,850 | 107 | 271 |
while True:
m, f, r = [int (x) for x in input().split(' ')]
if m == -1 and f == -1 and r == -1: break
if m == -1 or f == -1 or m + f < 30:
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65 and m + f < 80:
print('B')
elif m + f >= 50 and m + f < 65:
print('C')
elif m + f >= 30 and m + f < 50:
if r >= 50:
print('C')
else:
print('D') | while True:
i = input().split()
m, f, r = map(int, i)
if m == -1 and f == -1 and r == -1:
break
if m == -1 or f == -1:
print('F')
elif m+f >= 80:
print('A')
elif m+f < 80 and m+f >= 65:
print('B')
elif m+f < 65 and m+f >= 50:
print('C')
elif m+f < 50 and m+f >=30:
if r >= 50:
print('C')
else:
print('D')
else:
print('F') | 1 | 1,243,267,179,232 | null | 57 | 57 |
S = input()
arr = [0]*(len(S) + 1)
cn = 0
for i in range(len(S)):
if S[i] == "<":
cn += 1
else:
cn = 0
arr[i+1] = cn
cn = 0
for i in range(len(S)-1, -1, -1):
if S[i] == ">":
cn += 1
else:
cn = 0
arr[i] = max(arr[i], cn)
# print(arr)
print(sum(arr)) | S=str(input())
W=['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(len(W)):
if S==W[i]:
print(7-i) | 0 | null | 145,034,617,397,592 | 285 | 270 |
class UnionFind:
def __init__(self, n):
self.n = [-1]*n
self.r = [0]*n
self.co = n
def find(self, x):
if self.n[x] < 0:
return x
else:
self.n[x] = self.find(self.n[x])
return self.n[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.r[x] > self.r[y]:
self.n[x] += self.n[y]
self.n[y] = x
else:
self.n[y] += self.n[x]
self.n[x] = y
if self.r[x] == self.r[y]:
self.r[y] += 1
self.co -= 1
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.n[self.find(x)]
def set_count(self):
return self.co
n, m = map(int, input().split())
uf = UnionFind(n)
for _ in range(m):
a, b = map(int, input().split())
uf.unite(a-1, b-1)
print(uf.set_count()-1)
| from collections import Counter
n, m = map(int, input().split())
group = [None for _ in range(n)]
connected = [[] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
connected[a].append(b)
connected[b].append(a)
# print(connected)
for i in range(n):
if group[i] is not None: continue
newly_visited = [i]
group[i] = i
while len(newly_visited) > 0:
new = newly_visited.pop()
for j in connected[new]:
if group[j] is not None: continue
group[j] = i
newly_visited.append(j)
# print(Counter(group))
print(len(Counter(group)) - 1)
| 1 | 2,251,048,721,152 | null | 70 | 70 |
import collections
N=int(input())
A=list(input().split())
a=collections.Counter(A)
A=[int(i) for i in A]
S=sum(A)
Q=int(input())
for i in range(Q):
B,C=input().split()
if B in a:
b=a[B]
S-=int(B)*b
S+=int(C)*b
del a[B]
if C in a:
a[C]+=b
else:
a[C]=b
print(S)
| def main():
n = int(input())
a = list(map(int,input().split()))
dic = {}
for i in range(n):
if not a[i] in dic.keys():
dic[a[i]] = 1
else:
dic[a[i]] += 1
s = 0
for k in dic.keys():
s += dic[k] * k
q = int(input())
for i in range(q):
b,c = map(int,input().split())
if b in dic.keys():
cnt = dic[b]
else:
cnt = 0
dic[b] = 0
if c in dic.keys():
dic[c] += cnt
else:
dic[c] = cnt
s = s + cnt * (c-b)
print(s)
if __name__ == "__main__":
main()
| 1 | 12,112,961,991,648 | null | 122 | 122 |
billdings = [[[0 for _ in range(10)] for _ in range(3)] for _ in range(4)]
def printstate(billdings):
"""
for billnum, billding in enumerate(billdings):
for flooor in billding:
for room in flooor:
print(" {}".format(room), end="")
print()
print("#"*20 if billnum != len(billdings)-1 else "")
"""
for i in range(len(billdings)):
for j in range(len(billdings[0])):
for k in range(len(billdings[0][0])):
print(" "+str(billdings[i][j][k]), end="")
print()
if i != len(billdings)-1:
print("#"*20)
n = int(input())
for _ in range(n):
b, f, r, v = map(int, input().split())
b, f, r = b-1, f-1, r-1
billdings[b][f][r] += v
printstate(billdings)
| import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = map(int, input().split())
M = 10**9+7
nums = [0]*(k+1) # gcd==kなる数列の個数
for i in range(k, 0, -1):
nums[i] = pow(k//i, n, M)
for j in range(2*i, k+1, i):
nums[i] -= nums[j]
nums[i] %= M
ans = sum(i*item for i,item in enumerate(nums))%M
print(ans) | 0 | null | 18,897,335,607,096 | 55 | 176 |
n = input()
l = list( map(int, input().split()))
odd = [ c for c in l if (c % 2 == 0 ) and (( c % 3 != 0) and ( c % 5 !=0 ))]
if len( odd ) == 0:
print( "APPROVED" )
else:
print( "DENIED" ) | n = int(input())
arr = list(map(int, input().split()))
arr = sorted(arr)
m = arr[-1]
li = [0]*(m+1)
cnt = 0
for i in arr:
for j in range(i, m+1, i):
li[j] += 1
for i in arr:
if li[i] == 1:
cnt += 1
print(cnt) | 0 | null | 41,806,977,641,322 | 217 | 129 |
n = int(input())
a = list(map(int, input().split()))
for v in a:
if v % 2 == 0:
if not (v % 3 == 0 or v % 5 == 0):
print("DENIED")
exit()
print("APPROVED")
| N = int(input())
A = list(map(int, input().split()))
ans = 'DENIED'
for a in A:
if a%2 == 0:
if a%3 == 0 or a%5 == 0:
continue
else:
break
else:
ans = 'APPROVED'
print(ans) | 1 | 69,260,327,613,660 | null | 217 | 217 |
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k]*finv[n-k]%mod)%mod
mod = 10**9+7
X, Y = map(int,input().split())
a = X%2 #1の数
b = X//2 #2の数
for i in range(b+1):
if a*2 + b*1 == Y:
break
a += 2
b -= 1
if a*2 + b*1 != Y:
print(0)
else:
max = a+b+1
fac = [0] * max
finv = [0] * max
inv = [0] * max
COMinit()
print(COM(a+b,a))
| kMod = 1000000007
X, Y = map(int, input().split())
if (X+Y) % 3 != 0:
print(0)
exit()
offset = (X+Y)//3
X, Y = X-offset, Y-offset
if X < 0 or Y < 0:
print(0)
exit()
X, Y = max(X, Y), min(X, Y)
ans = 1
for i in range(X+1, X+Y+1):
ans *= i
ans %= kMod
for i in range(2, Y+1):
ans *= pow(i, kMod-2, kMod)
ans %= kMod
print(ans) | 1 | 150,367,381,112,828 | null | 281 | 281 |
import sys
import numpy as np
sys.setrecursionlimit(10 ** 9)
N = int(input())
A = list(map(int,input().split()))
dp = np.full((N, 3), 0, dtype=int)
dp[0][0] = A[0]
dp[1][1] = A[1]
if N != 2:
dp[2][2] = A[2]
dp[2][0] = A[0] + A[2]
for i in range(3,N):
if i & 1:
dp[i][1] = max(dp[i-3][0], dp[i-2][1]) + A[i]
else:
dp[i][0] = dp[i-2][0] + A[i]
dp[i][2] = max(dp[i-4][0], dp[i-3][1], dp[i-2][2]) + A[i]
if N & 1:
ans = max(dp[-3][0], dp[-2][1], dp[-1][2])
else:
ans = max(dp[-2][0], dp[-1][1])
print(ans) | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(input())
A = list(map(int,input().split()))
dp0 = [0] * (n+11)
dp1 = [0] * (n+11)
dp2 = [0] * (n+11)
for i,ai in enumerate(A):
dp2[i+11] = (max(dp0[i+7] + ai, dp1[i+8] + ai, dp2[i+9] + ai) if i >= 2 else 0)
dp1[i+11] = (max(dp0[i+8] + ai, dp1[i+9] + ai) if i >= 1 else 0)
dp0[i+11] = dp0[i+9] + ai
if n % 2 == 0:
print(max(dp0[n + 9], dp1[n + 10]))
else:
print(max(dp0[n + 8], dp1[n + 9], dp2[n + 10]))
# debug
# print(dp0,dp1,dp2,sep="\n")
| 1 | 37,191,942,499,910 | null | 177 | 177 |
import heapq
INFTY = 10**4
N,X,Y = map(int,input().split())
G = {i:[] for i in range(1,N+1)}
for i in range(1,N):
G[i].append(i+1)
G[i+1].append(i)
G[X].append(Y)
G[Y].append(X)
dist = [[INFTY for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
dist[i][i] = 0
for i in range(1,N+1):
hist = [0 for _ in range(N+1)]
heap = [(0,i)]
hist[i] = 1
while heap:
d,x = heapq.heappop(heap)
if d>dist[i][x]:continue
hist[x] = 1
for y in G[x]:
if hist[y]==0:
if dist[i][y]>d+1:
dist[i][y] = d+1
heapq.heappush(heap,(d+1,y))
C = {k:0 for k in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
C[dist[i][j]] += 1
for k in range(1,N):
print(C[k]) | a,b=[],[]
for _ in range(int(input())):
x,y=map(int,input().split())
a+=[x-y]
b+=[x+y]
print(max(max(a)-min(a),max(b)-min(b))) | 0 | null | 23,648,097,255,900 | 187 | 80 |
n,k=[int(x) for x in input().split()]
d=[int(x) for x in input().split()]
t=[x for x in d if x>=k]
print(len(t)) | n = int(input())
sum = 0
for _ in range(n):
a = int(input())
if a == 2:
continue
for i in range(a):
x = i + 2
if a%x == 0:
sum += 1
break
if x > a ** 0.5:
break
print(n - sum)
| 0 | null | 89,403,421,672,308 | 298 | 12 |
'''
Created on 2020/08/20
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
A,B,M=map(int,pin().split())
a=list(map(int,pin().split()))
b=list(map(int,pin().split()))
ans=min(a)+min(b)
for _ in [0]*M:
x,y,c=map(int,pin().split())
t=a[x-1]+b[y-1]-c
if t<ans:
ans=t
print(ans)
return
main() | c=int(input())
ans=0
now=0
for _ in range(c):
if eval(input().replace(" ","==")):
now = now+1
else:
now = 0
ans = max(ans,now)
print("Yes") if ans >= 3 else print("No") | 0 | null | 28,055,532,872,768 | 200 | 72 |
input()
cnt = 0
x = ""
for s in input():
if x != s:
cnt += 1
x = s
print(cnt) | N=int(input())
S=input()
ans=S[0]
for s in S:
if ans[-1]!=s:
ans+=s
print(len(ans)) | 1 | 170,154,361,412,430 | null | 293 | 293 |
N = int(input())
memo1 = []
memo2 = []
memo3 = []
memo4 = []
for i in range(N):
S = input()
sum_n = sum([1 if s=='(' else -1 for s in S])
if sum_n >= 0:
sum_n = 0
min_n = 1
for s in S:
if s == ')':
sum_n -= 1
min_n = min(min_n, sum_n)
else:
sum_n += 1
if min_n >= 0:
memo1.append([min_n, sum_n])
else:
memo2.append([min_n, sum_n])
else:
sum_n = 0
min_n = 1
for s in S[::-1]:
if s == '(':
sum_n -= 1
min_n = min(min_n, sum_n)
else:
sum_n += 1
if min_n >= 0:
memo4.append([min_n, sum_n])
else:
memo3.append([min_n, sum_n])
left = 0
for min_n, sum_n in memo1:
left += sum_n
memo2.sort(reverse=True)
for min_n, sum_n in memo2:
if left + min_n < 0:
print('No')
quit()
else:
left += sum_n
right = 0
for min_n, sum_n in memo4:
right += sum_n
memo3.sort(reverse=True)
for min_n, sum_n in memo3:
if right + min_n < 0:
print('No')
quit()
else:
right += sum_n
if left == right:
print('Yes')
else:
print('No') | n=int(input())
alist=list(map(int,input().split()))
height=alist[0]
ans=0
for i in range(1,n):
if height>alist[i]:
ans+=height-alist[i]
else:
height=alist[i]
print(ans) | 0 | null | 14,168,932,879,180 | 152 | 88 |
tmp = input().split(" ")
a = int(tmp[0])
b = int(tmp[1])
c = int(tmp[2])
if a + b + c >= 22:
print("bust")
else:
print("win") | a1,a2,a3=map(int,input().split())
if a1+a2+a3<=21 :
print("win")
else :
print("bust") | 1 | 118,733,920,560,630 | null | 260 | 260 |
'''
ITP-1_6-A
??°???????????¢
?????????????????°???????????????????????????????????°?????????????????????????????????
???Input
??\????????\????????¢?????§?????????????????????
n
a1 a2 . . . an
n ?????°????????????????????????ai ??? i ???????????°?????¨????????????
???Output
???????????°?????????????????????????????????????????°??????????´??????????????????????????????\???????????????
??????????????°????????????????????\??????????????¨?????¨????????????????????????
'''
# import
import sys
# ?????°??????????????????
## ??°????????????
cntData = int(input())
#inputData = map(int, input().split())
## ??°
inputData = input().split(" ")
# sort
# inputData.sort(reverse=True)
inputData.reverse()
# Output
print(" ".join(inputData)) | N = int(input())
dp = [1] * (N+1)
for i in range(2, N+1):
dp[i] = dp[i-2] + dp[i-1]
print(dp[N])
| 0 | null | 490,245,733,280 | 53 | 7 |
import sys
sys.setrecursionlimit(10000000)
MOD = 998244353
INF = 10 ** 15
def main():
N,S = map(int,input().split())
A = list(map(int,input().split()))
dp = [[0]*(1 + S) for _ in range(N + 1)]
dp[0][0] = pow(2,N,MOD)
inv2 = pow(2,MOD - 2,MOD)
for i,a in enumerate(A):
for j in range(S + 1):
if j < a:
dp[i + 1][j] = dp[i][j]
else:
dp[i + 1][j] = (dp[i][j] + dp[i][j - a] * inv2)%MOD
print(dp[N][S])
if __name__ == '__main__':
main() | mod = 998244353
n,s = map(int, input().split())
a = list(map(int, input().split()))
table = [0]*(s+1)
table[0] = 1
ans = 0
for ai in a:
nxt = [0]*(s+1)
if ai <= s:
for j in range(ai, s+1):
nxt[j] = table[j-ai]
table = [(2*table[i] + nxt[i])%mod for i in range(s+1)]
ans += table[-1]
ans %= mod
print(ans)
| 1 | 17,818,037,974,058 | null | 138 | 138 |
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
A = inpl()
B = inpl()
aa = 0
bb = 0
i = 0
for tmp in itertools.permutations(range(1,n+1)):
i += 1
if list(tmp) == A:
aa = i
if list(tmp) == B:
bb = i
print(abs(aa - bb)) | from math import factorial
from itertools import permutations
n = int(input())
p = tuple(map(str, input().split()))
q = tuple(map(str, input().split()))
num = [str(i) for i in range(1, n+1)]
allnum = list(i for i in permutations(num, n))
print(abs(allnum.index(p) - allnum.index(q))) | 1 | 100,756,978,017,852 | null | 246 | 246 |
import math
x = int(input())
for i in range(1,x+1):
if i%3==0:
print(f" {i}",end="")
continue
r=i
while True:
if r<=0:
break
if r%10==3:
print(f" {i}",end="")
break
r//=10
print("")
| n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
tt = list(t)
d = {'r':p, 's': r, 'p':s}
dp = [d[t[i]] for i in range(n)]
for i in range(n-k):
if tt[i]==tt[i+k]:
dp[i+k] = 0
tt[i+k] = 'x'
print(sum(dp))
| 0 | null | 53,725,727,088,150 | 52 | 251 |
# 問題: https://atcoder.jp/contests/abc144/tasks/abc144_c
import math
n = int(input())
a = int(math.sqrt(n))
b = 0
while b == 0:
if n % a > 0:
a -= 1
continue
b = n / a
res = a + b - 2
print(int(res))
| import math
K = int(input())
# gcd(a, b, c)=gcd(gcd(a,b), c) が成り立つ
s = 0
for a in range(1, K+1):
for b in range(1, K+1):
d = math.gcd(a, b) # gcd(a, b)は先に計算しておく
for c in range(1, K+1):
s += math.gcd(d, c)
print(s) | 0 | null | 98,295,091,891,840 | 288 | 174 |
import math
k = int(input())
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
x = math.gcd(a, b)
for c in range(1,k+1):
sum += math.gcd(x, c)
print(sum) | # coding: utf-8
# Your code here!
N=int(input())
count=-1
for i in range(N//2+1):
count+=1
if N%2==0:
print(count-1)
else:
print(count) | 0 | null | 94,280,859,722,812 | 174 | 283 |
def main():
n, q = map(int, input().split())
queue = [[x for x in input().split()] for _ in range(n)]
queue = [(x[0], int(x[1])) for x in queue]
elapsed_time = 0
while len(queue) > 0:
process, time = queue.pop(0)
if time > q:
queue.append((process, time - q))
elapsed_time += q
else:
elapsed_time += time
print('{} {}'.format(process, str(elapsed_time)))
return
main()
| l = []
while True:
s = [int(i) for i in input().split()]
if s == [0,0]:
break
else:
s.sort()
l.append(str(s[0])+' '+str(s[1]))
for i in l:
print(i) | 0 | null | 283,623,511,692 | 19 | 43 |
#####segfunc######
def segfunc(x, y):
return x | y
def init(init_val):
# set_val
for i in range(n):
seg[i + num - 1] = set(init_val[i])
# built
for i in range(num - 2, -1, -1):
seg[i] = segfunc(seg[2 * i + 1], seg[2 * i + 2])
def update(k, x):
k += num - 1
seg[k] = set(x)
while k:
k = (k - 1) // 2
seg[k] = segfunc(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if q <= p:
return ide_ele
p += num - 1
q += num - 2
res = ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, seg[p])
if q & 1 == 1:
res = segfunc(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, seg[p])
else:
res = segfunc(segfunc(res, seg[p]), seg[q])
return res
#####単位元######
ide_ele = set()
n = int(input())
S = input().strip()
Q = int(input())
num = 2 ** (n - 1).bit_length()
seg = [set()] * 2 * num
init(S)
for _ in range(Q):
a, b, c = [x for x in input().split()]
if a == "1":
update(int(b) - 1, c)
else:
print(len(query(int(b) - 1, int(c))))
| a,b=map(int,input().split())
l=list(map(int,input().split()))
z=0
l=sorted(l)
for i in range(a-b):
z+=l[i]
print(z) | 0 | null | 70,759,851,211,644 | 210 | 227 |
t = input()
s = t.replace("?", "D")
print(s)
| t=input()
tla=list(t)
tlb=list(t)
pd1=0
pd2=0
for i in range(len(tla)):
if tla[i]=="?":
if i==0:
pass
elif i==len(tla)-1:
tla[i]="D"
elif tla[i-1]=="P":
tla[i]="D"
elif tla[i+1]=="D":
tla[i]="P"
elif tla[i+1]=="?":
tla[i]="P"
else:
tla[i]="D"
if tla[i]=="D":
if i==0:
pass
elif tla[i-1]=="P":
pd1+=1
d1=tla.count('D')
s1=d1+pd1
for i in range(len(tlb)):
if tlb[i]=="?":
tlb[i]="D"
if tlb[i]=="D":
if i==0:
pass
elif tlb[i-1]=="P":
pd2+=1
d2=tlb.count('D')
s2=d2+pd2
if s1>s2:
print(''.join(tla))
else:
print(''.join(tlb)) | 1 | 18,436,149,414,680 | null | 140 | 140 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.