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
|
|---|---|---|---|---|---|---|
n,m = map(int, input().split())
x = (n*(n-1))//2
y = (m*(m-1))//2
print(x+y)
|
def divide(a, b):
if a < b:
return divide(b, a)
if b == 0:
return a
return divide(b, a%b)
nums=list(map(int,input().split()))
ans = divide(nums[0], nums[1])
print(ans)
| 0 | null | 22,661,381,855,938 | 189 | 11 |
n,k,c = map(int,input().split())
s = list(input())
L = []
R = []
i = -1
j = n
for ki in range(k):
while i < n:
i += 1
if s[i] == 'o':
L += [i]
i += c
break
for ki in range(k):
while 0 <= j:
j -= 1
if s[j] == 'o':
R += [j]
j -= c
break
for i in range(k):
if L[i] == R[-i-1] :
print(L[i]+1)
|
n = int(input())
lst = list(map(int,input().split()))
lst = sorted(lst)
ans = 1
for i in range (n):
ans = ans*lst[i]
if (ans > 10**18):
ans = -1
break
print(ans)
| 0 | null | 28,446,362,497,518 | 182 | 134 |
n = int(input())
x = list(map(int, input().split()))
ans = 10**6
for i in range(1, 101):
str = 0
for j in x:
str += (j-i)**2
ans = min(ans, str)
print(ans)
|
import math
from functools import reduce
from collections import deque, defaultdict
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
n,p = get_nums_l()
s = input()
X = list(map(int, list(s)))
n = len(s)
if p in (2,5):
ans = 0
for i,x in enumerate(X):
if x%p == 0:
ans += i+1
print(ans)
else:
ruiseki = [0] * (n+1)
for i in (range(n-1, -1, -1)):
ruiseki[i] = (X[i] * pow(10, (n-i-1), p) + ruiseki[i+1]) % p
# log(ruiseki)
ans = 0
count = defaultdict(int)
for x in ruiseki:
# log(count[x])
ans += count[x]
count[x] += 1
# log(count)
print(ans)
| 0 | null | 61,842,289,533,658 | 213 | 205 |
from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
v = gcd(i,j)
for m in range(1,k+1):
ans += gcd(v,m)
print(ans)
|
import math
K = int(input())
Sum = 0
for A in range(1,K+1):
for B in range(1,K+1):
for C in range(1,K+1):
Sum = Sum+math.gcd(math.gcd(A,B),C)
print(Sum)
| 1 | 35,622,600,200,060 | null | 174 | 174 |
st = input()
code = ord(st)
next_code = code + 1
print(chr(next_code))
|
alpha = "abcdefghijklmnopqrstuvwxyz"
s = input()
for i in range(len(alpha)):
if alpha[i] == s:
print(alpha[i+1])
exit()
| 1 | 91,780,806,544,128 | null | 239 | 239 |
import sys
x=int(input())
for a in range(-1000,1000):
for b in range(-1000,1000):
if a**5-b**5==x:
print(a,b)
sys.exit()
|
#!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
X = int(input())
for a in range(-150, 151):
for b in range(-150, 151):
if a ** 5 - b ** 5 == X:
print(a, b, sep=' ')
return
if __name__ == '__main__':
main()
| 1 | 25,671,844,659,116 | null | 156 | 156 |
n=list(map(int,input().split()))
p=['2354','3146','2651','1562','1364','2453']
for _ in range(int(input())):
t,m=map(int,input().split())
t=n.index(t)
m=str(n.index(m)+1)
print(n[int(p[t][(p[t].index(m)+1)%4])-1])
|
i = 1
while True :
x = input()
if (x == 0) :
exit()
print "Case %d: %d" % (i, x)
i += 1
| 0 | null | 369,983,791,500 | 34 | 42 |
mod=pow(10,9)+7
n,k=map(int,input().split())
a=[0 for i in range(100000+1)]
ans=0
for i in range(k,0,-1):
a[i]=k//i
a[i]=pow(a[i],n,mod)
j=2*i
while j<=k:
a[i]=(a[i]-a[j]+mod)%mod
j += i
ans=(ans+a[i]*i)%mod
print(ans)
|
mod=10**9+7
n,k=map(int,input().split())
l=[0]*(k+1)
for i in range(k):
num=(k-i)
if k//num==1:
l[num]=1
else:
ret=pow(k//num,n,mod)
for j in range(2,k//num+1):
ret-=l[num*j]
ret%=mod
l[num]=(ret)%mod
ans=0
for i in range(k+1):
ans+=(l[i]*i)%mod
print(ans%mod)
| 1 | 36,772,873,942,168 | null | 176 | 176 |
def main():
MOD = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
ans = 1
d = [0] * (max(A) + 1)
for a in A:
if a == 0:
ans *= 3 - d[a]
ans %= MOD
d[a] += 1
else:
ans *= d[a-1] - d[a]
d[a] += 1
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
n = I()
a = LI()
r = 1
c = collections.defaultdict(int)
c[0] = 3
for b in a:
r *= c[b]
r %= mod
c[b] -= 1
c[b+1] += 1
return r
print(main())
| 1 | 129,934,490,853,332 | null | 268 | 268 |
S = int(input())
mod = 10**9 + 7
MN = 3
N = S//3 + S % 3
dp = [0] * (S+1)
dp[0] = 1
for i in range(1, S+1):
for j in range(0, (i-3)+1):
dp[i] += dp[j]
dp[i] %= mod
print(dp[S])
|
s = int(input())
mod = 10**9 + 7
f = [0]*2001
g = [0]*2001
f[3]=1
f[4]=1
g[3]=1
g[4]=2
for i in range(4,s+1):
f[i]=1 + g[i-3]
f[i]%=mod
g[i]=f[i] + g[i-1]
g[i]%=mod
print(f[s])
| 1 | 3,291,171,016,300 | null | 79 | 79 |
s = input()
n = int(input())
for _ in range(n):
O = list(map(str, input().split()))
i = int(O[1])
j = int(O[2])
if O[0] == 'print':
print(s[i:j + 1])
elif O[0] == 'reverse':
ss = s[i:j + 1]
s = s[:i] + ss[::-1] + s[j + 1:]
else:
p = O[3]
s = s[:i] + p + s[j + 1:]
|
N,K,S = map(int,input().split())
ANS = [S] * K
if S != 10 ** 9:
ANS += [S+1] * (N-K)
else:
ANS += [S-1] * (N-K)
print(" ".join(map(str,ANS)))
| 0 | null | 46,490,845,816,482 | 68 | 238 |
#import time
from itertools import dropwhile, takewhile
def main():
N, M = list(map(int, input().split()))
lis = [list(map(int, input().split())) for _ in range(M)]
#print(lis)
edge = [[] for _ in range(N+1)]
#print(edge)
for a,b in lis:
edge[a].append(b)
edge[b].append(a)
#print(edge)
ans = [0] * (N+1)
visited = {0}
stack = [1]
for i in stack:
for j in edge[i]:
if j in visited:
continue
stack.append(j)
#print(stack)
visited.add(j)
#print(visited)
ans[j]=i
print("Yes")
for k in ans[2:]:
print(k)
if __name__ == '__main__':
#start = time.time()
main()
#elapsed_time = time.time() - start
#print("経過時間:{}".format(elapsed_time * 1000) + "[msec]")
|
n = int(input())
s = input()
ans = 0
for i in range(1000):
i = str(i).zfill(3)
a = s.find(i[0])
if a != -1:
b = s.find(i[1], a + 1)
if b != -1:
c = s.find(i[2], b + 1)
if c != -1:
ans += 1
print(ans)
| 0 | null | 74,220,288,102,092 | 145 | 267 |
def main():
x, y = input().split()
answer = 0
prize = {"1": 300000, "2": 200000, "3": 100000}
if x in prize:
answer += prize[x]
if y in prize:
answer += prize[y]
if x == y == "1":
answer += 400000
print(answer)
if __name__ == '__main__':
main()
|
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x, y = list(map(int,ipti().split()))
prize = [300000, 200000, 100000, 0]
if x == y == 1:
print(1000000)
else:
x = 4 if x > 3 else x
y = 4 if y > 3 else y
print(prize[x-1]+prize[y-1])
if __name__ == '__main__':
main()
| 1 | 140,895,116,232,562 | null | 275 | 275 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N, M = map(int, readline().split())
AC = [False] * N
cnt = [0] * N
for _ in range(M):
p, s = input().split()
p = int(p)
p -= 1
if s == "AC":
AC[p] = True
else:
if not AC[p]:
cnt[p] += 1
ans_a = 0
ans_p = 0
for i in range(N):
if AC[i]:
ans_a += 1
ans_p += cnt[i]
print(ans_a, ans_p)
if __name__ == '__main__':
main()
|
n=int(input())
cs = [ (s,k) for s in ['S','H','C','D'] for k in range(1,14) ]
for _ in range(n):
s,k=input().split()
cs.remove((s,int(k)))
for (s, k) in cs:
print(s, k)
| 0 | null | 47,027,383,843,012 | 240 | 54 |
import math
k = int(input())
ans = 0
for h in range(1, k+1):
for i in range(1, k+1):
g = math.gcd(h, i)
for j in range(1, k+1):
ans += math.gcd(g, j)
print(ans)
|
# -*-coding:utf-8
#import fileinput
import math
def main():
n = int(input())
for i in range(1, n+1):
x = i
if (x%3 == 0):
print(' %d' % i, end='')
else:
while(x):
if (x%10 == 3):
print(' %d' % i, end='')
break
else:
x = int(x/10)
print('')
if __name__ == '__main__':
main()
| 0 | null | 18,333,352,581,532 | 174 | 52 |
import math
N = int(input())
n = int(math.sqrt(N))
ans = 0
l = []
for i in range(1,2*n):
if int(N/i) == N/i:
l.append(i+N/i-2)
print(int(min(l)))
|
# 入力
N = int(input())
A = list(map(int, input().split()))
R = max(A)
prime_factor_counter = [0]*(R+1)
# D[x]にxを割り切れる最初の素数を格納
# 次に行う素因数分解で試し割りのムダを削減するための前準備
D = [0]*(R+1)
for i in range(2, R+1):
if D[i]:
continue
n = i
while n < R+1:
if D[n] == 0:
D[n] = i
n += i
# 素因数分解し、素因子をカウント
# ex: 12 => 2と3のカウントを+1する
for a in A:
tmp = a
while tmp > 1:
prime_factor = D[tmp]
prime_factor_counter[prime_factor] += 1
while tmp%prime_factor == 0:
tmp //= prime_factor
# 回答出力
if max(prime_factor_counter) < 2:
print('pairwise coprime')
elif max(prime_factor_counter) - A.count(1) < N:
print('setwise coprime')
else:
print('not coprime')
| 0 | null | 82,462,676,563,360 | 288 | 85 |
D, T, S = map(float, input().split())
if D / S <= T:
print("Yes")
else:
print("No")
|
n,m,l=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
b=[list(map(int,input().split())) for _ in range(m)]
[print(*x)for x in[[sum(s*t for s,t in zip(c,l))for l in zip(*b)]for c in a]]
| 0 | null | 2,538,852,142,920 | 81 | 60 |
processedIp = input().split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
print("Yes")
else:
print("No")
|
# https://atcoder.jp/contests/abc153/tasks/abc153_f
# 座標圧縮、貪欲法、imos法
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
# まず、何回攻撃すればいいのかを計算する。これがとにかく必要だ(なくてもいいけど)。
#
# 素直な戦略として、左から倒せるギリギリの爆弾を投下して倒すのが最適
# だけどナイーブに実装すると、O(N^2)。だから体力を管理するのが重要。
# どこにどれだけダメージが蓄積したのかはimos法(デルタ関数をおいてから累積和)で管理できる。
from bisect import bisect_left
N, D, A = read_ints()
XH = read_tuple(N)
XH.sort() # 座標でソート
n_atk = [] # 何回攻撃するのが必要か
X = [] # 座標アクセス用配列
for x, h in XH:
n_atk.append((h - 1) // A + 1)
X.append(x)
damege = [0] * (N + 10) # ダメージ管理用、配列外アクセスがめんどくさいので長めに取る
ans = 0
# j = 0 # 次のxが、今のx+2d以下でもっとも大きなidx
for i, (x, n) in enumerate(zip(X, n_atk)):
damege[i] += damege[i - 1] # 積分して、現時点の蓄積回数を表示
atk = max(0, n - damege[i]) # iには何回攻撃したか
ans += atk
# 攻撃下回数を記録
damege[i] += atk
# 効果が切れる点を予約 # 尺取ならO(1)で次に行けるけど二分探索でも間に合うか
damege[bisect_left(X, x + 2 * D + 1, lo=i)] -= atk # 効果切れを予約
print(ans)
| 0 | null | 90,118,780,845,422 | 244 | 230 |
import sys
def main():
input = sys.stdin.readline
N,P = map(int, input().split())
S = input().rstrip()
D = list(map(int, S))
ans = 0
if P == 2:
for i, d in enumerate(D):
if d&1 == 0: ans += i + 1
return ans
if P == 5:
for i, d in enumerate(D):
if d == 0 or d == 5: ans += i + 1
return ans
A = [0] * P
num = Mint(0, P)
for i in range(N):
num += Mint(D[-1-i], P) * pow(10, i, P)
A[num.value] += 1
for a in A:
ans += a * (a-1) // 2
ans += A[0]
return ans
class Mint:
def __init__(self, value=0, mod=10**9+7):
self.value = ((value % mod) + mod) % mod
self.mod = mod
@staticmethod
def get_value(x): return x.value if isinstance(x, Mint) else x
def inverse(self):
a, b = self.value, self.mod
u, v = 1, 0
while b:
t = a // b
b, a = a - t * b, b
v, u = u - t * v, v
return (u + self.mod) % self.mod
def __repr__(self): return str(self.value)
def __eq__(self, other): return self.value == other.value
def __neg__(self): return Mint(-self.value, self.mod)
def __hash__(self): return hash(self.value)
def __bool__(self): return self.value != 0
def __iadd__(self, other):
self.value = (self.value + Mint.get_value(other)) % self.mod
return self
def __add__(self, other):
new_obj = Mint(self.value, self.mod)
new_obj += other
return new_obj
__radd__ = __add__
def __isub__(self, other):
self.value = (self.value - Mint.get_value(other) + self.mod) % self.mod
return self
def __sub__(self, other):
new_obj = Mint(self.value, self.mod)
new_obj -= other
return new_obj
def __rsub__(self, other):
new_obj = Mint(Mint.get_value(other), self.mod)
new_obj -= self
return new_obj
def __imul__(self, other):
self.value = self.value * Mint.get_value(other) % self.mod
return self
def __mul__(self, other):
new_obj = Mint(self.value, self.mod)
new_obj *= other
return new_obj
__rmul__ = __mul__
def __ifloordiv__(self, other):
other = other if isinstance(other, Mint) else Mint(other, self.mod)
self *= other.inverse
return self
def __floordiv__(self, other):
new_obj = Mint(self.value, self.mod)
new_obj //= other
return new_obj
def __rfloordiv__(self, other):
new_obj = Mint(Mint.get_value(other), self.mod)
new_obj //= self
return new_obj
if __name__ == '__main__':
ans = main()
print(ans)
|
N,K = map(int,input().split())
fruit = [int(i) for i in input().split()]
fruit.sort()
price = 0
for i in range(N) :
if i>K-1 :
break
price += fruit[i]
print(price)
| 0 | null | 34,975,134,647,082 | 205 | 120 |
n,m=map(int, input().split())
a_list=[int(i) for i in input().split()]
a_list.sort(reverse=True)
#print(a_list)
standard=sum(a_list)/(4*m)
#print(a_list[m-1])
#print(standard)
if a_list[m-1]<standard:
print("No")
else:
print("Yes")
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort(reverse=True)
total=0
for i in range(m):
if a[i]>=(sum(a)/(4*m)):
total+=1
if total==m:
print("Yes")
else:
print("No")
| 1 | 38,674,747,796,388 | null | 179 | 179 |
N, D = [int(v) for v in input().split()]
D = D*D
ans = 0
for _ in range(N):
x, y = [int(v) for v in input().split()]
if (x**2 + y**2) <= D:
ans += 1
print(ans)
|
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)
| 1 | 5,949,834,464,268 | null | 96 | 96 |
while 1:
H, W = map(int, raw_input().split())
if H == W == 0:
break
for i in range(H):
if i % 2 == 0:
if W % 2 == 0:
print "#." * (W/2)
else:
print "#." * (W/2) + "#"
else:
if W % 2 == 0:
print ".#" * (W/2)
else:
print ".#" * (W/2) + "."
print ""
|
import sys
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=998244353):
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
n,m,k = map(int,input().split())
mod = 998244353
ans = 0
comb = Combination(2*10**5)
for i in range(k+1):
ans += m * comb(n-1, i) * pow(m-1, n-i-1, mod)
ans %= mod
print(ans)
| 0 | null | 11,983,939,188,872 | 51 | 151 |
# 高橋君の夏休みが N 日間
# 夏休みの宿題が M個出されており、i 番目の宿題をやるには A i日間かかる
# 条件 複数の宿題を同じ日にはできない。
# また宿題をやる日は遊べない。
# 夏休み中に全ての宿題を終わらせるとき、最大何日遊ぶことができるか。
# 終わらない時は-1
N, M = map(int, input().split())
A = list(map(int, input().split()))
# 宿題にかかる合計日数
play_day = N - sum(A)
if play_day < 0:
print("-1")
else:
print(play_day)
|
n, m = map(int, input().split())
A = list(map(int, input().split()))
s = 0
for i in range(m):
s += A[i]
if s > n:
print(-1)
elif s <= n:
print(n - s)
| 1 | 31,903,255,193,148 | null | 168 | 168 |
N = int(input())
answer = 'No'
for i in range(1, 10):
if N % i == 0:
sho = N // i
if sho < 10:
answer = 'Yes'
break
print(answer)
|
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
A, B, N = map(int, input().split())
if N >= B-1:
print(A*(B-1)//B)
else:
print(A*N//B)
| 0 | null | 94,129,671,788,572 | 287 | 161 |
import math
def canMakeTriangle(a, b, c):
return abs(b - c) < a
N = int(input())
L = list(map(int, input().split()))
L.sort()
res = 0
for i in range(1, N):
for j in range(i + 1, N):
a = 0
b = i
c = 0
while b - a >= 1:
c = (a + b) / 2
if canMakeTriangle(L[math.floor(c)], L[i], L[j]):
b = c
else:
a = c
c = math.floor(c)
if canMakeTriangle(L[c], L[i], L[j]):
res += i - c
else:
res += i - c - 1
print(res)
|
def findnumberofTriangles(arr):
n = len(arr)
arr.sort()
count = 0
for i in range(0, n-2):
k = i + 2
for j in range(i + 1, n):
while (k < n and arr[i] + arr[j] > arr[k]):
k += 1
if(k>j):
count += k - j - 1
return count
n = int(input())
arr=[int(x) for x in input().split()]
print(findnumberofTriangles(arr))
| 1 | 172,385,539,333,330 | null | 294 | 294 |
#!/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]}")
|
n = int(input())
s = [input() for i in range(n)]
ac = s.count('AC')
wa = s.count('WA')
tle = s.count('TLE')
re = s.count('RE')
print('AC x ', ac)
print('WA x ', wa)
print('TLE x ', tle)
print('RE x ', re)
| 1 | 8,659,271,463,190 | null | 109 | 109 |
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
def resolve():
N,=pin()
A=lispin()
temp=0
sumA=[0]*N
sumA[0]=A[0]
for j in range(1,N):
sumA[j]=sumA[j-1]+A[j]
#print(sumA)
ans=2**32-1
t=sumA[-1]
for i in range(N):
ans=min(ans,abs(t-sumA[i]*2))
print(ans)
#%%submit!
resolve()
|
ring = input()*2
words = input()
if words in ring:
print("Yes")
else:
print("No")
| 0 | null | 72,103,406,584,990 | 276 | 64 |
l = input().split()
print(l[2], l[0], l[1])
|
from collections import defaultdict
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
ruiseki = [0]
d = defaultdict(int)
d[0]=1
for i in range(n):
if i - k + 1>= 0:
d[ruiseki[i - k+1]]-=1
ruiseki.append((ruiseki[i] + a[i] - 1)%k)
ans += d[ruiseki[i+1]]
d[ruiseki[i + 1]] += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 87,359,357,016,680 | 178 | 273 |
a=int(input())
p=a+a**2+a**3
print(p)
|
N = int(input())
S = input()
ans = ''
Z_s = 'Z'
for i in range(len(S)):
ord_s = ord(S[i]) + N
if ord_s > ord(Z_s):
ord_s -= ord('Z') - ord('A') + 1
ans += chr(ord_s)
print(ans)
| 0 | null | 72,180,282,296,804 | 115 | 271 |
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n,m,k=sep()
a=lis()
b=lis()
from bisect import bisect_right
a_c=[a[0]]
b_c=[b[0]]
for i in range(1,n):
a_c.append(a_c[-1]+ a[i])
for i in range(1,m):
b_c.append(b_c[-1] + b[i])
m=-1
m=max(m,bisect_right(b_c,k))
for i in range(n):
if a_c[i]<=k:
t=k-a_c[i]
t2=bisect_right(b_c,t)
m=max(i+1+t2,m)
else:
break
print(max(0,m))
|
import numpy as np
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# cumsum
i = 0
A_sum = [0]
while (i < len(A)) and (A_sum[i] + A[i] <= K):
A_sum.append(A_sum[i] + A[i])
i += 1
i = 0
B_sum = [0]
while (i < len(B)) and (B_sum[i] + B[i] <= K):
B_sum.append(B_sum[i] + B[i])
i += 1
# count
max_book = 0
ind = len(B_sum) - 1
for i in range(len(A_sum)):
while (A_sum[i] + B_sum[ind] > K) and (ind > 0):
ind -= 1
if i + ind > max_book:
max_book = i + ind
print(max_book)
| 1 | 10,731,617,785,742 | null | 117 | 117 |
n, m = list(map(int, input().split()))
A = []
V = []
B = []
for i in range(n):
A.append(list(map(int, input().split())))
for j in range(m):
V.append([int(input())])
for i in range(n):
B.append([0])
for j in range(m):
B[i][0] += A[i][j] * V[j][0]
for i in range(n):
print(B[i][0])
|
import sys
def main():
lines = sys.stdin.readlines()
A = []
B = []
C = []
n = 0
m = 0
for i, line in enumerate(lines):
# print(line)
# rm '\n' from string of a line
line = line.strip('\n')
elems = line.split(" ")
if i == 0:
n = int(elems[0])
m = int(elems[1])
elif 0 < i and i < n + 1:
A.append([int(e) for e in elems])
elif n < i:
B.append([int(elems[0])])
c = []
for i in range(0, n):
num = 0
for index, e in enumerate(A[i]):
num += e * B[index][0]
c.append(num)
for i in range(0, n):
print c[i]
if __name__ == "__main__":
main()
| 1 | 1,168,053,132,758 | null | 56 | 56 |
W,H,x,y,r = map(int, raw_input().split(' '))
print "Yes" if r <= x <= W-r and r <= y <= H-r else "No"
|
X,Y,a,b,c = map(int,input().split())
if X < a + c or 0 > a - c:
print("No")
elif Y < b + c or 0 > b - c:
print("No")
else :
print("Yes")
| 1 | 453,794,448,270 | null | 41 | 41 |
def main():
N, S = map(int, input().split())
A = list(map(int, input().split()))
return solve(N, S, A)
def solve(N, S, A):
mod = 998244353
dp = [0] * (S + 1)
dp[0] = pow(2, N, mod)
div2 = pow(2, mod - 2, mod)
m = 0
for a in A:
m += a
for i in reversed(range(a, min(S, m) + 1)):
dp[i] = (dp[i] + dp[i - a] * div2) % mod
return dp[S]
print(main())
|
a,b,c,d = map(int,input().split())
ans1 = a * c
ans2 = a * d
ans3 = b * c
ans4 = b * d
print(max(ans1,ans2,ans3,ans4))
| 0 | null | 10,275,588,747,776 | 138 | 77 |
a, b, n = map(int, input().split())
def calc(x):
return int(a * x / b) - a * int(x / b)
if n < b:
print(calc(n))
else:
print(calc(b-1))
|
N = str(input())
s = int(N[-1])
if s in [2, 4, 5, 7, 9]:
print('hon')
elif s in [0, 1, 6, 8]:
print('pon')
else:
print('bon')
| 0 | null | 23,614,213,771,500 | 161 | 142 |
t = input()
t = t.replace('?', 'D')
print(t)
|
num = input().split()
a = int(num[0])
b = int(num[1])
c = int(num[2])
ans = 0
for i in range(a,b+1):
if c % i == 0:
ans += 1
print(ans)
| 0 | null | 9,495,287,973,970 | 140 | 44 |
def rot(dice, I):
#USEWND
#NEWSUD
a = dice[:]
if I=='N': x=[0,4,5,1,0]
elif I=='E': x=[0,2,5,3,0]
elif I=='W': x=[0,3,5,2,0]
elif I=='S': x=[0,1,5,4,0]
for i in [0,1,2,3]: a[x[i+1]]=dice[x[i]]
return a
dice = map(int,raw_input().split())
for c in raw_input(): dice = rot(dice,c)
print dice[0]
|
n = int(input())
print(input().count("ABC"))
| 0 | null | 49,688,269,223,060 | 33 | 245 |
import math
A,B=map(int,input().split())
eight=[]
i=0
ten=[]
for a in range(1,1001):
if math.floor(a*0.08)==A:
eight.append(a)
if math.floor(a*0.1)==B:
ten.append(a)
for a in eight:
if a in ten:
print(a)
i=1
break
if i==0:
print("-1")
|
import math
A, B = map(int, input().split())
for i in range(1, 100000):
if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
print(i)
break
else:
print(-1)
| 1 | 56,617,209,332,772 | null | 203 | 203 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,r=map(int, input().split())
if n>=10:
print(r)
else:
print(r+100*(10-n))
resolve()
|
# AOJ ALDS1_4_C Dictionary
# Python3 2018.7.3 bal4u
dic = {}
n = int(input())
for i in range(n):
id, s = input().split()
if id == "insert": dic[s] = 1
else: print("yes" if s in dic else "no")
| 0 | null | 31,553,353,719,972 | 211 | 23 |
exp = input().split()
stk = []
for i in exp :
if i in ('+', '-', '*') :
num1 = stk.pop()
num2 = stk.pop()
if i == '+' :
stk.append(str(int(num1) + int(num2)))
elif i == '-' :
stk.append(str(int(num2) - int(num1)))
else :
stk.append(str(int(num2) * int(num1)))
else :
stk.append(i)
print(stk.pop())
|
x = int(input())
if x == 1:
print("0")
else:
print("1")
| 0 | null | 1,497,970,736,488 | 18 | 76 |
a, b, c = map(int, input().split())
l = [n for n in range (a,b+1) if c % n == 0]
print(len(l))
|
n = int(input())
a = list(map(int,input().split()))
b = [2 ** i for i in range(n)]
c = {}
for i in range(2 ** n):
k = 0
k += i
v = 0
for j in range(n)[::-1]:
v += k // b[j] * a[j]
k %= b[j]
c[v] = 0
m = int(input())
a = list(map(int,input().split()))
for i in range(m):
try:
c[a[i]]
print("yes")
except:
print("no")
| 0 | null | 334,584,331,400 | 44 | 25 |
def main():
K = int(input())
work = 7
answer = -1
for i in range(1, K+1):
i_mod = work % K
if i_mod == 0 :
answer = i
break
work = i_mod * 10 + 7
print(answer)
main()
|
mod = 10**9 + 7
def iip(listed = False):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def inv(n, mod):
return power(n, mod-2)
def conbination(n, r, mod, test=False):
if n <=0:
return 0
if r == 0:
return 1
if r < 0:
return 0
ret = 1
for i in range(n-r+1, n+1):
ret *= i
ret = ret % mod
bunbo = 1
for i in range(1, r+1):
bunbo *= i
bunbo = bunbo % mod
ret = (ret * inv(bunbo, mod)) % mod
#if test:
# print(f"{n}C{r} = {ret}")
return ret
def power(n, p):
if p == 0:
return 1
if p % 2 == 0:
return (power(n, p//2) ** 2) % mod
if p % 2 == 1:
return (n * power(n, p-1)) % mod
def soinsuu_bunkai(n):
ret = []
for i in range(2, int(n**0.5)+1):
while n % i == 0:
n //= i
ret.append(i)
if i > n:
break
if n != 1:
ret.append(n)
return ret
N, K = iip()
A = iip(listed=True)
A.sort(reverse=True)
def main():
plus = 0
minus = 0
a1Ck1 = conbination(N, K-1, mod) % mod
for i, Ai in enumerate(A):
if N-i < K:
break
a1Ck1 *= (N-K-i+1)
a1Ck1 *= inv(N-i, mod)
a1Ck1 %= mod
plus += a1Ck1 * Ai
A.sort(reverse=False)
a1Ck1 = conbination(N, K-1, mod) % mod
for i, Ai in enumerate(A):
if N-i < K:
break
a1Ck1 *= (N-K-i+1)
a1Ck1 *= inv(N-i, mod)
a1Ck1 %= mod
minus += a1Ck1 * Ai
ans = plus-minus
ans %= mod
print(ans)
main()
| 0 | null | 50,879,016,960,982 | 97 | 242 |
N,K=map(int,input().split())
mod=10**9+7
def cmb(n,r):
global mod
if r<0 or r>n:
return 0
return (g1[n]*g2[r]*g2[n-r])%mod
g1=[1,1]
g2=[1,1]
inv=[0,1]
for i in range(2,1000003):
g1.append((g1[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
g2.append((g2[-1]*inv[-1])%mod)
P=0
for i in range(min(N,K+1)):
P=(P+cmb(N,i)*cmb(N-1,i))%mod
print(P)
|
N,K=map(int,input().split())
x=998244353
dp=[0 for i in range(N)]
sdp=[0 for i in range(N)]
L=[]
R=[]
dp[0]=1
sdp[0]=1
for i in range(K):
l,r=map(int,input().split())
L.append(l)
R.append(r)
for i in range(1,N):
for j in range(K):
dp[i]+=(sdp[max(i-L[j],-1)]-sdp[max(i-R[j]-1,-1)])
dp[i]%=x
sdp[i]=(sdp[i-1]+dp[i])%x
print(dp[-1]%x)
| 0 | null | 35,041,273,167,440 | 215 | 74 |
from functools import lru_cache
N = int(input())
# A * B <= N - 1はいくつありますか？
count = 0
# A ∈ {1, 2, ..., N-1}
for A in range(1, N):
# B <= (N - 1) // A
count += (N - 1) // A
print(count)
|
n = int(input())
ans = 0
for i in range(1, n):
ans += n//i if n%i != 0 else n//i-1
print(ans)
| 1 | 2,583,020,640,420 | null | 73 | 73 |
inp = input()
out = int(inp) + int(inp)**2 + int(inp)**3
print(out)
|
import math
a = int(input())
print(a + a ** 2 + a ** 3)
| 1 | 10,237,412,373,440 | null | 115 | 115 |
import sys
N = int(input())
if not ( 1 <= N <= 100 ):sys.exit()
print(1-(int(N/2)/N))
|
# -*- coding: utf-8 -*-
# A
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N = int(input())
if N % 2 == 0:
print(0.5)
else:
a = N//2
b = N - a
print(b/N)
| 1 | 177,296,138,015,854 | null | 297 | 297 |
from collections import deque
N, M = map(int,input().split())
P = [list(map(int,input().split())) for i in range(M)]
A = [ [] for _ in range(N)]
#node_info = [{'node':d,'connect':[],'depth':-1,'dir':-1} for d in range(N)]
for path in P:
A[path[1]-1].append(path[0]-1)
A[path[0]-1].append(path[1]-1)
#print(A)
previous = [-1 for i in range(N)]
previous[0]=0
que = deque([0])
while len(que) != 0:
v = que.popleft()
for v_i in A[v]:
if previous[v_i] != -1:
continue
else:
que.append(v_i)
previous[v_i] = v
for i in range(N):
if previous[i] == -1:
print('No')
exit()
print('Yes')
for i in range(1,N):
print(previous[i]+1)
|
from collections import deque
n,m = map(int,input().split())
ab=[[] for _ in range(n+1)]
for _ in range(m):
a,b=map(int,input().split())
ab[a].append(b)
ab[b].append(a)
ans=[0]*(n+1)
ans[1]=1
que=deque()
que.append(1)
while que:
x=que.popleft()
for i in ab[x]:
if ans[i]==0:
ans[i]=x
que.append(i)
print("Yes")
for j in range(2,n+1):
print(ans[j])
| 1 | 20,662,069,996,132 | null | 145 | 145 |
N,M = map(int,input().split())
L = map(int,input().split())
work = 0
for i in L :
work += i
if N >= work :
print ( N - work )
else :
print ("-1")
|
n,m = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if n >= sum(a):
print(n - sum(a))
else:
print(-1)
| 1 | 31,930,138,219,480 | null | 168 | 168 |
x, y = map(int, input().split())
a = max(x, y)
b = min(x, y)
while a%b != 0:
temp = a
a = b
b = temp%b
print(b)
|
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
x, y = [int(n) for n in input().split()]
print(gcd(x, y))
| 1 | 7,941,412,192 | null | 11 | 11 |
r = float(input())
l = 2*r*3.14159265358979
are = r*r*3.14159265358979
print("{0:.8f} {1:.8f}".format(are, l))
|
import math
r = float(input())
pi =math.pi
print('%.10f %.10f'%(r*r*pi,2*r*pi))
| 1 | 656,168,399,898 | null | 46 | 46 |
n = input()
l = map(int,raw_input().split())
print min(l), max(l), sum(l)
|
def abc150c_count_order():
import bisect, itertools
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
pattern = list(itertools.permutations(range(1, n+1)))
p_idx = bisect.bisect(pattern, p)
q_idx = bisect.bisect(pattern, q)
print(abs(p_idx-q_idx))
abc150c_count_order()
| 0 | null | 50,644,850,830,602 | 48 | 246 |
N,K = map(int,input().split())
A = list(map(int,input().split()))
def check(m):
n = 0
for a in A:
if a%m == 0:
n += a//m - 1
else:
n += a//m
return n <= K
l = 0
r = 10**9+10
while r-l > 1:
m = (r+l) // 2
if check(m):
r = m
else:
l = m
print(r)
|
import math
M=list(map(int, input().split()))
N=M[0]
K=M[1]
A=list(map(int, input().split()))
def cancut(A,N,K,X): #A1..ANをK回で全てX以下に切れるか？Yesなら1、Noなら2を返す。
cut=0
for a in A:
n = (a + X - 1) // X # a/x の少数切上げ
cut += n - 1
if cut<=K:
return 1
else:
return 0
left=0
right=max(A)
while(abs(right - left) > 1):
mid=(right+left)//2
if cancut(A,N,K,mid)==1:
right=mid
else:
left=mid
print(right)
| 1 | 6,494,163,695,088 | null | 99 | 99 |
#16D8101012J 伊藤惇 dj Python3
def Greatest_Common_Divisor(x,y):
if y>x:
x,y=y,x
if x>=y and y>0:
return Greatest_Common_Divisor(y,x%y)
return x
if __name__ == "__main__":
x=list(map(int,input().split()))
print(Greatest_Common_Divisor(x[0],x[1]))
|
def main():
K,X = map(int, input().split())
if 500*K>=X:
print("Yes")
else:
print("No")
main()
| 0 | null | 49,280,981,389,068 | 11 | 244 |
x,k,d=map(int,input().split())
x=abs(x)
y=x//d
if k<=y:
print(x-k*d)
else:
if (k-y)%2==0:
print(x-y*d)
else:
print(abs(d-x+y*d))
|
A,B,K = map(int,input().split())
if A>=K:
answer = A-K,B
elif A+B>=K:
answer = 0,B-(K-A)
else:
answer = 0,0
print(answer[0],answer[1])
| 0 | null | 54,965,930,314,660 | 92 | 249 |
def resolve():
t = input()
print(t.replace('?','D'))
if __name__ == "__main__":
resolve()
|
X, K, D = (int(x) for x in input().split())
if X > 0:
div, mod = divmod(X, D)
if div >= K:
answer = X - K*D
else:
if (K - div)%2 == 0:
answer = X - div*D
else:
answer = abs(X - (div+1)*D)
elif X < 0:
div, mod = divmod(-X, D)
if div >= K:
answer = abs(X + K*D)
else:
if (K - div)%2 == 0:
answer = abs(X + div*D)
else:
answer = X + (div+1)*D
else:
if K%2 == 0:
answer = 0
else:
answer = D
print(answer)
| 0 | null | 11,721,903,373,432 | 140 | 92 |
from collections import deque
N = int(input())
c = [chr(ord("a") + i) for i in range(26)]
q = deque("a")
ans = []
while q:
s = q.pop()
if len(s) == N:
ans.append(s)
continue
for x in c[:c.index(max(s)) + 2]:
q.append(s + x)
[print(a) for a in sorted(ans)]
|
N, K = map(int, input().split())
minCandidate1 = N % K
minCandidate2 = K - minCandidate1
if minCandidate1 <= minCandidate2:
print(minCandidate1)
else:
print(minCandidate2)
| 0 | null | 45,736,392,275,862 | 198 | 180 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log,gcd #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
#mint
class ModInt:
def __init__(self, x):
self.x = x % mod
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x + other.x)
else:
return ModInt(self.x + other)
__radd__ = __add__
def __sub__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x - other.x)
else:
return ModInt(self.x - other)
def __rsub__(self, other):
if isinstance(other, ModInt):
return ModInt(other.x - self.x)
else:
return ModInt(other - self.x)
def __mul__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * other.x)
else:
return ModInt(self.x * other)
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * pow(other.x, mod-2,mod))
else:
return ModInt(self.x * pow(other, mod - 2, mod))
def __rtruediv(self, other):
if isinstance(other, self):
return ModInt(other * pow(self.x, mod - 2, mod))
else:
return ModInt(other.x * pow(self.x, mod - 2, mod))
def __pow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(self.x, other.x, mod))
else:
return ModInt(pow(self.x, other, mod))
def __rpow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(other.x, self.x, mod))
else:
return ModInt(pow(other, self.x, mod))
def main():
N=I()
A,B=[],[]
for i in range(N):
a,b = MI()
A.append(a)
B.append(b)
both_zero_cnt = 0
num_of_group = defaultdict(int) ##既約分数にしてあげて、(分子,分母)がkeyで、負なら分子が負になる他は正
for i in range(N):
a,b = A[i], B[i]
if(a==b==0):
both_zero_cnt+=1
continue
elif(a==0):
num_of_group[-inf,inf] += 1
num_of_group[inf,inf] += 0
elif(b==0):
num_of_group[inf,inf] += 1
else:
if(a*b<0):
a,b=abs(a),abs(b)
g = gcd(a,b)
a//=g
b//=g
num_of_group[(-b,a)] += 1
num_of_group[(b,a)] += 0
else:
a,b=abs(a),abs(b)
g = gcd(a,b)
a//=g
b//=g
num_of_group[(a,b)] += 1
# print(num_of_group.items())
if(both_zero_cnt==N):
print(N)
return
##solve
ans = ModInt(1)
# two_pow = [1]
# for i in range(N):
# two_pow.append((2*two_pow[-1])%mod)
# print(two_pow,"#######")
for (a,b),cnt1 in num_of_group.items():
if(a<0):
continue
tmp = ModInt(2)**cnt1
if (-a,b) in num_of_group:
cnt2 = num_of_group[-a,b]
tmp += ModInt(2)**cnt2
tmp-=1
if(tmp):
ans *= tmp
ans -= 1 ##全部選ばない
ans += both_zero_cnt
print(ans)
if __name__ == '__main__':
main()
|
import sys
from collections import namedtuple, defaultdict
from math import gcd
input = sys.stdin.readline
class Point:
def __init__(self, x, y):
g = gcd(abs(x), abs(y))
x //= g
y //= g
if x < 0:
x *= -1
y *= -1
elif x == 0 and y < 0:
y *= -1
self.x = x
self.y = y
def __eq__(self, other):
return self.x == other.x and self.y == other.y
def __hash__(self):
return hash((self.x, self.y))
def __repr__(self):
return f'({self.x}, {self.y})'
def main():
n = int(input())
p = []
d = defaultdict(lambda: 0)
zeros = 0
for _ in range(n):
x, y = map(int, input().split())
if x == 0 and y == 0:
n -= 1
zeros += 1
continue
p.append(Point(x, y))
d[p[-1]] += 1
MOD = 10 ** 9 + 7
pw = [ pow(2, i, MOD) for i in range(n + 1) ]
ans = 1
tot = 0
for x in d.keys():
if x.x > 0 and x.y >= 0 and Point(-x.y, x.x) in d:
s = d[x]
t = d[Point(-x.y, x.x)]
tot += s + t
value = (pw[s] + pw[t] - 1 + MOD) % MOD
ans = ans * value % MOD
ans = ans * pw[n - tot] % MOD
ans = (ans - 1 + MOD + zeros) % MOD
print(ans)
main()
| 1 | 21,065,985,862,390 | null | 146 | 146 |
S = list(input())
N = len(S)
K = int(input())
if len(set(S)) == 1:
print((N*K)//2)
exit()
ans = 0
i = 0
while i < N-1:
if S[i] == S[i+1]:
ans += 1
i += 1
i += 1
if S[0] != S[N-1]:
print(ans*K)
exit()
a = 1
while S[0] == S[a]:
a += 1
b = 1
while S[N-1] == S[N-1-b]:
b += 1
print(ans*K - (K-1)*(a//2 + b//2 - (a+b)//2))
|
S=input()
N=len(S)
K=int(input())
s="".join((S,S))
cnt1=0
cnt2=0
buf=0
piv=""
if len(set(S))!=1:
for i in range(N):
if S[i]==piv:
buf=buf+1
else:
piv=S[i]
cnt1=cnt1+(buf+1)//2
buf=0
cnt1=cnt1+(buf+1)//2
buf=0
piv=""
for i in range(2*N):
if s[i]==piv:
buf=buf+1
else:
piv=s[i]
cnt2=cnt2+(buf+1)//2
buf=0
#print(buf)
cnt2 = cnt2 + (buf + 1) // 2
x = cnt2 - cnt1
print(cnt1 + (K - 1) * x)
else:
print((len(S)*K)//2)
| 1 | 175,583,750,323,858 | null | 296 | 296 |
def main():
n, m = map(int, input().split())
matrix = [
list(map(int, input().split()))
for _ in range(n)
]
vector = [
int(input())
for _ in range(m)
]
for v in matrix:
res = sum(x * y for x, y in zip(v, vector))
print(res)
if __name__ == "__main__":
main()
|
n,m = map(int,input().split())
kakeru = [list(map(int,input().split())) for _ in range(n)]
kakerareru = [int(input()) for _ in range(m)]
for a in range(n):
kotae = 0
for b in range(m):
kotae += kakeru[a][b]*kakerareru[b]
print(kotae)
| 1 | 1,140,286,602,408 | null | 56 | 56 |
n=int(input())
a=list(map(int,input().split()))
col=[0,0,0]
res=1
for ai in a:
cnt=0
for i in range(3):
if col[i]==ai:
if cnt==0:
col[i]=col[i]+1
cnt+=1
res=(res*cnt)%1000000007
print(res)
|
from collections import defaultdict
p = 10 ** 9 + 7
n = int(input())
a = [int(x) for x in input().split()]
num = defaultdict(int)
num[-1] = 3
col = [None] * n
for i in range(n):
col[i] = num[a[i] - 1]
num[a[i]] += 1
num[a[i] - 1] -= 1
ans = 1
for i in range(n):
ans = ans * col[i] % p
print(ans)
| 1 | 129,992,653,339,406 | null | 268 | 268 |
#!/usr/bin/env python
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
print('NO')
exit()
if abs(b-a)/(v-w) > t:
print('NO')
exit()
print('YES')
|
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
a_t = t*v
b_t = t*w
if a_t >= b_t+abs(a-b):
print('YES')
else:
print('NO')
| 1 | 15,088,333,138,050 | null | 131 | 131 |
n,k=map(int, input().split())
w=[0]*n
for i in range(n):
w[i]=int(input())
def delivable(m):
loading=0
track_num=1
for i in range(n):
if w[i] > m:
return False
break
else:
loading += w[i]
if loading > m:
loading=w[i]
track_num += 1
if track_num <= k:
return True
else:
return False
r=1000000000
l=min(w)-1
while r-l > 1:
m=(r+l)//2
if delivable(m):
r=m
else:
l=m
print(r)
|
cases = []
n = 1
while n != 0:
n = int(raw_input())
if n == 0:
continue
cases.append(n)
for i in range(len(cases)):
print "Case %d: %d" %(i + 1, cases[i])
| 0 | null | 289,585,265,658 | 24 | 42 |
# N = int(input())
# A = map(int, input().split())
# cnt = 0
# for i, a in enumerate(A):
# if ((i + 1) * a) % 2:
# cnt += 1
# print(cnt)
N = int(input())
A = map(int, input().split())
print(sum(((i + 1) * a) % 2 for i, a in enumerate(A)))
|
_, *a = map(int, open(0).read().split())
print(sum(b%2 for b in a[::2]))
| 1 | 7,780,798,258,020 | null | 105 | 105 |
# -*- coding: utf-8 -*-
ABC = input()
ABC = ABC.replace(" ", "")
if ABC.count(ABC[0]) == 2 or ABC.count(ABC[1]) == 2 or ABC.count(ABC[2]) == 2:
print("Yes")
else:
print("No")
|
n = int(input())
title = []
length = []
for i in range(n):
a,b = map(str, input().split())
title.append(a)
length.append(int(b))
x = input()
ind = title.index(x)
print(sum(length[ind+1:]))
| 0 | null | 82,288,650,137,982 | 216 | 243 |
x = int(input())
cx = int(x/100)
dx = x%100
while cx>0:
cx-=1
if dx>5:
dx-=5
else:
print(1)
exit()
print(0)
|
n, p = map(int,input().split())
D = input()
out = 0
if 10 % p == 0:
for i in range(n):
if int(D[i]) % p == 0:
out += i + 1
else:
mod = 0
count = [0] * p
ten = 1
count[mod] += 1
for i in range(n):
mod = (mod + int(D[n-i-1]) * ten) % p
ten = ten * 10 % p
count[mod] += 1
for c in count:
out += (c * (c - 1)) // 2
print(out)
| 0 | null | 92,938,228,455,382 | 266 | 205 |
a = input()
iff3 = a[2]
iff4 = a[3]
iff5 = a[4]
iff6 = a[5]
if iff3 == iff4 :
if iff5 == iff6 :
print("Yes")
else :
print("No")
else :
print("No")
|
a2=list(input())
if a2[0]!=a2[1] and a2[2]==a2[3] and a2[4]==a2[5]:
print('Yes')
else:
print('No')
| 1 | 41,809,679,626,470 | null | 184 | 184 |
import math
data = input().split()
x1 = float(data[0])
x2 = float(data[2])
y1 = float(data[1])
y2 = float(data[3])
x3 = x1 - x2 if x1 > x2 else x2 - x1
y3 = y1 - y2 if y1 > y2 else y2 - y1
print("%.8f" % math.sqrt(x3 * x3 + y3 * y3))
|
# -*- coding: utf-8 -*-
import sys
import os
import math
x1, y1, x2, y2 = list(map(float, input().split()))
x_diff = x1 - x2
y_diff = y1 - y2
d = math.sqrt(x_diff ** 2 + y_diff ** 2)
print(d)
| 1 | 157,874,378,338 | null | 29 | 29 |
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
n = I()
S = input()
ans = 0
for i in range(1000):
nya = str(i).zfill(3)
x = S.find(nya[0])
y = S.find(nya[1], x+1)
z = S.find(nya[2], y+1)
if x != -1 and y != -1 and z != -1:
ans += 1
print(ans)
|
a = [int(input()) for i in range(10)]
a.sort()
for i in range(1, 4):
print(a[-i])
| 0 | null | 64,235,513,690,176 | 267 | 2 |
# ABC159C
# 縦，横，高さの合計が len である直方体のうち，体積が最大のものの体積はいくつか
def f(len):
print((len / 3) ** 3)
f(int(input()))
|
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9
def main():
l = int(input())
print((l/3)**3)
if __name__ == '__main__':
main()
| 1 | 47,073,098,448,992 | null | 191 | 191 |
n = int(input())
x = 0
for i in range(n):
d1, d2 = map(int, input().split())
if x != 3:
if d1 != d2:
x = 0
else:
x += 1
print("Yes" if x == 3 else "No")
|
t=input()
tla=list(t)
tlb=list(t)
pd1=0
pd2=0
for i in range(len(tla)):
if tla[i]=="?":
if i==0:
pass
elif i==len(tla)-1:
tla[i]="D"
elif tla[i-1]=="P":
tla[i]="D"
elif tla[i+1]=="D":
tla[i]="P"
elif tla[i+1]=="?":
tla[i]="P"
else:
tla[i]="D"
if tla[i]=="D":
if i==0:
pass
elif tla[i-1]=="P":
pd1+=1
d1=tla.count('D')
s1=d1+pd1
for i in range(len(tlb)):
if tlb[i]=="?":
tlb[i]="D"
if tlb[i]=="D":
if i==0:
pass
elif tlb[i-1]=="P":
pd2+=1
d2=tlb.count('D')
s2=d2+pd2
if s1>s2:
print(''.join(tla))
else:
print(''.join(tlb))
| 0 | null | 10,461,840,212,760 | 72 | 140 |
while 1:
h,w=map(int,input().split())
if h==0 and w==0: break
for y in range(h): print(('#.'*w)[y % 2:][:w])
print('')
|
x, n = map(int, input().split())
p = list(map(int, input().split()))
n = list(i for i in range(-1, 110) if i not in p)
diff = 110
ans = 0
for i in n:
if diff > abs(x-i):
diff = abs(x-i)
ans = i
print(ans)
| 0 | null | 7,450,967,363,680 | 51 | 128 |
import sys
for n in sys.stdin:
l=map(int,n.split())
b=l[0]*l[1]
u=[max(l),min(l)]
while u[1]!=0:
u=[u[1],u[0]%u[1]]
print "%d %d"%(u[0],b/u[0])
|
import math
while True:
try:
a,b=list(map(int,input().split()))
x=math.gcd(a,b)
y=int(a*b/x)
print("%d %d"%(x,y))
except:
break
| 1 | 656,788,748 | null | 5 | 5 |
time=1
n=int(input())
A=[[] for i in range(n)]
d=[0 for i in range(n)]
f=[0 for i in range(n)]
for i in range(n):
a=list(map(int,input().split()))
for j in range(a[1]):
A[i].append(a[2+j]-1)
def dfs(q,num):
global d,f,time
d[num]=time
for nx in q[num]:
if d[nx]==0:
time+=1
dfs(q,nx)
time+=1
f[num]=time
for i in range(n):
if d[i]==0:#unvisit
dfs(A,i)
time+=1
for i in range(n):
print(i+1,d[i],f[i])
|
n = int(input())
Adj = [[0]]
for _ in range(n):
Adj.append(list(map(int, input().split()))[2:])
visited = [False]*(n+1)
s = [0]*(n+1)
f = [0]*(n+1)
time = 0
def dfs(i):
global time
time += 1
s[i] = time
visited[i] = True
for j in Adj[i]:
if not visited[j]:
dfs(j)
time += 1
f[i] = time
while not all(visited[1:]):
i = visited[1:].index(False) + 1
dfs(i)
for i in range(1, n+1):
print(i,s[i], f[i])
| 1 | 2,878,058,690 | null | 8 | 8 |
number=list(map(int,input().split()))
count_l=number[0]
count_t=number[1]
luggage=[int(input()) for i in range(count_l)]
min_P=max(max(luggage),sum(luggage)//count_t)
max_P=sum(luggage)
left=min_P
right=max_P
while left<right:
mid=(left+right)//2
count_track=1
flag=1
load=0
for i in range(count_l):
load+=luggage[i]
if load>mid:
count_track+=1
load=luggage[i]
if count_track>count_t:
flag=0
break
if flag:
right=mid
else:
left=mid+1
print(left)
|
def canLoad(n, k, p):
global w
load = 0
for i in range(n):
load += w[i]
if load <= p:
continue
k -= 1
if k == 0:
return False
load = w[i]
return True
def solve(n, k, pmin, pmax):
if pmin + 1 >= pmax:
return pmax
newp = (pmax + pmin) // 2
if canLoad(n, k, newp):
return solve(n, k, pmin, newp)
else:
return solve(n, k, newp, pmax)
n, k = map(int, input().split())
w = [0]*n
wsum = 0
wmax = 0
for i in range(n):
w[i] = int(input())
wsum += w[i]
if w[i] > wmax:
wmax = w[i]
# p の最小の候補は wmax と ceil(wsum/k) の最大値
pmin = max(wmax, wsum // k if wsum % k == 0 else wsum // k + 1)
pmax = wsum
p = pmin
if not canLoad(n, k, pmin):
p = solve(n, k, pmin, pmax)
print(p)
| 1 | 84,182,705,424 | null | 24 | 24 |
K = int(input())
S = input()
ans = S
if len(S) > K:
ans = S[:K] + '...'
print(ans)
|
K = int(input())
S = input()
if len(S) > K:
ans = S[0: K-len(S)]
ans += "..."
else:
ans = S
print(ans)
| 1 | 19,544,489,903,898 | null | 143 | 143 |
# -*- using:utf-8 -*-
class main:
def function(x, k, d):
if x >= k * d:
ans = x - k * d
else:
r = x // d
n = k - r
if n % 2 == 0:
ans = x % d
else:
ans = abs(x % d - d)
return ans
if __name__ == "__main__":
x, k, d = map(int, input().split())
x = abs(x)
ans = main.function(x, k, d)
print(ans)
|
X, K, D = map(int,input().split())
X = abs(X)
if X > K*D:
print( X - K*D )
else:
a = X//D
K -= a
X -= D*a
if K%2 == 0:
print(X)
else:
print(abs(X-D))
| 1 | 5,161,925,611,810 | null | 92 | 92 |
X = int(input())
h = (X // 500) * 1000
X = X % 500
h += (X // 5) * 5
print(h)
|
n = int(input())
ans = 0
if n//500>0:
ans += 1000 * (n//500)
n = n - 500 * (n//500)
if n//5>0:
ans += 5 * (n//5)
print(ans)
| 1 | 42,726,937,263,560 | null | 185 | 185 |
from collections import deque
N,u,v=map(int,input().split())
u-=1;v-=1
G=[[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
a-=1;b-=1
G[a].append(b)
G[b].append(a)
if len(G[u])==1 and G[u][0]==v:
print(0)
exit()
distu=[-1 for i in range(N)]
q=deque([])
q.append(u)
while(len(q)>0):
r=q.pop()
for p in G[r]:
if distu[p]!=-1:
continue
distu[p]=distu[r]+1
q.append(p)
distv=[-1 for i in range(N)]
q=deque([])
q.append(v)
while(len(q)>0):
r=q.pop()
for p in G[r]:
if distv[p]!=-1:
continue
distv[p]=distv[r]+1
q.append(p)
dist=[distv[i] if distu[i]<=distv[i] else 0 for i in range(N)]
print(max(dist))
|
n = int(input())
s = input()
rs = [0]*n
gs = [0]*n
bs = [0]*n
for i in reversed(range(n)):
if s[i] == 'R':
rs[i] += 1
elif s[i] == 'G':
gs[i] += 1
else:
bs[i] += 1
for i in reversed(range(n-1)):
rs[i] += rs[i+1]
gs[i] += gs[i+1]
bs[i] += bs[i+1]
res = 0
for i in range(n):
for j in range(i+1,n-1):
if s[i] == s[j]:
continue
if s[i]!='B' and s[j]!='B':
res += bs[j+1]
if j-i+j < n:
if s[j-i+j] == 'B':
res -=1
elif s[i]!='G' and s[j]!='G':
res += gs[j+1]
if j - i + j < n:
if s[j-i+j] == 'G':
res -=1
else:
res += rs[j+1]
if j - i + j < n:
if s[j-i+j] == 'R':
res -= 1
print(res)
| 0 | null | 76,600,762,276,830 | 259 | 175 |
import sys
s = sys.stdin
cnt = 1
for i in s:
if int(i)== 0:
break
print("Case {0}: {1}".format(cnt,i),end="")
cnt += 1
|
MOD = 10 ** 9 + 7
def nCk(n, k):
if k > n or min(n, k) < 0:
raise Exception('Not correct input values!')
res = 1
for i in range(1, k + 1):
res = (res * (n - i + 1) * pow(i, MOD - 2, MOD)) % MOD
return res
n, a, b = map(int, input().split())
ret = (pow(2, n, MOD) - 1 - nCk(n, a) - nCk(n, b)) % MOD
print(ret)
| 0 | null | 33,244,828,198,950 | 42 | 214 |
n,m = map(int,input().split())
x = n*(n-1)//2
r = m*(m-1)//2
print(x+r)
|
N, M = map(int, input().split())
def factorial(n):
p = 1
for i in range(n, 0, -1):
p *= i
return p
def comb(n, k):
return factorial(n) // (factorial(k) * factorial(n-k))
res = comb(M, 2) + comb(N, 2)
print(res)
| 1 | 45,595,900,533,710 | null | 189 | 189 |
f=[1,1]
for _ in[0]*43:f+=[f[-2]+f[-1]]
print(f[int(input())])
|
print([1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170][int(input())])
| 1 | 1,626,929,020 | null | 7 | 7 |
N = int(input())
S = input()
if N % 2 != 0:
print('No')
else:
left = S[:N//2]
right = S[N//2:]
if left == right:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
t = s[:n//2]
if t * 2 == s:
print("Yes")
else:
print("No")
| 1 | 146,867,480,148,104 | null | 279 | 279 |
S = input()
Q = int(input())
reverse = 0
left = ""
right = ""
for _ in range(Q):
q = input().split()
if q[0]=="1":
reverse += 1
left, right = right, left
if q[0]=="2" and q[1]=="1":
if reverse%2==0: left = q[2]+left
else: left = left+q[2]
if q[0]=="2" and q[1]=="2":
if reverse%2==0: right = right+q[2]
else: right = q[2]+right
if reverse%2==1:
left = left[::-1]
right = right[::-1]
S = S[::-1]
print(left+S+right)
|
S = list(input())
N = int(input())
normalFlag = True
front = []
back = []
for _ in range(N):
q = list(map(str,input().split()))
if q[0] == '1':
normalFlag = not normalFlag
else:
if q[1] == '1':
if normalFlag:
front.append(q[2])
else:
back.append(q[2])
else:
if normalFlag:
back.append(q[2])
else:
front.append(q[2])
if normalFlag:
front.reverse()
ans = front+S+back
else:
back.reverse()
S.reverse()
ans = back+S+front
print(''.join(map(str,ans)))
| 1 | 57,488,274,719,140 | null | 204 | 204 |
X,N = map(int,input().split())
p = list(map(int,input().split()))
if not X in p:
print(X)
else:
for i in range(100):
if not (X-i) in p:
print(X-i)
break
elif not (X+i) in p:
print(X+i)
break
|
X, N = map(int, input().split())
p = list(map(int, input().split()))
for i in range(110):
if X - i not in p:
ans = X - i
break
elif X + i not in p:
ans = X + i
break
print(ans)
| 1 | 14,078,668,718,140 | null | 128 | 128 |
S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
break
if count == 0:
print("Yes")
else:
print("No")
|
S = input()
T = input()
ans = ''
if len(T) != len(S) + 1:
ans = 'No'
else:
ans = 'Yes'
for i in range(len(S)):
if S[i] != T[i]:
ans = 'No'
print(ans)
| 1 | 21,364,317,000,038 | null | 147 | 147 |
def solve():
s=input()
if(len(s)%2==0):
print("No")
return
else :
n=len(s)//2
str1=s[:n]
str2=s[n+1:]
# print(str1,str2)
if(str1==str2):
print("Yes")
else:
print("No")
if __name__ == "__main__":
solve()
|
# String Palindrome
def is_palindrome(s):
res = s == s[::-1]
return res
S = input()
N = len(S)
ans = ['No', 'Yes'][is_palindrome(S) & is_palindrome(S[:((N-1)//2)]) & is_palindrome(S[((N+1)//2):])]
print(ans)
| 1 | 46,089,139,438,628 | null | 190 | 190 |
N = int(input())
m = 1000
k = 0
A = list(map(int,input().split()))
M = A[0]
for a in A:
if M > a:
if k > 0:
m += k * M
k = 0
elif M < a:
if k == 0:
k,m = divmod(m,M)
M = a
m += k * M
print(m)
|
N=int(input())
S=input()
ans=S[0]
for s in S:
if ans[-1]!=s:
ans+=s
print(len(ans))
| 0 | null | 89,103,980,441,128 | 103 | 293 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import deque
from copy import deepcopy
def main():
n, m = map(int, input().split())
edges = {e:[] for e in range(n + 1)}
for _ in range(m):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
res = [0] * (n + 1)
dist = 1
distroom = [n + 1] * (n + 1)
distroom[1] = 0
q1 = deque()
q2 = deque()
q1.append(1)
while q1:
for q1e in q1:
for adj in edges[q1e]:
if distroom[adj] > dist:
res[adj] = q1e
distroom[adj] = dist
q2.append(adj)
dist += 1
q1 = deepcopy(q2)
q2 = deque()
print('Yes')
print(*res[2:],sep='\n')
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys
INF = float('inf')
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: "List[List[int]]", N: int, b: "List[int]"):
for i in b:
A = [[(a if a != i else 0) for a in l] for l in A]
return [NO, YES][any([not any(l) for l in [*A, *[[A[i][j] for i in range(3)] for j in range(3)], [A[0][0], A[1][1], A[2][2]], [A[2][0], A[1][1], A[0][2]]]])]
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = [[int(next(tokens)) for _ in range(3)]
for _ in range(3)] # type: "List[List[int]]"
N = int(next(tokens)) # type: int
b = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
print(f'{solve(A, N, b)}')
if __name__ == '__main__':
main()
| 0 | null | 40,062,412,587,296 | 145 | 207 |
def solve(a, m, sumA):
if m < 0 or m > sumA:
return False
if m == 0:
return True
if len(a) == 0:
return False
return solve(a[1:], m - a[0], sumA) or solve(a[1:], m, sumA)
n = int(input())
tmp = input().split()
a = []
for i in range(n):
a.append(int(tmp[i]))
q = int(input())
tmp = input().split()
m = []
for i in range(q):
m.append(int(tmp[i]))
sumA = sum(a)
for i in range(q):
if solve(a, m[i], sumA):
print("yes")
else:
print("no")
|
n=int(input())
a=list(map(int,input().split()))
q=int(input())
m=list(map(int,input().split()))
l=[]
for i in range(2**n):
sub=0
for j in range(n):
if (i>>j)&1==1:
sub+=a[j]
l.append(sub)
for i in m:
if i in l:
print("yes")
else:
print("no")
| 1 | 102,989,933,520 | null | 25 | 25 |
n, x, t = map(int, input().split())
time = 0
cnt = 0
while cnt < n:
time += t
cnt += x
print(time)
|
NXT = [int(i) for i in input().split(' ')]
import math
T_total = ( math.ceil( NXT[0]/ NXT[1] )*NXT[2] )
print (T_total)
| 1 | 4,313,879,174,848 | null | 86 | 86 |
def insert_sort(A, n, g, cnt):
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j -= g
cnt += 1
A[j+g] = v
return cnt
def shellSort(A, n):
cnt = 0
G = []; h = 0
while h <= n:
if 3 * h + 1 <= n:
h = 3 * h + 1
G.append(h)
else: break
G = sorted(G, reverse=True)
m = len(G)
for i in range(m):
cnt = insert_sort(A, n, G[i], cnt)
return m, cnt, G
A = []
n = int(input())
for i in range(n):
A.append(int(input()))
m, cnt, G = shellSort(A, n)
print(m)
for i in range(m):
if i == m - 1:
print(G[i])
else:
print(G[i], end=" ")
print(cnt)
for i in A:
print(i)
|
def insertionSort(a,n,g):
for i in range(g,n):
v=a[i]
j=i-g
while j>=0 and a[j]>v:
a[j+g]=a[j]
j=j-g
global cnt
cnt+=1
a[j+g]=v
def shellsort(a,n):
global cnt
cnt=0
g=[i for i in [262913, 65921, 16577, 4193, 1073, 281, 77, 23, 8, 1] if i <= n]
m=len(g)
#print(g,m)
for i in range(m):
insertionSort(a,n,g[i])
return a,m,g
n=int(input())
a=[int(input()) for i in range(n)]
a,m,g=shellsort(a,n)
print(m)
print(*g)
print(cnt)
for i in a:
print(i)
| 1 | 30,654,075,140 | null | 17 | 17 |
N,X,T=map(int,input().split())
a=N//X
b=N%X
if b!=0:
print((a+1)*T)
else:
print(a*T)
|
import math
n, x, t = [int(x) for x in input().split()]
print(math.ceil(n/x)*t)
| 1 | 4,314,391,001,508 | null | 86 | 86 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
def solve():
H, W, K = Scanner.map_int()
S = Scanner.string_list(H)
ans = int(1e15)
for i in range(1 << (H - 1)):
cut = 0
pc = 1
whites = [[0 for _ in range(W)] for _ in range(H)]
for j in range(H - 1):
for w in range(W):
whites[cut][w] += S[j][w] == '1'
if i >> j & 1:
cut += 1
pc += 1
for w in range(W):
whites[cut][w] += S[-1][w] == '1'
flag = True
for line in whites:
for cnt in line:
if cnt > K:
flag = False
if not flag:
continue
cnt = [0 for _ in range(pc)]
for w in range(W):
flag = True
for j in range(pc):
if cnt[j] + whites[j][w] > K:
flag = False
if not flag:
cnt = [0 for _ in range(pc)]
cut += 1
for j in range(pc):
cnt[j] += whites[j][w]
ans = min(ans, cut)
print(ans)
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
|
# coding: utf-8
import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")
def check(j):
global cur
for i in range(g):
cur[i] += c[i][j]
flag = True
for curr in cur:
if curr > K:
flag = False
return flag
H, W, K = LI()
S = RS(H)
ans = INF
N = H-1
for bit in range(1 << N):
g = 0
id = [0] * H
for i in range(H):
id[i] = g
if (bit >> i) & 1:
g += 1
g += 1
c = [[0] * W for _ in range(g)]
for i in range(H):
for j in range(W):
c[id[i]][j] += int(S[i][j])
num = g-1
cur = [0] * g
for i in range(W):
if not check(i):
num += 1
cur = [0] * g
if not check(i):
num = INF
break
ans = min(ans, num)
print(ans)
| 1 | 48,458,671,885,146 | null | 193 | 193 |
import math
case_num = 0
N = int(input())
for num in range(N - 1):
num += 1
case_num += ( math.ceil(N / num) - 1 )
print(case_num)
|
ln=10**6+10
sieve=[i for i in range(ln)]
p=2
while p**2<=ln:
if sieve[p]==p:
for q in range(p*2,ln,p):
if sieve[q]==q:
sieve[q]=p
p+=1
import collections
def primef(n):
prime_count=collections.Counter()
while n>1:
prime_count[sieve[n]]+=1
n//=sieve[n]
return prime_count
n=int(input())
ans=0
for i in range(1,n):
t=1
for j in primef(i).values():
t=t*(j+1)
ans+=t
print(ans)
| 1 | 2,605,804,334,228 | null | 73 | 73 |
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())
class SegTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.ide_ele = ide_ele
self.segfunc = segfunc
self.num = 2**(n - 1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
for i in range(n):
self.seg[i + self.num - 1] = init_val[i]
for i in range(self.num - 2, -1, -1):
self.seg[i] = self.segfunc(self.seg[2 * i + 1], self.seg[2 * i + 2])
def update(self, k, x):
k += self.num - 1
self.seg[k] += x
while k:
k = (k - 1) // 2
self.seg[k] = self.segfunc(self.seg[k * 2 + 1], self.seg[k * 2 + 2])
def query(self, p, q):
if q <= p:
return self.ide_ele
p += self.num - 1
q += self.num - 2
res = self.ide_ele
while q - p > 1:
if p & 1 == 0:
res = self.segfunc(res, self.seg[p])
if q & 1 == 1:
res = self.segfunc(res, self.seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = self.segfunc(res, self.seg[p])
else:
res = self.segfunc(self.segfunc(res, self.seg[p]), self.seg[q])
return res
def main():
N, D, A = in_nn()
XH = sorted(in_nl2(N))
X = [0] * N
H = [0] * N
for i in range(N):
x, h = XH[i]
X[i] = x
H[i] = h
seg = SegTree([0] * N, segfunc=lambda a, b: a + b, ide_ele=0)
ans = 0
for i in range(N):
x, h = X[i], H[i]
j = bisect.bisect_right(X, x + 2 * D)
cnt_bomb = seg.query(0, i + 1)
h -= A * cnt_bomb
if h <= 0:
continue
cnt = -(-h // A)
ans += cnt
seg.update(i, cnt)
if j < N:
seg.update(j, -cnt)
# print(i, j)
# print(seg.seg)
print(ans)
if __name__ == '__main__':
main()
|
import copy
import itertools
h, w, k = map(int, input().split())
#s= list(input())
s = []
min = 100000
for i in range(h):
s.append( [int(s) for s in list(input())])
#s.append([1]*w)
dbg_cnt = 0
l = list(range(h-1))
for i in range(h):
p = list(itertools.combinations(l, i))
for j in p:
tmp = list(j)
tmps = []
q = 0
tmps.append([])
#print(dbg_cnt)
#dbg_cnt += 1
for r in range(h):
tmps[q].append(copy.copy(s[r]))
if(q < len(tmp) and r==tmp[q]):
tmps.append([])
q += 1
#print(tmps)
count = i
sums = [0] * len(tmps)
precut = 1
exitflg = 0
for r in range(w): #550000
for q in range(len(tmps)):
for t in tmps[q]:
sums[q] += t[r] #5500000
cutflg = 0
for q in range(len(tmps)):
if sums[q] > k : #5500000
cutflg = 1
if cutflg == 1:
#print('cut')
count += 1
sums = [0] * len(tmps)
for q in range(len(tmps)):
for t in tmps[q]:
sums[q] += t[r] #5500000
for q in range(len(tmps)): #5500000
if sums[q] > k :
exitflg = 1
#print('exit')
#print(exitflg)
if exitflg == 0:
if min > count:
min = count
print(min)
| 0 | null | 65,390,606,705,590 | 230 | 193 |
n = int(input())
a = 0
for i in range(n+1):
if i%3== 0: continue
elif i%5 == 0:continue
elif i%3 ==0 and i %5 ==0:continue
else: a+=i
print(a)
|
a = int(input())
print((1+a)*a//2-((3 + a//3*3)*(a//3)//2 + (5 + a//5*5)*(a//5)//2 - (15 + a//15*15)*(a//15)//2))
| 1 | 34,994,057,103,434 | null | 173 | 173 |
N = int(input())
S = list()
for i in range(N):
S.append(input())
judge = ['AC', 'WA', 'TLE', 'RE']
count = [0] * 4
for i in range(N):
letter = S[i]
ind = judge.index(letter)
count[ind] += 1
for i in range(len(judge)):
print(judge[i], "x", str(count[i]))
|
n = int(input())
S = []
for i in range(n):
S.append(input())
lst = [S.count('AC'), S.count('WA'), S.count('TLE'),
S.count('RE')]
print('AC x ' + str(lst[0]))
print('WA x ' + str(lst[1]))
print('TLE x ' + str(lst[2]))
print('RE x ' + str(lst[3]))
| 1 | 8,755,089,288,238 | null | 109 | 109 |
import sys
input = sys.stdin.readline
def main():
N, K, S = map(int, input().split())
if S == 10 ** 9:
ans = [S] * K + [1] * (N - K)
else:
ans = [S] * K + [10 ** 9] * (N - K)
print(" ".join(map(str, ans)))
if __name__ == "__main__":
main()
|
n=int(input())
a=input()
if n%2!=0:
print('No')
exit()
t1=a[0:int(n/2)]
t2=a[int(n/2):n]
if t1==t2:
print('Yes')
else:
print('No')
| 0 | null | 118,638,745,703,058 | 238 | 279 |
x, y = map(int, input().split())
z = map(int, input().split())
if sum(z) >= x:
print("Yes")
else:
print("No")
|
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
sys.setrecursionlimit(100000000)
def input(): return sys.stdin.readline().rstrip()
N, K, C = map(int, input().split())
S = input()
L = [None] * K
R = [None] * K
i = 0
for j in range(N):
if S[j] == 'o' and i < K and (i == 0 or j - L[i - 1] > C):
L[i] = j
i += 1
i = K - 1
for j in reversed(range(N)):
if S[j] == 'o' and i >= 0 and (i == K - 1 or R[i + 1] - j > C):
R[i] = j
i -= 1
for l, r in zip(L, R):
if l == r:
print(l + 1)
| 0 | null | 59,403,000,513,052 | 226 | 182 |
def input_int():
return map(int, input().split())
def one_int():
return int(input())
def one_str():
return input()
def many_int():
return list(map(int, input().split()))
import math
from decimal import Decimal
A, B = input().split()
# A=int(A)
# B=float(B)
temp = Decimal(A)*Decimal(B)
print(int(math.floor(temp)))
|
m=[]
for i in range(10):
x = input()
m.append(x)
m.sort()
m.reverse()
for i in range(0,3):
print m[i]
| 0 | null | 8,327,182,630,608 | 135 | 2 |
from copy import copy
import random
D = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last = [0]*26
ans = [0]*D
score = 0
for i in range(D):
ps = [0]*26
for j in range(26):
pl = copy(last)
pl[j] = i+1
ps[j] += s[i][j]
for k in range(26):
ps[j] -= c[k]*(i+1-pl[k])
idx = ps.index(max(ps))
last[idx] = i+1
ans[i] = idx+1
score += max(ps)
for i in range(40000):
na = copy(ans)
x = random.randint(1,365)
y = random.randint(1,365)
if x == y:
continue
na[x-1],na[y-1] = na[y-1],na[x-1]
last = [0]*26
ns = 0
for i in range(D):
last[na[i]-1] = i+1
ns += s[i][na[i]-1]
for j in range(26):
ns -= c[j]*(i+1-last[j])
if ns > score:
ans = na
score = ns
for a in ans:
print(a)
|
# 貪欲+山登り(2点交換+1点更新)
import time
import random
d = int(input())
dd = d * (d + 1) // 2
*C, = map(int, input().split())
S = [list(map(int, input().split())) for i in range(d)]
# 貪欲法による初期解の構築
T = []
L = [-1 for j in range(26)]
for i in range(d):
max_diff = -10**7
arg_max = 0
for j in range(26):
memo = L[j]
L[j] = i
diff = S[i][j] - sum([C[k] * (i - L[k]) for k in range(26)])
if diff > max_diff:
max_diff = diff
arg_max = j
L[j] = memo
T.append(arg_max)
L[arg_max] = i
def calc_score(T):
L = [-1 for j in range(26)]
X = [0 for j in range(26)]
score = 0
for i in range(d):
score += S[i][T[i]]
X[T[i]] += (d - i) * (i - L[T[i]])
L[T[i]] = i
for j in range(26):
score -= C[j] * (dd - X[j])
return score
score = calc_score(T)
start = time.time()
while True:
now = time.time()
if now - start > 1.8:
break
# 1点更新
i = random.choice(range(d))
j = random.choice(range(26))
memo = T[i]
T[i] = j
new_score = calc_score(T)
T[i] = memo
if new_score > score:
T[i] = j
score = new_score
# 2点交換
i0 = random.choice(range(d))
z = random.choice(range(5))
i1 = i0 - z if i0 > z else i0 + z
T[i0], T[i1] = T[i1], T[i0]
new_score = calc_score(T)
T[i0], T[i1] = T[i1], T[i0]
if new_score > score:
T[i0], T[i1] = T[i1], T[i0]
score = new_score
for t in T:
print(t + 1)
| 1 | 9,653,647,338,400 | null | 113 | 113 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.