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, m = map(int, input().split())
coins = list(map(int, input().split()))
memo = [0] + [10**7] * n
for coin in coins:
for i in range(coin, n+1):
memo[i] = min(memo[i], memo[i-coin]+1)
print(memo[-1])
| n=int(input());s=input();print('No'if s[:n//2]!=s[n//2:] else'Yes') | 0 | null | 73,509,894,976,768 | 28 | 279 |
from collections import deque
import sys
input = sys.stdin.readline
n = int(input())
a = [0]*n
b = [0]*n
for i in range(n):
a[i], b[i] = map(int, input().split())
a.sort()
b.sort()
if n%2!=0 :
l = a[int(n/2)]
u = b[int(n/2)]
ans = u - l + 1
else:
l = a[int(n/2-1)] + a[int(n/2)]
u = b[int(n/2-1)] + b[int(n/2)]
ans = u - l +1
print(ans)
| k=int(input())
a,b = map(int,input().split())
while b>=a:
if b%k==0:
print('OK')
break
b-=1
if b<a:
print('NG') | 0 | null | 21,871,635,574,724 | 137 | 158 |
row, col, num = map(int, input().split())
tmp_l = []
board = []
for i in range(row):
str = input()
for j in range(col):
if str[j] == '.':
tmp_l.append(0)
if str[j] == '#':
tmp_l.append(1)
board.append(tmp_l)
tmp_l = []
onoff = []
bi = [32, 16, 8, 4, 2, 1]
for i in range(64):
tmp = i
for j in bi:
tmp_l.insert(0, int(tmp / j))
tmp %= j
onoff.append(tmp_l)
tmp_l = []
count = 0
ans = 0
for i in range(2**row):
for j in range(2**col):
for k in range(row):
if onoff[i][k] == 1:
for l in range(col):
if onoff[j][l] == 1:
if board[k][l] == 1:
count += 1
if count == num:
ans += 1
count = 0
print(ans) | N=int(input())
A=list(map(int, input().split()))
if N==2:
print(max(A))
exit()
dp=[[0,0,0] for i in range(N)]
dp[0][0]=A[0]
dp[1][1]=A[1]
dp[2][2]=A[2]
for i in range(N):
if i>1:
dp[i][0]=dp[i-2][0]+A[i]
if i>2:
dp[i][1]=max(dp[i-3][0],dp[i-2][1])+A[i]
if i>3 :
dp[i][2]=max(dp[i-4][0],dp[i-3][1],dp[i-2][2])+A[i]
if N%2==1:
ans=max(dp[-1][2],dp[-2][1],dp[-3][0])
else:
ans=max(dp[-1][1],dp[-2][0])
print(ans) | 0 | null | 23,178,925,287,620 | 110 | 177 |
n = int(input())
S = [1]*13
H = [1]*13
C = [1]*13
D = [1]*13
mark = [""]*n
num = [""]*n
for i in range(n):
mark[i], num[i] = input().split()
for i in range(n):
if mark[i] == "S":
S[int(num[i])-1] = 0
if mark[i] == "H":
H[int(num[i])-1] = 0
if mark[i] == "C":
C[int(num[i])-1] = 0
if mark[i] == "D":
D[int(num[i])-1] = 0
for i in range(13):
if S[i]:
print("S " + str(i+1))
for i in range(13):
if H[i]:
print("H " + str(i+1))
for i in range(13):
if C[i]:
print("C " + str(i+1))
for i in range(13):
if D[i]:
print("D " + str(i+1)) | #!/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 solve():
S = input()
N = len(S)
if S != S[::-1]:
return False
t = S[:(N - 1) // 2]
if t != t[::-1]:
return False
t = S[(N + 3) // 2 - 1:]
if t != t[::-1]:
return False
return True
def main():
if solve():
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| 0 | null | 23,516,503,070,340 | 54 | 190 |
N=int(input())
S=input()
K=S
i=0
han=S[0]
kot=S[0]
for b in K:
if b != han:
kot+=b
han=b
print(len(kot)) | n = int(input())
s = input()
x = n
for i in range(n-1):
if s[i] == s[i+1]:
x -= 1
print(x) | 1 | 169,962,561,366,930 | null | 293 | 293 |
def gcd(a,b):
if(b==0):
return a
return gcd(b,a%b)
while True:
try:
a,b = map(int, input().split())
g = gcd(a,b)
print("%s %d"%(g,a/g*b))
except:
break
| import sys
def gcd(inta, intb):
large = max(inta, intb)
small = min(inta,intb)
mod = large % small
if mod ==0:
return small
else:
return gcd(small, mod)
def lcm(inta, intb, intgcd):
return (inta * intb // intgcd)
sets = sys.stdin.readlines()
for line in sets:
a, b = map(int, line.split())
c = gcd(a, b)
print(c, lcm(a, b, c)) | 1 | 692,113,280 | null | 5 | 5 |
T1,T2=map(int,input().split())
A1,A2=map(int,input().split())
B1,B2=map(int,input().split())
OU=T1*(A1-B1)
HUKU=T2*(A2-B2)
TOTAL=OU+HUKU
if TOTAL==0:
print("infinity")
elif (OU>0 and TOTAL>0) or (OU<0 and TOTAL<0):
print(0)
elif (OU>0 and TOTAL*(-1)>OU) or (OU<0 and TOTAL*(-1)<OU):
print(1)
else:
K=int(OU/TOTAL)*-1
if (OU%TOTAL)==0:
print(K*2)
else:
print(K*2+1)
| #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(T: "List[int]", A: "List[int]", B: "List[int]"):
if A[0] < B[0]:
A, B = B, A
if A[1] > B[1]:
print(0)
return
elif A[0]*T[0]+A[1]*T[1] > B[0]*T[0]+B[1]*T[1]:
print(0)
return
elif A[0]*T[0]+A[1]*T[1] == B[0]*T[0]+B[1]*T[1]:
print("infinity")
return
K = (B[0]*T[0]+B[1]*T[1])-(A[0]*T[0]+A[1]*T[1])
L = (A[0]-B[0])*T[0] // K
if (B[0]-A[0])*T[0] % K == 0:
print(2*L)
else:
print(2*L+1)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
T = [int(next(tokens)) for _ in range(2)] # type: "List[int]"
A = [int(next(tokens)) for _ in range(2)] # type: "List[int]"
B = [int(next(tokens)) for _ in range(2)] # type: "List[int]"
solve(T, A, B)
if __name__ == '__main__':
main()
| 1 | 131,687,998,229,000 | null | 269 | 269 |
n = int(input())
s = input()
if n == 1:
print("No")
exit()
if s[:int(n / 2)] == s[int(n / 2):]: print("Yes")
else: print("No")
| n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
head = s[:n // 2]
tail = s[n // 2:]
if head == tail:
print('Yes')
else:
print('No')
| 1 | 146,200,353,864,000 | null | 279 | 279 |
A,B,C = map(int, input().split())
K = int(input())
for i in range(K):
if B >= C or A >= C:
C *= 2
else:
if A >= B:
B *= 2
if C > B and B > A:
print("Yes")
else:
print("No") | n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
t = s[:n//2]
if t * 2 == s:
print("Yes")
else:
print("No") | 0 | null | 76,918,366,184,130 | 101 | 279 |
X, Y = map(int, input().split())
mod = 10**9 + 7
def permute(n, m):
ret = 1
while n >= m:
ret *= n
# ret %= mod
n -= 1
return ret
def count_combinations(n, m):
fact = [1] * (n + 1)
inv = [i for i in range(n+1)]
fact_inv = [1] * (n + 1)
for i in range(2, n+1):
fact[i] = fact[i-1] * i % mod
inv[i] = (-inv[mod%i]*(mod//i))%mod
# inv[i] = mod - inv[mod % i] * (mod // i) % mod
fact_inv[i] = fact_inv[i-1] * inv[i] % mod
ret = (fact[n] * fact_inv[m] * fact_inv[n-m]) % mod
return ret
def count_comb2(n, m):
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % mod)
inv.append((-inv[mod % i] * (mod // i)) % mod)
factinv.append((factinv[-1] * inv[-1]) % mod)
if (m < 0) or (n < m):
return 0
m = min(m, n - m)
return fact[n] * factinv[m] * factinv[n-m] % mod
ret = 0
if (X+Y)%3 == 0:
m = (2*X - Y) // 3
n = (2*Y - X) // 3
if m >= 0 and n >= 0:
ret = count_combinations(n+m, m)
# ret = count_comb2(n+m, m)
print(ret)
| class Combination:
def __init__(self, mod, max_n):
self.MOD = mod
self.MAX_N = max_n
self.f = self.factorial(self.MAX_N)
self.f_inv = [self.inv(x) for x in self.f]
def inv(self,x):
return pow(x, self.MOD-2, self.MOD)
def factorial(self, n):
res = [1]
for i in range(1,n+1):
res.append(res[-1] * i % self.MOD)
return res
def comb(self, n, r):
return (self.f[n] * self.f_inv[r] % self.MOD) * self.f_inv[n-r] % self.MOD
X, Y = map(int,input().split())
k, l = (2*Y-X)//3, (2*X-Y)//3
if (X + Y) % 3 != 0 or k < 0 or l < 0:
print(0)
exit()
CB = Combination(10**9+7, k+l)
print(CB.comb(k+l,k)) | 1 | 150,238,844,579,300 | null | 281 | 281 |
def main():
N = int(input())
count = 0
for a in range(N) :
a += 1
for b in range(N):
b += 1
c = N - a * b
if c <= 0 :
break
else :
count += 1
print(count)
if __name__ == '__main__':
main()
| n=int(input())
c=0
for a in range(1,n+1):
c+=(n-1)//a
print(c) | 1 | 2,601,998,514,892 | null | 73 | 73 |
import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N, K = NMI()
A = NLI()
ng = 0 #ng:とり得る最小の値-1
ok = 10**9+10 #ok:とり得る最大の値+1
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
cut = 0
for a in A:
if a % mid == 0:
cut += math.floor(a/mid)-1
else:
cut += math.floor(a/mid)
if cut <= K:
ok = mid
else:
ng = mid
print(ok)
if __name__ == '__main__':
main() | A = input()
if A[2]==A[3] and A[4]==A[5]:
print('Yes')
else:
print('No') | 0 | null | 24,103,216,136,808 | 99 | 184 |
MOD = 10**9+7
k = int(input())
s = input()
MAX = k + len(s)
factorial = [0] * (MAX + 1)
factorial[0] = 1
for i in range(1, MAX + 1):
factorial[i] = factorial[i-1] * i % MOD
ifactorial = [0] * (MAX + 1)
ifactorial[MAX] = pow(factorial[MAX], MOD - 2, MOD)
for i in range(MAX, 0, -1):
ifactorial[i - 1] = ifactorial[i] * i % MOD
pow25 = [1] * (k + 1)
pow26 = [1] * (k + 1)
for i in range(k):
pow25[i + 1] = pow25[i] * 25
pow25[i + 1] %= MOD
pow26[i + 1] = pow26[i] * 26
pow26[i + 1] %= MOD
def combination(n, k):
ret = factorial[n] * ifactorial[k] * ifactorial[n - k]
return ret % MOD
ans = 0
for i in range(k + 1):
tmp = combination(i + len(s) - 1, len(s) - 1)
tmp *= pow25[i]
tmp %= MOD
# tmp *= pow(25, i, MOD)
tmp *= pow26[k - i]
# tmp *= pow(26, k - i, MOD)
tmp %= MOD
ans += tmp
ans %= MOD
print(ans)
| n = int(input())
lx = list(map(int,input().split()))
lc=[]
for i in range(1,101):
c = 0
for x in lx:
c += (i-x)**2
lc.append(c)
print(min(lc))
| 0 | null | 38,867,134,255,292 | 124 | 213 |
a,b,c=[int(i) for i in input().split()]
num=0
#s=[i for i in range(1,c+1) if c%i==0]
# print(s)
for i in range(1,c+1):
if c%i==0:
if i>=a and i<=b:
num=num+1
print(num) | a,b,c = [int(x) for x in input().split( )]
div = []
for x in range(1,c+1):
if c % x == 0:
div.append(x)
r = []
for x in range(a,b+1):
r.append(x)
answer = 0
for x in div:
for y in r:
if x == y:
answer += 1
print(answer)
| 1 | 558,821,891,300 | null | 44 | 44 |
N = int(input())
S = input()
if N%2==1:
print('No')
else:
ans = 'Yes' if S[:N//2] == S[N//2:] else 'No'
print(ans) | from sys import exit
def main():
N = int(input())
S = input()
middle = int(N / 2)
if middle == 0 or N % 2 != 0:
print('No')
exit()
for i in range(middle):
if S[i] != S[i + middle]:
print('No')
exit()
print('Yes')
main() | 1 | 146,826,338,393,248 | null | 279 | 279 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
s = S()
rgb = ["R","G","B"]
rgb_st = set(rgb)
rgb_acc = [[0]*n for _ in range(3)]
index = rgb.index(s[0])
rgb_acc[index][0] += 1
ans = 0
for i in range(1,n):
for j in range(3):
rgb_acc[j][i] = rgb_acc[j][i-1]
index = rgb.index(s[i])
rgb_acc[index][i] += 1
for i in range(n-2):
for j in range(i+1,n-1):
if s[i] != s[j]:
ex = (rgb_st-{s[i],s[j]}).pop()
index = rgb.index(ex)
cnt = rgb_acc[index][-1] - rgb_acc[index][j]
if j<2*j-i<n:
if s[2*j-i] == ex:
cnt -= 1
ans += cnt
print(ans)
main()
| import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a=ii()
l=[]
ans=0
for i in range(a):
s=ii()
h=[list(mi()) for _ in range(s)]
l.append(h)
for k in range(2**a):
lst=[]
for p in range(a):
if k>>p & 1:
lst.append(p)
t=True
for aa in lst:
for m in l[aa]:
if m[1]==0:
if m[0]-1 in lst:
t=False
break
else:
if not m[0]-1 in lst:
t=False
break
if t:
ans=max(ans,len(lst))
print(ans) | 0 | null | 79,132,975,057,692 | 175 | 262 |
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n=ni()
c = [1 if _ == 'R' else 0 for _ in input()]
b = sum(c)
w=0
r=0
for i in range(n):
if c[i] == 0 and i < b:
r+=1
if c[i] == 1 and i >= b:
w+=1
print(max(w,r))
| N = int(input())
S = input()
from collections import Counter
d = Counter(list(S))
allr = d["R"]
leftd = Counter(list(S[:allr]))
leftr = leftd["R"]
print(allr-leftr) | 1 | 6,300,176,742,076 | null | 98 | 98 |
def main():
k = int(input())
a, b = (int(i) for i in input().split())
for i in range(a, b+1):
if i % k == 0:
print('OK')
return
print('NG')
main()
| x = int(input())
mod =10**9 + 7
ans = pow(10,x,mod)
ans -= 2 * pow(9,x,mod)
ans += pow(8,x,mod)
ans %=mod
print(ans) | 0 | null | 15,006,970,834,432 | 158 | 78 |
x=int(input())
kosu=0
for i in range(1000):
kosu+=1
if 100*kosu<=x<=105*kosu:
print(1)
quit()
print(0) | X = int(input())
for c in range(1, 1000001):
if c * 100 <= X and X <= c * 105:
ans = 1
break
else:
ans = 0
print(ans)
| 1 | 126,670,235,575,140 | null | 266 | 266 |
h, n = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(n)]
#(a,b):=(ダメージ,消費魔力)
dp = [float('inf')] * (h + 1)
dp[0] = 0
for i in range(h + 1):
for j in range(n):
if dp[i] == float('inf'):continue
temp_a = i + ab[j][0] if i + ab[j][0] < h else h
temp_b = dp[i] + ab[j][1]
dp[temp_a] = min(dp[temp_a], temp_b)
print(dp[-1])
#print(dp)
| # coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import defaultdict
# import math
# from itertools import product, accumulate, combinations, product
# import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
#from collections import deque
#import numba
def run():
H, N = map(int, sysread().split())
AB = list(map(int, read().split()))
A = AB[::2]
B = AB[1::2]
Amax = max(A)
INF = float('inf')
dp = [[INF] * (H+Amax+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(H+Amax+1):
tmp = j - A[i]
if tmp >= 0:
dp[i+1][j] = min([dp[i][j], dp[i+1][tmp] + B[i]])
elif j == H and tmp < 0:
dp[i + 1][H] = min(dp[i][H], dp[i + 1][0] + B[i])
else:
dp[i+1][j] = dp[i][j]
ret = min(dp[N][H:])
print(ret)
if __name__ == "__main__":
run() | 1 | 80,767,300,381,400 | null | 229 | 229 |
M, N = input().split() # 2つ整数の読み取り
A=int(M)
B=N.replace(".","")
B=int(B)
C=A*B//100
print(C) | a, b = input().split()
b = b.replace('.', '')
print(int(a)*int(b)//100)
| 1 | 16,702,446,921,808 | null | 135 | 135 |
x = input()
print((int(x) ** 3)) | N = int(input())
S = [input() for i in range(N)]
LR = []
for s in S:
left, right = 0, 0
for ss in s:
if ss == "(":
left += 1
else:
if left:
left -= 1
else:
right += 1
LR.append([left, right])
#print(LR)
plus = []
minus = []
for l, r in LR:
if l >= r:
plus.append([l, r])
else:
minus.append([l, r])
plus.sort(key = lambda x: x[1])
minus.sort(key = lambda x: -x[0])
cnt = 0
for l, r in plus + minus:
cnt -= r
if cnt < 0:
print("No")
exit()
cnt += l
if cnt == 0:
print("Yes")
else:
print("No") | 0 | null | 12,004,261,163,400 | 35 | 152 |
# 146A
S = input()
if S == 'SUN':
answer = (7)
elif S == 'MON':
answer = (6)
elif S == 'TUE':
answer = (5)
elif S == 'WED':
answer = (4)
elif S == 'THU':
answer = (3)
elif S == 'FRI':
answer = (2)
elif S == 'SAT':
answer = (1)
print(answer) | n = int(input())
a = list(map(int, input().split()))
print('APPROVED' if all(ai % 3 == 0 or ai % 5 == 0 for ai in a if ai % 2 == 0) else 'DENIED') | 0 | null | 100,685,924,487,680 | 270 | 217 |
count =[[[0]*10 for j in range(3)] for k in range(4)]
n = int(input())
for x in range(n):
b,f,r,v = map(int,input().split())
# 1 <= b <=4
# 1 <= f <= 3
# 1 <= r <= 10
# 1 <= v <= 9
count[b-1][f-1][r-1] += v
for i in range(4):
if i != 0:
print("#"*20)
for j in range(3):
for k in range(10):
print(f' {count[i][j][k]}',end="")
print()
| import itertools
N = int(input())
x = []
y = []
for i in range(N):
xy = list(map(int, input().split()))
x.append(xy[0])
y.append(xy[1])
l = [i for i in range(N)]
ans = 0
cnt = 0
for i in itertools.permutations(l, N):
cnt += 1
for j in range(1, N):
x1 = x[i[j]]
x2 = x[i[j-1]]
y1 = y[i[j]]
y2 = y[i[j-1]]
ans += pow((x1 - x2)**2 + (y1 - y2)**2, 0.5)
# print(i, j, x1, y1, x2, y2)
ans /= cnt
print(ans) | 0 | null | 74,931,396,984,400 | 55 | 280 |
print(["win","bust"][sum(map(int,input().split()))>21]) | heights = list()
for i in range(10):
heights.append(int(input()))
for height in list(reversed(sorted(heights)))[:3]:
print(height) | 0 | null | 59,652,744,873,370 | 260 | 2 |
# coding:utf-8
import sys
# 最大公約数
def gcd(a, b):
while b > 0:
a, b = b, a%b
return a
# 最小公倍数
def lcm(a, b):
return a*b/gcd(a, b)
for s in sys.stdin:
a, b = map(int,s.split())
gcd_num = gcd(a, b)
lcm_num = lcm(a, b)
print "%d %d"%(gcd_num, lcm_num) | import sys
def to_i(e):
return int(e)
def calc_gcd(a, b):
if b > 0:
return calc_gcd(b, a % b)
else:
return a
def calc_lcm(a, b):
return ((a / calc_gcd(a, b)) * b)
while True:
line = sys.stdin.readline()
if not line: break
a, b = map(to_i, line.rstrip().split(" "))
gcd = calc_gcd(a, b)
lcm = calc_lcm(a, b)
print str(gcd) + " " + str(lcm) | 1 | 501,560,228 | null | 5 | 5 |
import math
import collections
def prime_diviation(n):
factors = []
i = 2
while i <= math.floor(math.sqrt(n)):
if n%i == 0:
factors.append(int(i))
n //= i
else:
i += 1
if n > 1:
factors.append(n)
return factors
N = int(input())
if N == 1:
print(0)
exit()
#pr:素因数分解 prs:集合にしたやつ prcnt:counter
pr = prime_diviation(N)
prs = set(pr)
prcnt = collections.Counter(pr)
#print(pr, prs, prcnt)
ans = 0
for a in prs:
i = 1
cnt = 2*prcnt[a]
#2*prcnt >= n(n+1)となる最大のnを探すのが楽そう
# print(cnt)
while cnt >= i*(i+1):
i += 1
ans += i - 1
print(ans) | #169D
#Div Game
n=int(input())
def factorize(n):
fct=[]
b,e=2,0
while b**2<=n:
while n%b==0:
n/=b
e+=1
if e>0:
fct.append([b,e])
b+=1
e=0
if n>1:
fct.append([n,1])
return fct
l=factorize(n)
ans=0
for i in l:
c=1
while i[1]>=c:
ans+=1
i[1]-=c
c+=1
print(ans) | 1 | 16,916,098,222,338 | null | 136 | 136 |
name = input('')
print(name[:3]) | s=input()
nn = s[0]+s[1]+s[2]
print(nn) | 1 | 14,804,673,423,082 | null | 130 | 130 |
N = int(input())
A = [int(x) for x in input().split()]
print(*A)
for i in range(1, len(A)):
key = A[i]
j = i-1
while j >= 0 and A[j] > key:
A[j+1] = A[j]
j += -1
A[j+1] = key
print(*A) | N=int(input())
Xlist=list(map(int,input().split()))
ans=10**18
for p in range(1,101):
ans=min(ans,sum(list(map(lambda x:(p-x)**2,Xlist))))
print(ans) | 0 | null | 32,498,014,244,784 | 10 | 213 |
S = input()
def is_kaibun(s):
l = len(s)
# print('former', s[:int(l/2)])
# print('latter', s[:-(int(l/2))-1:-1])
if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:
return True
else:
return False
if is_kaibun(S):
if is_kaibun(S[:int((len(S)-1)/2)]):
if is_kaibun(S[int((len(S)+3)/2)-1:]):
print('Yes')
exit()
print('No') | def check(r):
if r == r[::-1]:
return True
def main():
s = input()
n = len(s)
print("Yes" if check(s) and check(s[:(n-1)//2])
and check(s[((n-1)//2) + 1:]) else "No")
if __name__ == "__main__":
main() | 1 | 46,491,035,687,228 | null | 190 | 190 |
# coding:utf-8
a, b, c = map(int, input().split())
k = int(input())
counter = 0
while a >= b:
counter += 1
b = b * 2
while b >= c:
counter += 1
c = c * 2
if counter <= k:
print('Yes')
else:
print('No')
| a,b,c= list(map(int,input().split()))
n = int(input())
ans = "No"
for i in range(n):
if b <= a:
b = 2*b
elif c <= b:
c = 2*c
if a<b<c:
ans = "Yes"
print(ans) | 1 | 6,945,756,174,490 | null | 101 | 101 |
import math
a,b,x = map(int,input().split())
if x <= a*a*b/2:
print(math.atan((a*b*b/2/x))*180/math.pi)
else:
print(math.atan((a*a*b-x)/(a**3)*2)*180/math.pi) | x,y = map(int, raw_input().split())
while y > 0:
x,y = y,x%y
print x | 0 | null | 81,271,523,107,680 | 289 | 11 |
data = list(map(int, input().split()))
a,b = max(data), min(data)
r = a % b
while r != 0:
a = b
b = r
r = a % b
print(b) |
a,b = map(int,input().split())
while True:
r=a%b
if r==0:
break
else:
a=b
b=r
print(b) | 1 | 7,304,540,320 | null | 11 | 11 |
def build_combinations_counter(N=10**5, p=10**9+7):
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # mod p におけるnの逆元 n^(-1)
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
def cmb(n, r, p, fact, factinv):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
import functools
return functools.partial(cmb, p=p, fact=fact, factinv=factinv)
def resolve():
n, k = list(map(int, input().split()))
MOD = 10**9+7
counter = build_combinations_counter(2*10**5, 10**9+7)
ans = 0
for i in range(min(n, k+1)):
ans += counter(n, i) * counter(n-1, n-i-1)
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| n = int(input())
a = list(map(int, input().split()))
q = int(input())
total = sum(a)
dct = {}
for i in range(n):
if a[i] in dct:
dct[a[i]] += 1
else:
dct[a[i]] = 1
for i in range(q):
b, c = map(int, input().split())
if b not in dct: dct[b] = 0
if c not in dct: dct[c] = 0
total += dct[b] * (c - b)
print(total)
dct[c] += dct[b]
dct[b] = 0 | 0 | null | 39,480,146,278,660 | 215 | 122 |
N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
B[d].append(c)
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根(最初は全て根)
self.par = [i for i in range(n)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * n
# 人間の数
self.size = [1] * n
# 検索
def find(self, x):
# 根ならその番号を返す
if self.par[x] == x:
return x
# 根でないなら、親の要素で再検索
else:
# 走査していく過程で親を書き換える(return xが代入される)
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
# 根を探す
x = self.find(x)
y = self.find(y)
if x == y:
return
# 木の高さを比較し、低いほうから高いほうに辺を張る
if self.rank[x] < self.rank[y]:
self.par[x] = y
self.size[y] += self.size[x]
else:
self.par[y] = x
self.size[x] += self.size[y]
# 木の高さが同じなら片方を1増やす
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
def same(self, x, y):
return self.find(x) == self.find(y)
# すべての頂点に対して親を検索する
def all_find(self):
for n in range(len(self.par)):
self.find(n)
UF = UnionFind(N)
for iam in range(N):
for friend in F[iam]:
UF.union(iam, friend) # 自分と自分の友達を併合
ans = [UF.size[UF.find(iam)] - 1 for iam in range(N)] # 同じ集合に属する人の数
for iam in range(N):
ans[iam] -= len(F[iam]) # すでに友達関係にある人達を引く
for iam in range(N):
for block in B[iam]:
if UF.same(iam, block): # ブロック関係にあったら引く
ans[iam] -= 1
print(*ans, sep=' ')
| def main():
N, M = map(int, input().split())
if N & 1:
gen = ((i+1, N-i) for i in range(M))
else:
gen = ((i+1, N-i) if 2*i < N/2-1 else (i+1, N-i-1) for i in range(M))
[print(*s) for s in gen]
if __name__ == "__main__":
main()
| 0 | null | 44,934,906,746,860 | 209 | 162 |
hill = []
while True:
try:
hill.append(int(input()))
except:
break
for i in range(1, len(hill)):
key = hill[i]
j = i-1
while j >= 0 and hill[j] < key:
hill[j+1] = hill[j]
j -= 1
hill[j+1] = key
for i in range(3):
print(hill[i]) | (r1,g1,b1)=input().split()
(r,g,b)=(int(r1),int(g1),int(b1))
k=int(input())
flg=0
for i in range(k):
if not g > r :
g *= 2
elif not b > g:
b *= 2
if ( b > g > r):
print ("Yes")
else:
print ("No")
| 0 | null | 3,420,448,345,682 | 2 | 101 |
while 1:
try:
a,b=map(int,input().split())
print(len(str(a+b)))
except:
break | #!/usr/bin/env python3
import math
import sys
for line in sys.stdin:
[a, b] = [int(x) for x in line.split()]
print(int(math.log10(a + b) + 1)) | 1 | 111,312,308 | null | 3 | 3 |
import numpy as np
N = int(input())
A = list(map(int,input().split()))
a = np.array(A)
odd = a[a%2 == 0]
if np.sum((odd%3 != 0)&(odd%5 != 0)) == 0:
print('APPROVED')
else:
print('DENIED')
| x = raw_input()
x = int(x)
print x * x * x | 0 | null | 34,813,664,423,920 | 217 | 35 |
n,k=map(int,input().split())
ans=[1]+[0]*n
for i in range(k):
d=int(input())
l=list(map(int,input().split()))
for i in l:
ans[i]=1
print(ans.count(0)) | import decimal
import numpy as np
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,K = LI()
A = LI()
ans = []
for i in range(K,N):
if A[i-K] < A[i]:
ans.append('Yes')
else:
ans.append('No')
print('\n'.join(ans)) | 0 | null | 15,791,206,533,820 | 154 | 102 |
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
H, W, M = map(int, readline().split())
row = [0] * H
column = [0] * W
grid = set()
for _ in range(M):
h, w = map(int, readline().split())
row[h-1] += 1
column[w-1] += 1
grid.add((h-1,w-1))
max_row = max(row)
max_column = max(column)
idx_row = [i for i,x in enumerate(row) if x == max_row]
idx_column = [i for i,x in enumerate(column) if x == max_column]
ans = max_row+max_column
flag = False
for h in idx_row:
for w in idx_column:
if not (h,w) in grid:
flag = True
break
if flag:
print(ans)
else:
print(ans-1)
if __name__ == '__main__':
main()
| import sys
h,w,m = map(int, sys.stdin.readline().split())
num_in_h = [0] * h
num_in_w = [0] * w
targets = set()
for _ in range(m):
t_h, t_w = map(lambda x: int(x)-1, sys.stdin.readline().split())
num_in_h[t_h] += 1
num_in_w[t_w] += 1
targets.add((t_h, t_w))
max_h = max(num_in_h)
max_w = max(num_in_w)
max_h_set = set([i for i, v in enumerate(num_in_h) if v == max_h])
max_w_set = set([i for i, v in enumerate(num_in_w) if v == max_w])
ans = max_h + max_w - 1
flag = False
for i in max_h_set:
for j in max_w_set:
if (i, j) not in targets:
flag = True
break
if flag: break
print(ans+1 if flag else ans)
| 1 | 4,682,528,912,150 | null | 89 | 89 |
from collections import deque
N,K = map(int,input().split())
A = [int(i) for i in input().split()]
B = deque(A[:K])
for i in range(K,N):
if B.popleft() < A[i]:
print('Yes')
else:
print('No')
B.append(A[i])
| while True:
H, W = [int(i) for i in input().split()]
if H == W == 0:
break
for h in range(H):
for w in range(W):
if (w + h) % 2 == 0 :
print('#', end='')
else:
print('.', end='')
print()
print() | 0 | null | 4,011,743,501,656 | 102 | 51 |
while True:
ans = 0
x = raw_input()
if x == "0":
break
for i in x:
ans += int(i)
print ans | while True:
num = raw_input()
if num == "0":
break
output = 0
for i in num:
output += int(i)
print output | 1 | 1,594,051,961,880 | null | 62 | 62 |
from typing import List
def count_loadable_baggage_num(baggage_num: int, truck_num: int, baggages: List[int], truck_capacity: int) -> int:
loaded_baggage_num: int = 0
for _ in range(truck_num):
current_weight: int = 0
while current_weight + baggages[loaded_baggage_num] <= truck_capacity:
current_weight += baggages[loaded_baggage_num]
loaded_baggage_num += 1
if loaded_baggage_num == baggage_num:
return baggage_num
return loaded_baggage_num
def calc_turck_min_capacity(baggage_num: int, truck_num: int, baggages: List[int]) -> int:
ng: int = max(baggages) - 1
ok: int = sum(baggages) + 1
while ok - ng > 1:
mid = (ng + ok) // 2
loadable_baggage_num = count_loadable_baggage_num(baggage_num, truck_num, baggages, mid)
if loadable_baggage_num >= baggage_num:
ok = mid
else:
ng = mid
return ok
def main():
n, k = map(int, input().split())
w: List[int] = []
for _ in range(n):
w.append(int(input()))
P = calc_turck_min_capacity(n, k, w)
print(P)
if __name__ == "__main__":
main()
| num = map(int, raw_input().split())
for i in range(0,2):
for j in range(0,2):
if num[j] > num[j+1]:
tmp_box = num[j]
num[j] = num[j+1]
num[j+1] = tmp_box
sort = map(str, num)
print sort[0] + " " + sort[1] + " " + sort[2] | 0 | null | 247,297,402,440 | 24 | 40 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
s = input().rstrip()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| #! /usr/local/bin/python3
# coding: utf-8
n = int(input())
min_r = int(input())
max_margin = -1000000001
for i in range(n - 1):
r = int(input())
max_margin = max(r - min_r, max_margin)
min_r = min(r, min_r)
print(max_margin)
| 0 | null | 20,908,078,097,732 | 184 | 13 |
import math
a, b, x = map(int, input().split())
if x == a**2*b:
print(0)
elif x >= a**2*b/2:
print(90 - math.degrees(math.atan(a**3/(2*a**2*b-2*x))))
else:
print((90 - math.degrees(math.atan(2*x/(a*b**2)))))
| three_num = input()
three_num = [int(i) for i in three_num.split(" ")]
a = three_num[0]
b = three_num[1]
c = three_num[2]
cnt = 0
for i in range(a, b + 1):
if c % i == 0:
cnt += 1
print(cnt) | 0 | null | 82,007,870,355,588 | 289 | 44 |
s = input()
ans = 0
for i in range(3):
if s[i] == 'R':
ans += 1
else:
if ans == 1:
break
print(ans) | #176-B
N = input()
sum = 0
for i in range(1,len(N)+1):
sum += int(N[-i])
if int(sum) % 9 == 0:
print('Yes')
else:
print('No')
| 0 | null | 4,665,842,989,092 | 90 | 87 |
'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
# mod = 998244353
dir = [(-1,0),(0,-1),(1,0),(0,1)]
alp = "abcdefghijklmnopqrstuvwxyz"
INF = 1<<32-1
# INF = 10**18
def main():
n,x,m = map(int,ipt().split())
rps = [x]
ln = [-1]*m
ln[x] = 0
nn = x
rs = 0
rg = n
for i in range(1,n):
nn = (nn**2)%m
if ln[nn] == -1:
ln[nn] = i
rps.append(nn)
else:
rs = ln[nn]
rg = i
break
ans = sum(rps[:rs:])
smsg = sum(rps[rs:rg:])
rpl = rg-rs
ans += (n-rs)//rpl*smsg
ans += sum(rps[rs:rs+(n-rs)%rpl:])
print(ans)
return None
if __name__ == '__main__':
main()
| def main():
N,K = map(int,input().split())
syo = N//K
amari = N%K
N = abs(amari-K)
ans = min(N,amari)
return ans
print(main())
| 0 | null | 21,127,188,054,192 | 75 | 180 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=map(int,input().split())
A=list(map(int,input().split()))
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
for i in range(n+1):
S[i]-=i
S[i]%=k
ans=0
D=defaultdict(int)
for i in range(n+1):
s=S[i]
ans+=D[s]
D[s]+=1
if(i>=k-1):
D[S[i-k+1]]-=1
print(ans)
resolve() | '''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
#setrecursionlimit(10**7)
mod = 10**9+7
dir = [(-1,0),(1,0),(0,-1),(0,1)]
alp = "abcdefghijklmnopqrstuvwxyz"
def main():
n,k = map(int,ipt().split())
a = [int(i) for i in ipt().split()]
memo = deque()
memo.append(0)
d = defaultdict(int)
ans = 0
nv = 0
d[0] += 1
for i,ai in enumerate(a):
nv += ai-1
nv %= k
memo.append(nv)
if i >= k-1:
pi = memo.popleft()
d[pi] -= 1
ans += d[nv]
d[nv] += 1
print(ans)
return None
if __name__ == '__main__':
main()
| 1 | 137,459,563,010,772 | null | 273 | 273 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
isMax = False
while K > 0 and not isMax:
isMax = True
B = [0] * N
for i, d in enumerate(A):
l = max(0, i - d)
B[l] += 1
r = i + d + 1
if r < N:
B[r] -= 1
for i in range(N - 1):
isMax &= (B[i] >= N)
B[i + 1] += B[i]
A = B
K -= 1
print(*A[:N])
| import math
n,k=map(int,input().split())
a=[0]*n
ans=[0]*n
a=list(map(int,input().split()))
check=math.ceil(math.log2(n))+1
if (k>=42):
a=[n]*n
print(" ".join(map(str,a)))
else:
for _ in range(k):
ans=[0]*n
table=[0]*n
for i in range(n):
left=max(0,i-a[i])
right=min(n-1,i+a[i])
table[left]+=1
if (right+1<n):
table[right+1]-=1
#print(left,right)
#for j in range(left,right+1):
# ans[j]+=1
#print(table)
for i in range(1,n):
table[i]+=table[i-1]
a=table
print(" ".join(map(str,a))) | 1 | 15,525,970,911,272 | null | 132 | 132 |
import numpy as np
# N: 会社員の人数
# 自分より番号が小さい人が直属の上司
N = int(input())
# A_i は社員番号iの直属の上司の社員番号
A = list(map(int, input().split()))
ans = np.zeros(N)
for i in range(N-1):
ans[A[i]-1] += 1
for i in range(len(ans)):
ans_str = int(ans[i])
print(ans_str)
| import collections
N = int(input())
ls = list(map(int,input().split()))
count = collections.Counter(ls)
for i in range(1,N+1):
if i in count.keys():
print(count[i])
else:
print(0) | 1 | 32,594,815,563,140 | null | 169 | 169 |
H=int(input())
W=int(input())
N=int(input())
cnt=0
black=0
if H>=W:
for i in range(W):
black+=H
cnt+=1
if black>=N:
break
elif H<W:
for i in range(H):
black+=W
cnt+=1
if black>=N:
break
print(cnt) | h=int(input())
w=int(input())
n=int(input())
m=max(h,w)
if n%m==0:
print(int(n/m))
else:
print(int(n/m+1)) | 1 | 88,720,408,358,788 | null | 236 | 236 |
def get_ints():
return map(int, input().split())
def get_list():
return list(map(int, input().split()))
l, r, d = get_ints()
c = 0
for i in range(l, r + 1):
if i % d == 0:
c += 1
print(c) | n=int(input());print(len(set([input() for _ in range(n)]))) | 0 | null | 18,915,556,079,508 | 104 | 165 |
num = list(map(int,input().split()))
num.sort()
print("%d %d %d" %(num[0],num[1],num[2]))
| n = input()
cnt = 0
for i in n:
cnt += int(i)
if cnt % 9 == 0:
print('Yes')
else:
print('No') | 0 | null | 2,395,320,329,156 | 40 | 87 |
from bisect import bisect_left, bisect_right
N = int(input())
S = list(input())
Q = int(input())
D = {chr(ord('a') + i): [] for i in range(26)}
for i, s in enumerate(S):
D[s].append(i)
for q in range(Q):
query = list(input().split())
if query[0] == '1':
i, x = int(query[1]), query[2]
i -= 1
s = S[i]
if s == x:
continue
D[s].remove(i)
next_i = bisect_left(D[x], i)
D[x].insert(next_i, i)
S[i] = x
if query[0] == '2':
l, r = int(query[1]), int(query[2])
l, r = l - 1, r - 1
ans = 0
for i in range(26):
s = chr(ord('a') + i)
li = bisect_left(D[s], l)
ri = bisect_right(D[s], r)
if ri - li > 0:
ans += 1
print(ans) | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
N0 = 2**(N.bit_length())
st = [0] * (N0*2)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) // 2
rm = (R // (R & -R)) // 2
while L < R:
if R <= rm:
yield R - 1
if L <= lm:
yield L - 1
L //= 2; R //= 2
while L > 0:
yield L - 1
L //= 2
def update(i,s):
x = 2 ** (ord(s) - ord('a'))
i += N0-1
st[i] = x
while i > 0:
i = (i-1) // 2
st[i] = st[i*2+1] | st[i*2+2]
def query(l,r):
l += N0
r += N0
ret = 0
while l < r:
if l % 2:
ret |= st[l-1]
l += 1
if r % 2:
r -= 1
ret |= st[r-1]
l //= 2 ; r //= 2
return ret
for i,s in enumerate(sys.stdin.readline().rstrip()):
update(i+1,s)
Q = NI()
for _ in range(Q):
c,a,b = sys.stdin.readline().split()
if c == '1':
update(int(a),b)
else:
ret = query(int(a),int(b)+1)
cnt = 0
b = 1
for i in range(26):
cnt += (b & ret) > 0
b <<= 1
print(cnt)
if __name__ == '__main__':
main() | 1 | 62,452,492,619,840 | null | 210 | 210 |
def main():
N = int(input())
# 桁数を求める
n_digit = 0
idx = 0
while True:
n_digit += 1
n_str = 26 ** n_digit
if idx + 1 <= N <= idx + n_str:
idx += 1
break
else:
idx += n_str
k = N - idx
ans = ''
for i in range(n_digit):
ans += chr(ord('a') + k % 26)
k //= 26
print(ans[::-1])
if __name__ == '__main__':
main()
| d,t,s=map(int,input().split())
if(d<=t*s): print("Yes")
else: print("No") | 0 | null | 7,687,090,488,180 | 121 | 81 |
from collections import deque
n=int(input())-10
q=deque(range(1,10))
while n>=0:
a=str(q.popleft())
a=int(a+a[-1])
for i in range(a-1,a+2):
if str(i)[-2]==str(a)[-1]:
q.append(i)
n-=1
print(q[n])
#print(q,n) | from collections import deque
k = int(input())
q = deque(list(range(1,10)))
for i in range(k):
x = q.popleft()
if x%10:
q.append(10*x+(x%10)-1)
q.append(10*x+(x % 10))
if x%10 != 9:
q.append(10*x+(x%10)+1)
print(x) | 1 | 40,240,641,166,208 | null | 181 | 181 |
s = input()
print('Yes') if s[2:3] == s[3:4] and s[4:5] == s[5:6] else print('No') | s = input()
flg = False
if s[2] == s[3] and s[4] == s[5]:
flg = True
print('Yes') if flg else print('No')
| 1 | 42,275,835,659,118 | null | 184 | 184 |
from collections import Counter
s = input()
ls = len(s)
t = [0]
j = 1
for i in range(ls):
u = (int(s[ls-1-i])*j + t[-1]) % 2019
t.append(u)
j = (j * 10) % 2019
c = Counter(t)
k = list(c.keys())
ans = 0
for i in k:
ans += c[i]*(c[i]-1)/2
print(int(ans)) | s = input()[::-1]
cnts = [0] * 2019
cnts[0] = 1
n, d = 0, 1
for char in s:
n = (n + int(char) * d) % 2019
d = d * 10 % 2019
cnts[n] += 1
ans = 0
for cnt in cnts:
ans += cnt * (cnt - 1) // 2
print(ans)
| 1 | 30,733,501,586,102 | null | 166 | 166 |
import sys
input = sys.stdin.readline
import numpy as np
from numba import njit
def read():
N, K = map(int, input().strip().split())
A = np.fromstring(input().strip(), dtype=np.int32, sep=" ")
return N, K, A
@njit
def solve(N, K, A):
d = np.empty(N+1, dtype=np.int32)
for k in range(K):
for i in range(N):
d[i] = 0
for i in range(N):
l = max(0, i-A[i])
r = min(N, i+1+A[i])
d[l] += 1
d[r] -= 1
terminate = True
v = 0
for i in range(N):
v += d[i]
A[i] = v
if terminate and A[i] < N:
terminate = False
if terminate:
break
return A
if __name__ == '__main__':
inputs = read()
outputs = solve(*inputs)
print(*outputs)
| from itertools import permutations as p
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
j = 0
for i in p(range(1, N + 1)):
j += 1
if i == P: a = j
if i == Q: b = j
if a - b >= 0: print(a - b)
else: print(b - a) | 0 | null | 57,912,130,811,120 | 132 | 246 |
n=int(input())
a=[1,1]
def fib(n):
if n <= 1:
return a[n]
for i in range(2,n+1):
a.append(a[i-1]+a[i-2])
return a[n]
print(fib(n))
| import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
dp = [0] * 47
dp[0] = 1
dp[1] = 1
for i in range(2,N+1):
dp[i] = dp[i-1] + dp[i-2]
print(dp[N])
if __name__ == '__main__':
main()
| 1 | 1,956,613,552 | null | 7 | 7 |
a,b = map(int,input().split())
for i in range(1,100000):
x = i*8
y = i*10
if x//100 == a and y//100 == b:
print(i)
exit()
print(-1) | A = int(input())
B = int(input())
C = 6 - A - B
print(C) | 0 | null | 83,398,032,679,698 | 203 | 254 |
n = int(input())
a = list(map(int, input().split()))
if n%2 == 0:
dp = a[:2]
for i in range(1, n//2):
dp = dp[0] + a[2*i], max(dp) + a[2*i+1]
else:
dp = a[:3]
for i in range(1, n//2):
dp = dp[0] + a[2*i], max(dp[:2]) + a[2*i+1], max(dp) + a[2*i+2]
print(max(dp)) | from collections import deque
def matrix(n):
for _ in range(n):
adj = list(map(int, input().split()))
i = adj[0]
v = adj[2:]
for j in v:
mat[i - 1][j - 1] = 1
def bfs(v):
d[v] = 1
dist[v] = 0
dq.append(v)
while dq:
v = dq.popleft()
for n, i in enumerate(mat[v]):
if i == 1 and not d[n]:
d[n] = 1
dist[n] = dist[v] + 1
dq.append(n)
n = int(input())
mat = [[0] * n for _ in range(n)]
d, dist = [0] * n, [-1] * n
dq = deque()
matrix(n)
bfs(0)
for i, v in enumerate(dist):
print(i + 1, v) | 0 | null | 18,859,038,422,378 | 177 | 9 |
a, b, x = map(int, input().split())
import math
if a**2 * b < 2 * x:
tangent = (2 * (a**2 * b - x)) / a ** 3
theta = math.degrees(math.atan(tangent))
print(theta)
else:
tangent = (a * b**2) / (2 * x)
theta = math.degrees(math.atan(tangent))
print(theta) | import math
def cin():
in_ = list(map(int,input().split()))
if len(in_) == 1: return in_[0]
else: return in_
a, b, x = cin()
if a * a * b == x: print(0)
else:
if 2 * x <= a ** 2 * b:
p = 2 * x / (a * b)
print(math.degrees(math.atan(b / p)))
else:
S = x / a
p = 2 * (a * b - S) / a
print(90 - math.degrees(math.atan(a / p))) | 1 | 163,798,472,515,118 | null | 289 | 289 |
from collections import Counter
n = int(input())
c = list(input())
count = Counter(c)
ans = float('inf')
w = 0
r = 0
if count.get('R'):
r = count['R']
ans = max(w, r)
for i in range(n):
if c[i]=='W':
w += 1
else:
r -= 1
ans =min(max(w,r), ans)
print(ans) | N = int(input())
C = list(input())
r = C.count("R")
cnt = 0
for i in range(r):
if C[i] == "W":
cnt += 1
print(cnt) | 1 | 6,327,800,744,088 | null | 98 | 98 |
import math
N = int(input())
n = math.ceil(N/1000)
print(1000*n-N) | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
h,n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if h <= s:
print("Yes")
else:
print("No")
| 0 | null | 42,980,284,665,108 | 108 | 226 |
import math
N, K = (int(a) for a in input().split())
A = [int(a) for a in input().split()]
def isOK(X):
cutcount = 0
for i in range(N):
cutcount += math.ceil(A[i] / X) - 1
if cutcount <= K:
return True
else:
return False
def binary_search():
left = 0
right = max(A) + 1
while (right - left) > 1:
mid = left + (right - left) // 2
if (isOK(mid)):
right = mid;
else:
left = mid;
return right
print(binary_search()) | n, k = map(int, input().split())
a_i = list(map(int, input().split()))
def f(n):
cnt = 0
for a in a_i:
cnt += (a - 1) // n
if cnt > k: return False
else: return True
l, r = 0, max(a_i)
while True:
if r - l <= 1: break
val = (l + r) // 2
if f(val) == True: r = val
else: l = val
print(r) | 1 | 6,485,239,728,668 | null | 99 | 99 |
N = int(input())
A = [0] * (N+1)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
wk = x**2 + y**2 + z**2 + x*y + y*z + z*x
if wk <= N:
A[wk] += 1
for i in range(1,N+1):
print(A[i]) | n=int(input())
a=[0]*n
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
k=x*x+y*y+z*z+x*y+y*z+z*x
if k <=n:
a[k-1]+=1
for q in range(n):
print(a[q]) | 1 | 7,989,410,135,358 | null | 106 | 106 |
n, p = map(int, input().split())
s = [int(i) for i in input()]
p_cnt = 0
if p == 2 or p == 5:
for i in range(n):
if s[i] % p == 0:
p_cnt += i+1
else:
s = s[::-1]
div_dic = dict(zip(range(p), [0] * p))
tmp = 0
for i in range(n):
tmp += s[i] * pow(10, i, p)
tmp %= p
div_dic[tmp] += 1
for v in div_dic.values():
p_cnt += v * (v - 1)
p_cnt //= 2
p_cnt += div_dic.get(0)
print(p_cnt) | n,p=map(int,input().split())
s=input()
ans=0
if p==2:
for i in range(n):
if int(s[i])%2==0:
ans+=i+1
print(ans)
elif p==5:
for i in range(n):
if int(s[i])%5==0:
ans+=i+1
print(ans)
else:
s=s[::-1]
accum=[0]*n
d=dict()
for i in range(n):
accum[i]=int(s[i])*pow(10,i,p)%p
for i in range(n-1):
accum[i+1]+=accum[i]
accum[i+1]%=p
accum[-1]%=p
#print(accum)
for i in range(n):
if accum[i] not in d:
if accum[i]==0:
ans+=1
d[accum[i]]=1
else:
if accum[i]==0:
ans+=1
ans+=d[accum[i]]
d[accum[i]]+=1
#print(d)
print(ans) | 1 | 57,956,615,480,328 | null | 205 | 205 |
def main():
n = int(input())
X = [int(x) for x in input().split()]
ave_x = int(sum(X) / len(X))
error_1 = 0
error_2 = 0
for x in X:
error_1 += (x-ave_x) ** 2
error_2 += (x-(ave_x+1)) ** 2
min_e = min(error_1, error_2)
print(min_e)
if __name__ == '__main__':
main() | x = raw_input()
a, b, c = x.split()
a = int(a)
b = int(b)
c = int(c)
kai = 0
d = b + 1
for i in range(a, d):
if c % i == 0:
kai += 1
print kai | 0 | null | 32,691,939,704,452 | 213 | 44 |
n, m = map(int, input().split())
S = list(input())
"""
9 3
0001000100
0010001000
3 2 3 1
"""
S_r = S[::-1] + ["0"] #スタートのぶん付け足し
ans = []
now = 0
while now < n:
flg = True
for i in range(m,0,-1):
if now + i <= n and S_r[now+i] == "0":
ans.append(i)
now += i
flg = False
break
if flg:
print(-1)
exit()
print(*ans[::-1]) |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M=MI()
S=list(input())
S2=S[::-1]
now=0
ans=[]
while now!=N:
nxt=now+M
if nxt>N:
nxt=N
while S2[nxt]=="1":
nxt-=1
if now==nxt:
ans=[-1]
break
ans.append(nxt-now)
now=nxt
print(' '.join(map(str, ans[::-1])))
main()
| 1 | 139,294,946,460,960 | null | 274 | 274 |
H1, M1, H2, M2, K = map(int, input().split())
getUpTime = H1 * 60 + M1
goToBed = H2 * 60 + M2
DisposableTime = goToBed - getUpTime
if K > DisposableTime:
print(0)
else:
print(DisposableTime - K) | h1, m1, h2, m2, k = map(int, input().split())
st = h1 * 60 + m1
ed = h2 * 60 + m2
ans = ed - st - k
if ans < 0:
ans = 0
print(ans)
| 1 | 18,158,049,620,062 | null | 139 | 139 |
input=raw_input().split()
a1=int(input[0])
a2=int(input[1])
print "%d %d"%(a1*a2,2*(a1+a2)) | line = raw_input()
lis = line.split()
a = int(lis[0])
b = int(lis[1])
s = a * b
len = 2 * (a + b)
print str(s) + " " + str(len) | 1 | 304,424,280,830 | null | 36 | 36 |
N = int(input())
li = list(map(int,input().rstrip().split(' ')))
count = 0
for i in li[0::2]:
if i%2==1:count += 1
print(count) | n=int(input())
m=1000000007
print(((pow(10,n,m)-2*pow(9,n,m)+pow(8,n,m))+m)%m)
| 0 | null | 5,505,914,292,060 | 105 | 78 |
N,M=map(int,input().split())
sets=[]
if N%2==1:
for i in range(M):
sets.append((i+1,i+1+(N-3-2*i)+1))
elif N%2==0:
count=0
kukan=[]
for i in range(N//2-1):
kukan.append(count)
count+=2
if count==N//2 or count==N//2-1:
count+=1
kukan.reverse()
for i in range(M):
sets.append((i+1,i+1+kukan[i]+1))
for set1 in sets:
print(set1[0],set1[1]) | import math
import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7
sys.setrecursionlimit(1000010)
N,M = nm()
used = [0] * N
start = 0
if N % 2 != 0:
s = (N-1)//2
else:
s = N//2 - 1
for i in range(1,M+1):
q= (i+1)//2
if i % 2 !=0:
print(q,N+1-q)
else:
print(s+1-q,s+1+q)
| 1 | 28,798,932,914,220 | null | 162 | 162 |
a = raw_input()
while a!='0':
s = 0
for i in range(len(a)):
s += int(a[i])
print s
a = raw_input() | x = int(input())
print('1' if x == 0 else '0') | 0 | null | 2,227,184,703,212 | 62 | 76 |
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
n = I()
dp = [0] * (500000)
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
pe = x**2 + y**2 + z**2 + x*y + y*z + z*x
dp[pe] += 1
print(*dp[1:n+1],sep='\n')
| ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
import math
h,a = nm()
print(math.ceil(h/a))
| 0 | null | 42,609,155,318,290 | 106 | 225 |
import math
p = 100
for i in range(int(input())):
p = math.ceil(p * 1.05)
print(p * 1000) | def main():
debt = 100000
n = int(input())
for i in range(n):
debt = debt * 1.05
if debt % 1000 > 0:
debt = (debt // 1000 * 1000) + 1000
print(int(debt))
if __name__ == '__main__':
main() | 1 | 906,012,672 | null | 6 | 6 |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n-1):
for j in range(0,n-i-1):
if a[j]>a[j+1]:a[j],a[j+1]=a[j+1],a[j];c+=1
print(*a)
print(c)
| #coding: utf-8
#ALDS1_2A
def pnt(s):
for i in xrange(len(s)):
print s[i],
print
n=int(raw_input())
a=map(int,raw_input().split())
sw=0
flag=True
while flag:
flag=False
for j in xrange(n-1,0,-1):
if a[j]<a[j-1]:
a[j],a[j-1]=a[j-1],a[j]
flag=True
sw+=1
pnt(a)
print sw | 1 | 16,731,296,088 | null | 14 | 14 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**6)
input=lambda: sys.stdin.readline().rstrip()
show_flg=False
#show_flg=True
n,m=LI()
## Segment Tree ##
## Initializer Template ##
# Range Sum: sg=SegTree(n,0)
# Range Minimum: sg=SegTree(n,inf,min,inf)
class SegTree:
def __init__(self,n,init_val=0,function=lambda a,b:a+b,ide=0):
self.n=n
self.ide_ele=ide_ele=ide
self.num=num=2**(n-1).bit_length()
self.seg=seg=[self.ide_ele]*2*self.num
self.segfun=segfun=function
#set_val
for i in range(n):
self.seg[i+self.num-1]=init_val
#built
for i in range(self.num-2,-1,-1) :
self.seg[i]=self.segfun(self.seg[2*i+1],self.seg[2*i+2])
def update(self,k,x):
k += self.num-1
self.seg[k] = x
while k:
k = (k-1)//2
self.seg[k] = self.segfun(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.segfun(res,self.seg[p])
if q&1 == 1:
res = self.segfun(res,self.seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.segfun(res,self.seg[p])
else:
res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
return res
def __str__(self):
# 生配列を表示
rt=self.seg[self.num-1:self.num-1+self.n]
return str(rt)
s=[int(i) for i in input()]
def dp(b,m): # N log (N)
N=len(b)-1
n=N+1
sg=SegTree(n,inf,min,inf)
sg.update(0,0)
dp=[0]+[inf]*(N)
for i in range(N):
if b[i+1]==1:
continue
dp[i+1]=sg.query(max(i-m+1,0),i+1)+1
sg.update(i+1,dp[i+1])
#show(seg)
show(sg)
return dp
dp1=dp(s,m)
step=dp1[n]
if step==inf:
print(-1)
exit()
dp2=dp(s[::-1],m)[::-1]
show(dp1,'dp1')
move=[0]
ans=[]
j=1
for i in range(step,0,-1): # N
while j<=n and dp2[j]!=i-1:
j+=1
move.append(j)
for i in range(len(move)-1):
ans.append(move[i+1]-move[i])
print(*ans)
| print(8 - (int(input()) - 400) // 200)
| 0 | null | 72,567,760,863,390 | 274 | 100 |
n = int(input())
s = input()
ans = 'No'
if n%2 == 0:
mid = int(n/2)
if s[:mid] == s[mid:]:
ans = 'Yes'
print(ans) | N = int(input())
S = input()
if S[:N//2] == S[N//2:]:
print("Yes")
else:
print("No") | 1 | 146,620,431,727,090 | null | 279 | 279 |
h1, m1, h2, m2, k = map(int, input().split())
if m1 <= m2:
h = h2 - h1
m = m2 - m1
else:
h = h2 - h1 - 1
m = m2 - m1 + 60
m += 60 * h
print(m - k)
| N, K = list(map(int, input().split()))
if abs(N - K) > N:
print(N)
else:
if N % K == 0:
N = 0
else:
N = abs(N % K - K)
print(N) | 0 | null | 28,746,283,733,760 | 139 | 180 |
import sys
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
sum_A = sum(A)
center = sum_A / 2
total = 0
near_center = 0
for a in A:
total += a
if abs(total - center) < abs(near_center - center):
near_center = total
ans = abs((sum_A - near_center) - near_center)
print(ans)
if __name__ == "__main__":
main()
| S = input()
ctr = 0
for i in range (len(S)//2):
A,B = S[i], S[-1-i]
if A != B:
ctr += 1
print(ctr) | 0 | null | 131,768,713,861,138 | 276 | 261 |
n=input()
t=h=0
for i in range(n):
x,y=map(str,raw_input().split())
if x==y:
t+=1
h+=1
elif x<y:
h+=3
else:
t+=3
print t,h | import sys
tmp = '#.' * 151
def draw(H, W):
odd = tmp[:W]
even = tmp[1:W + 1]
print((odd + '\n' + even + '\n') * (H // 2) + (odd + '\n' if H % 2 else ''))
for line in sys.stdin:
H, W = map(int, line.split())
if H == W == 0:
break
draw(H, W) | 0 | null | 1,433,870,723,392 | 67 | 51 |
from sys import exit
import math
import collections
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
s = input()
print(chr(ord(s)+1)) | import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(input())
s = []
for _ in range(n):
s.append(input())
inc = []
zeros = []
dec = []
for i, j in enumerate(s):
minimum = 0
now = 0
for k in j:
if k == "(":
now += 1
else:
now -= 1
minimum = min(minimum, now)
if now > 0:
inc.append([minimum, i])
elif now < 0:
dec.append([minimum - now, i])
else:
zeros.append([minimum, i])
inc.sort(reverse=True)
dec.sort()
now = 0
for i, j in inc:
for k in s[j]:
if k == "(":
now += 1
else:
now -= 1
if now < 0:
print("No")
sys.exit()
for i, j in zeros:
for k in s[j]:
if k == "(":
now += 1
else:
now -= 1
if now < 0:
print("No")
sys.exit()
for i, j in dec:
for k in s[j]:
if k == "(":
now += 1
else:
now -= 1
if now < 0:
print("No")
sys.exit()
ans = "Yes" if now == 0 else "No"
print(ans)
| 0 | null | 57,959,004,921,412 | 239 | 152 |
n=int(input())
s=input()
ans=0
for i in range(10):
for j in range(10):
for k in range(10):
tar=str(i)+str(j)+str(k)
now=0
for l in range(n):
if tar[0+now]==s[l]:now+=1
if now==3:
ans+=1
break
print(ans) | while True:
s = input()
if s == '0':break
print(sum(int(c) for c in s)) | 0 | null | 65,467,290,961,148 | 267 | 62 |
s = input().split('S')
m = 0
for i in s:
if len(i) > m:
m = len(i)
print(m)
| n=int(input())
wl={}
for i in range(n):
w=input()
if w not in wl:
wl[w]=0
wl[w]+=1
wm=max(wl.values())
wl3=sorted(wl.items())
for i in range(len(wl3)):
if wl3[i][1]==wm:
print(wl3[i][0]) | 0 | null | 37,493,755,390,400 | 90 | 218 |
# モンスターの体力H
# アライグマの必殺技の種類N
# i番目の必殺技使うと、モンスターの体力Ai減らせる
# H - (A1 + A2 + A3...) <= 0 となるなら 'Yes',
# ならないなら'No'が出力される
h, n = map(int, input().split())
damage = list(map(int, input().split()))
if h - sum(damage) <= 0:
print("Yes")
else:
print("No") | a,b=map(str,input().split())
a=int(a)
b=100*int(b[0])+10*int(b[2])+1*int(b[3]) #bを100倍した値(整数)に直す
print((a*b)//100) | 0 | null | 47,182,060,254,352 | 226 | 135 |
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
a,b= map(int, input().split())
# xが１０円から１００００円まで
ans = -1
for i in range(10,10001):
a1 = int(i*0.08)
b1 = int(i*0.1)
#print(a1,b1)
if (a1 == a and b1 == b):
ans = i
break
print(ans)
| a, _ = map(int, input().split())
c, d = map(int, input().split())
if a != c and d == 1:
print("1")
else:
print("0")
| 0 | null | 90,428,365,928,222 | 203 | 264 |
n = int(input())
count=0
for i in range(1,n//2+1):
j = n - i
if i != j:
count += 1
print(count) | import math
N = int(input())
ans = math.floor(N / 2)
if N % 2 == 0:
print(ans - 1)
else:
print(ans) | 1 | 153,547,560,524,402 | null | 283 | 283 |
import sys
import numpy as np
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = map(int, readline().split())
A = [0] + list(map(int,readline().split()))
S = np.cumsum(A)
dic = defaultdict(int)
ans = 0
SS = [0] * (N+1)
for i in range(1,N+1):
rem = (S[i]-i) % K
SS[i] = rem
for i in range(N+1):
if i >= K:
dic[SS[i-K]] -= 1
ans += dic[SS[i]]
dic[SS[i]] += 1
print(ans) | n = int(input())
a_list = [int(x) for x in input().split()]
a_sum = sum(a_list)
m = 10 ** 9 + 7
ans = 0
for i in range(n - 1):
a_sum -= a_list[i]
ans = (ans + a_list[i] * a_sum) % m
print(ans) | 0 | null | 70,739,623,125,340 | 273 | 83 |
n,*a=map(int,open(0).read().split())
mod=10**9+7
ans=0
for j in range(60):
cnt=0
for i in range(n):
cnt+=a[i]&1
a[i]=(a[i]>>1)
ans+=(cnt*(n-cnt)%mod)*pow(2,j,mod)
ans%=mod
print(ans) | result = [(temp1 + str(temp2)) for temp1 in ('S ','H ','C ','D ') for temp2 in range(1,14)]
for check in range(int(input())) :
result.remove(input())
for temp in result :
print(temp) | 0 | null | 61,738,911,241,348 | 263 | 54 |
from collections import deque
N,M=map(int,input().strip().split())
l=[]
dp=[[] for _ in range(N)]
for _ in range(M):
a,b=map(int,input().strip().split())
l.append((a,b))
dp[a-1].append(b)
dp[b-1].append(a)
d=deque([1])
visited=[0 for _ in range(N)]
visited[0]=1
cnt=1
while d:
tmp=d.popleft()
for e in dp[tmp-1]:
if visited[e-1]==0:
visited[e-1]=tmp
cnt+=1
d.append(e)
if cnt!=len(visited):
print("No")
else:
print("Yes")
for n in range(1,N):
print(visited[n]) | a,b=map(int,input().split())
list=[[0 for i in range(2)] for j in range(a)]
for i in range(a):
list[i]=input().split()
n=0
s=0
while n!=a:
if int(list[n][1])>b:
list[n][1]=int(list[n][1])-b
list.append(list[n])
list.pop(n)
s+=b
else:
print(list[n][0],s+int(list[n][1]))
s+=int(list[n][1])
n+=1
| 0 | null | 10,381,856,388,242 | 145 | 19 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 998244353
def resolve():
n = int(input())
D = list(map(int, input().split()))
MAX_L = max(D) + 1
cnt = [0] * MAX_L
for d in D:
cnt[d] += 1
if cnt[0] != 1 or D[0] != 0:
print(0)
exit()
res = 1
for i in range(1, MAX_L):
if cnt[i] == 0:
print(0)
break
res *= pow(cnt[i - 1], cnt[i], mod)
res %= mod
else:
print(res)
if __name__ == '__main__':
resolve()
| print(input()[1] == "B" and "ARC" or "ABC") | 0 | null | 89,749,201,855,166 | 284 | 153 |
a = int(input())
out = a + a**2 + a**3
print(out) | def main():
a=int(input())
print(a*(1+a+a*a))
main() | 1 | 10,235,586,465,508 | null | 115 | 115 |
from sys import stdin
input = stdin.readline
def main():
N = int(input())
if N % 2:
print(0)
return
nz = 0
i = 1
while True:
if N//(5**i)//2 > 0:
nz += (N//(5**i)//2)
i += 1
else:
break
print(nz)
if(__name__ == '__main__'):
main()
| 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()
ans = 0
if n % 2 == 1:
ans = 0
else:
div = 10
while div <= n:
ans += n // div
div *= 5
print(ans) | 1 | 115,669,804,234,112 | null | 258 | 258 |
N = int(input())
A = list(map(int,input().split()))
odds_or_even = N%2+2
inf = -float("inf")
dp = [[inf for _ in range(N+1)] for _ in range(odds_or_even)]
dp[0][0] = 0
for i in range(N):
dp[0][i+1] = dp[0][i]+A[i]*((i+1)%2)
for j in range(1,odds_or_even):
for i in range(N):
dp[j][i+1] = max(dp[j-1][i],dp[j][i]+A[i]*((i+j+1)%2))
print(dp[odds_or_even-1][N]) | # -*- coding: utf-8 -*-
def main():
s_length = int(raw_input())
s = [int(x) for x in raw_input().strip().split(' ')]
t_length = int(raw_input())
t = [int(x) for x in raw_input().strip().split(' ')]
counter = 0
for value in t:
if value in s:
counter += 1
print counter
if __name__ == '__main__':
main() | 0 | null | 18,749,173,628,790 | 177 | 22 |
def main():
n = int(input())
even = n // 2
print(1 - even / n)
if __name__ == "__main__":
main()
| a = int(input())
c=0
for i in range(a + 1):
if bool(i%3!=0 and i % 5 != 0):
c += i
print(c) | 0 | null | 106,154,228,422,320 | 297 | 173 |
X = int(input())
bank = 100
cnt = 0
while bank < X:
bank = bank + bank//100
cnt += 1
print(cnt)
| X = int(input())
price = 100
year = 0
while price<X:
price += price//100
year += 1
print(year) | 1 | 27,167,013,608,680 | null | 159 | 159 |
a,b = input().split()
a = int(a)
b_list = list(b)
b_list.pop(1)
b_list = [int(s) for s in b_list]
p_100 = a*b_list[0]*100 + a*b_list[1]*10 + a*b_list[2]
p = p_100//100
print(p) | import math
a, b = map(str, input().split())
a2 = int(a)
b2 = int(b.replace('.', ''))
print(int((a2 * b2)//100)) | 1 | 16,643,293,832,920 | null | 135 | 135 |
import sys
# sys.setrecursionlimit(100000)
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():
n = input_int()
d = {}
# n以下のaで始まり、bで終わる整数のそれぞれ求める
# 計算量: O(log_n)
for a in range(1, 10):
for b in range(1, 10):
cnt = 0
# 1桁の整数が条件を満たすケース
if a == b and a <= n:
cnt += 1
# 2桁以上の整数で条件を満たすケース
i = 1
while True:
_min = a * (10**i) + b # 整数が a0000b
_max = a * (10**i) + b
_i = i - 1
while _i > 0:
_max += 9 * (10**_i) # 整数が a999b
_i -= 1
if _max <= n:
cnt += 10**(i - 1)
i += 1
continue
elif _min > n:
break
else: # a0..0b <= n < a9..9b
cnt += ((n - _min) // 10) + 1
break
d[10 * a + b] = cnt
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[a * 10 + b] * d[b * 10 + a]
print(ans)
return
if __name__ == "__main__":
main()
| class Counter(dict):
def __missing__(self, i):
return 0
n = int(input())
counter = Counter()
for x in map(str, range(1, n+1)):
head = x[0]
tail = x[-1]
counter[(head, tail)] += 1
ans = 0
for (head, tail), cnt in counter.items():
ans += cnt * counter[(tail, head)]
print(ans)
| 1 | 86,565,087,461,172 | null | 234 | 234 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.