code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
N = int(input())
a = b = 1
while N:
a, b = b, a+b
N -= 1
print(a)
| def fib(n):
a=[1,1]
for i in range(2,n+1):
a.append(a[i-2]+a[i-1])
i+=1
return a[-1]
n=int(input())
print(fib(n))
| 1 | 1,867,739,832 | null | 7 | 7 |
import sys
from bisect import bisect_left,bisect_right
sys.setrecursionlimit(10**9)
INF=10**18
def input():
return sys.stdin.readline().rstrip()
def main():
N,M=map(int,input().split())
A=sorted(list(map(int,input().split())))
S=[0]*(N+1)
for i in range(N):
S[i+1]=S[i]+A[i]
def nibutan(ok,ng):
while abs(ok-ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok
def solve(mid):
c=0
for i in range(N):
c+=N-bisect_left(A,mid-A[i])
if c>=M:
return True
else:
return False
x=nibutan(0,10**11)
ans=0
count=0
for i in range(N):
b_l=bisect_left(A,x-A[i])
count+=(N-b_l)
ans+=S[N]-S[b_l]+A[i]*(N-b_l)
if count==M:
print(ans)
else:
print(ans+(M-count)*x)
if __name__ == '__main__':
main()
| n, m = map(int, input().split())
a = list(map(int, input().split()))
def cumsum(s):
n = len(s)
cs = [0] * (n+1)
for i in range(n):
cs[i+1] = cs[i] + s[i]
return cs
def bs_list(a, f):
l, r = -1, len(a)
while r - l > 1:
x = (l + r) // 2
if f(a[x]): r = x
else: l = x
return None if r == len(a) else r
a.sort()
ca = cumsum(a)
def detect(x):
num = 0
for b in a[::-1]:
res = bs_list(a, lambda y: y >= x - b)
if res is None: break
num += n - res
return num <= m
l, r = -1, 10**5*2+10
while r - l > 1:
x = (l+r) // 2
if detect(x): r = x
else: l = x
s, c = 0, 0
for b in a[::-1]:
res = bs_list(a, lambda x: x >= r - b)
if res is None: break
c += (n - res)
s += b * (n - res) + (ca[n] - ca[res])
print(s + (m - c) * l)
| 1 | 108,226,849,468,800 | null | 252 | 252 |
n = int(input())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
diff = []
total1 = 0
total2 = 0
total3 = 0
for i in range(n):
diff.append(abs(X[i] - Y[i]))
total1 += diff[i]
total2 += diff[i] ** 2
total3 += diff[i] ** 3
print("{0:.6f}" . format(total1))
print("{0:.6f}" . format(total2 ** 0.5))
print("{0:.6f}" . format(total3 ** (1 / 3)))
print("{0:.6f}" . format(max(diff)))
| X = int(input())
q = X // 100
if X%100<=q*5:
print('1')
else:
print('0')
| 0 | null | 63,509,519,477,600 | 32 | 266 |
N = int(input())
A = list(map(int,input().split()))
B = [[A[i],i+1]for i in range(N)]
B.sort()
ans = [B[i][1]for i in range(N)]
print(" ".join(map(str,ans))) | N = int(input())
A = list(map(int,input().split()))
B = [0]*N
for i in range(N):
B[A[i]-1] = i+1
print(" ".join(map(str,B))) | 1 | 180,989,318,429,440 | null | 299 | 299 |
x = int(input()) - 400
ans = x // 200
print(8 - ans) | import sys
read = sys.stdin.read
readline = sys.stdin.readline
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
def make_table2(n, mod=10 ** 9 + 7):
# 元テーブル
g1 = [0] * (n + 1)
g1[0] = 1
g1[1] = 1
tmp = 1
for i in range(2, n + 1):
tmp = tmp * i % mod
g1[i] = tmp
# 逆元テーブル
g2 = [0] * (n + 1)
g2[-1] = pow(g1[-1], mod - 2, mod)
tmp = g2[-1]
for i in range(n - 1, -1, -1):
tmp = tmp * (i + 1) % mod
g2[i] = tmp
return g1, g2
N, M, K = map(int, read().split())
mod = 998244353
g1, g2 = make_table2(N, mod)
answer = 0
for i in range(K + 1):
answer = (answer + cmb(N - 1, i, mod) * M * pow(M - 1, N - i - 1, mod)) % mod
print(answer)
| 0 | null | 14,997,743,144,788 | 100 | 151 |
a=int(input())
b=a//3
c=a//5
d=a//15
z=0
y=0
w=0
v=0
for x in range(a+1):
z=z+x
for x in range(b+1):
y=y+x*3
for x in range(c+1):
w=w+x*5
for x in range(d+1):
v=v+x*15
print(z-y-w+v) | N = int(input())
print(sum([i for i in range(1, N+1) if i%3 if i%5])) | 1 | 34,806,581,671,382 | null | 173 | 173 |
S = input()
T = input()
S = S + T[-1]
if S == T:
ans = 'Yes'
else:
ans = 'No'
print(ans) | A = input()
B = input()
B = B[0:len(B)-1]
if A == B:
print('Yes')
else:
print('No') | 1 | 21,348,570,584,788 | null | 147 | 147 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10**9 + 7
num_zero = 0
neg_list = []
pos_list = []
for a in A:
if a == 0:
num_zero += 1
elif a < 0:
neg_list.append(a)
else:
pos_list.append(a)
# 0にしかできない
if len(pos_list) + len(neg_list) < K:
print(0)
else:
min_num_neg = K - len(pos_list)
max_num_neg = min(K, len(neg_list))
# 負にしかできない
if min_num_neg == max_num_neg and min_num_neg % 2 == 1:
if num_zero > 0:
print(0)
return
ans = 1
neg_list.sort()
pos_list.sort(reverse=True)
for i in range(K):
use_pos = False
if len(neg_list) == 0 or len(pos_list) == 0:
if len(neg_list) == 0:
use_pos = True
else:
use_pos = False
elif abs(neg_list[-1]) < pos_list[-1]:
use_pos = False
else:
use_pos = True
if use_pos:
ans *= pos_list[-1]
pos_list.pop()
else:
ans *= neg_list[-1]
neg_list.pop()
ans %= MOD
print(ans)
else:
# 正にできる
ans = 1
neg_list.sort(reverse=True)
pos_list.sort()
if K % 2 == 1:
K -= 1
ans *= pos_list[-1]
pos_list.pop()
# posもnegも偶数個ずつ使う
for _ in range(0, K, 2):
use_pos = False
if len(neg_list) <= 1 or len(pos_list) <= 1:
if len(neg_list) <= 1:
use_pos = True
else:
use_pos = False
elif abs(neg_list[-1] * neg_list[-2]) > (pos_list[-1] * pos_list[-2]):
use_pos = False
else:
use_pos = True
if use_pos:
ans *= pos_list[-1] * pos_list[-2]
pos_list.pop()
pos_list.pop()
else:
ans *= neg_list[-1] * neg_list[-2]
neg_list.pop()
neg_list.pop()
ans %= MOD
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
| # Contest No.: ABC173
# Problem No.: E
# Solver: JEMINI
# Date: 20200705
import sys
import heapq
def main():
modVal = 10 ** 9 + 7
# parsing
n, k = map(int, sys.stdin.readline().split())
nums = list(map(int, sys.stdin.readline().split()))
# edge case; n == k
if n == k:
ans = 1
for i in nums:
ans *= i % modVal
ans %= modVal
print(ans % modVal)
return
# edge case; all neg
if max(nums) < 0:
nums.sort()
ans = 1
# odd k
if k % 2:
for i in range(k):
ans *= nums[-i - 1] % modVal
ans %= modVal
# even k
else:
for i in range(k):
ans *= nums[i] % modVal
ans %= modVal
print(ans % modVal)
return
# convert to absolute value & count zeros
absNums = []
zeroCnt = 0
for i in nums:
if i == 0:
zeroCnt += 1
else:
absNums.append([abs(i), i])
absNums.sort() # sorted by absolute value
# edge case; non-zero cnt is less than k
if len(absNums) < k:
print(0)
return
# separate non-zero int to 4 sorted lists; all values are absolute value
posOverK = []
negOverK = []
posLessK = []
negLessK = []
for _ in range(k):
temp = absNums.pop()
if temp[1] > 0:
posOverK.append(temp[0])
else:
negOverK.append(temp[0])
while absNums:
temp = absNums.pop()
if temp[1] > 0:
posLessK.append(temp[0])
else:
negLessK.append(temp[0])
posOverK.sort()
negOverK.sort()
posLessK.sort()
negLessK.sort()
# odd negative numbers; if able, change to even
if len(negOverK) % 2:
minNeg = None
minPos = None
maxNeg = None
maxPos = None
if posOverK:
minPos = posOverK[0]
if negOverK:
minNeg = negOverK[0]
if posLessK:
maxPos = posLessK[-1]
if negLessK:
maxNeg = negLessK[-1]
# both case available; pos -> neg or neg -> pos
if (minNeg and maxPos) and (minPos and maxNeg):
# compare ratio
if maxPos * minPos > maxNeg * minNeg:
negOverK[0] = maxPos
else:
posOverK[0] = maxNeg
# one case available
elif not (minNeg and maxPos) and (minPos and maxNeg):
posOverK[0] = maxNeg
elif (minNeg and maxPos) and not (minPos and maxNeg):
negOverK[0] = maxPos
# unchangable, zero exists
elif zeroCnt > 0:
print(0)
return
# answer building
ans = 1
for i in posOverK:
ans *= i % modVal
ans = ans % modVal
for i in negOverK:
ans *= i % modVal
ans = ans % modVal
print(ans % modVal)
return
if __name__ == "__main__":
main() | 1 | 9,415,909,722,560 | null | 112 | 112 |
def ins(A,N):
for i in range(N):
v=A[i]
j=i-1
while j>=0 and A[j]>v:
A[j+1]=A[j]
j-=1
A[j+1]=v
for k in range(len(A)):
if k==len(A)-1:
print(A[k])
else:
print(A[k],end=" ")
N=int(input())
A=list(map(int,input().split(" ")))
ins(A,N) | n, k, c = [int(i) for i in input().split()]
s = input()
work1 = [0] * k
work2 = [0] * k
cnt = 0
day = 0
while cnt < k:
if s[day] == 'o':
work1[cnt] = day
cnt += 1
day += (c+1)
else:
day += 1
cnt = k-1
day = n-1
while cnt >= 0:
if s[day] == 'o':
work2[cnt] = day
cnt -= 1
day -= (c + 1)
else:
day -= 1
for i in range(k):
if work1[i] == work2[i]:
print(work1[i]+1)
| 0 | null | 20,233,052,932,498 | 10 | 182 |
a,b=map(int,input().split())
print("-1" if a>9 or b>9 else a*b) | x = list(map(int,input().split()))
if(len(str(x[0])) < 2 and len(str(x[1])) < 2):
print(x[0] * x[1])
else:
print(-1) | 1 | 158,155,882,812,930 | null | 286 | 286 |
a,b,c = [int(x) for x in input().split( )]
div = []
for x in range(1,c+1):
if c % x == 0:
div.append(x)
r = []
for x in range(a,b+1):
r.append(x)
answer = 0
for x in div:
for y in r:
if x == y:
answer += 1
print(answer)
| nums=[]
nums=input().split()
a=int(nums[0])
b=int(nums[1])
c=int(nums[2])
ans=0
for i in range(a,b+1):
if c%i==0:
ans+=1
print(ans) | 1 | 570,462,409,760 | null | 44 | 44 |
n = int(input())
output = 'ACL'*n
print(output) | x = int(input())
for _ in range(x):
print("ACL", end="") | 1 | 2,189,655,501,960 | null | 69 | 69 |
import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
cnt=0
for i in range(n):
for j in range(i+1,n):
cnt+=bisect.bisect_left(a,a[i]+a[j])-(j+1)
print(cnt) | from bisect import bisect_left
n = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(n):
for j in range(i+1, n):
ans += bisect_left(L, L[i]+L[j])-j-1
print(ans)
| 1 | 171,678,216,243,650 | null | 294 | 294 |
n = int(input())
s = input()
ans = 0
for i in range(10):
for j in range(10):
for k in range(10):
fi = False
fj = False
for ss in s:
ss = int(ss)
if not fi and ss == i:
fi = True
continue
if fi and not fj and ss == j:
fj = True
continue
if fj and ss == k:
ans += 1
break
print(ans)
| n = int(input())
s = list(map(int, list(input())))
f = [0]*1000
rnum = [0]*10
lnum = [0]*10
for i in s:
rnum[i] += 1
rnum[s[0]] -= 1
lnum[s[0]] += 1
for i in range(1, n-1):
rnum[s[i]] -= 1
for j in range(10):
for k in range(10):
if lnum[j] >= 1 and rnum[k] >= 1:
f[j*100+s[i]*10+k] = 1
lnum[s[i]] += 1
cnt = 0
for i in f:
if i == 1:
cnt += 1
print(cnt) | 1 | 128,413,284,602,702 | null | 267 | 267 |
from itertools import product
h, w, k = map(int, input().split())
c = [[1 if j == '#' else 0 for j in input()] for i in range(h)]
cnt = 0
for br in product([0, 1], repeat=h):
for bc in product([0, 1], repeat=w):
if sum(c[i][j]*br[i]*bc[j] for i, j in product(range(h), range(w))) == k:
cnt += 1
print(cnt) | import sys
n, k = map(int, input().split())
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
l, r = -1, 10 ** 12 + 1
while r - l > 1:
m = (l + r) // 2
cnt = 0
for i in range(n):
cnt += max(0, a[i] - (m // f[i]))
if cnt <= k:
r = m
else:
l = m
print(r) | 0 | null | 86,621,131,619,504 | 110 | 290 |
a,b,m = map(int,input().split())
a_list = [int(x.strip()) for x in input().split()]
b_list = [int(x.strip()) for x in input().split()]
ans = min(a_list)+min(b_list)
for i in range(m):
ai,bi,ci = map(int,input().split())
ch = a_list[ai-1]+b_list[bi-1]-ci
if ch < ans:
ans = ch
print(ans) | def main():
import math
n = int(input())
n_sq = int(math.sqrt(n)) + 1
tmp = 10 ** 13
for i in range(n_sq, 1, -1):
if n % i == 0:
j = n // i
k = (i-1) + (j-1)
if tmp > k :
tmp = k
if tmp != 10 ** 13:
ans = tmp
else:
ans = n-1
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 108,001,498,655,888 | 200 | 288 |
N, X, M = map(int, input().split())
"""
id[X] Xを何番目に訪問したか。-1で無ければ訪問済み。
Xをメモ A[i+1] = (A[i] * A[i]) % M
length = ループが終わるまでの長さ
"""
id = [-1] * M
A = [] # 訪問したものをメモ
length = 0
total = 0
while id[X] == -1:
A.append(X)
id[X] = length
length += 1
total += X
X = (X * X) % M
syuki = length - id[X]
syukisum = sum(A[id[X] : length])
# for i in range(id[X], length):
# syukisum += A[i]
ans = 0
if N <= length:
ans = sum(A[:N])
else:
ans += total
N -= length
loop, res = divmod(N, syuki)
ans += syukisum * loop
ans += sum(A[id[X] : id[X] + res])
print(ans)
| from collections import defaultdict
N, X, M = map(int, input().split())
A = [X]
visited = set()
visited.add(X)
idx = defaultdict()
idx[X] = 0
iii = -1
for i in range(1, M):
tmp = (A[-1]**2) % M
if tmp not in visited:
A.append(tmp)
visited.add(tmp)
idx[tmp] = i
else:
iii = idx[tmp]
ans = 0
if iii == -1:
ans = sum(A[:N])
print(ans)
exit()
else:
# ループの頭の直前まで
ans += sum(A[:iii])
N -= iii
if N > 0:
# ループの長さ
l = len(A) - iii
ans += (N // l) * sum(A[iii:])
N -= N // l * l
if N > 0:
# ループに満たないN
ans += sum(A[iii:iii + N])
print(ans)
| 1 | 2,764,940,781,280 | null | 75 | 75 |
line = int(input())
nums = [[[0 for x in range(0, 10)] for x in range(0, 3)] for x in range(0, 4)]
input1 = []
for i in range(line):
input1.append(input())
for e in input1:
efbv = e.split(" ")
e_b, e_f, e_r, e_v = map(int, efbv)
nums[e_b - 1][e_f - 1][e_r -1] += e_v
for b in range(4):
for f in range (3):
print(" " + " ".join(map(str, nums[b][f])))
if b != 3: print("#" * 20) | n = int(input())
print(n//2-1 + n % 2) | 0 | null | 77,474,561,449,340 | 55 | 283 |
import math
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
x = int(input())
lcm = lcm_base(360, x)
print(lcm//x) | x = int(input())
y = 0
k = 0
while True:
y += x
k += 1
if y % 360 == 0:
break
print(k) | 1 | 13,045,963,637,432 | null | 125 | 125 |
import sys
MOD = 10**9+7
N,K = map(int, input().split())
A = [[abs(int(x)),1 if int(x)<0 else 0] for x in input().split()]
A.sort(key=lambda x: x[0],reverse=True)
prod = 1
pn = 0
lastn = -1
lastp = -1
for i in range(K):
if A[i][1] == 1: lastn = i
else: lastp = i
pn = (pn + A[i][1]) % 2
if pn == 0:
if K == N and [0,0] in A:
print(0)
sys.exit()
for i in range(K):
prod = prod * A[i][0] % MOD
print(prod)
sys.exit()
elif pn == 1:
if K == N:
if [0,0] in A:
print(0)
sys.exit()
for i in range(N):
prod = prod * A[i][0] % MOD
prod = prod * (-1) % MOD
print(prod)
sys.exit()
indp = K
indn = K
while indp < N and A[indp][1] == 1:
indp += 1
while indn < N and A[indn][1] == 0:
indn += 1
if lastp == -1 and indp == N:
for i in range(K):
prod = prod * A[-1-i][0] % MOD
prod = prod * (-1) % MOD
elif indp == N:
for i in range(K):
if i == lastp:
prod = prod * A[indn][0] % MOD
else:
prod = prod * A[i][0] % MOD
elif lastp == -1 or indn == N:
for i in range(K):
if i == lastn:
prod = prod * A[indp][0] % MOD
else:
prod = prod * A[i][0] % MOD
else:
for i in range(K):
if A[indp][0] * A[lastp][0] > A[indn][0] * A[lastn][0]:
if i == lastn:
prod = prod * A[indp][0] % MOD
else: prod = prod * A[i][0] % MOD
else:
if i == lastp:
prod = prod * A[indn][0] % MOD
else:
prod = prod * A[i][0] % MOD
print(prod) | import sys
# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
import bisect
# def input():
# return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
A = sorted(list(map(int, input().split())))
mod = 10 ** 9 + 7
if N == K:
ans = 1
for i in range(N):
ans *= A[i]
ans %= mod
print(ans % mod)
elif K % 2 == 0:
ans = 1
j = 0
i = N - 1
for _ in range(K // 2):
if A[j] * A[j + 1] > A[i] * A[i - 1]:
ans *= A[j] * A[j + 1]
ans %= mod
j += 2
else:
ans *= A[i] * A[i - 1]
ans %= mod
i -= 2
print(ans % mod)
elif A[-1] < 0:
ans = 1
for i in range(K):
ans *= A[-(i + 1)]
ans %= mod
print(ans % mod)
else:
ans = A[-1]
j = 0
i = N - 2
for _ in range(K // 2):
if A[j] * A[j + 1] > A[i] * A[i - 1]:
ans *= A[j] * A[j + 1]
ans %= mod
j += 2
else:
ans *= A[i] * A[i - 1]
ans %= mod
i -= 2
print(ans % mod)
if __name__ == "__main__":
main()
| 1 | 9,404,747,909,658 | null | 112 | 112 |
import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:-1])
else:
if' '==e[6]:
m=e[7:-1]
if m in d:d.remove(m)
elif len(e)&1:d.pop()
else:d.popleft()
print(*d)
if'__main__'==__name__:s()
| from collections import deque
n = int(input())
my_list = deque()
for t in range(n):
i = input().split()
if i[0] == "insert":
my_list.appendleft(i[1])
elif i[0] == "delete" and i[1] in my_list:
my_list.remove(i[1])
elif i[0] == "deleteFirst":
my_list.popleft()
elif i[0] == "deleteLast":
my_list.pop()
print(" ".join(my_list))
| 1 | 50,334,021,838 | null | 20 | 20 |
def main():
n=int(input())
d=[0]+[-10**18]*n
for j,(a,i)in enumerate(sorted((-a,i)for i,a in enumerate(map(int,input().split())))):
d=[max(t-a*abs(~i-j+k+n),d[k-1]-a*abs(~i+k))for k,t in enumerate(d)]
print(max(d))
main() | def main():
from operator import itemgetter
N = int(input())
a = map(int, input().split())
*ea, = enumerate(a, 1)
ea.sort(key=itemgetter(1), reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
# dp[left][right]:=活発な幼児から順に左端からleft,右端からright並べた際の最大うれしさ
for i, (p, x) in enumerate(ea, 1):
for left in range(i + 1):
right = i - left
if left > 0:
dp[left][right] = max(
dp[left][right],
dp[left - 1][right] + x * (p - left)
)
if right > 0:
dp[left][right] = max(
dp[left][right],
dp[left][right - 1] + x * (N - right + 1 - p)
)
ans = max(dp[i][N - i] for i in range(N + 1))
print(ans)
if __name__ == '__main__':
main()
| 1 | 33,639,081,446,112 | null | 171 | 171 |
import collections
n = int(input())
adj_list = []
for _ in range(n):
adj = list(map(int, input().split(" ")))
adj_list.append([c - 1 for c in adj[2:]])
distances = [-1 for _ in range(n)]
queue = collections.deque()
queue.append(0)
distances[0] = 0
while queue:
p = queue.popleft()
for next_p in adj_list[p]:
if distances[next_p] == -1:
distances[next_p] = distances[p] + 1
queue.append(next_p)
for i in range(n):
print(i+1, distances[i])
| from collections import deque
def bfs(start):
Q = deque()
Q.append(start)
dist[start] = 0
while Q:
v = Q.popleft()
for nv in G[v]:
if dist[nv] != -1:
continue
# print(Q)
dist[nv] = dist[v] + 1
Q.append(nv)
N = int(input())
G = [[]] + [list(map(int, input().split())) for _ in range(N)]
for a in range(1, N + 1):
b = G[a][2:]
G[a] = b
# print(G)
dist = [-1 for _ in range(N + 1)]
start = 1
bfs(start)
# print(dist[1:])
for i in range(1, N + 1):
print(i, dist[i])
| 1 | 3,770,083,992 | null | 9 | 9 |
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = [0]
bb = [0]
for i in range(n):
aa.append(aa[-1]+a[i])
for i in range(m):
bb.append(bb[-1]+b[i])
c = m
ans = 0
for i in range(n+1):
u = k - aa[i]
for j in range(c, -1, -1):
if bb[j] <= u:
ans = max(ans, i+j)
c = j
break
print(ans) | from bisect import bisect_right
N,D,A=map(int,input().split())
X,H=[None]*N,{}
for i in range(N):
X[i],H[X[i]]=map(int,input().split())
X.sort()
f=[0]*N
ans=i=0
while i<N:
if i>0:
f[i]+=f[i-1]
if f[i]*A<H[X[i]]:
k=-((f[i]*A-H[X[i]])//A)
f[i]+=k
ans+=k
j=bisect_right(X,X[i]+(D<<1))
if j<N:
f[j]-=k
i+=1
print(ans) | 0 | null | 46,518,841,375,358 | 117 | 230 |
x, k, d = map(int, input().split())
cur = x
numTimes = x // d
if numTimes == 0:
cur -= d
k -= 1
else:
numTimes = min(abs(numTimes), k)
if x < 0:
numTimes *= -1
cur -= numTimes * d
k -= numTimes
if k % 2 == 0:
print(abs(cur))
else:
result = min(abs(cur - d), abs(cur + d))
print(result) | a,b,c,d = map(int, input().split())
max_list = [a*c,a*d,b*c,b*d]
max_list = sorted(max_list, reverse=True)
print(max_list[0])
| 0 | null | 4,165,880,699,762 | 92 | 77 |
def readinput():
n,k=map(int,input().split())
lr=[]
for _ in range(k):
l,r=map(int,input().split())
lr.append((l,r))
return n,k,lr
def main(n,k,lr):
lrs=sorted(lr,key=lambda x:x[0])
MOD=998244353
dp=[0]*(n+1)
dp[1]=1
for i in range(1,n):
#print(i)
if dp[i]==0:
continue
skip=False
for l,r in lrs:
for j in range(l,r+1):
#print('i+j: {}'.format(i+j))
if i+j>n:
skip=True
break
dp[i+j]=(dp[i+j]+dp[i])%MOD
#print(dp)
if skip:
break
return dp[n]
def main2(n,k,lr):
lrs=sorted(lr,key=lambda x:x[0])
MOD=998244353
dp=[0]*(n+1)
ruiseki=[0]*(n+1)
dp[1]=1
ruiseki[1]=1
for i in range(2,n+1):
for l,r in lrs:
if i-l<1:
break
dp[i]+=ruiseki[i-l]-ruiseki[max(1,i-r)-1]
dp[i]=dp[i]%MOD
ruiseki[i]=(ruiseki[i-1]+dp[i])%MOD
return dp[n]
if __name__=='__main__':
n,k,lr=readinput()
ans=main2(n,k,lr)
print(ans)
| def main():
n = int(input())
s = list(map(int, input().split()))
q = int(input())
t = list(map(int, input().split()))
# 集合的なら
# res = len(set(s) & set(p))
# print(res)
# 線形探索なら
cnt = 0
for i in t:
if i in s:
cnt += 1
print(cnt)
if __name__ == '__main__':
main()
| 0 | null | 1,393,083,424,676 | 74 | 22 |
n = int(input())
S = [int(i) for i in input().split()]
q = int(input())
T = [int(i) for i in input().split()]
ans = 0
for t in T:
if t in S:
ans += 1
print(ans)
| #coding:utf-8
n = int(input())
S = list(map(int, input().split()))
q = int(input())
T = list(map(int, input().split()))
def search_banpei(array, target, cnt):
tmp = array[len(array)-1]
array[len(array)-1] = target
n = 0
while array[n] != target:
n += 1
array[len(array)-1] = tmp
if n < len(array) - 1 or target == tmp:
cnt += 1
return cnt
def linear_search():
cnt = 0
for t in T:
for s in S:
if t == s:
cnt += 1
break
def linear_banpei_search():
cnt = 0
for target in T:
cnt = search_banpei(S, target, cnt)
return cnt
cnt = linear_banpei_search()
print(cnt)
| 1 | 63,589,996,800 | null | 22 | 22 |
n = int(input())
a = [int(i) for i in input().split()]
print(' '.join([str(i) for i in a]))
for i in range(1, n):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v:
a[j+1] = a[j]
j -= 1
a[j+1] = v
print(' '.join([str(i) for i in a]))
| input()
array = [int(x) for x in input().split()]
print(' '.join(list(str(x) for x in array)))
for i in range(1, len(array)):
key = array[i]
j = i - 1
while j >= 0 and array[j] > key:
array[j + 1] = array[j]
j -= 1
array[j + 1] = key
print(' '.join(list(str(x) for x in array))) | 1 | 5,767,634,360 | null | 10 | 10 |
# Distance II
dimension = int(input())
vectors = [[float(i) for i in input().rstrip().split()] for j in range(2)]
x = vectors[0]
y = vectors[1]
absoluteValues = [abs(x[k] - y[k]) for k in range(dimension)]
# print(absoluteValues)
# xとyのミンコフスキー距離を求める関数(a: 有限)
def mink(a):
totalValue = 0
for i in range(dimension):
totalValue += absoluteValues[i] ** a
distance = totalValue ** (1 / a)
return distance
# xとyのChebyshev距離を求める関数
def chev():
maxValue = 0
for i in range(dimension):
# print(absoluteValues[i])
if absoluteValues[i] > maxValue:
maxValue = absoluteValues[i]
print(maxValue)
for i in range(1, 3 + 1):
dist = mink(i)
print(dist)
chev()
| mod = 998244353
n,k =map(int,input().split())
step =[0]*(n+1)
# step[0]=1
step[1]=1
stepsum=[0]*(n+1)
stepsum[1]=1
l=[0]*k
r=[0]*k
for i in range(k):
l[i],r[i]=map(int,input().split())
for i in range(2,n+1):
for j in range(k):
li = i - r[j]
ri = i - l[j]
if ri <= 0:
continue
# li = max(1,li)
step[i] += stepsum[ri] - stepsum[max(0,li-1)]
# step[i] %= mod
# print(step)
stepsum[i] = ( stepsum[i-1] + step[i] )%mod
print(step[n]%mod) | 0 | null | 1,453,619,912,756 | 32 | 74 |
n = int(input())
mod = (10**9)+7
ans = (10**n) - 2*(9**n) + 8**n
print(ans%mod) | n = int(input())
mod = 1000000007
def _mod(x, y):
res = 1
for i in range(y):
res = (res * x) % mod
return res
ans = _mod(10, n) - _mod(9, n) - _mod(9, n) + _mod(8, n)
ans %= mod
print(ans)
| 1 | 3,189,717,008,400 | null | 78 | 78 |
a = input()
print('Yes') if (a[2] == a[3] and a[4] == a[5]) else print('No') | import math
r = float(input())
S = math.pi * (r**2)
l = 2 * math.pi * r
print("{} {}".format(S, l))
| 0 | null | 21,251,851,555,460 | 184 | 46 |
while True :
num = map(int,input())
s = sum(num)
if s == 0: break
else:
print(s)
| a,b=map(int,input().split())
x=a%b
while x>0:
a=b
b=x
x=a%b
print(b)
| 0 | null | 787,542,140,268 | 62 | 11 |
def count_divisors(num, start, end):
"""
num: positive int
start: positive int
end: positive int(end > start)
returns numbers of devisors of i between start and end
>>> count_divisors(80, 5, 14)
3
>>> count_divisors(12, 1, 4)
4
"""
count = 0
for i in range(start, end+1):
if num % i == 0:
count += 1
return count
if __name__ == '__main__':
#import doctest
#doctest.testmod()
(a, b, c) = [int(i) for i in input().split(' ')]
print(count_divisors(c, a, b)) | import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:-1])
else:
if' '==e[6]:
m=e[7:-1]
if m in d:d.remove(m)
elif len(e)&1:d.pop()
else:d.popleft()
print(*d)
if'__main__'==__name__:s()
| 0 | null | 310,539,806,158 | 44 | 20 |
N, M = map(int, input().split())
cnt = 0
l = 0
k = M
while cnt < M and k > 0:
print(l + 1, l + k + 1)
cnt += 1
l += 1
k -= 2
l = M + 1
k = M - 1
while cnt < M:
print(l + 1, l + k + 1)
cnt += 1
l += 1
k -= 2
| N=int(input())
alist=list(map(int,input().split()))
slist=[0]
for a in alist:
slist.append(slist[-1]+a)
#print(slist)
answer=float("inf")
for i in range(N+1):
s1=slist[i]
s2=slist[-1]-s1
answer=min(answer,abs(s1-s2))
print(answer) | 0 | null | 85,459,106,227,842 | 162 | 276 |
import math
def is_prime(n):
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return n != 1
n = int(input())
answer = 0
for _ in range(0, n):
m = int(input())
if is_prime(m):
answer = answer + 1
print(answer)
| N=int(input())
S=[input() for _ in range(N)]
a=0
w=0
t=0
r=0
for i in range(N):
if S[i] =="AC":
a+=1
elif S[i] =="WA":
w+=1
elif S[i] =="TLE":
t+=1
elif S[i] =="RE":
r+=1
print("AC x "+ str(a))
print("WA x "+ str(w))
print("TLE x "+ str(t))
print("RE x "+ str(r))
| 0 | null | 4,364,452,720,760 | 12 | 109 |
import sys
for m,n in [map(int,x.split()) for x in list(sys.stdin)]:
g,r = m,n
while r!=0:
g,r = r,g%r
print(g,m//g*n) | #!/usr/bin/python
import sys
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b, a%b)
def lcm(a,b):
return a / gcd(a,b) * b
for l in sys.stdin:
a = [int(s) for s in l.split()]
print str(gcd(a[0],a[1]))+" "+str(lcm(a[0],a[1])) | 1 | 825,334,832 | null | 5 | 5 |
import sys
def a_c(f):
s = f.read().decode().strip()
return 'ABC' if s == 'ARC' else 'ARC'
def main():
ans = a_c(sys.stdin.buffer)
print(ans)
if __name__ == '__main__':
main() | N = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7
num_one_for_digit = [0]*61
for i in range(N):
b = bin(A[i])[2:].zfill(61)
for d in range(61):
if b[d] == "1":
num_one_for_digit[d] += 1
ans = 0
t = 1
for d in range(60, -1, -1):
n_1 = num_one_for_digit[d]
ans += n_1 * (N - n_1) * t % MOD
ans %= MOD
t *= 2
print(ans%MOD) | 0 | null | 73,411,416,706,618 | 153 | 263 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
total = 0
for i in range(m):
total = total + a[i]
if (n -total) < 0:
print(-1)
else:
print(n - total) | a, b = map(int, input().split())
if a < b:
a, b = b, a
c = a
d = b
r = c // d
m = c % d
while True:
if m == 0:
break
else:
c = d
d = m
m = c % d
print(int(a * b / d)) | 0 | null | 72,711,350,762,000 | 168 | 256 |
def main():
N = int(input())
A = list(map(int,input().split()))
count = 0
for i in range(N):
minj = i
for j in range(i,N):
if A[j] < A[minj]:
minj = j
count += (i != minj)
A[i], A[minj] = A[minj], A[i]
print(" ".join(map(str,A)))
print(count)
if __name__ == "__main__":
import os
import sys
if len(sys.argv) > 1:
if sys.argv[1] == "-d":
fd = os.open("input.txt", os.O_RDONLY)
os.dup2(fd, sys.stdin.fileno())
main()
else:
main() | def selectionSort(A, N):
count = 0
for i in range(N - 1):
minValue = 100
minIndex = 0
for j in range(i, N):
if A[j] < minValue:
minValue = A[j]
minIndex = j
if minIndex != i:
temp = A[i]
A[i] = minValue
A[minIndex] = temp
count = count + 1
for i in range(N):
print A[i],
print
print count
N = input()
A = map(int, raw_input().split())
selectionSort(A, N) | 1 | 20,866,694,492 | null | 15 | 15 |
d = {n: 'hon' for n in "24579"}
d.update({n: 'pon' for n in "0168"})
d.update({"3": 'bon'})
print(d[input()[-1]]) | 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())
from collections import defaultdict
from collections import deque
import bisect
from decimal import *
from functools import reduce
def main():
N = I()
Dots = defaultdict()
xpyp = []
xpyn = []
xnyp = []
xnyn = []
for i in range(N):
x, y = MI()
Dots[i] = (x, y)
xpyp.append(x + y)
xpyn.append(x - y)
xnyp.append(- x + y)
xnyn.append(- x - y)
xpyp_max = max(xpyp) - min(xpyp)
xpyn_max = max(xpyn) - min(xpyn)
xnyp_max = max(xnyp) - min(xnyp)
xnyn_max = max(xnyn) - min(xnyn)
print(max(xpyp_max, xpyn_max, xnyp_max, xnyn_max))
if __name__ == "__main__":
main()
| 0 | null | 11,370,144,235,400 | 142 | 80 |
while True:
s = input().split(" ")
H = int(s[0])
W = int(s[1])
if H == 0 and W == 0:
break
for i in range(H):
for j in range(W):
if i == 0 or i == H-1:
print("#",end="")
else:
if j == 0 or j == W-1:
print("#",end="")
else:
print(".",end="")
print("")
print("") | def main():
import sys
from collections import deque
from operator import itemgetter
M=10**10
b=sys.stdin.buffer
n,d,a=map(int,b.readline().split())
m=map(int,b.read().split())
q=deque()
popleft,append=q.popleft,q.append
s=b=0
for x,h in sorted(zip(m,m),key=itemgetter(0)):
while q and q[0]//M<x:b-=popleft()%M
if h>b:
t=(b-h)//a
s-=t
t*=a
b-=t
append((x+d+d)*M-t)
print(s)
main() | 0 | null | 41,504,360,661,350 | 50 | 230 |
n = int(input())
A = [int(x) for x in input().split()]
cnt = 0
for i in range(n):
if (i+1)%2 != 0 and A[i]%2 != 0:
cnt += 1
print(cnt) | ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
H, A = rii()
H, r = divmod(H, A)
r = 1 if r else r
print(H + r) | 0 | null | 42,085,819,032,852 | 105 | 225 |
n = int(input())
acl = "ACL" * n
print(acl)
| x,y=map(int,input().split())
print(str(min(x,y))*max(x,y)) | 0 | null | 43,112,000,858,258 | 69 | 232 |
while True:
(x, y) = map(lambda s:int(s), input().split())
if x == 0 and y == 0:
break
if x > y:
(x, y) = (y, x)
print(x, y) | import sys
n = int(input())
A = [int(_) for _ in input().split()]
if n == 1 or n == 2 or n == 3:
print(max(A))
sys.exit()
dp = [[0, 0] for j in range(n)]
M = - float('inf')
for i in range(4):
M = max(M, A[i])
dp[i][0] = M
dp[2][1] = dp[0][0] + A[2]
dp[3][1] = max(dp[1][0] + A[3], dp[2][1])
for i in range(4, n):
for j in range(2):
if i % 2 == 0 and j == 1:
dp[i][j] = dp[i-2][1] + A[i]
elif i % 2 == 0 and j == 0:
dp[i][j] = max(dp[i-2][0] + A[i], dp[i-1][1])
elif i % 2 == 1 and j == 1:
dp[i][j] = max(dp[i-2][1] + A[i], dp[i-1][1])
else:
dp[i][j] = max(dp[i-2][0] + A[i], dp[i-1][0])
print(dp[n-1][(n+1)%2]) | 0 | null | 19,074,831,188,488 | 43 | 177 |
N= int(input())
stone_str = input()
r_cnt = stone_str.count('R')
print(stone_str.count('W', 0, r_cnt)) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, m = map(int, read().split())
if n % 2 == 1:
for i in range(1, m + 1):
print(i, n - i)
else:
x, y = 0, 0
for i in range(m):
a, b = 2 * i, n - 2 * (i + 1)
if a == b or (a == y and b == x):
n -= 1
x, y = a, b
print(i + 1, n - i)
| 0 | null | 17,475,014,443,876 | 98 | 162 |
K, N = map(int, input().split())
A = list(map(int, input().split()))
distance = [0] * N
for i in range(N):
if not i == N-1:
distance[i] = A[i+1] - A[i]
else:
distance[N-1] = A[0] + (K - A[N-1])
distance.sort()
distance.pop()
print(sum(distance))
| import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()
h, w, k = na()
s = nsn(h)
ans = inf
for bits in range(2 ** (h - 1)):
binf = "{0:b}".format(bits)
res = sum([int(b) for b in binf])
divcnt = res + 1
cnt = [0] * divcnt
flag = True
j = 0
while j < w:
cur = 0
for i in range(h):
if (s[i][j] == '1'):
cnt[cur] += 1
if bits >> i & 1:
cur += 1
if max(cnt) > k:
if flag:
res = inf
break
res += 1
for i in range(divcnt):
cnt[i] = 0
flag = True
else:
flag = False
j += 1
ans = min(ans, res)
print(ans) | 0 | null | 45,862,443,479,170 | 186 | 193 |
n = int(input())
total = 0
for i in range(n):
a,b = map(int, input().split())
if a == b:
total += 1
if total == 3:
break
else:
total = 0
if total == 3:
print('Yes')
else:
print('No') | N=int(input())
ans=0
ke=0
for i in range(N):
D,E=map(int,input().split())
if D==E:
ans+=1
else:
ans=0
if ans>=3:
ke=1
if ke==1:
print("Yes")
else:
print("No") | 1 | 2,479,568,037,040 | null | 72 | 72 |
X, Y = map(int, input().split())
flag1 = (Y - 2 * X >= 0) and ((Y - 2 * X) % 2 == 0)
flag2 = (4 * X - Y >= 0) and ((4 * X - Y) % 2 == 0)
print("Yes" if flag1 and flag2 else "No")
| x, y = map(int, input().split())
a = []
for i in range(0, x+1):
a.append(2 * i + 4 * (x - i))
print("Yes" if y in a else "No") | 1 | 13,715,850,567,132 | null | 127 | 127 |
n = int(input())
dict = {0:1,1:1}
def fib(n):
if n in dict.keys():
return dict[n]
else:
dict[n] = fib(n-1) + fib(n-2)
return dict[n]
print(fib(n))
| def fib(n):
x=[1,1]
for i in range(n+1):
y=x[i]+x[i+1]
x.append(y)
print(x[n])
a=int(input())
fib(a)
| 1 | 1,774,100,132 | null | 7 | 7 |
import sys
input=sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
from collections import defaultdict
def main():
n=II()
A=LI()
X=defaultdict(int)
Y=defaultdict(int)
for i,v in enumerate(A):
X[i+v]+=1
Y[i-v]+=1
ans=0
for k,v in X.items():
ans+=v*Y[k]
print(ans)
if __name__=="__main__":
main()
| n = int(input())
a = [int(i) for i in input().split()]
ans = 0
dp = dict()
dm = dict()
for i,ai in enumerate(a):
dp[i+ai] = dp.get(i+ai,0)+1
dm[i-ai] = dm.get(i-ai,0)+1
for wa,i in dm.items():
ans += i*dp.get(wa,0)
print(ans)
| 1 | 26,047,084,725,930 | null | 157 | 157 |
s = input()
q = int(input())
#+---+---+---+---+---+---+
#| P | y | t | h | o | n |
#+---+---+---+---+---+---+
#0 1 2 3 4 5 6
#-6 -5 -4 -3 -2 -1
for i in range(0, q):
l = list(input().split())
a = int(l[1])
b = int(l[2]) + 1
if l[0] == "print":
print(s[a: b])
elif l[0] == "reverse":
rev = s[a: b]
rev = rev[::-1]
s = s[:a] + rev + s[b:]
else:
s = s[:a] + l[3] + s[b:]
| c = 0
while 1:
c += 1
t = int(input())
if t==0:
break
print("Case "+str(c)+":",t) | 0 | null | 1,268,894,823,742 | 68 | 42 |
S = input()
T = input()
count = 0
max_count = 0
for i in range(len(S) - len(T) +1):
for j in range(len(T)):
if S[i+j] == T[j]:
count += 1
if max_count <= count:
max_count = count
if j == (len(T) -1):
count = 0
print(len(T) - max_count)
| h1, m1, h2, m2, k = map(int, input().split())
h = h2 - h1
m = m2 - m1
m += 60 * h
print(m - k)
| 0 | null | 10,904,127,249,300 | 82 | 139 |
x = input().split()
a = int(x[0])
b = int(x[1])
if a <= 9 and b <= 9:
print(a * b)
else:
print('-1') | a=[input() for i in range(2)]
a1=[int(i) for i in a[0].split()]
a2=[int(i) for i in a[1].split()]
k=a1[1]
for i in range(a1[0]-a1[1]):
if a2[i]<a2[i+k]:
print("Yes")
else:
print("No") | 0 | null | 82,874,694,769,932 | 286 | 102 |
nums = input().split()
ab = [int(nums[0]), int(nums[1])]
cd = [int(nums[2]), int(nums[3])]
res = []
for i in ab:
for j in cd:
tmp = i * j
res.append(tmp)
print(max(res)) | a, b, c, d = map(int, input().split())
x = [a, min(a+1, b), max(a, b-1), b]
y = [c, min(c+1, d), max(c, d-1), d]
ans = -int(1e19)
for i in x:
for j in y:
ans = max(ans, i*j)
print(ans) | 1 | 3,019,205,743,192 | null | 77 | 77 |
n = int(input())
print(int(n/2)) if n%2 == 0 else print(int(n/2+1))
| # -*- coding: utf-8 -*-
def selection_sort(seq, l):
cnt = 0
for head_i in range(l):
flag = False
min_i = head_i
for target_i in range(head_i+1, l):
if seq[target_i] < seq[min_i]:
min_i = target_i
flag = True
if flag:
seq[head_i], seq[min_i] = seq[min_i], seq[head_i]
cnt += 1
print(' '.join([str(n) for n in seq]))
print(cnt)
def to_int(v):
return int(v)
def to_seq(v):
return [int(c) for c in v.split()]
if __name__ == '__main__':
l = to_int(input())
seq = to_seq(input())
selection_sort(seq, l) | 0 | null | 29,662,740,860,300 | 206 | 15 |
n,k=map(int,input().split())
A=[int(input()) for i in range(n)]
def track_num(n):
cnt,track=0,1
for i in A:
if cnt+i>n:
track +=1
cnt=i
else:
cnt +=i
return track
def Binaryserch():
left,right=max(A),sum(A)+1
ans=0
while left<right:
mid=(left+right)//2
track=track_num(mid)
if track<=k:
ans=mid
right=mid
elif track>k:
left=mid+1
return ans
print(Binaryserch())
| H,W,K = map(int,input().split())
S = [input() for _ in range(H)]
ans = 10**10
for i in range(2**(H-1)): # iはbit
rel = [0 for h in range(H)]
a,b = 0,0
for h in range(H-1):
if i>>h&1:
b += 1
rel[h+1] = b
a += b
cnt = [0 for j in range(b+1)]
for w in range(W):
for h in range(H):
if S[h][w] == '1':
cnt[rel[h]] += 1
OK = True
for j in range(b+1):
if cnt[j] > K:
OK = False
break
if OK:
continue
a += 1
cnt = [0 for j in range(b+1)]
for h in range(H):
if S[h][w] == '1':
cnt[rel[h]] += 1
OK2 = True
for j in range(b+1):
if cnt[j] > K:
OK2 = False
break
if OK2:
continue
a = 10**10
break
ans = min(ans,a)
print(ans)
| 0 | null | 24,259,576,086,112 | 24 | 193 |
import sys
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(", ")
N = int(sys.stdin.readline().rstrip())
print(A[N-1])
| 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])
| 1 | 50,022,557,458,052 | null | 195 | 195 |
h, w, k = map(int, input().split())
c = [0] * h
for i in range(h):
c[i] = input()
ans = 0
for rows in range(1 << h):
for cols in range(1 << w):
b_cnt = 0
for _h in range(h+1):
if not (rows >> _h) & 1:
continue
for _w in range(w+1):
if not (cols >> _w) & 1:
continue
if c[_h][_w] == '#':
b_cnt += 1
if b_cnt == k:
ans += 1
print(ans) | if __name__ == "__main__":
for num1 in range(0, 9):
for num2 in range(0, 9):
print(str(num1 + 1) + "x" + str(num2 + 1) + "=" + str((num1 + 1) * (num2 + 1))) | 0 | null | 4,442,487,634,256 | 110 | 1 |
N,K=map(int,input().split())
A=sorted(map(int,input().split()))
M=10**9+7
t,b=A[K-1]-A[N-K],1
for i in range(1,N-K+1):
b=(b*(K-1+i)*pow(i,M-2,M))%M
t=(t+b*(A[K-1+i]-A[N-K-i]))%M
print(t)
| A1, A2, A3 = map(int, input().split())
print("bust") if (A1+A2+A3)>=22 else print("win") | 0 | null | 107,592,815,607,062 | 242 | 260 |
s = input()
a = [-1] * (len(s) + 1)
if s[0] == "<":
a[0] = 0
if s[-1] == ">":
a[-1] = 0
for i in range(len(s) - 1):
if s[i] == ">" and s[i + 1] == "<":
a[i + 1] = 0
for i in range(len(a)):
if a[i] == 0:
l = i - 1
while 0 <= l - 1:
if s[l] == ">" and s[l - 1] == ">":
a[l] = a[l + 1] + 1
else:
break
l -= 1
r = i + 1
while r + 1< len(a):
if s[r - 1] == "<" and s[r] == "<":
a[r] = a[r - 1] + 1
else:
break
r += 1
for i in range(len(a)):
if a[i] == -1:
if i == 0:
a[i] = a[i + 1] + 1
elif i == len(a) - 1:
a[i] = a[i - 1] + 1
else:
a[i] = max(a[i - 1], a[i + 1]) + 1
ans = sum(a)
print(ans) | s = input()
x = 0
l = [0] * len(s)
for i in range(len(s)):
if s[i] == "<":
x += 1
l[i] = x
else:
x = 0
x = 0
r = [0] * len(s)
for i in range(len(s))[::-1]:
if s[i] == ">":
x += 1
r[i] = x
else:
x = 0
ans = l[-1] + r[0]
for i in range(len(s)-1):
ans += max(l[i], r[i+1])
print(ans) | 1 | 156,295,737,721,718 | null | 285 | 285 |
def main():
s = input()
if s == 'ABC':
print('ARC')
else:
print('ABC')
if __name__ == "__main__":
main()
| s = raw_input()
if s == "ARC":
print "ABC"
else:
print "ARC" | 1 | 24,022,719,515,116 | null | 153 | 153 |
n = int(input())
l = list(map(int, input().split()))
edge = [0 for x in range(n)]
if l[0] != 0:
print(0)
exit()
for i in l:
edge[i]+=1
ans = 1
for i in range(1, n):
ans *= edge[l[i] - 1]
ans %= 998244353
print(ans)
| N = int(input())
D = list(map(int,input().split()))
if D[0] != 0:
print(0)
exit()
from collections import Counter
ctr = Counter(D)
if ctr[0] > 1:
print(0)
exit()
MOD = 998244353
ans = 1
for i in range(len(ctr)-1):
ans *= pow(ctr[i], ctr[i+1], MOD)
ans %= MOD
print(ans) | 1 | 154,928,213,186,724 | null | 284 | 284 |
h = int(input())
w = int(input())
n = int(input())
m = max(w,h)
if n > n //m * m:
ans = n // m + 1
else:
ans = n // m
print(ans) | h, w, n= [int(input()) for i in range(3)]
k = max(h, w)
ans = (n+k-1)//k
print(ans) | 1 | 88,768,982,250,144 | null | 236 | 236 |
n, m = map(int, input().split())
c = [int(i) for i in input().split()]
dp = [[-1 for _ in range(m + 1)] for _ in range(n + 1)]
for i in range(1, n + 1):
dp[i][1] = i
for j in range(1, m + 1):
dp[0][j] = 0
# dp[1][j] = 1
for i in range(n + 1):
for j in range(1, m):
if c[j] > i:
dp[i][j + 1] = dp[i][j]
else:
dp[i][j + 1] = min(dp[i][j], dp[i - c[j]][j + 1] + 1)
print(dp[n][m])
| # import sys
# input = sys.stdin.readline
import collections
def main():
n, m = input_list()
Friend = [[] for i in range(n+1)]
for _ in range(m):
a, b = input_list()
Friend[a].append(b)
Friend[b].append(a)
Flag = [False for i in range(n+1)]
ans = 1
for i in range(1, n+1):
if Flag[i]:
continue
q = collections.deque()
q.append(i)
cnt = 1
while q:
st = q.popleft()
Flag[st] = True
for j in Friend[st]:
if Flag[j]:
continue
cnt += 1
Flag[j] = True
q.append(j)
ans = max(ans, cnt)
print(ans)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()))
if __name__ == "__main__":
main()
| 0 | null | 2,025,136,070,010 | 28 | 84 |
N, K = map(int, input().split())
ans = 0
for h in list(map(int, input().split())):
ans += (h >= K)
print(ans)
| n,k=map(int,input().split())
h=list(map(int,input().split()))
res=0
for i in range(n):
res += (h[i] >= k)
print(res) | 1 | 178,917,293,275,296 | null | 298 | 298 |
n,k = map(int,input().split())
mod = 10**9+7
ans = 0
kosu = [0 for i in range(k+1)]
for i in range(k, 0, -1):
kin = 1 ## kosuに入れる数
nn = k//i ## iの倍数が何個あるかを計算する
ii = n
kini = nn
while ii > 0:
if ii%2 == 1:
kin = (kin*kini)%mod
kini = (kini**2)%mod
ii //= 2
for j in range(2,nn+1):
kin = (kin-kosu[j*i])%mod
kosu[i] = kin
for i in range(1,k+1):
ans = (ans+(kosu[i]*i)%mod)%mod
print(ans)
| import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
ans = [0 for _ in range(n)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = pow(x, 2) + pow(y, 2) + pow(z, 2) + x * y + y * z + z * x
if tmp > n:
break
# if x == y == z:
# ans[tmp - 1] = 1
# elif x == y or y == z or z == x:
# ans[tmp - 1] = 3
# else:
# ans[tmp - 1] = 6
ans[tmp - 1] += 1
for v in ans:
print(v)
if __name__ == '__main__':
main()
| 0 | null | 22,475,950,694,178 | 176 | 106 |
import math
x1, y1, x2, y2 = map(float, input().split())
x = x2 - x1
y = y2 - y1
result = x**2 + y**2
print(math.sqrt(result)) | N = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(N):
mini = i
for j in range(i, N):
if A[j] < A[mini]:
mini = j
if i != mini:
A[i], A[mini] = A[mini], A[i]
count += 1
print(*A)
print(count) | 0 | null | 86,155,107,800 | 29 | 15 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
A = [LI() for _ in range(3)]
N = I()
flag = [[0]*3 for _ in range(3)]
for i in range(N):
b = I()
for j in range(3):
for k in range(3):
if A[j][k] == b:
flag[j][k] = 1
for i in range(3):
if flag[i][0] == flag[i][1] == flag[i][2] == 1 or flag[0][i] == flag[1][i] == flag[2][i] == 1:
print('Yes')
exit()
if flag[0][0] == flag[1][1] == flag[2][2] == 1 or flag[0][2] == flag[1][1] == flag[2][0] == 1:
print('Yes')
exit()
print('No')
| def main():
A = [list(map(int,input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for _ in range(N)]
for i in range(N):
for j in range(3):
for h in range(3):
if A[j][h] == b[i]:
A[j][h] = 0
if A[0][0]==0 and A[0][1]==0 and A[0][2]==0:
return 'Yes'
elif A[1][0]==0 and A[1][1]==0 and A[1][2]==0:
return 'Yes'
elif A[2][0]==0 and A[2][1]==0 and A[2][2]==0:
return 'Yes'
elif A[0][0]==0 and A[1][0]==0 and A[2][0]==0:
return 'Yes'
elif A[0][1]==0 and A[1][1]==0 and A[2][1]==0:
return 'Yes'
elif A[0][2]==0 and A[1][2]==0 and A[2][2]==0:
return 'Yes'
elif A[0][0]==0 and A[1][1]==0 and A[2][2]==0:
return 'Yes'
elif A[0][2]==0 and A[1][1]==0 and A[2][0]==0:
return 'Yes'
return ('No')
print(main())
| 1 | 60,177,896,102,438 | null | 207 | 207 |
import sys
import math
n, k = map(int, sys.stdin.readline().split())
W = []
for _ in range(n):
w = int(sys.stdin.readline())
W.append(w)
r = sum(W)
l = max(W)
pre_p = 0
while l < r:
current = 0
num_tracks = 1
p = (l + r) // 2 # 値を設定
# 積み込めるか確認
for w in W:
if current + w > p:
num_tracks += 1 # 次のトラックを持ってくる
current = w
else:
current += w
if num_tracks > k: # 現在の p ではトラックが足りない場合
l = p + 1 # 最少値を上げる
else:
r = p # 最大値を下げる
print(l)
| def check(p):
s = w[0]
track = 1
for i in range(1, n):
if s + w[i] <= p:
s += w[i]
else:
track += 1
if track > k: return False
s = w[i]
return True
n, k = [int(i) for i in input().split()]
w = []
for i in range(n):
w.append(int(input()))
L = max(w)
R = sum(w)
if check(L):
print(L)
else:
while L + 1 < R:
M = (L + R) // 2
if check(M):
R = M
else:
L = M
print(R) | 1 | 84,728,129,388 | null | 24 | 24 |
import sys
from bisect import *
from collections import deque
pl=1
#from math import *
from copy import *
#sys.setrecursionlimit(10**6)
if pl:
input=sys.stdin.readline
else:
sys.stdin=open('input.txt', 'r')
sys.stdout=open('outpt.txt','w')
def li():
return [int(xxx) for xxx in input().split()]
def fi():
return int(input())
def si():
return list(input().rstrip())
def mi():
return map(int,input().split())
def find(i):
if i==a[i]:
return i
a[i]=find(a[i])
return a[i]
def union(x,y):
xs=find(x)
ys=find(y)
if xs!=ys:
if rank[xs]<rank[ys]:
xs,ys=ys,xs
rank[xs]+=1
a[ys]=xs
t=1
while t>0:
t-=1
n,m=mi()
a=[i for i in range(n+1)]
rank=[0 for i in range(n+1)]
for i in range(m):
x,y=mi()
union(x,y)
s=set()
for i in range(1,n+1):
a[i]=find(i)
s.add(a[i])
print(len(s)-1)
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x]
def union(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n, m = LI()
par = [i for i in range(n)]
rank = [0] * n
for _ in range(m):
a, b = LI()
if root(a-1) != root(b-1):
union(a-1, b-1)
s = set()
for i in range(n):
s.add(root(i))
ans = len(s)-1
print(ans) | 1 | 2,273,199,158,240 | null | 70 | 70 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
class modint():#add:和,mul:積,pow:累乗,div:商(modと互いに素であること)
def __init__(self,x,mod=1000000007): self.x, self.mod=x, mod
def add(self,a): self.x=(self.x+a%self.mod)%self.mod
def mul(self,c): self.x=(self.x*(c%self.mod))%self.mod
def pow(self,p): self.x=pow(self.x,p,self.mod)
def div(self,d):
u,v,a,b=1,0,d,self.mod
while b:
t=a//b
a-=t*b
a,b,u,v=b,a,v,u-t*v
if a!=1: print("not 素")
self.x=(self.x*(u%self.mod))%self.mod
def main():
mod = 1000000007
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
N = int(input())
#N, K = map(int, input().split())
#A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
d=dict()
m=10**18+100
for i in range(N):
A, B = map(int, input().split())
if A==0 and B==0:
d[-m]=d.get(-m,0)+1
elif B==0:
d[m]=d.get(m,0)+1
elif A==0:
d[0]=d.get(0,0)+1
else:
sa=sb=1
if A<0:
sa=-1
A*=-1
if B<0:
sb=-1
B*=-1
g=math.gcd(A,B)
A=A//g
B=B//g
if sa==-1 and sb==-1:
t=(A,B)
elif sb==-1:
t=(-A,B)
else:
t=(sa*A,sb*B)
d[t]=d.get(t,0)+1
#print(d)
ks=set(d.keys())
alis=[]
tot=modint(1)
for i, k in enumerate(ks):
if d[k]==-1.0:
continue
if k==-m:
continue
if k==m:
ik=0
elif k==0:
ik=m
elif k[0]<0:
ik=(k[1],-k[0])
else:
ik=(-k[1],k[0])
#print(ik)
if ik in ks:
d1,d2=d[k],d[ik]
tot.mul((pow(2,d1,mod)-1)+(pow(2,d2,mod)-1)+1)
d[ik]=-1
else:
tot.mul(pow(2,d[k],mod))
tot.add(-1)
tot.add(d.get(-m,0))
print(tot.x)
if __name__ == "__main__":
main() | A,B=map(int,input().split())
if A>=10 or B>=10:
print('-1')
else:
print(A*B) | 0 | null | 89,568,014,865,992 | 146 | 286 |
readline = open(0).readline
write = open(1, 'w').write
while 1:
x = readline()
if x == "0\n":
break
write("%d\n" % sum(map(int, x.strip())))
| X = []
while True:
x = raw_input()
if x == "0":
break
else:
X.append(x)
ans = []
for i in range(len(X)):
tmp = 0
for j in range(len(X[i])):
tmp+=int(X[i][j])
ans.append(tmp)
for char in ans:
print char
| 1 | 1,587,484,074,890 | null | 62 | 62 |
import sys
n=int(input())
s=input()
if n%2==1:
print("No")
sys.exit()
else:
s1=s[:n//2]
s2=s[n//2:]
# print(s1,s2)
if s1==s2:
print("Yes")
else:
print("No") | n=int(input())
s=input()
s1=n//2
ans="No"
if n&1!=1:
if s[:s1]==s[s1:]:
ans="Yes"
print(ans) | 1 | 146,768,163,152,442 | null | 279 | 279 |
tmp = map(int, raw_input().split())
tmp.sort()
for i in tmp:
print i,
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, a, b = na()
if a == 0:
print(0)
else:
print((n//(a+b))*a + min(n%(a+b), a)) | 0 | null | 28,206,700,379,282 | 40 | 202 |
from collections import deque
n = int(input())
a = deque()
for i in range(n):
c = input()
if c == "deleteFirst":
a.popleft()
elif c == "deleteLast":
a.pop()
else:
c, v = c.split()
if c == "insert":
a.appendleft(v)
else:
try:
a.remove(v)
except:
pass
print(" ".join(a))
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
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
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
comb = Combination(n_max=10 ** 5)
ans = 0
for i in range(N - K + 1):
ans -= comb(N - 1 - i, K - 1) * A[i] % MOD
ans += comb(N - 1 - i, K - 1) * A[N - i - 1] % MOD
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 48,054,411,489,040 | 20 | 242 |
import math
a, b, c = map(int, input().split())
c = math.radians(c)
S = 1 / 2 * (a * b * math.sin(c))
c2 = math.sqrt(a*a + b*b - 2*a*b*math.cos(c))
H = a + b + c2
h = b * math.sin(c)
print(S,H,h)
| import sys
def compoundInterest(x, i, n):
if n == 0:
return x
ans = int(x * (1 + i))
hasu = ans % 1000
if hasu != 0:
ans -= hasu
ans += 1000
return compoundInterest(ans, i, n-1)
if __name__ == "__main__":
n = int(input())
ans = compoundInterest(100000, 0.05, n)
print (ans) | 0 | null | 83,707,037,410 | 30 | 6 |
S = input()
print('ARC' if S[1]=='B' else 'ABC') | N,K = list(map(int,input().split()))
MOD = 10**9+7
arr = [pow(K//i, N, MOD) for i in range(1,K+1)]
for i in range(K//2,0,-1):
arr[i-1] -= sum(arr[2*i-1:K:i]) % MOD
arr[i-1] %= MOD
arr = [(i+1)*j%MOD for i,j in enumerate(arr)]
print(sum(arr)%MOD) | 0 | null | 30,569,641,441,440 | 153 | 176 |
A,B,C = map(int,input().split())
ans = "No"
if A == B and A != C:
ans = "Yes"
elif B == C and B != A:
ans = "Yes"
elif C == A and C != B:
ans = "Yes"
print(ans) | from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = li()
N = []
N.append(n[0])
for i in range(1,3,1):
if n[i] in N: continue
N.append(n[i])
if len(N) == 2:
print('Yes')
else:
print('No') | 1 | 67,952,075,747,960 | null | 216 | 216 |
from sys import stdin
from collections import deque
n = int(input())
d = [-1] * (n + 1)
def bfs():
d[1] = 0
dq = deque([1])
while len(dq) != 0:
v = dq.popleft()
for c in G[v]:
if d[c] != -1 : continue
d[c] = d[v] + 1
dq.append(c)
for i, x in enumerate(d[1:], start=1):
print(i, x)
G = [0] + [list(map(int, input().split()[2:])) for i in range(n)]
bfs() | import math
while True:
try:
n=input()
x=100000
for i in xrange(n):
x=math.ceil(x*1.05/1000)*1000
print(int(x))
except EOFError: break | 0 | null | 2,761,658,000 | 9 | 6 |
import collections
def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]
def main():
H, W, K = ZZ()
C = [input() for _ in range(H)]
atode = collections.deque()
last = -1
cakeId = 0
output = [[0] * W for _ in range(H)]
for i in range(H):
if not '#' in C[i]:
atode.append(i)
continue
ichigo = []
last = i
for j in range(W):
if C[i][j] == '#': ichigo.append(j)
itr = 0
for j in ichigo:
cakeId += 1
while itr <= j:
output[i][itr] = cakeId
itr += 1
while itr < W:
output[i][itr] = cakeId
itr += 1
while atode:
j = atode.popleft()
for k in range(W): output[j][k] = output[i][k]
while atode:
j = atode.popleft()
for k in range(W): output[j][k] = output[last][k]
for i in range(H): print(*output[i])
return
if __name__ == '__main__':
main()
| # C - Go to School
N = int(input())
A = list(map(int,input().split()))
A = [(i+1,A[i]) for i in range(N)]
A.sort(key=lambda x:x[1])
A = [str(a[0]) for a in A]
print(' '.join(A)) | 0 | null | 162,475,973,891,722 | 277 | 299 |
if __name__ == "__main__":
n, k = map(int, input().split())
p = 10**9 + 7
answer = 0
nCi = 1
n_1Ci = 1
for i in range(min(k + 1, n)):
answer += nCi * n_1Ci
answer %= p
deno = pow(i + 1, p - 2, p)
nCi *= (n - i) * deno
nCi %= p
n_1Ci *= (n - i - 1) * deno
n_1Ci %= p
print(answer)
| n, k = map(int, input().split())
MOD = 10**9+7
def prepare(n, MOD):
facts = [1]*(n+1)
for i in range(1, n+1):
facts[i] = facts[i-1]*i%MOD
invs = [1]*(n+1)
_invs = [1]*(n+1)
invs[n] = pow(facts[n], MOD-2, MOD)
for i in range(0, n)[::-1]:
invs[i] = invs[i+1] * (i+1) % MOD
return facts, invs
ans = 0
facts, invs = prepare(n, MOD)
for i in range(1+min(n-1, k)):
ans += facts[n]*invs[i]*invs[n-i]*facts[n-1]*invs[n-i-1]*invs[i]
ans %= MOD
print(ans)
| 1 | 67,077,876,463,850 | null | 215 | 215 |
import math
from functools import reduce
from collections import deque
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,k,*aaa = get_all_int()
# log(aaa)
ruiseki = [0] * (n+1)
for i,a in enumerate(aaa):
ruiseki[i+1] = (ruiseki[i] + a - 1) % k
count = {}
ans = 0
for right in range(len(ruiseki)):
x = ruiseki[right]
# log(x, count.get(x, 0), count)
count[x] = count.get(x, 0) + 1
if right >= k:
y = ruiseki[right-k]
count[y] -= 1
ans += count.get(x, 0) - 1
print(ans)
| import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
nums = [i for i in range(n+1)]
sums = [0]
ans = 0
x = 10**9 + 7
for i in range(n):
sums.append(nums[i+1]+sums[i])
for j in range(k, len(nums)+1):
if j == len(nums):
ans += 1
else:
ans += sums[-1] - sums[-(1+j)] - sums[j-1] + 1
print(ans%x)
if __name__ == '__main__':
main() | 0 | null | 85,158,443,037,788 | 273 | 170 |
import math
n=int(input())
r1=math.ceil(n/1.08)
r2=(n+1)/1.08
if r1<r2:
print(r1)
else:
print(":(")
| n = int(input())
for i in range(1,50000):
if int(i*1.08)==n:
print(i)
exit()
else:
print(":(")
| 1 | 126,336,909,548,704 | null | 265 | 265 |
def resolve():
N = int(input())
A = list(map(int, input().split()))
import collections
counter = collections.Counter(A)
total = 0
for k, v in counter.items():
total += v*(v-1)//2
for a in A:
cnt = counter[a]
cntm1 = cnt - 1
print(total - cnt*(cnt-1)//2 + cntm1*(cntm1-1)//2)
if '__main__' == __name__:
resolve() | while True:
try:print(len(str(sum(map(int,input().split())))))
except:break
| 0 | null | 23,940,226,490,752 | 192 | 3 |
K = int(input())
S = input()
MAX = 2020202
MOD = 10**9 + 7
fac = [0]*MAX
facinv = [0]*MAX
inv = [0]*MAX
def modinv(a, mod):
b = mod
x, u = 1, 0
while b:
q = a//b
a, b = b, a-q*b
x, u = u, x-q*u
x %= mod
return x
def mod_nCr_init(n, mod):
fac[0] = fac[1] = 1
facinv[0] = facinv[1] = 1
inv[1] = 1
for i in range(2, n):
fac[i] = fac[i-1] * i % mod
inv[i] = -inv[mod % i] * (mod // i) % mod
facinv[i] = facinv[i-1] * inv[i] % mod
def mod_nCr(n, r, mod):
if n < r or n < 0 or r < 0:
return 0
return fac[n] * (facinv[r] * facinv[n-r] % mod) % mod
mod_nCr_init(MAX, MOD)
ns = len(S)
ans = 0
for i in range(K+1):
x = pow(26, i, MOD)
x *= pow(25, K-i, MOD)
x %= MOD
x *= mod_nCr(ns+K-i-1, ns-1, MOD)
ans += x
ans %= MOD
print(ans)
| s = int(input())
h = s // 3600
s = s % 3600
m = s // 60
s = s % 60
print("%d:%d:%d" % (h,m,s))
| 0 | null | 6,520,816,340,350 | 124 | 37 |
n,m = list(map(int,input().split()))
A = [map(int,input().split()) for i in range(n)]
b = [int(input()) for i in range(m)]
for a in A:
print(sum([x*y for (x,y) in zip(a,b)])) | n,m = map(int,input().split())
#行列a、ベクトルb、行列積cの初期化
a = [0 for i in range(n)]
b = [0 for j in range(m)]
c = []
#a,bの読み込み
for i in range(n):
a[i] = input().split()
a[i] = [int(x) for x in a[i]]
for j in range(m):
b[j] = int(input())
#行列積計算
temp = 0
for i in range(n):
for j in range(m):
temp += a[i][j]*b[j]
c.append(temp)
temp = 0
#結果の表示
for num in c:print(num)
| 1 | 1,155,003,864,280 | null | 56 | 56 |
import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:-1])
else:
if' '==e[6]:
m=e[7:-1]
if m in d:d.remove(m)
elif len(e)%2:d.pop()
else:d.popleft()
print(*d)
s()
| from sys import stdin
n = int(stdin.readline())
q = []
bottom = 0
for i in range(n):
cmd = stdin.readline()[:-1]
if cmd[0] == 'i':
q.append(cmd[7:])
elif cmd[6] == ' ':
try:
q.pop(~q[::-1].index(cmd[7:]))
except:
pass
elif cmd[6] == 'F':
q.pop()
else:
bottom += 1
print(' '.join(q[bottom:][::-1])) | 1 | 50,919,227,060 | null | 20 | 20 |
n = int(raw_input())
debt=100000
for i in range(n):
debt*=1.05
if debt % 1000 != 0:
debt = (int(debt / 1000)+1) * 1000
else:
debt = int(debt)
print debt | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
n = int(sys.stdin.readline())
debt = 100000
for i in range(n):
debt += debt // 20
fraction = debt % 1000
if fraction > 0:
debt += 1000 - fraction
print(debt) | 1 | 1,299,943,940 | null | 6 | 6 |
def main():
n = int(input())
a_lst = list(map(int, input().split()))
number = 1
count = 0
for i in range(n):
if a_lst[i] == number:
number += 1
else:
count += 1
if 1 not in a_lst:
count = -1
print(count)
if __name__ == '__main__':
main() | n=int(input())
a=list(map(int,input().split()))[::-1]
number=2
if 1 not in a: print(-1);exit()
count=n-len(a[:a.index(1)+1])
a=a[:a.index(1)][::-1]
for i in a:
if i==number:
number+=1
else:
count+=1
print(count) | 1 | 114,458,172,119,196 | null | 257 | 257 |
N,K = map(int,input().split())
counter = 0
for k in range(K,N+2):
counter += k*(N-k+1) + 1
print(counter%(pow(10,9)+7)) | N, K = map(int, input().split())
heights = list(map(int, input().split()))
qualified = 0
for height in heights:
if height >= K:
qualified += 1
print(qualified)
| 0 | null | 106,169,888,093,792 | 170 | 298 |
n=int(input())
suit = ["S","H","C","D"]
card = {i:[] for i in suit}
for i in range(n):
tmp = ([c for c in input().split()])
card[tmp[0]].append(tmp[1])
for i in suit:
for j in range(1,14):
if not (str(j) in card[i]):
print("%s %s" % (i,j)) | # ABC 147 D
N=int(input())
A=list(map(int,input().split()))
res=0
p=10**9+7
bits=[0]*71
for a in A:
j=0
while a>>j:
if (a>>j)&1:
bits[j]+=1
j+=1
t=0
n=70
while n>=0:
if bits[n]!=0:
break
n-=1
for a in A:
j=0
while j<=n:
if (a>>j)&1:
res+=((2**j)*(N-bits[j]))%p
else:
res+=((2**j)*bits[j])%p
j+=1
t=res
print((res*500000004)%p) | 0 | null | 61,896,687,233,498 | 54 | 263 |
n=int(input())
a=list(map(int,input().split()))
ans = []
for i in range(n):
ans.append(0)
for i in range(n):
ans[a[i]-1] = i +1
for i in range(len(ans)):
print(ans[i], end=" ") | n = int(input())
A = list(map(int, input().split()))
N = sorted(range(1, n + 1), key=lambda x: A[x - 1])
print(*N) | 1 | 180,337,258,753,792 | null | 299 | 299 |
def calc():
# 入力
a = int(input())
# 計算処理
result = 0
for i in range(1,4):
result += a ** i
# 出力
print(result)
calc() | from math import *
def main():
n = int(input())
print(n+n**2+n**3)
main() | 1 | 10,174,261,800,340 | null | 115 | 115 |
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 18 09:48:56 2017
@author: syaga
"""
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
num = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
temp = A[i]
A[i] = A[minj]
A[minj] = temp
if minj != i:
num += 1
print(" ".join(map(str, A)))
print(num) | X = int(input())
for i in range(1000):
if 100 * i <= X and X <= 105 * i:
print(1)
break
else:
print(0)
| 0 | null | 63,594,013,849,278 | 15 | 266 |
# Transformation
string = input()
commandAmount = int(input())
for i in range(commandAmount):
command = input().rstrip().split()
start = int(command[1])
end = int(command[2])
if command[0] == 'print':
print(string[start : end + 1]) # ここはコメントアウトしないこと
elif command[0] == 'reverse':
replacedString = list(string)
# print(replacedString)
for i in range(start, end + 1):
replacedString[i] = list(string)[start + end - i]
# print(replacedString)
string = ''.join(replacedString)
elif command[0] == 'replace':
string = list(string)
replace = list(command[3])
for i in range(start, end + 1):
string[i] = replace[i - start]
string = ''.join(string)
| s = input()
n = int(input())
for i in range(n):
c = input().split()
a = int(c[1])
b = int(c[2])
if "replace" in c:
s = s[:a] + c[3] + s[b+1:]
if "reverse" in c:
u = s[a:b+1]
s = s[:a] + u[:: -1] +s[b + 1:]
if "print" in c:
print(s[a:b+1], sep = '')
| 1 | 2,114,960,907,168 | null | 68 | 68 |
N=list(map(int,input().split()))
ans=0
for x in range(2):
if N[x]==0 or N[x]==1:
pass
else:
ans += N[x]*(N[x]-1)/2
print(int(ans)) | import sys
input = lambda: sys.stdin.readline().rstrip()
def solve():
n = len(input())
ans = 'x' * n
print(ans)
if __name__ == '__main__':
solve()
| 0 | null | 59,073,544,140,312 | 189 | 221 |
x = int(input())
def sanjo(x):
return x**3
print(sanjo(x)) | def abc144_e():
import numpy as np
N, K = map(int, input().split())
A = np.array(input().split(), dtype=np.int64)
F = np.array(input().split(), dtype=np.int64)
A = np.sort(A)
F = np.sort(F)[::-1]
low = -1
up = 10**12
while up - low > 1:
v = (up + low) // 2
x = A - v // F
if x[x > 0].sum() > K:
low = v
else:
up = v
print(up)
if __name__ == '__main__':
abc144_e() | 0 | null | 82,710,634,095,552 | 35 | 290 |
from collections import deque
def solve():
N = int(input())
XY= [[]]
for _ in range(N):
A = int(input())
xylist = []
for __ in range(A):
x, y = map(int, input().split())
xylist.append([x,y])
XY.append(xylist)
ans = 0
for bit in range(2 ** N):
honestset = set()
unhonestset = set()
for i in range(N):
if ((bit >> i) & 1) == 1:
honestset.add(i+1)
else:
unhonestset.add(i+1)
before = 100
before_un = 100
while (before != len(honestset) or before_un != len(unhonestset)):
before = len(honestset)
before_un = len(unhonestset)
tmp = list(honestset)
for x in tmp:
for xin, yin in XY[x]:
if yin == 1:
honestset.add(xin)
else:
unhonestset.add(xin)
if len(honestset & unhonestset) == 0:
ans = len(honestset) if ans < len(honestset) else ans
print(ans)
if __name__ == '__main__':
solve()
| n = int(input())
statements = []
for i in range(n):
a = int(input())
astates = [list(map(int, input().split())) for _ in range(a)]
statements.append(astates)
cnt = 0
for i in range(2**n):
state = format(i, "0"+str(n)+"b")
pos = True
for j in range(n):
if state[j] == "1":
for x, y in statements[j]:
if not (state[x-1] == str(y)):
pos = False
break
if not pos:
break
if pos:
cnt = max(cnt, state.count("1"))
print(cnt) | 1 | 121,930,642,362,620 | null | 262 | 262 |
import sys
h, w, m = map(int, input().split(' '))
H = [0 for _ in range(h+1)]
W = [0 for _ in range(w+1)]
bomb = set()
for m in range(m):
i, j = map(int, input().split(' '))
bomb.add((i, j))
H[i] += 1
W[j] += 1
max_h = max(H)
max_w = max(W)
target_h = [i for i, v in enumerate(H) if v == max_h]
target_w = [i for i, v in enumerate(W) if v == max_w]
for m in target_h:
for n in target_w:
if (m, n) not in bomb:
print(max_h + max_w)
sys.exit()
print(max_h + max_w - 1) | N = int(input())
S, T = input().split()
str_list = []
for i in range(N):
str_list += S[i], T[i]
print("".join(str_list)) | 0 | null | 58,514,978,692,940 | 89 | 255 |
n_ = 2 * 10**6 + 5
mod = 10**9 + 7
fun = [1] * (n_ + 1)
for i in range(1, n_ + 1):
fun[i] = fun[i - 1] * i % mod
rev = [1] * (n_ + 1)
rev[n_] = pow(fun[n_], mod - 2, mod)
for i in range(n_ - 1, 0, -1):
rev[i] = rev[i + 1] * (i + 1) % mod
def nCr(n, r):
if r > n:
return 0
return fun[n] * rev[r] % mod * rev[n - r] % mod
def modinv(x, mod):
a, b = x, mod
u, v = 1, 0
while b:
t = a // b
a -= t * b
a, b = b, a
u -= t * v
u, v = v, u
return u % mod
inv26 = modinv(26, mod)
K = int(input())
S = input()
M = len(S)
ans = 0
po = 1
poo = pow(26, K, mod)
for i in range(K+1):
ans = (ans + po * poo % mod * nCr(i+M-1, i)) % mod
po = po * 25 % mod
poo = poo * inv26 % mod
print(ans)
| import sys
def input(): return sys.stdin.readline().rstrip()
def ctoi(c):
return ord(c)-97
class BIT:
def __init__(self, n):
self.unit_sum=0 # to be set
self.n=n
self.dat=[0]*(n+1)#[1,n]
def add(self,a,x): #a(1-)
i=a
while i<=self.n:
self.dat[i]+=x
i+=i&-i
def sum(self,a,b=None):
if b!=None:
return self.sum(b-1)-self.sum(a-1) #[a,b) a(1-),b(1-)
res=self.unit_sum
i=a
while i>0:
res+=self.dat[i]
i-=i&-i
return res #Σ[1,a] a(1-)
def __str__(self):
self.ans=[]
for i in range(1,self.n):
self.ans.append(self.sum(i,i+1))
return ' '.join(map(str,self.ans))
def main():
n=int(input())
S=list(input())
q=int(input())
BIT_tree=[]
for i in range(26):
obj=BIT(n+1)
BIT_tree.append(obj)
for i in range(n):
BIT_tree[ctoi(S[i])].add(i+1,1)
for _ in range(q):
query=input().split()
if query[0]=="1":
index,x=int(query[1])-1,query[2]
BIT_tree[ctoi(S[index])].add(index+1,-1)
BIT_tree[ctoi(x)].add(index+1,1)
S[index]=x
else:
l,r=int(query[1])-1,int(query[2])-1
ans=0
for c in range(26):
if BIT_tree[c].sum(l+1,r+2):
ans+=1
print(ans)
if __name__=='__main__':
main() | 0 | null | 37,828,630,428,612 | 124 | 210 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.