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
|
|---|---|---|---|---|---|---|
import sys,math,collections
from collections import defaultdict
#from itertools import permutations,combinations
def file():
sys.stdin = open('input.py', 'r')
sys.stdout = open('output.py', 'w')
def get_array():
l=list(map(int, input().split()))
return l
def get_2_ints():
a,b=map(int, input().split())
return a,b
def get_3_ints():
a,b,c=map(int, input().split())
return a,b,c
def sod(n):
n,c=str(n),0
for i in n:
c+=int(i)
return c
def getFloor(A, x):
(left, right) = (0, len(A) - 1)
floor = -1
while left <= right:
mid = (left + right) // 2
if A[mid] == x:
return A[mid]
elif x < A[mid]:
right = mid - 1
else:
floor = A[mid]
left = mid + 1
return floor
#file()
def main():
l,r,n=get_3_ints()
c=0
for i in range(min(l,r),max(l,r)+1):
#print(i)
if(i%n==0):
c+=1
print(c)
if __name__ == '__main__':
main()
| a = input()
b, c, d = [int(x) for x in a.split()]
x = [x for x in range(b, c + 1) if x % d == 0]
print(len(x)) | 1 | 7,566,803,940,192 | null | 104 | 104 |
n = int(input())
st = [input().split() for _ in range(n)]
x = input()
s,t = zip(*st)
print(sum(int(t[i]) for i in range(s.index(x)+1,n)))
| #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return input().split()
def S(): return input().rstrip()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n = II()
st = LSR(n)
x = S()
ans = 0
te = 0
for s, t in st:
if te:
ans += int(t)
if s == x:
te = 1
print(ans)
return
#main
if __name__ == '__main__':
solve()
| 1 | 97,150,609,985,638 | null | 243 | 243 |
import math
a, b, x = [int(n) for n in input().split()]
v = a**2 * b /2
#print(v, x)
if v == x:
theta = math.atan(b/a)
elif v > x:
theta = math.atan(a*(b**2)/(2*x))
elif v < x:
theta = math.atan(2/a*(b-x/a**2))
print(math.degrees(theta))
| import sys
from math import atan, pi
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
a, b, x = map(int, readline().split())
if x > a * a * b / 2:
angle = atan(2 * (a * a * b - x) / a ** 3)
else:
angle = atan(a * b * b / (2 * x))
print(angle / pi * 180)
return
if __name__ == '__main__':
main()
| 1 | 163,385,926,991,508 | null | 289 | 289 |
N = int(input())
for i in range(1,11):
need = 1000 * i
if N <= need:
print(need - N)
break | N = int(input())
for i in range(10):
pay = (i + 1) * 1000
if(pay >= N):
break
if(pay < N):
print("たりません")
else:
print(pay - N) | 1 | 8,481,991,523,346 | null | 108 | 108 |
N = int(input())
X = [int(i) for i in input().split()]
a = min(X)
b = max(X)
s = 10**6
for i in range(a, b+1):
t = 0
for j in range(N):
t += (X[j] - i)**2
if t < s:
s = t
print(s) | n = int(input())
m = map(int, input().split())
flag = "APPROVED"
for i in m:
if i % 2 == 0:
if i % 3 != 0 and i % 5 != 0:
flag = "DENIED"
print(flag)
| 0 | null | 67,310,676,135,758 | 213 | 217 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = 10**9
# 個数制限なしナップザック問題
h,n = map(int, input().split())
# 二次元配列で
a,b = [],[]
for i in range(n):
x, y = map(int, input().split())
a.append(x)
b.append(y)
dp = [[INF] * (h + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(h + 1):
if j <= a[i]:
dp[i + 1][j] = min(dp[i][j], b[i])
else:
dp[i + 1][j] = min(dp[i][j], dp[i + 1][j - a[i]] + b[i])
print(dp[n][h])
# 一次元配列で
# dp = [INF]*(h+1)
# dp[0] = 0
# for i in range(n):
# a,b = map(int, input().split())
# for j in range(h):
# nj = min(a+j, h)
# dp[nj] = min(dp[nj], dp[j]+b)
# print(dp[-1])
| #個数が無制限のナップザックの問題(ただし、上限に注意)です(どの魔法を順番に選べば良いなどの制約がないのでナップザックDPを選択しました。)。
#dpの配列にはi番目の要素にモンスターの体力をi減らすために必要な最小の魔力を保存します。
#この配列は個数制限がないことに注意してinfではない要素のみを順に更新していけば良いです。
#また、最終的にモンスターの体力を最小の魔力で0以下にすれば良いので、モンスターの体力をh以上減らせる最小の魔力を求めれば良いです。
h,n=map(int,input().split())
a,b=[],[]
for i in range(n):
a_sub,b_sub=map(int,input().split())
a.append(a_sub)
b.append(b_sub)
inf=10000000000000
ma=max(a)#ダメージの最大値
dp=[inf]*(h+1+ma)#与えるダメージの最大値を考慮したDP
dp[0]=0#初期値
for i in range(h+1+ma):# 与えるダメージ合計：0ーH+1+maまで
if dp[i] == inf:#更新してきて、ダメージiになる組み合わせが存在しない場合は飛ばす
continue
for j in range(n): #N個の魔法を試す
ni = i + a[j] #今の状態から新しく与えた場合のダメージ合計
if ni<h+ma:#オーバーキルの範囲を超えるなら、無視
dp[ni] = min(dp[ni], dp[i] + b[j]) #ダメージniを与えるのにより小さい魔力で実現できる場合は更新
print(min(dp[h:]))
| 1 | 80,760,179,274,490 | null | 229 | 229 |
import math
n = int(input())
R = 2*n*math.pi
print(R) | n = int(input())
furui = [i for i in range(10**6+2)]
ans = 9999999999999
yakusuu = []
for i in range(1,int(n**0.5)+1+1):
if n%i == 0:
yakusuu.append(i)
for i in yakusuu:
ans = min(i+n//i,ans)
# print(i,ans)
print(ans-2)
| 0 | null | 96,401,541,166,150 | 167 | 288 |
s = input()
d = {'ABC': 'ARC', 'ARC': 'ABC'}
print(d[s]) | def main():
x=list(map(int,input().split()))
for i in range(5):
if x[i] == 0:
print(i+1)
main() | 0 | null | 18,794,938,174,508 | 153 | 126 |
S = input()
mod = 2019
array = []
for i in range(len(S)):
x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod
array.append(x)
array2 = [0]
y = 0
for i in range(len(S)):
y = (y+array[i])%mod
array2.append(y)
array3 = [0] * 2019
ans = 0
for i in range(len(array2)):
z = array2[i]
ans += array3[z]
array3[z] += 1
print(ans)
#3*673
| i = 0
while True:
i += 1
v = input()
if v == '0':
break
print('Case %d: %s' % (i, v)) | 0 | null | 15,568,600,594,100 | 166 | 42 |
n = int(input())
s = input()
from collections import Counter
a = [None] * n
for i in range(n):
if s[i] == "R":
a[i] = 0
if s[i] == "G":
a[i] = 1
if s[i] == "B":
a[i] = 2
c = [0] * 3
for v in a:
c[v] += 1
ans = 1
for v in c:
ans *= v
cnt = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
k = 2 * j - i
if j < k and k < n:
if s[i] == s[j]:
continue
if s[i] == s[k]:
continue
if s[j] == s[k]:
continue
cnt += 1
ans -= cnt
print(ans)
| N = int(input())
S = list(input())
R_list = [0]*N
G_list = [0]*N
B_list = [0]*N
for key,val in enumerate(S):
if val=='R':
R_list[key] = R_list[key-1]+1
G_list[key] = G_list[key-1]
B_list[key] = B_list[key-1]
elif val=='G':
R_list[key] = R_list[key-1]
G_list[key] = G_list[key-1]+1
B_list[key] = B_list[key-1]
elif val=='B':
R_list[key] = R_list[key-1]
G_list[key] = G_list[key-1]
B_list[key] = B_list[key-1]+1
ans = 0
for i in range(N-2):
for j in range(i+1,N-1):
if S[i]==S[j]:
continue
a=2*(j+1)-(i+1)-1
check = [S[i],S[j]]
if 'R' not in check:
ans += R_list[-1]-R_list[j]
if a<N and S[a]=='R':
ans -= 1
elif 'G' not in check:
ans += G_list[-1]-G_list[j]
if a<N and S[a]=='G':
ans -= 1
elif 'B' not in check:
ans += B_list[-1]-B_list[j]
if a<N and S[a]=='B':
ans -= 1
print(ans)
| 1 | 35,971,544,061,948 | null | 175 | 175 |
#93 B - Iron Bar Cutting WA (hint)
N = int(input())
A = list(map(int,input().split()))
# 差が最小の切れ目を見つける
length = sum(A)
left = 0
dist = 0
mdist = length
midx = 0
for i,a in enumerate(A):
left += a
right = length - left
dist = abs(left - right)
if dist < mdist:
mdist = dist
midx = i
ans = mdist
print(ans) | import numpy as np
N = int(input())
A = list(map(int, input().split()))
cum_A = np.cumsum(A)
ans = 10 ** 18
for i in range(N):
left = cum_A[i]
right = cum_A[-1] - cum_A[i]
ans = min(ans, abs(left - right))
print(ans)
| 1 | 142,544,426,931,634 | null | 276 | 276 |
N = int(input())
robot = []
ans = 0
for i in range(N):
x,l = map(int,input().split())
robot.append([x+l,x-l])
robot.sort()
cur = -float('inf')
for i in range(N):
if cur <= robot[i][1]:
ans += 1
cur = robot[i][0]
print(ans) | word = 'ACL'
a = int(input())
word = word *a
print(word) | 0 | null | 46,142,006,256,060 | 237 | 69 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
SS = ['SUN','MON','TUE','WED','THU','FRI','SAT']
S = readline().decode().rstrip()
for i in range(7):
if S == SS[i]:
print(7-i)
sys.exit() | N = int(input())
S = input()
if S[:int(N/2)] == S[int(N/2):N]:
print("Yes")
else:
print("No")
| 0 | null | 139,924,036,169,072 | 270 | 279 |
import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N, K = NMI()
LR = list(sorted([NLI() for _ in range(K)]))
dp = [0 for _ in range(N)]
dp[0] = 1
cumsum = [0 for _ in range(N+1)]
cumsum[0] = 0
cumsum[1] = 1
for n in range(1,N):
for k in range(K):
r = n-LR[k][0]
l = n-LR[k][1]
if r < 0:
continue
else:
l = max(0,l)
dp[n] += cumsum[r+1]-cumsum[l]
dp[n] = dp[n]%MOD2
cumsum[n+1] = (dp[n] + cumsum[n])%MOD2
print(dp[-1])
if __name__ == '__main__':
main() | M=998244353
f=lambda:[*map(int,input().split())]
n,k=f()
lr=[f() for _ in range(k)]
dp=[0]*n
dp[0]=1
S=[0]
for i in range(1,n):
S+=[S[-1]+dp[i-1]]
for l,r in lr:
dp[i]+=S[max(i-l+1,0)]-S[max(i-r,0)]
dp[i]%=M
print(dp[-1]) | 1 | 2,734,929,187,042 | null | 74 | 74 |
n = int(input())
card =[i+" "+str(j) for i in ["S","H","C","D"] for j in range(1,14)]
for i in range(n):
card.remove(input())
for i in card:
print(i)
| from collections import OrderedDict
d = OrderedDict()
d['S'] = set()
d['H'] = set()
d['C'] = set()
d['D'] = set()
a = frozenset(range(1,14))
n = int(input())
for i in range(n):
s, r = input().split()
d[s].add(int(r))
for k, v in d.items():
racks = a.difference(v)
for rack in racks:
print(k, rack) | 1 | 1,062,100,769,728 | null | 54 | 54 |
S = input()
S_rev = S[::-1]
total = 0
for i in range(len(S)):
if S[i] != S_rev[i]:
total += 1
if total % 2 == 0:
total = int(total / 2)
else:
total = int(total / 2) + 1
print(total) | 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])
| 0 | null | 60,137,803,088,608 | 261 | 28 |
input()
s, t = input().split()
print("".join([i + j for i, j in zip(s, t)])) | n = int(input())
s,t = input().split()
res = ""
for i in range(0,n):
res += s[i]
res += t[i]
print(res) | 1 | 112,385,827,181,490 | null | 255 | 255 |
import math
a, b, c = map(int, input().split())
l = []; d = int(math.sqrt(c)); e = 0
for i in range(1, d + 1):
if i * i == c: l += [i]
elif c % i == 0: l += [i, c // i]
for x in l:
if a <= x <= b: e += 1
print(e) | from itertools import combinations
N=input()
K=int(input())
L = len(N)
dp = [[[0]*(L+1) for _ in range(K+2)] for _ in range(2)]
#dp[smaller][j][i]:=上からiケタ目までを確定したときの場合の数
#smaller = 0: 一致
#j: 0意外の数
dp[0][0][0] = 1
for i in range(1, L+1):
num = int(N[i-1])
for k in range(K+1):
dp[1][k][i] += dp[1][k][i-1]
dp[1][k+1][i] += dp[1][k][i-1]*9
if num > 0:
dp[1][k][i] += dp[0][k][i-1]
dp[1][k+1][i] += dp[0][k][i-1] * (num-1)
if num > 0:
dp[0][k+1][i] = dp[0][k][i-1]
else:
dp[0][k][i] = dp[0][k][i-1]
print(dp[0][K][L] + dp[1][K][L]) | 0 | null | 38,096,591,624,884 | 44 | 224 |
from itertools import cycle
while True:
(H, W) = [int(i) for i in input().split(' ')]
if (H == W == 0):
break
it1 = cycle(['#', '.'])
it2 = cycle(['.', '#'])
str1 = ''
str2 = ''
for i in range(W):
str1 += next(it1)
str2 += next(it2)
for i in range(H):
if ((i % 2) == 0):
print(str1)
else:
print(str2)
print() | N = int(input())
A = [int(i) for i in input().split()]
possess = 1000
for i in range(N-1):
if A[i] < A[i+1]:
stock = possess//A[i]
possess = possess % A[i] + A[i+1] * stock
print(possess) | 0 | null | 4,122,591,453,650 | 51 | 103 |
n,a,b=map(int,input().split())
c=max(a,b)
b=min(a,b)
a=c
MOD = pow(10,9) + 7
X=1
Y=1
for i in range(1,a+1):
X=X*(n+1-i)%MOD
Y=Y*i%MOD
if i==b:
b_X=X
b_Y=Y
a_X=X
a_Y=Y
def calc(X,Y,MOD):
return X*pow(Y,MOD-2,MOD)
ans=pow(2,n,MOD)%MOD-1-calc(a_X,a_Y,MOD)-calc(b_X,b_Y,MOD)
print(ans%MOD)
| from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
from functools import reduce
n,k = list(map(int, input().split()))
a = n*(n+k+1)*(n-k+2)//2
b = n-k+2
c = -((n+2)*(n+1)*n - k*(k-1)*(k-2))//3
print((a+b+c) % (10**9+7)) | 0 | null | 49,682,745,975,328 | 214 | 170 |
s,w=map(int,input().split())
if s>w: print("safe")
else: print("unsafe") | s,w = list(map(int,input().split()))
if w >= s:
print('unsafe')
else:
print('safe') | 1 | 29,361,875,632,320 | null | 163 | 163 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
H,W = map(int, input().split())
s = [None for _ in range(H)]
for i in range(H):
s[i] = input()
dp = [[0]*(W+1) for _ in range(H+1)]
if s[0][0] == '#':
dp[1][1] += 1
for i in range(H):
for j in range(W):
if (i,j) == (0,0):
continue
tmp = []
if i > 0:
if s[i][j] == '#' and s[i-1][j] == '.':
tmp.append(dp[i][j+1]+1)
else:
tmp.append(dp[i][j+1])
if j > 0:
if s[i][j] == '#' and s[i][j-1] == '.':
tmp.append(dp[i+1][j]+1)
else:
tmp.append(dp[i+1][j])
dp[i+1][j+1] = min(tmp)
print(dp[H][W]) | def resolve():
'''
code here
'''
import collections
import numpy as np
H, W = [int(item) for item in input().split()]
grid = [[item for item in input()] for _ in range(H)]
dp = [[300 for _ in range(W+1)] for _ in range(H+1)]
for i in range(H):
for j in range(W):
if i == 0 and j == 0:
if grid[0][0] == '#':
dp[i+1][j+1] = 1
else:
dp[i+1][j+1] = 0
else:
add_v = 0
add_h = 0
if grid[i][j] != grid[i][j-1]:
add_h = 1
if grid[i][j] != grid[i-1][j]:
add_v = 1
dp[i+1][j+1] = min(dp[i+1][j]+add_h, dp[i][j+1]+add_v)
# print(dp)
if grid[H-1][W-1] == '#':
print(dp[H][W]//2+1)
else:
print(dp[H][W]//2)
if __name__ == "__main__":
resolve()
| 1 | 49,424,207,621,630 | null | 194 | 194 |
N = int(input())
A = [int(i) for i in input().split()]
ans = []
for i in range(N):
ans.append([A[i],i+1])
ans.sort()
for i in range(N-1):
print(ans[i][1],end=' ')
print(ans[-1][1])
| from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
MOD=10**9+7
import random
#####################################
n=int(input())
A=INPUT()
D=[0]*(n+1)
for i in range(n):
D[A[i]]=(i+1)
print(*D[1:])
| 1 | 181,056,352,575,140 | null | 299 | 299 |
while True:
H, W = map(int, input().split())
if H == 0 and W == 0:
break
for i in range(H):
if i == 0 or i == H-1:
print("#" * W)
else:
print("#" + "." * (W-2) + "#")
print()
| import sys
def input(): return sys.stdin.readline().rstrip()
S = input()
T = input()
size = len(S)
if S == T[:size]:
print("Yes")
else:
print("No") | 0 | null | 11,081,295,169,834 | 50 | 147 |
s = input()
n = list(s)
print(n[0]+n[1]+n[2])
| import random
s = input()
num = random.randint(0,len(s)-3)
print(s[num:num+3]) | 1 | 14,669,491,664,760 | null | 130 | 130 |
H, W = list(map(int, input().split()))
seki = H * W
if H == 1 or W == 1:
print(1)
else:
ans = (seki + 2 - 1) // 2
print(ans)
| H, W = map(int, input().split())
w1, w2 = W // 2, W % 2
h1, h2 = H // 2, H % 2
if H > 1 and W > 1:
num = 2 * w1 * h1 + w2 * h1 + w1 * h2 + w2 * h2
else:
num = 1
print(num)
| 1 | 50,739,148,069,080 | null | 196 | 196 |
n,a,b = map(int,input().split())
t = n // (a+b)
ans = t*a
s = n % (a+b)
if s <= a:
ans += s
else:
ans += a
print(ans) | import sys
N,A,B = map(int,input().split())
if not ( 1 <= N <= 10**18 and 0 <= A and 0 <= B and 0 < A + B <= 10**18 ): sys.exit()
if not ( isinstance(N,int) and isinstance(A,int) and isinstance(B,int) ): sys.exit()
count = N // (A+B)
remind = N % (A+B) if N % (A+B) <= A else A
print(count * A + remind) | 1 | 55,553,707,743,570 | null | 202 | 202 |
# coding: utf-8
H, W = list(map(int, input().split()))
S = []
for _ in range(H):
S.append(list(input()))
grid = [[0 for _ in range(W)] for _ in range(H)]
for h in range(1,H):
if S[h-1][0] == '#' and S[h][0] == '.':
grid[h][0] = grid[h-1][0] + 1
else:
grid[h][0] = grid[h-1][0]
for w in range(1,W):
if S[0][w-1] == '#' and S[0][w] == '.':
grid[0][w] = grid[0][w-1] + 1
else:
grid[0][w] = grid[0][w-1]
for w in range(1,W):
for h in range(1,H):
if S[h-1][w] == '#' and S[h][w] == '.':
next_h = grid[h-1][w] + 1
else:
next_h = grid[h-1][w]
if S[h][w-1] == '#' and S[h][w] == '.':
next_w = grid[h][w-1] + 1
else:
next_w = grid[h][w-1]
grid[h][w] = min([next_w, next_h])
if S[H-1][W-1] == '#':
grid[H-1][W-1] += 1
print(grid[H-1][W-1]) | n = int(input())
s = []
for i in range(n):
s.append(input())
s.sort()
# print(s)
m = 1
cnt = [1]
ans = []
for i in range(1,n):
if s[i] == s[i-1]:
cnt[-1] += 1
else:
if cnt[-1] > m:
ans = [s[i-1]]
elif cnt[-1] == m:
ans.append(s[i-1])
m = max(m, cnt[-1])
cnt.append(1)
if i == n-1 and cnt[-1] > m:
ans = [s[i]]
elif i == n-1 and cnt[-1] == m:
ans.append(s[i])
print('\n'.join(ans)) | 0 | null | 59,867,802,549,508 | 194 | 218 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
dp = [float('inf') for _ in range(n+1)]
dp[0] = 0
for i in range(n):
for money in a:
next_money = i + money
if next_money > n:
continue
dp[next_money] = min(dp[i] + 1, dp[next_money])
print(dp[n])
| t1,t2=map(int,input().split())
a1,a2=map(int,input().split())
b1,b2=map(int,input().split())
x=(a1-b1)*t1
y=(a2-b2)*t2
if x>0:
x*=-1
y*=-1
if x+y<0:print(0)
elif x+y==0:print("infinity")
else:
ans=(-x)//(x+y)
if (-x)%(x+y):print(ans*2+1)
else:print(ans*2) | 0 | null | 66,125,116,876,038 | 28 | 269 |
n = int(input())
s = str(input())
a = 0
c = len(s)//2
if n % 2 == 0:
for i in range(c):
if s[i] == s[c+i]:
a += 1
if a == n/2 :
print("Yes")
else :
print("No")
else :
print("No") | n = int(input())
s = input()
if n % 2 != 0:
print('No')
else:
if s[:int((n/2))] == s[int((n/2)):]:
print('Yes')
else:
print('No')
| 1 | 147,341,526,630,650 | null | 279 | 279 |
import sys
N, X, M = map(int, input().split())
if N == 1: #例外
print(X)
sys.exit()
ans = 0
ans += X - (X%M) #XがMより大きい場合、超過分を先に計上する。
X %= M #これで 0 <= X <= M-1 が成り立つようにできた。
def fun(x): #問題の関数を用意（いちいち中身を書いていると面倒くさいため）
return (x * x) % M
appear_set = {X} #すでに現れた数を格納する
i_0 = 1 #今までに調べた個数。現在は「X」の1つだけ。
x = X #このxに何度も関数funを作用させる
sum_0 = x #現在までの和
# ①：すでに出現したことのある数が現れるまで、ループを回す。
# この途中で目標回数Nに到達するなら、その時点で答えを出力する(31-33行目)。
while fun(x) not in appear_set: #次のxが初めて現れる数なら続ける。
x = fun(x) #xにfunを作用
appear_set.add(x) #xを「現れたものリスト」に格納
sum_0 += x #和の更新
i_0 += 1 #調べた個数の更新
if i_0 == N: #目標回数に到達したら、その時点で答えを出力して終了。
print(ans + sum_0)
sys.exit()
# 現在、xには系列に初めて現れた最後の数が入っている。
# 次の数であるfun(x)は、前に現れたことのある数。したがって、ここからループが始まる。
# 整理のため、ここまでの和を計上し、残り回数も減らしておく。
ans += sum_0
N -= i_0
# ②：ループの性質を調べるため、もう一度ループを回したい。
# 欲しいものは3つ。
# 1.ループ１週の和
# 2.ループの途中までの和を記録した配列。
# 3.ループの長さ
# 以下、先ほどと異なる部分を中心に説明する。
x = fun(x) # 次の数へ行く(ループの最初の数)
appear_set_2 = {x}
sum_1 = x # 欲しいもの1。ループ１周の和を記録する。
sum_list = [0,x] # 欲しいもの2。i番目の要素がi番目までの数までの和を示すよう、この後要素を追加する。
i_1 = 1 # すでに調べた個数をカウントする。現在は「x」の1個だけ。
# このi_1が、最終的にループの長さ(欲しいもの3)になる。
# 以下、60行目以外の処理は先ほどと同様。
while fun(x) not in appear_set_2:
x = fun(x)
appear_set_2.add(x)
sum_1 += x
sum_list.append(sum_1) #途中までの和を記録。
i_1 += 1
# ③：上で求めた３つの情報（一周の和sum_1, 途中までの和の記録sum_list, ループ長i_1）
# を使って答えを求める。
ans += sum_1 * (N // i_1) + sum_list[(N % i_1)]
print(ans) | 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) | 0 | null | 79,257,707,873,008 | 75 | 285 |
import math
from decimal import Decimal
X = int(input())
if X == 999999999999999999:
print(3759)
exit()
A = 100
for i in range(1, 8000):
A = math.floor(Decimal(Decimal(A * 101) // 100))
if A >= X:
print(i)
exit() | X = int(input())
K = 100
i = 1
while 1:
K *= 101
K //= 100
if K >= X:
break
i += 1
print(i) | 1 | 27,102,444,460,938 | null | 159 | 159 |
x,y=map(int,input().split())
if y%2==1:
print('No')
elif y>=2*x and y<=4*x:
print('Yes')
else:
print('No') | a,b=map(int,input().split())
c=0
for i in range (0,a+1):
for j in range (0,a+1):
if (i+j)==a and (i*2 + j *4) == b:
c+=1
if c== 0:
print('No')
else:
print('Yes') | 1 | 13,742,941,940,846 | null | 127 | 127 |
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
N = int(input())
L = []
Slist1 = []
Slist2 = []
R = []
l = 0; r = 0
for i in range(N):
M = 0; end = None
var = 0
S = input()
for j in S:
if j == "(":
var += 1
l += 1
else:
var -= 1
r += 1
M = min(var, M)
end = var
if M == 0:
L.append([M, end])
elif M == end:
R.append([M, end])
elif M < 0 and end > 0:
Slist1.append([-M, end])
else:
Slist2.append([M - end, M, end])
Slist1 = sorted(Slist1)
Slist2 = sorted(Slist2)
if l != r:
print("No")
return
cnt = 0
X = len(L)
for i in range(X):
cnt += L[i][1]
judge = "Yes"
X = len(Slist1)
for i in range(X):
M = Slist1[i][0]
cnt -= M
if cnt < 0:
judge = "No"
break
else:
cnt += M + Slist1[i][1]
X = len(Slist2)
for i in range(X):
cnt += Slist2[i][1]
if cnt < 0:
judge = "No"
break
else:
cnt -= Slist2[i][0]
print(judge)
if __name__ == '__main__':
main() | import sys
from functools import reduce
n=int(input())
s=[input() for i in range(n)]
t=[2*(i.count("("))-len(i) for i in s]
if sum(t)!=0:
print("No")
sys.exit()
st=[[t[i]] for i in range(n)]
for i in range(n):
now,mi=0,0
for j in s[i]:
if j=="(":
now+=1
else:
now-=1
mi=min(mi,now)
st[i].append(mi)
now2=sum(map(lambda x:x[0],filter(lambda x:x[1]>=0,st)))
v,w=list(filter(lambda x:x[1]<0 and x[0]>=0,st)),list(filter(lambda x:x[1]<0 and x[0]<0,st))
v.sort(reverse=True,key=lambda z:z[1])
w.sort(key=lambda z:z[0]-z[1],reverse=True)
#print(now2)
for vsub in v:
if now2+vsub[1]<0:
print("No")
sys.exit()
now2+=vsub[0]
for wsub in w:
if now2+wsub[1]<0:
print("No")
sys.exit()
now2+=wsub[0]
print("Yes") | 1 | 23,675,097,851,122 | null | 152 | 152 |
# coding: utf-8
# Here your code !
import collections
p,q=map(int,input().split())
count =0
deq = collections.deque()
finished=[]
while 1:
try:
deq.append(input().split())
except EOFError:
break
while deq:
d = deq.popleft()
d[1]=int(d[1])
if d[1]<=q:
count+=d[1]
d[1]=count
finished.append(map(str,d))
elif d[1]>q:
d[1]-=q
count+=q
deq.append(d)
for f in finished:
print(" ".join(f)) | import sys
input = sys.stdin.readline
n, (s, t) = int(input()), input()[:-1].split()
print(''.join(s[i] + t[i] for i in range(n))) | 0 | null | 55,923,742,030,462 | 19 | 255 |
a,b,c,d=map(int, raw_input().split())
print max(a*c,a*d,b*c,b*d) | h = []
w = []
while True:
a,b = map(int, raw_input().split())
h.append(a)
w.append(b)
if a == 0 and b == 0:
break
for h,w in zip(h,w):
if h == 0 and w == 0:
break;
else:
r = "#"
for x in xrange(w-1):
r = r + "#"
for x in xrange(h):
print r
print | 0 | null | 1,913,924,025,440 | 77 | 49 |
first_flag = True
while True:
H, W = map(int, input().split())
if H == 0 and W == 0: break
if not first_flag:
print()
first_flag = False
print(("#" * W + "\n") * H) | import sys
while 1:
H,W = map(int,sys.stdin.readline().split())
if H == W == 0:
break
print(('#'*W + '\n')*H) | 1 | 774,044,989,850 | null | 49 | 49 |
n, m = map(int, input().split())
ans = ((n*(n-1))+(m*(m-1)))//2
print(ans) | def main():
H, W, K = [int(k) for k in input().split(" ")]
C = []
black_in_row = []
black_in_col = [0] * W
for i in range(H):
C.append(list(input()))
black_in_row.append(C[i].count("#"))
for j in range(W):
if C[i][j] == "#":
black_in_col[j] += 1
black = sum(black_in_row)
if black < K:
print(0)
return 0
cnt = 0
for i in range(2 ** H):
row_bit = [f for f, b in enumerate(list(pad_zero(format(i, 'b'), H))) if b == "1"]
r = sum([black_in_row[y] for y in row_bit])
for j in range(2 ** W):
col_bit = [f for f, b in enumerate(list(pad_zero(format(j, 'b'), W))) if b == "1"]
c = sum([black_in_col[x] for x in col_bit])
bl = black - r - c + sum([1 for p in row_bit for q in col_bit if C[p][q] == "#"])
if bl == K:
cnt += 1
print(cnt)
def pad_zero(s, n):
s = str(s)
return ("0" * n + s)[-n:]
main() | 0 | null | 27,343,604,009,020 | 189 | 110 |
N, M = list(map(int, input().split()))
A = list(map(lambda x: int(x),input().split()))
cnt = [0 for _ in range(N)]
for i in range(N):
a = A[i]
while a%2 == 0:
a = a // 2
cnt[i] += 1
if max(cnt) > min(cnt):
print(0)
exit(0)
C = max(cnt)
A = list(map(lambda x: x // pow(2,C), A))
def gcd(a,b):
if a<b:
a,b = b,a
while a%b > 0:
a,b = b,a%b
return b
def lcm(a,b):
return a*b//gcd(a,b)
x = A[0]
for a in A[1:]:
x = lcm(x,a)
x = x * pow(2,C-1)
print((M // x + 1) // 2) | import fractions
n, m = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] = a[i] //2
def count_2(k):
c = 0
while k % 2 == 0:
k = k // 2
c+=1
return c
count = count_2(a[0])
for i in range(n):
if count != count_2(a[i]):
print(0)
exit()
ans = a[0]
for i in range(1, n):
ans = ans * a[i] // fractions.gcd(ans, a[i])
print((m // ans +1)//2)
| 1 | 101,602,089,876,640 | null | 247 | 247 |
N,K = map(int,input().split())
A = list(map(int,input().split()))
A = [(a-1) % K for a in A]
S = [0 for i in range(N+1)]
for i in range(1, N+1):
S[i] = (S[i-1] + A[i-1]) % K
kinds = set(S)
counts = {}
ans = 0
for k in kinds:
counts[k] = 0
for i in range(N+1):
counts[S[i]] += 1
if i >= K:
counts[S[i-K]] -= 1
ans += (counts[S[i]] - 1)
print(ans) | import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(0,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
| 1 | 137,862,440,973,088 | null | 273 | 273 |
N = int(input())
X = list(map(int, input().split()))
P = round(sum(X)/N)
ans = sum(list(map(lambda x: (x-P)**2, X)))
print(ans) | N=int(input())
D=[]
TF=[]
for i in range(N):
Input=list(map(int,input().split()))
D.append(Input)
if D[i][0]==D[i][1]:
TF.append(1)
else:
TF.append(0)
TF.append(0)
TF.append(0)
Q=[]
for i in range(N):
temp=TF[i]+TF[i+1]+TF[i+2]
Q.append(temp)
if max(Q)==3:
print("Yes")
else:
print("No") | 0 | null | 33,775,935,006,340 | 213 | 72 |
def gcd(x, y):
x, y = max(x, y), min(x, y)
while y != 0:
x, y = y, x % y
return x
X, Y = (int(s) for s in input().split())
print(gcd(X, Y)) | x,y=map(int,input().split())
while x%y!=0:
tmp=y
y=x%y
x=tmp
print(y)
| 1 | 8,458,391,172 | null | 11 | 11 |
N, K = map(int, input().split())
A_list = list(map(int, input().split()))
for _ in range(K):
count_list = [0] * N
for i, v in enumerate(A_list):
count_list[i - v if i - v > 0 else 0] += 1
if i + v + 1 < N:
count_list[i + v + 1] -= 1
temp = 0
flag = True
for i in range(len(A_list)):
temp += count_list[i]
if temp != N:
flag = False
A_list[i] = temp
if flag:
break
print(*A_list) | n,k=map(int,input().split())
a=list(map(int,input().split()))
def imos(n,a):
imos_l=[0]*n
for i in range(n):
l=max(i-a[i],0)
r=min(i+a[i],n-1)
imos_l[l]+=1
if (r+1)!=n:
imos_l[r+1]-=1
b=[0]
for i in range(1,n+1):
b.append(imos_l[i-1]+b[i-1])
return b[1:]
for i in range(k):
na=imos(n,a)
if na==a:
break
a=na
print(*a) | 1 | 15,529,563,252,320 | null | 132 | 132 |
print( 1 if int(input()) < 1 else 0) | def a():
x :int = int(input())
if x == 1:
return 0
else:
return 1
if __name__ == '__main__':
print(a()) | 1 | 2,926,984,389,858 | null | 76 | 76 |
in_value = int(input())
if in_value >= 30:
print("Yes")
else:
print("No") | X = int(input())
print("YNeos"[not(X>=30)::2]) | 1 | 5,672,307,699,310 | null | 95 | 95 |
N,K = map(int, input().split())
LR = list(tuple(map(int, input().split())) for _ in range(K))
S = [0]*(N+1)
S[1] = 1
for k in range(2, N+1):
s = 0
for l,r in LR:
p0,p1 = max(k-r-1, 0), max(k-l, 0)
s += S[p1] - S[p0]
S[k] = (S[k-1] + s)%998244353
print((S[-1] - S[-2])%998244353)
| N, K = (int(i) for i in input().split())
l, r = [0]*K, [0]*K
for k in range(K):
l[k], r[k] = (int(x) for x in input().split())
# dp : マスiまで移動する方法のパターン数
# TLE
'''
import numpy as np
dp = [0]*N
dp[0] = 1
for i in range(N):
for k in range(K):
for j in range(l[k], r[k]+1):
if (i+j < N):
dp[i+j] = dp[i+j] + dp[i]
if j == r[k]:
print(i, (l[k], r[k]), dp, np.diff(dp))
print(dp[-1]%998244353)
'''
# dp : マスiまで移動する方法のパターン数
# dps : dp[i] と dp[i+1] の 差
dp = [0]*N
dps = [0]*(N-1)
dp[0] = 1
dps[0] = -1
for i in range(N-1):
for k in range(K):
if i + l[k] - 1 < (N - 1):
dps[i + l[k] - 1] += dp[i]
if i + r[k] < (N - 1):
dps[i + r[k] ] -= dp[i]
#print(i, (l[k], r[k]), dp, dps)
dp[i+1] = (dps[i] + dp[i])%998244353
print(dp[-1]%998244353) | 1 | 2,671,825,098,710 | null | 74 | 74 |
value_list = list(map(int, input().split()))
print(value_list.index(0) + 1) | x = list(map(int,input().split()))
print(15-x[0]-x[1]-x[2]-x[3]-x[4]) | 1 | 13,511,208,281,920 | null | 126 | 126 |
H, W, K = map(int, input().split())
m = []
for h in range(H):
m.append(list(map(int, list(input()))))
ans = float('inf')
for hb in range(2**(H-1)):
hl = []
for i in range(H-1):
if hb & (1 << i) > 0:
hl.append(i+1)
t = len(hl)
hl = [0]+hl+[H]
w, pw = 0, 0
wl = [0]*len(hl)
while w < W:
ok = True
for i in range(len(hl)-1):
sh, eh = hl[i], hl[i+1]
for h in range(sh, eh):
wl[i] += m[h][w]
if wl[i] > K:
ok = False
break
if not ok:
break
if not ok:
if pw == w:
t = float('inf')
break
pw, w = w, w
t += 1
wl = [0]*len(hl)
else:
w += 1
ans = min(t, ans)
print(ans)
| n = int(input())
print(max(0,((n-1)//2)))
| 0 | null | 101,209,766,743,430 | 193 | 283 |
s = input()
t = input()
len_s = len(s)
len_t = len(t)
ans = len_t
for i in range(len_s - len_t + 1):
tmp_cnt = 0
tmp_s = s[i:i + len_t]
for c1, c2 in zip(tmp_s, t):
if c1 != c2:
tmp_cnt += 1
ans = min(ans, tmp_cnt)
print(ans) | n=int(input())
p=round(n**0.5)+1
ans=[0]*n
for x in range(1,p):
for y in range(1,p):
for z in range(1,p):
k=x**2+y**2+z**2+x*y+y*z+z*x
k-=1
if 0<=k<=n-1:
ans[k]+=1
for i in ans:
print(i) | 0 | null | 5,811,031,536,602 | 82 | 106 |
h1,m1,h2,m2,k = map(int,input().split())
okiteiru = (h2*60+m2)-(h1*60+m1)
print(okiteiru - k)
| import sys
n = int(input())
p_t = 0
p_h = 0
for i in range(n):
taro, hanako = input().split()
if taro == hanako:
p_t += 1
p_h += 1
else:
l_t = list(taro)
l_h = list(hanako)
for j in range(min(len(l_t), len(l_h))):
if l_t[j] != l_h[j]:
if ord(l_t[j])<ord(l_h[j]):
p_h += 3
#print('taro')
break
else:
p_t += 3
#print('hanako')
break
else:
if j == min(len(l_t), len(l_h))-1:
if len(l_t)>len(l_h):
p_t += 3
else:
p_h += 3
print(p_t, p_h) | 0 | null | 10,007,301,994,596 | 139 | 67 |
N = int(input())
print('Yes' if N >= 30 else 'No') | ondo = int(input())
if 30 <= ondo:
print("Yes")
else:
print("No") | 1 | 5,733,961,216,828 | null | 95 | 95 |
from sys import stdin,stdout #
import math #
import heapq #
#
t = 1 #
def aint(): #
return int(input().strip()) #
def lint(): #
return list(map(int,input().split())) #
def fint(): #
return list(map(int,stdin.readline().split())) #
#
########################################################
def main():
n=aint()
l=lint()
ans=0
for i in range(0,n,2):
if l[i]%2:
ans+=1
print(ans)
return
#t=int(input())
########################################################
for i in range(t): #
#print("Case #"+str(i+1)+":",end=" ") #
main() # | n = int(input())
squares = list(map(int, input().split(" ")))
odd = 0
for i in range(0, n, 2):
if squares[i] % 2:
odd += 1
print(odd) | 1 | 7,787,383,168,608 | null | 105 | 105 |
s = raw_input()
Q = input()
for q in range(Q):
str_order = raw_input().split()
if str_order[0] == 'print':
print s[int(str_order[1]):int(str_order[2])+1]
elif str_order[0] == 'reverse':
start = s[:int(str_order[1])]
mid = s[int(str_order[1]):int(str_order[2])+1]
mid = mid[::-1]
end = s[int(str_order[2])+1:]
s = start+mid+end
elif str_order[0] == 'replace':
start = s[:int(str_order[1])]
mid = str_order[3]
end = s[int(str_order[2])+1:]
s = start+mid+end | r=input().split()
H=int(r[0])
N=int(r[1])
data_pre=input().split()
data=[int(s) for s in data_pre]
if sum(data)>=H:
print("Yes")
else:
print("No") | 0 | null | 40,131,417,277,468 | 68 | 226 |
N,K=map(int,input().split())
mod=10**9+7
X=[0]+[pow(K//d,N,mod) for d in range(1,K+1)]
'''
Y=[[] for i in range(K+1)]
for i in range(1,K+1):
for j in range(i,K+1,i):
Y[j].append(i)
'''
#print(X)
isPrime=[1 for i in range(K+1)]
isPrime[0]=0;isPrime[1]=0
for i in range(K+1):
if isPrime[i]==0:
continue
for j in range(2*i,K+1,i):
isPrime[j]=0
Mebius=[1 for i in range(K+1)]
Mebius[0]=0
for i in range(2,K+1):
if isPrime[i]==0:
continue
for j in range(i,K+1,i):
Mebius[j]*=-1
for i in range(2,K+1):
for j in range(i*i,K+1,i*i):
Mebius[j]=0
Z=[0 for i in range(K+1)]
for i in range(1,K+1):
for j in range(i,K+1,i):
Z[i]+=X[j]*Mebius[j//i]
ans=0
for i in range(1,K+1):
ans+=Z[i]*i
ans%=mod
print(ans)
'''
P(G%d==0)
Gがd,2d,3d,...の可能性がある
P(d)-P(2d)-P(3d)-P(5d)+P(6d)-P(7d)
''' | def n_cand(x):
return int(x*1.08)
n = int(input())
x = round(n / 1.08)
n_dash = n_cand(x)
n_dash_m = n_cand(x-1)
n_dash_p = n_cand(x+1)
if n_dash == n:
print(x)
elif n_dash_m == n:
print(x-1)
elif n_dash_p == n:
print(x+1)
else:
print(':(') | 0 | null | 80,968,735,976,060 | 176 | 265 |
from itertools import permutations
from bisect import bisect
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
l = tuple(permutations(range(1, n + 1), n))
print(abs(bisect(l, p) - bisect(l, q))) | import itertools
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
a = [i for i in range(1,N+1)]
cnt = 0
ans_a, ans_b = 0, 0
for target in itertools.permutations(a):
cnt += 1
if list(target) == P:
ans_a = cnt
if list(target) == Q:
ans_b = cnt
print(abs(ans_a-ans_b)) | 1 | 100,552,339,223,288 | null | 246 | 246 |
n = int(input())
a0 = 1
a1 = 1
#print(a0, a1, end='')
if n == 0 or n == 1:
a2 = 1
else:
for i in range(n-1):
a2 = a0 + a1
a0 = a1
a1 = a2
#print('',a2,end='')
print(a2)
| # coding:utf-8
n, k = map(int,raw_input().split())
ws = []
for _ in xrange(n):
ws.append(int(raw_input()))
def possible_put_p(p):
# P??\?????????????????????????????????
current = 1
weight = 0
for w in ws:
if weight + w <= p:
weight += w
else:
current += 1
if current > k:
return False
weight = w
if current <= k:
return True
else:
return False
low = max(ws)
high = sum(ws)
while(high - low > 0):
mid = (low + high) / 2
if(possible_put_p(mid)):
high = mid
else:
low = mid + 1
print high | 0 | null | 45,942,811,798 | 7 | 24 |
x = int(input())
a = [1, 0]
print(a[x])
| N = int(input(""))
print(1-N) | 1 | 2,905,379,622,368 | null | 76 | 76 |
from numpy import*
n,m,*a=int_(open(0).read().split())
a=int_(fft.irfft(fft.rfft(bincount(a,[1]*n,2**18))**2)+.5)
c=0
for i in where(a>0)[0][::-1]:t=min(m,a[i]);c+=i*t;m-=t
print(c) | n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
a_rev = a[::-1]
ok, ng = 1, 200001
while ng-ok > 1:
x = (ok+ng)//2
num = 0
cur = 0
for i in range(n-1, -1, -1):
while cur < n and a[i] + a[cur] >= x:
cur += 1
num += cur
if num < m:
ng = x
else:
ok = x
just = ok
ans = 0
larger_cnt = 0
cur = 0
a_cum = [0]
for i in range(n):
a_cum.append(a_cum[-1] + a[i])
for i in range(n):
while cur < n and a[i] + a_rev[cur] <= just:
cur += 1
larger_cnt += n - cur
ans += (n - cur) * a[i] + a_cum[n - cur]
ans += just * (m - larger_cnt)
print(ans) | 1 | 107,639,269,106,978 | null | 252 | 252 |
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") | N = int(input())
music = []
time = []
for i in range(N):
m,t = input().split()
music.append(m)
time.append(int(t))
S = input()
ans = 0
ans += sum(time[music.index(S)+1:])
print(ans) | 0 | null | 52,218,011,049,842 | 102 | 243 |
import sys
import math
n, k = map(int, input().split())
# n_start = math.floor(n / k)
# # print(n_start)
# n = n - n_start*k
# # print(n)
n = n % k
while True:
min_n = n
n = abs(n-k)
# print("n, k =", n, k)
if min_n > n:
min_n = n
else:
break
print(min_n)
| a = input('')
S = []
num = 0
for i in a:
S.append(i)
for j in range(3):
if S[j] == 'R':
num += 1
if num == 2 and S[1] == 'S':
print(1)
else:
print(num) | 0 | null | 21,984,706,134,498 | 180 | 90 |
a,b=map(int,input().split())
dic={1:3*10**5,2:2*10**5,3:1*10**5}
c=0
if a in dic and b in dic:
if a==1 and b==1:
c+=dic[a]+dic[b]+4*10**5
print(c)
else:
c+=dic[a]+dic[b]
print(c)
elif a in dic and b not in dic:
c+=dic[a]
print(c)
elif b in dic and a not in dic:
c+=dic[b]
print(c)
else:
print(c)
| a, b = input().split(" ")
x = int(a)
y = int(b)
amt = 0
if x == 1:
amt += 300000
elif x == 2:
amt += 200000
elif x == 3:
amt += 100000
if y == 1:
amt += 300000
elif y == 2:
amt += 200000
elif y == 3:
amt += 100000
if x == 1 and y == 1:
amt += 400000
print (amt) | 1 | 140,767,657,074,512 | null | 275 | 275 |
x = int(raw_input())
h = x / 3600
m = (x % 3600) / 60
s = x % 60
print u"%d:%d:%d" % (h,m,s) | t=input()
h=t/3600
m=(t%3600)/60
s=t%60
print "%d:%d:%d" %(h,m,s) | 1 | 325,921,035,680 | null | 37 | 37 |
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
def main():
N, K = MI()
L = [LI() for i in range(K)]
D = [0] * N
D[0] = 1
D[1] = -1
num = 0
mod = 998244353
for index in range(N):
num += D[index] % mod
for l, r in L:
if index + r + 1 <= N-1:
D[index+l] += num
D[index+r+1] -= num
elif index+l <= N-1:
D[index+l] += num
print(num % mod)
if __name__ == "__main__":
main() | n, m = map(int, input().split())
if m % 2 == 1:
cnt = 0
for i in range(m // 2):
num1 = 1 + i
num2 = m - i
print(num1, num2, sep=" ")
cnt += 1
if cnt == m:
exit()
for i in range(m // 2 + 1):
num1 = m + 1 + i
num2 = 2 * m + 1 - i
print(num1, num2, sep=" ")
cnt += 1
if cnt == m:
exit()
else:
cnt = 0
for i in range(m // 2):
num1 = 1 + i
num2 = m + 1 - i
print(num1, num2, sep=" ")
cnt += 1
if cnt == m:
exit()
for i in range(m // 2):
num1 = m + 2 + i
num2 = 2 * m + 1 - i
print(num1, num2, sep=" ")
cnt += 1
if cnt == m:
exit()
| 0 | null | 15,799,019,819,220 | 74 | 162 |
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq
def ri():
return int(input())
def rl():
return list(map(int, input().split()))
def solve():
n, m = rl()
A = rl()
print (max(n - sum(A), -1))
mode = 's'
if mode == 'T':
t = ri()
for i in range(t):
solve()
else:
solve()
| import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, m, *a = map(int, read().split())
suma = sum(a)
if n < suma:
print(-1)
else:
print(n - suma)
if __name__ == '__main__':
main()
| 1 | 31,867,150,008,220 | null | 168 | 168 |
kuku = [i * j for i in range(1,10) for j in range(1,10)]
N = int(input())
print('Yes' if N in kuku else 'No') | a, b, c, k = map(int, input().split())
ans = 0
if a >= k:
ans = k
elif a + b >= k:
ans = a
else:
ans = a + ((k - a - b) * (-1))
print(ans)
| 0 | null | 90,730,156,849,680 | 287 | 148 |
A, B = map(int, input().split())
lb_a = int(-(-A // 0.08))
ub_a = int(-(-(A + 1) // 0.08) - 1)
lb_b = int(-(-B // 0.1))
ub_b = int(-(-(B + 1) // 0.1) - 1)
if ub_b < lb_a or ub_a < lb_b:
print(-1)
else:
print(max(lb_a, lb_b))
| import sys
read = sys.stdin.read
def main():
h, n = map(int, input().split())
m = map(int, read().split())
mm = zip(m, m)
large_num = 10**9
dp = [large_num] * (h + 10**4 + 1)
dp[0] = 0
for a, b in mm:
for i1 in range(h + 1):
if dp[i1 + a] > dp[i1] + b:
dp[i1 + a] = dp[i1] + b
r = min(dp[h:])
print(r)
if __name__ == '__main__':
main() | 0 | null | 68,478,628,359,908 | 203 | 229 |
k = [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]
print k[input()-1] | index=int(input())
alist=[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]
index-=1
print(alist[index]) | 1 | 49,801,938,912,166 | null | 195 | 195 |
from collections import Counter
N, P = map(int, input().split())
Ss = input()
if P == 2 or P == 5:
ans = 0
for i, S in enumerate(Ss):
if int(S)%P == 0:
ans += i+1
else:
As = [0]
A = 0
D = 1
for S in Ss[::-1]:
S = int(S)
A = (A + S*D) % P
As.append(A)
D = D*10 % P
cnt = Counter()
ans = 0
for A in As:
ans += cnt[A]
cnt[A] += 1
print(ans)
| '''ika tako ABC164Dの類題
基本は、1桁目、2桁目と下から10進数の数字として見て、
素数ｐで割った余りを考え、余りが同じである数字のスタートとエンドを
選ぶ組み合わせの数が答。
但し、10進数で考えているので、ｐが2と5のケースは別扱い。
末尾が2、5の倍数なら2の倍数。先頭の数字を0番目として、
i番目に2、5の倍数が出てきたら、
そこを右端とする部分文字列は i+1 個作れる。
'''
from collections import defaultdict
def solve2(s):
ans = 0
for i, c in enumerate(s):
if c in '02468':
ans += i + 1
return ans
def solve5(s):
ans = 0
for i, c in enumerate(s):
if c in '05':
ans += i + 1
return ans
def solve_other(s, p):
reminders = defaultdict(lambda: 0)
tmp = 0
mul = 1
for c in s[::-1]:
c = int(c)
tmp = (tmp + c * mul) % p
mul = mul * 10 % p
reminders[tmp] += 1
reminders[0] += 1
ans = 0
for r, cnt in reminders.items():
ans += cnt * (cnt - 1) // 2
return ans
n, p = list(map(int, input().split()))
s = input()
if p == 2:
print(solve2(s))
elif p == 5:
print(solve5(s))
else:
print(solve_other(s, p)) | 1 | 58,019,021,108,720 | null | 205 | 205 |
import math
import sys
N = int(input())
x = math.ceil(math.sqrt(N))
for i in range(x, 0, -1):
if N % i == 0:
print(int(i+N/i-2))
sys.exit()
| # coding: utf-8
# Your code here!
import sys
import math
n=int(input())
ans=n
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
a=i
b=int(n/i)
if a+b-2<ans:
ans=a+b-2
print(ans)
| 1 | 161,843,152,123,900 | null | 288 | 288 |
def main():
X = int(input())
if X >=30: return "Yes"
return "No"
if __name__ == '__main__':
print(main())
| N = int(input())
A = list(map(lambda x: int(x) - 1, input().split()))
C = [0] * N
for a in A:
C[a] += 1
def comb(n):
if n <= 1:
return 0
else:
return n * (n - 1) // 2
t = sum(list(map(comb, C)))
for a in A:
print(t - comb(C[a]) + comb(C[a] - 1))
| 0 | null | 26,611,797,811,200 | 95 | 192 |
import math
r = float(raw_input())
print '%f %f' %(math.pi*r*r,math.pi*2*r) | import math
r = float(raw_input())
s = r * r * math.pi
l = 2 * r * math.pi
print '%f %f' %(s,l) | 1 | 631,109,674,288 | null | 46 | 46 |
a,b,c,d,e=input().split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)
e=int(e)
if a==0:
print("1")
if b==0:
print("2")
if c==0:
print("3")
if d==0:
print("4")
if e==0:
print("5") | n, k, c = map(int, input().split())
s = input()
l = []
tmp = 0
cnt = 0
while (tmp < n):
if s[tmp] == "o":
l.append(tmp)
tmp += c + 1
cnt += 1
else:
tmp += 1
if cnt > k:
exit()
l2 = []
tmp2 = n - 1
cnt2 = 0
while (tmp2 >= 0):
if s[tmp2] == "o":
l2.append(tmp2)
tmp2 -= c + 1
cnt2 += 1
else:
tmp2 -= 1
if cnt2 > k:
exit()
for i in range(k):
if l[i] == l2[k - 1 - i]:
print(l[i]+1) | 0 | null | 26,968,999,608,628 | 126 | 182 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W, K = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = float("inf")
for n in range(2 ** (H - 1)):
tmp = 0
wn = [0] * 10
for i in range(H):
if n >> i & 1:
tmp += 1
for i in range(W):
f = False
ni = 0
for j in range(H):
if wn[ni] + int(S[j][i]) > K:
tmp += 1
f = True
break
else:
wn[ni] += int(S[j][i])
if n >> j & 1:
ni += 1
if f:
if i == 0:
tmp = float("inf")
for j in range(H):
wn[j] = 0
ni = 0
for j in range(H):
wn[ni] += int(S[j][i])
if wn[ni] > K:
tmp = float("inf")
if n >> j & 1:
ni += 1
ans = min(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
| s = input()
p = input()
str2 = s + s
if str2.find(p) >= 0:
print("Yes")
else:
print("No") | 0 | null | 25,327,033,923,684 | 193 | 64 |
#coding: UTF-8
l = raw_input().split()
l.sort()
a = int(l[0])
b = int(l[1])
c = int(l[2])
print "%d %d %d" %(a, b, c) | #n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
from collections import deque
# n = int(input())# ノードの数
n, m = map(int, input().split())
# 隣接リストで格納する
adjl = [[] for _ in range(n+1)]
for i in range(m): # 隣接関係を受け取る
a, b = map(int, input().split())
adjl[a].append(b)
adjl[b].append(a)
NIL = -1 # 未発見を示す値
d = [-1 for i in range(n+1)] # 頂点1からの距離を格納するリスト
color = [NIL for i in range(n+1)] # 未到達かを示すリスト
def bfs(start_node, color_id): # start_nodeは探索の開始点
global color, d
q = deque([start_node])
d[start_node] = 0
color[start_node] = color_id
while len(q) != 0:
u = q.popleft()
for v in adjl[u]:
if color[v] == NIL:
d[v] = d[u]+1
color[v] = color_id
q.append(v)
color_id = 0
for u in range(1, n+1): # node全てからスタートする
if color[u] == NIL:
color_id += 1
bfs(u, color_id)
colordic = {}
for u in range(1, n+1):
colordic[color[u]] = True
print(len(colordic)-1)
| 0 | null | 1,356,418,000,292 | 40 | 70 |
import sys
from heapq import heappop, heappush
from scipy.sparse.csgraph import floyd_warshall
input = sys.stdin.readline
def main():
n,w,l = map(int,input().split())
d = [[10**15 for _ in range(n)] for _ in range(n)]
for _ in range(w):
x,y,z = map(int,input().split())
x -= 1
y -= 1
if z > l:
continue
d[x][y] = z
d[y][x] = z
for i in range(n):
d[i][i] = 0
d = floyd_warshall(d)
G = [[10**15 for _ in range(n)] for _ in range(n)]
for i in range(n-1):
for j in range(i+1,n):
if d[i][j] <= l:
G[i][j] = 1
G[j][i] = 1
for i in range(n):
G[i][i] = 0
G = floyd_warshall(G)
q = int(input())
for _ in range(q):
s,t = map(int,input().split())
s -= 1
t -= 1
ans = G[s][t]
if ans == 10**15:
print(-1)
continue
print(int(ans)-1)
if __name__ == "__main__":
main() | counts_number = int(input())
tmp_map = map(int, input().split())
num_list = list(tmp_map)
even_of_num_list = []
approve_counts = 0
for i in num_list:
if i % 2 == 0:
even_of_num_list.append(i)
for x in even_of_num_list:
if x % 3 == 0 or x % 5 == 0:
approve_counts += 1
if approve_counts == len(even_of_num_list):
print('APPROVED')
else:
print('DENIED') | 0 | null | 121,228,415,155,200 | 295 | 217 |
x, y, a, b, c = list(map(int, input().split()))
pA = list(map(lambda x: (int(x), "a"), input().split()))
pB = list(map(lambda x: (int(x), "b"), input().split()))
pC = list(map(lambda x: (int(x), "c"), input().split()))
apples = sorted(pA + pB + pC)
cntA = 0
cntB = 0
cntC = 0
cnt = 0
while cntA + cntB + cntC < x+y:
val, col = apples.pop()
if col == "a" and cntA < x:
cntA += 1
cnt += val
elif col == "b" and cntB < y:
cntB += 1
cnt += val
elif col == "c":
cntC += 1
cnt += val
print(cnt) | x,y,a,b,c = map(int,input().split())
R=list(map(int,input().split()) )
G=list(map(int,input().split()) )
W=list(map(int,input().split()) )
R.sort(reverse=True)
G.sort(reverse=True)
Z = W+R[0:x] + G[0:y]
Z.sort(reverse=True)
print(sum(Z[0:x+y]))
| 1 | 44,849,318,264,422 | null | 188 | 188 |
N=int(input())
c=list(input())
R=c.count('R')
L=c[:R].count('R')
print(R-L) | if __name__ == '__main__':
n = int(input())
A = list(input())
white = A.count("W")
red = A.count("R")
#最終形を作る
B = sorted(A)
#現在の形と最終形との比較をする
a = b = 0
for w,r in zip(A,B):
if w != r:
if w == "W":
a += 1
else:
b += 1
#結果
com = min(a,b)
bg = max(a,b)
dif = bg - com
ans = com + dif
print(ans)
| 1 | 6,234,529,037,440 | null | 98 | 98 |
import math
N=int(input())
def era(n):
prime=[]
furui=list(range(2,n+1))
while furui[0]<math.sqrt(n):
prime.append(furui[0])
furui=[i for i in furui if i%furui[0]!=0]
return prime+furui
furui=era(10**6+7)
minfac=list(range(10**6+8))
for i in furui:
for j in range(i,(10**6+7)//i+1):
if minfac[i*j]==i*j:
minfac[i*j]=i
ans=0
for i in range(1,N):
temp=1
temp2=1
l=1
while i != 1:
if minfac[i]!=l:
temp*=temp2
temp2=2
else:
temp2+=1
l=minfac[i]
i//=l
temp*=temp2
ans+=temp
print(ans) | import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
n = int(input())
ans = 0
for i in range(1,n):
ans += (n-1)//i
print(ans)
if __name__ == "__main__":
main() | 1 | 2,610,233,339,360 | null | 73 | 73 |
while True:
H,W = map(int,input().split())
if H == 0 and W == 0:
break
for i in range(H):
for k in range(W):
if i == 0 or i == H-1 or k == 0 or k == W-1:
print("#",end = "")
else:
print(".",end = "")
print()
print()
| while True:
h,w=map(int,input().split())
if h==w==0:break
for hh in range(h):
ol=''
for ww in range(w):
if hh == 0 or ww == 0 or hh == h - 1 or ww == w - 1:
ol+='#'
else:
ol+='.'
print(ol)
print() | 1 | 832,171,938,948 | null | 50 | 50 |
def merge(A, left, mid, right):
L = A[left:mid] + [2147483648]
R = A[mid:right] + [2147483648]
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
global c
c += right - left
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
c = 0
n = int(input())
A = list(map(int, input().split()))
mergeSort(A, 0, n)
print(" ".join(map(str, A)))
print(c)
| r = int(input())
import math
pi = math.pi
l = 2 * pi * r
print(l) | 0 | null | 15,624,058,178,080 | 26 | 167 |
N = int(input())
taro_p = hana_p = 0
for n in range(N):
tw,hw = input().split()
if tw == hw:
taro_p += 1
hana_p += 1
elif tw < hw:
hana_p += 3
else :
taro_p += 3
print(taro_p,hana_p) | S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:]
print('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No') | 0 | null | 24,301,432,708,920 | 67 | 190 |
SW = input()
SW = [int(i) for i in list(SW.split())]
if SW[0]<=SW[1]:
print('unsafe')
else:
print('safe') | n = int(input())
x = input().split()
min = 2**50
for p in range(100):
min_i = 0
if p in x:
continue
for i in x:
min_i = min_i + (int(i) - p)**2
if min_i <= min:
min = min_i
print(min) | 0 | null | 47,310,588,390,328 | 163 | 213 |
n = int(input())
x = list(map(int,input().split()))
k = []
def kyori(p):
m = 0
for i in range(n):
m += (p-x[i])**2
return m
for i in range(1,101):
k.append(kyori(i))
print(min(k)) | N,K = map(int ,input().split())
D = []
A = []
for _ in range(K):
D.append(int(input()))
A.append(list(map(int, input().split())))
# お菓子を持っている人を数える。すると持っていない人間は、Nから持っている人の数を引いたもの
l = [0]*N
for i in range(K):
for j in range(D[i]):
l[A[i][j]-1] = 1
print(N - sum(l)) | 0 | null | 44,971,755,759,700 | 213 | 154 |
import math
a,b,H,M=map(int,input().split())
theta_a = math.pi/6 * (H+M/60)
theta_b = math.pi*2*M/60
ans = math.sqrt((b*math.cos(theta_b) - a*math.cos(theta_a))**2 + (b*math.sin(theta_b) - a*math.sin(theta_a))**2)
print(ans) | from collections import Counter
def solve():
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
Q = int(input())
ans = [0]*Q
total = sum(A)
for i in range(Q):
x,y = map(int, input().split())
total += c[x]*(y-x)
c[y] += c[x]
c[x] = 0
ans[i] = total
return ans
print(*solve(),sep='\n')
| 0 | null | 16,269,354,077,112 | 144 | 122 |
num_limit = int(input())
num_list = [0] * num_limit
j_limit = int(num_limit ** 0.5)
for j in range(1,j_limit+1):
for k in range(1,j + 1):
if num_limit < j**2 + k**2 + j*k:
break
for l in range(1,k+1):
if num_limit < j**2 + k**2 + l**2 + j*k + k*l + l*j:
break
elif num_limit >= j**2 + k**2 + l**2 + j*k + k*l + l*j:
if j > k:
if k > l:
num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 6
else:
num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 3
elif k > l:
num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 3
else:
num_list[j**2 + k**2 + l**2 + j*k + k*l + l*j-1] += 1
for i in num_list:
print(i) | # 逆元を利用した組み合わせの計算
#############################################################
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
mod = 10**9 + 7
NN = 10**6
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, NN + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
#############################################################
N, K = map(int, input().split())
# M = 空き部屋数の最大値
M = min(N - 1, K)
"""
m = 0,1,2,...,M
N部屋から、空き部屋をm個選ぶ
-> N_C_m
残りの(N-m)部屋に、N人を配置する（空き部屋が出来てはいけない）
まず、(N-m)部屋に1人ずつ配置し、残ったm人を(N-m)部屋に配置する
これは、m個のボールと(N-m-1)本の仕切りの並び替えに相当する
-> (m+N-m-1)_C_m = N-1_C_m
"""
ans = 0
for m in range(0, M + 1):
ans += cmb(N, m, mod) * cmb(N - 1, m, mod)
ans %= mod
print(ans)
| 0 | null | 37,756,032,319,210 | 106 | 215 |
#!/usr/bin/env python
# coding: utf-8
# In[1]:
n,a,b = map(int, input().split())
# In[2]:
def nCk(n, k, mod):
a = 1
for i in range(n, n-k, -1):
a *= i
a %= mod
b = 1
for i in range(1, k+1):
b *= i
b %= mod
a *= pow(b, mod-2, mod)
return a
# In[3]:
mod = 10**9+7
ans = pow(2, n, mod)-1
ans -= nCk(n, a, mod) + nCk(n, b, mod)
print(ans%mod)
# In[ ]:
| MOD = 10**9+7
def solve(n):
"""
0: {}
1: {0}
2: {9}
3: {0,9}
"""
dp = [[0]*4 for i in range(n+1)]
dp[0][0] = 1
x = [1,0,0,0]
for i in range(n):
x = [
(8*x[0]) % MOD,
(9*x[1] + x[0]) % MOD,
(9*x[2] + x[0]) % MOD,
(10*x[3] + x[2] + x[1]) % MOD
]
return x[3]
n = int(input())
print(solve(n)) | 0 | null | 34,530,054,869,262 | 214 | 78 |
n,a,b=map(int,input().split())
if (b-a)%2==0:
print((b-a)//2)
else:
c=min(b-1,n-a)
e=min(a-1,n-b)
d=(b-a-1)//2+e+1
print(min(c,d)) | def shuffle(s,n):
if len(s) <= 1:
return s
ans = s[n:] + s[:n]
return ans
def main():
while True:
strings = input()
if strings == "-":
break
n = int(input())
li = []
for i in range(n):
li.append(int(input()))
for i in li:
strings = shuffle(strings, i)
print(strings)
if __name__ == "__main__":
main() | 0 | null | 55,805,694,397,856 | 253 | 66 |
w=raw_input().lower()
c=0
while 1:
t=map(str,raw_input().split())
if t[0]=="END_OF_TEXT":
break
for i in range(len(t)):
if t[i].lower()==w:
c+=1
print c | w = input().casefold()
c = 0
while True:
_ = input()
if(_ == "END_OF_TEXT"):
break
t = _.casefold().split()
c += t.count(w)
print(c) | 1 | 1,833,463,878,720 | null | 65 | 65 |
n,k=map(int,input().split())
mod=10**9+7
def f(i):
return (1+i*(n-i+1))%mod
ans=0
for i in range(k,n+2):
ans=(ans+f(i))%mod
print(ans) | N, K = map(int, input().split())
MOD = 10 ** 9 + 7
ans = 1
for i in range(K, N + 1):
ans += i * (2 * N - i + 1) // 2 % MOD - i * (i - 1) // 2 % MOD + 1
ans %= MOD
print(ans) | 1 | 33,184,216,028,512 | null | 170 | 170 |
def bubble_sort_aoj(nums, len):
'''バブルソート：隣接項の比較'''
flag = True
count = 0
while flag:
flag = False
for i in range(len - 1, 0, -1):
if nums[i] < nums[i-1]:
nums[i], nums[i-1] = nums[i-1], nums[i]
flag = True
count += 1
return nums, count
if __name__ == '__main__':
N = int(input())
A = list(map(int, input().split(' ')))
ans = bubble_sort_aoj(A, N)
print(' '.join([str(x) for x in ans[0]]))
print(ans[1])
| def bubbleSort(a, n):
flag = True
count = 0
while flag:
flag = False
for j in range(1, n)[::-1]:
if a[j] < a[j-1]:
a[j], a[j-1] = a[j-1], a[j]
count += 1
flag = True
return count
def show(a, n):
for i in range(n):
if i == n-1:
print "%d" % a[i]
else:
print "%d" % a[i],
n = input()
a = map(int, raw_input().split())
c = bubbleSort(a, n)
show(a, n)
print "%d" % c | 1 | 17,042,717,380 | null | 14 | 14 |
import sys
input = sys.stdin.readline
N, T = map(int, input().split())
a = []
for _ in range(N):
w, v = map(int, input().split())
a.append((w, v))
a.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(N):
w, v = a[i]
for j in range(T):
if j + w >= T:
dp[i + 1][T] = max(dp[i + 1][T], dp[i][j] + v)
else:
dp[i + 1][j + w] = max(dp[i + 1][j + w], dp[i][j] + v)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
dp[i + 1][T] = max(dp[i + 1][T], dp[i][T])
print(max(dp[-1])) | Lists = [1, 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]
x = int(input())
print(Lists[x]) | 0 | null | 100,510,437,805,240 | 282 | 195 |
while(True):
H, W = map(int, input().split())
if(H == W == 0):
break
first = False
for i in range(H):
print("#" * W)
print() | while True:
height, width = [int(x) for x in input().split(" ")]
if height == width == 0:
break
for i in range(height - 1):
print("#" * width)
print("#" * width + "\n") | 1 | 783,733,783,430 | null | 49 | 49 |
from math import pi
r = float(input())
S = r * r * pi
L = 2 * r * pi
print(f'{(S):.6f} {(L):.6f}')
| import math
r = input()
s = r * r * math.pi
l = 2 * r * math.pi
print "%.6f %.6f" %(s, l) | 1 | 645,253,303,970 | null | 46 | 46 |
while True:
[h,w] = map(int,input().split())
if h==0 and w ==0: break
s = ['#'*w+'\n', (('#' + '.'*(w-2) + '#')[0:w]+'\n')*(h-2), '#'*w+'\n' ]
t = list(filter(lambda x: x!='', s))
print(''.join(t[0:h])) | import sys
num = []
for i in sys.stdin:
H, W = i.split()
if H == W == '0':
break
num.append((int(H), int(W)))
for cnt in range(len(num)):
for h in range(num[cnt][0]):
for w in range(num[cnt][1]):
if w == 0 or w == num[cnt][1] - 1 or h == 0 or h == num[cnt][0] - 1:
print('#',end='')
else:
print('.',end='')
print()
print() | 1 | 813,612,032,338 | null | 50 | 50 |
# 問題: https://atcoder.jp/contests/abc144/tasks/abc144_b
n = int(input())
has_multiple = False
for a in range(1, 10):
if n % a > 0:
continue
b = n / a
if 0 < b < 10:
has_multiple = True
break
if has_multiple:
print('Yes')
else:
print('No')
| N=int(input())
ok=0
for i in range(1,10):
j = N/i
if j==int(j) and 1<=j<=9:
ok=1
print('Yes')
break
if ok==0:print('No') | 1 | 160,321,133,691,330 | null | 287 | 287 |
a, b, c = [int(i) for i in input().rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
if c % i == 0:
cnt += 1
print(cnt)
| a,b,c = map(int, input().split())
m=0
while b >=a:
if c % b == 0 :
m = m + 1
else:
pass
b = b-1
print(m) | 1 | 568,378,700,298 | null | 44 | 44 |
l = [int (x) for x in input().split()]
for i in range (5):
if l[i] == 0:
print (i+1)
break
| Xs = [int(x) for x in input().split()]
print(Xs.index(0) + 1) | 1 | 13,433,002,052,540 | null | 126 | 126 |
s = input()
MOD = 2019
d = [0] * MOD
d[0] = 1
r = 0
t = 1
for i in reversed(s):
r += int(i) * t
r %= MOD
t *= 10
t %= MOD
d[r] += 1
print(sum(i * (i - 1) // 2 for i in d)) | import decimal
import numpy as np
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,K = LI()
A = LI()
ans = []
for i in range(K,N):
if A[i-K] < A[i]:
ans.append('Yes')
else:
ans.append('No')
print('\n'.join(ans)) | 0 | null | 19,001,980,928,062 | 166 | 102 |
L,R,d = list(map(int, input().split()))
count = 0
for i in range(L,R+1):
count += (i%d == 0)
print(count) | def main():
input()
in_a = list(map(int, input().split()))
leaves = [0] * len(in_a)
leaves[-1] = in_a[-1]
if in_a[0] > 1:
print(-1)
return
#for i in range(len(in_a)-2, -1, -1):
# leaves[i] = leaves[i+1] + in_a[i]
for i in range(len(in_a) - 1, 1, -1):
leaves[i-1] = leaves[i] + in_a[i-1]
node = 1
total = 1
for i in range(1, len(in_a)):
n = (node - in_a[i-1]) * 2
if n < in_a[i]:
print(-1)
return
node = min(n, leaves[i])
total += node
print(total)
if __name__ == '__main__':
main()
| 0 | null | 13,229,190,268,512 | 104 | 141 |
#ciが R のとき赤、W のとき白です。
#入力
#N
#c1...cN
N = int(input())
C = input()
Rednum = C.count('R')
#print(Rednum)
#Rの数 - 左にある赤の数が答
NewC = C[:Rednum]
#print(NewC)
Whinum = NewC.count('R')
print(Rednum - Whinum)
| N = int(input())
S = input()
from collections import Counter
d = Counter(list(S))
allr = d["R"]
leftd = Counter(list(S[:allr]))
leftr = leftd["R"]
print(allr-leftr) | 1 | 6,336,218,600,348 | null | 98 | 98 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.