code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
MOD = 998244353
N, M, K = map(int, input().split())
fac = [1] * N
for i in range(1, N):
fac[i] = (fac[i - 1] * i) % MOD
pow_mmm = [1] * N
for i in range(1, N):
pow_mmm[i] = (pow_mmm[i - 1] * (M - 1)) % MOD
ans = 0
for i in range(K + 1):
t = (M * pow_mmm[N - 1 - i]) % MOD
comb = (fac[N - 1] * pow(fac[N - 1 - i], MOD - 2, MOD) * pow(fac[i], MOD - 2, MOD)) % MOD
t = (t * comb) % MOD
ans = (ans + t) % MOD
print(ans) | mod = 998244353
N,M,K = map(int,input().split())
ans = 0
def pow(x,n):
if n == 0:
return 1
if n % 2 == 0:
return pow((x ** 2)%mod, n // 2)%mod
else:
return x * pow((x ** 2)%mod, (n - 1) // 2)%mod
A = 1
for i in range(K+1):
p = N - i
x = M*pow(M-1,p-1)*A % mod
ans += x
A = A*(N-i-1)%mod
y = pow(i+1,mod-2)
A = A*y % mod
print(ans%mod) | 1 | 23,041,950,154,398 | null | 151 | 151 |
import math
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
ave = 0
cnt = 0
import itertools
for v in itertools.permutations([int(x) for x in range(N)],N) :
for i in range(1,len(v)) :
ave += math.sqrt((xy[v[i-1]][0]-xy[v[i]][0])**2+(xy[v[i-1]][1]-xy[v[i]][1])**2)
cnt += 1
ave = ave / cnt
print(ave) | import math
N, D = map(int, input().split())
XY = []
for _ in range(N):
x, y = map(int, input().split())
XY.append([x,y])
cnt = 0
for xy in XY:
if math.sqrt(pow(xy[0], 2) + pow(xy[1], 2)) <= D:
cnt += 1
print(cnt)
| 0 | null | 77,055,357,595,590 | 280 | 96 |
n,k=map(int,input().split())
ans=0
max=0
min=0
for i in range(k,n+1):
ans+=i*(n-i+1)+1
ans%=1000000007
print(ans+1) | # 10^100のクソデカ数値がクソデカすぎるため、+0,+1..+Nが束になってもいたくも痒くもない
# なのでもはや無視していい
# 最初の例でいうと、2つ選ぶのは[0,1,2,3]からなので、和のバリエーションは最小値1~最大値5の5つ
# 3つ選ぶのは最小値3~最大値6の4つ
# 4つ選ぶのは1つ
# 毎回最大値と最小値を計算して差+1を加えてやるとできあがり
# 計算には数列の和を使う
n, k = map(int, input().split())
mod = 10**9 + 7
ans = 1
for i in range(k, n + 1):
# 初項0,公差1,末項i-1までの和
min_s = i * (i - 1) // 2
# 初項n+1-i, 公差1, 末項i-1までの和
max_s = i * (2 * (n + 1 - i) + (i - 1)) // 2
ans += max_s - min_s + 1
ans %= mod
print(ans)
| 1 | 33,126,241,063,972 | null | 170 | 170 |
N, k = map(int, input().split())
dp = [0] * (N+1)
dp[1] = 1
S = []
for i in range(k):
S.append(list(map(int, input().split())))
for i in range(2, N+1):
for l, r in S:
dp[i] += (dp[max(i-l, 0)] - dp[max(i-r-1, 0)])
dp[i] += dp[i-1]
dp[i] %= 998244353
print((dp[N] - dp[N-1])%998244353) | import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 998244353
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()
LR = [NLI() for _ in range(K)]
dp = [0] * (N*2+10)
dp[1] = 1
now = 0
for i in range(1, N+1):
now = (now + dp[i]) % MOD
for l, r in LR:
dp[i+l] = (dp[i+l] + now) % MOD
dp[i+r+1] = (dp[i+r+1] - now) % MOD
print(dp[N])
if __name__ == "__main__":
main() | 1 | 2,664,205,023,260 | null | 74 | 74 |
n = int(input())
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for k in range(60):
x, y = 0, 0
for a in A:
x += 1 & a >> k
tmp = x * (n - x) % mod
tmp *= 2**k%mod
ans += tmp
ans %= mod
print(ans)
| from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
def bit(S, j):
# Sの右からj bit目(0-indexed)
return (S>>j)&1
N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(61)]
for i in range(61):
for j in range(N):
B[i] += bit(A[j], i)
for i in range(61):
B[i] = B[i]*(N-B[i]) % mod
ans = 0
for i in range(61):
ans = (ans + 2**i*B[i]) % mod
print(ans % mod) | 1 | 122,909,157,763,700 | null | 263 | 263 |
cards = {
'S': [0 for _ in range( 13)],
'H': [0 for _ in range( 13)],
'C': [0 for _ in range( 13)],
'D': [0 for _ in range( 13)],
}
n = int( input())
for _ in range( n):
(s, r) = input().split()
r = int(r)
cards[s][r - 1] = r
for s in ( 'S', 'H', 'C', 'D'):
for r in range( 13):
if cards[s][r] == 0:
print( '{0:s} {1:d}'.format( s, r+1)) | n = int(input())
S = []
H = []
C = []
D = []
for x in range(0,n):
L = raw_input().split()
if L[0] == "S": S.append(int(L[1]))
elif L[0] == "H": H.append(int(L[1]))
elif L[0] == "C": C.append(int(L[1]))
else: D.append(int(L[1]))
for x in range(1,14):
if not x in S: print "S {}".format(x)
for x in range(1,14):
if not x in H: print "H {}".format(x)
for x in range(1,14):
if not x in C: print "C {}".format(x)
for x in range(1,14):
if not x in D: print "D {}".format(x) | 1 | 1,046,026,537,662 | null | 54 | 54 |
s = raw_input()
if s == "ARC":
print "ABC"
else:
print "ARC" | N=input().rstrip()
if N == "ABC":
print("ARC")
else:
print("ABC") | 1 | 24,158,395,843,208 | null | 153 | 153 |
import sys
def main():
for x in sys.stdin:
if x == "0\n":
break
else:
X = list(x)
total = 0
for i in range(len(X) - 1):
total += int(X[i])
print(total)
if __name__ == "__main__":
main() | N = int(input())
A = list(map(int,input().split()))
Q = int(input())
S = [list(map(int, input().split())) for l in range(Q)]
l = [0] * 10**6
tot = 0
for i in range(N) :
l[A[i]]+=1
tot += A[i]
for i in range(Q):
s0 = S[i][0]
s1 = S[i][1]
tot += s1 * (l[s0] + l[s1]) - (s0 * l[s0] + s1*l[s1])
l[s1] += l[s0]
l[s0] = 0
print(tot) | 0 | null | 6,895,938,312,680 | 62 | 122 |
# B - Battle
# https://atcoder.jp/contests/abc164/tasks/abc164_b
a, b, c, d = map(int, input().split())
while a > 0 or c > 0:
c -= b
a -= d
if c <= 0:
print('Yes')
break
if a <= 0:
print('No')
break
| N = input()
ans = "Yes" if (N[2] == N[3]) and (N[4] == N[5]) else "No"
print(ans) | 0 | null | 36,142,999,387,000 | 164 | 184 |
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs[i] * i) % MOD
return modFacts, invs
MOD = 10 ** 9 + 7
K = int(input())
S = input()
L = len(S)
modFacts, invs = prepare(K + L)
pow25 = [1] * max(L + 1, K + 1)
pow26 = [1] * max(L + 1, K + 1)
for i in range(max(L, K)):
pow25[i + 1] = (pow25[i] * 25) % MOD
pow26[i + 1] = (pow26[i] * 26) % MOD
ans = 0
for n in range(L, L + K + 1):
nonSi = (pow25[n - L] * pow26[L + K - n]) % MOD
Si = (modFacts[n - 1] * invs[L - 1] * invs[n - 1 - (L - 1)]) % MOD
ans += nonSi * Si
ans %= MOD
print(ans)
| def main():
mod = pow(10, 9)+7
k = int(input())
s = input()
n = len(s)
ans = 0
key = pow(26, k, mod)
sub = 1
c = 1
for i in range(k+1):
ans += key*sub*c
ans %= mod
sub *= 25
sub %= mod
key = key*pow(26, mod-2, mod)%mod
c *= (n+i)
c *= pow(i+1, mod-2, mod)
c %= mod
print(ans)
if __name__ == "__main__":
main()
| 1 | 12,791,138,535,892 | null | 124 | 124 |
a = list(map(int, '1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51'.split(',')))
k = int(input())
print(a[k-1]) | def solve():
print([1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51][int(input())-1])
return 0
if __name__ == '__main__':
solve() | 1 | 50,048,073,470,752 | null | 195 | 195 |
import collections
H, W, *S = open(0).read().split()
H, W = [int(_) for _ in [H, W]]
dist = [[float('inf')] * W for _ in range(H)]
dist[0][0] = 0
Q = collections.deque([0])
while True:
if not Q:
break
i = Q.popleft()
x, y = divmod(i, W)
d = dist[x][y]
for dx, dy in ((1, 0), (0, 1)):
nx, ny = x + dx, y + dy
if 0 <= nx < H and 0 <= ny < W:
if S[nx][ny] == '#' and S[x][y] == '.':
if dist[nx][ny] > d + 1:
dist[nx][ny] = d + 1
Q += [nx * W + ny]
elif dist[nx][ny] > d:
dist[nx][ny] = d
Q += [nx * W + ny]
ans = dist[-1][-1]
if S[0][0] == '#':
ans += 1
print(ans)
| def main():
from itertools import permutations
from math import hypot
N = int(input())
xys = []
for _ in range(N):
x, y = map(int, input().split())
xys.append((x, y))
ans = 0
for perm in permutations(xys, r=2):
x1, y1 = perm[0]
x2, y2 = perm[1]
d = hypot(x2 - x1, y2 - y1)
ans += d
ans /= N
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 99,239,369,144,932 | 194 | 280 |
while True:
table=str(input())
if table[0] == '0':
break
print(sum(int(num) for num in(table)))
| #coding:utf-8
while True:
l = [int(x) for x in input()]
if len(l) and l[0]==0:
break
print(sum(l)) | 1 | 1,590,440,050,220 | null | 62 | 62 |
#import numpy as np
#def area--------------------------#
#ryouno syokiti
class ryou:
def flinit(self):
room=list()
for i in range(10):
room+=[0]
return room
#def kaijo([a_1,a_2,a_3,a_4,a_5,a_6,a_7,a_8,a_9,a_10]):
#def kaijo(x):
# y=[]
# for i in x:
# y=y+ " "+x[i]
# return y
def kaijo(x):
print "",
for i in range(len(x)-1):
print str(x[i]),
print str(x[len(x)-1])
#----------------------------------#
floor_11=ryou().flinit()
floor_12=ryou().flinit()
floor_13=ryou().flinit()
floor_21=ryou().flinit()
floor_22=ryou().flinit()
floor_23=ryou().flinit()
floor_31=ryou().flinit()
floor_32=ryou().flinit()
floor_33=ryou().flinit()
floor_41=ryou().flinit()
floor_42=ryou().flinit()
floor_43=ryou().flinit()
fldic={"11":floor_11,
"12":floor_12,
"13":floor_13,
"21":floor_21,
"22":floor_22,
"23":floor_23,
"31":floor_31,
"32":floor_32,
"33":floor_33,
"41":floor_41,
"42":floor_42,
"43":floor_43
}
#----------------------------------#
#1kaime yomikomi
n=int(raw_input())
#nkaime syusyori
for l in range(n):
list_mojiretsu=raw_input().split(" ")
henka=map(int,list_mojiretsu)
fldic[str(henka[0])+str(henka[1])][henka[2]-1]+=henka[3]
kaijo(floor_11)
kaijo(floor_12)
kaijo(floor_13)
print "####################"
kaijo(floor_21)
kaijo(floor_22)
kaijo(floor_23)
print "####################"
kaijo(floor_31)
kaijo(floor_32)
kaijo(floor_33)
print "####################"
kaijo(floor_41)
kaijo(floor_42)
kaijo(floor_43) | X,N=map(int,input().split())
*P,=sorted(map(int,input().split()))
from bisect import bisect_left
if N==0:
t=X
else:
l = bisect_left(P, X)
for i in range(100):
t=X-i
if l-i<0 or t!=P[l-i]: break
t=X+i
if N<=l+i or t!=P[l+i]: break
print(t) | 0 | null | 7,626,378,082,620 | 55 | 128 |
import copy
h, w, k = map(int, input().split())
s = [[0] * w for _ in range(h)]
for i in range(h):
inp = input()
for j in range(w):
s[i][j] = int(inp[j])
# 最終的に出力する操作回数の最小値
ans = h + w - 2
for i in range(2 ** (h-1)):
# bit全探索によるcutの仕方
cutIdx = [0] * (h-1)
for j in range(h-1):
cutIdx[j] = (i >> j) & 1
#print('cI : ', cutIdx)
# cutする場所を示したリスト
div = []
cut_row_begin, cut_row_end = 0, 1
for j in range(h-1):
if cutIdx[j] == 0:
# cutしない
cut_row_end += 1
else:
# cutする
div.append((cut_row_begin, cut_row_end))
cut_row_begin = cut_row_end
cut_row_end += 1
div.append((cut_row_begin, cut_row_end))
#print('div: ', div)
# 既にここまででcutされている回数
cnt = sum(cutIdx)
#print(cnt)
# divごとのホワイトチョコの数をカウント
whiteCnt = [0] * len(div)
# まずは1列目をチェック
for a in range(len(div)):
cal = 0
for b in range(div[a][0], div[a][1]):
cal += s[b][0]
whiteCnt[a] = cal
#print('wC : ', whiteCnt)
# もしこの時点でwhiteCntの要素でkを超えるものがあるとき
# その横の切り方は不可能なのでbreak
if max(whiteCnt) > k:
continue
# Wが1ならそこで終わり
if w == 1:
ans = min(ans, cnt)
# 次行のホワイトチョコ数を保持
search = [0] * len(div)
# 2列目以降を同様にチェックしていく
for a in range(1, w):
# その次行のホワイトチョコの数
for b in range(len(div)):
cal = 0
for c in range(div[b][0], div[b][1]):
cal += s[c][a]
search[b] = cal
# その行単体でmax値とkを比べる
# オーバーしていればcut不可
if max(search) > k:
break
# greedy
for b in range(len(div)):
if whiteCnt[b] + search[b] > k:
# cut対象
cnt += 1
whiteCnt = copy.copy(search)
break
else:
whiteCnt[b] += search[b]
#print('cnt: ', cnt)
ans = min(ans, cnt)
print(ans) | from collections import deque
H, W, K = map(int, input().split())
mp = [input() for _ in range(H)]
rlt = 1010
h = deque([[1]])
while h:
t = h.pop()
if len(t) == H:
t.append(1)
tmp = sum(t) - 2
bs = tmp
lst = [0]*H
j = -1
for i in range(len(t)-1):
if t[i] == 1:
j += 1
lst[i] = j
cnt = [0]*(lst[-1]+1)
for j in range(W):
tcnt = [0]*(lst[-1]+1)
f = 0
for i in range(H):
tcnt[lst[i]] += int(mp[i][j])
for k in range(lst[-1]+1):
if tcnt[k] > K:
f = 2
break
cnt[k] += tcnt[k]
if cnt[k] > K:
f = 1
break
if f == 2:
break
if f == 1:
tmp += 1
for k in range(lst[-1]+1):
cnt[k] = tcnt[k]
if f < 2:
rlt = min(rlt, tmp)
else:
for i in range(2):
h.append(t+[i])
print(rlt) | 1 | 48,772,958,581,846 | null | 193 | 193 |
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(K):
B = [0] * (N + 1)
for i in range(N):
l = max(0,i-A[i])
r = min(N,i+A[i]+1)
B[l] += 1
B[r] -= 1
for i in range(N):
B[i+1] += B[i]
B.pop(-1)
if A == B:
break
A = B
print(*A)
if __name__ == "__main__":
main() | N,K=map(int,input().split())
A=list(map(int,input().split()))
imos=[0 for i in range(N+1)]
zero=[0 for i in range(N+1)]
ANS=[str(N)]*N
if K>=40:
ans=" ".join(ANS)
print(ans)
else:
for t in range(K):
for i in range(N):
l=max(0,i-A[i])
r=min(N,i+A[i]+1)
imos[l]+=1
imos[r]-=1
for i in range(0,N):
imos[i+1]+=imos[i]
A[i]=imos[i]
imos=[0 for i in range(N+1)]
for i in range(N):
A[i]=str(A[i])
ans=" ".join(A)
print(ans) | 1 | 15,428,641,468,390 | null | 132 | 132 |
r=int(input())
print((r*r)) | from sys import stdin
r = int(stdin.readline().rstrip())
print(r*r)
| 1 | 145,107,019,176,608 | null | 278 | 278 |
C = input()
tmp = ord(C)
print(chr(tmp + 1))
| import collections
N = int(input())
A = list(map(int,input().split()))
a = collections.Counter(A)
for i in range(1,len(A)+2):
print(a[i]) | 0 | null | 62,190,819,864,432 | 239 | 169 |
X = int(input())
while True:
a = []
for i in range(2,X):
if X % i == 0:
a.append(0)
break
else:
a.append(1)
if 0 in a:
X += 1
else:
break
print(X) | n = int(input())
a = list(map(int, input().split()))
for i in range(1, n):
a[i] += a[i - 1]
ans = a[n-1]
for x in a[:n-1]:
ans = min(ans, abs(a[n-1] - 2 * x))
print(ans)
| 0 | null | 123,703,379,796,592 | 250 | 276 |
x = int(input())
money = 100
year = 0
while True:
money = money + money*100//10000
year += 1
if money >= x:
print(year)
exit() | X = int(input())
ASSET = 100
cnt = 0
while ASSET < X:
ASSET += ASSET // 100
cnt += 1
print(cnt) | 1 | 27,274,755,723,970 | null | 159 | 159 |
a=int(input())
print(a//500*1000+a%500//5*5) | X=int(input())
number1=X//500
number2=(X-(X//500)*500)//5
print(number1*1000+number2*5)
| 1 | 42,789,541,108,538 | null | 185 | 185 |
from collections import Counter
def dis(i,j, x,y):
return min(j-i, abs(x-i)+1+abs(j-y), abs(y-i)+1+(j-x))
n, x, y = map(int, input().split())
x,y = x-1,y-1
D = []
for i in range(n-1):
for j in range(i+1, n):
D.append(dis(i,j, x,y))
cD = Counter(D)
for i in range(1, n):
print(cD[i]) | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush
from decimal import *
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
##### 割り算の切り上げ #####
# tmp = -(-4 // 3)
##### dict の for文 #####
# for k, v in d.items():
# print(k, v)
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
pazuru_nobori = []
pazuru_kudari = []
for i in range(N):
S = inputStr()
tmp = 0
min_tmp = 0
for s in S:
if s == "(":
tmp += 1
else:
tmp -= 1
if min_tmp > tmp:
min_tmp = tmp
if tmp >= 0:
pazuru_nobori.append((min_tmp,tmp))
else:
pazuru_kudari.append((min_tmp,tmp))
pazuru_nobori.sort()
pazuru_nobori = pazuru_nobori[::-1]
score = 0
for i,val in enumerate(pazuru_nobori):
min_tmp,tmp = val
if score + min_tmp < 0:
print("No")
sys.exit()
score += tmp
pazuru_kudari_non = []
for i,val in enumerate(pazuru_kudari):
min_tmp,tmp = val
min_tmp_2 = min_tmp - tmp
tmp_2 = -1 * tmp
pazuru_kudari_non.append((min_tmp_2,tmp_2))
pazuru_kudari_non.sort()
pazuru_kudari_non = pazuru_kudari_non[::-1]
score2 = 0
for i,val in enumerate(pazuru_kudari_non):
min_tmp,tmp = val
if score2 + min_tmp < 0:
print("No")
sys.exit()
score2 += tmp
if score2 == score:
print("Yes")
else:
print("No")
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# N 個のボールを K グループに分ける場合のパターン数
def sunuke(N, K, mod=10**9+7):
if N < K or K-1 < 0:
return 0
else:
return combination(N-1, K-1, mod)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
stk = []
stk.append(edge)
while len(stk) > 0:
p = stk.pop()
for e in graph[p]:
if parent[p] == e:
continue
else:
parent[e] = p
counter[e] += counter[p]
stk.append(e)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| 0 | null | 33,977,903,688,056 | 187 | 152 |
x,y=map(int,input().split())
print(100000*(max(4-x,0)+max(4-y,0)+4*(x==y==1))) | x, y = map(int, input().split())
money = [300000, 200000, 100000]
if x == 1 and y == 1:
print(1000000)
elif x <= 3 and y <= 3:
print(money[x - 1] + money[y - 1])
elif x <= 3:
print(money[x - 1])
elif y <= 3:
print(money[y - 1])
else:
print(0) | 1 | 140,287,264,704,924 | null | 275 | 275 |
# C gacha
N = int(input())
goods = set()
cnt = 0
for i in range(N):
S = input()
if S not in goods:
goods.add(S)
cnt += 1
print(cnt) | n=raw_input()
k=n.split(" ")
a=int(k[0])
b=int(k[1])
if a<b:
print "a < b"
if a==b:
print "a == b"
if a>b:
print "a > b" | 0 | null | 15,247,151,168,692 | 165 | 38 |
N=int(input())
S=input()
ans=""
for i in range(len(S)):
ans+=chr(ord("A")+(ord(S[i])-ord("A")+N)%26)
print(ans) | 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()
s = input()
ans = ''
for t in s:
st = ord(t) + n
if(st > ord('Z')):
st = ord('A') + st - ord('Z') - 1
ans = ''.join([ans, chr(st)])
print(ans)
| 1 | 134,476,066,972,848 | null | 271 | 271 |
from collections import deque
q = deque()
for _ in range(int(input())):
b=input()
if b[0] == 'i':
q.appendleft(b[7:])
elif b[6] == ' ':
try:
q.remove(b[7:])
except:
pass
elif len(b) > 10:
q.popleft()
elif len(b) > 6:
q.pop()
print(*q)
| a = list(reversed(sorted([int(raw_input()) for _ in range(10)])))
print a[0]
print a[1]
print a[2] | 0 | null | 23,495,747,980 | 20 | 2 |
import sys
MOD = 10**9+7
s = int(input())
dp = [0, 0, 0, 1]
ruisekiwa = [0, 0, 0, 0]
if s < 3:
print(0)
sys.exit()
for i in range(4, s+1):
dp.append(1 + ruisekiwa[i-1])
ruisekiwa.append(dp[i-2] + ruisekiwa[i-1])
# print(dp)
# print(ruisekiwa)
print(dp[-1] % MOD)
| n = int(input())
s = input()
for i in s:
i = ord(i) + n
if (i > 90):
d = i - 90
print(chr(64+d),end = '')
else:
print(chr(i),end = '') | 0 | null | 69,038,511,223,488 | 79 | 271 |
N, M = map(int, input().split(' '))
H_ls = list(map(int, input().split(' ')))
edge = [ [] for i in range(N) ]
rst = 0
for i in range(M):
a, b = map(int, input().split(' '))
a -= 1
b -= 1
edge[a].append(b)
edge[b].append(a)
for i in range(N):
is_peak = True
for j in edge[i]:
if H_ls[i] <= H_ls[j]:
is_peak = False
break
if is_peak:
rst += 1
print(rst) | S=list(input())
T=list(input())
T.pop(len(T)-1)
if S == T:
print("Yes")
else:
print("No") | 0 | null | 23,149,893,405,158 | 155 | 147 |
raw_input()
print " ".join([i for i in raw_input().split()][::-1]) | n=int(input())
a=list(map(int,input().split()))
tot=sum(a)
b=0
c=10**10
d=0
for i in range(n):
b+=a[i]
d=abs(tot/2 - b)
if d<c:
c=d
print(int(2*c)) | 0 | null | 71,837,235,200,808 | 53 | 276 |
H, N = map(int, input().split())
Magic = [list(map(int, input().split())) for i in range(N)]
MAX_COST = max(Magic)[1]
# dp[damage] := モンスターに damage を与えるために必要な最小コスト
dp = [float('inf')] * (H + 1)
dp[0] = 0
for h in range(H):
for damage, cost in Magic:
next_index = min(h + damage, H)
dp[next_index] = min(dp[next_index], dp[h] + cost)
print(dp[-1]) |
def resolve():
INF = 1<<60
H, N = map(int, input().split())
A, B = [], []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
dp = [INF]*(H+1)
dp[0] = 0
for h in range(H):
for i in range(N):
to = min(H, A[i]+h)
dp[to] = min(dp[to], dp[h]+B[i])
print(dp[H])
if __name__ == "__main__":
resolve()
| 1 | 81,454,243,823,322 | null | 229 | 229 |
d,t,s = [int(x) for x in input().split()]
if d/s <= t:
print("Yes")
else:
print("No") | P = 10**9 + 7
K = int(input())
S = input()
L = len(S)
d = [0]*(L+K+1)
d[0] = 1
for i in range(1, L+K+1):
d[i] = (d[i-1]*i)%P
ans = 0
for i in range(K+1):
temp = pow(26, i, P) * pow(25, K-i, P)
temp %= P
temp *= d[L-1+K-i]
temp %= P
temp *= pow(d[L-1], P-2, P)
temp %= P
temp *= pow(d[K-i], P-2, P)
temp %= P
ans += temp
ans %= P
print(ans) | 0 | null | 8,142,248,328,100 | 81 | 124 |
a=input()
b=input()
c=a*2
if b in c:
print("Yes")
else:
print("No")
| def check(s, p):
for i in range(len(s)):
count = 0
for j in range(len(p)):
if s[(i+j) % len(s)] != p[j]:
break
count += 1
if count == len(p):
return True
return False
s = raw_input()
p = raw_input()
flag = check(s, p)
if flag:
print("Yes")
else:
print("No") | 1 | 1,725,359,873,600 | null | 64 | 64 |
a=input()
b=input()
c=a*2
if b in c:
print("Yes")
else:
print("No")
| from collections import deque
H, W = list(map(int,input().split()))
s = []
for i in range(H): s.append(input())
dx = [0, 1, -1, 0]
dy = [1, 0, 0, -1]
def bfs(sx, sy):
q = deque([])
d = [[-1 for _ in range(W)] for _ in range(H)]
q.append([sx, sy])
d[sx][sy] = 0
while(q):
pop = q.popleft()
x, y = pop[0], pop[1]
for i in range(4):
nx = x + dx[i]
ny = y + dy[i]
if 0 <= nx and nx < H and ny >= 0 and ny < W:
if s[nx][ny] != "#" and d[nx][ny] == -1:
q.append([nx, ny])
d[nx][ny] = d[x][y] + 1
return d
def max_dim2(d):
ret = 0
for i in range(len(d)):
for j in d[i]:
ret = max(ret, j)
return ret
ans = 0
for i in range(H):
for j in range(W):
if s[i][j] == ".":
ret = bfs(i, j)
temp = max_dim2(ret)
ans = max(ans, temp)
print(ans) | 0 | null | 47,976,766,125,248 | 64 | 241 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def ok(t, s):
N = len(t)
for i in range(N):
if t[i]:
for x, y in s[i]:
if y == 1:
if not t[x]:
return False
elif y == 0:
if t[x]:
return False
return True
def solve():
N = int(input())
s = defaultdict(list)
for i in range(N):
A = int(input())
for _ in range(A):
X, Y = map(int, input().split())
X -= 1
s[i].append((X, Y))
ans = 0
for b in range(2 ** N):
t = [0] * N
num = 0
for i in range(N):
if (b >> i) & 1:
t[i] = 1
num += 1
if ok(t, s):
ans = max(ans, num)
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
| n=int(input())
l=[]
lis=[]
for _ in range(n):
a=int(input())
l.append(a)
li=[]
for _ in range(a):
c,d=map(int,input().split())
li.append([c,d])
lis.append(li)
ans=-1
for i in range(2**n-1,-1,-1):
mark=bin(i)[2:]
mark=(n-len(mark))*'0'+mark
s=0
record=[-1]*n
f=1
for j in range(n):
for k in range(l[j]):
number=lis[j][k][0]-1
hou=lis[j][k][1]
if int(mark[j])==1:
if record[number]==-1:
record[number]=hou
elif record[number]!=hou:f=0
if f==0:break
if f == 0: break
if f==1:
F=True
for i in range(n):
if record[i]!=-1:
if record[i]!=int(mark[i]):
F=False
break
if F==True:
print(mark.count('1'))
exit()
| 1 | 121,272,133,922,742 | null | 262 | 262 |
import math
def main():
A, B, N = map(int, input().split())
x = min([B-1, N])
print(int(math.floor(A * x / B) - A * math.floor(x / B)))
if __name__ == '__main__':
main()
| import numpy as np
from fractions import gcd
def lcm(a,b):
return a*b//gcd(a,b)
N,M=map(int,input().split())
a=[i//2 for i in map(int,input().split())]
b=np.array(a)
cnt=0
while all(b%2==0):
b//=2
if any(b%2==0):
print(0)
exit()
ans=1
for i in a:
ans=lcm(ans,i)
print((M//ans-1)//2+1)
| 0 | null | 64,803,300,724,998 | 161 | 247 |
a,b=map(int,input().split())
l=list(map(int,input().split()))
import itertools
b=min(b,50)
def ku(l):
y=[0]*a
for j,x in enumerate(l):
y[max(0,j-x)]+=1
r=min(j+x,a-1)
if r<a-1:
y[r+1]-=1
return itertools.accumulate(y)
for _ in range(b):
l=ku(l)
print(*l) | n, k, *a = map(int, open(0).read().split())
for _ in range(k):
b = [0] * -~n
for i in range(len(a)):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i in range(n):
b[i + 1] += b[i]
if all(x == n for x in b[:n]):
print(*b[:n])
exit()
a = b
print(*a[:n]) | 1 | 15,460,188,693,730 | null | 132 | 132 |
#!/usr/bin/env python3
def solve(S: str):
if S >= 30:
return "Yes"
return "No"
def main():
S = int(input())
answer = solve(S)
print(answer)
if __name__ == "__main__":
main()
| i = int(input())
if i >= 30:
print('Yes')
else:
print('No') | 1 | 5,707,281,581,712 | null | 95 | 95 |
H,W,K=map(int,input().split())
S=[[int(s) for s in input()] for i in range(H)]
ans=1000000
for i in range(2**(H-1)):
tmp=0
L=[]
for j in range(H-1):
if i>>j&1:
L.append(j)
tmp+=len(L)
L.append(H-1)
c=[0]*len(L)
for k in range(W):
h=0
c1=[0]*len(L)
for l in range(len(L)):
for m in range(h,L[l]+1):
c1[l]+=S[m][k]
h=L[l]+1
p=0
for l in range(len(L)):
if c1[l]>K:
p=2
break
elif c[l]+c1[l]>K:
p=1
else:
c[l]+=c1[l]
if p==2:
break
elif p==1:
c=[i for i in c1]
tmp+=1
else:
ans=min(ans,tmp)
print(ans) | import numpy as np
x, y, a, b, c = map(int, input().split())
p = np.array(list(map(int, input().split())))
q = np.array(list(map(int, input().split())))
r = np.array(list(map(int, input().split())))
p.sort()
q.sort()
r.sort()
ans = p[-x:].sum()+q[-y:].sum()
p_cnt = 0
q_cnt = 0
r_cnt = 0
while not(-x+p_cnt == 0 and -y+q_cnt == 0) and -1-r_cnt >= -c:
if -x+p_cnt == 0:
if r[-1-r_cnt] > q[-y+q_cnt]:
ans += r[-1-r_cnt] - q[-y+q_cnt]
q_cnt += 1
r_cnt += 1
else:
break
elif -y+q_cnt == 0:
if r[-1-r_cnt] > p[-x+p_cnt]:
ans += r[-1-r_cnt] - p[-x+p_cnt]
p_cnt += 1
r_cnt += 1
else:
break
elif p[-x+p_cnt] <= q[-y+q_cnt] and r[-1-r_cnt] > p[-x+p_cnt]:
ans += r[-1-r_cnt] - p[-x+p_cnt]
p_cnt += 1
r_cnt += 1
elif p[-x+p_cnt] > q[-y+q_cnt] and r[-1-r_cnt] > q[-y+q_cnt]:
ans += r[-1-r_cnt] - q[-y+q_cnt]
q_cnt += 1
r_cnt += 1
else:
break
print(ans) | 0 | null | 46,867,368,172,480 | 193 | 188 |
d=int(input())
c = list(map(int,input().split()))
s=[None]*d
for i in range(d):
s[i] = list(map(int,input().split()))
t=[0]*d
for i in range(d):
t[i]=int(input())
last=[0]*26
satis=0
pena=0
for j in range(d):
ss=s[j]
tt=t[j]
satis += ss[tt-1]
last[tt-1]=j+1
pena += sum(c[i]*(j+1-last[i]) for i in range(26))
print(satis-pena) | str = input() *2
pattern = input()
if pattern in str:
print("Yes")
else:
print("No") | 0 | null | 5,888,631,185,518 | 114 | 64 |
n = int(input())
dic = {}
for i in range(n):
dic[i] = input().split()
x = input()
start = 0
for i, (k, v) in enumerate(dic.items()):
if v[0] not in [x]:
pass
else:
start = i+1
break
if start==0:
print(0)
else:
ans = 0
for i, (k, v) in enumerate(dic.items()):
if i < start:
pass
else:
ans += int(v[1])
print(ans) | import itertools
n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
for i, l in enumerate(itertools.permutations(range(1, n + 1))):
if list(l) == p:
a = i
if list(l) == q:
b = i
print(abs(a - b))
| 0 | null | 98,835,085,503,140 | 243 | 246 |
N,K = map(int,input().split())
n = N - K * (N//K)
n = min(n, abs(n-K))
print(n) | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
N, K = MI()
a = N % K
b = K - a
print(min(a, b))
if __name__ == "__main__":
main() | 1 | 39,370,459,917,178 | null | 180 | 180 |
I=input
r=range
a=[[[0 for i in r(10)]for j in r(3)]for k in r(4)]
for i in r(int(I())):b,f,r,v=map(int,I().split());a[b-1][f-1][r-1]+=v
f=0
for i in a:
if f:print('#'*20)
else:f=1
for j in i:print('',*j) | house1 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house2 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house3 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house4 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
houses = [house1, house2, house3, house4]
n = int(input())
for i in range(n):
b, f, r, v = [int(x) for x in input().split()]
houses[b - 1][f - 1][r - 1] += v
cnt = 0
for house in houses:
for floor in house:
floor = [str(x) for x in floor]
print(' ' + ' '.join(floor))
if cnt != 3:
print('#' * 20)
cnt += 1 | 1 | 1,125,286,566,250 | null | 55 | 55 |
inArray = input().split()
inArray.sort()
print(" ".join(inArray))
| a = input().split()
v = 2
while int(v) >= 1:
if int(a[int(v)-1]) < int(a[int(v)]):
pass
else:
b = int(a[int(v)-1])
a[int(v)-1] = int(a[int(v)])
a[int(v)] = int(b)
v = int(v) - 1
if int(a[1]) < int(a[2]):
pass
else:
b = int(a[1])
a[1] = int(a[2])
a[2] = int(b)
print('%d %d %d' % (int(a[0]),int(a[1]),int(a[2])))
| 1 | 416,968,250,910 | null | 40 | 40 |
import sys
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v==w or w>v:
print('NO')
sys.exit()
else:
tp=(b-a)/(v-w)
tm=(a-b)/(v-w)
if b>a:
if t>=tp:
print('YES')
else:
print('NO')
else:
if t>=tm:
print('YES')
else:
print('NO')
| r = float(raw_input())
p = 3.14159265358979323846
print '%f %f' %(p * r**2, 2.0 * p * r) | 0 | null | 7,838,070,354,388 | 131 | 46 |
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
from math import sqrt
sys.setrecursionlimit(4100000)
if __name__ == '__main__':
N = int(input())
max_N = int(sqrt(N))+2
ans = 10e13
for a in range(1, max_N):
if N%a==0:
b = N//a
ans = min(ans, a+b-2)
print(ans) | from math import sqrt
n = int(input())
minSoFar = 10**12+1
for a in range(1, int(sqrt(n))+1):
if n % a == 0:
b = n // a
minSoFar = min(minSoFar, a+b-2)
print(minSoFar) | 1 | 161,686,400,474,192 | null | 288 | 288 |
# A - DDCC Finals
def main():
X, Y = map(int, input().split())
prize_table = {1: 300000, 2: 200000, 3: 100000}
prize = 0
for rank in (X, Y):
if rank in prize_table:
prize += prize_table[rank]
if X == Y and X == 1:
prize += 400000
print(prize)
if __name__ == "__main__":
main()
| X, Y = map(int, input().split())
award = [300000, 200000, 100000]
ans = 0
if X <= 3:
ans += award[X-1]
if Y <= 3:
ans += award[Y-1]
if X == 1 and Y == 1:
ans += 400000
print(ans)
| 1 | 140,282,100,504,952 | null | 275 | 275 |
def main():
n = int(input())
dictionary = set()
for _ in range(n):
order, code = input().split()
if order == 'insert':
dictionary.add(code)
elif order == 'find':
if code in dictionary:
print('yes')
else:
print('no')
else:
raise Exception('InputError')
if __name__ == '__main__':
main() | H, W = map(int, input().split())
S = [0]*(H+2)
S[0] = ''.join(['#']*(W+2))
S[-1] = ''.join(['#']*(W+2))
for i in range(1,H+1):
S[i] = '#'+input()+'#'
maxd = 0
import queue
dy = [1,0,-1,0]
dx = [0,1,0,-1]
for h in range(1,H+1):
for w in range(1,W+1):
if S[h][w]=='.':
visited = [[False]*(W+2) for _ in range(H+2)]
q = queue.Queue()
visited[h][w] = True
q.put([h,w,0])
while not q.empty():
a,b,c = q.get()
#print(a,b,c)
for i in range(4):
y,x = a+dy[i], b+dx[i]
if S[y][x]=='.' and visited[y][x]==False:
q.put([y,x,c+1])
visited[y][x]=True
maxd = max(maxd,c)
print(maxd)
| 0 | null | 47,104,805,297,940 | 23 | 241 |
# 数値で入力ではなく, 文字列で入力しlist関数を使う
k = int(input())
s = input()
n = len(s)
list_s = list(s)
# リストのスライス機能を使用
if n > k:
tmp = list_s[0:k]
print(''.join(tmp) + '...')
else: print(''.join(list_s)) | import sys
while 1 > 0:
height, width = map(int, raw_input().split())
if height == 0 and width == 0:
break
for i in range(width):
sys.stdout.write("#")
print ""
for i in range(height - 2):
sys.stdout.write("#")
for j in range(width - 2):
sys.stdout.write(".")
sys.stdout.write("#")
print ""
for i in range(width):
sys.stdout.write("#")
print ""
print | 0 | null | 10,301,250,550,980 | 143 | 50 |
n = int(input())
x = 0
for i in range(1, 10):
if n % i == 0 and n / i < 10:
x += 1
break
else:
pass
if x == 1:
print('Yes')
else:
print('No') | n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
for ARow in A:
result = []
for BCol in zip(*B):
result.append(sum([ARow[i] * BCol[i] for i in range(m)]))
print(*result) | 0 | null | 80,898,224,016,758 | 287 | 60 |
L = input().split()
n = len(L)
A = []
top = -1
for i in range(n):
if L[i] not in {"+","-","*"}:
A.append(int(L[i]))
top += 1
else:
if(L[i] == "+"):
A[top - 1] = A[top - 1] + A[top]
elif(L[i] == "-"):
A[top - 1] = A[top -1] - A[top]
elif(L[i] == "*"):
A[top - 1] = A[top - 1] * A[top]
del A[top]
top -= 1
print(A[top])
| n=int(input())
p=list(map(int,input().split()))
sai = p[0]
answer = 1
for i in range(1,n):
if p[i-1]<=sai:
sai=p[i-1]
if sai >= p[i]:
answer = answer + 1
print(answer) | 0 | null | 42,824,917,813,924 | 18 | 233 |
T1,T2,A1,A2,B1,B2=map(int, open(0).read().split())
C1,C2=A1-B1,A2-B2
if C1<0: C1,C2=-C1,-C2
Y1=C1*T1
Y2=Y1+C2*T2
if Y2>0:
print(0)
elif Y2==0:
print("infinity")
else:
print(1+Y1//(-Y2)*2-(Y1%(-Y2)==0)) | N, K = map(int, input().split())
ans = 0
mod = 10 ** 9 + 7
count = [0] * (K+10)
for i in range(K,0,-1):
t = pow(K//i, N, mod)
j = 2
while j * i <= K:
t -= count[j*i]
j += 1
count[i] = t
# tがiの倍数からなる数列の個数であることが確定しているはず
ans += t * i
ans %= mod
print(ans)
| 0 | null | 84,108,257,726,692 | 269 | 176 |
N=int(input())
for i in range(N):
lst=sorted([int(s) for s in input().split()],reverse=True)
if lst[0]**2 == lst[1]**2+lst[2]**2:
print("YES")
else:
print("NO") | k=int(input())
num=7
i=1
while True:
if k%2==0 or k%5==0:
i=-1
break
num%=k
if num==0:
break
else:
num*=10
num+=7
i+=1
print(i) | 0 | null | 3,096,315,366,300 | 4 | 97 |
n = int(input())
s = input()
res = 'Yes' if s[0:n//2] == s[n//2:] else 'No'
print(res) | n = int(input())
s = input()
h = int(n/2)
s=list(s)
if s[0:h] == s[h:n]:
print("Yes")
else: print("No") | 1 | 146,273,791,626,238 | null | 279 | 279 |
n,k = map(int, input().split())
mod = 10**9+7
def prepare():
fact = []
f = 1
for m in range(1, n):
f *= m
f %= mod
fact.append(f)
f *= n
f %= mod
fact.append(f)
factinv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
inv.append((-inv[mod % i] * (mod // i)) % mod)
factinv.append((factinv[-1] * inv[-1]) % mod)
return fact, factinv
def cmb(a, r, p):
if (r < 0) or (n < r):
return 0
if a == 1:
return f[a] * v[r] * v[n - r] % mod
else:
return f[a] * v[r] * v[n - r - 1] % mod
f,v = prepare()
ans = 1
for i in range(1, min(k + 1, n)):
ans += cmb(0, i, mod) * cmb(1, i, mod)
ans %= mod
print(ans)
|
n,k = map(int,input().split())
class Combination(): # nCr mod MOD など
"""
O(n+log(mod))の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
C = Combination(10**6)
print(C.combi_mod(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7): # O(n+log(mod))
self.mod = mod
self.fac, self.facinv = self.prepare(n_max)
#self.modinv = self.make_modinv_list(n_max) ##なくても問題ないので、必要な時のみ使う
def prepare(self,n): # O(n+log(mod))
# 前処理(コンストラクタで自動的に実行)
# 1! ~ n! の計算
factorials = [1] # 0!の分
for m in range(1, n+1):
factorials.append(factorials[m-1]*m%self.mod)
# n!^-1 ~ 1!^-1 の計算
invs = [1] * (n+1)
invs[n] = pow(factorials[n], self.mod-2, self.mod)
for m in range(n, 1, -1):
invs[m-1] = invs[m]*m%self.mod
return factorials, invs # list
def make_modinv_list(self, n): # O(n)
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
# 整数aのMを法とした時の逆元a^-1は、(0<=a<=M-1)
# a == qM+rであるとき(qは商,rは余り)、
# a^-1 == -qr^-1 % M で与えられる。
modinv[i] = (self.mod - self.mod//i)*modinv[self.mod%i] % self.mod
return modinv
def perm_mod(self,n,r): # nPr % self.mod
if n < r:
return 0
if (n < 0 or r < 0):
return 0
return (self.fac[n] * self.facinv[n-r]) % self.mod
def combi_mod(self,n,r): # nCr % self.mod
if n < r:
return 0
if (n < 0 or r < 0):
return 0
return (((self.fac[n] * self.facinv[r]) % self.mod) * self.facinv[n-r]) % self.mod
def repeated_permutation(self,n,deno): # 重複順列
# n!/(deno[0]!*deno[1]!*...*deno[len(deno)-1]) % MOD
## n:int(分子),deno:分母のlist
if n < max(deno):
return 0
if (n < 0 or min(deno) < 0):
return 0
D = 1
for i in range(len(deno)):
D = D*self.facinv[deno[i]] % self.mod
return self.fac*D % self.mod # int ## == n!/(deno[0]!*deno[1]!*...*deno[len(deno)-1]) % MOD
def H(self,n,r): # 重複組合せ nHr % self.mod
now_n = len(self.fac)
if now_n < n+r-1: # もしself.facの長さが足りなかったら追加
for i in range(now_n+1, n+r-1+1):
self.fac.append(self.fac[i-1]*i%self.mod)
return self.combi_mod(n+r-1,r)
mod = 10**9+7
C = Combination(n,mod)
ans = 0
for i in range(min(k+1,n+1)):
ans += C.combi_mod(n,i)*C.H(n-i,i)
ans %= mod
print(ans)
| 1 | 67,280,806,084,956 | null | 215 | 215 |
def find(A):
increase = []
for i in range(len(A)-1):
if A[i] <= A[i+1]:
increase += [1]
else:
increase += [0]
increase += [0]
val = 1000
hold = 0
for i in range(len(increase)):
if i==0:
if increase[i] == 1:
hold = val//A[i]
val -= A[i]*hold
else:
if increase[i] == 1:
if increase[i-1] == 0:
hold = val//A[i]
val -= A[i]*hold
else:
if increase[i-1] == 1:
val += A[i]*hold
hold = 0
return val
N = input()
A = list(map(int,input().strip().split()))
print(find(A)) | n = int(input())
stocks = [int(x) for x in input().split()]
mymoney = 1000
mystock = 0
for i in range(0,len(stocks)-1): # コメントアウト部分はデバッグ用コード
#print(stocks[i],stocks[i+1],end=":")
if stocks[i] < stocks[i+1]: # 明日の方が株価が高くなる場合は、今日のうちに株を買えるだけ買う
#print("buying",end=" ")
mystock += mymoney//stocks[i]
mymoney = mymoney%stocks[i]
elif stocks[i] >= stocks[i+1]: # 明日の方が株価が安くなる場合には、今日のうちに手持ちの株を売却
#print("selling",end=" ")
mymoney += mystock*stocks[i]
mystock = 0
#print(mymoney,mystock)
i += 1
mymoney += mystock * stocks[i] # 最終日に手持ちの株をすべて売却して現金化
mystock = 0
print(mymoney) | 1 | 7,277,536,300,050 | null | 103 | 103 |
import math
data = list(map(int,input().split(" ")))
#0:目標 1:作れる個数 2:一回の時間
n = math.ceil(data[0]/data[1])
#print(n)
print(n * data[2]) | N = int(input())
A = map(int, input().split())
result = [0] * N
for i, v in enumerate(A):
result[v-1] = str(i + 1)
print(' '.join(result))
| 0 | null | 92,239,303,710,148 | 86 | 299 |
A, B, C = map(int, input().split())
l = [A, B, C]
if len(set(l)) == 2:
print("Yes")
else:
print("No")
| K = int(input())
s = input()
n=len(s)
def find_power(n,mod=10**9+7):
powlist=[0]*(n+1)
powlist[0]=1
powlist[1]=1
for i in range(2,n+1):
powlist[i]=powlist[i-1]*i%(mod)
return powlist
def find_inv_power(n,mod=10**9+7):
powlist=find_power(n)
check=powlist[-1]
first=1
uselist=[0]*(n+1)
secondlist=[0]*30
secondlist[0]=check
secondlist[1]=check**2
for i in range(28):
secondlist[i+2]=(secondlist[i+1]**2)%(10**9+7)
a=format(10**9+5,"b")
for j in range(30):
if a[29-j]=="1":
first=(first*secondlist[j])%(10**9+7)
uselist[n]=first
for i in range(n,0,-1):
uselist[i-1]=(uselist[i]*i)%(10**9+7)
return uselist
mod = 10**9+7
NUM = (2*10**6)+100
p_lis=find_power(NUM,mod)
ip_lis=find_inv_power(NUM,mod)
def comb(n,r,mod=10**9+7):
if n<r:
return 0
elif n>=r:
return (p_lis[n]*ip_lis[r]*ip_lis[n-r])%(mod)
ans=0
for k in range(K+1):
ans+=(comb(n-1+K-k,n-1)* pow(25,K-k,mod)* pow(26,k,mod))
print(ans%mod) | 0 | null | 40,389,871,961,960 | 216 | 124 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
def stds(n):
if n == 1:
return set(['a'])
else:
std = stds(n-1)
ret = set([])
for stdi in std:
for x in range(ord('a'),max(map(ord,list(stdi))) + 2):
ret.add(stdi + chr(x))
return ret
def main():
N = int(input())
ret = list(stds(N))
ret.sort()
print('\n'.join(ret))
if __name__ == '__main__':
main() | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total_T_in_A = [0] * (N+1)
total_T_in_B = [0] * (M+1)
for i in range(1, N+1):
total_T_in_A[i] = total_T_in_A[i-1] + A[i-1]
for i in range(1, M+1):
total_T_in_B[i] = total_T_in_B[i-1] + B[i-1]
result = 0
for i in range(N+1):
# A から i 冊読むときにかかる時間
i_A_T = total_T_in_A[i]
if K < i_A_T:
continue
if K == i_A_T:
result = max(result, i)
continue
rem_T = K - i_A_T
# total_T_in_B は累積和を格納した、ソート済の配列
# B_i <= rem_T < B_i+1 となるような B_i を二分探索によって探す
first = total_T_in_B[1]
last = total_T_in_B[M]
if rem_T < first:
result = max(result, i)
continue
if last <= rem_T:
result = max(result, i + M)
continue
# assume that first <= rem_T <= last
first = 1
last = M
while first < last:
if abs(last - first) <= 1:
break
mid = (first + last) // 2
if rem_T < total_T_in_B[mid]:
last = mid
else:
first = mid
result = max(result, i + first)
print(result)
main()
| 0 | null | 31,639,359,437,980 | 198 | 117 |
N,K=map(int,input().split())
h=input()
def ans142(N:int, K:int, h:list):
N=int(N)
K=int(K)
count=0
if N==1:
h=int(h)
if h>=K:
return(1)
elif h<K:
return(0)
else:
h=h.split()
for i in range(0,N):
if int(h[i])>=K:
count+=1
return(count)
print(ans142(N,K,h))
| import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
n, k = LI()
h = LI()
h.sort()
ans = len([hi for hi in h if hi >= k])
print(ans)
| 1 | 178,377,723,227,670 | null | 298 | 298 |
N = int(input())
SUM = []
for i in range(1,N+1):
if i % 3 == 0 or i % 5 ==0:
pass
else:
SUM.append(i)
print(sum(SUM))
| def check(str):
str2 = str[::-1]
return str == str2
def main():
s = input()
n = len(s)
first = s[:(n-1)//2]
end = s[((n+3)//2)-1:]
if all((check(s), check(first), check(end))):
print("Yes")
else:
print("No")
main() | 0 | null | 40,809,269,016,242 | 173 | 190 |
S = input()
sum = 0
for i in range(3):
if S[i]=="R":
sum += 1
if sum == 2 and S[1] == "S":
sum = 1
print(sum)
| s=input()
ans=0
if s=="SSS":
ans=0
if s=="SSR" or s=="SRS" or s=="RSS" or s=="RSR":
ans=1
if s=="RRS" or s=="SRR":
ans=2
if s=="RRR":
ans=3
print(ans) | 1 | 4,815,979,952,740 | null | 90 | 90 |
t=0
h=0
for i in range(int(input())):
l=input().split()
if l[0]==l[1]:
t+=1
h+=1
elif l[0]>l[1]: t+=3
else: h+=3
print(t,h) | #!/usr/bin python3
# -*- coding: utf-8 -*-
from bisect import bisect_left, bisect_right
n = int(input())
s = list(input())
q = int(input())
al = 'abcdefghijklmnopqrstuvwxyz'
dicq = {i:[] for i in al}
for i, si in enumerate(s):
dicq[si].append(i)
def q1(iq, cq):
#print(iq,cq,s[iq],dicq[s[iq]],bisect_left(dicq[s[iq]], iq))
dicq[s[iq]].pop(bisect_left(dicq[s[iq]], iq)) #更新前から削除
s[iq] = cq
dicq[cq].insert(bisect_left(dicq[cq], iq), iq) #更新後に追加
def q2(l, r):
ret = 0
for ai in al:
if len(dicq[ai])==0: continue
li = bisect_left(dicq[ai], l)
ri = bisect_right(dicq[ai], r)
if li != ri:
ret += 1
elif li == len(dicq[ai]): continue
elif dicq[ai][li] == l:
ret += 1
# print(l,r,ai,dicq[ai],li,ri,ret)
print(ret)
for i in range(q):
fg, x, y = input().split()
if fg == '1':
q1(int(x)-1, y)
else:
q2(int(x)-1, int(y)-1)
| 0 | null | 32,431,224,775,820 | 67 | 210 |
if int(input())==1:print(0)
else:print(1) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
x = int(readline())
if x:
print(0)
else:
print(1)
if __name__ == '__main__':
main()
| 1 | 2,929,685,268,578 | null | 76 | 76 |
N,M = map(int,input().split())
d,ans,wrong = [0]*N,0,0
for _ in range(M):
p,s = input().split()
p = int(p)-1
if d[p] != -1:
if s == "WA":
d[p] += 1
else:
wrong += d[p]
d[p] = -1
ans += 1
print(ans,wrong) | n,m = map(int,input().split())
p=[0]*m
s=[0]*m
for i in range(m):
p[i],s[i]=map(str,input().split())
cor=[0]*n
fal=[0]*n
for i in range(m):
x=int(p[i])
if cor[x-1]==0:
if s[i]=='AC':
cor[x-1]=1
else:
fal[x-1]+=1
ans_cor=0
ans_fal=0
for i in range(n):
if cor[i]==1:
ans_cor+=1
ans_fal+=fal[i]
print(ans_cor,ans_fal) | 1 | 93,448,911,298,480 | null | 240 | 240 |
n = int(input())
L = list(map(int, input().split()))
a = L[0]
b = 0
for i in range(n-1):
if L[i+1] < a:
b = b + (a - L[i+1])
else:
a = L[i+1]
print(b) | N = int(input())
A = list(map(int, input().split()))
s = 0
height = 0
for a in A:
height = max(height, a)
s += height - a
print(s) | 1 | 4,614,616,336,640 | null | 88 | 88 |
print('1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51'.split(',')[int(input())-1]) | a = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51".split(",")
k = int(input()) # 5
print(a[k-1])
| 1 | 49,863,445,756,120 | null | 195 | 195 |
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
q = int(input())
l = [0] * 100000
for i in a:
l[i-1] += 1
for i in range(q):
x,y = map(int, input().split())
hoge = l[x-1]
s -= hoge*x
s += hoge*y
l[y-1] += hoge
l[x-1] = 0
print(s)
| from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
counter = Counter(a)
sum_res = sum(a) # はじめの合計、名前がsumだとsum関数とかぶってよくないので
# q回操作します。ループ変数は使わないので_とします（Pythonの慣習）
for _ in range(q):
before, after = map(int, input().split())
# 合計を変更します
sum_res -= before * counter[before]
sum_res += after * counter[before]
# 個数を変更します
counter[after] += counter[before]
counter[before] = 0
print(sum_res) | 1 | 12,142,841,809,500 | null | 122 | 122 |
from collections import deque
S=deque(input())
Q=int(input())
reverse=0
for q in range(Q):
Query=list(input().split())
T=Query[0]
if T=="1":
reverse+=1
if T=="2":
F,C=Query[1],Query[2]
if F=="1" and reverse%2==0 or F=="2" and reverse%2==1:
S.appendleft(C)
else:
S.append(C)
S="".join(S)
print(S if reverse%2==0 else S[::-1]) | #coding:UTF-8
def GCD(x,y):
d=0
if x < y:
d=y
y=x
x=d
if y==0:
print(x)
else:
GCD(y,x%y)
if __name__=="__main__":
a=input()
x=int(a.split(" ")[0])
y=int(a.split(" ")[1])
GCD(x,y) | 0 | null | 28,449,681,598,452 | 204 | 11 |
import copy as cp
n = int(input())
A = [str(x) for x in input().split()]
AS = cp.copy(A)
def bubble(X):
for i in range(n):
X[i] = list(X[i])
X[i][1] = int(X[i][1])
for i in range(n):
for j in range(n-1):
if (X[j+1][1] < X[j][1]):
X[j],X[j+1] = X[j+1],X[j]
for i in range(n):
X[i][1] = str(X[i][1])
X[i] = "".join(X[i])
return(X)
BA = bubble(A)
def minsort():
for i in range(n):
AS[i] = list(AS[i])
AS[i][1] = int(AS[i][1])
for i in range(n):
minj = i
for j in range(i,n):
if (AS[j][1] < AS[minj][1]):
minj = j
if (minj != i):
AS[i],AS[minj] = AS[minj],AS[i]
for i in range(n):
AS[i][1] = str(AS[i][1])
AS[i] = "".join(AS[i])
return(AS)
MA = minsort()
for k in range(n-1):
print(str(BA[k])+" ",end = "")
print(str(BA[n-1]))
print("Stable")
for k in range(n-1):
print(str(MA[k])+" ",end = "")
print(str(MA[n-1]))
if (BA == MA):
print("Stable")
else :
print("Not stable")
| a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if a < b and b < c:
print('Yes')
else:
print('No')
| 0 | null | 205,647,488,122 | 16 | 39 |
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]) | import math # noqa: F401
from typing import Dict, List, Optional, Tuple, Union # noqa: F401
def main(A: List[int]):
print(A[2], A[0], A[1])
if __name__ == "__main__":
A = list(map(int, input().split()))
main(A)
| 0 | null | 53,924,553,382,558 | 218 | 178 |
def resolve():
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
good = [True for i in range(N)]
for a, b in AB:
a, b = a-1, b-1
if H[a] < H[b]:
good[a] = False
elif H[a] == H[b]:
good[a] = False
good[b] = False
else:
good[b] = False
cnt = 0
for g in good:
if g:
cnt += 1
print(cnt)
if '__main__' == __name__:
resolve() | N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [tuple(map(int,input().split())) for i in range(M)]
ans=0
es = [[] for _ in range(N)]
for a,b in AB:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
for i in range(N):
for j in es[i]:
if H[j]>=H[i]:
break
else:
ans+=1
print(ans) | 1 | 24,922,731,931,776 | null | 155 | 155 |
import sys
n = input()
a = map(int, raw_input().split())
for i in range(n):
sys.stdout.write(str(a[n-i-1]))
if(i != n-1):
sys.stdout.write(" ")
print | n = int(input())
x = list(input().split())
x.reverse()
print(" ".join(x))
| 1 | 993,997,244,218 | null | 53 | 53 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from copy import deepcopy
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return S().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
mod = 1000000007
class BIT:
def __init__(self, size):
self.bit = [0] * size
self.size = size
self.total = 0
def add(self, i, w):
x = i + 1
self.total += w
while x <= self.size:
self.bit[x - 1] += w
x += x & -x
return
def sum(self, i):
res = 0
x = i + 1
while x:
res += self.bit[x - 1]
x -= x & -x
return res
def interval_sum(self, i, j): # i <= x < j の区間
return self.sum(j - 1) - self.sum(i - 1) if i else self.sum(j - 1)
n = I()
s = list(S())
q = I()
D = defaultdict(lambda:BIT(n))
for j in range(n):
D[s[j]].add(j, 1)
for _ in range(q):
qi, i, c = LS()
if qi == "1":
i = int(i) - 1
D[s[i]].add(i, -1)
D[c].add(i, 1)
s[i] = c
else:
l, r = int(i) - 1, int(c)
ret = 0
for k in range(97, 123):
if D[chr(k)].interval_sum(l, r):
ret += 1
print(ret)
| from bisect import bisect_left
import string
dic={c:[] for c in string.ascii_lowercase}
N=int(input())
S=list(input())
Q=int(input())
for i in range(len(S)):
dic[S[i]].append(i+1)
for i in range(Q):
a,b,c=map(str,input().split())
if a=='1':
if S[int(b)-1]==c:
continue
b=int(b)
f=S[b-1]
d=bisect_left(dic[f],b)
e=bisect_left(dic[c],b)
dic[f].pop(d)
dic[c].insert(e,b)
S[b-1]=c
else:
ans=0
b,c=int(b),int(c)
for j in string.ascii_lowercase:
d=bisect_left(dic[j],b)
if d<len(dic[j]):
if dic[j][d]<=c:
ans+=1
print(ans)
| 1 | 62,187,847,677,628 | null | 210 | 210 |
import bisect, collections, copy, heapq, itertools, math, string
from functools import reduce
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = I()
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
ans += gcd(i, j, k)
print(ans) | def judge():
if m == -1 or f == -1:
print("F")
elif m + f >= 80:
print("A")
elif m + f >= 65:
print("B")
elif m + f >= 50:
print("C")
elif m + f >= 30:
if r >= 50:
print("C")
else:
print("D")
else:
print("F")
while True:
m, f, r = map(int, input().split())
if m == f == r == -1:
break
judge()
| 0 | null | 18,269,605,020,420 | 174 | 57 |
n, time=map(int,raw_input().split())
p = []
t = []
for _ in xrange(n):
a = raw_input().split()
p.append(a[0])
t.append(int(a[1]))
alltime = 0
while True:
if len(p)==0:
break
if t[0]<=time:
alltime+=t[0]
print p.pop(0),
t.pop(0)
print alltime
else:
t.append(t[0])
t.pop(0)
t[-1]-=time
alltime += time
p.append(p[0])
p.pop(0) | # coding: utf-8
import sys
import collections
def main():
n, quantum = map(int, raw_input().split())
processes = [x.split() for x in sys.stdin.readlines()]
for p in processes:
p[1] = int(p[1])
queue = collections.deque(processes)
elapsed = 0
while queue:
# print elapsed, queue
head = queue.popleft()
if head[1] > quantum:
head[1] -= quantum
queue.append(head)
elapsed += quantum
else:
elapsed += head[1]
print head[0], elapsed
if __name__ == '__main__':
main() | 1 | 41,989,776,660 | null | 19 | 19 |
a,b = input().split()
a = int(a)
b = int(b)
S = a*b
C = 2 * (a+b)
print(str(S) + " " + str(C))
| n = raw_input()
a = n.split(" ")
b = int(a[0])
c = int(a[1])
print b*c ,(b+c)*2 | 1 | 305,749,052,740 | null | 36 | 36 |
from collections import deque
def main():
s = input()
q = int(input())
d = deque(s)
is_reversed = False
for _ in range(q):
query = list(input().split())
if query[0] == "1":
if is_reversed:
is_reversed = False
else:
is_reversed = True
elif query[0] == "2":
if query[1] == "1":
if is_reversed:
d.append(query[2])
else:
d.appendleft(query[2])
elif query[1] == "2":
if is_reversed:
d.appendleft(query[2])
else:
d.append(query[2])
if is_reversed:
print(*(list(d)[::-1]), sep="")
else:
print(*list(d), sep="")
if __name__ == "__main__":
main()
| S = input()
Q = int(input())
rev = 1
head = []
tail = []
for i in range(Q):
line = input()
if line == '1':
rev *= -1
else:
line = line.split()
F = int(line[1])
C = line[2]
if rev * F in [1, -2]:
head.append(C)
else:
tail.append(C)
head = head[::-1]
S = ''.join(head + [S] + tail)
if rev == -1:
S = S[::-1]
print(S) | 1 | 57,322,212,319,428 | null | 204 | 204 |
n = int(input())
a = list(map(int, input().split()))
print(sum(sorted(a * 2)[::-1][1:n])) | N = int(input())
zoro = 0
ans = 'No'
for i in range(N):
D1, D2 = map(int, input().split())
if D1 == D2:
zoro += 1
else:
zoro = 0
if zoro == 3:
ans = 'Yes'
break
print(ans) | 0 | null | 5,904,750,533,760 | 111 | 72 |
n,a,b=map(int,input().split())
if (a+b)%2==0:
print((b-a)//2)
else:
if n-b>=a-1:
print((a+b-1)//2)
else:
print(n+(1-a-b)//2)
| num = int(input())
print(num**2) | 0 | null | 127,001,178,983,948 | 253 | 278 |
n=int(input())
a=list(map(int,input().split()))
b=[]
f=1
for i in a:
if i%2==0:
b.append(i)
for j in b:
if not (j%3==0 or j%5==0):
f=0
if f:
print("APPROVED")
else:
print("DENIED") | n = int(input())
a = list(map(int, input().split()))
a_ = [i for i in a if i % 2 == 0]
for i in a_:
bool_3 = i % 3 != 0
bool_5 = i % 5 != 0
if bool_3 and bool_5:
print('DENIED')
break
else:
print('APPROVED')
| 1 | 68,875,134,243,442 | null | 217 | 217 |
def merge(a, left, mid, right):
x = 0
l = a[left:mid] + [float("inf")]
r = a[mid:right] + [float("inf")]
i = 0
j = 0
for k in range(left,right):
if l[i] <= r[j]:
a[k] = l[i]
i += 1
else :
a[k] = r[j]
j += 1
x += 1
return x
def mergeSort(a, left, right,x):
if left+1 < right:
mid = int((left + right)/2)
mergeSort(a, left, mid,x)
mergeSort(a, mid, right,x)
x[0] += merge(a, left, mid, right)
n = int(input())
s = list(map(int,input().split()))
x = [0]
mergeSort(s,0,n,x)
print(*s)
print(x[0])
| a,b,c=map(int,input().split());print('Yes'if a<b<c else'No')
| 0 | null | 245,688,298,688 | 26 | 39 |
num_freebies = int(input())
freebies = []
for _ in range(num_freebies):
freebies.append(input())
print(len(set(freebies)))
| 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) | 0 | null | 18,091,943,741,850 | 165 | 96 |
from collections import deque
N, M = map(int, input().split())
route = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
route[a - 1].append(b - 1)
route[b - 1].append(a - 1)
print('Yes')
q = deque()
d = [-1] * N
d[0] = 0
q.append(0)
while q:
x = q.popleft()
for i in route[x]:
if d[i] == -1:
d[i] = x + 1
q.append(i)
for i in range(1, N):
print(d[i])
| import numpy as np
MOD = 10 ** 9 + 7
N, K = map(int, input().split(' '))
cumsum = np.arange(0, N + 2).cumsum()
ans = 0
for k in range(K, N + 2):
ans += cumsum[-1] - cumsum[-(k + 1)] - cumsum[k] + 1
ans %= MOD
print(ans)
| 0 | null | 26,822,183,258,598 | 145 | 170 |
n,m=map(int,input().split())
height=list(map(int,input().split()))
hoge=[1 for i in range(n)]
#print(hoge)
for i in range(m):
a,b=map(int,input().split())
#print(a,b,height[a-1],height[b-1])
if(height[a-1]>height[b-1]):
hoge[b-1]=0
elif(height[a-1]<height[b-1]):
hoge[a-1]=0
else:
hoge[a-1],hoge[b-1]=0,0
print(sum(hoge)) | from math import sqrt
N = int(input())
# Cが固定されAxBを入れ替えるときは省略したい
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
ans = 0
""" for C in range(1,N):
ans += len(make_divisors(N-C)) """
for A in range(1,N):
ans += (N-1)//A
print(ans) | 0 | null | 13,839,348,206,662 | 155 | 73 |
n=int(input())
c = [[0]*10 for i in range(10)]
n_len = len(str(n))
for k in range(1,n+1):
k_str = str(k)
l,r=int(k_str[0]),int(k_str[-1])
c[l][r]+=1
cnt = 0
for i in range(10):
for j in range(10):
cnt += c[i][j]*c[j][i]
print(cnt) | import numpy as np
n = int(input())
table,ans = np.zeros((9,9)),0
for k in range(n):
num = str(k+1)
if int(num[0])!=0 and int(num[-1])!=0:
table[int(num[0])-1][int(num[-1])-1]+=1
for i in range(9):
for j in range(9):
ans += table[i][j]*table[j][i]
print(int(ans)) | 1 | 86,601,780,223,322 | null | 234 | 234 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input().strip()))
dp = [[0]*(w) for _ in range(h)]
def cals_score(i, j):
score = 10**9 + 7
if i >= 1:
score = dp[i-1][j] + (1 if grid[i-1][j]!=grid[i][j] else 0)
if j >= 1:
score = min(score, dp[i][j-1] + (1 if grid[i][j-1]!=grid[i][j] else 0))
return score
dp[0][0] = 1
for i in range(1, w):
dp[0][i] = cals_score(0, i)
for i in range(1, h):
dp[i][0] = cals_score(i, 0)
for i in range(1, h):
for j in range(1, w):
dp[i][j] = cals_score(i, j)
print(dp[-1][-1]//2 + dp[-1][-1]%2 * (grid[0][0]=='#'))
if __name__=='__main__':
main()
| import sys
N = input()
for i in range ( len ( N )):
if '7' == N[i] :
print("Yes")
sys.exit()
print("No") | 0 | null | 41,829,046,877,888 | 194 | 172 |
from itertools import combinations
n = int(input())
state = [None] + [[set(),set()] for _ in range(n)]
for i in range(1,n+1):
a = int(input())
for _ in range(a):
x,y = map(int,input().split())
if y == 0:
state[i][0].add(x)
if y == 1:
state[i][1].add(x)
ans = 0
#正直者の人数を仮定
for i in range(1,n+1):
#正直者の選び方を仮定
for j in combinations(list(range(1,n+1)), i):
assum = set(j)
state_lst = []
#正直者の証言抽出
for each_state in j:
state_lst.append(state[each_state])
#証言の矛盾を確認
for each_state in state_lst:
crr0 = assum.isdisjoint(each_state[0])
crr1 = assum >= each_state[1]
crr = crr0 and crr1
if not crr:
break
else:
ans = i
print(ans) | n = int(input())
d = dict()
for i in range(n):
a = int(input())
for j in range(a):
l = d.get(i, [])
p, t = list(map(int, input().split(' ')))
l.append((p-1, t))
d[i] = l
# d[i] に i番の人の証言のlistがあるので 全パターン(=2^15)で矛盾しないか試す？
def get_bit_array(num):
res = []
while num > 0:
res.append(num%2)
num //= 2
while len(res) < n:
res = res + [0]
return res[::-1]
def valid(tfs):
for i in range(len(tfs)):
honest = tfs[i]
if not honest: # 嘘つきは無視する
continue
for (person, tf) in d.get(i, []): # 合ってる？
if tfs[person] != tf:
return False
return True
ans = 0
def f(num):
global ans
if num >= 2**n:
return
tfs = get_bit_array(num) # tfs = [1,0,1,0,...0] true or flase
total = sum(tfs)
if valid(tfs):
ans = max(ans, total)
for i in range(int(2**n)):
f(i)
print(ans)
| 1 | 121,819,313,134,958 | null | 262 | 262 |
import sys
readline = sys.stdin.readline
S = readline().rstrip()
from collections import deque
S = deque(S)
Q = int(readline())
turn = False
for i in range(Q):
query = readline().split()
if query[0] == "1":
turn ^= True
elif query[0] == "2":
if query[1] == "1":
if turn:
S.append(query[2])
else:
S.appendleft(query[2])
elif query[1] == "2":
if turn:
S.appendleft(query[2])
else:
S.append(query[2])
S = "".join(S)
if turn:
S = S[::-1]
print(S) | def main():
N, D = map(int, input().split())
ans = 0
for _ in range(N):
x, y = map(int, input().split())
if x*x + y* y <= D*D:
ans += 1
return ans
if __name__ == '__main__':
print(main())
| 0 | null | 31,605,751,004,870 | 204 | 96 |
from math import gcd
from sys import stdin
N = int(stdin.readline().rstrip())
print(360//gcd(N, 360)) | import math
import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def main():
X = ii()
print(360//math.gcd(X,360))
if __name__ == "__main__":
main()
| 1 | 13,150,034,890,652 | null | 125 | 125 |
n,k = map(int,input().split())
a = list(map(int,input().split()))
l = 0
r = 10**10
while r > l + 1:
m = (r+l)//2
count = 0
for i in a:
if i <= m:
continue
count += (i)//m
if count > k:
l = m
else:
r = m
print(r)
| import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
start = 0
end = max(A)
ans = abs(end + start) // 2 + 1
while abs(start - end) > 1:
ans = abs(end + start) // 2
cnt = 0
for i in range(N):
cnt += math.floor(A[i]/ans - 0.0000000001)
if cnt > K: #ダメだったら
start = ans
break
else: #オッケーだったら
end = ans
continue
cnt = 0
for i in range(N):
cnt += math.floor((A[i] / ans) - 0.000000000001)
if cnt > K: # ダメだったら
print(ans + 1)
else: # オッケーだったら
print(ans)
| 1 | 6,584,647,736,140 | null | 99 | 99 |
a, b, m = map(int, input().split())
a_s = list(map(int, input().split()))
b_s = list(map(int, input().split()))
m_s =[]
for _ in range(m):
m_s.append(list(map(int, input().split())))
mini = min(a_s) + min(b_s)
for am, bm, sale in m_s:
mini = min(mini, a_s[am-1]+b_s[bm-1]-sale)
print(mini) | A,B,M=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
List=[list(map(int,input().split())) for i in range(M)]
minn=min(a)+min(b)
for i in range(M):
minn=min(minn,a[List[i][0]-1]+b[List[i][1]-1]-List[i][2])
print(minn) | 1 | 53,940,939,240,892 | null | 200 | 200 |
N = int(input())
X = list(input())
X = [int(x) for x in X]
popcnt = 0
for i in range(N):
if X[i]:
popcnt += 1
Ys = [0,0]
for i in range(N):
if X[i]:
Ys[0] += pow(2,N-1-i,popcnt+1)
Ys[0] %= popcnt+1
if popcnt > 1:
for i in range(N):
if X[i]:
Ys[1] += pow(2,N-1-i,popcnt-1)
Ys[1] %= popcnt-1
for i in range(N):
if X[i]:#1->0
mod = popcnt-1
if mod == 0:
print(0)
continue
Y = Ys[1] - pow(2,N-1-i,mod)
else:#0->1
mod = popcnt+1
Y = Ys[0] + pow(2,N-1-i,mod)
Y %= mod
ans = 1
if Y == 0:
print(ans)
continue
while Y > 0:
L = Y.bit_length()
mod = 0
for j in range(L):
if Y>>j&1:
mod += 1
Y %= mod
ans += 1
print(ans) | import sys
import fractions
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
dp = [[0 for _ in range(W)] for _ in range(H)]
masu = [sr() for _ in range(H)]
dp[0][0] = 1 if masu[0][0] == "#" else 0
for h, m in enumerate(masu):
for w, s in enumerate(m):
if w == 0 and h == 0:
continue
if w == 0:
if masu[h-1][w] != s and s == "#":
dp[h][w] += dp[h-1][w] + 1
else:
dp[h][w] += dp[h-1][w]
continue
if h == 0:
if masu[h][w-1] != s and s == "#":
dp[h][w] += dp[h][w-1] + 1
else:
dp[h][w] += dp[h][w-1]
continue
if masu[h-1][w] != s and s == "#":
cand1 = dp[h][w] + dp[h-1][w] + 1
else:
cand1 = dp[h][w] + dp[h-1][w]
if masu[h][w-1] != s and s == "#":
cand2 = dp[h][w] + dp[h][w-1] + 1
else:
cand2 = dp[h][w] + dp[h][w-1]
dp[h][w] = min(cand1, cand2)
print(dp[H-1][W-1])
| 0 | null | 28,671,155,884,428 | 107 | 194 |
nm = input().split()
n, m = map(int, nm)
A = [[int(i) for i in input().split()] for j in range(n)]
b = [int(input()) for i in range(m)]
for row in A:
s = 0
for i, elm in enumerate(row):
s += (elm*b[i])
print(s) | n,m = map(int, raw_input().split())
a = []
b = [0]*m
for i in xrange(n):
x = map(int,raw_input().split(" "))
a.append(x)
for i in xrange(m):
b[i] = input()
result = [0]*n
for i in xrange(n):
for j in xrange(m):
result[i] += a[i][j]*b[j]
print result[i] | 1 | 1,170,512,739,320 | null | 56 | 56 |
N = int(input())
u = []
v = []
for _ in range(N):
x,y = map(int,input().split())
u.append(x+y)
v.append(x-y)
umax = max(u)
umin = min(u)
vmax = max(v)
vmin = min(v)
print(max(umax-umin,vmax-vmin))
| a,b=[],[]
for _ in range(int(input())):
x,y=map(int,input().split())
a+=[x-y]
b+=[x+y]
print(max(max(a)-min(a),max(b)-min(b))) | 1 | 3,400,753,656,252 | null | 80 | 80 |
from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, n+1):
if str(i)[-1] == '0':
continue
d[int(str(i)[0] + str(i)[-1])] += 1
ans = 0
for i in range(11, 100):
ans += d[i] * d[int(str(i)[1] + str(i)[0])]
print(ans) | from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)
def main():
n = int(input())
ans = 0
for i in range(1, n + 1):
s = str(i)
if s[-1] == '0':
continue
if s[0] == s[-1]:
ans += 1
if i < 10:
continue
if s[0] == s[-1]:
ans += 2
l = len(s)
for i in range(2, l):
ans += 10 ** (i - 2) * 2
if s[0] < s[-1]:
continue
if s[0] > s[-1]:
ans += 10 ** (l - 2) * 2
elif l > 2:
dp = int(s[1])
for i in range(2, l - 1):
dp *= 10
dp += int(s[i])
ans += dp * 2
print(ans)
main() | 1 | 86,562,105,669,280 | null | 234 | 234 |
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()
for i in range(min(n,k)):
h.pop()
print(sum(h)) | n,k=map(int,input().split())
h=list(map(int,input().split()))
h=sorted(h)
ans=0
for i in range(len(h)-k):
ans+=h[i]
print(ans) | 1 | 79,485,179,592,028 | null | 227 | 227 |
tmp = input().split(" ")
N = int(tmp[0])
M = int(tmp[1])
ary = list(map(lambda n: int(n), input().split(" ")))
n = sum(ary)
print(-1) if N < n else print(N - n) | # -*- coding: utf-8 -*-
import math
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(M):
N -= A[i]
if N >= 0:
print(N)
else:
print(-1) | 1 | 32,013,879,074,420 | null | 168 | 168 |
dp = [0 for i in range(1000000)]
N = int(input())
for i in range(2,1000):
if i**2>N:
break
if dp[i]!=0:
continue
for j in range(i,1000000,i):
dp[j] = 1
while dp[N]!=0:
N += 1
print(N) | a = list(map(int, input().split()))
sum_a = sum(a)
if sum_a >= 22:
print('bust')
else:
print('win') | 0 | null | 111,810,849,269,830 | 250 | 260 |
W = raw_input().lower()
s = []
ans = 0
while True:
T = map(str, raw_input().split())
if(T[0] == "END_OF_TEXT"):
break
else:
for i in range(len(T)):
if(W == T[i].lower()):
ans += 1
print(ans) | if __name__ == '__main__':
# ??????????????\???
word = input()
texts = []
while True:
raw_input = input()
if raw_input == 'END_OF_TEXT':
break
texts.append(raw_input.lower())
# ?????????????¨??????°???????????????
match_count = 0
for line in texts:
for w in line.split(' '):
if w == word.lower():
match_count += 1
# ???????????????
print(match_count) | 1 | 1,820,724,350,172 | null | 65 | 65 |
A,B = map(int,input().split())
def gcd(a, b):
if b==0:
return a
return gcd(b, a%b)
print(A*B//gcd(A,B)) | import math
a,b = map(int,input().split())
c = a*b//math.gcd(a,b)
print(c) | 1 | 113,303,727,092,006 | null | 256 | 256 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.