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
|
|---|---|---|---|---|---|---|
n, t = map(int, input().split())
dish = [list(map(int, input().split())) for _ in range(n)]
dish.sort(key=lambda x: x[0])
dp = [[0 for _ in range(3005)] for _ in range(3005)]
ans = 0
for i in range(n):
for j in range(t):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
nj = j + dish[i][0]
if nj < t:
dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + dish[i][1])
now = dp[i][t- 1] + dish[i][1]
ans = max(ans, now)
print(ans)
|
import sys, math, itertools
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
MOD = 998244353
def I(): return int(input())
def F(): return float(input())
def S(): 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 LS(): return input().split()
def factorialMod(n, p):
fact = [0] * (n+1)
fact[0] = fact[1] = 1
factinv = [0] * (n+1)
factinv[0] = factinv[1] = 1
inv = [0] * (n+1)
inv[1] = 1
for i in range(2, n + 1):
fact[i] = (fact[i-1] * i) % p
inv[i] = (-inv[p % i] * (p // i)) % p
factinv[i] = (factinv[i-1] * inv[i]) % p
return fact, factinv
def combMod(n, r, fact, factinv, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
def resolve():
N, M, K = LI()
ans = 0
fact, factinv = factorialMod(N, MOD)
for i in range(K + 1):
ans += combMod(N - 1, i, fact, factinv, MOD) * M * pow(M - 1, N - 1 - i, MOD)
ans %= MOD
print(ans)
if __name__ == '__main__':
resolve()
| 0 | null | 86,932,225,986,100 | 282 | 151 |
import math
ceil = math.ceil
def main(N, A):
A.reverse()
pos = [(A[0], A[0])]
for i in range(len(A)-1):
tmpmin = ceil(pos[-1][0]/2) + A[i+1]
tmpmax = pos[-1][1] + A[i+1]
pos.append((tmpmin, tmpmax))
l,r = pos.pop()
if l > 1:
return -1
ki = [1]
A.reverse()
for j in range(N):
m = (ki[j]-A[j])*2
l, r = pos.pop()
if m < l:
return -1
ki.append(min(r, m))
return sum(ki)
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
ans = main(N, A)
print(ans)
|
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import permutations
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(input())
S = list(input())
Q = int(input())
q_list = [list(input().split()) for _ in range(Q)]
bit_tree = [[0] * (N+1) for _ in range(26)]
def BIT_add(i, tree):
while i <= N:
tree[i] += 1
i += i&(-i)
def BIT_sub(i, tree):
while i <= N:
tree[i] -= 1
i += i&(-i)
def BIT_sum(i, tree):
s = 0
while i:
s += tree[i]
i -= i&(-i)
return s
for i in range(N):
x = ord(S[i]) - ord('a')
BIT_add(i + 1, bit_tree[x])
for q in range(Q):
line = q_list[q]
if line[0] == '1':
i, c = line[1:]
i = int(i) - 1
old_c = ord(S[i]) - ord('a')
new_c = ord(c) - ord('a')
BIT_sub(i + 1, bit_tree[old_c])
BIT_add(i + 1, bit_tree[new_c])
S[i] = c
else:
l, r = map(int, line[1:])
now = 0
for i in range(26):
cnt = BIT_sum(r, bit_tree[i]) - BIT_sum(l - 1, bit_tree[i])
if cnt > 0:
now += 1
print(now)
| 0 | null | 40,733,540,294,708 | 141 | 210 |
T = [int(t) for t in input().split()]
A = [int(t) for t in input().split()]
B = [int(t) for t in input().split()]
d1 = T[0]*(A[0]-B[0])
d2 = d1 + T[1]*(A[1]-B[1])
if d2 == 0:
ans = "infinity"
elif d1 > 0 and d2 > 0:
ans = 0
elif d1 < 0 and d2 < 0:
ans = 0
else:
d1 = abs(d1)
d2 = abs(d2)
ans = d1 // d2 * 2
if d1%d2 != 0:
ans += 1
print(ans)
|
for i in xrange(81):print "{}x{}={}".format(i/9+1,i%9+1,(i/9+1)*(i%9+1))
| 0 | null | 65,909,889,527,490 | 269 | 1 |
mod = 1000000007
n,k = map(int, input().split())
d = [0]*(k+1)
for i in range(1,k+1):
d[i] = pow(k//i,n,mod)
for i in range(k,0,-1):
for j in range(2*i,k+1,i):
d[i] -= d[j]
d[i] %= mod
ans = 0
for i in range(1,k+1):
ans += d[i]*i
ans %= mod
print(ans)
|
n, k = map(int, input().split())
MOD = 10 ** 9 + 7
patterns = [0] * k
total = 0
for i in range(k, 0, -1):
# gcdがちょうどi ⇔ すべての要素がiの倍数
# かつ すべての要素が2i, 3i, ...の倍数でない
tmp = pow(k // i, n, MOD)
for j in range(2*i, k+1, i):
tmp -= patterns[j-1]
patterns[i-1] = tmp
total += i * tmp
total %= MOD
print(total)
| 1 | 36,563,741,330,588 | null | 176 | 176 |
s = input()
st = s[0]
flag = False
for i in range(1,3):
if st != s[i]:
flag = True
break
if flag:
print('Yes')
else:
print('No')
|
#16D8101014F 久留米 竜之介 Kurume Ryunosuke Python
All = 0
q = []
Queue = []
tmp,time = map(int,input().split())
for i in range(tmp):
p,zi =input().split()
q.append([p,int(zi)])
while len(q) > 0:
if q[0][1]<= time:
All+=q[0][1]
v=q.pop(0)
Queue.append([v[0],All])
else:
All+=time
q[0][1]-=time
last=q.pop(0)
q.append(last)
for i in range(len(Queue)):
print("{0} {1}".format(Queue[i][0],Queue[i][1]))
| 0 | null | 27,283,228,251,892 | 201 | 19 |
import math
n = int(input())
for i in range(int(math.sqrt(n)),0,-1):
if n % i == 0:
print(int(i + (n / i) - 2))
break
|
from math import sqrt
from math import floor
n = int(input())
ans = 10 ** 12
m = floor(sqrt(n))
for i in range(1,m+1):
if n % i == 0:
j = n // i
ans = min(ans,i+j-2)
print(ans)
| 1 | 161,456,945,938,750 | null | 288 | 288 |
k=int(input())
if k==4 or k==6 or k==9 or k==10 or k==14 or k==21 or k==22 or k==25 or k==26:
print(2)
elif k==8 or k==12 or k==18 or k==20 or k==27:
print(5)
elif k==16:
print(14)
elif k==24:
print(15)
elif k==32:
print(51)
elif k==28 or k==30:
print(4)
else:
print(1)
|
import sys
n = int(input())
x = sorted(list(map(int, input().split())))
if len(list(set(x))) == 1:
print(0)
sys.exit()
if n == 1:
print(0)
sys.exit()
x_min = x[0]
x_max = x[n-1]
min_sum = 10000000
for p in range(x_min, x_max):
sum = 0
for e in x:
len = (e - p)**2
sum += len
# print("p", p, "sum", sum, "min_sum", min_sum)
if sum <= min_sum:
min_sum = sum
print(min_sum)
| 0 | null | 57,546,765,289,308 | 195 | 213 |
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
k = int(input())
s = input()
n = len(s)
mod = 10**9+7
p25 = [0]*(k+1)
p26 = [0]*(k+1)
c = [0]*(k+1)
p25[0], p26[0] = 1, 1
c[0]= 1
for i in range(1, k+1):
p25[i] = p25[i-1]*25
p25[i] %= mod
p26[i] = p26[i-1]*26
p26[i] %= mod
c[i] = (n+i-1)*c[i-1]
c[i] *= pow(i, mod-2, mod)
c[i] %= mod
p25.reverse()
c.reverse()
ans = 0
for i in range(k+1):
tmp = p25[i]*p26[i]*c[i]
tmp %= mod
ans += tmp
ans %= mod
print(ans)
if __name__ == '__main__':
main()
|
#! /usr/bin/python3
m=100
for _ in range(int(input())):
m = int(m*1.05+0.999)
print(m*1000)
| 0 | null | 6,418,825,735,738 | 124 | 6 |
while True:
n,x = map(int,input().split())
if n == 0 and x == 0:
break
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
if j <= i:
continue
k = x-(i+j)
if k > j and k <= n:
ans += 1
print(ans)
|
N=int(input())
A=list(map(int, input().split()))
dp = [[0 for i in range(2)] for j in range(N+1)]
if N in [2, 3]: print(max(A))
else:
dp[2][0] = A[1]
dp[2][1] = A[0]
dp[3][0] = A[2]
dp[3][1] = max(A[1], A[0])
for i in range(4, N+1):
if i % 2 == 0:
dp[i][0] = max(max(dp[i-2][0], dp[i-2][1])+A[i-1], dp[i-1][1]+A[i-1])
dp[i][1] = dp[i-2][1]+A[i-2]
else:
dp[i][0] = max(dp[i-2][0], dp[i-2][1])+A[i-1]
dp[i][1] = max(dp[i-1][0], dp[i-1][1])
print(max(dp[-1][0], dp[-1][1]))
| 0 | null | 19,491,453,996,732 | 58 | 177 |
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
return sys.stdin.readline()[:-1]
mod=10**9+7
n,d,a=map(int,input().split())
xh=[list(map(int,input().split())) for i in range(n)]
xh.sort()
r,tama=[float('inf')]*n,[0]*(n+1)
for i in range(n):
x,h=xh[i]
tmpr=bisect.bisect_left(r,x)
h-=(tama[i]-tama[tmpr])*a
tmp=0
if h>0:
tmp=math.ceil(h/a)
tama[i+1]=tmp
tama[i+1]+=tama[i]
r[i]=x+2*d
print(tama[-1])
# print(r)
|
M = int(input())
A = [int(_) for _ in input().split()]
N = 1000
kabu = 0
if A[0] < A[1]:
kabu, N = divmod(N, A[0])
for a, b, c in zip(A, A[1:], A[2:]):
if a <= b >= c:
N += kabu * b
kabu = 0
elif a >= b <= c:
dkabu, N = divmod(N, b)
kabu += dkabu
N += kabu * A[-1]
print(N)
| 0 | null | 44,645,324,742,924 | 230 | 103 |
import fractions
A,B=map(int,input().split())
def lcm(x,y):
return int((x*y)/fractions.gcd(x,y))
print(lcm(A,B))
|
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
ans = 0
MOD = 10**9+7
for i in range(63):
one, zero = 0, 0
for Aj in A:
if (Aj>>i)&1:
one += 1
else:
zero += 1
ans += 2**i*one*zero
ans %= MOD
print(ans)
| 0 | null | 117,907,605,143,552 | 256 | 263 |
def selection_sort(A):
n = len(A)
swap_cnt = 0
for i in range(n):
mini = i
for j in range(i, n):
if A[j] < A[mini]:
mini = j
if mini != i:
A[i], A[mini] = A[mini], A[i]
swap_cnt += 1
return A, swap_cnt
n = int(input())
A = list(map(int, input().split()))
A, swap_cnt = selection_sort(A)
print(' '.join(list(map(str, A))))
print(swap_cnt)
|
mount = []
for i in range(0, 10):
n = input()
mount.append(n)
mount.sort(reverse = True)
for i in range(0, 3):
print mount[i]
| 0 | null | 10,558,852,480 | 15 | 2 |
# -*- coding: utf-8 -*-
N = int(input())
S = list()
words = {}
for i in range(N):
s = input()
S.append(s)
if s in words:
words[s] += 1
else:
words[s] = 1
max_value = max(words.values())
max_list = list()
for k,v in words.items():
if v == max_value:
max_list.append(k)
ans_list = sorted(max_list)
for ans in ans_list:
print(ans)
|
N = int(input())
d = {}
for i in range(N):
s = input()
if s in d.keys():
d[s] += 1
else:
d[s] = 1
mx = 0
for i in d.values():
mx = max(mx, i)
for i in sorted(d.items()):
if i[1] == mx:
print(i[0])
| 1 | 70,121,482,362,598 | null | 218 | 218 |
bill=[[[0 for i in range(10)]for j in range(3)]for k in range(4)]
n=int(input())
for i in range(n):
b,f,r,v=map(int,input().split())
bill[b-1][f-1][r-1]+=v
for i in range(4):
for j in range(3):
for k in range(10):
if k!=9:
print("",bill[i][j][k],end="")
else:
print("",bill[i][j][k])
if i!=3:
print("#"*20)
|
A = [list(map(int, input().split())) for _ in range(3)]
N = int(input())
b = [int(input()) for _ in range(N)]
field = 0
for v in b:
for i in range(9):
if A[i // 3][i % 3] == v:
field = field | (1 << i)
ans = False
for v in sum([[273,84],sum([[73<<i,7<<i*3]for i in range(3)],[])],[]):
ans = ans or field&v==v;
print('Yes' if ans else 'No')
| 0 | null | 30,652,589,785,130 | 55 | 207 |
n = int(input())
a = list(map(int, input().split()))
x = n//2
if sum(a)/2 == sum(a[:(n//2)]):
print(0)
elif sum(a)/2 >= sum(a[:(n//2)]):
while sum(a)/2 >= sum(a[:x]):
x += 1
print(min(abs(2*sum(a[:x])-sum(a)), abs(2*sum(a[:x-1])-sum(a))))
else:
while sum(a)/2 <= sum(a[:x]):
x -= 1
print(min(abs(2*sum(a[:x])-sum(a)), abs(2*sum(a[:x+1])-sum(a))))
|
N = int(input())
search_max = int(N**0.5)
min_number = 10**12
for x in range(1, search_max + 1):
if N % x == 0:
y = N // x
if x + y < min_number:
min_number = x + y
print(min_number-2)
| 0 | null | 151,975,874,113,910 | 276 | 288 |
while True:
x = input().rstrip('\r\n')
if x == '0':
break
sum = 0
for ii in range(len(x)):
sum += int(x[ii])
print(sum)
|
res = []
while True:
s = input()
if s == '0':
break
res.append(sum([int(x) for x in s]))
for e in res:
print(e)
| 1 | 1,596,872,237,692 | null | 62 | 62 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10 ** 9 + 7
N = int(readline())
A = np.array(read().split(),np.int64)
answer = 0
for n in range(63):
B = (A >> n) & 1
x = np.count_nonzero(B)
y = N - x
x *= y
for _ in range(n):
x *= 2
x %= MOD
answer += x
answer %= MOD
print(answer)
|
import math
import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def main():
X = ii()
print(360//math.gcd(X,360))
if __name__ == "__main__":
main()
| 0 | null | 68,127,957,590,770 | 263 | 125 |
n,m,l=map(int,input().split())
a=[list(map(int,input().split())) for i in range(n)]
b=[list(map(int,input().split())) for i in range(m)]
ans=[[0]* l for i in range(n)]
for i in range(n):
for j in range(l):
for k in range(m):
ans[i][j]+=b[k][j]*a[i][k]
print(*ans[i])
|
n, m, l = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]
b = [list(map(int, input().split())) for i in range(m)]
for i in range(n):
line = []
for j in range(l):
c = 0
for k in range(m):
c += a[i][k] * b[k][j]
line.append(str(c))
print(*line)
| 1 | 1,397,144,940,218 | null | 60 | 60 |
n = int(input())
if n < 10:
print("Yes")
exit(0)
for i in range(2, 10):
if n % i != 0:
continue
v = n // i
if v < 10:
print("Yes")
exit(0)
print("No")
|
#!/usr/bin/env python3
from collections import deque
n = int(input())
connect_list = [[] for _ in range(n)]
ab = [list(map(int, input().split())) for i in range(n-1)]
for i in range(n-1):
a, b = ab[i]
connect_list[a-1].append(b-1)
connect_list[b-1].append(a-1)
color_list = {}
check_list = [0]*n
color_max = max(map(len, connect_list))
vertex = [0 for i in range(n)]
d = deque([0])
while(len(d) > 0):
# print(d)
index = d.pop()
check_list[index] = 1
index_list = connect_list[index]
for i in index_list:
if check_list[i] == 1:
continue
check_list[i] = 1
d.append(i)
num = vertex[index] % color_max+1
color_list[(min(index, i), max(index, i))] = num
vertex[index], vertex[i] = num, num
print(color_max)
for a, b in ab:
print(color_list[(a-1, b-1)])
| 0 | null | 148,470,882,535,098 | 287 | 272 |
list = []
n = int(raw_input())
list = map(int, raw_input().split(' '))
list.reverse()
for i in range(len(list)):
print list[i],
|
n = int(input())
a = [0] * n
x = [0] * n
y = [0] * n
for i in range(n):
a[i] = int(input())
t = [[int(j) for j in input().split()] for k in range(a[i])]
x[i] = [j[0] for j in t]
y[i] = [j[1] for j in t]
mx = 0
for bit in range(1<<n):
flag = True
tf = [0] * n
for i in range(n):
if bit & (1 << i):
tf[i] = 1
for i in range(n):
if tf[i] == 0:
continue
for j in range(a[i]):
if tf[x[i][j]-1] != y[i][j]:
flag = False
if flag: mx = max(mx, bin(bit).count("1"))
print(mx)
| 0 | null | 61,379,085,950,282 | 53 | 262 |
s = input()
if (s == "RRR"):
print(3)
elif (s[0] == s[1] == 'R' or s[1] == s[2] == 'R'):
print(2)
elif (s[0] == 'R' or s[1] == 'R' or s[2] == 'R'):
print(1)
else:
print(0)
|
n = int(input())
s = 0
a = 1
b = 1
while a*b < n:
while a*b < n and b <= a:
if a == b:
s += 1
else:
s += 2
b += 1
a += 1
b = 1
print(s)
| 0 | null | 3,712,756,107,556 | 90 | 73 |
a,b,c,d = map(int,input().split())
ans=[]
for X in [a,b]:
for Y in [c,d]:
ans.append(X*Y)
print(max(ans))
|
def sample(n):
return n * n * n
n = input()
x = sample(n)
print x
| 0 | null | 1,643,605,666,240 | 77 | 35 |
n = int(input())
a = list(map(int, input().split()))
from collections import defaultdict
d = defaultdict(int)
ans=1
for num in a:
if num==0:
last_cnt=3
tmp = last_cnt - d[num]
else:
last_cnt=d[num-1]
tmp = last_cnt - d[num]
if tmp == 0:
# tmp=1
ans=0
ans*=tmp
ans%=1000000007
d[num]+=1
print(ans)
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
cnt = [0] * 3
ans = 1
for x in a:
p = cnt.count(x)
if p == 0:
return print(0)
ans *= p
ans %= MOD
cnt[cnt.index(x)] += 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 130,240,548,594,752 | null | 268 | 268 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
def main():
from math import ceil
n, m, *a = map(int, open(0).read().split())
c = 0
t = a[0]
while t % 2 == 0:
c += 1
t = t // 2
for x in a[1:]:
d = 0
while x % 2 == 0:
d += 1
x = x // 2
if d != c:
print(0)
break
t = lcm(t, x)
else:
ans = ceil(m // 2 ** (c-1) // t / 2)
print(ans)
if __name__ == "__main__":
main()
|
import math
import numpy as np
N,M=map(int,input().split())
A=list(map(int,input().split()))
c=1
test=A[0]
l=0
while test%2 == 0:
test=test//2
c*=2
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
for i in np.arange(N-1):
if A[i+1]%c!=0:
print(0)
l=1
break
elif A[i+1]%(c*2)==0:
print(0)
l=1
break
else:
k=A[i+1]//c
test=lcm_base(test, k)
if l==0:
k=test*c//2
print(M//k//2 + M//k%2)
| 1 | 101,799,650,601,760 | null | 247 | 247 |
n=int(input())
l=list(map(int,input().split()))
la=[0]*n
for i in range(n):
la[l[i]-1]=i+1
ans=[str(j) for j in la]
ans=" ".join(ans)
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
d = []
for n in range(N):
d.append([A[n], n])
d = sorted(d, key=lambda x:x[0])
for i, j in d:
print(j+1, end=" ")
| 1 | 181,400,855,023,040 | null | 299 | 299 |
N = int(input())
ans = set()
for i in range(N):
ans.add(input())
print(len(ans))
|
n = int(input())
m = {}
for i in range(n):
s = input()
m[s] = True
print(len(m))
| 1 | 30,283,985,719,608 | null | 165 | 165 |
def isPrime(n):
if n == 2 or n == 3:
return True
elif n == 1 or n % 2 == 0 or n % 3 == 0:
return False
N = int(n ** 0.5)
for i in range(5, N + 1, 2):
if n % i == 0:
return False
return True
N = int(input())
ans = 0
for _ in range(N):
a = int(input())
ans += 1 if isPrime(a) else 0
print(ans)
|
import math
n = int(raw_input())
cnt = 0
for i in range(n):
j = 2
num = int(raw_input())
while j <= math.sqrt(num):
if num % j == 0:
break
j+=1
if j > math.sqrt(num):
cnt+=1
print cnt
| 1 | 9,605,956,822 | null | 12 | 12 |
import sys,math
input = sys.stdin.readline
A,B,C,D=list(map(int,input().split()))
if math.ceil(C/B) <= math.ceil(A/D):
print('Yes')
else:
print('No')
|
import itertools
N, X, Y = map(int, input().split())
# 距離が0,1,2,...,n-1のパスの本数
l = [0] * N
# 1,2,...,Nから2つを選ぶ組み合わせ
# 生成される組み合わせ(i,j)は既にi<jになっている
comb = itertools.combinations(range(1, N + 1), 2)
# (直接iとjを繋ぐ)or(特殊なパスを通る)の２種類が考えられる
# 両方計算してminを取れば欲しい距離が得られる
for v in comb:
min_dist = min(v[1] - v[0], abs(X - v[0]) + 1 + abs(Y - v[1]))
l[min_dist] += 1
# 距離が1,2,3,...,N-1について総数を出力
for item in l[1:]:
print(item)
| 0 | null | 37,051,695,851,162 | 164 | 187 |
n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
else:
ans += 1
print(ans / n)
|
N = int(input())
if N % 2 == 0:
print((N // 2) / N)
else:
print(-(-N // 2) / N)
| 1 | 177,504,948,681,440 | null | 297 | 297 |
n = int(input())
d = [list(map(int,input().split())) for i in range(n)]
count = 0
# [[1, 1], [2, 2], [3, 3], [4, 4], [5, 5], [6, 6]]
for i in d:
if i[0] == i[1]:
count += 1
else:
count = 0
if count == 3:
print('Yes')
exit()
print('No')
|
li = []
for i in range(2):
a,b = map(int, input().split())
li.append(a)
if li[1] == li[0]+1:
print(1)
else:
print(0)
| 0 | null | 63,161,086,485,980 | 72 | 264 |
S = input()
N = len(S)
ans = 0
i = 0
while i < N and S[i]=='>':
i += 1
ans += i*(i+1)//2
arr = [i]
while i < N:
while i < N and S[i]=='<':
i += 1
arr.append(i)
if i==N: break
while i < N and S[i]=='>':
i += 1
arr.append(i)
arr = [b-a for a,b in zip(arr,arr[1:])]
for a,b in zip(arr[::2],arr[1::2]):
if a<b: a,b = b,a
ans += a*(a+1)//2
ans += b*(b-1)//2
if len(arr)%2:
ans += arr[-1]*(arr[-1]+1)//2
print(ans)
|
def r(i):
indr = s.find('<', i)
return indr - i if indr != -1 else n - i - 1
def l(i):
indl = s.rfind('>', 0, i)
return i - indl -1 if indl != -1 else i
s = input()
n = len(s) + 1
print(sum([max(r(i), l(i)) for i in range(n)]))
| 1 | 157,135,497,554,240 | null | 285 | 285 |
N, K = map(int, input().split())
dic = {}
dic['s'], dic['p'], dic['r'] = map(int, input().split())
T = input()
score = [0]*N
for i in range(N):
if i>=K and T[i]==T[i-K] and score[i-K]>0:
continue
score[i] = dic[T[i]]
print(sum(score))
|
n,a,b,=map(int,input().split())
c = n//(a+b)
da = n-c*(a+b)
if da>a:
da=a
print(c*a+da)
| 0 | null | 81,304,586,899,300 | 251 | 202 |
import numpy as np
raw = input()
rawl = raw.split()
A = int(rawl[0])
B = int(rawl[1])
H = int(rawl[2])
M = int(rawl[3])
theta = 2*np.pi*(H/12+M/720-M/60)
print((A*A+B*B-2*A*B*np.cos(theta))**(0.5))
|
def main():
x = int(input())
cnt = x // 100
m, M = cnt * 100, cnt * 105
if m <= x <= M:
print(1)
else:
print(0)
if __name__ == "__main__":
main()
| 0 | null | 73,631,498,789,366 | 144 | 266 |
d,t,s=map(int,input().split())
print("YNeos"[s*t<d::2])
|
import sys
A, B, C, D = (int(x) for x in input().split())
while A>0 and C>0:
C-=B
if C<=0:
print("Yes")
sys.exit(0)
A-=D
if A<=0:
print("No")
| 0 | null | 16,518,688,053,384 | 81 | 164 |
N,X,Y=map(int,input().split())
d=[0]*N
for i in range(N):
for j in range(i+1,N):d[min(j-i,abs(X-1-i)+abs(Y-1-j)+1)]+=1
for i in d[1:]:print(i)
|
N,X,Y=map(int,input().split())
d=[0]*N
for i in range(N):
for j in range(N):
if not i<j:
continue
dist=min([j-i,abs((X-1)-i)+1+abs(j-(Y-1))])
d[dist]+=1
print(*d[1:],sep='\n')
| 1 | 44,225,021,530,272 | null | 187 | 187 |
#!/usr/bin/env python3
n, a, b = map(int, input().split())
if (b - a) % 2 < 1:
print((b - a) // 2)
else:
print(min((a + b - 1) // 2, (2 * n - a - b + 1) // 2))
|
n,a,b = map(int,input().split())
if (b - a)%2 == 0:
x = (b - a)//2
y = min(max(a-1,b-1),max(n-a,n-b))
print(min(x,y))
else:
p = max(a-1,b-1)
q = max(n-a,n-b)
r = a-1+1+(b-(a-1)-1-1)//2
s = n-b+1+(n-(n-b+1)-a)//2
#print(p,q,r,s)
print(min(p,q,r,s))
| 1 | 109,320,290,208,454 | null | 253 | 253 |
x,y,a,b,c=map(int,input().split())
R=sorted(map(int,input().split()),reverse=True)
G=sorted(map(int,input().split()),reverse=True)
N=sorted(map(int,input().split()),reverse=True)
L=sorted(R[:x]+G[:y]+N[:(x+y)],reverse=True)
print(sum(L[:(x+y)]))
|
n, m, l = map(int, input().split())
A = []
for g in range(n):
A.append(list(map(int, input().split())))
B = []
for h in range(m):
B.append(list(map(int, input().split())))
for i in range(n):
output = []
for j in range(l):
temp = 0
for k in range(m):
temp += A[i][k] * B[k][j]
output.append(temp)
print(*output)
| 0 | null | 23,203,322,058,528 | 188 | 60 |
# -*- coding: utf-8 -*-
"""
Created on Fri Jun 16 18:45:04 2017
@author: syaga
"""
if __name__ == "__main__":
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
max = a[1] - a[0]
mini = a[0]
for i in range(1, len(a)):
diff = a[i] - mini
if diff > max:
max = diff
if mini > a[i]:
mini = a[i]
print(max)
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
6
5
3
1
3
4
3
output:
3
"""
import sys
def solve():
# write your code here
max_profit = -1 * float('inf')
min_stock = prices[0]
for price in prices[1:]:
max_profit = max(max_profit, price - min_stock)
min_stock = min(min_stock, price)
return max_profit
if __name__ == '__main__':
_input = sys.stdin.readlines()
p_num = int(_input[0])
prices = list(map(int, _input[1:]))
print(solve())
| 1 | 12,304,078,400 | null | 13 | 13 |
import math
from collections import defaultdict,deque
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
def fast_expo(x,y,m):
res=1
while(y):
if(y&1):
res*=x
res%=m
x*=x
x%=m
y>>=1
return res
dp=defaultdict(int)
dp[1]=1
dp[2]=1
for i in range(3,200001):
k=i
cnt=0
while(k):
if(k%2): cnt+=1
k>>=1
dp[i]=dp[i%cnt]+1
n=ii()
a=ip()
a=a[::-1]
c=a.count('1')
min_1=0
max_1=0
for i in range(n):
if(a[i]=='1'):
if(c-1!=0):
min_1+=fast_expo(2,i,c-1)
min_1%=(c-1)
max_1+=fast_expo(2,i,c+1)
max_1%=(c+1)
ans=[]
for i in range(n):
if(a[i]=='1'):
if(c-1==0):
ans.append(0)
else:
ans.append(dp[(min_1-fast_expo(2,i,c-1)+(c-1))%(c-1)]+1)
else:
ans.append(dp[(max_1+fast_expo(2,i,c+1))%(c+1)]+1)
ans=ans[::-1]
for i in ans:
print(i)
|
from collections import defaultdict
n,x = open(0).read().split()
n = int(n)
cnt = x.count('1')
digits = list(map(int, list(x)))
x = int(x, 2)
d = defaultdict(int)
d[0] = 0
def calc(m):
if m not in d:
nxt = m % bin(m).count('1')
d[m] = calc(nxt) + 1
return d[m]
mmod = cnt - 1
pmod = cnt + 1
if mmod:
mx = x % mmod
px = x % pmod
mbase = 1
pbase = 1
ans = []
while digits:
digit = digits.pop()
if digit and not mmod:
ans.append(0)
else:
if digit:
nx = (mx - mbase)%mmod
else:
nx = (px + pbase)%pmod
ans.append(calc(nx) + 1)
if mmod > 0:
mbase = (mbase * 2) % mmod
pbase = (pbase * 2) % pmod
while ans:
print(ans.pop())
| 1 | 8,282,983,285,500 | null | 107 | 107 |
N = int(input())
S = input()
if S[:int(N/2)] == S[int(N/2):N]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
ans = 'No'
if len(S) % 2 == 0 and S[0:int(N/2)] == S[int(N/2):N]:
ans = 'Yes'
print(ans)
| 1 | 146,768,567,582,832 | null | 279 | 279 |
# -*- coding: utf-8 -*-
n = int(input())
t_point, h_point = 0, 0
for i in range(n):
t_card, h_card = map(str, input().split())
if t_card == h_card:
t_point += 1
h_point += 1
elif t_card > h_card:
t_point += 3
elif t_card < h_card:
h_point += 3
print('{0} {1}'.format(t_point, h_point))
|
def main():
H = int( input())
W = int( input())
N = int( input())
if H < W:
H, W = W, H
ans = N//H
if N%H != 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 45,399,802,911,524 | 67 | 236 |
class SegmentTree:
def __init__(self,n,ele=0):
self.ide_ele = ele
self.num =2**(n-1).bit_length()
self.seg=[self.ide_ele]*2*self.num
def segfunc(self,x,y):
return x|y
def init(self,init_val):
for i in range(len(init_val)):
self.seg[i+self.num-1]=init_val[i]
for i in range(self.num-2,-1,-1) :
self.seg[i]=self.segfunc(self.seg[2*i+1],self.seg[2*i+2])
def update(self,k,x):
k += self.num-1
if self.seg[k]==x:
return 0
self.seg[k] = x
while k:
k = (k-1)//2
self.seg[k] = self.segfunc(self.seg[k*2+1],self.seg[k*2+2])
def query(self,p,q):
if q<=p:
return self.ide_ele
p += self.num-1
q += self.num-2
res=self.ide_ele
while q-p>1:
if p&1 == 0:
res = self.segfunc(res,self.seg[p])
if q&1 == 1:
res = self.segfunc(res,self.seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.segfunc(res,self.seg[p])
else:
res = self.segfunc(self.segfunc(res,self.seg[p]),self.seg[q])
return res
N,S,Q=int(input()),input(),int(input())
d={'a': 1, 'b': 2, 'c': 4, 'd': 8, 'e': 16, 'f': 32, 'g': 64, 'h': 128, 'i': 256, 'j': 512, 'k': 1024, 'l': 2048, 'm': 4096, 'n': 8192, 'o': 16384, 'p': 32768, 'q': 65536, 'r': 131072, 's': 262144, 't': 524288, 'u': 1048576, 'v': 2097152, 'w': 4194304, 'x': 8388608, 'y': 16777216, 'z': 33554432}
initial=[d[c] for c in list(S)]
ST=SegmentTree(N)
ST.init(initial)
for _ in range(Q):
typ,a,b=input().split()
if typ=='1':
i,c=int(a),d[b]
ST.update(i-1,c)
else:
l,r=int(a)-1,int(b)
x=bin(ST.query(l,r))[2:]
print(sum(map(int,list(x))))
|
a, b = input().split()
na = int(a)
nb = int(b)
sa = a * nb
sb = b * na
print(sa if sa < sb else sb)
| 0 | null | 73,565,003,423,360 | 210 | 232 |
# AtCoder Beginner Contest 148
# D - Brick Break
N=int(input())
a=list(map(int,input().split()))
targetnum=1
breaknum=0
for i in range(N):
if a[i]==targetnum:
targetnum+=1
else:breaknum+=1
if breaknum==N:
print(-1)
else:
print(breaknum)
|
N=int(input())
alst=list(map(int,input().split()))
i=1
for a in alst:
if a==i:
i+=1
i-=1
if i>0:
print(N-i)
else:
print(-1)
| 1 | 114,792,871,842,252 | null | 257 | 257 |
H, W = map(int, input().split())
dp = [[H*W for __ in range(W)] for _ in range(H)]
dh = [1, 0]
dw = [0, 1]
S = []
for i in range(H):
s = input()
S.append(s)
if (S[0][0] == '#'):
dp[0][0] = 1
else:
dp[0][0] = 0
for i in range(H):
for j in range(W):
for k in range(2):
nh = i + dh[k]
nw = j + dw[k]
if nh >= H or nw >= W:
continue
add = 0
if (S[nh][nw] == "#" and S[i][j] == "."):
add = 1
dp[nh][nw] = min(dp[nh][nw], dp[i][j] + add)
print(dp[H-1][W-1])
|
n,a,b = map(int, input().split())
if (b-a)%2==0: print((b-a)//2)
else: print(min(a-1, n-b)+ 1 + (b-a-1)//2)
| 0 | null | 79,396,616,459,804 | 194 | 253 |
A,B = map(int,input().split())
print(A - 2*B if A > 2*B else 0)
|
i=1
x = input()
while(x != "0"):
print("Case {0}: {1}".format(i, x))
i += 1
x = input()
| 0 | null | 83,384,837,224,470 | 291 | 42 |
A,B,C,K=map(int,input().split())
ans=1*min(A,K)
K=max(0,K-A-B)
print(ans-(1*K))
|
import numpy as np
name = input()
print(name[:3])
| 0 | null | 18,305,993,264,152 | 148 | 130 |
def ra(a): #圧縮された要素を非保持
ll,l=[],1
for i in range(len(a)-1):
if a[i]==a[i+1]:
l+=1
else:
ll.append(l)
l=1
ll.append(l)
return ll
n=input()
print(len(ra(input())))
|
h, w, k = map(int, input().split())
S = []
for i in range(h):
s = str(input())
S.append(s)
Ans = [[False for _ in range(w)] for _ in range(h)]
now = 1
for i in range(h):
for j in range(w):
if S[i][j] == '#':
Ans[i][j] = now
now += 1
for i in range(h):
now = False
for j in range(w):
if now == False and Ans[i][j] == False:
continue
elif now != False and Ans[i][j] == False:
Ans[i][j] = now
elif Ans[i][j] != False:
now = Ans[i][j]
for i in range(h):
now = False
for j in range(w-1, -1, -1):
if now == False and Ans[i][j] == False:
continue
elif now != False and Ans[i][j] == False:
Ans[i][j] = now
elif Ans[i][j] != False:
now = Ans[i][j]
now = False
for i in range(h):
if now == False and Ans[i].count(False) == w:
continue
elif now != False and Ans[i].count(False) == w:
Ans[i] = now
elif Ans[i].count(False) != w:
now = Ans[i]
now = False
for i in range(h-1, -1, -1):
if now == False and Ans[i].count(False) == w:
continue
elif now != False and Ans[i].count(False) == w:
Ans[i] = now
elif Ans[i].count(False) != w:
now = Ans[i]
for i in range(h):
print(' '.join(map(str, Ans[i])))
| 0 | null | 156,378,625,712,188 | 293 | 277 |
def linearSearch(key, list, N):
l = list + [key]
i = 0
while l[i] != key:
i += 1
return int(i != N)
N1 = int(input())
arr1 = [int(n) for n in input().split()]
N2 = int(input())
arr2 = [int(n) for n in input().split()]
print(sum([linearSearch(key, arr1, N1) for key in arr2]))
|
n=int(input())
lista=[0 for i in range(n)]
lista=input().split()
n2=int(input())
listb=[0 for i in range(n2)]
listb=input().split()
cnt=0
for i in range(n2):
x=0
for j in range(n):
if listb[i]==lista[j] and x==0:
x=1
cnt+=1
print(cnt)
| 1 | 69,232,045,060 | null | 22 | 22 |
a = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51".split(",")
k = int(input()) # 5
print(a[k-1])
|
S = ['0'] + list(input()) + ['0']
N = len(S)
flag = False
ans = 0
for i in range(N - 1, 0, -1):
j = int(S[i])
if flag:
j += 1
S[i] = j
if j <= 5:
if j == 5 and int(S[i - 1]) >= 5:
ans += j
flag = True
else:
ans += j
flag = False
else:
ans += 10 - j
flag = True
if flag:
ans += 1
# print (ans)
count = 0
for s in S:
if s == 5:
count += 1
else:
ans -= max(0, count - 2)
count = 0
print (ans)
| 0 | null | 60,354,820,225,700 | 195 | 219 |
import sys
from collections import deque
N = int(sys.stdin.readline())
lines = sys.stdin.readlines()
l = deque()
for i in range(N):
command = lines[i].split()
if command[0] == 'deleteFirst':
l.popleft()
elif command[0] == 'deleteLast':
l.pop()
elif command[0] == 'insert':
l.appendleft(command[1])
else:
if command[1] in l:
l.remove(command[1])
print(' '.join(map(str, l)))
|
import math
n = int(input())
# 1以外のNの約数
divisors = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
divisors.append(i)
if i ** 2 != n:
divisors.append(n // i)
divisors.sort()
candidates = set()
for k in divisors[1:]:
tmp = n
while True:
if tmp % k != 0:
break
tmp = tmp // k
if (tmp - 1) % k == 0:
candidates.add(k)
# N-1の約数
divisors = []
for i in range(1, int(math.sqrt(n-1)) + 1):
if (n-1) % i == 0:
divisors.append(i)
if i ** 2 != n-1:
divisors.append((n-1) // i)
for k in divisors[1:]:
candidates.add(k)
print(len(candidates))
| 0 | null | 20,706,050,814,240 | 20 | 183 |
N = int(input())
a = []
for i in range(N):
a.append(input())
a = sorted(a)
count = 0
count_list=[]
b = []
for i,k in enumerate(a):
if i == 0:
continue
if k == a[i-1]:
count+=1
else:
count_list.append(count)
b.append(a[i-1])
count = 0
if i==N-1:
count_list.append(count)
b.append(a[i])
maxi = 0
maxi_list =[]
for i,k in enumerate(count_list):
if maxi <k:
maxi_list.clear()
maxi_list.append(b[i])
maxi = k
elif maxi == k:
maxi_list.append(b[i])
else:
continue
for i in maxi_list:
print(i)
|
def bubble_sort(A):
cnt = 0
for i in range(len(A) - 1):
for j in reversed(range(i+1, len(A))):
if A[j] < A[j - 1]:
cnt += 1
tmp = A[j]
A[j] = A[j - 1]
A[j - 1] = tmp
return cnt
cnt = 0
amount = int(input())
nl = list(map(int, input().split()))
cnt = bubble_sort(nl)
for i in range(amount - 1):
print(nl[i], end=" ")
print(nl[amount - 1])
print(cnt)
| 0 | null | 35,173,315,224,160 | 218 | 14 |
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
ti :
identity element of the monoid
"""
self.f = f
self.ti = ti
self.n = n = 2**(len(array).bit_length())
self.dat = dat = [ti] * n + array + [ti] * (n - len(array))
for i in range(n - 1, 0, -1): # build
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def update(self, p, v): # set value at position p (0-indexed)
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
p >>= 1
dat[p] = f(dat[p << 1], dat[p << 1 | 1])
def query(self, l, r): # result on interval [l, r) (0-indexed)
f, ti, n, dat = self.f, self.ti, self.n, self.dat
res = ti
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(dat[r], res)
l >>= 1
r >>= 1
return res
N, M = [int(_) for _ in input().split()]
S = [i if v == '0' else 10**5 + 5 for i, v in enumerate(input())]
ST = SegmentTree(S, min, 10**5 + 5)
i = N
ans = [i]
while i:
i2 = ST.query(max(0, i - M), i)
if i2 == 10**5 + 5:
print(-1)
exit()
i = i2
ans += [i]
ans = ans[::-1]
print(' '.join(str(b - a) for a, b in zip(ans, ans[1:])))
|
from math import ceil,floor
A,B=map(int,input().split())
x_min=int(min(ceil(A/0.08)-5, ceil(B/0.1)-5))
x_max=int(max(ceil((A+1)/0.08)+5, ceil((B+1)/0.1)+5))
exists=0
for i in range(x_min, x_max):
if floor(i*0.08)==A and floor(i*0.1)==B:
print(i)
exists=1
break
if not exists:print(-1)
| 0 | null | 97,717,252,081,570 | 274 | 203 |
total = 0
for ch in input().strip():
total = (total + int(ch)) % 9
print('No' if total else 'Yes')
|
s=input()
t=input()
l=len(s)
ans=0
for i in range(l):
if s[i]==t[i]:
ans+=1
print(l-ans)
| 0 | null | 7,443,654,231,008 | 87 | 116 |
def main():
n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int, input().split())
a_list.append(a)
b_list.append(b)
a_sorted = list(sorted(a_list))
b_sorted = list(sorted(b_list))
if n%2:
print(b_sorted[n//2]-a_sorted[n//2]+1)
else:
print((b_sorted[n//2-1]+b_sorted[n//2]-a_sorted[n//2-1]-a_sorted[n//2])+1)
if __name__ == "__main__":
main()
|
N = int(input())
A = [int(i) for i in input().split()]
def bubbleSort(A, N):
count = 0
flag = 1
while flag:
flag = 0
for i in range(N-1, 0, -1):
if A[i] < A[i-1]:
tmp = A[i]
A[i] = A[i-1]
A[i-1] = tmp
flag = 1
count += 1
return A, count
A, count = bubbleSort(A, N)
print(' '.join([str(i) for i in A]))
print(count)
| 0 | null | 8,741,285,286,272 | 137 | 14 |
n, m = map(int, raw_input().split())
a = []
for _ in range(n):
a.append(map(int, raw_input().split()))
b = []
for _ in range(m):
b.append(int(raw_input()))
for i in range(n):
c = []
for j in range(m):
c.append(a[i][j]*b[j])
print sum(c)
|
nm = list(map(lambda x:int(x),input().split(" ")))
a = list()
b = list()
count = nm[0]
while count > 0:
a += list(map(lambda x:int(x), input().split(" ")))
count -= 1
count = nm[1]
while count > 0:
b += {int(input())}
count -= 1
for m in range(nm[0]):
c = 0
for k in range(nm[1]):
c += a[k+m*nm[1]]*b[k]
print(c)
| 1 | 1,148,347,592,550 | null | 56 | 56 |
import sys
readline = sys.stdin.readline
H1,M1,H2,M2,K = map(int,readline().split())
print(max(0,(H2 * 60 + M2) - (H1 * 60 + M1 + K)))
|
h,n = map(int,input().split())
arr=list(map(int,input().split()))
print("No" if h>sum(arr) else "Yes")
| 0 | null | 47,858,496,488,812 | 139 | 226 |
"""
n=int(input())
s=[int(x) for x in input().split()]
q=int(input())
t=[int(x) for x in input().split()]
#print(s)
c=0
for i in t:
if i in s:
c+=1
print(c)
"""
"""
n=int(input())
s=[int(x) for x in input().split()]
q=int(input())
t=[int(x) for x in input().split()]
#binary search
a=0
for i in range(q):
L=0
R=n-1#探索する方の配列(s)はソート済みでないといけない
while L<=R:
M=(L+R)//2
if s[M]<t[i]:
L=M+1
elif s[M]>t[i]:
R=M-1
else:
a+=1
break
print(a)
"""
#Dictionary
#dict型オブジェクトに対しinを使うとキーの存在確認になる
n=int(input())
d={}
for i in range(n):
command,words=input().split()
if command=='find':
if words in d:
print('yes')
else:
print('no')
else:
d[words]=0
|
import sys
n = int(sys.stdin.readline())
dict = {}
for _ in range(n):
op, key = input().split()
if op == "insert":
dict[key] = "insert"
continue
if op == "find":
print("yes") if key in dict.keys() else print("no")
| 1 | 79,654,007,590 | null | 23 | 23 |
from collections import defaultdict
from math import gcd
def main():
mod = 10 ** 9 + 7
worst_iwashi_count = 0
ans = 1
d = defaultdict(int)
N = int(input())
for _ in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
worst_iwashi_count += 1
elif a == 0:
d[(0, -1)] += 1
elif b == 0:
d[(1, 0)] += 1
else:
g = gcd(abs(a), abs(b))
if a * b > 0:
d[(abs(a // g), abs(b // g))] += 1
else:
d[(abs(a // g), -abs(b // g))] += 1
done_set = set()
for a, b in list(d):
if (a, b) in done_set:
continue
x = d[(a, b)]
done_set.add((a, b))
if b >= 0:
y = d[(b, -a)]
done_set.add((b, -a))
else:
y = d[(-b, a)]
done_set.add((-b, a))
ans *= 2 ** x + 2 ** y - 1
ans %= mod
ans += worst_iwashi_count - 1
print(ans % mod)
if __name__ == '__main__':
main()
|
while True:
card = str(input())
if card == '-':
break
S = int(input())
for i in range(S):
h = int(input())
card = card[h:] + card[:h]
print(card)
| 0 | null | 11,466,825,812,608 | 146 | 66 |
while True:
cards=input()
if cards=="-":break
for i in range(int(input())):
h=int(input())
cards=cards[h:]+cards[:h]
print(cards)
|
while True:
x=input()
if x == "-":
break
y=int(input())
for i in range(y):
z=int(input())
x=x[z:]+x[:z]
print(x)
| 1 | 1,889,957,206,770 | null | 66 | 66 |
M_1, D_1 = map(int, input().split(" "))
M_2, D_2 = map(int, input().split(" "))
print(0 if M_1 == M_2 else 1)
|
a,b=input().split()
c,d=input().split()
b=int(b)
d=int(d)
if d-b==1:
print("0")
else:
print("1")
| 1 | 124,344,450,964,172 | null | 264 | 264 |
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 11:05:00 2020
@author: liang
"""
"""
片側を固定して、それぞれのケースに対して最適解を求める
それぞれのケースについて
index(b_i) =< index(b_i-1)
であるから、bの最大値bestを保存して探索することで重複探索を回避できる
"""
N, M, K = map(int, input().split())
A = [0] + [int(x) for x in input().split()]
B = [0] + [int(x) for x in input().split()]
s_b = 0
for i in range(M+1):
s_b += B[i]
if s_b > K:
s_b -= B[i]
best = i - 1
break
else:
best = M
res = best
#print(res)
s_a = 0
for i in range(N+1):
# print("i", i)
s_a += A[i]
if s_a > K:
break
for j in reversed(range(best+1)):
#print("j",j)
if s_b <= K - s_a:
if i + j > res:
res = i + j
best = j
#print(i, j, s_a, s_b)
break
else:
s_b -= B[j]
print(res)
|
n = input().split(" ")
print(int(n[0]) * int(n[1]))
| 0 | null | 13,277,215,819,448 | 117 | 133 |
n=list(map(int,input()))
if n[-1] in [2,4,5,7,9]:
print('hon')
elif n[-1] in [0,1,6,8]:
print('pon')
else:
print('bon')
|
X=input()
X=int(X)
if X >= 30:
print('Yes')
else:
print('No')
| 0 | null | 12,595,414,603,292 | 142 | 95 |
def resolve():
import math
H, A = map(int, input().split())
print(math.ceil(H/A))
resolve()
|
H,A = map(int,input().split())
b = H // A
c = H % A
if c != 0:
b += 1
print(b)
| 1 | 76,763,817,478,152 | null | 225 | 225 |
x = int(input())
def answer(x: int) -> int:
ans = 1000 * (x // 500)
x %= 500
ans += 5 * ((x - 500 * (x // 500)) // 5)
return ans
print(answer(x))
|
X = int(input())
happy = 0
happy += (X // 500) * 1000
X %= 500
happy += (X // 5) * 5
print(happy)
| 1 | 42,780,281,522,460 | null | 185 | 185 |
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
from collections import deque,defaultdict,Counter
def main():
N = int(input())
G = [[] for _ in range(N)]
for i in range(N):
A = list(map(int,input().split()))
for a in A[2:]:
a -= 1
G[i].append(a)
q = deque([0])
dist = [-1] * N
dist[0] = 0
while q:
v = q.popleft()
for e in G[v]:
if dist[e] >= 0:
continue
dist[e] = dist[v] + 1
q.append(e)
ans = [(i + 1,dist[i]) for i in range(N)]
for t in ans:
print(*t)
if __name__ == '__main__':
main()
|
import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
N = int(input())
edge = {}
for _ in range(N):
tmp = inpl()
u, k = tmp[:2]
edge[u] = tmp[2:]
d = {i: -1 for i in range(1, N + 1)}
d[1] = 0
Q = deque()
Q.append(1)
while Q:
v = Q.popleft()
for nv in edge[v]:
if d[nv] != -1:
continue
d[nv] = d[v] + 1
Q.append(nv)
for i in range(1, N + 1):
print(i, d[i])
| 1 | 4,481,324,630 | null | 9 | 9 |
# 二分探索を利用した
N, M = map(int, input().split())
tmp = input().split()
A = [int(tmp[i]) for i in range(N)]
A.sort()
cum_A = [None]*N
cum_A[N-1] = A[N-1]
for i in range(1,N):
cum_A[N-1-i] = cum_A[N-i] + A[N-1-i]
cum_A.append(0)
def geq(A, cum_A, X, N): # ある定数X以上になる握手の方法が何通りあるか,Aは昇順sort済み
sum = 0
val = 0
index = 0
for i in range(N):
while True:
if index != N and A[i] + A[N - 1 - index] >= X:
index += 1
else:
sum += index
val += A[i] * index + cum_A[N-index]
break
return sum, val
# 2<=X<=2*Nで二分探索をする
low = 2
high = 2*A[N-1]
while low <= high:
X = (low + high)//2
sum, val = geq(A, cum_A, X, N)
if sum == M:
break
elif sum > M:
low = X+1
else:
high = X-1
if sum < M:
X -= 1
sum, val = geq(A, cum_A, X, N)
ans = val - X*(sum-M)
print(ans)
|
flag = "go"
cnt = 0
while flag == "go":
cnt += 1
x = int(input())
if x == 0:
flag = "stop"
else:
print("Case " + str(cnt) + ": " + str(x))
| 0 | null | 54,449,025,551,728 | 252 | 42 |
list_data = input().split(" ")
if int(list_data[0]) > int(list_data[1]) * int(list_data[2]):
print("No")
else:
print("Yes")
|
#輸入字串並分隔，以list儲存
str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))
#print(num) #D,T,S
#若T<(D/S)->遲到
if num[1] >= (num[0]/num[2]):
print("Yes")
else:
print("No")
| 1 | 3,518,145,724,450 | null | 81 | 81 |
x,y,z = map(int,input().split())
temp = x
x = y
y = temp
temp = x
x = z
z = temp
print(x,y,z)
|
x, y, z = map(int, input().split())
print(z, end='')
print(" ", end='')
print(x, end='')
print(" ", end='')
print(y, end='')
| 1 | 38,115,846,367,478 | null | 178 | 178 |
x = int(input())
b = 100
n = 0
while b < x:
b = b + b // 100
n += 1
print(n)
|
x = int(input())
taka = 100
count = 0
while taka < x:
taka = taka * 101 // 100
count += 1
print(count)
| 1 | 27,172,101,873,046 | null | 159 | 159 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,k = inpl()
now = inpl()
for _ in range(k):
pre = now[::]
cnt = [0] * (n+1)
for i in range(n):
l = max(0, i - pre[i])
r = min(n, i + pre[i] + 1)
cnt[l] += 1
cnt[r] -= 1
# print(cnt)
now = [0] * n
now[0] = cnt[0]
for i in range(1,n):
now[i] = now[i-1] + cnt[i]
if min(now) == n:
break
print(*now)
|
lines = list(input())
total = 0
size = 0
stack = []
ponds = []
size = 0
for i in range(len(lines)):
if lines[i] == "\\":
stack.append(i)
elif lines[i] == "/":
if not stack == []:
left_index = stack.pop()
size = i - left_index
target_index = left_index
#order is tricky
while not ponds == [] and ponds[-1][0] > left_index:
direct = ponds.pop()
target_index = direct[0]
size += direct[1]
ponds.append([target_index,size])
ans = []
ans.append(len(ponds))
for _ in ponds:
ans.append(_[1])
print(sum(ans[1:]))
print(" ".join(map(str,ans)))
| 0 | null | 7,681,399,057,750 | 132 | 21 |
#!/usr/bin/env python
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
ma = a[-1]
dup = [0 for _ in range(ma+1)]
div = [0 for _ in range(ma+1)]
for i in range(n):
dup[a[i]] += 1
#print('dup =', dup)
for i in range(n):
for j in range(a[i], ma+1, a[i]):
div[j] += 1
#print('div =', div)
ans = 0
for i in range(n):
if div[a[i]] == 1:
ans += 1
print(ans)
|
N = int(input())
A = list(map(int,input().split()))
flag = True
ans = 0
for i in range(N):
flag = False
for j in range(N-1,i,-1):
if A[j] < A[j-1]:
A[j],A[j-1] = A[j-1],A[j]
flag = True
ans += 1
if not flag:
break
print(*A)
print(ans)
| 0 | null | 7,270,936,385,570 | 129 | 14 |
S = input()
T = input()
ans = 1e10
for i in range(len(S)):
if i+len(T) > len(S):
break
cnt = 0
for j in range(len(T)):
if S[i+j] != T[j]:
cnt += 1
ans = min(cnt, ans)
print(ans)
|
import sys
def input():
return sys.stdin.readline().strip()
def main():
def make_factorial_table(n):
result = [0] * (n+1)
result[0] = 1
for i in range(1,n+1):
result[i] = result[i-1] * i % mod
return result
def nCr(n,r):
return fact[n] * pow(fact[n-r],mod-2,mod) * pow(fact[r],mod-2,mod) % mod
K = int(input())
S = input()
mod = 10 ** 9 + 7
n = len(S)
ans = 0
fact = make_factorial_table(n+K+1)
for i in range(K+1):
tmp = pow(25,i,mod)
tmp *= nCr(i+n-1,n-1)
tmp *= pow(26,K-i,mod)
ans += tmp
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 8,203,109,202,652 | 82 | 124 |
n = int(input())
alphabets = [chr(ord('a') + x) for x in range(26)]
tmp = []
def dfs(s, i):
if len(s) == n:
yield s
return
for j in range(i):
for k in dfs(s+alphabets[j], i):
yield k
for k in dfs(s+alphabets[i], i+1):
yield k
for w in dfs('', 0):
print(w)
|
n = int(input())
alp = [chr(ord("a") + x) for x in range(26)]
def dfs(S):
if len(S) == n:
print(S)
else:
max_s = ord(max(S)) - 96
#print(max_s)
for i in range(max_s + 1):
dfs(S + alp[i])
dfs("a")
| 1 | 52,526,257,760,522 | null | 198 | 198 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def ok(t, s):
N = len(t)
for i in range(N):
if t[i]:
for x, y in s[i]:
if y == 1:
if not t[x]:
return False
elif y == 0:
if t[x]:
return False
return True
def solve():
N = int(input())
s = defaultdict(list)
for i in range(N):
A = int(input())
for _ in range(A):
X, Y = map(int, input().split())
X -= 1
s[i].append((X, Y))
ans = 0
for b in range(2 ** N):
t = [0] * N
num = 0
for i in range(N):
if (b >> i) & 1:
t[i] = 1
num += 1
if ok(t, s):
ans = max(ans, num)
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
|
N=int(input())
XY=[[] for _ in range(N)]
for i in range(N):
A=int(input())
for _ in range(A):
x,y = map(int, input().split())
x-=1
XY[i].append([x,y])
ans=0
for bit_state in range(2**N):
flag=True
for i in range(N):
if (bit_state>>i)&1:
for x, y in XY[i]:
if (bit_state >>x)&1 != y:
flag=False
if flag:
ans=max(ans, bin(bit_state).count("1"))
print(ans)
| 1 | 120,961,888,808,578 | null | 262 | 262 |
S = input()
if S == 'ABC':
print('ARC')
else:print('ABC')
|
a,b=map(int,input().split())
print((a//b)+1 if a%b!=0 else a//b)
| 0 | null | 50,497,308,887,428 | 153 | 225 |
# coding=utf-8
class Dice(object):
def __init__(self, label):
self.label = label
def rotateS(self):
s1, s2, s3, s4, s5, s6 = self.label
self.label = [s5, s1, s3, s4, s6, s2]
def rotateN(self):
s1, s2, s3, s4, s5, s6 = self.label
self.label = [s2, s6, s3, s4, s1, s5]
def rotateE(self):
s1, s2, s3, s4, s5, s6 = self.label
self.label = [s4, s2, s1, s6, s5, s3]
def rotateW(self):
s1, s2, s3, s4, s5, s6 = self.label
self.label = [s3, s2, s6, s1, s5, s4]
def rotate(self, r):
if r == 'S':
self.rotateS()
elif r == 'N':
self.rotateN()
elif r == 'E':
self.rotateE()
elif r == 'W':
self.rotateW()
else:
print 'Cannot rotate into ' + r + 'direction.'
def getTopLabel(self):
return self.label[0]
if __name__ == '__main__':
d = Dice(map(int, raw_input().split()))
rotations = raw_input()
for r in rotations:
d.rotate(r)
print d.getTopLabel()
|
S=list(str(input()))
for i in range(len(S)):
S[i]='x'
print(''.join(S))
| 0 | null | 36,568,410,006,492 | 33 | 221 |
#155_A
a, b, c = map(int, input().split())
if a==b and a!=c and b!=c:
print('Yes')
elif a==c and a!=b and c!=b:
print('Yes')
elif b==c and b!=a and c!=a:
print('Yes')
else:
print('No')
|
s=list(map(int,input().split()))
ans="Yes" if len(set(s))==2 else "No"
print(ans)
| 1 | 68,141,495,509,400 | null | 216 | 216 |
import sys
for i in range(1,10):
for j in range(1,10):
print("{0}x{1}={2}".format(i,j,i*j))
|
print('win' if sum(map(int, input().split())) < 22 else 'bust')
| 0 | null | 59,369,208,528,452 | 1 | 260 |
s = input()
t = input()
cnt = 0
ans = 0
while cnt < len(s) - len(t) + 1:
chk = 0
for i, j in zip(range(cnt,cnt+len(t)),range(len(t))):
if s[i] == t[j]:
chk += 1
ans = max(ans,chk)
cnt += 1
print(len(t) - ans)
|
S = input()
T = input()
max_match = 0
n = len(T)
m = len(S)
for i in range(m-n+1):
tmp = 0
for j in range(i,i+n):
if S[j] == T[j-i]:
tmp += 1
if tmp > max_match:
max_match = tmp
ans = n - max_match
print(ans)
| 1 | 3,652,301,166,598 | null | 82 | 82 |
import sys
def gcd(a,b):
if b == 0: return a
else: return gcd(b,a%b)
for i in sys.stdin:
a, b = map(int, i.split())
g = gcd(a,b)
print g, a/g*b
|
N=int(input())
S=[input() for _ in range(N)]
a=0
w=0
t=0
r=0
for i in range(N):
if S[i] =="AC":
a+=1
elif S[i] =="WA":
w+=1
elif S[i] =="TLE":
t+=1
elif S[i] =="RE":
r+=1
print("AC x "+ str(a))
print("WA x "+ str(w))
print("TLE x "+ str(t))
print("RE x "+ str(r))
| 0 | null | 4,359,843,566,962 | 5 | 109 |
from copy import copy
n = int(input())
a_ls = list(map(int, input().split()))
c_bin = [[0]*60 for _ in range(n)]
a_bin_ls = [[0]*60 for _ in range(n)]
now_bin = [0] * 60
for i in range(n-1,-1,-1):
a = a_ls[i]
j = 0
while True:
if a == 1:
now_bin[j] += 1
a_bin_ls[i][j] = 1
break
elif a == 0:
break
a,r = divmod(a,2)
now_bin[j] += r
a_bin_ls[i][j] = r
j += 1
c_bin[i] = copy(now_bin)
ans_bin = [0]*60
for i in range(n-1):
a_bin = a_bin_ls[i]
for j in range(60):
if a_bin[j] == 0:
times = c_bin[i+1][j]
else:
times = n - (i+1) - c_bin[i+1][j]
ans_bin[j] += times
ans = 0
mod = 10**9+7
for i in range(60):
ans += 2**i * (ans_bin[i]%mod)
ans %= mod
print(ans)
|
def main():
N=int(input())
A=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
c=0
for j in A:
if j>>i&1:
c+=1
ans+=pow(2,i,mod)*c*(N-c)
ans%=mod
print(ans)
if __name__=='__main__':
main()
| 1 | 123,101,152,780,590 | null | 263 | 263 |
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for old, new in zip(scores, scores[k:]):
if old < new:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
h, a = map(int, input().split())
ans = h//a + (h%a!=0)
print(ans)
| 0 | null | 42,045,336,206,364 | 102 | 225 |
c, flag = 0, 0
for _ in range(int(input())):
d1, d2 = map(int, input().split())
if d1 == d2:
c += 1
else:
c = 0
if c >= 3:
flag = 1
if flag:
print("Yes")
else:
print("No")
|
n = int(input())
a = list(map(int, input().split()))
kane = 1000
kabu = 0
if a[0] < a[1]:
kabu = kane // a[0]
kane %= a[0]
for i in range(1, n - 1):
if a[i - 1] < a[i]:
kane += a[i] * kabu
kabu = 0
if a[i] < a[i + 1]:
kabu = kane // a[i]
kane %= a[i]
kane += a[n - 1] * kabu
print(kane)
| 0 | null | 4,899,884,318,760 | 72 | 103 |
n, k = map(int, input().split())
a = set()
for i in range(k):
d = int(input())
a |= set(map(int, input().split()))
print(len(set(range(1, n + 1)) - a))
|
n, k = map(int,input().split())
have = [False] * n
for _ in range(k):
d = input()
a = list(map(lambda x: int(x)-1, input().split()))
for x in a:
have[x] = True
print(have.count(False))
| 1 | 24,604,998,998,130 | null | 154 | 154 |
n, K = map(int, input().split())
a = list(map(int, input().split()))
s = [[0]*n for _ in range(100)]
s[0] = a
tmp = [0] * (n+1)
for i in range(K):
if sum(s[i]) == n**2:
print(*([n] * n))
break
for j in range(n):
x = s[i][j]
l, r = max(0, j-x), min(n, j+x+1)
tmp[l] += 1
tmp[r] -= 1
for j in range(n):
tmp[j+1] = tmp[j] + tmp[j+1]
s[i+1][j] += tmp[j]
tmp = [0] * (n+1)
else: print(*s[K])
|
n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(1, 100):
imos = [0] * (n + 1)
for j in range(n):
imos[max(0, j - A[j])] += 1
imos[min(n, j + A[j] + 1)] -= 1
nA = [0] * n
nA[0] = imos[0]
for j in range(1, n):
nA[j] = nA[j - 1] + imos[j]
A = nA[:]
if i >= k:
break
print(*A)
| 1 | 15,418,005,276,988 | null | 132 | 132 |
n = int(input())
mod = (10**9)+7
ans = (10**n) - 2*(9**n) + 8**n
print(ans%mod)
|
NUM = 1000000007
N = int(input())
all_colab = pow(10, N)
except_0or9_colab = pow(9, N)
except_0and9_colab = pow(8, N)
include_0and9_colab = all_colab - (2*except_0or9_colab - except_0and9_colab)
print(include_0and9_colab % NUM)
| 1 | 3,196,710,935,968 | null | 78 | 78 |
n_1 = list(map(int, input().split()))
n_2 = list(map(int, input().split()))
if n_1[0] != n_2[0]:
print(1)
else:
print(0)
|
def main():
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
if D2 == 1:
print(1)
else:
print(0)
if __name__ == "__main__":
main()
| 1 | 124,486,172,718,362 | null | 264 | 264 |
s=input()
if(s[-1]=='s'):
s=s+"es"
print(s)
else:
s=s+"s"
print(s)
|
n, m = map(int, input().split())
mat = []
for i in range(n):
mat.append(list(map(int, input().split())))
vec = []
for i in range(m):
vec.append(int(input()))
for i in range(n):
e = 0
for j in range(m):
e += mat[i][j] * vec[j]
print(e)
| 0 | null | 1,787,309,800,292 | 71 | 56 |
from collections import Counter
#N, K = map(int, input().split( ))
#L = list(map(int, input().split( )))
N = int(input())
A = list(map(int, input().split( )))
Q = int(input())
Sum = sum(A)
#Counterなるものがあるらしい
coun = Counter(A)
#Q個の整数の組(B,C)が与えられてB \to Cとして合計を計算
#合計は(Ci-Bi)*(A.count(Bi))変化する.
for _ in range(Q):
b, c = map(int, input().split( ))
Sum += (c-b)*coun[b]
coun[c] += coun[b]
coun[b] = 0
print(Sum)
# replaceするとタイムエラーになるのか…
# A = [c if a == b else a for a in A]
|
a = int(input())
sum = a + a*a +a*a*a
print(sum)
| 0 | null | 11,239,690,428,622 | 122 | 115 |
N=int(input())
a=list(map(int,input().split()))
z=0
for i in range(0,N,2):
if int(a[i])%2==1:
z+=1
print(z)
|
n = int(input())
a = list(map(int, input().split()))
ans = 0
for x in a[::2]:
ans += x % 2
print(ans)
| 1 | 7,811,151,243,808 | null | 105 | 105 |
l1=input().split()
l2=list(map(int,input().split()))
l2[l1.index(input())]-=1
print(" ".join(str(x) for x in l2))
|
# -*- coding:utf-8 -*-
import sys
data = []
count = 0
for i in sys.stdin:
data.append(int(i))
count = count+1
if count == 10:
break
N = len(data)
m = 100
for i in range(m):
for n in range(N-1):
a = data[n]
b = data[n+1]
if a <= b:
data[n] = b
data[n+1] = a
else:
pass
for i in range(3):
print(data[i])
| 0 | null | 36,058,019,025,798 | 220 | 2 |
S=input()
T=input()
S=list(S)
T=list(T)
sum=0
for i in range(len(S)):
if not S[i]==T[i]:
sum += 1
print(sum)
|
n = list(input())
n1 = list(input())
i = 0
cou = 0
while i != len(n):
if n[i] != n1[i]:
cou += 1
i += 1
print(cou)
| 1 | 10,386,907,519,260 | null | 116 | 116 |
x = int(input())
ans, r = divmod(x, 500)
ans *= 1000
ans += (r//5)*5
print(ans)
|
N = int(input())
a = N // 500
N -= 500 * a
b = N // 5
print(a * 1000 + b * 5)
| 1 | 42,796,594,364,450 | null | 185 | 185 |
"""ABC174E diff: 1158
"""
N,K=map(int,input().split())
A=list(map(int, input().split()))
if K == 0:
print(max(A))
exit()
def f(x):
"""
K回以内のカットで全ての丸太の長さをX以下にできるか？
X: int
Return: bool
"""
cnt = 0
for a in A:
if a % x == 0:
cnt += a//x - 1
else:
cnt += a//x
if cnt <= K:
return True
else:
return False
left = 0
right = max(A) + 10
while right - left > 1:
mid = (left+right) // 2
if f(mid):
right = mid
else:
left = mid
print(right)
|
N ,K = map(int, input().split())
A = list(map(int, input().split()))
d = [0] * N
#二分探索
min1 = 0
max1 = max(A) + 1
while True:
X = (min1 + max1)//2
for i in range(N):
if A[i] % X == 0:
d[i] = A[i]//X - 1
else:
d[i] = A[i]//X
if sum(d) <= K:
max1 = X
else:
min1 = X
#print(min1, max1)
if max1 - min1 <= 1:
print(int(max1))
break
| 1 | 6,506,073,489,498 | null | 99 | 99 |
W = input().lower()
T = ''
while True:
txt = input()
if txt == 'END_OF_TEXT': break
T += txt.lower() + ' '
print(tuple(T.split(' ')).count(W))
|
def find_ways(n, x):
number_list = [i+1 for i in range(n)]
cnt = 0
for j in number_list:
if j > n-2:
break
for k in number_list:
if k <= j:
continue
l = x - j - k
if l > n or l <= k:
continue
else:
cnt += 1
return cnt
while True:
data = list(map(int, list(input().split())))
if data[0] == 0 and data[1] == 0:
break
else:
comb = find_ways(data[0], data[1])
print(comb)
| 0 | null | 1,523,793,571,524 | 65 | 58 |
A, B, N = map(int, input().split())
x = min(N, B-1)
print(A * x //B)
|
x, y = list(map(int, input().split()))
if y > x * 4 or y < x * 2 or y % 2 == 1:
print('No')
else:
print('Yes')
| 0 | null | 21,019,239,210,020 | 161 | 127 |
while True:
first_string=input()
if first_string=="-":
break
lst=list(first_string)
m=int(input())
for i in range(m):
h=int(input())
for l in range(1,h+1):
letter=lst.pop(0)
lst.insert(len(lst),letter)
answer_string=''
for m in lst:
answer_string+=m
print(answer_string)
|
s = input()
if ('A' in s) and ('B' in s):
print('Yes')
else:
print('No')
| 0 | null | 28,403,801,068,360 | 66 | 201 |
s=input()
sss=list(s)
sss.reverse()
if sss[0]=="s":
print(s+"es")
else:
print(s+"s")
|
word = input()
if word[-1] == 's':
word += "e"
print(word + "s")
| 1 | 2,363,322,645,408 | null | 71 | 71 |
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()))
n = ini()
print(n + n**2 + n**3)
|
a = int(input())
ans = a + (a ** 2) + (a ** 3)
print(ans)
| 1 | 10,175,129,456,310 | null | 115 | 115 |
N=int(input())
D=list(map(int,input().split()))
isOK=True
if D[0]!=0:
isOK=False
for i in range(1,N):
if D[i]==0:
isOK=False
break
cnt=[0]*(max(D)+1)
MOD=998244353
for i in range(N):
cnt[D[i]]+=1
ans=1
for i in range(len(cnt)-1):
for r in range(cnt[i+1]):
ans=ans*cnt[i]%MOD
if isOK:
print(ans)
else:
print(0)
|
MOD = 998244353
n = int(input())
d = list(map(int, input().split()))
dist_map = [0]*n
for dist in d:
dist_map[dist] += 1
ans = 1
if d[0] != 0 or dist_map[0] > 1:
print(0)
exit()
for i in range(1, n):
ans *= pow(dist_map[i-1], dist_map[i], MOD)
ans %= MOD
print(ans)
| 1 | 155,435,632,935,150 | null | 284 | 284 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.