code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
def lcm(x, y):
if x > y:
greater = x
else:
greater = y
while(True):
if((greater % x == 0) and (greater % y == 0)):
lcm = greater
break
greater += 1
return lcm
num1 = int(input())
a=lcm(num1,360)
b=a/num1
print(int(b))
|
#!/usr/bin python3
# -*- coding: utf-8 -*-
from math import gcd #for python3.8
def lcm(a,b):
G = gcd(a, b) #最大公約数
L = (a//G)*b #最小公倍数
return L
def main():
X = int(input())
print(lcm(X,360)//X)
if __name__ == '__main__':
main()
| 1 | 13,123,659,171,000 | null | 125 | 125 |
h = int(input())
cnt = 0
ans = 0
while h > 1:
h = h//2
cnt += 1
ans += 2**cnt
print(ans+1)
|
h = int(input())
count = 0
ans = 0
while h > 0:
h //= 2
count += 1
for i in range(count):
ans = ans*2 + 1
print(ans)
| 1 | 80,021,125,575,520 | null | 228 | 228 |
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
k = ni()
a = [0]*(10**6+1)
a[1] = 7%k
for i in range(2,k+1):
a[i] = (a[i-1]*10+7)%k
for i in range(1,k+1):
if a[i]==0:
print(i)
exit()
print(-1)
|
K = int(input())
if K%2 == 0 or K%5 == 0:
print(-1)
elif K%7 == 0:
x = -1
b = 9*K/7
c = 10%b
for i in range(1,K+1):
if c ==1:
x = i
break
c = (c*10)%b
print(x)
else:
x = -1
b = 9*K
c = 10%b
for i in range(1,K+1):
if c ==1:
x = i
break
c = (c*10)%b
#print(c)
print(x)
| 1 | 6,132,247,362,930 | null | 97 | 97 |
w = input().lower()
t = ""
while True:
tmp = input()
t += " "+tmp.lower()
if tmp=="END_OF_TEXT":
break
t=t.split()
print(t.count(w))
|
count = 0
W = input().lower()
while True:
T = input()
if T == 'END_OF_TEXT':
break
count += T.lower().split().count(W)
print(count)
| 1 | 1,820,295,514,510 | null | 65 | 65 |
N = int(input())
S = str(input())
R = S[::-1]
ans = 0
for i in range(1000):
z = str(i).zfill(3)
right = -1
left = -1
if z[2] in R:
r = R.index(z[2]) + 1
right = N-r
else:
continue
if z[0] in S:
left = S.index(z[0]) + 1
else:
continue
if z[1] in S[left:right]:
ans += 1
print(ans)
|
import collections
n = int(input())
s = input()
ans = 0
for i in range(10):
ind = s.find(str(i))+1
if ind == 0 or ind == len(s):
continue
for j in range(10):
ind_j = ind + s[ind:].find(str(j))+1
if ind_j == ind or ind_j == len(s):
continue
cnt = collections.Counter(s[ind_j:])
ans += len(cnt)
print(ans)
| 1 | 128,899,782,186,990 | null | 267 | 267 |
import math
N = int(input())
n = N / (1.08)
n0 = math.floor(n) - 1
n1 = math.floor(n)
n2 = math.ceil(n)
if int(n0 * 1.08) == N:
print(n0)
elif int(n1 * 1.08) == N:
print(n1)
elif int(n2 * 1.08) == N:
print(n2)
else:
print(":(")
|
# 解説AC
mod = 10 ** 9 + 7
n, k = map(int, input().split())
dp = [-1] * (k + 1)
ans = 0
for i in range(k, 0, -1):
dp[i] = pow(k // i, n, mod)
t = 0
t += 2 * i
while t <= k:
dp[i] -= dp[t]
dp[i] %= mod
t += i
ans += i * dp[i]
ans %= mod
print(ans)
| 0 | null | 81,190,419,336,138 | 265 | 176 |
from collections import Counter
def main():
n = int(input())
S = [input() for _ in range(n)]
S_c = Counter(S)
num = list(S_c.values()).count(max(list(S_c.values())))
anss = S_c.most_common()[:num]
for ans in sorted(anss):
print(ans[0])
if __name__ == '__main__':
main()
|
N=int(input())
kouholist=[]
worddict=dict()
maxvalue=0
for i in range(N):
S=input()
if S in worddict.keys():
worddict[S]+=1
else:
worddict[S]=1
maxvalue=max(maxvalue,worddict[S])
#print("ここから")
#print(worddict)
for k in worddict.keys():
if worddict[k]==maxvalue:
kouholist.append(k)
kouholist=sorted(kouholist)
for h in range(len(kouholist)):
print(kouholist[h])
| 1 | 69,925,263,529,340 | null | 218 | 218 |
S = input()
ans = 'Yes'
if len(S)%2 != 0:
print('No')
exit()
for i in range(0,len(S),2):
if S[i] != 'h':
print('No')
exit()
if S[i+1] != 'i':
print('No')
exit()
print('Yes')
|
s = input()
a = s.replace('hi', '')
if len(a)==0:
print('Yes')
else:
print('No')
| 1 | 53,079,186,368,650 | null | 199 | 199 |
N = int(input())
S = input()
total = S.count('R') * S.count('G') * S.count('B')
cnt = 0
for i in range(N):
for j in range(i+1,N):
k = 2 * j - i
if k >= N:
break
if S[i] != S[j] and S[i] != S[k] and S[j] != S[k]:
cnt += 1
print(total-cnt)
|
n=int(input())
s=input()
R=[]
G={}
B=[]
for i in range(n):
if s[i]=='R':
R.append(i+1)
elif s[i]=='G':
G[i+1]=G.get(i+1,0)+1
else:
B.append(i+1)
res=len(R)*len(G)*len(B)
for i in R:
for j in B:
if ((i+j)%2==0 and G.get((i+j)//2,0)==1):
res-=1
if G.get(2*max(i,j)-min(i,j),0)==1:
res-=1
if G.get(2*min(i,j)-max(i,j),0)==1:
res-=1
print(res)
| 1 | 36,269,196,653,910 | null | 175 | 175 |
#submit 16999743
a, b = input().split()
a = int(a)
b1, b2 = b.split('.')
ans = a * (int(b1) * 100 + int(b2)) // 100
print(ans)
|
a, b = input().split()
a = int(a)
b = int(round(float(b) * 100))
print(a * b // 100)
| 1 | 16,503,203,603,290 | null | 135 | 135 |
alp = 'abcdefghijklmnopqrstuvwxyz'
if input() in alp:
print('a')
else:
print('A')
|
# coding: utf-8
def main():
n, m, l = map(int, raw_input().split())
mat_A = [] # (n, m)
mat_B = [] # (m, l)
for i in range(n):
mat_A.append(map(int, raw_input().split()))
for j in range(m):
mat_B.append(map(int, raw_input().split()))
for i in range(n):
c = [0 for g in range(l)]
for j in range(l):
for k in range(m):
# print "n:{}, m:{}, l:{}".format(i,k,j)
try:
c[j] += mat_A[i][k] * mat_B[k][j]
except:
print "n: {}, m: {}, l: {}".format(i,k,j)
print " ".join(map(str, c))
if __name__ == "__main__":
main()
| 0 | null | 6,400,493,387,508 | 119 | 60 |
import sys
input = sys.stdin.readline
N, T = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort()
dp0 = [0] * T # finish eating by time j
dp1 = [0] * T # order by time j
for A, B in AB:
for j in range(T):
dp1[j] = max(dp1[j], dp0[j] + B)
for j in range(A, T)[::-1]:
dp0[j] = max(dp0[j], dp0[j-A] + B)
print(dp1[-1])
|
import sys
def insertionSort(A, N):
for n in range(N-1):
print (A[n], end=" ")
print(A[N-1])
for i in range(1, N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j + 1] = A[j]
j = j - 1
A[j + 1] = v
for n in range(N-1):
print (A[n], end=" ")
print(A[N-1])
return A
N = int(input())
A = input()
A = A.split(" ")
for i in range(N):
A[i] = int(A[i])
val = insertionSort(A, N)
| 0 | null | 75,910,631,356,160 | 282 | 10 |
a = int ( input ( ) )
h = a // 3600
m = ( a // 60 ) % 60
d = a % 60
print ( "%s:%s:%s" % ( h, m, d ) )
|
n, x, m = map(int, input().split())
lis = set()
loop_lis = []
cnt = 0
while x not in lis:
cnt += 1
lis.add(x)
loop_lis.append(x)
x = pow(x, 2) % m
if cnt == n:
print(sum(lis))
exit()
start = loop_lis.index(x)
length = len(loop_lis) - start
loop_sum = sum(loop_lis[start:])
before = sum(loop_lis[:start])
loop = loop_sum * ((n - start) // length)
remain = sum(loop_lis[start : (start + (n - start) % length)])
print(before + loop + remain)
| 0 | null | 1,552,411,109,450 | 37 | 75 |
n = int(input())
A = list(map(int,input().split()))
ans = 0
for i,a in enumerate(A):
if (i+1)%2 != 0 and a%2 != 0:
ans +=1
print(ans)
|
import sys
for l in sys.stdin:
H, W = map(int,l.split())
if H == 0 and W == 0:
break
for i,h in enumerate(range(H)):
if i % 2 == 0:
print (('#.' * (int(W/2)+1))[:W])
else:
print(('.#' * (int(W/2)+1))[:W])
print ('')
| 0 | null | 4,319,864,848,480 | 105 | 51 |
import sys
H, A = map(int, next(sys.stdin.buffer).split())
print(-(-H // A))
|
h, n = map(int, input().split())
li = list(map(int, input().split()))
if sum(li) >= h:
print('Yes')
else:
print('No')
| 0 | null | 77,749,147,048,948 | 225 | 226 |
dict = {}
def insert(word):
global dict
dict[word] = 0
def find(word):
global dict
if word in dict:
print('yes')
else:
print('no')
def main():
N = int(input())
order = [list(input().split()) for _ in range(N)]
for i in range(N):
if order[i][0] == 'insert':
insert(order[i][1])
elif order[i][0] == 'find':
find(order[i][1])
main()
|
def insert(cnt, data):
T[str(data)] = cnt
cnt = 0
T = {}
n = int(input())
for i in range(n):
Order, data_S = input().split()
if Order[0] =="i":
insert(cnt, data_S)
cnt +=1
else:
if str(data_S) in T:
print("yes")
else:
print("no")
| 1 | 78,248,656,200 | null | 23 | 23 |
ans=0
N=int(input())
for x in range(1,N+1):
if x%3==0 or x%5==0:
pass
else:
ans += x
print(ans)
|
ans = 0
for a in range(1, int(input())+1):
if a % 3 != 0 and a % 5 != 0:
ans += a
print(ans)
| 1 | 35,091,284,949,380 | null | 173 | 173 |
S, W = tuple(int(c) for c in input().split(' '))
if S > W:
print('safe')
else:
print('unsafe')
|
tmp = input().split(" ")
S = int(tmp[0])
W = int(tmp[1])
if S <= W:
print("unsafe")
else:
print("safe")
| 1 | 29,068,048,796,840 | null | 163 | 163 |
A=list(map(int,input().split()))
print(A[0]*A[1])
|
S=input()
s=len(S)
if S[s-1] == "s":
print(S+"es")
else:
print(S+"s")
| 0 | null | 9,094,749,451,032 | 133 | 71 |
class itp1_1d:
def cal(self,time):
h=time/3600
time%=3600
m=time/60
time%=60
s=time
print str(h)+":"+str(m)+":"+str(s)
if __name__=="__main__":
time=input()
run=itp1_1d()
run.cal(time)
|
S=int(input())
T=list(input())
t=S//2
p=0
for i in range(t):
if S%2==1:
p=-1
break
elif T[i]!=T[i+t]:
p=-1
break
if p==-1 or t==0:
print("No")
elif p==0:
print("Yes")
| 0 | null | 73,834,558,312,450 | 37 | 279 |
n,k = map(int,input().split())
a = list(range(n))
ans = 0
for i in range(k,n+2):
min1 = 0.5*i*(i-1)
max1 = 0.5*(n*(n+1)-(n-i)*(n-i+1))
sub1 = max1 - min1+1
ans += sub1
print(int(ans%(10**9+7)))
|
#amari = (10**100)%(10**9+7)
def sm(i):
tmpp = 0
for j in range(i):
tmpp += j
return tmpp,j
def bi(i,N):
tmpp = 0
for j in range(i):
tmpp += N-j
return tmpp,N-j
def main():
N,K = map(int,input().split())
ans = 0
#loopnum = (N+1) - K + 1
for i in range(K,N+2,1):
if i == K:
small,numsmall = sm(i)
big,numbig = bi(i,N)
#print(numsmall,numbig)
else:
small += numsmall+1
numsmall += 1
big += numbig - 1
numbig -= 1
ans += big - small + 1
return (ans%(10**9+7))
print(main())
| 1 | 33,145,378,475,172 | null | 170 | 170 |
N = int(input())
L = [0]*(N)
for i in range(1,N):
for j in range(1,(N-1)//i+1):
L[j*i]+=1
print(sum(L))
|
N=int(input())
div = [0] * (N+1)
for d in range(1, N+1):
for n in range(d, N, d):
div[n] += 1
ans = sum(div[:N])
print(ans)
| 1 | 2,583,398,931,272 | null | 73 | 73 |
n, x, y = int(input()), list(map(int, input().split())), list(map(int, input().split()))
def dist(p):
return pow(sum(pow(abs(a - b), p) for a, b in zip(x, y)), 1.0 / p)
for i in [1, 2, 3]:
print(dist(i))
print(max(abs(a - b) for a, b in zip(x, y)))
|
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
for p in range(1,4):
print("{0:.6f}".format(pow(sum([pow(abs(x[i] - y[i]), p) for i in range(n)]) ,1/p)))
print("{0:.6f}".format(pow(pow(max([abs(x[i] - y[i]) for i in range(n)]),n),1/n)))
| 1 | 213,086,726,492 | null | 32 | 32 |
score = list(map(int,input().split()))
amari = score[0] % score[1]
kouho = score[1] - amari
if amari < kouho:
print(amari)
else:
print(kouho)
|
A, B = map(int, input().split())
for i in range(1, A+1):
if B*i % A == 0:
print(B*i)
break
| 0 | null | 76,120,594,417,292 | 180 | 256 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
Ls = list(mapint())
Ls.sort()
from bisect import bisect_left
ans = 0
for i in range(N-2):
for j in range(i+1, N-1):
idx = bisect_left(Ls, Ls[i]+Ls[j])
ans += idx-1-j
print(ans)
|
#それゆけにぶたんまん
#python3.8.2のTLEの壁に阻まれました
n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0
for i in range(n):
for j in range(i+1,n):
#jより大きい整数kでl[k]<l[i]+l[j]を満たす最大のk
le = j
ri = n
while ri-le>1:
m = (ri+le)//2
if l[m]<l[i]+l[j]:
le = m
else:
ri = m
ans += le-j
print(ans)
| 1 | 172,578,726,070,648 | null | 294 | 294 |
N=int(input())
a = list(map(int,input().split()))
s = a[0]
for i in range(1,len(a)):
s ^= a[i]
#print(a[i])
#print(s)
for i in range(len(a)):
#print(s,a[i])
ans = s^a[i]
print(ans,end=" ")
|
s=input()
if(s[-1]=='s'): ans='es'
else: ans='s'
print(s+ans)
| 0 | null | 7,485,390,811,320 | 123 | 71 |
n = int(input())
strs = []
for _ in range(n):
strs.append(input())
print("AC x ", strs.count("AC"))
print("WA x ", strs.count("WA"))
print("TLE x ", strs.count("TLE"))
print("RE x ", strs.count("RE"))
|
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
status = input()
if status == 'AC':
ac += 1
elif status == 'WA':
wa += 1
elif status == 'TLE':
tle += 1
else:
re += 1
print('AC x', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re)
| 1 | 8,672,777,661,950 | null | 109 | 109 |
"""
9 5
-4 -3 -2 -1 0 1 2 3
"""
N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
Am = []
Ap = []
for a in A:
if a < 0:
Am.append(a)
else:
Ap.append(a)
mod = 10**9 + 7
ans = 1
if N == K:
for a in A:
ans *= a
ans %= mod
elif A[-1] < 0:
if K % 2 == 1:
for i in range(K):
ans *= Am[-1-i]
ans %= mod
else:
for i in range(K):
ans *= Am[i]
ans %= mod
else:
if K%2 == 1:
ans *= Ap[-1]
ans %= mod
K -= 1
del Ap[-1]
Amd = []
Apd = []
for i in range(len(Ap)//2):
Apd.append(Ap[-1-(2*i)]*Ap[-1-(2*i+1)])
for i in range(len(Am)//2):
Amd.append(Am[2*i]*Am[2*i+1])
Apd.append(-1)
Amd.append(-1)
ip = 0
im = 0
while K > 0:
if Apd[ip] >= Amd[im]:
ans *= Apd[ip]
ip += 1
else:
ans *= Amd[im]
im += 1
ans %= mod
K -= 2
ans %= mod
print(ans)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
mod=10**9+7
if n==k:
# n==kなら全部選ぶ必要がある
ans=1
for q in a:
ans*=q
ans%=mod
print(ans)
exit()
if all(q>=0 for q in a):
# 全部正なら大きい方から
ans=1
a.sort()
for _ in range(k):
ans*=a.pop()
ans%=mod
print(ans)
exit()
if all(q<0 for q in a):
# 全部負なら
# kが奇数の時は大きい方(絶対値が小さい方)から
# kが偶数のときは小さい方(絶対値が大きい方)から
ans=1
a.sort()
if k%2==0:
for i in range(k):
ans*=a[i]
ans%=mod
else:
for _ in range(k):
ans*=a.pop()
ans%=mod
print(ans)
exit()
pos=[]
neg=[]
for q in a:
if q>=0:
pos.append(q)
else:
neg.append(q)
pos.sort()
neg.sort()
neg=neg[::-1]
# arr[-1]の絶対値が最大となるようにソート
kk=k
# kが奇数のときは、posの最大は絶対とって良い
if kk%2==1:
ans=pos.pop()%mod
kk=kk-1
else:
ans=1
# 2個ずつ比較しながら掛け算
# 片方の長さが2に満たない場合は、もうそちらからは取らない
while kk>0:
if len(pos)<2:
ans=ans*neg.pop()%mod*neg.pop()%mod
kk-=2
elif len(neg)<2:
ans=ans*pos.pop()%mod*pos.pop()%mod
kk-=2
else:
if pos[-1]*pos[-2]>=neg[-1]*neg[-2]:
ans=ans*pos.pop()%mod*pos.pop()%mod
kk-=2
else:
ans=ans*neg.pop()%mod*neg.pop()%mod
kk-=2
print(ans)
| 1 | 9,427,553,089,110 | null | 112 | 112 |
R,G,B=map(int,input().split())
K=int(input())
M=0
while R>=G or G>=B:
if R>=G:
G*=2
M+=1
if G>=B:
B*=2
M+=1
if M<=K:
print('Yes')
else:
print('No')
|
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
table = [[0] * n for _ in [0] * 64]
table[0] = a
for i in range(61):
for j in range(n):
table[i + 1][j] = table[i][table[i][j]]
ans = 0
for i in range(61, -1, -1):
if k >> i & 1:
ans = table[i][ans]
print(ans + 1)
| 0 | null | 14,752,035,526,492 | 101 | 150 |
N=int(input())
S=input()
count = 0
for i in range(1000):
if i < 100:
target_1 = "0"
if i < 10:
target_2 = "0"
target_3 = str(i)
else:
target_2 = str(i)[0]
target_3 = str(i)[1]
else:
target_1 = str(i)[0]
target_2 = str(i)[1]
target_3 = str(i)[2]
step = 1
for j in range(N):
if S[j] == target_1 and step == 1:
step = 2
pass
elif S[j] == target_2 and step == 2:
step = 3
elif S[j] == target_3 and step == 3:
count += 1
break
print(count)
|
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
N = int(input())
S = input()
ans = 0
for x in range(0, 1000):
t = "{:0=3}".format(x)
j = 0
for i in range(N):
if t[j] == S[i]:
j += 1
if j == 3:
ans += 1
break
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
| 1 | 128,548,424,602,858 | null | 267 | 267 |
class FastModComb:
def __init__(self, n, mod=10 ** 9 + 7):
f, self.mod = [1], mod
for i in range(1, n + 1):
f.append(f[-1] * i % mod)
rf = [self.modpow(f[-1], mod - 2)]
for i in range(1, n + 1):
rf.append(rf[-1] * (n - i + 1) % mod)
self.f, self.rf = f, list(reversed(rf))
def modpow(self, a, b):
ret = 1
while b > 0:
if b % 2 == 1:
ret = ret * a % self.mod
a = a * a % self.mod
b //= 2
return ret
def modcomb(self, n, c):
return self.f[n] * self.rf[c] * self.rf[n - c] % self.mod
n, k = map(int, input().split())
mod, mc = 10 ** 9 + 7, FastModComb(n)
print(sum([mc.modcomb(n, m) * mc.modcomb(n - 1, n - m - 1) % mod
for m in range(min(n - 1, k) + 1)]) % mod)
|
N = int(input())
if(N > 81):
print("No")
else:
state='No'
for i in range(1,10):
for j in range(1,10):
if(i*j == N):
state='Yes'
break
if(i*j > N):
break
print(state)
| 0 | null | 113,281,464,454,346 | 215 | 287 |
def main():
n = input()
A = []
for i in xrange(n):
A.append(map(int,raw_input().split()))
c,d = bfs(n,A)
for i in xrange(n):
if c[i] == -1:
print i+1, -1
else:
print i+1, d[i]
def bfs(n,A):
color = [-1]*n
d = [-1]*n
Q = []
d[0] = 0
Q.append(0)
while(True):
if len(Q)==0:
break
u = Q.pop(0)
for i in A[u][2:]:
if color[i-1] == -1:
color[i-1] = 0
d[i-1] = d[u]+1
Q.append(i-1)
color[u] = 1
return color, d
if __name__ == '__main__':
main()
|
n=int(input())
G=[[0,[],0,-1]]
for i in range(n):
v=[int(j) for j in input().split(" ")]
u=v.pop(0)
k=v.pop(0)
G.append([k,v,0,-1])
distance=0
dis_list=[1]
G[1][3]=0
G[1][2]=1
while len(dis_list)!=0:
distance+=1
dis_list_cash=[]
for i in dis_list:
k=G[i][0]
v=G[i][1]
for j in range(k):
if G[v[j]][2]==0:
G[v[j]][2]=1
G[v[j]][3]=distance
dis_list_cash.append(v[j])
dis_list=dis_list_cash
for i in range(1,n+1):
print(str(i)+" "+str(G[i][3]))
| 1 | 4,262,485,580 | null | 9 | 9 |
N = int(input())
X = (N%100)%10
if X == 3:
print('bon')
elif X == 0 or X == 1 or X == 6 or X == 8:
print('pon')
else:
print('hon')
|
N = int(input())
n = N % 10
if n in [2,4,5,7,9]:
print('hon')#.format(N))
elif n in [0,1,6,8]:
print('pon')#.format(N))
else:
print('bon')#.format(N))
| 1 | 19,247,290,028,540 | null | 142 | 142 |
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
for i in range(n):
asum.append(asum[-1]+a[i])
for i in range(m):
bsum.append(bsum[-1]+b[i])
ans=0
for i in range(n+1):
if asum[i]>k:
break
while asum[i]+bsum[m]>k and m>0:
m-=1
ans=max(ans,i+m)
print(ans)
|
n = int(input())
count = [0]*n
ans = 1
flag = True
for d in map(int,input().split()):
if flag:
if d!=0:
print(0)
exit()
flag = False
count[d] += 1
for i in range(1,n):
if count[0]!=1:
ans = 0
break
if count[i]==0:
if any(k!=0 for k in count[i:]):
ans = 0
break
ans *= (count[i-1]**count[i])%998244353
print(ans%998244353)
| 0 | null | 82,604,828,978,900 | 117 | 284 |
n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26 #最下位の位の文字を求める(係数が26でない最下位の位が余りとして出せる)
if x == 0: #Xが26のときのみ余り0で対応させるため26に書き換え
x = 26
res += chars[x] #文字を正解リストに追加
n -= x #xを左辺に持っていって右辺で10の位以上の数値を調べる
if n == 0 :
break
n //= 26 #n-xは必ず26の倍数になっている。(xを移項しているから自明)
#最下位の位を余りとして扱うために26で割って係数を消している。
print(res[::-1])#resには1の位が一番初めに入っているので、反転させて表示
|
import sys,math
input = sys.stdin.readline
A,B,C,D=list(map(int,input().split()))
if math.ceil(C/B) <= math.ceil(A/D):
print('Yes')
else:
print('No')
| 0 | null | 20,699,912,347,972 | 121 | 164 |
from collections import deque
n, u, v = map(int, input().split())
u -= 1
v -= 1
tree = [[] for _ in range(n)]
for _ in range(n-1):
a, b = map(lambda x : int(x) - 1, input().split())
tree[a].append(b)
tree[b].append(a)
q = deque()
q.append((u, 0))
depth = [0] * n
visited = set()
while q:
p, d = q.popleft()
depth[p] = d
visited.add(p)
for x in tree[p]:
if not x in visited:
q.append((x, d+1))
q.append((v, 0))
visited.clear()
max_case = max(depth[v] - 1, 0)
while q:
p, d = q.popleft()
visited.add(p)
is_leaf = True
for x in tree[p]:
if not x in visited:
q.append((x, d+1))
is_leaf = False
if is_leaf and depth[p] < d:
max_case = max(max_case, d - 1)
print(max_case)
|
N = int(input().rstrip())
flag = False
for i in range(1,10):
for j in range(1,10):
if N == i * j:
flag = True
break
else:
continue
break
print('Yes' if flag else 'No')
| 0 | null | 138,631,326,240,348 | 259 | 287 |
def function(arg):
xyabc, pa, qb, rc = arg.split('¥n')
X,Y,A,B,C = map(int, xyabc.split())
oishisa_A = list(map(int, pa.split()))
oishisa_B = list(map(int, qb.split()))
oishisa_C = list(map(int, rc.split()))
oishisa_A.sort(reverse=True)
oishisa_A = oishisa_A[:X] # at most X
oishisa_B.sort(reverse=True)
oishisa_B = oishisa_B[:Y] # at most Y
oishisa_C.sort(reverse=True)
oishisa = oishisa_A + oishisa_B + oishisa_C
oishisa.sort(reverse=True)
results = 0
for i in range(X+Y):
results += oishisa[i]
return results
if __name__ == '__main__':
xyabc = input()
pa = input()
qb = input()
rc = input()
print(function(xyabc+'¥n'+pa+'¥n'+qb+'¥n'+rc))
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a[0] = (a[0]-1)%k
for i in range(1,n):
a[i] = (a[i]+a[i-1]-1)%k
ans = 0
b = {0:1}
for i in range(n):
if i>0:
b[a[i-1]] = b.get(a[i-1],0) + 1
if i>=k:
b[a[i-k]] -= 1
if i==k-1:
b[0] -= 1
ans += b.get(a[i],0)
print(ans)
| 0 | null | 91,369,327,841,870 | 188 | 273 |
n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = [_ for _ in str(input())]
ans = 0
for i in range(n):
if i - k < 0:
if t[i] == "r":
ans += p
elif t[i] == "s":
ans += r
elif t[i] == "p":
ans += s
else:
if t[i] == "r" and t[i-k] != "r":
ans += p
elif t[i] == "s" and t[i-k] != "s":
ans += r
elif t[i] == "p" and t[i-k] != "p":
ans += s
else:
t[i] = "a"
print(ans)
|
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
me = ""
ans = 0
for i in range(n):
if t[i] == "r":
if i < k:
me += "p"
ans += p
elif me[i-k] != "p":
me += "p"
ans += p
else:
if t[i-k] == "p":
me += "p"
ans += p
else:
me += "r"
elif t[i] == "s":
if i < k:
me += "r"
ans += r
elif me[i-k] != "r":
me += "r"
ans += r
else:
if t[i-k] == "r":
me += "r"
ans += r
else:
me += "s"
else:
if i < k:
me += "s"
ans += s
elif me[i-k] != "s":
me += "s"
ans += s
else:
if t[i-k] == "s":
me += "s"
ans += s
else:
me += "p"
print(ans)
| 1 | 106,722,516,504,448 | null | 251 | 251 |
N = int(raw_input())
A = map(int, raw_input().split())
def selectionSort(A, N):
count = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
if i != minj:
temp = A[i]
A[i] = A[minj]
A[minj] = temp
count += 1
return count
count = selectionSort(A, N)
print " ".join(map(str, A))
print count
|
n = int(input())
li = list(map(int, input().split()))
cnt = 0
for i in range(n):
minj = i
for j in range(i, n):
if li[j] < li[minj]:
minj = j
if li[i] != li[minj]:
li[i], li[minj] = li[minj], li[i]
cnt += 1
print(*li)
print(cnt)
| 1 | 20,155,862,880 | null | 15 | 15 |
N = int(input())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
import itertools
l = list(itertools.permutations(range(1,N+1)))
a = 0
b = 0
for i in range(len(l)):
s = [i for i in l[i]]
if s == p:
a = i
if s == q:
b = i
print(abs(a-b))
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from itertools import permutations
N = int(readline())
P = tuple(map(int, readline().split()))
Q = tuple(map(int, readline().split()))
d = {x: i for i, x in enumerate(permutations(range(1, N + 1)))}
print(abs(d[Q] - d[P]))
if __name__ == '__main__':
main()
| 1 | 100,564,970,749,112 | null | 246 | 246 |
n = int(input())
minv = int(input())
maxv = -1000000000
for i in range(1,n):
r = int(input())
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv)
|
def calc_max_profit(data):
"""
http://judge.u-aizu.ac.jp/onlinejudge/commentary.jsp?id=ALDS1_1_D
:param data: ??????????????????
:return:
"""
maxv = data[1] - data[0]
minv = data[0]
for j in range(1, len(data)):
maxv = max(maxv, data[j] - minv)
minv = min(minv, data[j])
return maxv
if __name__ == '__main__':
# ???????????\???
num = int(input())
data = []
for i in range(num):
data.append(int(input()))
# data = [5, 3, 1, 3, 4, 3]
# data = [4, 3, 2]
# ??????
result = calc_max_profit(data)
# ???????????????
print('{0}'.format(result))
| 1 | 12,490,305,220 | null | 13 | 13 |
nums = list(map(int, input().split()))
nums.sort()
print(nums[0], nums[1], nums[2])
|
from collections import deque
def solve(A, K):
a = deque() # 繰り返し部分
seen = [False for _ in range(len(A))] # 一度見たかどうか
cur = 0
while True:
# 一度通った頂点を見つけたときの処理
if seen[cur]:
while a[0] != cur:
# 最初の余計な数手分を除去する
K -= 1
a.popleft()
# K が限界になったらリターン
if K == 0:
return a[0] + 1
break
# 最初は愚直にシミュレーションしつつ、履歴をメモしていく
a.append(cur)
seen[cur] = True
cur = A[cur]
return a[K % len(a)] + 1
N, K = map(int, input().split())
A = list(map(int, input().split()))
A = [v - 1 for v in A]
print(solve(A, K))
| 0 | null | 11,532,348,355,642 | 40 | 150 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
def f(n):
for i in range(50,-1,-1):
if n>=(i*(i+1)//2):
return i
break
n=int(input())
cnt=0
alist=factorization(n)
for i in range(len(alist)):
cnt+=f(alist[i][1])
if n==1:
cnt=0
print(cnt)
|
N = int(input())
c = 0
b = [0]*1000
p = 0
while N % 2 == 0:
b[p] += 1
N //= 2
if b[p]!=0:
p += 1
i = 3
while i * i <= N:
if N % i == 0:
b[p] += 1
N //= i
else:
i += 2
if b[p]!=0:
p += 1
if N==i:
b[p] += 1
N //= i
if N!=1:
p += 1
b[p] += 1
for v in b:
for i in range(1,v+1):
if i<=v:
c += 1
v -= i
else:
break
print(c)
| 1 | 16,938,194,811,630 | null | 136 | 136 |
import os, sys, re, math
A = [int(n) for n in input().split()]
print('win' if sum(A) <= 21 else 'bust')
|
from itertools import permutations
N = int(input())
P = tuple([int(s) for s in input().split()])
Q = tuple((int(s) for s in input().split()))
seqs = []
for i, x in enumerate(permutations(range(1, N + 1), N)):
if x == P:
p = i + 1
if x == Q:
q = i + 1
print(abs(p-q))
| 0 | null | 109,267,444,769,658 | 260 | 246 |
import sys
readline = sys.stdin.readline
a,b,c,K = map(int,readline().split())
print(min(a,K) - max(K - (a + b),0))
|
a = input()
if 'a' <= a <= 'z':
print("a")
else:
print("A")
| 0 | null | 16,590,342,920,000 | 148 | 119 |
cnt = 0
def merge(A, left, mid, right):
global cnt
#print("marge ",A,left,mid,right)
n1 = mid - left
n2 = right - mid
#L = [0] * (n1+1)
#R = [0] * (n2+1)
L = [0] * (n1+1)
R = [0] * (n2+1)
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1] = 999999999
R[n2] = 999999999
i = 0
j = 0
for k in range(left,right):
cnt+=1
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def mergeSort(A, left, right):
#print("margeSort ",A,left,right)
if left+1 < right:
mid = int((left + right)/2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
S = list(map(int,input().split()))
mergeSort(S, 0, n)
S = map(str, S)
print(' '.join(S))
print(cnt)
|
H,N = map(int,input().split())
magics = [list(map(int,input().split())) for _ in range(N)]
max_A = max(a for a,b in magics)
INF = 10**10
DP = [INF]*(H+max_A)
DP[0] = 0
for i in range(1,H+max_A):
DP[i] = min(DP[i-a] + b for a,b in magics)
ans = min(DP[H:])
print(ans)
| 0 | null | 40,730,513,676,662 | 26 | 229 |
#!/usr/bin/env python3
import bisect
import collections
import sys
sys.setrecursionlimit(1000000)
ACMOD = 1000000007
INF = 1 << 62
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, S: "List[str]"):
s_plus = []
s_minus = []
total = 0
last = 0
for s in S:
l = 0
r = 0
for v in s:
if v == '(':
l += 1
elif v == ')':
if l > 0:
l = l - 1
else:
r += 1
# if r == 0:
# total += l
# elif l ==0:
# last += r
if l >= r:
s_plus.append([l, r])
else:
s_minus.append([l, r])
s_plus.sort(key=lambda x: x[1])
s_minus.sort(key=lambda x: -x[0])
# print(s_plus, s_minus)
total = 0
for l, r in s_plus + s_minus:
total -= r
if total < 0:
print(NO)
return
total += l
if total == 0:
print(YES)
else:
print(NO)
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
S = [next(tokens) for _ in range(N)] # type: "List[str]"
solve(N, S)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush
from decimal import *
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
##### 割り算の切り上げ #####
# tmp = -(-4 // 3)
##### dict の for文 #####
# for k, v in d.items():
# print(k, v)
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
pazuru_nobori = []
pazuru_kudari = []
for i in range(N):
S = inputStr()
tmp = 0
min_tmp = 0
for s in S:
if s == "(":
tmp += 1
else:
tmp -= 1
if min_tmp > tmp:
min_tmp = tmp
if tmp >= 0:
pazuru_nobori.append((min_tmp,tmp))
else:
pazuru_kudari.append((min_tmp,tmp))
pazuru_nobori.sort()
pazuru_nobori = pazuru_nobori[::-1]
score = 0
for i,val in enumerate(pazuru_nobori):
min_tmp,tmp = val
if score + min_tmp < 0:
print("No")
sys.exit()
score += tmp
pazuru_kudari_non = []
for i,val in enumerate(pazuru_kudari):
min_tmp,tmp = val
min_tmp_2 = min_tmp - tmp
tmp_2 = -1 * tmp
pazuru_kudari_non.append((min_tmp_2,tmp_2))
pazuru_kudari_non.sort()
pazuru_kudari_non = pazuru_kudari_non[::-1]
score2 = 0
for i,val in enumerate(pazuru_kudari_non):
min_tmp,tmp = val
if score2 + min_tmp < 0:
print("No")
sys.exit()
score2 += tmp
if score2 == score:
print("Yes")
else:
print("No")
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# N 個のボールを K グループに分ける場合のパターン数
def sunuke(N, K, mod=10**9+7):
if N < K or K-1 < 0:
return 0
else:
return combination(N-1, K-1, mod)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
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
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
stk = []
stk.append(edge)
while len(stk) > 0:
p = stk.pop()
for e in graph[p]:
if parent[p] == e:
continue
else:
parent[e] = p
counter[e] += counter[p]
stk.append(e)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| 1 | 23,556,895,252,370 | null | 152 | 152 |
n = int(raw_input())
s = ["S"]
h = ["H"]
c = ["C"]
d = ["D"]
card_list = [s,h,c,d]
for i in range(n):
card = raw_input().split()
for v in card_list:
if v[0] == card[0]:
v.append(int(card[1]))
# print card_list
for i in card_list:
for j in range(1, 14):
if not j in i:
print "%s %d" % (i[0], j)
|
suit = ['S','H','C','D']
num = range(0, 13)
deck = {'S':[0]*13, 'H':[0]*13, 'C':[0]*13, 'D':[0]*13}
n = input()
for i in range(0, n):
a, b = raw_input().split(" ")
deck[a][int(b)-1] = 1
for i in suit:
for j in num:
if (deck[i][j] == 0):
print("%s %d" % (i, j+1))
| 1 | 1,031,510,625,428 | null | 54 | 54 |
h,w=map(int,input().split())
if h==1 or w==1:
print(1)
exit()
print(((h+1)//2)*((w+1)//2)+(h//2)*(w//2))
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
start = k
c = 0
for i in range(n-k):
if l[start]>l[c]:
print("Yes")
else:
print("No")
start+=1
c+=1
| 0 | null | 28,869,579,460,300 | 196 | 102 |
import sys
input = sys.stdin.readline
def main():
n,a,b = [int(i) for i in input().strip().split()]
if (b-a) % 2 == 0:
print(abs(b - a) // 2)
else:
ans = min(a - 1, n - b) + 1 + (b - a - 1) // 2
print(ans)
return
if __name__ == "__main__":
main()
|
N, K = map(int, input().split())
if N % K == 0:
print(0)
elif N % K > abs((N%K)-K):
print(abs((N%K)-K))
else:
print(N%K)
| 0 | null | 74,222,615,840,902 | 253 | 180 |
input_n = input()
price1 = input()
price2 = input()
min_price = min(price1,price2)
max_profit = price2-price1
for i in xrange(input_n-2):
input_profit = input()
tmp = input_profit-min_price
if max_profit<tmp:
max_profit = tmp
if min_price>input_profit:
min_price = input_profit
print max_profit
|
from collections import Counter
def resolve():
MOD = 998244353
N = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
return
CNT = Counter(D)
if CNT[0] > 1: # 距離0は1個
print(0)
return
ans = 1
for i in range(1, max(D) + 1):
ans *= pow(CNT[i - 1], CNT[i], MOD)
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| 0 | null | 77,528,419,624,706 | 13 | 284 |
import sys
N,K = map(int,input().split())
array = [ a for a in range(1,N+1) ]
for I in range(K):
_ = input()
sweets = list(map(int,input().split()))
for K in sweets:
if K in array:
array.remove(K)
print(len(array))
|
def resolve():
N, K = list(map(int, input().split()))
snacks = [0 for _ in range(N)]
for i in range(K):
d = int(input())
A = list(map(int, input().split()))
for a in A:
snacks[a-1] += 1
cnt = 0
for s in snacks:
if s == 0:
cnt += 1
print(cnt)
if '__main__' == __name__:
resolve()
| 1 | 24,630,393,982,418 | null | 154 | 154 |
H = int(input())
W = int(input())
N = int(input())
x = H if H>W else W
x2 = 0 if N%x==0 else 1
print(N//x + x2)
|
h = int(input())
w = int(input())
n = int(input())
lines = 0
act = 0
if h <= w:
# print('w long')
lines = h
act = w
else:
# print('h long')
lines = w
act = h
# print(lines)
# print(act)
draw = 0
for i in range(lines):
if n <= (i + 1) * act:
print(i + 1)
break
| 1 | 89,243,555,865,660 | null | 236 | 236 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
def cumsum(s):
n = len(s)
cs = [0] * (n+1)
for i in range(n):
cs[i+1] = cs[i] + s[i]
return cs
def bs_list(a, f):
l, r = -1, len(a)
while r - l > 1:
x = (l + r) // 2
if f(a[x]): r = x
else: l = x
return None if r == len(a) else r
a.sort()
ca = cumsum(a)
def detect(x):
num = 0
for b in a[::-1]:
res = bs_list(a, lambda y: y >= x - b)
if res is None: break
num += n - res
return num <= m
l, r = -1, 10**5*2+10
while r - l > 1:
x = (l+r) // 2
if detect(x): r = x
else: l = x
s, c = 0, 0
for b in a[::-1]:
res = bs_list(a, lambda x: x >= r - b)
if res is None: break
c += (n - res)
s += b * (n - res) + (ca[n] - ca[res])
print(s + (m - c) * l)
|
print(sum([i for i in range(int(input()) + 1) if (i % 3 != 0 and i % 5 != 0)]))
| 0 | null | 71,838,174,073,068 | 252 | 173 |
card = []
check = [[0, 0, 0] for i in range(3)]
for i in range(3):
card.append(list(map(int, input().split())))
n = int(input())
for i in range(n):
b = int(input())
for j in range(3):
for k in range(3):
if b == card[j][k]:
check[j][k] = 1
flag = 0
for i in range(3):
if check[i][0] == check[i][1] == check[i][2] == 1:
flag = 1
break
elif check[0][i] == check[1][i] == check[2][i] == 1:
flag = 1
break
elif check[0][0] == check[1][1] == check[2][2] == 1:
flag = 1
break
elif check[0][2] == check[1][1] == check[2][0] == 1:
flag = 1
break
if flag:
print('Yes')
else:
print('No')
|
seen = [0,0,0,0,0,0,0,0,0]
seen[0],seen[1],seen[2] = (map(int,input().split()))
seen[3],seen[4],seen[5] = (map(int,input().split()))
seen[6],seen[7],seen[8] = (map(int,input().split()))
over = False
N = int(input())
for x in range(N):
num = int(input())
if num in seen:
seen[seen.index(num)] = "O"
if seen[0] == "O":
if seen[1] == seen[2] == "O":
over = True
elif seen[3] == seen[6] == "O":
over = True
elif seen[4] == seen[8] == "O":
over = True
elif seen[4] == "O":
if seen[2] == seen[6] == "O":
over = True
elif seen[1] == seen[7] == "O":
over = True
elif seen[3] == seen[5] == "O":
over = True
elif seen[8] == "O":
if seen[6] == seen[7] == "O":
over = True
if seen[2] == seen[5] == "O":
over = True
if not over:
print("No")
else:
print("Yes")
| 1 | 59,856,307,220,930 | null | 207 | 207 |
N = int(input())
print(N // 2 - int(N % 2 == 0))
|
from sys import stdin
N = int(stdin.readline().rstrip())
if N % 2 == 0:
print(N//2-1)
else:
print((N-1)//2)
| 1 | 152,865,707,907,068 | null | 283 | 283 |
n=int(input())
s=list(map(int,input().split()))
ans=0
j=1
for i in s:
if i!=j :
ans+=1
else:
j+=1
print(ans) if ans<n else print(-1)
|
n, m = map(int, input().split())
def out(s, e):
while s < e:
print("{} {}".format(s, e))
s += 1
e -= 1
if m % 2 == 0:
out(1, m)
out(m + 1, 2 * m + 1)
else:
out(1, m + 1)
out(m + 2, 2 * m + 1)
| 0 | null | 71,825,962,814,880 | 257 | 162 |
seq = int(input())
a = int(10**9 + 7)
answer = (10**seq - 9**seq - 9**seq + 8**seq)%a
print(answer)
|
import math
N = int(input())
result = N
for i in range(1, int(math.sqrt(N))+2):
if N % i == 0:
result = min(result, i - 1 + N//i - 1)
print(result)
| 0 | null | 82,132,957,606,702 | 78 | 288 |
n,a,b,=map(int,input().split())
c = n//(a+b)
da = n-c*(a+b)
if da>a:
da=a
print(c*a+da)
|
n, t = map(int, input().split())
l = [[0, 0] for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
l[i][0] = a
l[i][1] = b
l.sort()
#print(l)
ans = 0
dp = [[0]*(t+1) for _ in range(n+1)]
for i in range(n):
for j in range(t):
dp[i+1][j] = max(dp[i+1][j], dp[i][j])
nj = j+l[i][0]
if nj < t:
dp[i+1][nj] = max(dp[i+1][nj], dp[i][j]+l[i][1])
now = dp[i][t-1] + l[i][1]
ans = max(ans, now)
#print(dp)
print(ans)
| 0 | null | 104,077,331,792,192 | 202 | 282 |
x, k, d = [int(s) for s in input().split()]
x = abs(x)
q, m = divmod(x, d)
if q >= k:
x -= k * d
else:
x = m
if (k - q) & 1:
x = d - x
print(x)
|
X, K, D = map(int, input().split())
N = abs(X) // D
O = abs(X) - N * D
if O <= (D - O):
pass
else:
N += 1
O = D - O
if N >= K:
print(abs(X) - K * D)
else:
if (K - N) % 2 == 0:
print (O)
else:
print(D - O)
| 1 | 5,208,074,639,320 | null | 92 | 92 |
k = int(input())
a, b = map(int, input().split())
if a <= k <= b or k <= b/2:
print('OK')
else:
print('NG')
|
def resolve():
k = int(input())
a, b = list(map(int, input().split()))
for i in range(a, b + 1):
if i % k == 0:
print('OK')
return
print('NG')
resolve()
| 1 | 26,417,392,608,258 | null | 158 | 158 |
r=input().split()
N=int(r[0])
K=int(r[1])
d=[int(s) for s in input().split()]
ans=0
for i in range(N):
if d[i]>=K:
ans+=1
print(ans)
|
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N, K = rl()
H = rl()
ans = 0
for h in H:
if h >= K:
ans += 1
print(ans)
| 1 | 179,193,300,399,422 | null | 298 | 298 |
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
S = S()
if S[2] == S[3] and S[4] == S[5]:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
r = S.count('R')
g = S.count('G')
b = S.count('B')
ans = r*g*b
for i in range(N):
for d in range(N):
j = i+d
k = i+2*d
if k > N-1:
break
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans)
| 0 | null | 39,075,859,279,206 | 184 | 175 |
xs = ["X"] + input().split(" ")
print(xs.index("0"))
|
X = list(map(int, input().split()))
print(X.index(0) + 1)
| 1 | 13,426,943,774,858 | null | 126 | 126 |
n, k = list(map(int, input().split(' ')))
print(sum([tall >= k for tall in list(map(int, input().split(' ')))]))
|
N,M=map(int, input().split())
S=list(input())
T=S[::-1]
D=[0]*N
if N<=M:
print(N)
exit()
renzoku,ma=0,0
for i in range(1,N+1):
if S[i]=='1':
renzoku+=1
else:
ma=max(ma,renzoku)
renzoku=0
if ma>=M:
print(-1)
exit()
r=0
for i in range(1,M+1):
if T[i]!='1':
r=i
ans=[r]
while r+M<N:
for i in range(M,0,-1):
if T[r+i]=='0':
ans.append(i)
r+=i
break
ans.append(N-r)
print(*ans[::-1])
| 0 | null | 159,595,375,984,682 | 298 | 274 |
x,y = map(int,input().split())
m = 10**9+7
n = (x+y)//3
c = 0
if x*0.5 <= y <= 2*x and (x+y)%3 == 0:
r = x - n
c = 1
for i in range(1,r+1):
c *= (n-i+1) % m
c *= pow(i,m-2,m)
c = c % m
else:
ans = 0
print(c)
|
def main():
MOD = 10 ** 9 + 7
X, Y = map(int, input().split())
if (X + Y) % 3:
print(0)
return
a = (X * 2 - Y) // 3
b = X - a * 2
def choose(n, a, mod):
x, y = 1, 1
for i in range(a):
x = x * (n - i) % mod
y = y * (i + 1) % mod
return x * pow(y, mod - 2, mod) % mod
if a < 0 or b < 0:
print(0)
return
ans = choose(a + b, min(a, b), mod=MOD)
print(ans)
if __name__ == '__main__':
main()
| 1 | 149,993,455,611,630 | null | 281 | 281 |
import math
def prime(num):
judge = True
for i in range(2, int(math.sqrt(num)+1)):
if num % i == 0:
judge = False
return judge
n = int(input())
cnt = 0
ns=[]
for i in range(n):
num = int(input())
if prime(num):
cnt += 1
print(cnt)
|
A, B, C = map(int, input().split())
print(str(C) + " " + str(A) + " " + str(B))
| 0 | null | 19,136,358,678,502 | 12 | 178 |
W,H,x,y,r = map(int,input().split())
if x-r<0 or W<x+r or y-r<0 or H<y+r: print('No')
else: print('Yes')
|
whxyr = input().split()
[w, h, x, y, r] = [int(x) for x in whxyr]
if 0 <= x - r and x + r <= w and 0 <= y - r and y + r <= h:
print("Yes")
else:
print("No")
| 1 | 458,104,870,428 | null | 41 | 41 |
a, b = map(int, input().split())
def gcd(a, b):
if a == b:
return a
big = max(a, b)
small = min(a, b)
while not big % small == 0:
big, small = small, big%small
return small
print(gcd(a, b))
|
n = int(input().rstrip())
def calc(target):
result = 0
count = 0
if target % 2 == 0:
print(-1)
return
for i in range(n):
result = (result * 10 + 7) % target
count += 1
if result == 0:
print(count)
return
print(-1)
calc(n)
| 0 | null | 3,066,797,772,160 | 11 | 97 |
n,m=map(int,input().split())
a =map(int,input().split())
x = sum(a)
if x > n:
print('-1')
else:
print(n-x)
|
a,b=map(int,input().split())
List = list(map(int, input().split()))
wa = 0
for i in range(b):
wa += List[i]
res = a - wa
if res < 0:
res = -1
print(res)
| 1 | 32,109,063,339,420 | null | 168 | 168 |
n, x, m = map(int, input().split())
mn = min(n, m)
S = set()
A = []
sum_9 = 0 # sum of pre + cycle
for _ in range(mn):
if x in S: break
S.add(x)
A.append(x)
sum_9 += x
x = x*x % m
if len(A) >= mn:
print(sum_9)
exit()
pre_len = A.index(x)
cyc_len = len(A) - pre_len
nxt_len = (n - pre_len) % cyc_len
cyc_num = (n - pre_len) // cyc_len
pre = sum(A[:pre_len])
cyc = sum_9 - pre
nxt = sum(A[pre_len: pre_len + nxt_len])
print(pre + cyc * cyc_num + nxt)
|
n,x,m=map(int,input().split())
# 一定回数を経ると循環するので最後にかければよい
a_i = x
log = [x]
app=[-1]*m
app[x]=0
last = x
for i in range(1,n):
a_i = (a_i**2)%m
if app[a_i] > -1:
last = a_i
break
app[a_i] = i
log.append(a_i)
# ループの手前(or最後)まで足し合わせる
ans = sum(log[:min(n, app[last])])
if n > app[last]:
# ループ中合計
ans += sum(log[app[last]:]) * ((n-app[last]) // (len(log) - app[last]))
# 末端合計
ans += sum(log[app[last]:app[last] + (n-app[last]) % (len(log) - app[last])])
print(ans)
| 1 | 2,796,330,531,868 | null | 75 | 75 |
n = int(input())
def saiki(i):
if i > 1:
return 2 * saiki(i // 2) + 1
if i == 1:
return 1
print(saiki(n))
|
H = int(input())
for i in range(0, 10**20 + 1):
if 2**i <= H < 2 ** (i + 1):
break
print(2 ** (i + 1) - 1)
| 1 | 79,901,839,025,162 | null | 228 | 228 |
X = int(input())
R = 8 - ((X - 400) // 200)
print(R)
|
value = int(input())
kyu_rated = 8
lvalue = 400
rvalue = 599
for i in range(0, 8):
if lvalue <= value <= rvalue:
print(kyu_rated)
flag = 1
break
else:
lvalue += 200
rvalue += 200
kyu_rated -= 1
| 1 | 6,656,050,079,360 | null | 100 | 100 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
S = readline().strip()
counter = Counter(S)
ans = counter['R'] * counter['G'] * counter['B']
for i in range(N):
for j in range(i + 1, (N + i + 1) // 2):
if 2 * j - i >= N:
break
if S[i] != S[j] and S[i] != S[2 * j - i] and S[j] != S[2 * j - i]:
ans -= 1
print(ans)
return
if __name__ == '__main__':
main()
|
import math
r = float(input())
pi =math.pi
print('%.10f %.10f'%(r*r*pi,2*r*pi))
| 0 | null | 18,335,268,465,120 | 175 | 46 |
a = input()
print('A' if a.upper() == a else 'a')
|
import math
def main():
mod = 1000000007
N = int(input())
A = list(map(int, input().split()))
A_max = sorted(A)[-1]
if A_max == 0:
print(0)
exit()
bit_max = int(math.ceil(math.log2(A_max)))
i = 0
bit = 1
res = 0
while i <= bit_max:
c_zero = 0
c_one = 0
for j in range(N):
if A[j] & bit == 0:
c_zero += 1
else:
c_one += 1
m_bit = bit % mod
res += m_bit*c_zero*c_one
res %= mod
i += 1
bit<<=1
print(res)
if __name__ == "__main__":
main()
| 0 | null | 67,398,531,860,610 | 119 | 263 |
N = int(input())
D = list(map(int, input().split()))
DL = [0] * N
mod = 998244353
if D[0] != 0:
print(0)
exit()
for d in D:
DL[d] += 1
if DL[0] != 1:
print(0)
exit()
ans = 1
for i in range(1, N):
if DL[i] == 0:
if sum(DL[i:]) != 0:
print(0)
exit()
else:
print(ans%mod)
exit()
ans *= pow(DL[i-1], DL[i], mod)
ans %= mod
print(ans % mod)
|
from collections import Counter
mod=998244353
n=int(input())
D=list(map(int,input().split()))
Count=Counter(D)
if D[0]!=0 or Count[0]!=1:print(0);exit()
ans=1
for i in range(1,max(D)+1):
ans *=Count[i-1]**Count[i]
ans %=mod
print(ans)
| 1 | 154,786,515,625,160 | null | 284 | 284 |
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=10007
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n=int(input())
a=list(map(int,input().split()))
lst=ruiseki(a)
asum=sum(a)
# print(asum)
# print(lst)
cnt=bisect.bisect_left(lst,asum/2)
# print(cnt)
if asum//2==lst[cnt]:
print(0)
else:
if asum%2==0:
print(2*min(asum//2-lst[cnt-1],lst[cnt]-asum//2))
else:
print(min((asum//2-lst[cnt-1])*2+1,(lst[cnt]-asum//2)*2-1))
|
a,b = input().split()
a = int(a)
b = int(b)
S = a*b
C = 2 * (a+b)
print(str(S) + " " + str(C))
| 0 | null | 71,228,289,808,480 | 276 | 36 |
print(int(input())*3.141592*2)
|
DE = 10**9 + 7
N, K = list(map(lambda x: int(x), input().split(' ')))
A = list(map(lambda x: int(x), input().split(' ')))
def main():
A_posi = []
A_nega = []
for a in A:
if a > 0:
A_posi.append(a)
elif a < 0:
A_nega.append(-a)
len_posi = len(A_posi)
len_nega = len(A_nega)
if len_posi + len_nega < K:
return 0
if (len_nega % 2 == 1 and K == len_posi + len_nega) or (K % 2 == 1 and len_posi == 0):
if len_posi + len_nega == N:
A_posi.sort()
A_nega.sort()
answer = 1
k = 0
for a in A_nega:
answer *= (- a) % DE
answer %= DE
k += 1
if k >= K:
break
else:
for a in A_posi:
answer *= a % DE
answer %= DE
k += 1
if k >= K:
break
return answer
else:
return 0
A_posi.sort(reverse=True)
A_nega.sort(reverse=True)
posi = 0
nega = 0
answer = 1
if K % 2 == 1:
answer = A_posi[0] % DE
posi = 1
while posi + nega + 2 <= K:
p = A_posi[posi] * A_posi[posi + 1] if posi + 1 < len_posi else 0
n = A_nega[nega] * A_nega[nega + 1] if nega + 1 < len_nega else 0
if p > n:
answer *= p % DE
answer %= DE
posi += 2
else:
answer *= n % DE
answer %= DE
nega += 2
return answer
print(main())
| 0 | null | 20,491,554,257,732 | 167 | 112 |
X = int(input())
A = 100
for i in range(10**5):
A = A*101//100
if X <= A:
break
print(i+1)
|
x = int(input())
cnt, ans = 100, 0
while cnt < x:
ans += 1
cnt = cnt * 101 // 100
print(ans)
| 1 | 27,044,641,960,480 | null | 159 | 159 |
a,b = list(map(int, input().split()))
c,d = list(map(int, input().split()))
if (a != c):
print(1)
else:
print(0)
|
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
print(1 if M1 != M2 else 0)
| 1 | 124,744,838,073,748 | null | 264 | 264 |
from collections import deque
import sys
input = sys.stdin.readline
def main():
N,X,Y = map(int,input().split())
edge = [[] for _ in range(N)]
for i in range(N):
if i == 0:
edge[i].append(i+1)
elif i == N-1:
edge[i].append(i-1)
else:
edge[i].append(i-1)
edge[i].append(i+1)
edge[X-1].append(Y-1)
edge[Y-1].append(X-1)
ans = [0]*(N-1)
for i in range(N):
visited = [0]*N
dist = [0]*N
q = deque([i])#i番目のノードを根とする探索
visited[i] = 1
while q:
now = q.popleft()
for connection in edge[now]:
if visited[connection]:
dist[connection] = min(dist[connection],dist[now]+1)
else:
visited[connection] = 1
dist[connection] = dist[now] + 1
q.append(connection)
for d in dist:
if d == 0:
continue
ans[d-1] += 1
ans = list(map(lambda x: x//2,ans))
print(*ans,sep="\n")
if __name__ == '__main__':
main()
|
s = input()
if s in ["RRR"]:
print(3)
if s in ["RRS", "SRR"]:
print(2)
if s in ["RSR", "RSS", "SRS", "SSR"]:
print(1)
if s == "SSS":
print(0)
| 0 | null | 24,458,238,915,502 | 187 | 90 |
a, b = map(int, input().split())
c = list(map(int, input().split()))
if a >= sum(c):
print(a - sum(c))
else:
print('-1')
|
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,T=map(int,input().split())
AB=[tuple(map(int,input().split())) for _ in range(n)]
AB.sort()
dp=[0]*T
ans=0
for a,b in AB:
ndp=dp[:]
for t in range(T):
if(t+a<T):
ndp[t+a]=max(ndp[t+a],dp[t]+b)
else:
ans=max(ans,dp[t]+b)
dp=ndp
print(ans)
resolve()
| 0 | null | 91,798,765,806,152 | 168 | 282 |
#!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from operator import sub
def resolve():
it = map(int, sys.stdin.read().split())
N = next(it)
M = 10**9+1
data = [[M, -M], [M, -M]]
for x, y in zip(it, it):
for i, x in enumerate([x+y, x-y]):
for j, f in enumerate([min, max]):
data[i][j] = f(data[i][j], x)
print(max(map(lambda x: abs(sub(*x)), data)))
if __name__ == "__main__":
resolve()
|
N=int(input())
xy=[tuple(map(int,input().split())) for _ in range(N)]
ans=0
zmi=10**10
zma=-10**10
wmi=10**10
wma=-10**10
for x,y in xy:
zmi=min(zmi,x+y)
zma=max(zma,x+y)
wmi=min(wmi,x-y)
wma=max(wma,x-y)
print(max(zma-zmi,wma-wmi))
| 1 | 3,423,705,205,800 | null | 80 | 80 |
#!/usr/bin/env python3
s = input()
n = len(s)
t = s[:(n - 1) // 2]
u = s[(n + 1) // 2:]
print("YNeos"[any([s != s[::-1], t != t[::-1], u != u[::-1]])::2])
|
S = input()
s1 = S[0:int((len(S)-1)/2)]
s2 = S[int((len(S)/2))+1:len(S)+1]
if S == S[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:
print("Yes")
else:
print("No")
| 1 | 46,079,432,233,590 | null | 190 | 190 |
N = int(input())
XL = [tuple(map(int, input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0] + x[1])
ans = 0
prev = - 10**9
for x, l in XL:
if prev <= x - l:
ans += 1
prev = x + l
print(ans)
|
import sys, math
input = sys.stdin.readline
H, N = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
max_a = max([a for a, b in ab])
dp = [math.inf] * (H+max_a+1)
dp[0] = 0
for i in range(H + 1):
for a, b in ab:
dp[i + a] = min(dp[i + a], dp[i] + b)
print(min(dp[H:]))
| 0 | null | 85,284,205,726,620 | 237 | 229 |
def resolve():
A, B, N = map(int, input().split())
if B <= N+1:
print(A*(B-1)//B)
else:
print(A*N//B)
resolve()
|
A,B,N=map(int,input().split())
if B>N:
print((A*N)//B-A*(N//B))
else:
print((A*(B-1)//B-A*((B-1)//B)))
| 1 | 28,161,298,705,670 | null | 161 | 161 |
N=int(input())
if N%2==0:
ans=0
x=10
while x<=N:
ans+=N//x
x*=5
else:
ans=0
print(ans)
|
# 解説見ました。
n = int(input())
ans = 0
if n%2 == 0:
m = 1
for _ in range(25):
ans += n//(m*10)
m *= 5
print(ans)
| 1 | 115,764,020,250,110 | null | 258 | 258 |
N = int(input())
S = input()
r = S.count("R")
g = S.count("G")
b = S.count("B")
ans = r * g * b
for i in range(N):
for j in range(i + 1, N):
k = 2 * j - i
if k < N:
if sorted(S[i] + S[j] + S[k]) == ['B', 'G', 'R']:
ans -= 1
print(ans)
|
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)
| 1 | 36,428,565,320,548 | null | 175 | 175 |
import math
n=int(input())
m=int(math.sqrt(n))+1
for i in range(m):
if n%(m-i)==0:
k=m-i
l=n//(m-i)
break
print(k+l-2)
|
n,a,b=map(int,input().split())
MOD=10**9+7
def inv(a):
return pow(a,MOD-2,MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
A=B=1
for i in range(r):
A=A*(n-i)%MOD
B=B*(i+1)%MOD
return A*inv(B)%MOD
print((pow(2,n,MOD)-1-choose(n,a)-choose(n,b))%MOD)
| 0 | null | 114,092,518,475,770 | 288 | 214 |
n,k=map(int,input().split())
a=list(map(int,input().split()))
visit=[0 for i in range(n)]
goal,loop=[],[]
now=0
while visit[now]!=2 :
if visit[now]==0 :
goal.append(now)
else :
loop.append(now)
visit[now]+=1
now=a[now]-1
if len(goal)>k :
print(goal[k]+1)
else :
res=len(goal)-len(loop)
print(loop[(k-res)%len(loop)]+1)
|
N,K=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
town=set()
town.add(1)
town_ls=[1]
now=1
for i in range(min([K,N])):
now=ls[now-1]
if now in town:
break
town.add(now)
town_ls.append(now)
if i+1==K:
print(now)
else:
L=i+1
S=town_ls.index(now)
loop=L-S
#print(loop,S)
x=(K-S)%loop+S
print(town_ls[x])
| 1 | 22,813,246,505,802 | null | 150 | 150 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(input())
for i in range(2,int(n**.5) + 1):
if n % i == 0:
tmp = n
while tmp % i==0:
tmp //= i
if (tmp-1) % i == 0:ans += 1
if n//i != i:
tmp = n;i = n//i
while tmp % i==0:
tmp //= i
if (tmp-1) % i == 0:ans += 1
for i in range(2,int((n-1)**.5 )+ 1):
if (n-1) % i == 0:
if (n-1) // i == i: ans += 1
else: ans += 2
# print(ans)
print(ans+1 + int(n != 2))
|
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])
| 0 | null | 24,743,492,203,582 | 183 | 106 |
cube = input()
print(cube**3)
|
import math
a, b = map(int, input().split())
cand = range(b*10, b*10+10)
out = -1
for el in cand:
if math.floor(el * 0.08) == a:
out = el
break
else:
continue
print(out)
| 0 | null | 28,308,030,945,412 | 35 | 203 |
N,K= map(int,input().split())
p = list(map(int,input().split()))
sum1=0.0
for i in range (K):
sum1=((p[i]+1)/2.0)+sum1
sum2=sum1
for i in range(N-K):
sum1=sum1+((p[i+K]-p[i])/2.0)
if sum1>sum2:
sum2=sum1
print(sum2)
|
x = int(input())
if x == 1:
print("0")
elif x == 0:
print("1")
| 0 | null | 38,947,663,693,820 | 223 | 76 |
import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
X, Y, A, B, C = map(int, readline().split())
p = list(map(int, readline().split()))
q = list(map(int, readline().split()))
r = list(map(int, readline().split()))
p = sorted(p, reverse=True)[:X]
q = sorted(q, reverse=True)[:Y]
bag = p + q + r
bag = sorted(bag, reverse=True)
print(sum(bag[:(X + Y)]))
|
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(reverse=True)
Q.sort(reverse=True)
temp = P[:X] + Q[:Y] + R
temp.sort(reverse=True)
ans = sum(temp[:X+Y])
print(ans)
| 1 | 44,837,753,813,892 | null | 188 | 188 |
N=int(input())
ans=N*2-2
for n in range(1,int(N**.5)+1):
if N%n==0:
ans=min(ans,N//n+n-2)
print(ans)
|
import math
n = int(input())
sq = int(math.sqrt(n))
i=sq
for i in range(sq,0,-1):
if n%i==0:
j=n//i
break
print(i+j-2)
| 1 | 161,288,502,619,552 | null | 288 | 288 |
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)
|
def main():
n, m, l = map(int, input().split())
matrix_a = [list(map(int, input().split())) for i in range(n)]
matrix_b = [list(map(int, input().split())) for j in range(m)]
matrix_c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
for j in range(l):
matrix_c[i][j] = sum(matrix_a[i][k] * matrix_b[k][j] for k in range(m))
for row in matrix_c:
print(' '.join(map(str, row)))
main()
| 1 | 1,420,441,017,540 | null | 60 | 60 |
N=int(input())
D=[]
for i in range(N):
D.append(list(map(int,input().split())))
def total(N):
for i in range(N-2):
if D[i][0]==D[i][1] and D[i+1][0]==D[i+1][1] and D[i+2][0]==D[i+2][1]:
print('Yes')
return
print('No')
return
total(N)
|
N=int(input())
zls=[0 for _ in range(N)]
wls=[0 for _ in range(N)]
for i in range(N):
x,y=[int(s) for s in input().split()]
zls[i]=x+y
wls[i]=x-y
print(max([max(zls)-min(zls),max(wls)-min(wls)]))
| 0 | null | 2,932,991,236,670 | 72 | 80 |
a = int(input())
f = False
for i in range(1,10):
if a % i == 0 and a/i < 10:
f = True
break
if f:
print("Yes")
else:
print("No")
|
# coding=utf-8
if __name__ == '__main__':
N, K = map(int, input().split())
sunuke = [0] * N
#print(sunuke)
for i in range(K):
D = int(input())
li = list(map(int, input().split()))
for j in range(D):
sunuke[li[j] - 1] += 1
#print(sunuke)
print(sunuke.count(0))
| 0 | null | 91,977,700,287,702 | 287 | 154 |
N = int(input())
c = [0]*4
for i in range(N):
s = input()
if s == 'AC':
c[0] += 1
elif s == 'WA':
c[1] += 1
elif s == 'TLE':
c[2] += 1
else:
c[3] += 1
print('AC x ',c[0])
print('WA x ',c[1])
print('TLE x ',c[2])
print('RE x ',c[3])
|
import numpy as np
a, b, x = map(int,input().split())
if x >= a**2*b/2:
ans = np.arctan(2*(b-x/a**2)/a)
else:
ans = np.arctan(a*b/2/x*b)
print(ans*180/np.pi)
| 0 | null | 85,950,311,661,806 | 109 | 289 |
N = int(input())
if N%2 == 1 :
print(0)
exit()
n = 0
i = 0
for i in range(1,26) :
n += N//((5**i)*2)
print(n)
|
n,ans = int(input()),0
if not n%2:
for i in range(1,30):
ans+=n//(5**i*2)
print(ans)
| 1 | 116,128,991,783,630 | null | 258 | 258 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.