code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
a, b, c = input().split()
x = int(a)
y = int(b)
z = int(c)
if z >= x:
z -= x
x = 0
else:
x -= z
z = 0
if z >= y:
z -= y
y = 0
else:
y -= z
z = 0
print(str(x),str(y))
| def solve(a,b,k):
if k <= a: return a - k, b
elif k <= a + b: return 0, b - (k - a)
else: return 0, 0
a,b,k = map(int,input().split())
ans_1, ans_2 = solve(a,b,k)
print(f"{ans_1} {ans_2}") | 1 | 104,648,247,091,320 | null | 249 | 249 |
import sys
readline = sys.stdin.readline
DIV = 998244353
N,S = map(int,readline().split())
A = list(map(int,readline().split()))
# ある数の取り得る状態は以下
# (1)部分集合Pに含まれない
# (2)部分集合Pに含まれ、和に使われている
# (3)部分集合Pに含まれ、和に使われていない
# dp[j][k] = 部分集合Pに含まれ(j)、総和がkになっている場合の数
dp = [[0] * (S + 1) for j in range(2)]
dp[0][0] = 1
for i in range(N):
nextline = [[0] * (S + 1) for j in range(2)]
for k in range(S, -1, -1):
# (1)部分集合Pに含まれない
nextline[0][k] += dp[0][k]
nextline[0][k] += dp[1][k]
nextline[0][k] %= DIV
# (2)部分集合Pに含まれ、和に使われている
if k + A[i] <= S:
nextline[1][k + A[i]] += dp[0][k]
nextline[1][k + A[i]] += dp[1][k]
nextline[1][k + A[i]] %= DIV
# (3)部分集合Pに含まれ、和に使われていない
nextline[1][k] += dp[0][k]
nextline[1][k] += dp[1][k]
nextline[1][k] %= DIV
dp = nextline
print((dp[0][-1] + dp[1][-1]) % DIV)
| N,S=map(int,input().split())
A=[0]+list(map(int,input().split()))
H=[[0]*(S+1) for i in range(N+1)]
#H[x][y]:1,...xに制限したときに,和がyになるのは何個?
M=998244353
for x in range(N+1):
H[x][0]=2**x
for x in range(1,N+1):
for s in range(S+1):
if s>=A[x]:
H[x][s]=(2*H[x-1][s]+H[x-1][s-A[x]])%M
else:
H[x][s]=(2*H[x-1][s])%M
print(H[-1][-1])
| 1 | 17,794,838,109,176 | null | 138 | 138 |
N=int(input())
c=0;
while N-26**c>=0:
N-=26**c
c+=1
d=[0]*(c-1)
i=0
for i in range(c):
d.insert(c-1,N%26)
N=(N-d[i])//26
i+=1
e=[]
s=''
for i in range(2*c-1):
e.append(chr(97+d[i]))
s+=e[i]
print(s[c-1:2*c-1]) | def main():
def inputs():
li = []
count = 0
try:
while count < 200:
li.append(input())
count += 1
except EOFError:
return li
return li
li = inputs()
for x in li:
a = x.split(" ")
result = len(str(int(a[0]) + int(a[1])))
print(result)
return None
if __name__ == '__main__':
main() | 0 | null | 5,998,886,714,340 | 121 | 3 |
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
b[i],c[i]=map(int,input().split())
N=[0]*(10**5)
s=0
for i in range(n):
N[a[i]-1]+=1
s+=a[i]
for i in range(q):
s+=(c[i]-b[i])*N[b[i]-1]
N[c[i]-1]+=N[b[i]-1]
N[b[i]-1]=0
print(s) | n = int(input())
s = list(input())
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r * g * b
for i in range(n-2):
for j in range(i+1,n-1):
if (j - i) + j < n:
k = (j - i) + j
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans) | 0 | null | 24,032,797,891,840 | 122 | 175 |
N,K=map(int, input().split())
def change(N,shinsu):
keta=0
for i in range(10**9):
if N<shinsu**i:
keta+=i
break
ans=[0]*keta
check=0
for i in range(1,keta+1):
j=N//(shinsu**(keta-i))
ans[check]=j
check+=1
N-=(j)*(shinsu**(keta-i))
return ans
print(len(change(N,K))) | #!/usr/bin/env python3
import collections
N = int(input().split()[0])
s_list = []
for _ in range(N):
s = input()
s_list.append(s)
counter = collections.Counter(s_list)
for item in ["AC", "WA", "TLE", "RE"]:
print(f"{item} x {counter[item]}")
| 0 | null | 36,314,646,023,668 | 212 | 109 |
N, M = (int(x) for x in input().split())
A = list(map(int, input().split()))
sum=0
cnt=0
for i in range(N):
sum+=A[i]
sum/=4*M
for i in range(N):
if A[i]>=sum:
cnt+=1
if cnt>=M:
print("Yes")
else:
print("No") | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N-1):
if A[i] > A[i+1]:
diff = A[i] - A[i+1]
ans += diff
A[i+1] += diff
print(ans) | 0 | null | 21,760,656,790,038 | 179 | 88 |
N,K= map(int,input().split())
p = list(map(int,input().split()))
sum1=0.0
for i in range (K):
sum1=((p[i]+1)/2.0)+sum1
sum2=sum1
for i in range(N-K):
sum1=sum1+((p[i+K]-p[i])/2.0)
if sum1>sum2:
sum2=sum1
print(sum2) | num = input().split()
x = [int(num) for num in num]
for i in range(5):
if x[i] == 0:
print(i+1) | 0 | null | 44,171,858,592,540 | 223 | 126 |
from sys import stdin
input = stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
order = sorted(range(1, N+1), key=lambda i: A[i-1])
print(*order, sep=' ')
if(__name__ == '__main__'):
main()
| N = int(input())
A = list(map(int, input().split()))
t = [(i + 1, A[i]) for i in range(N)]
t_sorted = sorted(t, key=lambda a: a[1])
ans = ''
for i in range(N):
ans += str(t_sorted[i][0]) + ' '
print(ans)
| 1 | 180,645,219,273,190 | null | 299 | 299 |
x, k, d = map(int, input().split())
ax = abs(x)
n = ax // d
if n >= k:
ans = ax - k*d
else:
a = ax - n*d
if (k - n) % 2:
ans = abs(a - d)
else:
ans = abs(a)
print(ans)
| x1, x2, x3, x4, x5 = map(int,input().split())
print(15-x1-x2-x3-x4-x5) | 0 | null | 9,373,213,228,938 | 92 | 126 |
from sys import stdin
while True:
h, w = (int(n) for n in stdin.readline().rstrip().split())
if h == w == 0:
break
for _ in range(h):
print("#" * w)
print()
| n, x, m = map(int, input().split())
ans = 0
prev_set = set()
prev_list = list()
ans_hist = list()
r = x
for i in range(n):
if i == 0:
pass
else:
r = (r * r) % m
if r == 0:
break
if r in prev_set:
index = prev_list.index(r)
period = i - index
count = (n - index) // period
rest = (n - index) % period
ans = sum(prev_list[:index])
ans += sum(prev_list[index:i]) * count
# ans += (ans - ans_hist[index - 1]) * (count - 1)
ans += sum(prev_list[index:index+rest])
# ans += (ans_hist[index + rest - 1] - ans_hist[index - 1])
break
else:
ans += r
prev_set.add(r)
prev_list.append(r)
ans_hist.append(ans)
print(ans)
| 0 | null | 1,811,969,642,252 | 49 | 75 |
s = str(input())
n = len(s)
dp = [[0]*2 for _ in range(n+1)]
dp[0][1] = 1
for i in range(n):
p = int(s[i])
dp[i+1][0] = min(dp[i][1]+10-p,dp[i][0]+p)
dp[i+1][1] = min(dp[i][1]+10-p-1,dp[i][0]+p+1)
print(dp[-1][0]) | S = input()
l = [0] * (len(S)+1)
r = [0] * (len(S)+1)
for i in range(len(S)):
if S[i] == '<':
l[i+1] = l[i] + 1
for i in range(len(S)-1,-1,-1):
if S[i] == '>':
r[i] = r[i+1] + 1
print(sum([max(l[i],r[i]) for i in range(len(S)+1)]))
| 0 | null | 113,468,118,073,540 | 219 | 285 |
A_int_list = list(map(int, input().split()))
if 22 <= sum(A_int_list):
print('bust')
else:
print('win')
| print(['bust', 'win'][sum(map(int, input().split()))<=21]) | 1 | 118,643,005,928,678 | null | 260 | 260 |
x = int(raw_input())
print "%d" % x**3 | t = int(input())
s = t**3
print(s) | 1 | 270,485,662,722 | null | 35 | 35 |
k = int(input())
s = input()
if len(s)>k:
print('{}...'.format(s[:k]))
else:
print(s) | S = input().rstrip()
if S[-1] == 's':
print(S + 'es')
else:
print(S + 's') | 0 | null | 10,911,958,039,008 | 143 | 71 |
n = int(input())
L = []
for _ in range(n):
x, l = map(int, input().split())
left = x - l
right = x + l
L.append((left, right))
L = sorted(L, key=lambda x: x[1])
ans = 0
prev = -float('inf')
for r in L:
if r[0] >= prev:
ans += 1
prev = r[1]
print(ans)
| def resolve():
"""
典型的な区間スケジューリング問題
各スケジュールの終了時間が短いものから選択していけば，
選択するスケジュール数が最大になる．
今回は腕の可動範囲上限の小さいものから選択していく．
"""
import sys
readline = sys.stdin.readline
N = int(readline())
XL = [list(map(int, readline().split())) for _ in [0] * N]
# 腕の可動範囲の(上限, 下限)のリスト生成
t = [(x + length, x - length) for x, length in XL]
# 複数要素を含む要素のsortではインデックスの小さい要素から比較していきソート
t.sort() # リストを腕の上限の昇順(小さい順)でソート
time = -float('inf') # time=0でもおｋ
ans = 0
for i in range(N):
end, start = t[i] # tはソート済故，上限が小さい順に選出される
if time <= start: # 腕の下限が既存の腕と重ならないか判定
ans += 1
time = end # 現在の腕の上限を記録
print(ans)
if __name__ == "__main__":
resolve()
| 1 | 89,776,889,773,098 | null | 237 | 237 |
import numpy as np
def main():
n,s=map(int,input().split())
A=list(map(int,input().split()))
dp=np.array([0 for i in range(s+1)])
dp[0]=1
for ai in A:
tmp=dp[:-ai].copy()
#print(tmp)
dp*=2
dp[ai:]+=tmp
dp%=998244353
print(dp[s])
if __name__=="__main__":
main()
| MOD = 998244353
N, S = map(int, input().split())
A = list(map(int, input().split()))
DP = [[0] * (1 + S) for _ in range(1 + N)] # DP[i][j] はi番目までみた時に総和がjと成る組み合わせの総和
# 初期化
DP[0][0] = 1
# 漸化式 DP[i][j] = DP[i-1][j]*2 + DP[i-1][j-A[i]]
for i in range(1, N + 1):
for j in range(S + 1):
if j >= A[i - 1]:
DP[i][j] = DP[i - 1][j] * 2 + DP[i - 1][j - A[i - 1]]
else:
DP[i][j] = DP[i - 1][j] * 2
DP[i][j] %= MOD
print(DP[N][S])
| 1 | 17,611,281,009,700 | null | 138 | 138 |
N = int(input())
letters = 'zabcdefghijklmnopqrstuvwxy'
def solve(N):
md = N%26
l = letters[md]
if md==0: md=26
if N>26:
return solve((N-md)//26) + l
else:
return l
print(solve(N))
| import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
time = 1
def dfs(node):
global time
if visited[node] != -1:
return
visited[node] = 0
d[node] = time
time += 1
for v in edge[node]:
dfs(v)
f[node] = time
time += 1
if __name__ == "__main__":
n = int(input())
edge = []
for i in range(n):
u,k,*v_li = map(int,input().split())
for j in range(len(v_li)):
v_li[j] -= 1
u-=1
edge.append(v_li)
d = {}
f = {}
visited = [-1]*n
for i in range(n):
dfs(i)
for i in range(n):
print(i+1,d[i],f[i])
| 0 | null | 5,944,259,311,812 | 121 | 8 |
from fractions import gcd
from functools import reduce
n = int(input())
a_list = [int(x) for x in input().split()]
temp = 1
for a in a_list:
temp *= a // gcd(a, temp)
mod = 10 ** 9 + 7
ans = sum([temp // a for a in a_list]) % mod
print(ans) | """
最小公倍数LCMを求めて、LCMを各Aで除した商を合計すればよい
"""
from math import gcd
def lcm(a,b):
return a*b//gcd(a,b)
def main():
mod = 10**9 +7
N = int(input())
A = list(map(int,input().split()))
l = A[0]
for i in range(1,N):
l = lcm(l,A[i])
ans = 0
for a in A:
ans += l//a
print(ans%mod)
main() | 1 | 88,161,000,824,700 | null | 235 | 235 |
#!/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)])
| ### ----------------
### ここから
### ----------------
import sys
import math
from io import StringIO
import unittest
def yn(b):
print("Yes" if b==1 else "No")
return
def resolve():
readline=sys.stdin.readline
a,b,x=map(int, readline().rstrip().split())
if x <= a*a*b/2:
l = x*2/b/a
print(math.degrees(math.atan(b/l)))
return
l = (2*x)/(a*a)-b
print(math.degrees(math.atan((b-l)/a)))
#arr=list(map(int, readline().rstrip().split()))
#n=int(readline())
#ss=readline().rstrip()
#yn(1)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ---------------- | 0 | null | 149,968,688,252,712 | 272 | 289 |
N ,D = map(int , input().split())
sum = 0
for i in range(N):
a,b = map(int , input().split())
if(((a ** 2 + b ** 2)**(1/2)) <= D):
sum += 1
print(sum) | import sys
input = sys.stdin.readline
# 文字列をinput()した場合、末尾に改行が入るので注意
def main(R,C,K,rcv):
inf=float('inf')
dp0=[[-inf,-inf,-inf,0] for _ in range(C)]
dp1=[[-inf]*4 for _ in range(C)]
dp0[0][3]=0
rcv.sort(key=lambda x:C*R*x[0]+x[1])
i=0
nowc=0
while i<K and rcv[i][0]==1:
nextc=rcv[i][1]-1
for j in range(nowc+1,nextc+1):
dp0[j][0]=dp0[nowc][0]
dp0[j][1]=dp0[nowc][1]
dp0[j][2]=dp0[nowc][2]
v=rcv[i][2]
dp0[nextc][0]=max(dp0[nextc][0],dp0[nextc][1]+v)
dp0[nextc][1]=max(dp0[nextc][1],dp0[nextc][2]+v)
dp0[nextc][2]=max(dp0[nextc][2],dp0[nextc][3]+v)
i+=1
nowc=nextc
for j in range(nowc+1,C):
dp0[j][0]=dp0[nowc][0]
dp0[j][1]=dp0[nowc][1]
dp0[j][2]=dp0[nowc][2]
for j in range(1,R):
for c in range(C):
dp0[c][3]=max(dp0[c])
dp0[c][2]=-inf
dp0[c][1]=-inf
dp0[c][0]=-inf
nowc=0
while i<K and rcv[i][0]==j+1:
nextc=rcv[i][1]-1
for k in range(nowc+1,nextc+1):
dp0[k][0]=dp0[nowc][0]
dp0[k][1]=dp0[nowc][1]
dp0[k][2]=dp0[nowc][2]
v=rcv[i][2]
dp0[nextc][0]=max(dp0[nextc][0],dp0[nextc][1]+v)
dp0[nextc][1]=max(dp0[nextc][1],dp0[nextc][2]+v)
dp0[nextc][2]=max(dp0[nextc][2],dp0[nextc][3]+v)
i+=1
nowc=nextc
for j in range(nowc+1,C):
dp0[j][0]=dp0[nowc][0]
dp0[j][1]=dp0[nowc][1]
dp0[j][2]=dp0[nowc][2]
#print(dp0)
print(max(dp0[-1]))
if __name__=='__main__':
R,C,K=map(int,input().split())
rcv=[list(map(int,input().split())) for _ in range(K)]
#import datetime
#print(datetime.datetime.now())
main(R,C,K,rcv)
#print(datetime.datetime.now())
| 0 | null | 5,764,435,099,518 | 96 | 94 |
def abc177_e():
n = int(input())
A = [int(x) for x in input().split()]
def prime_factorize(n:int)->set:
''' nの素因数分解 '''
arr = []
while n % 2 == 0:
arr.append(2)
n = n // 2
f = 3
while f*f <= n:
if n%f == 0:
arr.append(f)
n = n // f
else:
f += 2
if n != 1:
arr.append(n)
return set(arr)
import math
gcd_all = A[0]
factors = [0]*(10**6 + 1)
pairwise = True
for ai in A:
gcd_all = math.gcd(gcd_all, ai)
for p in prime_factorize(ai):
if factors[p]: pairwise = False
factors[p] = 1
if pairwise: ans = 'pairwise coprime'
elif gcd_all == 1: ans = 'setwise coprime'
else: ans = 'not coprime'
print(ans)
if __name__ == '__main__':
abc177_e() | from math import gcd
from functools import reduce
from sys import exit
# O(A+N)解
MAX_A = 1000000
lowerst_prime = [0] * (MAX_A + 1) # 最小の素因数をいれる(2以上をみていけばいい)
primes = [] # MAX_A以下の素数の集合
count = [0] * (MAX_A + 1) # 約数として出てくる回数を数える
for i in range(2, MAX_A + 1): # 線形時間で処理してくれる
if lowerst_prime[i] == 0:
lowerst_prime[i] = i
primes.append(i)
for p in primes:
if p > lowerst_prime[i] or i * p > MAX_A:
break
lowerst_prime[i * p] = p # p が i * p のもっとも小さな素因数となるときのみ更新されるので、線形時間アルゴリズムとなる
# 入力
N = int(input())
A = [*map(int, input().split())]
if reduce(gcd, A) != 1:
print("not coprime")
exit(0)
for i in range(N):
while A[i] > 1:
divide = lowerst_prime[A[i]]
if count[divide]:
# A[x] % i == A[y] % i == 0 となるx != yが存在するので、i | gcd(x, y) となる
print("setwise coprime")
exit(0)
count[divide] += 1
while A[i] % divide == 0: # 割れるだけ割る
A[i] //= divide
print("pairwise coprime") | 1 | 4,115,403,138,980 | null | 85 | 85 |
mod = 10**9 + 7
X, Y = map(int, input().split())
if (X+Y) % 3 != 0:
print(0)
exit()
a = (2*Y-X)//3
b = (2*X-Y)//3
if a < 0 or b < 0:
print(0)
exit()
m = min(a, b)
ifact = 1
for i in range(2, m+1):
ifact = (ifact * i) % mod
ifact = pow(ifact, mod-2, mod)
fact = 1
for i in range(a+b, a+b-m, -1):
fact = (fact * i) % mod
print(fact*ifact % mod)
| def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fac[n]*finv[r]*finv[n-r]%p
N = pow(10,6)
MOD = pow(10,9)+7
fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
X,Y = map(int,input().split())
if (X+Y)%3 != 0:
print(0)
exit()
n = (X+Y)//3
if min(X,Y) < n:
print(0)
exit()
ans = cmb(n,min(X,Y)-n,MOD)
print(ans) | 1 | 150,559,519,396,832 | null | 281 | 281 |
n = int(input())
taro = 0
hanako = 0
for _ in range(n):
line = input().rstrip().split()
if line[0] > line[1]: taro += 3
elif line[0] < line[1]: hanako += 3
else:
taro += 1
hanako += 1
print(taro, hanako)
| 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 j in range(m)]
for i in range(n):
for j in range(l):
c = 0
for k in range(m):
c += a[i][k]*b[k][j]
print(c,end="")
if j != l-1:
print("",end=" ")
print() | 0 | null | 1,727,671,381,960 | 67 | 60 |
def scoring(d, t):
arr = [l for l in last]
arr[t] = d
return S[d][t] - sum((d - l) * c for l, c in zip(arr, C))
D = int(input())
C = list(map(int, input().split()))
S = []
for _ in range(D):
s = list(map(int, input().split()))
S.append(s)
last = [-1] * 26
ans = []
for i in range(D):
res = -10 ** 6
idx = -1
for j in range(26):
tmp = scoring(i, j)
if tmp > res:
res = tmp
idx = j
last[idx] = i
ans.append(idx+1)
print(*ans, sep='\n') | R, C, K = map(int, input().split())
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = map(int, input().split())
V[r][c] = v
max_pre = [0]*(C+1)
for i in range(R+1):
now = [[0]*(3+1) for _ in range(C+1)]
for j in range(C+1):
v = V[i][j]
la = lb = 0
if j > 0:
la = now[j-1][0]
lb = now[j-1][1]
now[j][2] = max(now[j][2], now[j-1][2], lb + v)
now[j][3] = max(now[j][3], now[j-1][3], now[j-1][2] + v)
if i > 0:
now[j][0] = max(now[j][0], max_pre[j], la)
now[j][1] = max(now[j][1], max_pre[j] + v, la + v, lb)
max_pre[j] = max(now[j])
print(max(now[C]))
| 0 | null | 7,584,982,527,850 | 113 | 94 |
import numpy as np
N,K=map(int,input().split())
R,S,P=map(int,input().split())
T1=input()
T2=T1.replace('r', str(P)+' ').replace('s',str(R)+' ').replace('p',str(S)+' ')[:-1]
T2=np.array(list(map(int, T2.split())))
for i in range(N):
if i >=K and T1[i]==T1[i-K] and T2[i-K] != 0:
T2[i]=0
print(T2.sum()) | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=input()
ans=0
A=[]
for i in range(K):
if T[i]=='r':
ans+=P
A.append('p')
elif T[i]=='s':
ans+=R
A.append('r')
else:
ans+=S
A.append('s')
for i in range(K,N):
if T[i]=='r':
if A[i-K]!='p':
ans+=P
A.append('p')
else:
A.append('x')
elif T[i]=='s':
if A[i-K]!='r':
ans+=R
A.append('r')
else:
A.append('x')
else:
if A[i-K]!='s':
ans+=S
A.append('s')
else:
A.append('x')
print(ans) | 1 | 107,011,878,242,048 | null | 251 | 251 |
x = input().split()
if int(x[0]) + int(x[1]) + int(x[2]) >= 22:
print('bust')
else:
print('win') | def main():
n, x, y = map(int, input().split())
distances = [0 for _ in range(n)]
for i in range(1, n+1):
for j in range(i+1, n+1):
distances[min(j-i, min(abs(i-x)+abs(j-y), abs(j-x)+abs(i-y))+1)] += 1
for v in distances[1:]:
print(v)
if __name__ == '__main__':
main()
| 0 | null | 81,489,143,947,746 | 260 | 187 |
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
import random
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
mod=10**9+7
dp=[[8,1,1,0] for i in range(N)]#1,2~8,9,both
for i in range(1,N):
dp[i][0]=dp[i-1][0]*8
dp[i][1]=dp[i-1][0]+dp[i-1][1]*9
dp[i][2]=dp[i-1][0]+dp[i-1][2]*9
dp[i][3]=dp[i-1][1]+dp[i-1][2]+dp[i-1][3]*10
for n in range(4):
dp[i][n]%=mod
print(dp[-1][3]%mod)
| N = int(input())
MOD = 10**9+7
a10 = 10**N
a9 = 9**N
a8 = 8**N
print((a10-a9-a9+a8) % MOD)
| 1 | 3,205,706,474,310 | null | 78 | 78 |
n,k = map(int, input().split())
r,s,p = map(int, input().split())
t = input()
def add(x):
if x == 'r':
return p
elif x == 's':
return r
else:
return s
nk =[0]*k
for i in range(n):
key = i%k
if nk[key]==0:
nk[key] = [t[i]]
else:
nk[key].append(t[i])
ans = 0
for j in nk:
if j ==0:
continue
ans += add(j[0])
for k in range(1, len(j)):
if j[k]== j[k-1]:
j[k]='q'
else:
ans += add(j[k])
print(ans) | N = int(input())
S = input()
if S == S[:N//2]*2:
print("Yes")
else:
print("No") | 0 | null | 126,864,213,161,280 | 251 | 279 |
a,b=map(int,input().split())
c=0
res = 0
if a >=10:
print(b)
else:
c = 100 * (10-a)
res = b+c
print(res) | N = int(input())
ans = 0
for i in range(N):
Y = int(N/(i+1))
ans += Y * (Y + 1) * (i + 1) // 2
print(ans) | 0 | null | 37,168,651,402,650 | 211 | 118 |
s=input()
s_list=list(s)
s_list.append('0')
for i in range(len(s)):
if s_list[i]=='?':
if s_list[i+1]=='D':
if s_list[i-1]=='P':
s_list[i]='D'
else:
s_list[i]='P'
elif s_list[i+1]=='?':
if s_list[i-1]=='P':
s_list[i]='D'
else :
s_list[i]='P'
else :
s_list[i]='D'
s_list.pop()
a="".join(s_list)
print(a) | n = int(input())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
C = [abs(X[i] - Y[i]) for i in range(n)]
D = []
def distance(X, Y):
for k in range(1, 4):
d = 0
for j in range(len(X)):
d += C[j] ** k
d = d ** (1 / k)
D.append(d)
D.append(max(C))
return D
distance(X, Y)
for i in range(4):
print('{:.08f}'.format(D[i]))
| 0 | null | 9,286,773,807,040 | 140 | 32 |
n=int(input())
a=[int(x) for x in input().rstrip().split()]
a.sort()
ma=max(a)
dp=[0]*ma
for i in a:
dp[i-1]+=1
l=[0]*ma
ans=0
for i in a:
j=i
if l[i-1]==0 and dp[i-1]==1:
ans+=1
while(j<=ma):
l[j-1]+=1
if j+i<=ma:
j+=i
else:
break
print(ans)
| n,a=int(input()),sorted(list(map(int,input().split())))
m=a[-1]+1
s=[0]*m
for i in a:
s[i]+=1
for i in set(a):
if s[i]:
for j in range(i*2,m,i):
s[j]=0
print(s.count(1)) | 1 | 14,364,875,730,172 | null | 129 | 129 |
X = int(input())
a = 100
year = 0
import math
while True:
a = a*101//100
year += 1
if a >= X:
break
print(year) | X = int(input())
m = 100
y = 0
while m < X :
m = m*101//100
y += 1
print(y) | 1 | 27,156,983,357,788 | null | 159 | 159 |
from math import sqrt, log
def factor(number):
i = 2
s = set()
while i * i <= number:
if number % i == 0:
if i != 2:
s.add(i)
if (number // i) != 2:
s.add(number//i)
i += 1
return s
def newFactor(number):
n = number
i = 2
ans = set()
while i * i <= number:
if number % i == 0:
while number % i == 0:
number //= i
if number % i == 1:
ans.add(i)
number = n
i += 1
return ans
n = int(input())
if n == 2:
print(1)
exit()
if n == 3:
print(2)
exit()
s = set()
s.add(2)
s.add(n-1)
s.add(n)
s = s.union(factor(n-1))
s = s.union(newFactor(n))
print(len(s))
| import sys
n = int(input())
dic = {}
input_ = [x.split() for x in sys.stdin.readlines()]
for c, s in input_:
if c == 'insert':
dic[s] = 0
else:
if s in dic:
print('yes')
else:
print('no') | 0 | null | 20,745,908,787,870 | 183 | 23 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
def solve(p, t, A, result):
if A[p] == t:
result[(p,t)] = True
return True
if p == len(A) - 1:
return False
if (p,t) in result:
# print('Cache Hit')
return result[(p,t)]
if solve(p+1, t-A[p], A, result):
result[(p,t)] = True
return True
if solve(p+1, t, A, result):
result[(p,t)] = True
return True
result[(p,t)] = False
return False
import sys
n = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
num_q = int(sys.stdin.readline())
query = list(map(int, sys.stdin.readline().split()))
result = dict()
for m in query:
if solve(0, m, A, result):
print('yes')
else:
print('no')
| import itertools as it
n=int(input())
A=input().split()
q=int(input())
M=input().split()
ans=[]
cnt=0
A=list(map(int,A))
M=list(map(int,M))
for i in range(len(A)):
Ac=list(it.combinations(A,i+1))
for j in Ac:
ans.append(sum(j))
for i in M:
flag=0
for j in ans:
if i==j:
print("yes")
flag=1
break
if flag==0:
print("no")
| 1 | 99,278,475,296 | null | 25 | 25 |
from collections import deque
def main():
h, w = map(int, input().split())
ls = [input() for _ in range(h)]
def trans(a, b):
return a * w + b
ls2 = [[] for _ in range(h * w)]
for i in range(h):
for j in range(w):
# check ij
if ls[i][j] == '#':
continue
if i >= 1 and ls[i-1][j] != '#':
ls2[trans(i, j)].append(trans(i-1, j))
if i <= h-2 and ls[i+1][j] != '#':
ls2[trans(i, j)].append(trans(i + 1, j))
if j <= w-2 and ls[i][j+1] != '#':
ls2[trans(i, j)].append(trans(i, j + 1))
if j >= 1 and ls[i][j-1] != '#':
ls2[trans(i, j)].append(trans(i, j - 1))
#print(ls2)
def route(i):
count = 1
ss = deque(ls2[i])
next = deque()
explored = {i}
while ss or next:
if not ss:
count +=1
ss = next
next = deque()
now =ss.popleft()
if now in explored:
continue
else:
explored.add(now)
next.extend(ls2[now])
return count-1
ans = 0
for i in range(h * w - 1):
if ls2[i] == []:
continue
ans = max(ans, route(i))
print(ans)
if __name__ == '__main__':
main() | from collections import deque
h, w = map(int, input().split())
maze = [list(input()) for i in range(h)]
def bfs(sx, sy):
que = deque([])
que.append((sx, sy))
dx = [-1, 0, 1, 0]
dy = [0, -1, 0, 1]
d = [[-1] * w for i in range(h)]
d[sy][sx] = 0
while que:
s = que.popleft()
for i in range(4):
nx = s[0] + dx[i]
ny = s[1] + dy[i]
if 0 <= nx < w and 0 <= ny < h and maze[ny][nx] != "#" and d[ny][nx] == -1:
que.append((nx, ny))
d[ny][nx] = d[s[1]][s[0]] + 1
tmp = 0
for i in range(h):
for j in range(w):
tmp = max(tmp, d[i][j])
return tmp
ans = 0
for i in range(w):
for j in range(h):
if maze[j][i] == ".":
ans = max(ans, bfs(i, j))
print(ans) | 1 | 94,279,635,799,096 | null | 241 | 241 |
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)
| n, m, l = map(int, input().split())
mat_a = []
mat_b = []
for i in range(n):
mat_a.append(list(map(int, input().split())))
for j in range(m):
mat_b.append(list(map(int, input().split())))
for p in range(n):
mat_c = []
for q in range(l):
sum = 0
for r in range(m):
sum += mat_a[p][r] * mat_b[r][q]
mat_c.append(sum)
print(' '.join(map(str, mat_c)))
| 1 | 1,411,409,202,998 | null | 60 | 60 |
# 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) | n = int(input())
a = list(map(int, input().split()))
s = [0]*(n+2)
for i in range(n, -1, -1): s[i] = s[i+1]+a[i]
def solve():
cur = 1
res = 0
for i in range(n+1):
if cur < a[i]: return -1
res += cur
cur -= a[i]
if cur > s[i+1]: return -1
cur = min(cur*2, s[i+1])
return res
print(solve()) | 0 | null | 9,419,571,491,748 | 5 | 141 |
n=int(input())
s=set([])
for i in range(n):
s_=input()
s.add(s_)
print(len(s)) | print('Yes' if '7' in list(str(input().split())) else 'No') | 0 | null | 32,172,776,538,310 | 165 | 172 |
n = int(input())
li = ["#"*20 if i%4==0 else "0"*10 for i in range(1, 16)]
for _ in range(n):
b, f, r, v = map(int, input().split())
h = 4*b-(4-f)-1
li[h] = li[h].replace(li[h], ''.join([str(int(list(li[h])[r-1])+v) if i == r-1 else list(li[h])[i] for i in range(10)]))
li = [' '+' '.join(li[i]) if (i+1)%4!=0 else li[i] for i in range(len(li))]
print('\n'.join(li))
| import sys
official_house = {}
for b in range(1, 5):
for f in range(1, 4):
for r in range(1, 11):
official_house[(b, f, r)] = 0
n = int(sys.stdin.readline())
for line in sys.stdin:
(b, f, r, v) = [int(i) for i in line.split()]
official_house[(b, f, r)] += v
for b in range(1, 5):
if b != 1:
print("####################")
for f in range(1, 4):
for r in range(1, 11):
print(" %d" % official_house[(b, f, r)], end="")
print() | 1 | 1,075,728,356,770 | null | 55 | 55 |
n,k,s = map(int,input().split())
rem = s+1
if rem > 10**9:
rem = 1
li = []
for i in range(n):
if i < k:
li.append(s)
else:
li.append(rem)
print(*li)
| N,K,S=map(int, input().split())
MAX = 10**9
if S != MAX:
ans = [S]*K + [S+1]*(N-K)
print(*ans)
else:
ans = [S]*K + [S-1]*(N-K)
print(*ans) | 1 | 91,182,884,428,896 | null | 238 | 238 |
n = int(input())
r = n % 1000
if r == 0:
print("0")
else:
otu = 1000 - r
print(otu) | x = input()
if x[-1] == "s":
y = x + "es"
else:
y = x + "s"
print(y)
| 0 | null | 5,480,188,341,540 | 108 | 71 |
import math
while True:
n=int(input())
if n==0:break
else:
s = list(map(int, input().split())) #入力の値が横並びの時使う
x=sum(s)
y=x/n
a=0
for i in range(n):
z=(s[i]-y)**2
a+=z
b=math.sqrt(a/n)
print(format(b, '.8f'))
| def main():
a, b, c, d = map(int, input().split())
if c % b == 0:
e = c // b
else:
e = c // b + 1
if a % d == 0:
f = a // d
else:
f = a // d + 1
if e > f:
ans = "No"
else:
ans = "Yes"
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 15,052,297,081,776 | 31 | 164 |
def main():
n=int(input())
s,t= list(map(str,input().split()))
ans=""
for i in range(0,n):
ans+=s[i]+t[i]
print(ans)
main() | n = int(input())
s, t = input().split()
ans = ""
for i, j in zip(s, t):
ans += i + j
print(ans)
| 1 | 112,161,516,470,370 | null | 255 | 255 |
import itertools
import functools
import math
from collections import Counter
from itertools import combinations
L = int(input())
ans=(L/3)**3
print(ans)
| MOD = 998244353
def solve(lr, dp, n):
acc_dp = [1] * n
for i in range(1, n):
val = 0
for d in lr:
a = i - d[0]
if a < 0:
continue
b = i - d[1] - 1
val += acc_dp[a] - (acc_dp[b] if b >= 0 else 0)
dp[i] = val % MOD
acc_dp[i] = (acc_dp[i - 1] + dp[i]) % MOD
return dp[n - 1]
def main():
f = open(0)
n, k = [int(x) for x in f.readline().split()]
lr = [[int(x) for x in f.readline().split()] for _ in range(k)]
dp = [0] * n
dp[0] = 1
ans = solve(lr, dp, n)
print(ans)
main()
| 0 | null | 24,868,208,927,318 | 191 | 74 |
for i in range(10000):
x = input()
x = int(x)
if x == 0:
break
else:
print("Case "+ str(i+1) + ": " + str(x))
| # usr/bin/python
# coding: utf-8
################################################################################
# Is it a Right Triangle?
# Write a program which judges wheather given length of three side form a right triangle.
# Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.
#
# Input
# Input consists of several data sets. In the first line, the number of data set,
# N is given. Then, N lines follow, each line corresponds to a data set.
# A data set consists of three integers separated by a single space.
#
# Constraints
# 1 ??? length of the side ??? 1,000
# N ??? 1,000
# Output
# For each data set, print "YES" or "NO".
#
# Sample Input
# 3
# 4 3 5
# 4 3 6
# 8 8 8
# Output for the Sample Input
# YES
# NO
# NO
#
################################################################################
if __name__ == "__main__":
num = int(input())
inputline = [""]*num
for i in range(0,num):
inputline[i] = input()
for line in inputline:
a = int(line.split(" ")[0])
b = int(line.split(" ")[1])
c = int(line.split(" ")[2])
if (a*a+b*b == c*c or b*b+c*c == a*a or c*c+a*a == b*b):
print("YES")
else:
print("NO") | 0 | null | 239,135,387,764 | 42 | 4 |
a=float(input())
print(a*2*3.1415926) | nb=4
nf=3
nr=10
d = {}
n = int(input())
for i in range(n):
[b,f,r,v] = map(int, input().split())
key = "%2d %2d %2d" % (b,f,r)
if key in d:
d[key] += v
else:
d[key] = v
for b in range(1,nb+1):
for f in range(1,nf+1):
for r in range(1,nr+1):
key = "%2d %2d %2d" % (b,f,r)
if key in d:
print(" "+str(d[key]),end="")
else:
print(" "+str(0),end="")
if r==nr:
print()
if r==nr and f==nf and b != nb:
print('####################') | 0 | null | 16,399,145,613,508 | 167 | 55 |
n = int(input())
ans = set()
for _ in range(n):
ans.add(input())
print(len(ans)) | A,B,C = map(int,input().split())
K = int(input())
count = 0
while(A >= B):
B *= 2
count += 1
while(B >= C):
C *= 2
count += 1
if(count <= K):
print("Yes")
else:
print("No") | 0 | null | 18,654,961,140,010 | 165 | 101 |
s = input()
ans = chk = 0
ans = [-1] * (len(s)+1)
if s[0] == "<":
ans[0] = 0
if s[-1] == ">":
ans[-1] = 0
for i in range(len(s) - 1):
if s[i] == ">" and s[i+1] == "<":
ans[i+1] = 0
for i in range(len(s)):
if s[i] == "<":
ans[i+1] = ans[i] + 1
for i in range(-1, -len(s)-1,-1):
if s[i] == ">":
ans[i-1] = max(ans[i-1], ans[i]+1)
print(sum(ans))
| def selection_sort(A, N):
count = 0
for i in range(N):
min_j = i
for j in range(i, N):
if A[j] < A[min_j]:
min_j = j
if i != min_j:
A[i], A[min_j] = A[min_j], A[i]
count += 1
print " ".join(map(str, A))
print count
N = input()
A = map(int, raw_input().split())
selection_sort(A, N) | 0 | null | 78,243,176,814,180 | 285 | 15 |
# パナソニック2020D
import sys
def write(x):
sys.stdout.write(x)
sys.stdout.write("\n")
from queue import deque
n = int(input())
q = deque([("a", "a")])
while True:
s, m = q.pop()
if len(s)==n:
write(s)
elif len(s)>=n+1:
break
for o in range(ord("a"), ord(m)+2):
if ord(m)<o:
m = chr(o)
q.appendleft((s + chr(o), m)) | import bisect
N=int(input())
rllist=[]
for _ in range(N):
X,L=map(int,input().split())
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
dp=[0]*N
dp[0]=1
for i in range(1,N):
r,l=rllist[i]
pos=bisect.bisect(rllist,(l,float("inf")))
#print(i,pos)
if pos==0:
dp[i]=dp[i-1]
else:
dp[i]=max(dp[i-1],dp[pos-1]+1)
#print(dp)
print(dp[-1]) | 0 | null | 70,828,690,380,448 | 198 | 237 |
n = int(input())
print(10-int(n/200)) | y,x=[int(i) for i in input().split()]
s=[[int(0)for i in range(x+1)]for j in range(y+1)]
for i in range(y):
k=input().split()
for j in range(x):
s[i][j]=int(k[j])
for i in range(y):
for j in range(x):
s[i][x]=s[i][x]+s[i][j]
s[y][j]=s[y][j]+s[i][j]
for i in range(y):
s[y][x]=s[y][x]+s[i][x]
for i in range(y+1):
for j in range(x):
print(s[i][j],"",end="")
print(s[i][x]) | 0 | null | 4,054,792,233,590 | 100 | 59 |
def is_prime(n):
if n == 2: return True
if n < 2 or n % 2 == 0: return False
return pow(2, n - 1, n) == 1
count = 0
for i in range(int(input())):
if is_prime(int(input())) : count += 1
print(count) | """素数を求める。
以下の性質を用いる。
合成数 x は p <= sqrt(x) を満たす素因子 pをもつ。
"""
import math
def is_prime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
for i in range(3, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
N = int(input())
data = [int(input()) for i in range(N)]
cnt = 0
for d in data:
if is_prime(d):
cnt += 1
print(cnt)
| 1 | 10,290,549,708 | null | 12 | 12 |
print(max(0,eval(input().replace(' ','-')+'*2'))) | n,k = map(int, input().split())
r, s, p = map(int, input().split())
T = list(str(input()))
ans = 0
S = [-1]*n
for i in range(n):
if i <= k-1:
if T[i] == 'r':
S[i] = 'p'
ans += p
elif T[i] == 's':
S[i] = 'r'
ans += r
else:
S[i] = 's'
ans += s
else:
if T[i] == 'r':
if S[i-k] != 'p':
S[i] = 'p'
ans += p
else:
if i+k <= n-1:
if T[i+k] == 's':
S[i] = 's'
elif T[i+k] == 'p':
S[i] = 'r'
else:
S[i] = 'r'
else:
S[i] = 'r'
elif T[i] == 's':
if S[i-k] != 'r':
S[i] = 'r'
ans += r
else:
if i+k <= n-1:
if T[i+k] == 'p':
S[i] = 'p'
elif T[i+k] == 'r':
S[i] = 's'
else:
S[i] = 's'
else:
S[i] = 's'
else:
if S[i-k] != 's':
S[i] = 's'
ans += s
else:
if i+k <= n-1:
if T[i+k] == 's':
S[i] = 'p'
elif T[i+k] == 'r':
S[i] = 'r'
else:
S[i] = 'p'
else:
S[i] = 'p'
print(ans)
| 0 | null | 136,993,907,920,968 | 291 | 251 |
D, T, S = tuple(int(x) for x in input().split())
if S*T >= D:
print('Yes')
else:
print('No') | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
def main():
a, b , c = map(int, input().split())
if a / c <= b:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| 1 | 3,562,213,570,260 | null | 81 | 81 |
N, K, S = map(int, input().split())
if S < 10**9:
T = S + 1
else:
T = S - 1
ans = [S]*K + [T]*(N-K)
print(*ans) | inp=input().split()
if inp[0] < inp[1] and inp[1] < inp[2]:
print("Yes")
else:
print("No") | 0 | null | 45,957,837,884,218 | 238 | 39 |
N = int(input())
print(0 if N%1000==0 else 1000-N%1000) | def main():
n = int(input())
if n % 1000 == 0:
print(0)
else:
print(1000 - int(n%1000))
if __name__ == '__main__':
main()
| 1 | 8,463,194,162,292 | null | 108 | 108 |
X,K,D=map(int,input().split())
X=abs(X)
if X<=K*D:
if (K-X//D)%2==0:X=X%D
else:X=abs(X%D-D)
else:
X=X-K*D
print(X) | N = int(input())
P = list(map(int, input().split()))
min_value = P[0]
cnt = 1
for i in range(1, N):
if P[i] < min_value :
min_value = P[i]
cnt += 1
print(cnt)
| 0 | null | 45,220,879,686,528 | 92 | 233 |
n = int(input())
l = list(map(int, input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
li = [l[i], l[j], l[k]]
m = max(li)
if 2*m < sum(li) and len(set(li)) == 3:
ans += 1
print(ans) | N = int(input())
A = list(map(int,input().split()))
ans = 0
l = [0]*N
u = [0]*N
for i in range(N):
b = i - A[i]
c = i + A[i]
if 0 < b < N:
l[b] += 1
if 0 < c < N:
u[c] += 1
for i in range(N):
ans += l[i]*u[i]
print(ans) | 0 | null | 15,467,363,064,530 | 91 | 157 |
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v <= w:
print("NO")
else:
dis = abs(b-a)
sp = abs(v-w)
if 0 < dis/sp <= t:
print("YES")
else:
print("NO")
| a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a < b:
print('YES' if b+w*t <= a+v*t else 'NO')
else:
print('YES' if b-w*t >= a-v*t else 'NO')
| 1 | 15,087,956,813,400 | null | 131 | 131 |
S=input()
Week=['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(7):
if S==Week[i]:
today=i
print(7-today) | a ,b = map(int,input().split())
li = list(map(int,input().split()))
sum = 0
for i in li:
sum += i
if a > sum:
print(a - sum)
elif a == sum:
print(0)
else:
print(-1) | 0 | null | 82,266,462,431,326 | 270 | 168 |
N,K = map(int,input().split())
LR = []
for _ in range(K): LR.append(list(map(int,input().split())))
MOD = 998244353
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
for L,R in LR:
if i+L<N: dp[i+L] += dp[i]
if i+R+1<N: dp[i+R+1] -= dp[i]
if i>0: dp[i+1] = (dp[i+1]+dp[i])%MOD
print(dp[-1]) | N, K = [int(v) for v in input().split()]
links = []
for k in range(K):
L, R = [int(v) for v in input().split()]
links.append((L, R))
links = sorted(links, key=lambda x: x[1])
count = [1]
sub = [0, 1]
subtotal = 1
for i in range(1, N):
v = 0
for l, r in links:
r2 = i - l + 1
l2 = i - r
if l2 < 0:
l2 = 0
if r2 >= 0:
v += sub[r2] - sub[l2]
count.append(v % 998244353)
subtotal = (subtotal + v) % 998244353
sub.append(subtotal )
print(count[-1])
| 1 | 2,686,939,412,292 | null | 74 | 74 |
a = list(map(int, input().split()))
HP = a[0]
x = []
for i in range(a[1]):
x1, y1 = [int(i) for i in input().split()]
x.append((x1, y1))
max_tup = max(x, key=lambda x: x[0])
max_a = max_tup[0]
dp = [0] * (HP + max_a)
for i in range(1, len(dp)):
dp[i] = min(dp[i - a] + b for a, b in x)
print(dp[HP]) | (h,n),*c=[[*map(int,i.split())]for i in open(0)]
d=[0]*20002
for i in range(h):d[i]=min(d[i-a]+b for a,b in c)
print(d[h-1]) | 1 | 81,149,210,924,150 | null | 229 | 229 |
def gcd (x , y):
sur = x % y
while sur != 0:
x = y
y = sur
sur = x % y
return y
a,b = map(int,raw_input().split())
if a < b :
temp = a
a = b
b = temp
print gcd(a,b) | n = int(input())
a = list(input().split())
tmp = []
flag = 0
for i in range(n):
if int(a[i]) % 2 == 0:
tmp.append(a[i])
for j in range(len(tmp)):
if int(tmp[j]) % 3 == 0 or int(tmp[j]) % 5 == 0:
continue
else:
flag = 1
if flag == 1 : print("DENIED")
else : print("APPROVED") | 0 | null | 34,427,558,409,778 | 11 | 217 |
def cube(x):
return x**3
n = int(input())
print(cube(n))
| a=int(input())
resultado=str(a*a*a)
print resultado
| 1 | 274,332,989,052 | null | 35 | 35 |
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
n,*A = get_all_int()
# dp[i][j] = 活発度高い順のi人目まで処理し、左にjに置いた場合のうれしさの最大
dp = [ [0] * (n+1) for _ in range(n+1) ]
AA = list(enumerate(A))
AA.sort(key=(lambda t: t[1]), reverse=True)
for i, t in enumerate(AA):
# k 移動前の位置
# a 活発度
k,a = t
for j in range(i+1):
# 左に置く (すでに左端にj人居る)
move = abs(k - j)
dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] + a*move)
# 右に置く (すでに右端にi-j人居る)
move = abs(k - (n-(i-j)-1))
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + a*move)
ans = 0
for j in range(n+1):
ans = max(ans, dp[n][j])
print(ans)
| from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
from functools import reduce
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n = INT()
a = LIST()
q = INT()
count = [0]*(10**5+1)
for x in a:
count[x] += 1
ans = 0
for i in range(10**5+1):
ans += i * count[i]
for i in range(q):
b, c = MAP()
ans += (c - b) * count[b]
count[c] += count[b]
count[b] = 0
print(ans) | 0 | null | 22,819,540,622,688 | 171 | 122 |
X=sorted(map(int,input().split()));print(X[0],X[1],X[2]) | n,*a=map(int,open(0).read().split())
a.sort()
m=a[-1]+1
cnt=[0]*m
for ai in a:
if cnt[ai]!=0:
cnt[ai]+=1
continue
for i in range(ai,m,ai):
cnt[i]+=1
ans=0
for ai in a:
ans+=(cnt[ai]==1)
print(ans) | 0 | null | 7,424,004,427,408 | 40 | 129 |
N = int(input())
S = input()
ans = ""
for i in range(len(S)):
ans += chr(int(ord("A"))+(int(ord(S[i])+N)-int(ord("A")))%26)
print(ans) | n,k=map(int,input().split())
# 1以上k以下の整数がn個
mod=int(1e+9 + 7)
d=[0]*(k+1)
ans=0
for i in range(k,0,-1):
m=k//i
d[i]=pow(m,n, mod)
d[i]-=sum([d[j*i]for j in range(2,m+1)])
ans+=(d[i]*i)%mod
print((ans)%mod)
#print(d)
| 0 | null | 85,623,230,713,020 | 271 | 176 |
H,W,M=map(int,input().split())
HSum=[0 for _ in range(H)]
WSum=[0 for _ in range(W)]
bombs = set()
for _ in range(M):
hi,wi = map(lambda x:int(x)-1,input().split())
HSum[hi] += 1
WSum[wi] += 1
bombs.add( (hi,wi) )
# print(HSum)
# print(WSum)
curMax = 0
## 計算量多すぎ。。
# for h in range(H):
# for w in range(W):
# tmp = HSum[h] + WSum[w]
# if curMax <= tmp:
# if (h,w) in bombs:
# tmp -= 1
# curMax = max( curMax, tmp )
hMax = max(HSum)
wMax = max(WSum)
tmpMax = hMax + wMax
ans = 0
hSumMaxOnly = [h for h, x in enumerate(HSum) if x == hMax]
wSumMaxOnly = [w for w, y in enumerate(WSum) if y == wMax]
for h in hSumMaxOnly:
if ans == tmpMax:
break
for w in wSumMaxOnly:
if (h,w) in bombs:
ans = tmpMax - 1
else:
ans = tmpMax
break
print(ans)
| n = int(input())
x = list(input())
sx = len(set(x))
if sx == 1:
print(0)
exit()
cnt_r = x.count("R")
cnt = 0
for i in range(cnt_r):
if x[i] == "W":
cnt += 1
print(cnt) | 0 | null | 5,455,628,490,250 | 89 | 98 |
N=input()
n=N[-1]
if n=='3':
ans='bon'
elif n=='0' or n=='1' or n=='6' or n=='8':
ans='pon'
else:
ans='hon'
print(ans) | N=input()
if int(N[-1]) in [2,4,5,7,9]:
print('hon')
elif int(N[-1]) in [3]:
print('bon')
else:
print('pon') | 1 | 19,279,622,568,470 | null | 142 | 142 |
def insertionSort(lis,leng):
for i in range(leng):
v = lis[i]
j = i - 1
while j >= 0 and lis[j] > v:
lis[j+1] = lis[j]
j = j-1
lis[j+1]=v
print(*lis)
if __name__ == "__main__":
lengg=int(input())
liss=list(map(int, input().split()))
insertionSort(liss,lengg) | n, m = map(int, input().split())
if n % 2 or m < n//4:
for i in range(m):
print(i+1, n-i)
else:
for i in range(n//4):
print(i+1, n-i)
for i in range(n//4, m):
print(i+1, n-i-1) | 0 | null | 14,424,231,262,532 | 10 | 162 |
s = input()
l = len(s)
lst = [0] * (l+1)
for idx in range(l):
if s[idx] is '<':
lst[idx+1] = max(lst[idx+1], lst[idx]+1)
for inv in range(1, l+1):
if s[-inv] is '>':
lst[-(inv+1)] = max(lst[-(inv+1)], lst[-inv]+1)
print(sum(lst)) | s = input()
cnt_l = [0]*(len(s)+1)
cnt_r = [0]*(len(s)+1)
for i in range(1, len(s)+1):
if s[i-1] == "<":
cnt_l[i] = cnt_l[i-1] + 1
else:
cnt_l[i] = 0
for i in range(len(s)-1, -1, -1):
if s[i] == ">":
cnt_r[i] = cnt_r[i+1]+1
else:
cnt_r[i] = 0
ans = 0
for l, r in zip(cnt_l, cnt_r):
ans += max(l, r)
print(ans)
| 1 | 156,323,036,659,944 | null | 285 | 285 |
import math
a,b,x = map(int,input().split())
if x > a*a*b/2:
tan = 2*(a*a*b - x)/(a*a*a)
elif x <= a*a*b/2:
tan = a*b*b/(2*x)
print(math.degrees(math.atan(tan))) | from math import atan2, degrees
a,b,x = map(int, input().split())
s = x/a
if x >= a**2*b/2:
print(degrees(atan2(2*(a*b-s)/a, a)))
else:
print(degrees(atan2(b, 2*s/b))) | 1 | 162,669,479,927,908 | null | 289 | 289 |
def main():
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
v = {0: 1}
n = [0]
r = 0
t = 0
for i, a in enumerate(A, 1):
if i >= K:
v[n[i - K]] -= 1
t += a
j = (t - i) % K
r += v.get(j, 0)
v[j] = v.get(j, 0) + 1
n.append(j)
return r
print(main())
| # Rem of sum is Num
# Reviewing problem
from collections import defaultdict
def cnt_func(X):
res = 0
right = 0
L = len(X)
for i in range(L):
while right+1 < L and X[right+1] < K+X[i]:
right += 1
res += right-i
return res
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.insert(0, 0)
for i in range(1, N+1):
A[i] += A[i-1]
B = [0 for i in range(N+1)]
for i in range(N+1):
B[i] = (A[i]-i) % K
ans = 0
Mod = defaultdict(list)
for i in range(N+1):
Mod[B[i]].append(i)
for X in Mod.values():
ans += cnt_func(X)
print(ans) | 1 | 137,232,772,286,820 | null | 273 | 273 |
def main(a, b,c,k):
m = 0
if k <=a:
m = k
elif k <=(a+b):
m = a
elif k <= a+b+c:
m = (a-(k-(a+b)))
return m
a, b, c , k = map(int, input().split())
print(main(a,b,c,k)) | A,B,C,K = [int(x) for x in input().split()]
result = 0
if K > A:
result += A
else:
print(K)
exit()
if K < A + B:
print(result)
exit()
print(result - (K - A - B)) | 1 | 21,913,161,284,508 | null | 148 | 148 |
N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
li = [-1] * N
for s, c in SC:
if li[s - 1] == -1:
li[s - 1] = c
else:
if not li[s - 1] == c:
print(-1)
exit()
ans = ""
if N == 1:
print(max(0, li[0]))
exit()
for i in range(N):
if i == 0:
if li[i] == 0:
print(-1)
exit()
else:
ans += str(max(li[i], 1))
else:
ans += str(max(0, li[i]))
print(ans) | N, M = map(int, input().split())
S = ['a'] * (N+1)
for i in range(M):
s, c = list(map(int, input().split()))
if S[s] != 'a' and S[s] != str(c):
print(-1)
exit()
S[s] = str(c)
if S[1] == '0' and N > 1:
print(-1)
exit()
for i in range(1, N+1):
if S[i] == 'a':
if i == 1 and N > 1:
S[i] = '1'
else:
S[i] = '0'
print(int(''.join(S[1:])))
| 1 | 61,087,924,631,876 | null | 208 | 208 |
N=input()
i=0
while i<len(N):
print("x" ,end='')
i+=1 | S = str(input())
t = len(S)
print('x'*t) | 1 | 72,947,834,099,700 | null | 221 | 221 |
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
dp = [0]*n
c = a[0]
dp[1] = max(a[0],a[1])
for i in range(2,n):
if i%2 == 0:
c += a[i]
dp[i] = max(dp[i-2]+a[i],dp[i-1])
else:
dp[i] = max(dp[i-2]+a[i],c)
print(dp[-1])
| def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
#############
# Main Code #
#############
N = getN()
A = getList()
# N // 2個の整数をどの２箇所も連続しないように選ぶ
# 和の最大値を求めよ
# 通りの数は？ まあまあ多い
# 偶数の場合
# 始点がA[1]なら１通りに定まる
# 始点がA[0]なら?
# 次に3個先を取ると1通りに定まる
# 次に2個先を取り、その次に3個先を取ると1通りに定まる
# dp[i][j]: i回目までに3つ飛ばしをj回使った
# 長さが偶数なら1回まで使える
if N % 2 == 0:
dp = [[-float('inf')] * 2 for i in range(N)]
dp[0][0] = A[0]
dp[1][0] = A[1]
for i in range(2, N):
for j in range(1, -1, -1):
if j == 0:
dp[i][j] = max(dp[i][j], dp[i - 2][j] + A[i])
elif j == 1 and i - 3 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 2][j] + A[i])
if i - 3 >= 0 and j - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 3][j - 1] + A[i])
# 0個飛ばしdp[-2]:奇数個目だけ 0個飛ばしdp[-1]:偶数個目だけ 1個飛ばしdp[-1]
print(max(dp[-2][0], dp[-1][0], dp[-1][1]))
# 長さが奇数なら2回まで使える
else:
dp = [[-float('inf')] * 3 for i in range(N)]
dp[0][0] = A[0]
dp[1][0] = A[1]
for i in range(2, N):
for j in range(2, -1, -1):
if j == 0:
dp[i][j] = max(dp[i][j], dp[i - 2][j] + A[i])
elif j >= 1 and i - 3 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 2][j] + A[i])
if i - 3 >= 0 and j - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 3][j - 1] + A[i])
opt_1 = [A[i] for i in range(N) if i % 2 == 0]
opt_2 = [A[i] for i in range(N) if i % 2 == 1]
# 2個飛ばしならdp[-1]のが該当
# 1個飛ばしならdp[-1], dp[-2]のが該当
# 0個飛ばしは奇数個目だけ - その中の最小値、偶数個目だけ
print(max(dp[-1][2], dp[-1][1], dp[-2][1], sum(opt_1) - min(opt_1), sum(opt_2))) | 1 | 37,500,467,178,912 | null | 177 | 177 |
import bisect
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
ans = 0
for i in range(n-2):
for j in range(i+1,n-1):
x = arr[i]+arr[j]
ind = bisect.bisect_left(arr,x)
ans+=(ind-j-1)
print(ans) | import math
nd = list(map(int,input().split(" ")))
n = nd[0]
d = nd[1]
cnt = 0
xy=[]
for i in range(n):
xy.append(list(map(int,input().split(" "))))
result = math.sqrt((xy[i][0]**2)+(xy[i][1]**2))
if result <= d:
cnt += 1
print(cnt) | 0 | null | 88,476,091,162,482 | 294 | 96 |
import math
a, b, x = map(int, input().split())
theta = math.atan((-2) * x / (a ** 3) + 2 * b / a)
if a * math.tan(theta) > b:
theta = math.atan2(a * b * b, 2 * x)
print(math.degrees(theta)) | from collections import deque
n = int(input())
q = deque()
for _ in range(n):
com = input()
if com[0] == "i":
q.appendleft(com[7:])
elif len(com) == 11:
q.popleft()
elif len(com) == 10:
q.pop()
else:
try:
q.remove(com[7:])
except:
pass
print(*q)
| 0 | null | 81,386,204,149,270 | 289 | 20 |
n, k = map(int, input().split())
s = [0]
for i in range(1,n+1):
s.append(s[i-1] + i)
ans = 0
for i in range(k,n+1):
ans += ((s[n]-s[n-i]) - s[i-1])+ 1
print((ans+1) % (10**9 + 7))
| n=int(input())
ans=0
for i in range(1000):
ans=n+i
if ans%1000==0:
print(i)
break | 0 | null | 20,742,280,037,440 | 170 | 108 |
import sys
from collections import defaultdict as dd
from collections import deque
from functools import *
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
#from math import *
from itertools import permutations ,product
def eprint(*args):
print(*args, file=sys.stderr)
zz=1
#sys.setrecursionlimit(10**6)
if zz:
input=sys.stdin.readline
else:
sys.stdin=open('input.txt', 'r')
sys.stdout=open('all.txt','w')
def inc(d,c):
d[c]=d[c]+1 if c in d else 1
def bo(i):
return ord(i)-ord('A')
def li():
return [int(xx) for xx in input().split()]
def fli():
return [float(x) for x in input().split()]
def comp(a,b):
if(a>b):
return 2
return 2 if a==b else 0
def gi():
return [xx for xx in input().split()]
def fi():
return int(input())
def pro(a):
return reduce(lambda a,b:a*b,a)
def swap(a,i,j):
a[i],a[j]=a[j],a[i]
def si():
return list(input().rstrip())
def mi():
return map(int,input().split())
def gh():
sys.stdout.flush()
def isvalid(i,j):
return 0<=i<n and 0<=j<n
def bo(i):
return ord(i)-ord('a')
def graph(n,m):
for i in range(m):
x,y=mi()
a[x].append(y)
a[y].append(x)
t=1
def find(a,i):
if i==a[i]:
return a[i]
a[i]=find(a,a[i])
return a[i]
def union(a,x,y):
xs=find(a,x)
ys=find(a,y)
if xs!=ys:
if rank[xs]<rank[ys]:
xs,ys=ys,xs
a[ys]=xs
rank[xs]+=1
while t>0:
t-=1
n,m=mi()
a=[i for i in range(n+1)]
rank=[0]*(n+1)
for i in range(m):
x,y=mi()
union(a,x,y)
d=[0]*(n+1)
for i in range(1,n+1):
a[i]=find(a,i)
d[a[i]]+=1
print(max(d))
| print("ACL"*int(input()))
| 0 | null | 3,050,561,196,000 | 84 | 69 |
S = int(input())
if S < 3:
print(0)
import sys
sys.exit()
DP = [0]*(S+1)
DP[0] = 0
DP[1] = 0
DP[2] = 0
for i in range(3, S + 1):
DP[i] += 1
for j in range(i - 3 + 1):
DP[i] += DP[j]
print(DP[S] % (10 ** 9 + 7))
| n,d=map(int, input().split())
xy=[]
ans = 0
for i in range(n):
x,y = map(int, input().split())
xy.append([x,y])
if d**2>=x**2+y**2:
ans += 1
print(ans)
| 0 | null | 4,624,867,301,096 | 79 | 96 |
s = input()
n = len(s)
sa = 'A'*n
sb = 'B'*n
if s != sa and s != sb:
print('Yes')
else:
print('No')
| s=input()
if s[0]=="A" and s[1]=="A" and s[2]=="A":
print("No")
exit()
if s[0]=="B" and s[1]=="B" and s[2]=="B":
print("No")
exit()
print("Yes") | 1 | 54,751,374,498,758 | null | 201 | 201 |
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))
s = input()
if s[0] != s[1] or s[1] != s[2] or s[0] != s[2]:
print ("Yes")
else:
print("No")
| from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7
s = input()
if s == 'AAA' or s == 'BBB':
ans = 'No'
else:
ans = 'Yes'
print(ans) | 1 | 54,852,563,801,788 | null | 201 | 201 |
n, m = map(int,input().split())
a = [[0]*m for i in range(n)]
b = [0]*m
for i in range(n):
a[i] = list(map(int,input().split()))
for j in range(m):
b[j] = int(input())
c = [0]*n
for i in range(n):
for j in range(m):
c[i] += a[i][j] * b[j]
for i in c:
print(i)
| n = list(input())
if n[0] == "7" or n[1] == "7" or n[2] == "7":
print("Yes")
else:
print("No") | 0 | null | 17,621,572,261,032 | 56 | 172 |
import sys
def main():
input_str = sys.stdin.readline()
a, b = [int(i) for i in input_str.split(' ')]
if a > b:
print('a > b')
elif a < b:
print('a < b')
else:
print('a == b')
return
if __name__ == '__main__':
main()
| n,m = map(int,input().split())
ans="No"
if n==m :
ans="Yes"
print(ans)
| 0 | null | 42,052,412,289,958 | 38 | 231 |
N = int(input())
S = input()
if len(S) % 2 != 0:
print("No")
exit()
else:
l = len(S)
if S[0:l//2] == S[l//2:l]:
print("Yes")
else:
print("No")
| def main():
n,m,k=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(m)]
cd=[list(map(int,input().split())) for _ in range(k)]
friend=[set()for _ in range(n)]
block=[set()for _ in range(n)]
for a,b in ab:
friend[a-1].add(b-1)
friend[b-1].add(a-1)
for c,d in cd:
block[c-1].add(d-1)
block[d-1].add(c-1)
# 友達連結内でかつ友達でもブロックでもない。
# 友達連結グループわけ
ans=[0]*n
seen=[0]*n
for t in range(n):
if seen[t]==1:
continue
member=set()
todo=[t]
seen[t]=1
while todo:
t=todo.pop()
member.add(t)
f=friend[t]
for fi in f:
if seen[fi]==0:
todo.append(fi)
seen[fi]=1
mn=len(member)
for m in member:
ans[m]=mn-len(block[m].intersection(member))-len(friend[m])-1
print(' '.join(map(str,ans)))
if __name__=='__main__':
main()
| 0 | null | 104,394,126,720,752 | 279 | 209 |
H, W = list(map(int, input().split()))
### 片方だけ奇数のマスには行くことができない
### Hが偶数、Wが偶数の場合 → H*W // 2
### Hが奇数、Wが偶数の場合 → H*W // 2 (Wが奇数の場合も同様)
### Hが奇数、Wが奇数の場合 → H*W // 2 + 1
if H == 1 or W == 1:
print(1)
elif H % 2 != 0 and W % 2 != 0:
print(int(H * W // 2) + 1)
else:
print(int(H * W // 2)) | x,y=list(map(int,raw_input().split()))
w=x
h=y
if x==1 or y==1:
print("1")
exit(0)
ans=x//2 * (h//2 + (h+1)//2)
if x%2==1:
ans+=(h+1)//2
print(ans) | 1 | 50,581,010,816,548 | null | 196 | 196 |
N=int(input())
u="ACL"
print(u*N)
| n = int(input().rstrip())
print(str(n ** 3)) | 0 | null | 1,256,472,484,600 | 69 | 35 |
H = int(input())
W = int(input())
N = int(input())
print(int((N+max(H,W)-1)/max(H,W)))
| h = int(input())
w = int(input())
n = int(input())
p = max(h, w)
print((n+p-1)//p) | 1 | 88,829,428,029,632 | null | 236 | 236 |
from collections import deque
s = deque(list(input()))
n = int(input())
normal = 0
for i in range(n):
li = input().split()
if int(li[0]) == 1:
normal ^= 1
else:
k = int(li[1]) - 1
k ^= normal
if k == 1:
s.append(li[2])
else:
s.appendleft(li[2])
print(''.join(s) if normal == 0 else ''.join(list(s)[::-1])) | S = input()
Q = int(input())
flag = True
from collections import deque
que=deque(S)
for i in range(Q):
a = input().split()
if a[0]=="1":
flag = not flag
else:
f = a[1]
c = a[2]
if f=="1":
if flag:
que.appendleft(c)
else:
que.append(c)
else:
if flag:
que.append(c)
else:
que.appendleft(c)
if not flag:
que.reverse()
print("".join(que)) | 1 | 57,080,803,877,120 | null | 204 | 204 |
x1, y1, x2, y2 = (float(x) for x in input().split())
print("{:.7f}".format(((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5)) | s = str(input())
if s.count('RRR') == 1:
print(3)
elif s.count('RR') == 1:
print(2)
elif 1 <= s.count('R'):
print(1)
else:
print(0) | 0 | null | 2,508,440,677,692 | 29 | 90 |
L, R, d = map(int, input().split())
lst = list()
for x in range(R+1):
y = d * x
if y>=L and y<=R:
lst.append(y)
print(len(lst)) | import math
lrd=input().split()
l=int(lrd[0])
r=int(lrd[1])
d=int(lrd[2])
a=math.ceil(l/d)
b=math.floor(r/d)
print(b-a+1)
| 1 | 7,544,021,661,892 | null | 104 | 104 |
import numpy as np
last=[0]*26
D=int(input())
c=list(map(int, (input().split(' '))))
s=[]
a=[0]*D
sat=0
for i in range(D):
s.append(list(map(int, (input().split(' ')))))
for i in range(D):
a[i]=int(input())
last[a[i]-1] = i+1
sat += s[i][a[i]-1] - np.dot(c, list(map(lambda x: i+1-x, last)))
print(sat) | d=int(input())
a=[0 for i in range(26)]
c=list(map(int,input().split()))
l=[]
for i in range(d):
l.append(list(map(int,input().split())))
#print(c.index(max(c))+1)
p=[0]
for i in range(1,d+1):
t=int(input())-1
a[t]=i
k=0
for j in range(26):
k+=c[j]*(i-a[j])
p.append(p[i-1]+l[i-1][t]-k)
print(*p[1:],sep='\n') | 1 | 9,956,678,823,950 | null | 114 | 114 |
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
ans = sum(a)
count = Counter(a)
for _ in range(q):
b,c = map(int, input().split())
count[c] += count[b]
ans -= b*count[b]
ans += c*count[b]
count[b] = 0
print(ans) | K = int(input())
A, B = map(int, input().split())
ok_flag = False
for i in range(A, B + 1):
if i % K == 0:
ok_flag = True
break
if ok_flag:
print('OK')
else:
print('NG')
| 0 | null | 19,498,681,678,872 | 122 | 158 |
n=int(input())
a=10**9+7
b=10**n%a-2*9**n%a+8**n%a
if b<0:
b+=a
print(b) | l=list(input().split()) ##文字も数字も入る
stack=[]
for x in l: ##リストの長さ文だけ繰り返し
if x in ['+','-','*']: ##←知らなかった判定方法
t=str(stack.pop()) ##末尾取り出し
r=str(stack.pop())
c=r+x+t
stack+=[int(eval(c))] ##eval:入力した式の入力
else:
stack+=[int(x)] ##[]の意味?>リストに追加
print(stack.pop())
| 0 | null | 1,588,316,079,972 | 78 | 18 |
N, M, K = map(int, input().split())
class UnionFind:
def __init__(self, n):
self.ps = [-1] * (n + 1)
def find(self, x):
if self.ps[x] < 0:
return x
else:
self.ps[x] = self.find(self.ps[x])
return self.ps[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return False
if self.ps[x] > self.ps[y]:
x, y = y, x
self.ps[x] += self.ps[y]
self.ps[y] = x
return True
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
x = self.find(x)
return -self.ps[x]
uf = UnionFind(N)
friends = [0]*(N+1)
chain = [0]*(N+1)
for _ in range(M):
A, B = map(int, input().split())
friends[A] += 1
friends[B] += 1
uf.union(A, B)
for _ in range(K):
C, D = map(int, input().split())
if uf.same(C, D):
friends[C] += 1
friends[D] += 1
ans = []
for i in range(1, N+1):
ans.append(uf.size(i) - friends[i] - 1)
print(*ans) | class dice:
def __init__(self, X):
self.x = [0] * 6
self.x[0] = X[0]
self.x[1] = X[1]
self.x[2] = X[2]
self.x[3] = X[3]
self.x[4] = X[4]
self.x[5] = X[5]
def roll(self, d):
if d == 'S':
self.x[0], self.x[1], self.x[2], self.x[3], self.x[4], self.x[5] = \
self.x[4], self.x[0], self.x[2], self.x[3], self.x[5], self.x[1]
elif d == 'E':
self.x[0], self.x[1], self.x[2], self.x[3], self.x[4], self.x[5] = \
self.x[3], self.x[1], self.x[0], self.x[5], self.x[4], self.x[2]
elif d == 'W':
self.x[0], self.x[1], self.x[2], self.x[3], self.x[4], self.x[5] = \
self.x[2], self.x[1], self.x[5], self.x[0], self.x[4], self.x[3]
elif d == 'N':
self.x[0], self.x[1], self.x[2], self.x[3], self.x[4], self.x[5] = \
self.x[1], self.x[5], self.x[2], self.x[3], self.x[0], self.x[4]
X = list(map(int, input().split()))
directions = list(input())
d_one = dice(X)
for dist in directions:
d_one.roll(dist)
print(d_one.x[0])
| 0 | null | 30,849,775,584,320 | 209 | 33 |
H,W,K = map(int,input().split())
C = [[int(i) for i in input()] for _ in range(H)]
ans = float("inf")
for i in range(1<<(H-1)):
start = [0]
end = []
for j in range(H-1):
if i & (1 << j):
j += 1
start.append(j)
end.append(j)
end.append(H)
L = len(end)
cnt = [0]*L
dcnt = L-1
fail = False
for w in range(W):
div = False
idx = 0
tmp = [0]*L
for s,e in zip(start,end):
for h in range(s,e): tmp[idx] += C[h][w]
if tmp[idx] > K:
fail = True
break
if cnt[idx] + tmp[idx] > K:
div = True
cnt = tmp[:]
else:
cnt[idx] += tmp[idx]
idx += 1
if fail: break
if div: dcnt += 1
if fail: continue
ans = min(dcnt,ans)
print(ans) | import sys
from collections import defaultdict, deque, Counter
import math
# import copy
from bisect import bisect_left, bisect_right
import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
def nck(n, k, kaijyo):
return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
def npk(n, k, kaijyo):
if k == 0 or k == n:
return n % MOD
return (kaijyo[n] * divide(kaijyo[n-k])) % MOD
def kaijyo(n):
ret = [1]
for i in range(1, n + 1):
ret.append((ret[-1] * i)% MOD)
return ret
def cut(pt, grid, k, h, w):
pat = []
for i in range(h-1):
if pt % 2 == 1:
pat.append("1")
else:
pat.append("0")
pt //= 2
# print("pat", pat)
slice = Counter(pat)["1"]
pat = pat + ["0"]
white = [0] * (slice + 1)
ret = 0
for i in range(w):
tw = [0] * (slice + 1)
dan = 0
for j in range(h):
if grid[j][i] == "1":
tw[dan] += 1
if pat[j] == "1":
dan += 1
if max(tw) > k:
return INF
reset = False
for w1, w2 in zip(white, tw):
if w1 + w2 > k:
ret += 1
reset = True
break
if reset:
white = tw
else:
for up in range(slice + 1):
white[up] += tw[up]
return ret + slice
def solve():
h, w, k = getList()
grid = []
for i in range(h):
grid.append(getS())
ans = INF
for i in range(2 ** (h-1)):
tmp = cut(i, grid, k, h, w)
# print(tmp)
ans = min(ans, tmp)
print(ans)
def main():
n = getN()
for _ in range(n):
solve()
if __name__ == "__main__":
# main()
solve() | 1 | 48,342,822,759,154 | null | 193 | 193 |
import sys
x,y = map(int,input().split())
for i in range(x+1):
for j in range(x-i+1):
if i+j == x and (i*2)+(j*4) == y:
print("Yes")
sys.exit()
print("No") | print('Yes') if len(set(input().split()))==1 else print('No')
| 0 | null | 48,266,245,673,280 | 127 | 231 |
n, k = [int(i) for i in input().split()]
h = sorted([int(i) for i in input().split()])
if k > len(h):
print(0)
elif k == 0:
print(sum(h))
else:
print(sum(h[0:-k])) | n,k=map(int,input().split())
h=[int(x) for x in input().rstrip().split()]
h.sort(reverse=True)
for i in range(min(k,n)):
h[i]=0
print(sum(h))
| 1 | 78,990,475,307,030 | null | 227 | 227 |
# -*- coding: utf-8 -*-
def qq(limit=9):
qq_str = ''
for i in range(1, limit+1):
for j in range(1, limit+1):
qq_str += str(i) + 'x' + str(j) + '=' + str(i*j)
if i != limit or j != limit:
qq_str += '\n'
return qq_str
def main():
print(qq())
if __name__ == '__main__':
main() | 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)) | 0 | null | 12,182,878,924,512 | 1 | 154 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.