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
|
|---|---|---|---|---|---|---|
a,b=map(int,input().split())
l=list(map(int,input().split()))
z=0
l=sorted(l)
for i in range(a-b):
z+=l[i]
print(z) | n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
ans = 0
for i in range(k, n): ans += h[i]
print(ans) | 1 | 78,944,938,719,384 | null | 227 | 227 |
N,D = (int(x) for x in input().split())
count = 0
for i in range(N):
x,y = (int(z) for z in input().split())
dist = x**2 + y**2
if dist <= D**2:
count += 1
print(count) | def main():
n, d = map(int, input().split())
count = 0
for _ in range(n):
x, y = map(int, input().split())
if (x**2 + y**2) ** 0.5 <= d:
count += 1
print(count)
if __name__ == '__main__':
main()
| 1 | 5,958,392,522,620 | null | 96 | 96 |
N = int(input())
ans = 0
cnt = 1
while N > 0:
if N == 1:
ans += cnt
break
N //= 2
ans += cnt
cnt *= 2
print(ans)
| # coding: utf-8
def bubbleSort(C, N):
for i in xrange(N):
for j in xrange(N-1, i, -1):
if C[j-1][1] > C[j][1]:
C[j], C[j-1] = C[j-1], C[j]
return C
def selectionSort(C, N):
for i in xrange(N):
minj = i
for j in xrange(i, N):
if C[minj][1] > C[j][1]:
minj = j
C[i], C[minj] = C[minj], C[i]
return C
def isStable(in_, out_, N):
for i in xrange(N):
for j in xrange(i + 1, N):
for a in xrange(N):
for b in xrange(a + 1, N):
if in_[i][1] == in_[j][1] and in_[i] == out_[b] and in_[j] == out_[a]:
return False
return True
def main():
N = input()
cards = raw_input().split()
bubble = bubbleSort(cards[:], N)
selection = selectionSort(cards[:], N)
print ' '.join(bubble)
print 'Stable' if isStable(cards, bubble, N) else 'Not stable'
print ' '.join(selection)
print 'Stable' if isStable(cards, selection, N) else 'Not stable'
if __name__ == '__main__':
main() | 0 | null | 39,929,715,917,154 | 228 | 16 |
n,a,b = map(int,input().split())
modnum = 10**9+7
ans = pow(2,n,modnum)-1
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
ans -= combination(n, a, modnum)
ans -= combination(n, b, modnum)
ans %= modnum
print(ans) | def cmb(n,r,mod):
a=1
b=1
r = min(r,n-r)
for i in range(r):
a = a*(n-i)%mod
b = b*(i+1)%mod
return a*pow(b,mod-2,mod)%mod
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = pow(2,n,mod)+mod - cmb(n,a,mod) - cmb(n,b,mod)
ans = (ans -1)%mod
print(ans) | 1 | 66,223,716,769,396 | null | 214 | 214 |
import sys
input = lambda: sys.stdin.readline().rstrip()
n, m = map(int, input().split())
s = input()
ans = []
s = s[::-1]
now = 0
while True:
for i in range(m, -1, -1):
if i == 0:
print(-1)
sys.exit()
if now + i <= n and s[now + i] == "0":
now += i
ans.append(i)
if now == n:
print(*ans[::-1])
sys.exit()
else:
break
| n=int(input())
for i in range(-150,150):
for j in range(-150,150):
if(i**5-j**5==n):
print(i,j)
exit()
| 0 | null | 82,394,640,230,048 | 274 | 156 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, m = map(int, input().split())
h = tuple(map(int, input().split()))
edges = {e:[] for e in range(n)}
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
edges[a].append(h[b])
edges[b].append(h[a])
r = 0
for i, he in enumerate(h):
if not edges[i]:
r += 1
else:
r += he > max(edges[i])
print(r)
if __name__ == '__main__':
main() | def gcd(x, y):
if x < y:
tmp = x
x = y
y = tmp
while y > 0:
r = x % y
x = y
y = r
return print(x)
x_y = input()
tmp = list(map(int, x_y.split()))
x = tmp[0]
y = tmp[1]
gcd(x, y)
| 0 | null | 12,426,357,032,790 | 155 | 11 |
n = int(input())
list_ = [0]*n
joshi_list = list(map(int, input().split()))[::-1]
for i,num in enumerate(joshi_list):
list_[num-1]+=1
for num in list_:
print(num) | input_line = list(map(int,input().split(' ')))
if(input_line[0]>=input_line[2]):
input_line[0] -= input_line[2]
elif((input_line[0]+input_line[1])>=input_line[2]):
input_line[1] -= (input_line[2]-input_line[0])
input_line[0] = 0
else:
input_line[0] = 0
input_line[1] = 0
print(input_line[0],input_line[1])
| 0 | null | 68,631,702,308,022 | 169 | 249 |
def dist(x0, y0, x1, y1):
from math import sqrt
return sqrt((x1-x0)**2 + (y1-y0)**2)
from itertools import permutations
N = int(input())
points = [tuple(map(int, input().split())) for _ in range(N)] #; print(points)
dsum = 0
for i, j in permutations(points, 2):
dsum += dist(*i, *j)
print(dsum/N) | A,B,M=[int(i) for i in input().split() ]
a = [int(i) for i in input().split() ]
b = [int(i) for i in input().split() ]
mlist = []
for i in range(M):
mlist.append( [ int(i) for i in input().split() ] )
print( min(min(a) + min(b), min( [a[i[0]-1] + b[i[1]-1] - i[2] for i in mlist ])))
| 0 | null | 101,693,583,749,696 | 280 | 200 |
import sys
import math
import time
readline = sys.stdin.readline
def main():
listSum = [1, 3, 6]
k = int(input())
sumGCD = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
for c in range(b, k + 1):
sumGCD += gcd(a, b, c) * listSum[len(set([a, b, c])) - 1]
print(sumGCD)
def gcd(a, b, c):
return math.gcd(math.gcd(a, b), c)
if __name__ == '__main__':
s = time.time()
main()
# print(time.time() - s)
| str = input()
q = int(input())
for x in range(q):
en = input().split()
if en[0] == "print":
print(str[int(en[1]):int(en[2])+1])
elif en[0] == "reverse":
str = str[:int(en[1])] + str[int(en[1]):int(en[2])+1][::-1] + str[int(en[2])+1:]
else:
str = str[:int(en[1])] + en[3] + str[int(en[2])+1:]
| 0 | null | 18,808,178,695,812 | 174 | 68 |
# -*- coding: utf-8 -*-
import sys
N,K=map(int, sys.stdin.readline().split())
A=map(int, sys.stdin.readline().split())
A=map(lambda a: (a-1)%K, A)
S=[0]
for a in A:
S.append( (S[-1]+a)%K ) #累積和
d=dict() #要素：要素の数を持つ
ans=0
for i in range(N+1):
x=S[i]%K
if i==0:
d[x]=1
else:
if x in d:
if 2<=K: #K=1の時は自分の値も見てはいけない
ans+=d[x] #自分より前に同じ出現した、自分と同じ要素の数を答えに追加
d[x]+=1
else:
d[x]=1
if 0<=i-K+1:
x_head=S[i-K+1]%K #長さK-1の範囲で配列Sを見るため、１つ進んだら一番先頭の要素を辞書から削除する
d[x_head]-=1
print ans
| A, B, C, D = map(int, input().split())
while(True):
C = C - B
if C <= 0:
ans = 'Yes'
break
A = A - D
if A <= 0:
ans = 'No'
break
print(ans) | 0 | null | 83,707,929,416,632 | 273 | 164 |
def solve(x):
return sum([int(i) for i in str(x)])
if __name__ == '__main__':
while True:
x = int(input())
if x == 0: break
print(solve(x)) | while True:
input = raw_input()
if input == "0":
break
sum = 0
for i in xrange(len(input)):
sum += int(input[i])
print sum | 1 | 1,581,419,961,142 | null | 62 | 62 |
R,C,K= map(int,input().split(" "))
original=[[0]*(C+1) for i in range(R+1)]
for _ in range(K):
r,c,v= map(int,input().split(" "))
original[r][c]=v
d1=[[0]*(C+1) for i in range(R+1)]
d2=[[0]*(C+1) for i in range(R+1)]
d3=[[0]*(C+1) for i in range(R+1)]
for i in range(1,R+1):
for j in range(1,C+1):
curr= original[i][j]
d1[i][j]=max(d1[i-1][j]+curr,d2[i-1][j]+curr,d3[i-1][j]+curr,d1[i][j-1],curr)
d2[i][j]=max(d2[i][j-1],d1[i][j-1]+curr)
d3[i][j]=max(d3[i][j-1],d2[i][j-1]+curr)
print(max(d1[-1][-1],d2[-1][-1],d3[-1][-1])) | n = int(input())
lis = input().split()
dic = {}
for i in range(n):
if lis[i] not in dic:
dic[lis[i]] = 1
else:
dic[lis[i]] += 1
for x in dic.values():
if x != 1:
print("NO")
exit()
print("YES") | 0 | null | 39,526,911,635,222 | 94 | 222 |
import math
def triangle(a, b, deg):
result = {}
rad = math.radians(deg)
c = math.sqrt(a*a+b*b-(2*a*b*math.cos(rad)))
s = (a+b+c)/2
result['area'] = math.sqrt(s*(s-a)*(s-b)*(s-c))
result['perimeter'] = a+b+c
result['height'] = result['area'] * 2 / a
return result
if __name__ == '__main__':
a, b, deg = map(int, input().split())
triangle = triangle(a, b, deg)
print(triangle['area'])
print(triangle['perimeter'])
print(triangle['height'])
| import math
def float_print(v):
print('{:.5f}'.format(v))
a, b, C = map(float, input().split())
C = math.radians(C)
float_print(a * b * math.sin(C) / 2)
float_print(a + b + math.sqrt(math.pow(a, 2) + math.pow(b, 2) - 2 * a * b * math.cos(C)))
float_print(b * math.sin(C)) | 1 | 181,038,138,020 | null | 30 | 30 |
A = []
A.append(input().split())
A.append(input().split())
A.append(input().split())
N = int(input())
b = [input() for _ in range(N)]
# 2次元配列として処理
for i in range(N):
for j in range(3):
if b[i] in A[j]: A[j][A[j].index(b[i])] = True
if (A[0][0]==True and A[1][0]==True and A[2][0]==True) or (A[0][1]==True and A[1][1]==True and A[2][1]==True) or (A[0][2]==True and A[1][2]==True and A[2][2]==True) or (A[0][0]==True and A[0][1]==True and A[0][2]==True) or (A[1][0]==True and A[1][1]==True and A[1][2]==True) or (A[2][0]==True and A[2][1]==True and A[2][2]==True) or (A[0][0]==True and A[1][1]==True and A[2][2]==True) or (A[0][2]==True and A[1][1]==True and A[2][0]==True): print('Yes')
else: print('No') | import numpy as np
A = []
for i in range(3):
b = list(map(int, input().split()))
A.append(b)
N = int(input())
NP_A = np.array(A)
b = []
for n in range(N):
b.append(int(input()))
for n in range(N):
NP_A = np.where(NP_A==b[n], 0, NP_A)
ans = "No"
for i in range(2):
if 0 in NP_A.sum(axis=i):
ans = "Yes"
break
if ans == "Yes":
pass
else:
sum = 0
for i in range(3):
sum += NP_A[i, i]
if sum == 0:
ans = "Yes"
else:
sum = NP_A[0, 2] + NP_A[1, 1] + NP_A[2, 0]
if sum == 0:
ans = "Yes"
print(ans) | 1 | 59,781,148,949,662 | null | 207 | 207 |
from collections import defaultdict
N,P=map(int,input().split())
S=input()
if P==2 or P==5:
ans=0
for i in range(N):
if int(S[i])%P==0:
ans+=i+1
print(ans)
else:
d=defaultdict(int)
a=0
for i in range(N):
a+=int(S[N-i-1])*pow(10,i,P)
a%=P
d[a]+=1
ans=d[0]
for v in d.values():
ans+=v*(v-1)//2
print(ans)
| N, P = map(int, input().split())
S = input()
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
else:
counts = [0] * P
h = 0
d = 1
for s in reversed(S):
m = int(s) * d % P
h = (h + m) % P
counts[h] += 1
d = (d * 10) % P
ans = counts[0]
for i in counts:
ans += (i*(i-1))//2
print(ans)
| 1 | 57,965,132,998,908 | null | 205 | 205 |
n = int(input())
m = int(n ** 0.5 + 1)
for i in range(m,0,-1):
if n % i == 0:
print((i - 1) + ((n // i) - 1))
exit() | S = str(input())
le = len(S)
s = []
for i in range(le):
s.append(S[i])
r = s.count("R")
if r == 0:
print(0)
elif r == 1:
print(1)
elif r == 2:
if s[1] == "S":
print(1)
else:
print(2)
elif r == 3:
print(3)
| 0 | null | 82,944,259,133,412 | 288 | 90 |
MOD = 998244353
N = int(input())
D = list(map(int, input().split()))
D_2 = [0]*(max(D)+1)
for i in D:
D_2[i] += 1
ans = 1 if D_2[0] == 1 and D[0] == 0 else 0
for i in range(1,max(D)+1):
ans *= D_2[i-1]**D_2[i]
ans %= MOD
print(ans)
| n = int(input())
d = list(map(int, input().split()))
a = [0] * n
for i in range(n):
a[d[i]] += 1
if a[0] == 1 and d[0] == 0:
ans = 1
for i in range(1, n):
ans *= a[i-1]**a[i]
ans %= 998244353
print(ans)
else:
print(0) | 1 | 154,618,002,963,600 | null | 284 | 284 |
cnt = 0
while True:
a = input()
if a == '0':
break
cnt += 1
print('Case {0}: {1}'.format(cnt,a)) | class itp1_3b:
def out(self,i,x):
print "Case "+str(i)+": "+str(x)
if __name__=="__main__":
run=itp1_3b()
i=1
while(True):
x=input()
if x==0:
break
run.out(i,x)
i+=1 | 1 | 494,303,036,458 | null | 42 | 42 |
X = int(input())
while True:
flag = True
for i in range(2,X):
if X%i == 0:
flag = False
break
if flag:
break
X += 1
print(X) | X = int(input())
A = []
for i in range(200):
A.append(pow(i, 5))
for i in range(200):
for j in range(200):
a = abs(A[i] - A[j])
b = A[i] + A[j]
if a == X:
if i <= j:
B = [j, i]
else:
B = [i, j]
print(' '.join(map(str, B)))
exit()
elif b == X:
B = [i, -j]
print(' '.join(map(str, B)))
exit()
| 0 | null | 65,492,317,814,160 | 250 | 156 |
from _collections import deque
from _ast import Num
def parser():
while 1:
data = list(input().split(' '))
for number in data:
if len(number) > 0:
yield (number)
input_parser = parser()
def gw():
global input_parser
return next(input_parser)
def gi():
data = gw()
return int(data)
MOD = int(1e9 + 7)
import numpy
from collections import deque
from math import sqrt
from math import floor
import heapq
#https://atcoder.jp/contests/abc148/tasks/abc148_f
#F - Playing Tag on Tree
"""
"""
N = gi()
U = gi()
V = gi()
t = [[] for i in range(N + 1)]
d = [[-1 for i in range(2)] for j in range(N + 1)]
for _ in range(1, N):
a = gi()
b = gi()
t[a].append(b)
t[b].append(a)
def bfs(s, di):
d[s][di] = 0
q = deque()
q.append(s)
while len(q):
v = q.pop()
for u in t[v]:
if d[u][di] >= 0:
continue
d[u][di] = d[v][di] + 1
q.append(u)
bfs(U, 0)
bfs(V, 1)
ans = 0
for l in range(1, N + 1):
if len(t[l]) > 1:
continue
du = d[l][0]
dv = d[l][1]
#print(l, du, dv)
if dv >= du:
ans = max(ans, dv - 1)
print(ans)
| W,H,x,y,r=map(int, input().split(" "))
if x<r or y<r or x+r>W or y+r>H :
print('No')
else :
print('Yes') | 0 | null | 59,173,495,413,370 | 259 | 41 |
import itertools
a, b, c = map(int, input().split(" "))
k = int(input())
f = False
for conb in list(itertools.combinations_with_replacement([0, 1, 2], k)):
a_i = conb.count(0)
b_i = conb.count(1)
c_i = conb.count(2)
if (a * (2 ** a_i) < b * (2 **b_i)) and (b * (2 ** b_i) < c * (2 ** c_i)):
f = True
if f:
print("Yes")
else:
print("No") | a, b, c = map(int, input().split())
k = int(input())
def count(v1, v2, k):
while v1 <= v2 and k >= 0:
v1 *= 2
k -= 1
b = v1
return v1, v2, k
b, _, k = count(b, a, k)
_, _, k = count(c, b, k)
if k < 0:
print('No')
else:
print('Yes')
| 1 | 6,886,156,525,600 | null | 101 | 101 |
def readinput():
n,k=map(int,input().split())
lr=[]
for _ in range(k):
l,r=map(int,input().split())
lr.append((l,r))
return n,k,lr
def main(n,k,lr):
lrs=sorted(lr,key=lambda x:x[0])
MOD=998244353
dp=[0]*(n+1)
dp[1]=1
for i in range(1,n):
#print(i)
if dp[i]==0:
continue
skip=False
for l,r in lrs:
for j in range(l,r+1):
#print('i+j: {}'.format(i+j))
if i+j>n:
skip=True
break
dp[i+j]=(dp[i+j]+dp[i])%MOD
#print(dp)
if skip:
break
return dp[n]
def main2(n,k,lr):
lrs=sorted(lr,key=lambda x:x[0])
MOD=998244353
dp=[0]*(n+1)
ruiseki=[0]*(n+1)
dp[1]=1
ruiseki[1]=1
for i in range(2,n+1):
for l,r in lrs:
if i-l<1:
break
dp[i]+=ruiseki[i-l]-ruiseki[max(1,i-r)-1]
dp[i]=dp[i]%MOD
ruiseki[i]=(ruiseki[i-1]+dp[i])%MOD
return dp[n]
if __name__=='__main__':
n,k,lr=readinput()
ans=main2(n,k,lr)
print(ans)
| n = int(input())
a = list(map(int, input().split()))
a.sort()
def main(a):
if 0 in a:
ans = 0
else:
ans = 1
for item in a:
ans *= item
if ans > 1000000000000000000:
ans = -1
break
return ans
ans = main(a)
print(ans)
| 0 | null | 9,383,907,485,138 | 74 | 134 |
def Range():
a,b,c = list(map(int,input().split()))
if a<b<c:
print("Yes")
else:
print("No")
Range() | def solve(string):
n, k, *p = map(int, string.split())
p = sorted(p)
return str(sum(p[:k]))
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
| 0 | null | 5,932,185,147,086 | 39 | 120 |
num = int(input())
val = num + num **2 + num **3
print(val)
| n = int(input())
S = set(map(int, input().split()))
q = int(input())
T = tuple(map(int, input().split()))
cnt = 0
for n in T:
cnt += n in S
print(cnt) | 0 | null | 5,104,261,338,830 | 115 | 22 |
r,c=map(int,input().split())
table=list()
for i in range(r):
table.append(list(map(int,input().split())))
for i in range(r):
for j in range(c):
print(table[i][j],"",end="")
print(sum(table[i]),sep="")
bottom=list()
for i in range(c):
tmp=0
for j in range(r):
tmp+=table[j][i]
bottom.append(tmp)
for i in bottom:
print(i,"",end="")
print(sum(bottom)) | import math
def gcd(a,b):
if a<b: a,b=b,a
c=a%b
if c==0:
return b
else:
return gcd(b,c)
S=[ int(x) for x in input().split()]
print(gcd(S[0],S[1]))
| 0 | null | 673,825,323,478 | 59 | 11 |
import sys
input = sys.stdin.readline
import collections
import fractions
from collections import defaultdict
import math
n=int(input())
a= [list(map(int, input().split())) for i in range(n)]
b=defaultdict(int)
c=defaultdict(int)
b0=0
c0=0
mod=1000000007
ans=1
cnt=0
for i,j in a:
if i!=0 and j!=0:
x=i
y=j
i //= math.gcd(x, y)
j //= math.gcd(x, y)
i=abs(i)
j=abs(j)
if x*y>0:
b[(i,j,0)]+=1
c[(j,i,1)]+=1
else:
b[(i,j,1)]+=1
c[(j,i,0)]+=1
elif i==0 and j!=0:
b0+=1
elif i!=0 and j==0:
c0+=1
else:
cnt+=1
w=[]
if c0!=0 or b0!=0:
ans*=pow(2,c0+b0)-((pow(2,c0,mod)-1)*(pow(2,b0,mod)-1))
for k,v in b.items():
if c[k]!=0:
ans*=(pow(2,c[k]+v,mod)-(pow(2,c[k],mod)-1)*(pow(2,v,mod)-1))
w.append((pow(2,c[k]+v,mod)-(pow(2,c[k],mod)-1)*(pow(2,v,mod)-1)))
ans%=mod
else:
ans*=pow(2,v,mod)
ans%=mod
w=collections.Counter(w)
w=list(w.most_common())
for i,j in w:
for k in range(j//2):
ans*=pow(i,mod-2,mod)
ans+=cnt-1
print(int(ans%mod)) | import sys
import bisect
N = int(input())
a = list(map(int,input().split()))
numdic = {}
for i, num in enumerate(a):
if num not in numdic:
numdic[num] = [i+1]
else:
numdic[num].append(i+1)
if 1 not in numdic:
print(-1)
sys.exit()
nowplace = 0
count = 0
for i in range(1,N+1):
if i not in numdic:
break
else:
place = bisect.bisect_right(numdic[i], nowplace)
if place >= len(numdic[i]):
break
else:
nowplace = numdic[i][place]
count += 1
print(N-count) | 0 | null | 68,092,253,976,156 | 146 | 257 |
from decimal import Decimal
a,b=map(Decimal,input().split())
print(a*b//1) | # -*- coding: utf-8 -*-
moji=[]
moji.append("eraser")
moji.append("erase")
moji.append("dreamer")
moji.append("dream")
user = "erasedream"
user = int(input())
result = user
count = 1
while result != 0:
result += user
result %= 360
count += 1
print(count,end="")
| 0 | null | 14,800,155,881,678 | 135 | 125 |
from queue import Queue
k = int(input())
q = Queue()
for i in range(1, 10):
q.put(i)
for i in range(k):
x = q.get()
if x % 10 != 0:
num = 10 * x + (x % 10) - 1
q.put(num)
num = 10 * x + (x % 10)
q.put(num)
if x % 10 != 9:
num = 10 * x + (x % 10) + 1
q.put(num)
print(x) | n = int(input())
s = input()
if n % 2 == 1:
res = "No"
else:
if s[:n//2] == s[n//2:]:
res = "Yes"
else:
res = "No"
print(res) | 0 | null | 93,159,555,327,328 | 181 | 279 |
k = int(input())
s = input()
print(s[:k] + ('...' if len(s) > k else ''))
| #input an interget
k=int(input())
#input an string
str1=str(input())
#get the length of the string
x=int(len(str1))
#initialise y
y=0
#make a second string for the appending
str2="..."
#if statement about how the string will function
#if the string is the same length as k then print it
if x<=k:
print(str1)
#if not, delete the last character of the string
else:
while y<k:
print(str1[y],end=(""))
y+=1
print(str2)
| 1 | 19,674,096,072,566 | null | 143 | 143 |
n=int(input())
a,b=map(str, input().split())
l = []
for i in range(n):
l.append(a[i])
l.append(b[i])
print(''.join(l)) | n=int(input())
s,t=input().split()
ans=s[0]+t[0]
for i in range(1,n):
ans=ans+s[i]+t[i]
print(ans) | 1 | 111,691,816,951,484 | null | 255 | 255 |
A,B,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l=[]
for i in range(m):
x,y,c=map(int,input().split())
l.append(a[x-1]+b[y-1]-c)
l.append(min(a)+min(b))
print(min(l)) | n, m, l =map(int, input().split())
A = []
B = []
C = []
for i in range(n):
i = list(map(int, input().split()))
A.append(i)
for i in range(m):
i = list(map(int, input().split()))
B.append(i)
#積を求める
for i in range(n):
line = []
for j in range(l):
c = 0
for k in range(m):
c += A[i][k] * B[k][j]
line.append(c)
C.append(line)
#形式に合わせて出力する
for line in C:
print(*line)
| 0 | null | 27,616,442,379,740 | 200 | 60 |
n=(int)(input())
a=input().split()
for i in range(n):
a[i]=(int)(a[i])
dic={}
sum=0
for i in range(n):
if not a[i] in dic:
dic[a[i]]=1
else:
dic[a[i]]+=1
sum+=dic[a[i]]-1
for i in a:
print(sum-dic[i]+1)
| import sys
input = sys.stdin.readline
R, C, K = map(int, input().split())
values = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, v = map(int, input().split())
values[r-1][c-1] = v
dp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]
for r in range(R-1, -1, -1):
# dp[0][r][C - 1] = dp[3][r + 1][C - 1]
# for i in range(1, 4):
# dp[i][r][C-1] = dp[3][r + 1][C-1][3]+values[r][C-1]
for c in range(C-1, -1, -1):
v = values[r][c]
for i in range(4):
if i == 0 or v == 0:
dp[i][r][c] = max(dp[3][r+1][c], dp[i][r][c+1])
else:
dp[i][r][c] = max(dp[3][r + 1][c]+v, dp[i][r][c + 1], dp[i-1][r][c + 1] + v)
print(dp[3][0][0])
| 0 | null | 26,661,554,090,022 | 192 | 94 |
dice = list(input().split(' '))
a = list(input())
for i in a:
if i == 'W':
dice = [dice[2],dice[1],dice[5],dice[0],dice[4],dice[3]]
elif i == 'S':
dice = [dice[4],dice[0],dice[2],dice[3],dice[5],dice[1]]
elif i == 'N':
dice = [dice[1],dice[5],dice[2],dice[3],dice[0],dice[4]]
elif i == 'E':
dice = [dice[3],dice[1],dice[0],dice[5],dice[4],dice[2]]
print(dice[0])
| while True:
c = str(input())
if c == "-":
break
n = int(input())
for i in range(n):
a = int(input())
c = c[a:] + c[:a]
print(c)
| 0 | null | 1,061,731,738,946 | 33 | 66 |
x=input().split()
a,b,c=int(x[0]),int(x[1]),int(x[2])
if a<b<c:
print("Yes")
else:
print("No")
| x = {"S": list(range(1, 14)), "H": list(range(1, 14)),
"C": list(range(1, 14)), "D": list(range(1, 14))}
n = int(input())
for i in range(n):
tmp = input().split()
key = tmp[0]
num = int(tmp[1])
x[key].remove(num)
keys = ["S", "H", "C", "D"]
for key in keys:
if len(x[key])==0:
pass
else:
for i in x[key]:
print(key, i) | 0 | null | 703,087,622,780 | 39 | 54 |
s=list(input()) ;k=int(input()) ;n=len(s)
ss=s*2
import sys
mod=10**9+7 ; inf=float("inf")
from math import sqrt, ceil
from collections import deque, Counter, defaultdict #すべてのkeyが用意されてる defaultdict(int)で初期化
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from decimal import ROUND_HALF_UP,Decimal as D #変換後の末尾桁を0や0.01で指定
#Decimal((str(0.5)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))
from functools import lru_cache
from bisect import bisect_left as bileft, bisect_right as biright
from fractions import Fraction as F #F(a,b)で正確なa/b
#メモ化再帰defの冒頭に毎回 @lru_cache(maxsize=10**10)
#引数にlistはだめ
#######ここまでテンプレ#######
#ソート、"a"+"b"、再帰ならPython3の方がいい
#######ここから天ぷら########
if n==1:
print(k//2);exit()
def qq(s,n):
ans=0
if n==2:
if s[0]==s[1]:return 1
return 0
nows=s[0];now=1
for i in range(1,n):
if s[i]==nows:
now+=1
else:
ans+= now//2
now=1 ;nows=s[i]
else:
ans+=now//2
return ans
if len(Counter(s))==1:
print((n*k)//2)
exit()
if s[0]!=s[-1]:
print(qq(s,n)*k)
exit()
st=1; go=1
for i in range(1,n):
if s[i]==s[0]:
st+=1
else:
break
for i in range(-2,-n-1,-1):
if s[i]==s[-1]:
go+=1
else:break
print(qq(s,n)*k - (st//2+go//2-(st+go)//2)*(k-1))
| # -*- coding: utf-8 -*-
import sys
point = '.'
sharp = '#'
while True:
H, W = map(int, raw_input().split())
if H == W == 0:
break
for h in xrange(H):
for w in xrange(W):
if h % 2 == 0:
if w % 2 == 0:
sys.stdout.write(sharp),
else:
sys.stdout.write(point),
else:
if w % 2 == 0:
sys.stdout.write(point)
else:
sys.stdout.write(sharp)
print
print | 0 | null | 88,314,846,786,500 | 296 | 51 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
def check(mid):
cnt = 0
for i in range(N):
tmp = mid // F[i]
cnt += max(A[i] - tmp, 0)
return cnt <= K
check(2)
l, r = -1, 10**30
while r-l > 1:
mid = (l+r)//2
if check(mid):
r = mid
else:
l = mid
print(r)
| while True:
n,x = [int(x) for x in input().split()]
if (n,x)==(0,0): break
cnt=0
if 3*(n-1) >= x: # If n-2 + n-1 + n < x, there is no combination
a_max = x//3 - 1 # a_max + a_max+1 + a_max+2 = x
if 2*n-1 < x:
a_min = x - (2*n-1) # set minimum value of a
else:
a_min = 1
for a in range(a_min,a_max+1):
b_max = (x-a-1)//2 # b_max + b_max+1 <= x-a
b_min = (x-a) - n # set minimum value of b
b_min = b_min if b_min > a+1 else a+1
cnt += b_max - b_min + 1
print(cnt) | 0 | null | 83,494,409,274,618 | 290 | 58 |
from functools import reduce
n,a,b=map(int,input().split())
mod=10**9+7
def nCk(n,k):
if n<k or (n<0 or k<0):
return 0
k=min(k,n-k)
up,down=1,1
for i in range(k):
up=up*(n-i)%mod
down=down*(i+1)%mod
return up*pow(down,mod-2,mod)%mod
all=pow(2,n,mod)
nCa=nCk(n,a)
nCb=nCk(n,b)
print((all-nCa-nCb-1)%mod) | import math
n, a, b = map(int, input().split())
mod = 10**9 + 7
ans = pow(2, n, mod) - 1
x = 1
y = 1
for i in range(a):
x = x*(n - i)%mod
y = y*(i + 1)%mod
ans -= x*pow(y, mod - 2, mod)%mod
x = 1
y = 1
for i in range(b):
x = x*(n - i)%mod
y = y*(i + 1)%mod
ans -= x*pow(y, mod - 2, mod)%mod
print(ans%mod)
| 1 | 66,143,396,675,034 | null | 214 | 214 |
# -*- coding: utf-8 -*-
# D
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
from itertools import combinations
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
n = int(input())
if n == 1:
print('a')
sys.exit()
def dfs(s):
if len(s) == n:
print(''.join([chr(s + ord('a')) for s in s]))
else:
for i in range(len(set(list(s))) + 1):
dfs(s + [i])
dfs([])
| list_2d=[]
for i in range(3):
list_2d.append([int(i) for i in input().split()])
n=int(input())
b=[int(input()) for i in range(n)]
#print(list_2d)
#print(b)
#印をつける
for i in range(3):
for j in range(3):
if list_2d[i][j] in b:
list_2d[i][j]="x"
#print(list_2d)
#ビンゴかどうかチェックする
#横
if list_2d[0]==["x","x","x"] or list_2d[1]==["x","x","x"] or list_2d[2]==["x","x","x"]:
ans="Yes"
#縦
elif list_2d[0][0]==list_2d[1][0]==list_2d[2][0]=="x" or list_2d[0][1]==list_2d[1][1]==list_2d[2][1]=="x" or list_2d[0][2]==list_2d[1][2]==list_2d[2][2]=="x":
ans="Yes"
#斜め
elif list_2d[0][0]==list_2d[1][1]==list_2d[2][2]=="x" or list_2d[0][2]==list_2d[1][1]==list_2d[2][0]=="x":
ans="Yes"
else:
ans="No"
print(ans) | 0 | null | 55,989,139,384,498 | 198 | 207 |
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
n = s.count("R")
t = sorted(s)
ans = 0
for i in range(n):
if s[i] != t[i]:
ans += 1
print(ans) | #!/usr/bin/env python3
# Generated by 1.1.7.1 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():
N = int(input())
C = list(input())
Rc = len(list(filter(lambda x:x=="R",C)))
Wc = len(C) - Rc
c = 0
for i in range(Rc):
if C[i] == "W":
c+=1
# print(Rc)
# print(Wc)
print(c)
pass
if __name__ == '__main__':
main()
| 1 | 6,279,444,288,702 | null | 98 | 98 |
N = int(input())
A = list(map(int, input().split()))
l = {a: i for i, a in enumerate(A, start=1)}
print(' '.join([str(l[i+1]) for i in range(N)]))
| N = int(input())
A = list(map(int, input().split()))
B = list(range(1, N + 1))
A = dict(zip(A, B))
A = sorted(A.items())
ans = [str(x[1]) for x in A]
print(" ".join(ans)) | 1 | 180,639,577,602,878 | null | 299 | 299 |
n, m = map(int, input().split())
A = [list(map(int, input().split())) for _ in [None] * n]
b = [int(input()) for _ in [None] * m]
for a in A:
print(sum([i * j for i, j in zip(a, b)]))
| n, m = map(int, input().split())
A = [[int(e) for e in input().split()] for i in range(n)]
b = []
for i in range(m):
e = int(input())
b.append(e)
for i in range(n):
p = 0
for j in range(m):
p += A[i][j] * b[j]
print(p) | 1 | 1,174,090,410,978 | null | 56 | 56 |
a,b,n=map(int,input().split())
x=min(n,b-1)
print(int((a*x/b)//1)) | N,M=map(int,input().split())
A=input()
List_A=A.split()
day=0
for i in range(0,M):
day=day+int(List_A[i])
if N>=day:
print(N-day)
else:
print(-1) | 0 | null | 30,068,286,517,372 | 161 | 168 |
# https://atcoder.jp/contests/abc150/tasks/abc150_d
import math
def lcm(x, y):
return (x * y) // math.gcd(x, y)
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(len(A)):
A[i] //= 2
div_two_cnt = None
for a in A:
cnt = 0
while a % 2 == 0:
a //= 2
cnt += 1
if div_two_cnt is None:
div_two_cnt = cnt
elif cnt != div_two_cnt:
print(0)
exit()
tmp = A[0]
for i in range(1, n):
tmp = lcm(tmp, A[i])
# print(tmp)
print(((m // tmp) + 1)//2)
| n,m=map(int, input().split())
a=[int(x) for x in input().split()]
kaisuu=0
for i in a:
zantei=0
while True:
if i%2==0:
zantei+=1
i//=2
else:
break
if kaisuu==0:
kaisuu=zantei
else:
if kaisuu!=zantei:
print(0)
exit()
sks=a[0]//2
import math
for i in range(1,len(a)):
sks=sks*(a[i]//2)//(math.gcd(sks,a[i]//2))
ans=int(m/(2*sks)+(1/2))
print(ans) | 1 | 102,203,984,281,250 | null | 247 | 247 |
hp, dmg = map(int, input().split())
if hp % dmg == 0: print(int(hp//dmg))
else: print(int(hp//dmg) + 1) | N = int(input())
A = list(map(int, input().split()))
count = 0
sat = 0
for a in A:
if a % 2 == 0:
count += 1
if a % 3 == 0 or a % 5 ==0:
sat += 1
if count == sat:
print('APPROVED')
else:
print('DENIED') | 0 | null | 72,754,147,614,012 | 225 | 217 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
def cumsum(a):
"""※ aを破壊する
l[i] = sum(a[:i]) なるlを返す
sum(a[i:j]) == l[j+1] - l[i]
"""
c = 0
n = len(a)
a.insert(0, 0)
for i in range(1, n+1):
a[i] = a[i-1]+a[i]
return a
a = cumsum(a)
aa = [((item - i)%k) for i,item in enumerate(a)]
ans = 0
from collections import defaultdict
c = defaultdict(int)
for i in range(min(k, len(aa))):
c[aa[i]] += 1
for i,item in enumerate(aa):
c[item] -= 1
# print(c, item)
ans += c[item]
if i+k<n+1:
c[aa[i+k]] += 1
print(ans) | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
a,b,c=nii()
print('Yes' if c-a-b>=4 and 4*a*b<(c-a-b)**2 else 'No') | 0 | null | 94,473,953,223,088 | 273 | 197 |
n, m, k = map(int, input().split())
MOD = 998244353
ans = 0
c = 1
for i in range(k + 1):
ans = (ans + m * pow(m - 1, n - i - 1, MOD) * c) % MOD
c = (c * (n - 1 - i) * pow(i + 1, MOD - 2, MOD)) % MOD
# print(f"{ans = }, {c = }")
print(ans) | n,m,k=map(int, input().split())
mod=998244353
ans=0
c=1
for i in range(k+1):
ans+=c*m*pow(m-1, n-1-i, mod)
ans%=mod
c*=(n-i-1)*pow(i+1, mod-2, mod)
c%=mod
print(ans%mod)
| 1 | 23,051,222,711,880 | null | 151 | 151 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
def S():
return input().rstrip()
def I():
return int(input())
def MI():
return map(int, input().split())
n, k = MI()
p = list(MI())
c = list(MI())
p.insert(0, 0)
c.insert(0, 0)
ans = -float("INF")
for i in range(1, n + 1):
next = p[i]
score = 0
MAX = -float("INF")
for j in range(1, k + 1):
score += c[next]
MAX = max(MAX, score)
if next == i:
loop_score = score
loop_size = j
if loop_score > 0:
q, r = divmod(k, loop_size)
# 周れるだけ周る-1+余りの回数で最大となるマス動く
score1 = loop_score * (q - 1) + MAX
# 周れるだけ周る+余りの回数で最大となるマス動くとき
score2 = loop_score * q
MAX = score2
next = p[i]
for _ in range(1, r + 1):
score2 += c[next]
MAX = max(MAX, score2)
next = p[next]
score = max(score1, MAX)
break
else:
# 一周未満
score = MAX
break
else:
next = p[next]
else:
score = MAX
ans = max(ans, score)
print(int(ans))
| def solve():
ans = -float('inf')
N, K = map(int, input().split())
P = list(map(lambda x:int(x)-1, input().split()))
C = list(map(int, input().split()))
for i in range(N):
score = 0
now = i
visited = [-1]*N
scores = [0]*N
visited[now] = 0
for j in range(1,K+1):
now = P[now]
score += C[now]
ans = max(ans, score)
if visited[now]>=0:
cyc = j - visited[now]
up = score - scores[now]
break
scores[now] = score
visited[now] = j
else:
continue
if up<=0:
continue
cnt = j+1
if K-cyc>=j:
score += (K-cyc-j)//cyc * up
ans = max(ans, score)
cnt += (K-cyc-j)//cyc*cyc
for j in range(cnt,K+1):
now = P[now]
score += C[now]
ans = max(ans, score)
return ans
print(solve()) | 1 | 5,383,056,049,280 | null | 93 | 93 |
N = int(input())
block = list(map(int,input().split()))
a = 1
for i in block:
if i == a:
a += 1
if a==1:
print(-1)
else:
print(len(block)-a+1) | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(input())
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return map(int, input().split())
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().split()))
# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
return tuple(map(int1, input().split()))
def main():
n = input_int()
cnt = [[0] * 10 for i in range(10)]
for n in range(1, n + 1):
cnt[int(str(n)[0])][int(str(n)[-1])] += 1
ret = 0
for i in range(10):
for j in range(10):
ret += cnt[i][j] * cnt[j][i]
return ret
if __name__ == "__main__":
print(main())
| 0 | null | 100,966,502,202,500 | 257 | 234 |
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
return sys.stdin.readline()[:-1]
mod=10**9+7
n,d,a=map(int,input().split())
xh=[list(map(int,input().split())) for i in range(n)]
xh.sort()
r,tama=[float('inf')]*n,[0]*(n+1)
for i in range(n):
x,h=xh[i]
tmpr=bisect.bisect_left(r,x)
h-=(tama[i]-tama[tmpr])*a
tmp=0
if h>0:
tmp=math.ceil(h/a)
tama[i+1]=tmp
tama[i+1]+=tama[i]
r[i]=x+2*d
print(tama[-1])
# print(r) | N = int(input())
A = set(input().split())
if N==len(A):
print("YES")
else:
print("NO") | 0 | null | 78,096,266,124,012 | 230 | 222 |
from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def count(x):
ret = 0
for a in A:
ret += N - bisect_left(A, x - a)
return ret
overEq = 0
less = 10**7
while less - overEq > 1:
mid = (less + overEq) // 2
if count(mid) >= M:
overEq = mid
else:
less = mid
ans = 0
cnt = [0] * N
for a in A:
i = (N - bisect_left(A, overEq - a))
ans += i * a
if i > 0:
cnt[-i] += 1
for i in range(1, N):
cnt[i] += cnt[i - 1]
for a, c in zip(A, cnt):
ans += a * c
ans -= overEq * (count(overEq) - M)
print(ans)
| import sys
cnts = {}
for line in sys.stdin:
for c in list(line.lower()): cnts[c] = cnts.get(c,0) + 1
for c in range(ord('a'),ord('z')+1): print(chr(c),':',cnts.get(chr(c),0))
| 0 | null | 55,107,416,538,292 | 252 | 63 |
a = input().split()
n, d = int(a[0]), int(a[1])
x = []
a = d * d
res = 0
for i in range(n):
[x, y] = input().split()
if int(x)**2 + int(y)**2 <= a:
res += 1
print(res)
| from math import factorial
from itertools import permutations
n = int(input())
t,*c = [list(map(int, input().split())) for _ in range(n)]
print(sum(sum(((x-v)**2+(y-w)**2)**.5 for (x, y), (v, w) in zip([t]+l, l+[t])) for l in map(list,permutations(c)))*(n-1)/factorial(n)) | 0 | null | 77,261,209,494,170 | 96 | 280 |
import sys
class Card:
def __init__(self, kind, num):
self.kind = kind
self.num = num
def __eq__(self, other):
return (self.kind == other.kind) and (self.num == other.num)
def __ne__(self, other):
return not ((self.kind == other.kind) and (self.num == other.num))
def __str__(self):
return self.kind + self.num
def list_to_string(array):
s = ""
for n in array:
s += str(n) + " "
return s.strip()
def swap(array, i, j):
tmp = array[i]
array[i] = array[j]
array[j] = tmp
def is_stable(array1, array2):
if reduce(lambda x, y: x and y, map(lambda x: x[0] == x[1], zip(array1, array2))):
return "Stable"
else:
return "Not stable"
def bubble_sort(array):
for i in range(0, len(array)):
for j in reversed(range(i+1, len(array))):
if array[j].num < array[j-1].num:
swap(array, j, j-1)
return array
def selection_sort(array):
for i in range(0, len(array)):
min_index = i
for j in range(i, len(array)):
if array[min_index].num > array[j].num:
min_index = j
swap(array, i, min_index)
return array
def main():
num = int(sys.stdin.readline().strip())
array = map(lambda x: Card(x[0], x[1]), sys.stdin.readline().strip().split(" "))
a = list(array)
b = list(array)
print list_to_string(bubble_sort(a))
print "Stable"
print list_to_string(selection_sort(b))
print is_stable(a, b)
if __name__ == "__main__":
main() | s=input()
a,b,c,d=0,0,0,0
for i in range(len(s)):
if s[i]==">":
c=0;b+=1
if b<=d:a+=b-1
else:a+=b
else:b=0;c+=1;a+=c;d=c
print(a) | 0 | null | 78,145,867,558,172 | 16 | 285 |
s = input()
k = int(input())
if len(s) == 1:
print(k//2)
exit()
rep = [1]
prev = s[0]
for i in range(1, len(s)):
if s[i] == prev:
rep[-1] += 1
else:
rep.append(1)
prev = s[i]
if len(rep) == 1:
print(rep[0]*k//2)
exit()
cnt = 0
for r in rep:
cnt += r//2
if s[0] == s[-1]:
ans = cnt*k + ((rep[0]+rep[-1])//2 - rep[0]//2 - rep[-1]//2)*(k-1)
print(ans)
else:
print(cnt*k)
| #!/usr/bin/env python3
#import
#import math
#import numpy as np
#= int(input())
S = input()
K = int(input())
ls = len(S)
t1 = []
t = 1
for i in range(1, ls):
if S[i - 1] == S[i]:
t += 1
else:
if t > 1:
t1.append(t)
t = 1
if t > 1 or t == ls:
t1.append(t)
ans = 0
for t in t1:
ans += t // 2
if len(t1) == 1:
if t1[0] == ls:
print(ls * K // 2)
else:
if S[0] != S[-1]:
print(ans * K)
else:
ta = t1[0]
tb = t1[-1]
print(ans * K - (ta // 2 + tb // 2 - (ta + tb) // 2) * (K - 1))
| 1 | 175,275,709,619,738 | null | 296 | 296 |
while True:
H,W = [int(i) for i in input().split()]
if H == 0 and W == 0:
break
else:
for line in list(range(1,H+1,1)):
for column in list(range(1,W+1,1)):
if line == 1 or line == H:
if column == W:
print("#")
else:
print("#", end = "")
else:
if column == 1:
print("#", end = "")
elif column == W:
print("#")
else:
print(".", end = "")
print("")
| import sys
while True:
data = sys.stdin.readline().strip().split(' ')
h = int(data[0])
w = int(data[1])
if h == 0 and w == 0:
break
for i in range(h):
for j in range(w):
if i==0 or i == (h - 1) or j == 0 or j == (w - 1):
print('#', end='')
else:
print('.', end='')
print('')
print('') | 1 | 814,451,610,080 | null | 50 | 50 |
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
class Factorial:
def __init__(self, MOD):
self.MOD = MOD
self.factorials = [1, 1] # 階乗を求めるためのキャッシュ
self.invModulos = [0, 1] # n^-1のキャッシュ
self.invFactorial_ = [1, 1] # (n^-1)!のキャッシュ
def calc(self, n):
if n <= -1:
print("Invalid argument to calculate n!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.factorials):
return self.factorials[n]
nextArr = [0]*(n+1-len(self.factorials))
initialI = len(self.factorials)
prev = self.factorials[-1]
m = self.MOD
for i in range(initialI, n+1):
prev = nextArr[i-initialI] = prev * i % m
self.factorials += nextArr
return self.factorials[n]
def inv(self, n):
if n <= -1:
print("Invalid argument to calculate n^(-1)")
print("n must be non-negative value. But the argument was " + str(n))
exit()
p = self.MOD
pi = n % p
if pi < len(self.invModulos):
return self.invModulos[pi]
nextArr = [0]*(n+1-len(self.invModulos))
initialI = len(self.invModulos)
for i in range(initialI, min(p, n+1)):
next = -self.invModulos[p % i]*(p//i) % p
self.invModulos.append(next)
return self.invModulos[pi]
def invFactorial(self, n):
if n <= -1:
print("Invalid argument to calculate (n^(-1))!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.invFactorial_):
return self.invFactorial_[n]
self.inv(n) # To make sure already calculated n^-1
nextArr = [0]*(n+1-len(self.invFactorial_))
initialI = len(self.invFactorial_)
prev = self.invFactorial_[-1]
p = self.MOD
for i in range(initialI, n+1):
prev = nextArr[i-initialI] = (prev * self.invModulos[i % p]) % p
self.invFactorial_ += nextArr
return self.invFactorial_[n]
class Combination:
def __init__(self, MOD):
self.MOD = MOD
self.factorial = Factorial(MOD)
def choose_k_from_n(self, n, k):
if k < 0 or n < k:
return 0
k = min(k, n-k)
f = self.factorial
return f.calc(n)*f.invFactorial(max(n-k, k))*f.invFactorial(min(k, n-k)) % self.MOD
def solve(N: int, K: int, A: "List[int]"):
c = Combination(MOD)
A.sort()
minSum = 0
for i in range(N-K+1):
remain = N-i-1
minSum = (minSum + A[i]*c.choose_k_from_n(remain, K-1)) % MOD
maxSum = 0
A.reverse()
for i in range(N-K+1):
remain = N-i-1
maxSum = (maxSum + A[i]*c.choose_k_from_n(remain, K-1)) % MOD
print((maxSum - minSum + MOD) % MOD)
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
K = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, K, A)
if __name__ == '__main__':
main()
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
# prepare combs upto 10000
mod = 10**9 + 7
facts = [1] * 100001
for i in range(0, 100000):
facts[i+1] = facts[i] * (i + 1) % mod
ifacts = [1] * 100001
ifacts[100000] = pow(facts[100000], mod - 2, mod)
for i in range(100000, 0, -1):
ifacts[i-1] = ifacts[i] * i % mod
def comb(n, k):
return facts[n] * ifacts[n-k] % mod * ifacts[k] % mod
ans = 0
for i in range(k-1, n):
# take k-1 from i
ans = (ans + a[i] * comb(i, k-1)) % mod
for i in range(0, n-k+1):
# take k-1 from n-i-1
ans = (ans - a[i] * comb(n-i-1, k-1)) % mod
print(ans) | 1 | 96,226,765,538,558 | null | 242 | 242 |
from math import factorial
n,a,b=map(int,input().split())
mod=10**9+7
nCa=1
nCb=1
tmp=n
for i in range(a):
nCa*=tmp
tmp-=1
nCa%=mod
nCa=nCa*pow(factorial(a),mod-2,mod)%mod
tmp=n
for i in range(b):
nCb*=tmp
tmp-=1
nCb%=mod
nCb=nCb*pow(factorial(b),mod-2,mod)%mod
print(((pow(2,n,mod))-nCa-nCb-1)%mod) | def power(x, y, p) :
res = 1 # Initialize result
# Update x if it is more
# than or equal to p
x = x % p
if (x == 0) :
return 0
while (y > 0) :
# If y is odd, multiply
# x with result
if ((y & 1) == 1) :
res = (res * x) % p
# y must be even now
y = y >> 1 # y = y/2
x = (x * x) % p
return res
def ncr(n, r, p):
# initialize numerator
# and denominator
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den, p - 2, p)) % p
n,a,b=map(int,input().split())
m=10**9+7;
ans=power(2,n,m)
ans-=ncr(n,a,m)
ans-=ncr(n,b,m)
print(ans%m-1)
| 1 | 65,992,016,176,996 | null | 214 | 214 |
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))
| h,n = map(int,input().split())
M = []
max_val = 0
for _ in range(n):
a,b = map(int,input().split())
max_val = max(max_val,a)
M.append((a,b))
dp = [float('inf')]*(h+1+max_val)
dp[0] = 0
for i in range(1,h+1+max_val):
for j in range(n):
dp[i] = min(dp[i-M[j][0]] + M[j][1],dp[i])
print(min(dp[h:-1]))
| 0 | null | 64,454,088,582,148 | 192 | 229 |
n, m, l = map(int, input().split())
A = []
B = []
C = [[] for i in range(n)]
for i in range(n):
tmp_row = list(map(int, input().split()))
A.append(tmp_row)
for i in range(m):
tmp_row = list(map(int, input().split()))
B.append(tmp_row)
for i in range(n):
for bj in zip(*B):
c = sum(aik * bjk for aik, bjk in zip(A[i], bj))
C[i].append(c)
for i in C:
print(*i) | r=input().split()
A=int(r[0])
B=int(r[1])
C=int(r[2])
K=int(r[3])
if K<=A:
print(K)
elif K<=A+B:
print(A)
else:
print(2*A-K+B) | 0 | null | 11,647,069,881,022 | 60 | 148 |
N = int(input())
for i in range(N):
triangle = sorted([int(n) for n in input().split()])
if triangle[0]**2 + triangle[1]**2 == triangle[2]**2:
print('YES')
else:
print('NO')
| def judge(lists):
lists.sort()
if lists[0] ** 2 + lists[1] ** 2 - lists[2] ** 2:
return False
else:
return True
def run():
N = int(input())
for _ in range(N):
if judge([int(x) for x in input().split()]):
print("YES")
else:
print("NO")
if __name__ == '__main__':
run()
| 1 | 247,716,808 | null | 4 | 4 |
a, b = [int(i) for i in input().split()]
print (a - 2 * b if a - 2 * b > 0 else 0) | x,y = map(int, input().split())
a = x - y*2
if a > 0:
print(a)
else:
print("0") | 1 | 167,394,350,855,380 | null | 291 | 291 |
n = int(input())
d = [0]*(n+1)
f = [0]*(n+1)
t = 1
adjacent_list = [[] for _ in range(n+1)]
for i in range(n):
e = list(map(int,input().split()))
if e[1] != 0:
adjacent_list[i+1].extend(e[2:])
#print(adjacent_list)
def dfs(v):
if d[v] >= 1:
return
global t
if d[v] == 0: #未発見なら発見時刻を記入
d[v] = t
t += 1
for nv in adjacent_list[v]:
dfs(nv)
f[v] = t
t += 1
for v in range(1,n+1):
dfs(v)
#dfs(1)
#print(d)
#print(f)
for i in range(1,n+1):
print(i, d[i], f[i])
| m=input().split()
M=input().split()
if int(M[0]) - int(m[0]) == 1:
print('1')
else:
print('0') | 0 | null | 62,062,685,386,952 | 8 | 264 |
while 1:
c=list(raw_input())
o=""
if c[0]=="-" and len(c)==1:
break
m=int(raw_input())
for i in range(m):
h=int(raw_input())
c=list(c[h:]+c[:h])
for i in range(len(c)):
o+=c[i]
print o | while True:
string = str(input())
box = ""
if string == "-":
break
shuffle = int(input())
h = [0]*shuffle
for a in range(shuffle):
h[a] = int(input())
for b in range(shuffle):
box = string[0:h[b]]
string = string[h[b]:]
string = string+box
box = ""
print(string)
| 1 | 1,942,961,252,992 | null | 66 | 66 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from typing import Iterable, List
import sys
def main(N, M, AB):
uf = UnionFindTree(N)
for a, b in AB:
a, b = a - 1, b - 1
uf.union(a, b)
print(len(uf.groups()) - 1)
class UnionFindTree:
__slots__ = ('parent')
def __init__(self, n: int) -> None:
self.parent = [-1] * n
def find(self, x: int) -> int:
p = self.parent
while p[x] >= 0: x, p[x] = p[x], p[p[x]]
return x
def union(self, x: int, y: int) -> bool:
x, y, p = self.find(x), self.find(y), self.parent
if x == y: return False
if p[x] > p[y]: x, y = y, x
p[x], p[y] = p[x] + p[y], x
return True
def same(self, x: int, y: int) -> bool:
return self.find(x) == self.find(y)
def size(self, x: int) -> int:
return -self.parent[self.find(x)]
def same_all(self, indices: Iterable[int]) -> bool:
f, v = self.find, self.find(indices[0])
return all(f(i) == v for i in indices)
def groups(self) -> List[int]:
return [i for i, p in enumerate(self.parent) if p < 0]
if __name__ == '__main__':
input = sys.stdin.readline
N, M = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in range(M)]
main(N, M, AB)
| # -*- coding: utf-8 -*-
import math
def g(nx, ny, nz):
return nx ** 2 + ny ** 2 + nz ** 2 + nx * ny + ny * nz + nz * nx
def solve(n):
# min_z = max(1, int(math.sqrt(n) / 3))
max_z = max(1, int(math.sqrt(n - 2) - 1) if n > 2 else 1)
# max_x = max(1, int(math.sqrt(n / 3) + 1))
counter = [0 for _ in range(n + 1)]
for z in range(1, max_z + 1):
for y in range(1, max_z + 1):
for x in range(1, max_z + 1):
gn = g(x, y, z)
if gn <= n:
counter[gn] += 1
for i in range(1, n + 1):
print(counter[i])
N = int(input())
solve(N)
| 0 | null | 5,165,621,598,660 | 70 | 106 |
import sys,math,collections,itertools
input = sys.stdin.readline
N,M = list(map(int,input().split()))
road = [[] for _ in range(N+1)]
flag = [-1 for _ in range(N+1)]
flag[1]=0
for i in range(M):
a,b = map(int,input().split())
road[a].append(b)
road[b].append(a)
q = collections.deque([1])
while q:
now = q.popleft()
for r in road[now]:
if flag[r] == -1:
flag[r] = now
q.append(r)
print('Yes')
for i in range(2,N+1):
print(flag[i]) | from collections import deque
n,m = map(int,input().split())
g = [[] for _ in range(n)]
for i in range(m):
a,b = map(lambda x:int(x)-1,input().split())
g[a].append(b)
g[b].append(a)
to = {}
dist = [-1 for _ in range(n)]
dist[0] = 0
q = deque()
q.append(0)
while (len(q) > 0):
v = q.popleft()
for nv in g[v]:
if (dist[nv] != -1):continue
dist[nv] = dist[v] + 1
q.append(nv)
to[nv] = v
print('Yes')
for i in range(1,n):
print(to[i]+1) | 1 | 20,497,431,872,826 | null | 145 | 145 |
h=t=0
for _ in range(int(input())):
a,b=input().split()
if a>b:t+=3
elif a<b:h+=3
else:t+=1;h+=1
print(t,h) | all_N = []
while True:
N = list(map(int, input().split(' ')))
if N[0] == 0 and N[0] == 0:
break
all_N.append(N)
for i in range(len(all_N)):
print('#' * all_N[i][1])
for j in range(all_N[i][0]-2):
print('#%s#' % ((all_N[i][1]-2) * '.'))
print('#' * all_N[i][1])
print('') | 0 | null | 1,430,614,376,348 | 67 | 50 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
s = [0] * (n+1)
for i in range(n):
s[i+1] = s[i] + a[i]
s[i] = (s[i] - i) % k
s[n] = (s[n] - n) % k
count = dict()
for i in range(min(k-1, n+1)):
if not s[i] in count:
count[s[i]] = 0
count[s[i]] += 1
ans = 0
for i in range(k-1, n+1):
if not s[i] in count:
count[s[i]] = 0
count[s[i]] += 1
count[s[i-k+1]] -= 1
ans += count[s[i-k+1]]
for i in count.values():
ans += i * (i - 1) // 2
print(ans) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
X, N = mapint()
A = set(range(1000))
Ps = list(mapint())
Ps = sorted(list(A-set(Ps)))
mi = 10**18
ans = 0
for p in Ps:
if abs(X-p)<mi:
ans = p
mi = abs(X-p)
print(ans) | 0 | null | 75,571,449,972,448 | 273 | 128 |
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
B=input().split()
b[2*i]=B[0]
b[2*i+1]=int(B[1])
while len(b)>0:
tmp=b[1]-q
if tmp>0:
b.append(b[0])
b.append(tmp)
del b[0]
del b[0]
cnt=cnt+q
else:
cnt=cnt+b[1]
print(b[0],cnt)
del b[0]
del b[0]
| tmp = input().split(" ")
N = int(tmp[0])
M = int(tmp[1])
ans = N * (N - 1) / 2 + M * (M - 1) / 2
print(int(ans)) | 0 | null | 22,658,626,411,478 | 19 | 189 |
n = int(input())
ans = ""
check = "abcdefghijklmnopqrstuvwxyz"
while n != 0:
n -= 1
ans += check[n % 26]
n //= 26
print(ans[::-1])
| N = int(input())
t = ""
while N > 0:
t += chr((N-1)%26 + 97)
N = (N-1)//26
print(t[::-1]) | 1 | 11,855,655,503,648 | null | 121 | 121 |
N = int(input())
L = list(map(int, input().split()))
L = sorted(L)
import bisect
count = 0
for i in range (0, len(L)-2):
for j in range (i+1, len(L)-1):
count+= bisect.bisect_left(L[j+1:], L[i]+L[j])
print(count) | n = int(input())
L = list(map(int, input().split()))
L.sort()
count = 0
for i in range(n - 2):
a = L[i]
for j in range(i + 1, n - 1):
b = L[j]
l = j
r = n
while r - l > 1:
p = (l + r) // 2
if L[p] < a + b:
l = p
else:
r = p
count += l - j
print(count)
| 1 | 171,771,646,005,040 | null | 294 | 294 |
N,K = map(int,input().split())
h = [int(i) for i in input().split()]
ans = 0
for i in range(N):
if(h[i] >= K):
ans += 1
print(ans) | import itertools
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(q):
a1,b1,c1,d1=map(int,input().split())
a.append(a1)
b.append(b1)
c.append(c1)
d.append(d1)
l=list(range(1,m+1))
ans=0
for A in list(itertools.combinations_with_replacement(l, n)):
sum=0
for i in range(q):
if A[b[i]-1]-A[a[i]-1]==c[i]:
sum+=d[i]
ans=max(ans,sum)
print(ans)
| 0 | null | 103,035,558,623,260 | 298 | 160 |
#coding:utf-8
import sys
abc=sys.stdin.readline()
nums=abc.split( ' ' )
for i in range( len( nums) ):
nums[i] = int( nums[i] )
nums.sort()
print( "{} {} {}".format( nums[0], nums[1], nums[2] ) ) | sortingThreeNum = list(map(int, input().split()))
sortingThreeNum.sort()
print(sortingThreeNum[0], sortingThreeNum[1], sortingThreeNum[2])
| 1 | 420,777,013,020 | null | 40 | 40 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
ln = len(bin(max(a))) -2
cnt = [0] * ln
for x in a:
for shift in range(ln):
cnt[shift] += (x>>shift)%2
# print(cnt)
res = 0
for i in range(ln):
now = cnt[i] * (n-cnt[i])
res += now*pow(2,i)
res %= mod
print(res)
| import heapq
n,k = map(int,input().split())
a = [int(i) for i in input().split()]
low = 0
high = 10**9
if k == 0:
print(max(a))
exit()
while low+1 < high:
tmp = 0
mid = (low + high) //2
for i in range(n):
tmp += ((a[i]+mid-1) // mid)-1
if tmp <= k:
high = mid
else:
low = mid
print(high)
| 0 | null | 64,659,164,316,460 | 263 | 99 |
import sys
N, M = map(int, input().split())
A = list(map(int, input().split()))
sum_day = sum(A)
ans = N - sum_day
if ans < 0:
print(-1)
else:
print(ans) | def resolve():
N = int(input())
A = list(map(int, input().split()))
ans = 1
th = 10**18
if 0 in A:
print(0)
return
for a in A:
ans *= a
if ans > th:
print(-1)
return
print(ans if ans <= th else -1)
if '__main__' == __name__:
resolve() | 0 | null | 24,182,772,522,692 | 168 | 134 |
n, x, m = map(int, input().split())
ans = 0
prev_set = set()
prev_list = list()
ans_hist = list()
r = x
for i in range(n):
if i == 0:
pass
else:
r = (r * r) % m
if r == 0:
break
if r in prev_set:
index = prev_list.index(r)
period = i - index
count = (n - index) // period
rest = (n - index) % period
ans = sum(prev_list[:index])
ans += sum(prev_list[index:i]) * count
# ans += (ans - ans_hist[index - 1]) * (count - 1)
ans += sum(prev_list[index:index+rest])
# ans += (ans_hist[index + rest - 1] - ans_hist[index - 1])
break
else:
ans += r
prev_set.add(r)
prev_list.append(r)
ans_hist.append(ans)
print(ans)
| N = int(input())
cnt = 0
for A in range(1, N + 1):
for B in range(1, N // A + 1):
C = N - A * B
if C >= 1 and A * B + C == N:
cnt += 1
print(cnt)
| 0 | null | 2,708,188,722,382 | 75 | 73 |
from sys import stdin
w = input()
n = 0
for line in stdin:
line = line.rstrip()
if 'END_OF_TEXT' == line:
break
n += len(list(filter(lambda x: w.lower() == x.lower(), line.split(' '))))
print(n) | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
M,D=map(int,input().split())
N,E=map(int,input().split())
print(1 if M!=N else 0)
resolve() | 0 | null | 63,380,728,965,840 | 65 | 264 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
def stds(n):
if n == 1:
return set(['a'])
else:
std = stds(n-1)
ret = set([])
for stdi in std:
for x in range(ord('a'),max(map(ord,list(stdi))) + 2):
ret.add(stdi + chr(x))
return ret
def main():
N = int(input())
ret = list(stds(N))
ret.sort()
print('\n'.join(ret))
if __name__ == '__main__':
main() | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
N,S=map(int,input().split())
A=list(map(int,input().split()))
# https://qiita.com/drken/items/dc53c683d6de8aeacf5a#%E9%A1%9E%E9%A1%8C-3
INF = 10**10 # INF+INFを計算してもオーバーフローしない範囲で大きく
MOD=998244353
I, J =N,S
# dpテーブル dp[i][j]:=i番目以下で選ばれしa_kの和がjになる通り数
dp = [[0]*(J+1) for _ in range(I+1)]
# 初期条件
dp[0][0] = 1
# ループ
for i in range(I):
for j in range(J+1):
dp[i+1][j]+=2*dp[i][j]
dp[i+1][j]%=MOD
if j+A[i]<=S:
dp[i+1][j+A[i]]+=dp[i][j]
dp[i+1][j+A[i]]%=MOD
print(dp[I][J])
resolve() | 0 | null | 35,042,293,422,562 | 198 | 138 |
# n=int(input())
# n,k=map(int,input().split())
# arr=list(map(int,input().split()))
#ls=list(map(int,input().split()))
#for i in range(m):
# for _ in range(int(input())):
#from collections import Counter
#from fractions import Fraction
n=int(input())
arr=list(map(int,input().split()))
var=arr[0]
for i in range(1,n):
var^=arr[i]
for i in range(n):
print(arr[i]^var,end=" ")
#ls = [list(map(int, input().split())) for i in range(n)]
#for _ in range(int(input())):
| n=input()
t=h=0
for i in range(n):
x,y=map(str,raw_input().split())
if x==y:
t+=1
h+=1
elif x<y:
h+=3
else:
t+=3
print t,h | 0 | null | 7,271,464,640,932 | 123 | 67 |
import math
r = int(input())
print(2*r*math.pi)
| r = int(input())
pi = 3.14159265358979323846
print(2*pi*r)
| 1 | 31,368,805,656,682 | null | 167 | 167 |
while True:
n, x = map(int,input().split())
count=0
if n == x == 0:
break
else:
ls = []
for i in range(1,n+1):
ls.append(i)
for s in ls:
num1 = s
for j in ls:
if num1 == j:
break
else:
num2 = j
if x < num1+num2:
break
for k in ls:
if num1 == k:
break
elif num2 == k:
break
elif num1+num2+k == x:
count+=1
else:
pass
print(count) | while True:
n, x = map(int, input().split())
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
if (i < j < k):
if i+j+k == x:
count += 1
print(count) | 1 | 1,268,122,406,870 | null | 58 | 58 |
# 23-Structure_and_Class-Dice_I.py
# ???????????? I
# ?¬?????±??????????????????????????????????????????¢??????????????\??¬????????§????????????????????°????????????????????????????????????
# ????????????????????¢??????????????¨????????? 1 ?????? 6 ????????????????????????????????????????????????
# ??\?????¨??????????????????????????¢?????????????????????????????°?????¨?????¢?????????????????????????????????????????§???
# ????????????????????¢?????°?????????????????????????????????
# ????????\??¬????????§??????????????¶?????????????????¨?????????????????????????????§?????????????????????????????????????????¨????????????
# Input
# ?????????????????¢?????°???????????????????????????????????????????????????????????§?????????????????????
# ???????????????????????¨????????????????????????????????????????????????????????????????????????????????????????????¨????????? E???N???S???W ????????????????????§??????
# Output
# ???????????????????????????????????????????????????????????¢?????°???????????????????????????????????????
# Constraints
# 0???0??? ??\?????????????????????????????¢?????°??? ???100???100
# 0???0??? ???????????¨????????????????????? ???100???100
# Note
# ?¶???????????????? Dice III, Dice IV ??§???????????°????????????????????±????????§???????????????????????????????§?????????§?????????????????????????????????
# Sample Input 1
# 1 2 4 8 16 32
# SE
# Sample Output 1
# 8
# ?????¢??? 1, 2, 4, 8, 16, 32 ??¨??????????????????????????? S ??????????????¢???????????????E ??????????????¢????????¨????????¢?????°?????? 8 ??????????????????
# Sample Input 2
# 1 2 4 8 16 32
# EESWN
# Sample Output 2
# 32
class Dice:
def __init__(self, dice_num):
self.side_top=1
self.side_bot=6
self.side_Nor=5
self.side_Eas=3
self.side_Sau=2
self.side_Wes=4
self.dice_num = dice_num
def op_N(self):
self.side_top, self.side_bot, self.side_Nor, self.side_Sau =\
self.side_Sau, self.side_Nor, self.side_top, self.side_bot
def op_E(self):
self.side_top, self.side_bot, self.side_Eas, self.side_Wes =\
self.side_Wes, self.side_Eas, self.side_top, self.side_bot
def op_S(self):
self.side_top, self.side_bot, self.side_Nor, self.side_Sau =\
self.side_Nor, self.side_Sau, self.side_bot, self.side_top
def op_W(self):
self.side_top, self.side_bot, self.side_Eas, self.side_Wes =\
self.side_Eas, self.side_Wes, self.side_bot, self.side_top
def print_side_top(self):
print( dice_num[self.side_top-1] )
def print_side_all(self):
print( "top:{}, bot:{}, Nor:{}, Eas{}, Sau:{}, Wes,{}.".format(self.side_top, self.side_bot, self.side_Nor, self.side_Eas, self.side_Sau, self.side_Wes ) )
dice_num = list( map(int, input().split()))
op = input()
dice_roll = Dice(dice_num)
for i in op:
if i == "N":
dice_roll.op_N()
elif i =="E":
dice_roll.op_E()
elif i =="S":
dice_roll.op_S()
elif i =="W":
dice_roll.op_W()
else:
print("?????°??°")
dice_roll.print_side_top() | class Dice:
"""????????????????????????"""
def __init__(self, s):
self.s1 = s[0]
self.s2 = s[1]
self.s3 = s[2]
self.s4 = s[3]
self.s5 = s[4]
self.s6 = s[5]
def roll(self, direction): # ???????????????????§??????¢????????¢
temp = self.s1
if direction == "E":
self.s1 = self.s4
self.s4 = self.s6
self.s6 = self.s3
self.s3 = temp
elif direction == "N":
self.s1 = self.s2
self.s2 = self.s6
self.s6 = self.s5
self.s5 = temp
elif direction == "S":
self.s1 = self.s5
self.s5 = self.s6
self.s6 = self.s2
self.s2 = temp
elif direction == "W":
self.s1 = self.s3
self.s3 = self.s6
self.s6 = self.s4
self.s4 = temp
s = list(map(int, input().split()))
dice1 = Dice(s)
command = input()
for i in range(len(command)):
dice1.roll(command[i])
print(dice1.s1) | 1 | 235,868,961,174 | null | 33 | 33 |
N=int(input())
move=10**12
for n in range(1,int(N**.5)+1):
if N%n==0:
move=min(move,N//n+n-2)
print(move) | # -*- coding: utf-8 -*-
class residence(object):
def __init__(self):
one = [0] * 10
two = [0] * 10
three = [0] * 10
self.all = [one, two, three]
residences = [ ]
for i in xrange(4):
residences.append(residence())
n = int(raw_input())
for i in xrange(n):
b, f, r, v = map(int, raw_input().split())
residences[b-1].all[f-1][r-1] += v
for i, residence in enumerate(residences):
for floor in residence.all:
print '',
for index, num in enumerate(floor):
if index == len(floor) - 1:
print num
else:
print num,
if i != len(residences) - 1:
print '####################' | 0 | null | 81,131,996,152,758 | 288 | 55 |
N,X,Y =map(int,input().split())
count = [0] * (N-1)
for i in range(1,N):
for j in range(i+1,N+1):
dist = min(j-i, abs(X-i)+1+abs(Y-j))
count[dist-1] +=1
print("\n".join(map(str,count))) | import math
import itertools
n = int(input())
l = list(range(n))
pos_list =[list(map(int, input().split())) for _ in range(n)]
ans = 0
def clc_distandce(a,b):
[x1, y1] = a
[x2, y2] = b
dist = math.sqrt((a[0] - b[0])**2 + (a[1]-b[1])**2)
return dist
for i in itertools.permutations(l,n):
#print(i)
#print(list(i)[0])
for k in range(1,n):
dist = clc_distandce(pos_list[list(i)[k]],pos_list[list(i)[k-1]])
ans += dist
#print(ans)
#print()
print(ans/math.factorial(n)) | 0 | null | 96,218,301,074,848 | 187 | 280 |
N, M = map(int, input().split())
ans = 0
N, M = map(int, input().split())
if M==1:
ans=1
print(ans)
#print(*ans, sep='/n') | h, w = map(int,input().split())
s = [input() for i in range(h)]
def f(i, j):
t = [[-1]*w for j in range(h)]
t[i][j] = 0
q = [(i,j)]
while q:
y, x = q.pop(0)
if y - 1 >= 0 and s[y-1][x] != "#" and t[y-1][x] == -1:
t[y-1][x] = t[y][x] + 1
q.append((y-1,x))
if y + 1 < h and s[y+1][x] != "#" and t[y+1][x] == -1:
t[y+1][x] = t[y][x]+1
q.append((y+1,x))
if x - 1 >= 0 and s[y][x-1] != "#" and t[y][x-1] == -1:
t[y][x-1] = t[y][x] + 1
q.append((y,x-1))
if x + 1 < w and s[y][x+1] != "#" and t[y][x+1] == -1:
t[y][x+1] = t[y][x] + 1
q.append((y,x+1))
return max(max(tt) for tt in t)
result = 0
for i in range(h):
for j in range(w):
if s[i][j] != "#":
result = max(result,f(i,j))
print(result)
| 0 | null | 109,902,390,325,250 | 264 | 241 |
L = int(input())
L = L / 3
ans = L * L * L
print(ans) | L = int(input())
a = L / 3
print(a*a*a) | 1 | 46,762,806,542,270 | null | 191 | 191 |
from collections import defaultdict
d = defaultdict(list)
for i in range(-120, 121):
for j in range(-120, 121):
x = i**5 - j**5
if x >= 1:
d[x] = [i, j]
X = int(input())
print('{0[0]} {0[1]}'.format(d[X])) | X=int(input())
A=[]
i,p=0,True
while p:
a=i**5
A.append(a)
for b in A:
if a-b==X:
p=False
print(i,A.index(b))
break
elif a+b==X:
p=False
print(i,-1*A.index(b))
break
i+=1 | 1 | 25,663,738,929,052 | null | 156 | 156 |
n=int(input())
x,y=[],[]
for i in range(n):
x1,y1=map(int,input().split())
x.append(x1)
y.append(y1)
s=0
for i in range(n):
for j in range(n):
if i!=j:
s+=((x[i]-x[j])**2+(y[i]-y[j])**2)**(1/2)
print(s/n) | N = int(input())
towns = [tuple(map(int, input().split())) for _ in range(N)]
total_distance = 0
count = 0
for start in range(N-1):
for end in range(start+1, N):
start_x, start_y = towns[start]
end_x, end_y = towns[end]
total_distance += ((end_x - start_x)**2 + (end_y - start_y)**2)**0.5
count += 1
answer = total_distance * ((N - 1) / count)
print(answer) | 1 | 148,621,118,057,412 | null | 280 | 280 |
N = int(input())
*A, = map(int, input().split())
A.sort(reverse=True)
k = (N+1)//2
ans = sum(A[0:k])*2-A[0]
if N & 1:
ans -= A[k-1]
print(ans)
| a_len = int(input())
a_ar = sorted([int(n) for n in input().split(" ")])
b_len = int(input())
b_ar = [int(n) for n in input().split(" ")]
dp = [0 for n in range(2001)]
for a in a_ar:
new_dp = dp[:]
new_dp[a] = 1
for i,d in enumerate(dp):
if d and i + a <= 2000:
new_dp[i + a] = 1
elif i + a > 2000:
break
dp = new_dp
for b in b_ar:
if dp[b]:
print("yes")
else:
print("no") | 0 | null | 4,686,554,521,038 | 111 | 25 |
while True:
n = int(input())
if n == 0:
break
else:
score = [int(x) for x in input().split()]
a = 0
m = sum(score)/n
for s in score:
a += (s-m)**2
a = (a/n)**0.5
print('{:.8f}'.format(a))
| n, d, a = map(int, input().split())
xh = []
for _ in range(n):
x, h = map(int, input().split())
h = (h - 1) // a + 1
xh.append([x, h])
xh.sort()
damage = xh[0][1]
ans = damage
damage_lst = [[xh[0][0] + d * 2, damage]]
pos = 0
for i, (x, h) in enumerate(xh[1:], start = 1):
while x > damage_lst[pos][0]:
damage -= damage_lst[pos][1]
pos += 1
if pos == i:
break
damage_tmp = max(h - damage, 0)
ans += damage_tmp
damage += damage_tmp
damage_lst.append([x + d * 2, damage_tmp])
print(ans) | 0 | null | 41,002,854,488,320 | 31 | 230 |
n,k,c=map(int,input().split())
s=input()
if k==1:
if s.count("o")==1:
print(s.index("o")+1)
exit()
l=[-c]*k
r=[n+c]*k
ll=0
for i in range(n):
if ll==0:
if s[i]=="o":
l[ll]=i
ll+=1
continue
if s[i]=="x" or l[ll-1]+c>=i:continue
l[ll]=i
ll+=1
if ll==k:break
rr=k-1
for i in range(n):
if rr==k-1:
if s[(n-1)-i]=="o":
r[rr]=(n-1)-i
rr-=1
continue
if s[(n-1)-i]=="x" or r[rr+1]-c<=(n-1)-i:continue
r[rr]=(n-1)-i
rr-=1
if rr==-1:break
for i in range(k):
if l[i]==r[i]:print(l[i]+1) | from collections import deque
K=int(input())
q=deque([i for i in range(1,10)])
for _ in range(K-1):
x=deque.popleft(q)
a=x%10
if a!=0 and a!=9:
deque.append(q,x*10+a-1)
deque.append(q,x*10+a)
deque.append(q,x*10+a+1)
elif a==0:
deque.append(q,x*10)
deque.append(q,x*10+1)
else:
deque.append(q,x*10+8)
deque.append(q,x*10+9)
print(deque.popleft(q)) | 0 | null | 40,247,813,429,688 | 182 | 181 |
# coding:UTF-8
import sys
from math import factorial
MOD = 998244353
INF = 10000000000
def main():
n, k = list(map(int, input().split())) # スペース区切り連続数字
lrList = [list(map(int, input().split())) for _ in range(k)] # スペース区切り連続数字(行列)
s = []
for l, r in lrList:
for i in range(l, r+1):
s.append(i)
s.sort()
sum = [0] * (n + 1)
Interm = [0] * (2 * n + 1)
sum[1] = 1
for i in range(1, n):
for j in range(k):
l, r = lrList[j][0], lrList[j][1]
Interm[i+l] += sum[i]
Interm[i+r+1] -= sum[i]
sum[i+1] = (sum[i] + Interm[i+1]) % MOD
# result = Interm[n]
result = (sum[n] - sum[n-1]) % MOD
# ------ 出力 ------#
print("{}".format(result))
if __name__ == '__main__':
main()
| mod = 998244353
# 貰うDP
def main(N, S):
dp = [0 if n != 0 else 1 for n in range(N)] # dp[i]はマスiに行く通り数． (答えはdp[-1]), dp[0] = 1 (最初にいる場所だから1通り)
A = [0 if n != 0 else 1 for n in range(N)] # dp[i] = A[i] - A[i-1] (i >= 1), A[0] = dp[0] = 1 (i = 0) が成り立つような配列を考える．
for i in range(1, N): # 今いる点 (注目点)
for l, r in S: # 選択行動範囲 (l: 始点, r: 終点)
if i - l < 0: # 注目点が選択行動範囲の始点より手前の場合 → 注目点に来るために使用することはできない．
break
else: # 注目点に来るために使用することができる場合
dp[i] += A[i-l] - A[max(i-r, 0)-1] # lからrの間で，注目点に行くために使用できる点を逆算． そこに行くことができる = 選択行動範囲の値を選択することで注目点に達することができる通り数．
dp[i] %= mod
A[i] = (A[i-1] + dp[i]) % mod
print(dp[-1])
if __name__ == '__main__':
N, K = list(map(int, input().split()))
S = {tuple(map(int, input().split())) for k in range(K)}
S = sorted(list(S), key = lambda x:x[0]) # 始点でsort (範囲の重複がないため)
main(N, S) | 1 | 2,711,372,240,090 | null | 74 | 74 |
a = int(input())
calc = (a) + (a**2) + (a**3)
print(calc) | a = int(input())
f = a + a**2 + a**3
print(f)
| 1 | 10,200,930,173,554 | null | 115 | 115 |
x = int(input())
print(int(not x))
| N=list(input())
print('Yes' if '7' in N else 'No')
| 0 | null | 18,558,802,996,008 | 76 | 172 |
N = int(input())
A = list(map(int,input().split()))
mode = 0
money = 1000
kabu = 0
for i in range(N):
if i == 0:
if A[i+1] > A[i]:
kabu += 1000//A[i]
money -= kabu*A[i]
mode = 1
else:
continue
elif i == N-1:
money += kabu*A[i]
else:
if mode == 1:
if A[i] >= A[i-1]:
if A[i] > A[i+1]:
money += kabu*A[i]
kabu = 0
mode = 0
else:
continue
else:
if A[i] < A[i+1]:
kabu += money//A[i]
money -= kabu*A[i]
mode = 1
else:
continue
print(money) | s = input().split(" ")
st = []
for i in range(len(s)):
if s[i] == "+":
a = st.pop()
b = st.pop()
st.append(a+b)
elif s[i] == "-":
a = st.pop()
b = st.pop()
st.append(b-a)
elif s[i] == "*":
a = st.pop()
b = st.pop()
st.append(a*b)
else:
st.append(int(s[i]))
print(st[0]) | 0 | null | 3,653,283,577,060 | 103 | 18 |
while True :
a = raw_input().split()
x = int(a[0])
y = int(a[1])
if x == 0 and y == 0 :
break
elif x < y :
print u"%d %d" % (x, y)
else :
print u"%d %d" % (y, x) | def swap(a, b ,item):
c = item[a]
item[a] = item[b]
item[b] = c
AB = input().split()
a = int(AB[0])
b = int(AB[1])
while a!=0 or b!=0:
if a>b:
swap(0, 1, AB)
print(int(AB[0]), int(AB[1]))
AB = input().split()
a = int(AB[0])
b = int(AB[1]) | 1 | 510,914,792,970 | null | 43 | 43 |
A = []
P = ['o']*9
for i in range(3):
a = [int(i) for i in input().split()]
for j in range(3):
A.append(a[j])
N = int(input())
for i in range(N):
b = int(input())
for j in range(9):
if A[j] == b:
P[j] = 'x'
t = 0
for i in range(3):
if (P[i] == P[i+3] == P[i+6] == 'x') or (P[3*i] == P[3*i+1] == P[3*i+2] == 'x'):
t += 1
break
if (P[0] == P[4] == P[8] == 'x') or (P[2] == P[4] == P[6] == 'x'):
t += 1
if t == 0:
print('No')
else:
print('Yes') | bingo=[]
for i in range(3):
a=list(map(int,input().split()))
bingo.append(a)
n=int(input())
for i in range(n):
b=int(input())
for j in range(3):
if b in bingo[j]:
bingo[j][bingo[j].index(b)]=0
def hantei(l):
for i in range(3):
if all([l[i][j]==0 for j in range(3)]):
return 'Yes'
elif all([l[j][i]==0 for j in range(3)]):
return 'Yes'
elif l[0][0]==0 and l[1][1]==0 and l[2][2]==0:
return 'Yes'
elif l[0][2]==0 and l[1][1]==0 and l[2][0]==0:
return 'Yes'
else:
continue
return 'No'
#print(bingo)
print(hantei(bingo)) | 1 | 59,784,398,500,380 | null | 207 | 207 |
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
N = int(input())
testimony = [[] for _ in range(N)]
for i in range(N):
num = int(input())
for j in range(num):
person, state = map(int, input().split())
testimony[i].append([person-1, state])
honest = 0
for i in range(1, 2**N):
flag = 0
for j in range(N):
if (i>>j)&1 == 1: # j番目は正直と仮定
for x,y in testimony[j]:
if (i>>x)&1 != y: # j番目は正直だが矛盾を発見
flag = 1
break
if flag == 0: # 矛盾がある場合はflag == 1になる
honest = max(honest, bin(i)[2:].count('1')) # 1の数をカウントし最大となるものを選択
print(honest) | def resolve():
N = int(input())
XY = []
for i in range(N):
A = int(input())
xy = [list(map(int, input().split())) for _ in range(A)]
XY.append(xy)
ans = 0
for _bits in range(1<<N):
bits = list(map(int, bin(_bits)[2:].zfill(N)))
unmatch = False
for i in range(N):
if bits[i] == 0:
continue
for x, y in XY[i]:
if bits[x-1] != y:
unmatch = True
break
if unmatch:
break
else:
ans = max(ans, bin(_bits).count('1'))
print(ans)
if '__main__' == __name__:
resolve() | 1 | 121,123,874,624,948 | null | 262 | 262 |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
from math import gcd
from collections import defaultdict
dd = defaultdict(int)
temp0=0
for i in range(N):
a,b=MI()
if (a,b)==(0,0):
temp0+=1
continue
if a<0:
a*=-1
b*=-1
#(+,+)と(+,-)だけにする
if a*b!=0:
g=gcd(a,b)
a=a//g
b=b//g
if a*b>0:#(+,+)
dd[(a,b)]+=1
dd[b,-a]+=0
else:#(+,-)
dd[(a,b)]+=1
dd[(-b,a)]+=0
elif (a,b)!=(0,0):
#assert 0
if a==0:
b=1
else:
a=1
dd[(a,b)]+=1
dd[(b,a)]+=0
ans=1
for k,v in dd.items():
a,b=k
if b<=0:
continue
#( +,+)と(0,1)だけ見る
if a*b!=0:
v=dd[k]
v2=dd[(b,-a)]
else:
v=dd[k]
v2=dd[(b,a)]
temp=pow(2,v,mod)+pow(2,v2,mod)-1
ans=(ans*temp)%mod
ans=(ans-1+temp0)%mod
print(ans)
#せんぶ０の組みをひく
main()
| inf = int(input())
i = 0
table = []
buil = [[[0]*10 for i in range(3)]for i in range(4)]
while(i < inf):
b,f,r,v = map(int,input().split())
b -=1
f -=1
r -=1
buil[b][f][r] += v
if buil[b][f][r] > 9: buil[b][f][r] = 9
elif buil[b][f][r] < 0: buil[b][f][r] = 0
i += 1
for i in range(4):
if i != 0: print("#"*20)
for j in range(3):
for k in range(10):
print(" %d" %(buil[i][j][k]),end ="")
print()
| 0 | null | 11,106,944,939,300 | 146 | 55 |
x , y = map(int,input().split())
def GCD(x,y):
while y > 0:
x ,y = y , x %y
else:
return x
ans = GCD(x,y)
print(ans) | def gcd(a,b):
if a == 0:
return b
else:
g = gcd(b%a,a)
return g
n1,n2 = map(int,raw_input().split())
print gcd(n1,n2) | 1 | 6,879,576,440 | null | 11 | 11 |
import sys
#from collections import defaultdict, deque, Counter
#from bisect import bisect_left
#import heapq
#import math
#from itertools import groupby as gb
#from itertools import permutations as perm
#from itertools import combinations as comb
#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
#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
n,m = map(int, stdin.readline().rstrip().split())
#AB = [list(map(int, stdin.readline().rstrip().split())) for _ in range(n)]
if n==m:
print("Yes")
else:
print("No")
| from itertools import groupby
S=input()
K=int(input())
count=0
group=[len(list(value)) for key,value in groupby(S)]
for value in group:
count+=value//2
count*=K
if S[0]==S[-1] and group[0]%2!=0 and group[-1]%2!=0:
if len(S)==group[0]:
count+=K//2
else:
count+=K-1
print(count) | 0 | null | 129,333,348,909,100 | 231 | 296 |
def max(a,b,c):
if a >= b and a >= c:
return a
if b >= a and b >= c:
return b
else:
return c
def min(a,b,c):
if a <= b and a <= c:
return a
if b <= a and b <= c:
return b
else:
return c
def mid(a,b,c):
if (b-a)*(c-a) <= 0:
return a
if (a - b) * (c - b) <= 0:
return b
else:
return c
s = input()
s = s.split()
n = []
for i in s:
n.append(int(i))
a = n[0]
b = n[1]
c = n[2]
print(min(a,b,c),mid(a,b,c),max(a,b,c))
| class dice:
def __init__(self,label):
self.top, self.front, self.right, self.left, self.rear, self.bottom \
= label
def roll(self,op):
if op=='N': self.top, self.front, self.bottom, self.rear = \
self.front, self.bottom, self.rear , self.top
elif op=='E': self.top, self.left , self.bottom, self.right = \
self.left , self.bottom, self.right, self.top
elif op=='W': self.top, self.right, self.bottom, self.left = \
self.right, self.bottom, self.left , self.top
elif op=='S': self.top, self.rear , self.bottom, self.front = \
self.rear , self.bottom, self.front, self.top
def print_top(self): print(self.top)
def print_right(self): print(self.right)
def get_label(self):
return [self.top, self.front, self.right, self.left, self.rear, self.bottom]
label = list(map(int,input().split()))
d = dice(label)
q = int(input())
for _ in range(q):
top_front = [int(x) for x in input().split()]
for op in 'EEESSSWWWNNNWWWSSWWSESWS':
if d.get_label()[:2] == top_front:
d.print_right()
break
d.roll(op) | 0 | null | 339,054,995,230 | 40 | 34 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.