code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
from functools import reduce
N = int(input())
A = list(map(int, input().split()))
B = reduce(lambda x, y: x^y, A)
ans = []
for a in A:
ans.append(B^a)
print(*ans) | N=int(input())
*A,=map(int,input().split())
total=0
for i in range(N):
total ^= A[i]
print(*[total^A[i] for i in range(N)]) | 1 | 12,520,446,338,860 | null | 123 | 123 |
def main():
r,c = map(int, input().split())
chart = [list(map(int, input().split())) for i in range(r)]
total = [0 for i in range(c)]
for row in chart:
print((' '.join(map(str, row))) + ' ' + str(sum(row)))
total = [x + y for (x, y) in zip(total, row)]
print((' '.join(map(str, total))) + ' ' + str(sum(total)))
main() | rc = input().split()
r, c = map(int, rc)
ss= [[int(i) for i in input().split()] for j in range(r)]
colsum = [0 for i in range(c+1)]
for row in ss:
row.append(sum(row))
colsum = [x+y for (x, y) in zip(colsum, row)]
print(' '.join(map(str, row)))
print(' '.join(map(str, colsum))) | 1 | 1,376,934,182,380 | null | 59 | 59 |
X = input()
X = int(X)
if X < -40 or X > 40:
print("invalid number 'X'")
elif X >= 30:
print("Yes")
else:
print("No")
| n = int(input())
ps = [int(i) for i in input().split()]
now = ps[0]
cnt = 1
for p in ps:
if p < now:
cnt += 1
now = p
print(cnt) | 0 | null | 45,831,078,559,308 | 95 | 233 |
# Fast IO (be careful about bytestring, not on interactive)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
N = int(input())
sumList = []
subList = []
for _ in range(N):
x,y = map(int,input().split())
sumList.append(x + y)
subList.append(x - y)
print(max(max(sumList) - min(sumList),max(subList) - min(subList))) | n = int(input())
s = ['a']*(n)
#print(''.join(s))
def dfs(x,alp):
if x == n:
print(''.join(s))
return
for i in range(alp+1):
#print(x,alp,i)
s[x] = chr(i+ord("a"))
dfs(x+1,max(i+1,alp))
#print(alp)
dfs(0,0) | 0 | null | 27,946,927,678,560 | 80 | 198 |
a,b=map(int,input('').split(' '))
if a<=b:
s=''
for i in range(b):
s=s+str(a)
print(s)
elif b<a:
s=''
for i in range(a):
s=s+str(b)
print(s) | A, B, C = map(int, input().split())
print(str(C) + " " + str(A) + " " + str(B)) | 0 | null | 61,474,895,081,600 | 232 | 178 |
n,m=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n):a[i]*=-1
a.sort()
from bisect import bisect_left,bisect_right
def check(mid):
mm=0
for i in range(n):
if -(a[i]+a[0])<mid:break
mm+=bisect_right(a,-(mid+a[i]))
return mm
ok=0
ng=10**10+7
while ng!=ok+1:
mid=(ok+ng)//2
if check(mid)>=m:ok=mid
else:ng=mid
b=[0]
for i in a:b.append(b[-1]+i)
ans=0
for i in range(n):
if -(a[i]+a[0])<ok:break
ind=bisect_right(a,-(ok+a[i]))
ans+=a[i]*ind
ans+=b[ind]
print(-(ans+(check(ok)-m)*ok)) | import sys
input = sys.stdin.readline
mm = 10**10
k = mm.bit_length()
K = 1<<k
nu = lambda L: int("".join([bin(K+a)[-k:] for a in L[::-1]]), 2)
st = lambda n: bin(n)[2:] + "0"
li = lambda s: [int(a, 2) if len(a) else 0 for a in [s[-(i+1)*k-1:-i*k-1] for i in range(200001)]]
n,m = map(int, input().split())
a = [int(i) for i in input().split()]
b = [0]*100001
for i in a:
b[i] += 1
c = li(st(nu(b)*nu(b)))
ans = 0
for i in range(200001)[::-1]:
if c[i] > 0:
p = min(m,c[i])
m -= p
ans += i*p
if m == 0:
break
print(ans) | 1 | 108,552,732,339,392 | null | 252 | 252 |
A, B, K = map(int, input().split())
if A >= K:
print(str(A - K) + ' ' + str(B))
else:
print(str(0) + ' ' + str(max((B - (K - A)), 0)))
| A, B, K = map(int, input().split())
if A < K:
K = K - A
A = 0
elif A == K:
A = 0
K = 0
else: # K < A
A = A - K
K = 0
if B < K:
K = K - B
B = 0
elif B == K:
B = 0
K = 0
else: # K < B
B = B - K
K = 0
print(A, B)
| 1 | 104,095,507,159,422 | null | 249 | 249 |
while(True):
x, y = map(int, input().split())
if(x == y == 0):
break
if(x <= y):
print("%d %d" % (x, y))
else:
print("%d %d" % (y, x)) | import math
X = int(input())
year = 0
money = 100
while(money < X):
money = money * 101//100
year += 1
print(year)
| 0 | null | 13,814,070,444,672 | 43 | 159 |
x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count == 2:
print(ans + 400000)
else:
print(ans) | n = int(input())
l = list(map(int, input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
li = [l[i], l[j], l[k]]
m = max(li)
if 2*m < sum(li) and len(set(li)) == 3:
ans += 1
print(ans) | 0 | null | 72,825,565,106,242 | 275 | 91 |
n = int(input())
s = list(map(int,input().split()))
q = int(input())
r = list(map(int,input().split()))
cou = 0
for i in range(q):
for j in range(n):
if(s[j] == r[i]):
cou += 1
break
print(cou)
| N,K = map(int, input().split())
H = list(map(int, input().split()))
H_sort = sorted(H)
#print (H)
if K > N:
print(0)
else:
ans = sum(H_sort[0:N-K])
print(ans) | 0 | null | 39,713,778,751,582 | 22 | 227 |
a, b = [int(i) for i in input().split()]
aa = ''.join([str(a) for v in range(b)])
bb = ''.join([str(b) for v in range(a)])
print(aa if aa < bb else bb) | a, b = input().split()
x = a * int(b)
y = b * int(a)
print(min(x, y))
| 1 | 84,168,575,547,090 | null | 232 | 232 |
n=int(input())
r=int(n**0.5+1)
ans=0
for i in range(2,r):
e=0
while n%i==0:
n//=i
e+=1
k=1
while e>=k:
e-=k
ans+=1
k+=1
if n!=1:
ans+=1
print(ans)
| from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
ans_=gcd(i,j)
for l in range(1,k+1):
ans+=gcd(ans_,l)
print(ans) | 0 | null | 26,327,056,089,698 | 136 | 174 |
N,K=list(map(int, input().split()))
H=list(map(int, input().split()))
if K>=N:
print(0)
exit()
H.sort(reverse=True)
H=H[K:]
print(sum(H)) | N, K = map(int, input().split())
Hlist = list(map(int, input().split()))
Hlist = sorted(Hlist)[::-1]
#user K super attack for largest K enemy
remainHlist = Hlist[K:]
attackTimes = sum(remainHlist)
print(attackTimes) | 1 | 79,251,556,687,940 | null | 227 | 227 |
import math
n = int(input())
z = math.floor(math.sqrt(n))
ans = 10 ** 12
for i in range(1,z+1):
if n % i == 0:
m = n // i
ans = min(ans,m+i-2)
print(ans) | N = int(input())
x = int(N**(0.5)) + 1
while True:
if N % x == 0:
print((x-1)+((N//x)-1))
break
x -= 1
| 1 | 161,271,716,160,280 | null | 288 | 288 |
t = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [t[0]*a[0],t[1]*a[1]]
d = [t[0]*b[0],t[1]*b[1]]
if sum(c)==sum(d):
print('infinity')
exit()
elif c[0]==d[0]:
print('infinity')
exit()
if sum(d)>sum(c) and d[0]>c[0]:
print(0)
exit()
elif sum(c)>sum(d) and c[0]>d[0]:
print(0)
exit()
else:
n = (c[0]-d[0])/(sum(d)-sum(c))
if n==int(n):
print(2*int(n))
else:
print(2*int(n)+1)
| x=int(input())
cnt=0
money = 100
while(1):
cnt += 1
money += money//100
if money >= x:
print(cnt)
quit() | 0 | null | 79,175,381,033,792 | 269 | 159 |
a, b, c = map(int, input().split())
l = [n for n in range (a,b+1) if c % n == 0]
print(len(l)) | x, y = map(int, input().split())
if x > y:
x, y = y, x
while x:
x, y = y % x, x
print(y) | 0 | null | 290,169,290,418 | 44 | 11 |
MOD = 10**9+7
n,a,b=map(int, input().split())
ca = 1
cb = 1
for i in range(n-a+1,n+1):
ca *= i
ca%=MOD
for i in range(1,a+1):
ca *= (pow(i,MOD-2,MOD))
ca%=MOD
for i in range(n-b+1,n+1):
cb *= i
cb%=MOD
for i in range(1,b+1):
cb*=(pow(i,MOD-2,MOD))
cb%=MOD
print((pow(2,n,MOD)-1-ca-cb)%MOD)
| MOD = pow(10, 9)+7
def combi(n, k, MOD):
numer = 1
for i in range(n, n-k, -1):
numer *= i
numer %= MOD
denom = 1
for j in range(k, 0, -1):
denom *= j
denom %= MOD
return (numer*(pow(denom, MOD-2, MOD)))%MOD
def main():
n, a, b = map(int, input().split())
allsum = pow(2, n, MOD)
s1 = combi(n, a, MOD)
s2 = combi(n, b, MOD)
ans = (allsum - s1 - s2 - 1)%MOD
print(ans)
if __name__ == "__main__":
main()
| 1 | 65,967,106,407,360 | null | 214 | 214 |
x = int(input())
if x < 30:
print('No')
else: print('Yes') | #174 A
X = input()
print('Yes') if int(X)> 29 else print('No') | 1 | 5,749,597,939,742 | null | 95 | 95 |
# -*- coding: utf-8 -*-
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j -= g
cnt += 1
A[j+g] = v
def shellSort(A, n):
def func(m):
if m == 0:
return 1
else:
return func(m-1)*3 + 1
G = []
i = 0
while True:
gi = func(i)
if gi <= n:
G.append(gi)
i += 1
else:
break
G = G[::-1]
for g in G:
insertionSort(A, n , g)
return A, G
if __name__ == '__main__':
n = int(input())
A = [int(input()) for i in range(n)]
cnt = 0
A, G = shellSort(A, n)
print(len(G))
print(" ".join(map(str, G)))
print(cnt)
for i in range(n):
print(A[i])
| def func(N):
result = 0
for A in range(1,N):
result += (N-1)//A
return result
if __name__ == "__main__":
N = int(input())
print(func(N)) | 0 | null | 1,300,652,709,536 | 17 | 73 |
N = int(input())
Alst = list(map(int, input().split()))
Blst = [0]*(N+1)
num = 0
for i in Alst:
num = num + Blst[i]
Blst[i] += 1
for i in Alst:
k = Blst[i] -1
print(num - k) | import collections
N = int(input())
A = list(map(int,input().split()))
count = collections.Counter(A) #こいつは辞書型みたいなもん
sum = 0
for x in count.values():
sum += x*(x-1)//2
for x in A:
print(sum-(count[x]-1)) | 1 | 47,952,639,948,148 | null | 192 | 192 |
while(1):
str = raw_input()
if str == "-":
break
else:
m = int(raw_input())
for i in range(m):
h = int(raw_input())
str = str[h:len(str)] + str[0:h]
print str | #import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_right
#from copy import deepcopy
#import heapq
#import math
#import string
#from time import time
#from functools import lru_cache,reduce
#from math import factorial
#import sys
#from fractions import gcd
setrecursionlimit(10**6)
input=stdin.readline
print(int(input().rstrip())**2) | 0 | null | 73,935,573,559,718 | 66 | 278 |
import math
from collections import defaultdict
n = int(input())
p = defaultdict(int)
mod = 10 ** 9 + 7
ori = 0
for _ in range(n):
a,b = map(int,input().split())
if a == b == 0:
ori += 1
continue
elif b < 0:
a *= -1
b *= -1
elif b == 0 and a < 0:
a *= -1
if a == 0:
p[(0,1)] += 1
elif b == 0:
p[(1,0)] += 1
else:
g = math.gcd(a,b)
p[(a//g, b//g)] += 1
k = n - ori
ans = ori-1
tmp = 1
l = k
for q,num in sorted(p.items(), reverse=True):
x,y = q
if x <= 0:
break
if p[(-y, x)] >= 1:
a,b = p[(x,y)], p[(-y, x)]
tmp *= pow(2,a,mod) + pow(2,b,mod) - 1
l -= a+b
tmp *= pow(2,l,mod)
print((ans+tmp) % mod) | n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
sum = 0
for i in range(n):
for j in range(i+1,n):
sum += ((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)**0.5
print(2*sum/n) | 0 | null | 84,905,564,771,040 | 146 | 280 |
from math import sqrt, pow
x1, y1, x2, y2 = list(map(float, input().split()))
print(sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)))
| import math;
x1,y1,x2,y2 = map(float,input().split());
x = (x2 - x1)**2;
y = (y2 - y1)**2;
c = math.sqrt(x + y);
print('{:.8f}'.format(c));
| 1 | 157,888,173,370 | null | 29 | 29 |
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18
def solve():
#n = int(stdin.readline().rstrip())
n,k = map(int, stdin.readline().rstrip().split())
H = list(map(int, stdin.readline().rstrip().split()))
#numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
#word = [stdin.readline().rstrip() for _ in range(n)]
#number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
#zeros = [[0] * w for i in range(h)]
H.sort()
if n <= k:
print(0)
exit()
for i in range(k):
H.pop(-1)
print(sum(H))
if __name__ == '__main__':
solve()
|
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N, K = read_ints()
H = read_ints()
if K >= N:
return 0
H.sort(reverse=True)
return sum(H[K:])
if __name__ == '__main__':
print(solve())
| 1 | 78,913,939,504,152 | null | 227 | 227 |
N, M = map(int, input().split())
aaa = list(map(int, input().split()))
acc = sum(aaa)
print('Yes' if sum(4 * M * a >= acc for a in aaa) >= M else 'No')
| N, M = map(int, input().split())
A = list(map(int, input().split()))
k = sum(A) / (4*M)
print('Yes' if [a >= k for a in A].count(True) >= M else 'No') | 1 | 38,836,958,602,860 | null | 179 | 179 |
class Dice():
def __init__(self, nums):
self.nums = nums
self.top, self.front, self.right = 0, 1, 2
def move(self, op):
for c in op:
if c == 'N':
self.top, self.front = self.front, 5 - self.top
elif c == 'S':
self.top, self.front = 5 - self.front, self.top
elif c == 'E':
self.top, self.right = 5 - self.right, self.top
else:
self.top, self.right = self.right, 5 - self.top
dice = Dice([int(n) for n in input().split()])
dice.move(input())
print(dice.nums[dice.top]) | n=int(input())
a=list(map(int,input().split()))
cnt=0
num=1
for i in range(len(a)):
if a[i]!=num:
cnt+=1
else:
num+=1
if num==1:
print(-1)
else:
print(cnt) | 0 | null | 57,345,750,289,920 | 33 | 257 |
import numpy as np
n, *a = map(int, open(0).read().split())
s = np.cumsum(np.array(a))
print(min([abs(s[n - 1] - s[i] - s[i]) for i in range(n - 1)]))
| L=[]
N= 0
while True:
n= int(input())
if(n==0):
break
L.append(n)
N= N+1
for x in range(N):
print("Case",str(x+1)+":",L[x]) | 0 | null | 71,368,403,225,390 | 276 | 42 |
import math
N, D = map(int,input().split())
XY = list(list(map(int,input().split())) for _ in range(N))
count = 0
for i in range(N):
if math.sqrt(XY[i][0] ** 2 + XY[i][1] ** 2) <= D: count += 1
print(count) | from scipy.sparse.csgraph import csgraph_from_dense
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N,M,L=map(int,input().split())
A=[0]*M
B=[0]*M
C=[0]*M
for i in range(M):
A[i],B[i],C[i] = map(int,input().split())
A[i] -=1
B[i] -=1
Q=int(input())
ST=[list(map(int,input().split())) for _ in range(Q)]
G = csr_matrix((C, (A, B)), shape=(N, N))
d = floyd_warshall(G, directed=False)
G=np.full((N,N), np.inf)
G[d<=L]=1
G = csr_matrix(G)
E = floyd_warshall(G, directed=False)
for s,t in ST:
if E[s-1][t-1]==float('inf'):
print(-1)
else:
print(int(E[s-1][t-1]-1)) | 0 | null | 89,732,083,046,630 | 96 | 295 |
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
N,M=map(int,input().split())
h=list(map(int,input().split()))
edge=[[] for _ in range(N)]
for _ in range(M):
a,b=map(int1,input().split())
edge[a].append(b)
edge[b].append(a)
ans=0
for i in range(N):
for nv in edge[i]:
if h[nv]>=h[i]:
break
else:
ans+=1
print(ans) | import collections
n=int(input())
A=list(map(int,input().split()))
if A[0]!=0:
print(0)
exit()
mod=998244353
C=[0]*n
for i in range(n):
C[A[i]]+=1
ans=1
if C[0]!=1:
print(0)
exit()
for i in range(n-1):
ans=ans*pow(C[i],C[i+1],mod)%mod
print(ans) | 0 | null | 89,727,607,262,982 | 155 | 284 |
from sys import stdin
input = stdin.readline
def main():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = sorted(H)
if K == 0:
print(sum(H))
return
print(sum(H[:-K]))
if(__name__ == '__main__'):
main()
| n=int(input())
print(-~n//2/n) | 0 | null | 128,129,572,307,730 | 227 | 297 |
from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
INF, NINF = float('inf'), float('-inf')
def binom_tables(n, q):
fact = [1 for _ in range(n + 1)]
inv = [1 for _ in range(n + 1)]
for i in range(1, n+1):
fact[i] = (fact[i-1] * i) % q
inv[i] = pow(fact[i], q-2, q)
return fact, inv
def main():
MOD = 998244353
n, m, k = rli()
F, I = binom_tables(n, MOD)
def binom(n, k, q):
return (F[n]*((I[k]*I[n-k])%q))%q
ans = 0
for i in range(n-k, n+1):
ans += (binom(n-1, i-1, MOD)*m*pow(m-1, i-1, MOD))%MOD
print(ans % MOD)
if __name__ == "__main__":
main() | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-1]%MOD * invs[n-(i+1) - (k-1)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans%MOD + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 59,393,053,754,324 | 151 | 242 |
s = input()
n = len(s)
l1 = int((n-1)/2)
l2 = int((n+3)/2)
if s == s[::-1] and s[:l1] == s[l2-1:n] :
print('Yes')
else :
print('No') | def palin(x):
#print(x)
if x == x[::-1]: return True
return False
a = input()
n = len(a)
if palin(a) and palin(a[:int((n-1)/2)]) and palin(a[int((n+3)/2)-1:]):
print("Yes")
else: print("No") | 1 | 46,337,364,630,488 | null | 190 | 190 |
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i, v in enumerate(a, 1):
if i % 2 == 1 and v % 2 == 1:
ans += 1
print(ans)
| n = int(input())
p = list(map(int, input().split()))
minp = 2*10**5
ans = 0
for i in range(n):
if minp >= p[i]:
minp = p[i]
ans += 1
print(ans) | 0 | null | 46,768,986,149,900 | 105 | 233 |
n = int(input())
p = [220000] + list(map(int, input().split()))
cnt = 0
m = 220000
for i in range(1, n+1):
now = p[i]
m = min(m, now)
if now == m:
cnt += 1
print(cnt) | N = int(input())
P = list(map(int, input().split()))
m = P[0]
S = 0
for p in P:
if m>=p:
S += 1
m = min(m, p)
print(S) | 1 | 85,346,526,724,060 | null | 233 | 233 |
n = int(input())
ans = 0
for i in range(1, n+1):
g = n // i
ans += i * (g*(g+1))//2
print(ans)
| N = int(input())
S = list(input())
ans = 'No'
if N%2 == 0:
num = int(N/2)
pre = S[:num]
suf = S[num:]
if pre == suf: ans = "Yes"
print(ans) | 0 | null | 79,347,625,433,116 | 118 | 279 |
N = int(input())
A = [int(x) for x in input().split()]
# M以下の整数の素因数分解を高速に
# 前処理O(MloglogM)
# 一計算O(logK)
def mae_syori(M):
D = [0] * (M + 1)
for i in range(2, M+1):
if D[i] != 0: continue
# print(i, list(range(i*2, M + 1, i)))
for j in range(i*2, M+1, i):
if D[j] == 0:
D[j] = i
return D
def p_bunkai(K):
assert 2 <= K <= len(D)-1
k = K
ret = []
while True:
if k == 1:
break
if D[k] == 0:
ret.append((k, 1))
break
else:
p = D[k]
count = 0
while k % p == 0:
count += 1
k //= p
ret.append((p, count))
return ret
# 最大公約数
# ユークリッドの互除法
def my_gcd(a, b):
if b == 0:
return a
else:
return my_gcd(b, a%b)
c_gcd = A[0]
for a in A:
c_gcd = my_gcd(c_gcd, a)
if c_gcd == 1:
max_A = max(A)
D = mae_syori(max_A)
yakusu = set()
ok = True
for a in A:
if a == 1: continue
p_bunkai_result = p_bunkai(a)
p_list = [p[0] for p in p_bunkai_result]
for p in p_list:
if p not in yakusu:
yakusu.add(p)
else:
ok = False
if not ok:
break
if ok:
print('pairwise coprime')
else:
print('setwise coprime')
else:
print('not coprime') | import math
N = int(input())
a = list(map(int,input().split()))
m = max(a)
c = [0] * (m+1)
for i in a:
c[i] += 1
pairwise = True
for i in range(2, m+1, 1):
cnt = 0
for j in range(i, m+1, i):
cnt += c[j]
if cnt > 1:
pairwise = False
break
if pairwise:
print("pairwise coprime")
exit()
g = 0
for i in range(N):
g = math.gcd(g, a[i])
if g == 1:
print("setwise coprime")
exit()
print("not coprime") | 1 | 4,137,139,363,136 | null | 85 | 85 |
c=[[0]*3001for _ in range(3001)]
dp=[[[0]*3001for _ in range(3001)]for _ in range(4)]
h,w,k=map(int,input().split())
for i in range(k):
y,x,v=map(int,input().split())
c[y][x]=v
for i in range(1,h+1):
for j in range(1,w+1):
x=max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])
for k in range(4):
if k:dp[k][i][j]=max(dp[k][i][j-1],dp[k-1][i][j-1]+c[i][j])
else:dp[k][i][j]=max(dp[k][i][j-1],x)
dp[1][i][j]=max(dp[1][i][j],x+c[i][j])
print(max(dp[0][h][w],dp[1][h][w],dp[2][h][w],dp[3][h][w])) | import collections
import itertools
N = int(input())
A = list(map(int, input().split()))
ac = collections.Counter(A)
dp = [0] * (N+1)
dp2 = [0] * (N+1)
total = 0
for no, num in ac.items():
dp[no] = int(num*(num-1)/2)
dp2[no] = dp[no] - (num-1)
total += dp[no]
for k in range(1,N+1):
no = A[k-1]
print(int(total - dp[no] + dp2[no]))
| 0 | null | 26,659,611,125,170 | 94 | 192 |
a,b=[int(i) for i in input().split()]
c=[int(i) for i in input().split()]
if(sum(c)>=a):
print('Yes')
else:
print('No') | ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
H, N = rii()
A = rii()
print("Yes" if H - sum(A) <= 0 else "No") | 1 | 77,730,503,914,938 | null | 226 | 226 |
N = int(input())
C = {i:0 for i in range(1,N+1)}
for x in range(1,142):
for y in range(1,142):
for z in range(1,142):
a = (x+y)**2+(y+z)**2+(z+x)**2
if a%2==0 and a//2<=N:
C[a//2] += 1
for i in range(1,N+1):
print(C[i])
| n=int(input())
arr=list(map(int,input().split()))
c=0
for i in range(0,n,2):
if arr[i]%2!=0:
c+=1
print(c) | 0 | null | 7,844,356,678,062 | 106 | 105 |
N = int(input())
music = []
for _ in range(N):
s, t = map(str, input().split())
music.append([s, int(t)])
number = input()
ans = 0
flag = False
for i in range(N):
if flag:
ans += music[i][1]
elif number == music[i][0]:
flag = True
print(ans) | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
for n in range(2**N):
#Bit全探索
Xls=[0 for i in range(M)]
cost=0
for i in range(N):
if ((n>>i)&1)==1:
cost+=Book[i][0]
for b in range(M):
Xls[b]+=Book[i][b+1]
if min(Xls)>=X:
ans.add(cost)
if min(ans)==INF:
print(-1)
else:
print(min(ans)) | 0 | null | 59,734,518,708,688 | 243 | 149 |
def a174(x):
return "Yes" if x >= 30 else "No"
def main():
x = int(input())
print(a174(x))
if __name__ == '__main__':
main() | a, b, c = list(map(int, input().split()))
frag1 = ((a+b-c)**2 -4*a*b) > 0
frag2 = a+b-c < 0
if frag1 and frag2:
print("Yes")
else:
print("No")
| 0 | null | 28,545,477,590,400 | 95 | 197 |
import sys
# sys.setrecursionlimit(100000)
from collections import deque
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
s = deque(list(input()))
q = input_int()
inverse = False
for _ in range(q):
data = input().split()
if len(data) == 1:
inverse = not inverse
else:
if (data[1] == "1" and not inverse) or (data[1] == "2" and inverse):
s.appendleft(data[2])
else:
s.append(data[2])
if inverse:
print("".join(reversed(s)))
else:
print("".join(s))
return
if __name__ == "__main__":
main()
| # -*- coding:utf-8 -*-
stack = list()
def deal_expression(x):
if x.isdigit():
stack.append(int(x))
else:
a = stack.pop()
b = stack.pop()
if x == '+':
stack.append(b + a)
elif x == '-':
stack.append(b - a)
elif x == '*':
stack.append(b * a)
elif x == '/':
stack.append(b / a)
for x in input().split():
deal_expression(x)
print(stack[0]) | 0 | null | 28,881,288,625,020 | 204 | 18 |
N = int(input())
cc = list(map(int,input().split()))
min_sum = float('inf')
for i in range(1,101):
count = 0
for j in cc:
count += (i-j)**2
min_sum = min(min_sum,count)
print(min_sum) | N = int(input())
X = list(map(int, input().split()))
a = int(sum(X) / N)
b = a + 1
A, B = 0, 0
for x in X:
A += (x - a) ** 2
B += (x - b) ** 2
ans = min(A, B)
print(ans) | 1 | 65,407,540,402,436 | null | 213 | 213 |
i = 1
while True:
a = int(input())
if(a == 0):
break
else :
print(f'Case {i}: {a}')
i += 1
| H,W=map(int,input().split())
def g(j):
if j==".":
return 1 #白
else:
return 0 #黒
S=[]
for j in range(H):
S.append(list(map(g,input())))
Z=[[0]*W for i in range(H)]
for y in range(H):
if y==0:
for x in range(W):
if x==0:
Z[0][0]=1-S[0][0]
else:
Z[y][x]=Z[y][x-1]+(S[y][x-1]==1 and S[y][x]==0)
else:
for x in range(W):
if x==0:
Z[y][x]=Z[y-1][x]+(S[y-1][x]==1 and S[y][x]==0)
else:
Z[y][x]=min(Z[y][x-1]+(S[y][x-1]==1 and S[y][x]==0),Z[y-1][x]+(S[y-1][x]==1 and S[y][x]==0))
print(Z[H-1][W-1]) | 0 | null | 24,874,667,899,708 | 42 | 194 |
x=int(input())
for i in range(1001):
for j in range(100*i,105*i+1):
if x==j:
print(1)
exit(0)
print(0) | def main():
n = int(input())
cnt = 0
# aが1からn-1まで動くと考える
for a in range(1, n):
# a*bがn-1以下であると考える
cnt += (n-1) // a
print(cnt)
if __name__ == '__main__':
main() | 0 | null | 64,897,098,761,728 | 266 | 73 |
num = int(input())
while num != 0:
sum = 0
k = 1
while num>=k:
sum = sum + num%(k*10)//k
k = k*10
print(sum)
num = int(input()) | while True:
x = input()
if x == '0':
break
length = len(x)
tot = 0
for i in range(length):
tot += int(x[i:i + 1])
print(tot)
| 1 | 1,588,561,000,740 | null | 62 | 62 |
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
count = 0
# a =< b
for i in range(a,b+1):
if c % i == 0:
count += 1
print(count)
| a, b, c = map(int, raw_input().split(" "))
cnt = 0
for i in range(a, b + 1) :
if (c % i == 0) :
cnt += 1
print cnt | 1 | 566,948,699,162 | null | 44 | 44 |
N,K,S=map(int, input().split())
MAX = 10**9
if S != MAX:
ans = [S]*K + [S+1]*(N-K)
print(*ans)
else:
ans = [S]*K + [S-1]*(N-K)
print(*ans) | h = list(map(int, input().split()))
m = 0
m += 60 - h[1]
if m != 0: h[0] += 1
m += h[3] + (h[2]-h[0]) * 60
print(m-h[-1]) | 0 | null | 54,804,822,412,348 | 238 | 139 |
S = int(input())
if S == 1:
print(0)
exit()
MOD = 10**9 + 7
A = [0] * (S + 1)
A[0] = 1
A[1] = 0
A[2] = 0
cumsum = 1
for i in range(3, len(A)):
A[i] = (A[i - 1] + A[i - 3]) % MOD
print(A[-1])
| import sys
input = sys.stdin.readline
MAX = 4010
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fact[i] = fact[i-1]*i%MOD
inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
def C(n, r):
if n<r:
return 0
if n<0 or r<0:
return 0
return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD
S = int(input())
ans = 0
for i in range(S+1):
t = S-3*i
ans += C(t+i-1, t)
ans %= MOD
print(ans) | 1 | 3,250,299,070,500 | null | 79 | 79 |
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
n, k = LI()
h = LI()
h.sort()
ans = len([hi for hi in h if hi >= k])
print(ans)
| n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
if k <= a[i]:
res += 1
print(res) | 1 | 178,773,185,824,848 | null | 298 | 298 |
s = input()
len_s = len(s)
s_array = [int(i) for i in s]
mod = 2019
mod_array = [0]*mod
num = 0
mod_array[0] += 1
for i in range(len_s):
num = pow(10, i, mod) * s_array[len_s - i - 1] + num
num %= mod
mod_array[num] += 1
ans = 0
for i in mod_array:
ans += (i * (i - 1)) / 2
print(int(ans)) | from sys import stdin, stdout
s = input()
n = len(s)
P = 2019
# suffix_rems is a list of remainders obtained by dividing the suffix starting at i with P. suffix[i] = s[i:]%P.
suffix_rems = [-1]*n
suffix_rems[-1] = int(s[-1])%P
# Stores the frequency of remainders obtained. We just want number of (i, j) pairs.
rems_d = dict()
rems_d[0] = 1
rems_d[int(s[-1])] = 1
# Those remainders which occur more than once. To pick (i, j) pairs from N, we need N > 1.
special_keys = set()
for i in range(n-1)[::-1]:
rem = (pow(10, n-i-1, P) * int(s[i]) + suffix_rems[i + 1])%P
if rem in rems_d:
rems_d[rem] += 1
special_keys.add(rem)
else:
rems_d[rem] = 1
suffix_rems[i] = rem
ans = 0
for key in special_keys:
t = rems_d[key]
# pick any two of those same remainder indices.
ans += (t*(t-1))//2
print(ans) | 1 | 30,839,319,705,440 | null | 166 | 166 |
n,m,l=map(int, input().split())
A=[ [ int(a) for a in input().split() ] for i in range(n) ]
B=[ [ int(b) for b in input().split() ] for i in range(m) ]
Bt=[ list(x) for x in zip(*B) ]
for a in A:
print(" ".join(map(str, [ sum([ x*y for x,y in zip(a,b) ]) for b in Bt ]))) | while True:
H, W = map(int, raw_input().split())
if H == W == 0:
break
for i in range(H):
if i == 0 or i == H -1:
print "#" * W
else:
print "#" + "."*(W-2) + "#"
print
| 0 | null | 1,113,521,227,940 | 60 | 50 |
N = int(input())
A = list(map(int, input().split()))
if len(A) > len(set(A)):
print("NO")
else:
print("YES") | n = int(input())
a = list(map(int, input().split()))
money = 1000
mount = 0
f = -1
pre = a[0]
for i in range(1, len(a)):
if f < 0:
if a[i] <= pre:
pre = a[i]
continue
mount += money // pre
money %= pre
f *= -1
else:
if a[i] >= pre:
pre = a[i]
continue
money += mount * pre
mount = 0
f *= -1
pre = a[i]
money += mount * a[-1]
print(money)
| 0 | null | 40,658,242,317,952 | 222 | 103 |
from math import log10
n, k = map(int, input().split())
a = list(map(int, input().split()))
MOD = 10**9+7
a.sort()
cnt_neg = 0
cnt_pos = 0
for i in a:
if i <= 0:
cnt_neg += 1
else:
cnt_pos += 1
is_minus = False
k_tmp = k
while k_tmp > 0:
if k_tmp >= 2:
if cnt_neg >= 2:
cnt_neg -= 2
elif cnt_pos >= 2:
cnt_pos -= 2
else:
is_minus = True
break
k_tmp -= 2
else:
if cnt_pos > 0:
cnt_pos -= 1
k_tmp -= 1
else:
is_minus = True
break
k_1 = k
ans1 = 1
l = 0
r = n - 1
if k_1 % 2:
ans1 *= a[-1]
r -= 1
k_1 -= 1
while k_1 >= 2:
if a[l] * a[l+1] > a[r-1] * a[r]:
ans1 *= a[l] * a[l+1]
l += 2
else:
ans1 *= a[r-1] * a[r]
r -= 2
k_1 -= 2
ans1 %= MOD
a.sort(key=abs)
# print(a)
ans2 = 1
for i in a[:k]:
ans2 *= i
ans2 %= MOD
if is_minus:
print(ans2)
else:
print(ans1)
| # coding: utf-8
line = raw_input()
print ''.join([((s.lower() if s.isupper() else s.upper()) if s.isalpha() else s) for s in line]) | 0 | null | 5,437,692,980,540 | 112 | 61 |
import abc
class AdjacentGraph:
"""Implementation adjacency-list Graph.
Beware ids are between 1 and size.
"""
def __init__(self, size):
self.size = size
self._nodes = [[0] * (size+1) for _ in range(size+1)]
def set_adj_node(self, id_, adj_id):
self._nodes[id_][adj_id] = 1
def __iter__(self):
self._id = 0
return self
def __next__(self):
if self._id < self.size:
self._id += 1
return (self._id, self._nodes[self._id][1:])
raise StopIteration()
def dfs(self, handler=None):
visited = []
while len(visited) < self.size:
for id_ in range(1, self.size+1):
if id_ not in visited:
stack = [(id_, 0)]
break
while len(stack) > 0:
i, j = stack.pop()
if j == 0:
if handler:
handler.visit(i)
visited.append(i)
yield i
try:
j = self._nodes[i].index(1, j+1)
stack.append((i, j))
if j not in visited:
stack.append((j, 0))
except ValueError:
if handler:
handler.leave(i)
class EventHandler(abc.ABC):
@abc.abstractmethod
def visit(self, i):
pass
@abc.abstractmethod
def leave(self, i):
pass
class Logger(EventHandler):
def __init__(self, n):
self.log = [(0, 0)] * n
self.step = 0
def visit(self, i):
self.step += 1
self.log[i-1] = (self.step, 0)
def leave(self, i):
self.step += 1
(n, m) = self.log[i-1]
self.log[i-1] = (n, self.step)
def by_node(self):
i = 1
for discover, finish in self.log:
yield (i, discover, finish)
i += 1
def run():
n = int(input())
g = AdjacentGraph(n)
log = Logger(n)
for i in range(n):
id_, c, *links = [int(x) for x in input().split()]
for n in links:
g.set_adj_node(id_, n)
for i in g.dfs(log):
pass
for node in log.by_node():
print(" ".join([str(i) for i in node]))
if __name__ == '__main__':
run()
| a = [0, 0, 0, 0]
for t in range(10):
a[3] = input()
for i in range(2, -1, -1):
if (a[i] < a[i+1]):
a[i], a[i+1] = a[i+1], a[i]
for i in range(0, 3):
print a[i] | 0 | null | 1,719,635,562 | 8 | 2 |
#!/usr/bin/env python
d, t, s = [int(i) for i in input().split(' ')]
if s*t >= d:
print('Yes')
else:
print('No')
| d,t,s=list(map(int,input().split()))
if(t*s<d):
print("No")
else:
print("Yes")
| 1 | 3,545,669,376,590 | null | 81 | 81 |
import sys
input = sys.stdin.readline
def print_ans(X):
"""Test Case
>>> print_ans(30)
Yes
>>> print_ans(25)
No
>>> print_ans(35)
Yes
>>> print_ans(-10)
No
"""
if X >= 30:
print('Yes')
else:
print('No')
if __name__ == '__main__':
X = int(input().rstrip())
print_ans(X)
| a = int(input())
print('YNeos'[a<30::2])
| 1 | 5,684,389,031,330 | null | 95 | 95 |
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
bc = []
for i in range(q):
bci = list(map(int, input().split()))
bc.append(bci)
d = collections.Counter(a)
ans = sum(a)
for i in range(q):
b, c = bc[i]
num = (c-b)*d[b]
ans += num
print(ans)
d[c] += d[b]
d[b] = 0 | def solve():
N = int(input())
A = [int(i) for i in input().split()]
counter = {}
total = 0
for num in A:
total += num
counter[num] = counter.get(num, 0) + 1
Q = int(input())
for i in range(Q):
B,C = [int(i) for i in input().split()]
if B in counter:
B_cnt = counter[B]
counter[C] = counter.get(C, 0) + B_cnt
total += (C-B) * B_cnt
counter[B] = 0
print(total)
if __name__ == "__main__":
solve() | 1 | 12,196,205,850,142 | null | 122 | 122 |
X,K,D = map(int, input().split())
if X<0:
X = -X
if X - K*D >= 0:
print(X-K*D)
else:
i = 0
while True:
i+=1
X -= D
if X < 0:
break
if (K-i) % 2 == 0:
print(abs(X))
else:
print(D-abs(X))
| #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
from itertools import combinations
def enum_sum_numbers(sets, s_range, r):
for cmb in combinations(sets, r):
yield sum(cmb)
if r <= s_range:
for s in enum_sum_numbers(sets, s_range, r+1):
yield s
stdin.readline()
a = [int(s) for s in stdin.readline().split()]
stdin.readline()
ms = [int(s) for s in stdin.readline().split()]
sets = {s for s in enum_sum_numbers(a, len(a), 1)}
for m in ms:
print('yes' if m in sets else 'no') | 0 | null | 2,689,244,173,882 | 92 | 25 |
x=str(input())
for i in range(len(x)):
if int(x[i]) == 7:
print('Yes')
exit()
print('No') | n=int(input())
print(n*(1+n*(1+n))) | 0 | null | 22,287,001,764,738 | 172 | 115 |
class Queue:
def __init__(self,values):
self.values = values
def empty(self):
if len(self.values) == 0:
return True
else:
return False
def enqueue(self,v):
self.values.append(v)
def dequeue(self):
if len(self.values) <= 0:
raise
else:
v = self.values[0]
del self.values[0]
return v
n,q = map(int,raw_input().split(' '))
processes = []
for i in range(n):
n,t = raw_input().split(' ')
processes.append((n,int(t)))
queue = Queue(processes)
clock = 0
done = []
while not queue.empty():
p = queue.dequeue()
n = p[0]
t = p[1]
if t <= q:
clock+=t
done.append((n,clock))
else:
queue.enqueue((n,t-q))
clock+=q
for p in done:
print p[0],p[1] | #!/usr/bin/env python
#-*- coding: utf-8 -*-
class Queue:
def __init__(self):
self.l = []
def enqueue(self, x):
self.l.append(x)
def dequeue(self):
x = self.l[0]
del self.l[0]
return x
def is_empty(self):
return len(self.l) == 0
class Process:
def __init__(self, name, time):
self.name = name
self.time = time
if __name__ == '__main__':
n, q = map(int, raw_input().split())
Q = Queue()
i = 0
while i != n:
tmp = raw_input().split()
Q.enqueue(Process(tmp[0], int(tmp[1])))
i += 1
cnt = 0
while not Q.is_empty():
p = Q.dequeue()
if p.time > q:
p.time -= q
cnt += q
Q.enqueue(p)
else:
cnt += p.time
print p.name, cnt
| 1 | 46,152,819,492 | null | 19 | 19 |
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
ans = 0
for i in range(1,N+1):
if i % 3 == 0 or i % 5 == 0:
continue
ans += i
print(ans) | n=int(input())
ans=0
for i in range(n):
if (i+1)%3==0 and (i+1)%5==0:
continue
elif (i+1)%3==0:
continue
elif (i+1)%5==0:
continue
else:
ans+=i+1
print(ans) | 1 | 34,786,210,152,732 | null | 173 | 173 |
#coding:utf-8
#1_5_B 2015.4.1
while True:
length,width = map(int,input().split())
if length == width == 0:
break
print('#' * width)
print(('#' + '.' * (width - 2) + '#\n') * (length - 2),end='')
print('#' * width)
print() | values = []
while True:
value = input().split()
if int(value[0]) == 0 and int(value[1]) == 0:
break
else:
values.append(value)
for value in values:
m = int(value[0])
n = int(value[1])
for i in range(m):
row_output = ""
for j in range(n):
if i == 0 or i == m -1:
row_output += "#"
else:
if j == 0 or j == n - 1:
row_output += "#"
else:
row_output += "."
print(row_output)
print()
| 1 | 818,224,999,620 | null | 50 | 50 |
N = int(input())
ST = [list(input().split()) for _ in [0]*N]
X = input()
ans = 0
for i,st in enumerate(ST):
s,t = st
if X==s:
break
for s,t in ST[i+1:]:
ans += int(t)
print(ans) | *p, = open(0).read().split()
print(sum(map(int, (p+[0])[p.index(p[-1])+3::2]))) | 1 | 97,294,237,066,180 | null | 243 | 243 |
x, n = map(int, input().split())
p = [int(s) for s in input().split()]
min_val = 101
for i in range(102):
if i not in p:
if abs(i - x) < min_val:
min_val = abs(i - x)
ans = i
print(ans) | x, n = map(int,input().split())
p = list(map(int,input().split()))
d =100
num = 0
if n == 0:
num = x
else:
for i in range(102):
if i not in p:
d_temp = abs(x-i)
if d_temp < d:
d = d_temp
num = i
print(num) | 1 | 14,082,943,934,838 | null | 128 | 128 |
from itertools import *
N = int(input())
H = []
A = []
for i in range(N):
for j in range(int(input())):
x,y = map(int, input().split())
H+=[[i,x-1,y]]
for P in product([0,1],repeat=N):
for h in H:
if P[h[0]]==1 and P[h[1]]!=h[2]:
break
else:
A+=[sum(P)]
print(max(A)) | import sys
import bisect
input = sys.stdin.readline
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N-2):
for j in range(i+1, N-1):
l = L[i] + L[j]
p = bisect.bisect_left(L, l)
# print(p)
ans += p - j - 1
print(ans) | 0 | null | 147,411,125,268,540 | 262 | 294 |
from sys import stdin
f_i = stdin
N, M = map(int, f_i.readline().split())
A = list(map(int, f_i.readline().split()))
A.sort()
from bisect import bisect_left
def shake_count(power):
return N ** 2 - sum(bisect_left(A, power - left_hand) for left_hand in A)
lower = A[0] * 2 - 1
upper = A[-1] * 2 + 1
while lower + 1 < upper:
mid = (lower + upper) // 2
if shake_count(mid) >= M:
lower = mid
else:
upper = mid
X = tuple(bisect_left(A, upper - left_hand) for left_hand in A)
from itertools import accumulate
acc = tuple(accumulate([0] + A))
s = acc[-1]
ans = sum(s - acc[x] for x in X) + sum(a * (N - x) for a, x in zip(A, X))
rest_shake_count = M - (N ** 2 - sum(X))
ans += lower * rest_shake_count
print(ans) | from bisect import bisect_left
N,M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
# 一回の握手でとりうる最大の得点+1
hi = 2*10**5+1
lo = 0
# 一回の握手で得られる幸福度がmid以上になるような握手のみで、握手回数がM回を超えるか調べていく
while hi - lo > 1:
mid = (hi+lo)//2
# 左手の得点をaとしたときに一回の握手でmid点以上得られる握手の組み合わせの数
cnt_hs = 0
for a in A:
# 左手の得点がaのとき、midを超えるにはもう一方の右手でmid-x以上の点をとる必要がある
right = mid - a
idx = bisect_left(A, right)
# Aのうち、idxより先のものを選べばその握手の点がmidを超える
cnt_hs += N - idx
# mid以上の点を得られる握手の組み合わせの数がMを超えているな、必要以上に握手しているから、握手回数を減らす方向に調整
if cnt_hs >= M:
lo = mid
else:
hi = mid
# M回以上の握手するには一回の握手で何点とりましょう、という点の最低ラインloが求まった
B = sorted(A, reverse=True)
accum_B = [0]*N
accum_B[0] = B[0]
for i in range(1,N):
accum_B[i] = accum_B[i-1] + B[i]
ans = 0
cnt_hs = 0
for a in A:
# 一回の握手でlo点以上得るためにとるべき、右手の最低点
right = lo - a
# aを使った場合はlo点以上とれないならスキップ
if A[-1] < right:
continue
idx = bisect_left(A, right)
# aをN-idx回と、Aについてidxより先の部分の和の合計を得る
# sum(A[idx:])みたいにできなくもないけど毎回計算するより累積でやる方が効率いい
ans += a*(N-idx) + accum_B[N-1 - idx]
# lo点以上得られる握手回数を累計
cnt_hs += N-idx
# 設定回数以上握手している場合はその分減らす
# 一回の握手の最低点がloなので、一回オーバーするごとにlo減らす？
# とりうる握手の最低点はloだけど、この設定において実際の握手の最低点はloになっていて、本当にそれが複数あるのか？
if cnt_hs > M:
ans -= (cnt_hs - M) * lo
print(ans) | 1 | 108,063,788,294,180 | null | 252 | 252 |
s = list( raw_input( ) )
n = int( raw_input( ) )
for i in range( n ):
cmd = raw_input( ).split( " " )
a = int( cmd[1] )
b = int( cmd[2] ) + 1
if "print" == cmd[0]:
print( "".join( s[ a:b ] ) )
elif "reverse" == cmd[0]:
for i in reversed( s[ a:b ] ):
s[ a ] = i
a += 1
elif "replace" == cmd[0]:
for i in cmd[3]:
s[ a ] = i
a += 1 | N = int(input())
A = list(map(int, input().split()))
kane=1000
kabu=0
for i in range(N-1):
#print(kane,kabu)
if A[i]<A[i+1]:
kane=kabu*A[i]+kane
kabu=kane//A[i]
kane=kane-kabu*A[i]
else:
kane=kabu*A[i]+kane
kabu=0
print(kane+kabu*A[N-1]) | 0 | null | 4,725,771,586,382 | 68 | 103 |
import sys
import math
import bisect
def main():
n = int(input())
ans = ((n+1)//2) / n
print('%.10f' % ans)
if __name__ == "__main__":
main()
| N=int(input())
A=[int(x) for x in input().split()]
start=0
for i in A:
if (start+1)==i:
start+=1
if start!=0:
print(len(A)-start)
else:
print(-1) | 0 | null | 146,182,741,344,420 | 297 | 257 |
import math
N = float(input())
if(N%2==0):
print(1/2)
else:
print((math.floor(N/2)+1)/N) | n = int(input())
cnt = 0
for i in range(n):
if (i + 1) % 2 == 1:
cnt += 1
print(cnt/n)
| 1 | 177,797,386,164,358 | null | 297 | 297 |
import math
from numpy.compat.py3k import asstr
a, b = map(int, input().split())
ans = int(a * b / math.gcd(a, b))
print(str(ans))
| from fractions import gcd
def lcm(x, y):
return (x * y) // gcd(x, y)
A, B = map(int, input().split())
print(lcm(A, B))
| 1 | 113,078,457,608,060 | null | 256 | 256 |
import math
N = int(input())
Prime = []
ans = 0
def func(n):
while n % 2 == 0:
n = n // 2
Prime.append(2)
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
n = n //i
Prime.append(i)
if n > 2:
Prime.append(n)
func(N)
for i in set(Prime):
c = i
while N % c == 0:
N = N // c
ans += 1
c = c * i
print(ans) | input()
P=map(int,input().split())
ans,mn=0,2*10**5
for x in P:
if mn>=x: ans+=1; mn=x
print(ans)
| 0 | null | 51,048,664,275,160 | 136 | 233 |
import math
from sys import stdin
input = stdin.readline
class Eratos:
def __init__(self, n):
self.is_prime = [True]*(n+1)
self.is_prime[0] = False
self.is_prime[1] = False
self.primes = []
# for i in range(2, int(math.sqrt(n))+1):
for i in range(2, n):
if self.is_prime[i]:
self.primes.append(i)
j = i + i
while j <= n:
self.is_prime[j] = False
j += i
def all(self):
return self.primes
def main():
N = int(input())
MAX = 10**6
primes = Eratos(MAX).all()
cnt = 0
for p in primes:
if N < p: break
e = 1
while not(N % p**e):
N //= (p**e)
cnt += 1
e += 1
if N > MAX:
for p in primes:
while N % p == 0:
N //= p
if N > MAX:
print(cnt+1)
else:
print(cnt)
else:
print(cnt)
if(__name__ == '__main__'):
main()
| n = int(input())
m = n
primes = {}
for i in range(2, int(n**0.5+2)):
while m % i == 0:
m //= i
if i not in primes:
primes[i] = 1
else:
primes[i] += 1
if i > m:
break
if m != 1:
primes[m] = 1
cnt = 0
num = 0
flag = True
while flag == True:
num += 1
flag = False
for i in primes:
if 0 < primes[i] <= num*2:
cnt += 1
primes[i] = 0
elif primes[i] > num*2:
cnt += 1
flag = True
primes[i] -= num
print(cnt) | 1 | 16,925,700,235,390 | null | 136 | 136 |
A,V = list(map(int, input().split()))
B,W = list(map(int, input().split()))
T = int(input())
if V-W > 0 and T*(V-W) >= abs(A-B):
print('YES')
else:
print('NO') | n = int(input())
dp = [0]*(n+1)
for i in range(n+1):
if i == 0:
dp[i] = 1
elif i == 1:
dp[i] = 1
else:
dp[i] = dp[i-1] + dp[i-2]
print(dp[n])
| 0 | null | 7,603,513,781,138 | 131 | 7 |
times, disp_rate = map(int, input().split())
int_rate = 0
# 参加回数が10回未満の場合
if times < 10:
# 内部レートを計算する
int_rate = disp_rate + 100 * (10-times)
else:
int_rate = disp_rate
print(int_rate) | D = int(input())
c = [int(i) for i in input().split()]
s = []
for i in range(D):
tmp = [int(j) for j in input().split()]
s.append(tmp)
t = []
for i in range(D):
t.append(int(input()))
sat = 0
lst = [0 for i in range(26)]
for i in range(D):
sat += s[i][t[i]-1]
lst[t[i]-1] = i + 1
for j in range(26):
sat -= c[j] * ((i + 1) - lst[j])
print(sat) | 0 | null | 36,849,510,751,200 | 211 | 114 |
n,k = map(int, input().split())
price = list(map(int, input().split()))
count = 0
sum = 0
while count < k:
abc = min(price)
sum += abc
price.pop(price.index(abc))
count += 1
print(sum) | #!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, A: "List[int]"):
s = [0 for _ in range(N)]
for Ai in A:
s[Ai - 1] += 1
return "\n".join(map(str, s))
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
A = [
int(next(tokens)) for _ in range(N - 2 + 1)
] # type: "List[int]"
answer = solve(N, A)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 22,046,138,604,928 | 120 | 169 |
h,w,k = list(map(int, input().split()))
s = [input() for _ in range(h)]
strawberry = []
for i in s:
if '#' in i:
strawberry.append(True)
else: strawberry.append(False)
ans = [[0]*w for _ in range(h)]
num = 0
for i in range(h):
flag = 0
if strawberry[i]:
num += 1
for j in range(w):
if s[i][j]=='#':
flag += 1
if flag==2:
num += 1
flag = 1
ans[i][j] = num
tmp = strawberry.index(True)
for i in range(h):
if strawberry[i]==False:
ans[i] = ans[tmp]
else:
tmp = i
for i in ans:
print(' '.join(map(str,i)))
| '''
Created on 2020/08/31
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N,M=map(int,pin().split())
ans=[0]*N
for _ in [0]*M:
s,c=map(int,pin().split())
if s==1 and c==0 and N!=1:
print(-1)
return
if ans[s-1]!=0 and ans[s-1]!=c:
print(-1)
return
ans[s-1]=c
if N==3:
if ans[0]==0:
if ans[1]==0:
print(f"{1}{0}{ans[2]}")
else:
print(f"{1}{ans[1]}{ans[2]}")
return
else:
print(f"{ans[0]}{ans[1]}{ans[2]}")
return
elif N==2:
if ans[0]==0:
print(f"{1}{ans[1]}")
else:
print(f"{ans[0]}{ans[1]}")
return
else:
print(ans[0])
return
return
main() | 0 | null | 101,727,636,362,768 | 277 | 208 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
bl = N == M
print('Yes' if bl else 'No')
| #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, M: int):
if N==M:
print(YES)
else:
print(NO)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
solve(N, M)
if __name__ == '__main__':
main()
| 1 | 83,012,648,107,898 | null | 231 | 231 |
def abc160c_traveling_salesman_around_lake():
k, n = map(int, input().split())
a = list(map(int, input().split()))
total = 0
max_distance = 0
for i in range(n - 1):
total += a[i + 1] - a[i]
max_distance = max(max_distance, a[i + 1] - a[i])
total += k - a[n - 1] + a[0]
max_distance = max(max_distance, k - a[n - 1] + a[0])
print(total-max_distance)
abc160c_traveling_salesman_around_lake() | K, N = map(int, input().split(' '))
A_ls = list(map(int, input().split(' ')))
max_dist = 0
for i in range(N):
nxt = (i + 1 ) % N
dist = A_ls[nxt] - A_ls[i]
if dist < 0:
dist += K
max_dist = max(max_dist, dist)
print(K - max_dist) | 1 | 43,421,577,671,658 | null | 186 | 186 |
l=input().split()
r=int(l[0])
c=int(l[1])
# for yoko
i=0
b=[]
while i<r:
a=input().split()
q=0
su=0
while q<c:
b.append(int(a[q]))
su+=int(a[q])
q=q+1
b.append(su)
i=i+1
# for tate
#x=0
#d=b[0]+b[c+1]+b[2*(c+1)]+b[3*(c+1)]
#x<c+1
x=0
while x<c+1:
d=0
z=0
while z<r:
d+=b[x+z*(c+1)]
z+=1
b.append(d)
x=x+1
# for output
# C=[]
# y=0 (for gyou)
# z=0 (for yoko)
C=[]
y=0
while y<r+1:
z=0
Ans=str(b[y*(c+1)+z])
while z<c:
z+=1
Ans=Ans+" "+str(b[y*(c+1)+z])
C.append(Ans)
y+=1
for k in C:
print(k)
| r, c = map(int, input().split())
data = [list(map(int, input().split())) for i in range(r)]
for i in range(r):
data[i].append(sum(data[i]))
data.append([sum(data[j][i] for j in range(r)) for i in range(c + 1)])
for i in range(r + 1):
for j in range(c + 1):
print(data[i][j], end='')
if j != c:
print(' ', end='')
print('') | 1 | 1,373,436,300,010 | null | 59 | 59 |
from collections import defaultdict
N = int(input())
d = defaultdict(int)
for x in range(1,100):
for y in range(x,100):
for z in range(y,100):
n = x**2+y**2+z**2+x*y+y*z+z*x
if x == y == z:
d[n] += 1
elif x == y or y == z or z == x:
d[n] += 3
else:
d[n] += 6
if n > N:
break
for i in range(1,N+1):
print(d[i])
| n = int(input())
a = list(map(int, input().split()))
number_buka = [0]*n
for i in a:
number_buka[i-1] += 1
for j in number_buka:
print(j) | 0 | null | 20,433,346,566,710 | 106 | 169 |
from numba import jit
@jit
def solve():
n, k = map(int,input().split())
p = list(map(int, input().split()))
c = list(map(int, input().split()))
max_score = -10**10
for i in range(n):
count = 1
val = c[i]
next_i = p[i] -1
while next_i != i:
count += 1
val += c[next_i]
next_i = p[next_i] - 1
if val > 0:
loop_num = (k//count -1)
tmp_score = loop_num * val
max_score = max(tmp_score, max_score)
num = k%count+count
else:
tmp_score = 0
num = min(k, count)
next_i = i
for _ in range(num):
next_i = p[next_i] - 1
tmp_score += c[next_i]
max_score = max(tmp_score, max_score)
print(max_score)
solve() | n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
# 購買する全パターンを回す
most_row_price = 10**10
for i in range(2**n):
comb = str(bin(i)[2:]).zfill(n)
# 購買パターン毎の購入金額と理解度を算出する
money_per_pattern = [0] * n # 購買パターン毎の金額の初期化
understanding = [0] * m # 理解度の初期化
total_money = 0 # 合計購入金額の初期化
for j in range(n):
# 購入しないケースは除外する
if comb[j] == '0':
continue
# 購入するケースだけ、金額算出する
money_per_pattern[j] = ca[j][0]
# 当該パターンの理解度を算出する
for k in range(m):
understanding[k] += ca[j][k+1]
total_money = sum(money_per_pattern)
judge_flg = 'ok'
for j in range(m):
if understanding[j] < x:
judge_flg = 'ng'
if judge_flg == 'ok':
most_row_price = min(total_money, most_row_price)
if most_row_price == 10**10:
print(-1)
else:
print(most_row_price) | 0 | null | 13,779,662,248,330 | 93 | 149 |
import sys
input = sys.stdin.readline
from collections import deque
def bfs(s):
dist = [-1]*N
dist[s] = 0
q = deque([s])
while q:
v = q.popleft()
for nv in adj_list[v]:
if dist[nv]==-1:
dist[nv] = dist[v]+1
q.append(nv)
return dist
N, u, v = map(int, input().split())
adj_list = [[] for _ in range(N)]
for _ in range(N-1):
Ai, Bi = map(int, input().split())
adj_list[Ai-1].append(Bi-1)
adj_list[Bi-1].append(Ai-1)
d1 = bfs(u-1)
d2 = bfs(v-1)
ans = 0
for i in range(N):
if d1[i]<d2[i]:
ans = max(ans, d2[i]-1)
print(ans) | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n = int(input())
s = input()
num = int(s, 2) # 元の2進数を数字に
opc = s.count('1') # 元の2進数のpopcount
# ±1したpopcountで余りを求めておく
if opc > 1:
num1 = num % (opc - 1)
else:
num1 = 0
num0 = num % (opc + 1)
for i in range(n):
if s[i] == '1':
if opc == 1:
print(0)
continue
tmp = (num1 - pow(2, n - 1 - i, opc - 1)) % (opc - 1)
else:
tmp = (num0 + pow(2, n - 1 - i, opc + 1)) % (opc + 1)
# binで2進数にしてpopcount求める
ans = 1
while tmp > 0:
tmp %= bin(tmp).count('1')
ans += 1
print(ans)
| 0 | null | 62,842,612,426,620 | 259 | 107 |
# -*- coding:utf-8 -*-
def main():
List=[]
for i in range(10):
a=int(input())
List.append(a)
List.sort(reverse=True)
print(List[0])
print(List[1])
print(List[2])
if __name__ == '__main__':
main() | a,b,n=[int(x) for x in input().rstrip().split()]
if b<=n:
n=b-1
print(int((a*n)/b)-a*int(n/b))
| 0 | null | 14,049,866,901,928 | 2 | 161 |
#!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, A: "List[int]"):
s = [0 for _ in range(N)]
for Ai in A:
s[Ai - 1] += 1
return "\n".join(map(str, s))
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
A = [
int(next(tokens)) for _ in range(N - 2 + 1)
] # type: "List[int]"
answer = solve(N, A)
print(answer)
if __name__ == "__main__":
main()
| n = int(input())
s = input()
num = len(s)
ans = s.count('R')*s.count('G')*s.count('B')
for i in range(num):
for j in range(i+1, num):
if 0 <= 2*j-i < num:
if s[i] != s[j] and s[j] != s[2*j-i] and s[2*j-i] != s[i]:
ans -= 1
print(ans)
| 0 | null | 34,468,464,984,228 | 169 | 175 |
s = int(input())
a = [0] * (s+1)
if s == 1:
print(0)
else:
a[0]=1
a[1]=0
a[2]=0
mod = 10**9+7
for i in range(3,s+1):
a[i] = a[i-1]+a[i-3]
print(int(a[s] % mod)) | s = int(input())
if(s<3):
print(0)
exit()
l = s//3
cnt = 0
mod = 10**9+7
for i in range(l):
if(i==0):
cnt += 1
continue
remain = s-3*(i+1)
bar_remain = remain+i
n = 1
for j in range(i):
n*=(bar_remain-j)
k = 1
for j in range(1,i+1):
k*=j
cnt += (n//k)%mod
cnt %= mod
print(cnt) | 1 | 3,261,896,887,580 | null | 79 | 79 |
def main():
from bisect import bisect_left as bl
from itertools import accumulate as ac
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
aa = [0]+list(ac(a))
an = aa[n]
ok = 0
ng = 10**10
while abs(ok-ng) > 1:
mid = (ok+ng)//2
if sum([n-bl(a, mid-a[i]) for i in range(n)]) >= m:
ok = mid
else:
ng = mid
c = -m+sum([n-bl(a, ok-a[i]) for i in range(n)])
ans = -c*ok
for i in range(n):
d = bl(a, ok-a[i])
ans += an-aa[d]+(n-d)*a[i]
print(ans)
main() | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
cnt = 0
for i in range(N):
idx = bisect_left(A, x-A[i])
cnt += N-idx
return cnt>=M
def binary_search():
l, r = 0, 10**11
while l<=r:
mid = (l+r)//2
if judge(mid):
l = mid+1
else:
r = mid-1
return r
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
border = binary_search()
acc = [0]
for Ai in A:
acc.append(acc[-1]+Ai)
ans = 0
cnt = 0
for i in range(N):
idx = bisect_left(A, border-A[i]+1)
ans += A[i]*(N-idx)+acc[N]-acc[idx]
cnt += N-idx
ans += (M-cnt)*border
print(ans) | 1 | 107,763,520,899,540 | null | 252 | 252 |
def main():
n = int(input())
c = input()
r = 0
for i in range(n):
if c[i]=='R':
r += 1
ans = 0
for i in range(r):
if c[i]=='W':
ans += 1
print(ans)
if __name__ == "__main__":
main()
| n, a, b = map(int, input().split())
# 偶奇一致
if a % 2 == b % 2:
print((b - a) // 2)
else:
left = a - 1
right = n - b
if left > right:
cnt = right + 1
left = min(a + cnt, n)
print((n - left) // 2 + cnt)
else:
cnt = left + 1
right = max(b - cnt, 1)
print((right - 1) // 2 + cnt)
| 0 | null | 57,763,415,771,500 | 98 | 253 |
N = int(input())
S = [input() for i in range(N)]
S = set(S)
S = list(S)
print(len(S)) | # -*- coding: utf-8 -*-
import io
import sys
import math
def solve():
# implement process
pass
def main():
# input
n, *a = open(0).read().split()
# process
s_list = list(a)
s_set = set()
for s in s_list:
s_set.add(s)
ans = str( len( s_set) )
# output
print(ans)
return ans
### DEBUG I/O ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
5
grape
grape
grape
grape
grape
"""
_EXPECTED = """\
1
"""
def logd(str):
"""usage:
if _DEB: logd(f"{str}")
"""
if _DEB: print(f"[deb] {str}")
### MAIN ###
if __name__ == "__main__":
if _DEB:
sys.stdin = io.StringIO(_INPUT)
print("!! Debug Mode !!")
ans = main()
if _DEB:
print()
if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
else: print(f"!! Failed... !!\nANSWER: {ans}\nExpected: {_EXPECTED}") | 1 | 30,158,652,023,498 | null | 165 | 165 |
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, M, L = map(int, input().split())
dist = [[INF] * N for _ in range(N)]
for i in range(M):
a, b, c = map(int, input().split())
if c > L:
continue
a -= 1
b -= 1
dist[a][b] = c
dist[b][a] = c
Q = int(input())
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
fuel = [[INF] * N for _ in range(N)]
for i in range(N):
for j in range(N):
fuel[i][j] = 1 if dist[i][j] <= L else INF
for k in range(N):
for i in range(N):
for j in range(N):
fuel[i][j] = min(fuel[i][j], fuel[i][k] + fuel[k][j])
for i in range(Q):
s,t = map(int, input().split())
if fuel[s - 1][t - 1] != INF:
print(fuel[s - 1][t - 1] - 1)
else:
print(-1) | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 998244353
def resolve():
""" 愚直解 """
dp = [[0] * (s + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(1, n + 1):
a = A[i - 1]
for prev in range(i):
for j in range(s + 1):
dp[i][j] += dp[prev][j]
if a + j > s:
continue
dp[i][a + j] += dp[prev][j]
dp[i][a + j] %= mod
print(dp)
res = 0
for i in range(1, n + 1):
res += dp[i][-1]
res %= mod
print(res)
def resolve2():
""" DP + 累積和 """
dp = [[0] * (s + 1) for _ in range(n + 1)]
dp[0][0] = 1
cnt_num = [0] * (s + 1)
cnt_num[0] = 1
res = 0
for i in range(1, n + 1):
a = A[i - 1]
for j in range(s + 1):
dp[i][j] += cnt_num[j]
dp[i][j] %= mod
if a + j > s:
continue
dp[i][a + j] += cnt_num[j]
dp[i][a + j] %= mod
for k in range(s + 1):
cnt_num[k] = cnt_num[k] + dp[i][k]
cnt_num[k] %= mod
res += dp[i][-1]
res %= mod
print(res)
if __name__ == '__main__':
n, s = map(int, input().split())
A = list(map(int, input().split()))
resolve2()
| 0 | null | 95,461,684,366,458 | 295 | 138 |
from itertools import product
import numpy as np
n, _, x = map(int, input().split())
arr1 = np.array([list(map(int, input().split())) for _ in range(n)])
ans = 1200000
if np.all(arr1.sum(0)[1:] >= x):
for i in product((0, 1), repeat=n):
arr2 = (i * arr1.T).sum(1)
if np.all(arr2[1:] >= x):
ans = min(ans, arr2[0])
print(ans)
else:
print(-1) | N,M,X=map(int,input().split())
li=[]
ans=100000000000000000000000000000000
for j in range(N):
a=list(map(int,input().split()))
li.append(a)
for k in range(2**N):
temp=0
skill=[0]*M
k=str(bin(k))
k=k[2:]
while len(k)!=N:
k="0"+k
for l in range(N):
if k[l]=="1":
temp+=li[l][0]
for m in range(1,M+1):
skill[m-1]+=li[l][m]
if min(skill)>=X:
if ans>temp:
ans=temp
if ans==100000000000000000000000000000000:
print(-1)
else:
print(ans)
| 1 | 22,420,202,917,478 | null | 149 | 149 |
s,t = map(int,input().split())
k,l = map(int,input().split())
m,n = map(int,input().split())
a = (k-m)*s
b = (l-n)*t
if a+b == 0:
print("infinity")
elif a>0 and a+b>0:
print(0)
elif a<0 and a+b<0:
print(0)
else:
div = abs(a) // abs(a+b)
if div == abs(a) / abs(a+b):
print(div*2)
else:
print(div*2+1) | X,Y,A,B,C =map(int,input().split())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
R = list(map(int,input().split()))
P.sort()
Q.sort()
R.sort()
P_new = P[-X::]
Q_new = Q[-Y::]
agg = P_new + Q_new +R
agg.sort()
print(sum(agg[-X-Y::])) | 0 | null | 88,190,587,865,760 | 269 | 188 |
n = int(input())
lst = [0]*(10**5)
l = list(map(int,input().split()))
total = sum(l)
for x in l:
lst[x-1] += 1
m = int(input())
for i in range(m):
x,y = map(int,input().split())
lst[y-1] += lst[x-1]
total += (y-x) * lst[x-1]
lst[x-1] = 0
print(total)
| import math
while True :
n = int(input())
if n==0:
break;
i = list(map(int, input().split(' ')))
avg = sum(i)/n
j = list(map(lambda x: (x-avg)**2, i))
print("{:.5f}".format(math.sqrt(sum(j)/n))) | 0 | null | 6,167,341,125,918 | 122 | 31 |
a=input()
print(a.replace("?","D"))
| import sys
input=sys.stdin.readline
count=0
res=""
str=input()
list=[]
for i in range(len(str)):
list.append(str[i])
for i in range(len(str)):
if str[i]=="?":
if i==0:
if list[1]=="D":
list[0]="P"
else:
list[0]="D"
elif i+1==len(str):
list[i]="D"
else:
if list[i-1]=="P":
list[i]="D"
else:
if list[i+1]=="D" or list[i+1]=="?":
list[i]="P"
else:
list[i]="D"
for i in range(len(str)):
res+=list[i]
print(res)
| 1 | 18,457,265,288,098 | null | 140 | 140 |
def get_num(n, x):
ans = 0
for n3 in xrange(min(n, x - 3), (x + 2) / 3, -1):
for n2 in xrange(min(n3 - 1, x - n3 - 1), (x - n3) / 2, -1):
if n3 + min(n2 - 1, x - n3 - n2):
ans += 1
return ans
data = []
while True:
[n, x] = [int(m) for m in raw_input().split()]
if [n, x] == [0, 0]:
break
# if x < 3:
# print(0)
# else:
print(get_num(n, x)) | N = int(input())
n = str(N)
le = len(n)
M = 0
for i in range(le):
nn = int(n[i])
M += nn
if M % 9 == 0:
print("Yes")
else:
print("No") | 0 | null | 2,851,981,332,188 | 58 | 87 |
import math
X = int(input())
print(int(360 / math.gcd(360, X))) | N=int(input())
import math
print(360//math.gcd(360,N))
| 1 | 13,075,261,351,708 | null | 125 | 125 |
#ABC162-E Sum of gcd of Tuples(Hard)
"""
問題を「1~kまでの数字を用いた長さnの数列において、gcdがDになる数列はいくつあるか」
というふうに置き換える。(1<=D<=k)
更に制約を替えて、gcdが"Dの倍数"(但し,k以下)でも良いのでそれを全て求めよ、
というふうになった場合、全ての要素はD*n(nは整数,D*n<=k)となる。
この制約によって、そのような数列の数は(k/D)^nとして表せる。(これが大事)
例：
n = 3,k = 4の場合で、D(gcd)=2について求める
(4//2)**3 = 8※
そこで、大きい方からgcdがDになる数列の個数(これをメモ化)を求めていった場合、
Dの倍数がk以下であるならば、予めメモしておいたその値分を引いてやる。
これによって全ての通り数が求まる。
例の続き:
D=2について、D*n <= k という制約のもとでn=2が存在する。
D = 2*2 = 4の時の通り数は、4,4,4の1通り※なので、
D(gcd)=2となるパターン数は、※より、
8-1=7 となる。
(この7通りは2と4からなる数列で、全ての値が4になる場合を引いている)
"""
import sys
readline = sys.stdin.buffer.readline
n,k = map(int,readline().split())
mod = 10**9+7
ans = 0
count = [0]*(k+1)
for D in range(k,0,-1):
mul = k//D #何倍まであり得るか(あり得るものをcountから引く)
res = pow(mul,n,mod)
for i in range(2,mul+1):
res -= count[i*D]
count[D] = res #個数
ans += res*D #個数*値(求めたいのはgcdの合計値のため)
ans %= mod
print(ans) | T1, T2 = list(map(int, input().split()))
A1, A2 = list(map(int, input().split()))
B1, B2 = list(map(int, input().split()))
a, b = A1 * T1, A2 * T2
c, d = B1 * T1, B2 * T2
if a + b == c+ d:
print("infinity")
exit()
if a + b < c+d:
a,b,c,d = c,d,a,b
if a > c:
print(0)
exit()
else:
num = 0
if (c-a) % (a+b-c-d) == 0:
num = 1
print((c-a-1) // (a+b-c-d) * 2+num+1)
| 0 | null | 84,320,729,304,388 | 176 | 269 |
N = int(input())
S = list(input())
ans = []
for s in S:
ord_plus = ord(s)+N
if ord_plus > 90:
ord_plus -= 26
ans.append(chr(ord_plus))
print("".join(ans)) | S=input()
days=[]
day=0
for i in range(3):
if S[i]=='R':
day+=1
else:
day=0
days.append(day)
print(max(days)) | 0 | null | 69,482,859,593,280 | 271 | 90 |
import numpy as np
R=int(input())
circle=float(R*2*np.pi)
print(circle)
| a,b=map(int, input().split())
if a > b:
s = '>'
elif a<b:
s = '<'
else:
s = '=='
print('a {} b'.format(s))
| 0 | null | 15,849,294,068,160 | 167 | 38 |
t = int(input())
if t >= 30:
print('Yes')
else:
print('No') | def solve(x):
if x >= 30:
return "Yes"
else:
return "No"
def main():
x = int(input())
res = solve(x)
print(res)
def test():
assert solve(25) == "No"
assert solve(30) == "Yes"
if __name__ == "__main__":
test()
main()
| 1 | 5,758,978,875,566 | null | 95 | 95 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.