code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
N = int(input())
alpha=list('abcdefghijklmnopqrstuvwxyz')
res=['']
for i in range(N):
tmp = []
for j in res:
for k in alpha[:len(set(list(j))) +1]:
tmp.append(j+k)
res = tmp
for i in res:
print(i) | while 1:
x,y = map( int , raw_input().split() )
if x == 0 and y == 0:
break
elif x <= y:
print "%d %d" %(x,y)
elif y < x :
print "%d %d" %(y,x) | 0 | null | 26,533,589,228,080 | 198 | 43 |
a=str(input())
if a[0]==a[1] and a[2]==a[0] :
print('No')
else:
print('Yes')
| a = input()
if a == "AAA" or a == "BBB" :
print ("No")
else : print ("Yes")
| 1 | 54,547,249,859,588 | null | 201 | 201 |
def main():
S, T = input().split()
print(T + S)
if __name__ == "__main__":
main()
| #E
H,N=map(int,input().split())
A=[]
B=[]
DP=[0]+[float('Inf')]*(2*10**4)
for i in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
for j in range(10**4):
for i in range(N):
DP[j+A[i]]=min(B[i]+DP[j],DP[j+A[i]])
print(min(DP[H:])) | 0 | null | 92,111,745,417,298 | 248 | 229 |
import math
n, k = map(int,input().split())
list = [int(x) for x in input().split()]
list.sort()
l = 0
r = max(list)
while r - l > 1:
count = 0
x = (r + l)//2
for i in range(len(list)):
if x >= list[i]:
continue
count += math.ceil(list[i]/x) - 1
if count <= k:
r = x
else:
l = x
print(r)
| s=input()
if(s[-1]=='s'): ans='es'
else: ans='s'
print(s+ans) | 0 | null | 4,408,280,396,490 | 99 | 71 |
while 1:
try:
print(len(str(sum(map(int,input().split())))))
except: break | def main():
import sys
input = sys.stdin.buffer.readline
N, M = (int(i) for i in input().split())
H = [int(i) for i in input().split()]
ans = [1]*N
for _ in range(M):
a, b = (int(i)-1 for i in input().split())
if H[a] < H[b]:
ans[a] = 0
elif H[b] < H[a]:
ans[b] = 0
else:
ans[a] = 0
ans[b] = 0
print(sum(ans))
if __name__ == '__main__':
main()
| 0 | null | 12,490,441,356,170 | 3 | 155 |
N_dict = {i:0 for i in list(map(str,input().split()))}
N_List = list(map(int,input().split()))
ct = 0
for i in N_dict.keys():
N_dict[i] = N_List[ct]
ct += 1
N_dict[str(input())] -= 1
print(" ".join(list(map(str,N_dict.values()))))
| x = list(input().split())
y = list(map(int, input().split()))
z = input()
y[x.index(z)] -= 1
print("{0} {1}".format(y[0], y[1]))
| 1 | 71,759,865,350,840 | null | 220 | 220 |
A = int(input())
az = 'zabcdefghijklmnopqrstuvwxy'
ans = ''
while A / 26 > 0:
ans = az[A%26] + ans
A = (A-1) // 26
print(ans) | #N, K = map(int, input().split( ))
#L = list(map(int, input().split( )))
N = int(input())
i = 0
ans = []
#26^{i}がNを越えるまで以下の操作を繰り返す
while N != 0:
s = N%26
if s == 0:
s = 26
N -= s
N //= 26
ans.append(chr(s + 96))
print(''.join(list(reversed(ans)))) | 1 | 11,958,238,142,400 | null | 121 | 121 |
n = int(input())
a = list(map(int, input().split()))
m = 1
count = 0
for i in range(n):
if a[i] != m:
count += 1
else:
m += 1
print(count if count < n else -1) | N = int(input())
A = list(map(int, input().split()))
length = len(A)
find_next = 1
for i in range(N):
if A[i] == find_next:
find_next += 1
if find_next == 1:
print(-1)
else:
print(length - find_next + 1)
| 1 | 114,516,220,190,582 | null | 257 | 257 |
n,k = map(int, input().split())
a = [0]*n
for i in range(k):
c = int(input())
L = list(map(int, input().split()))
for l in L:
a[l-1] = 1
print(a.count(0)) | import itertools
n,k=map(int,input().split())
d=[]
a=[]
for i in range(k):
d.append(int(input()))
a.append(list(map(int,input().split())))
a_1=itertools.chain.from_iterable(a)
print(n-len(list(set(a_1)))) | 1 | 24,475,599,491,598 | null | 154 | 154 |
import collections
n = int(input())
l = []
for i in range(n):
l.append(input())
c = collections.Counter(l)
m = max(c.values())
chars = [key for key, value in c.items() if value == m]
chars.sort()
for s in chars:
print(s) | n,m=map(int,raw_input().split())
A = [[0 for j in range(m)] for i in range(n)]
b = [0 for j in range(m)]
for i in range(n):
A[i]=map(int, raw_input().split())
for j in range(m):
b[j]=input()
for i in range(n):
c=0
for j in range(m):
c+=A[i][j]*b[j]
print(c) | 0 | null | 35,692,601,012,508 | 218 | 56 |
a,b=map(int,input().split())
def gcd(x, y):
while y:
x, y = y, x % y
return x
l=gcd(a,b)
print(int(a*b/l))
| # -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:45:37 2020
@author: liang
"""
def gcc(a,b):
if b == 0:
return a
return gcc(b, a%b)
A, B = map(int, input().split())
if A < B:
A ,B = B, A
print(A*B//gcc(A,B))
| 1 | 113,277,420,041,474 | null | 256 | 256 |
import math
n,k = map(int,input().split())
A = list(map(int,input().split()))
low = 1
high = max(A)
while low != high:
mid = (low + high)// 2
cnt = 0
for i in A:
cnt += math.ceil(i/mid) - 1
if cnt > k :
low = mid + 1
else:
high = mid
print(low) | n,k,*a = map(int,open(0).read().split())
def func(b):
c = k
for i in a:
c -= (i-1)//b
if c < 0:
return False
return True
l = 1
r = max(a)
while(r>l):
lr = (l+r)//2
if func(lr):
r = lr
else:
l = lr + 1
print(r) | 1 | 6,463,322,655,842 | null | 99 | 99 |
'''
ITP-1_8-B
??°?????????
?????????????????°???????????????????¨??????????????????°?????????????????????????????????
???Input
?????°??????????????????????????\?????¨??????????????????????????????????????????????????????????????´??° x ?????????????????§?????????????????????
x ??? 1000 ?????\????????´??°??§??????
x ??? 0 ?????¨?????\?????????????????¨??????????????????????????????????????????????????????????????£????????????????????????
???Output
????????????????????????????????????x ???????????????????????????????????????????????????
'''
while True:
# inputData
inputData = input()
if inputData == '0':
break
# outputData
outputData = 0
for cnt0 in inputData:
outputData += int(cnt0)
print(outputData) | import functools
import operator
n = functools.partial(functools.reduce, operator.mul)
N,K = map(int,input().split())
A = list(map(int,input().split()))
# print(n(A))
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
| 0 | null | 4,390,554,925,702 | 62 | 102 |
n,k = map(int,input().split())
for i in range(10**9):
if n < k**i:
print(i)
exit() | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [0 for _ in range(n+1)] # sum_A[i]:=上からi冊の本を読むときにかかる時間
for i in range(1, n+1):
sum_A[i] = sum_A[i-1] + A[i-1]
sum_B = [0 for _ in range(m+1)] # sum_B[i]:=上からj冊の本を読むときにかかる時間
for j in range(1, m+1):
sum_B[j] = sum_B[j-1] + B[j-1]
ans = 0
i = 0
j = m
while i <= n and sum_A[i] <= k:
while sum_A[i] + sum_B[j] > k:
j -= 1
ans = max(ans, i + j)
i += 1
print(ans) | 0 | null | 37,532,542,417,560 | 212 | 117 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(read())
lim = int(n ** 0.5)
fact = [1]
for i in range(2, lim + 1):
if (n % i == 0):
fact.append(i)
else:
pass
if (len(fact) == 1):
ans = n - 1
else:
tar = fact[-1]
ans = tar + int(n // tar) - 2
print(ans)
| import math
N = int(input())
M = []
sqr_N = math.floor(math.sqrt(N))
a = 0
for i in range(1, (sqr_N + 1)):
if N % i == 0:
a = i
a_pair = N // a
print(a + a_pair - 2) | 1 | 161,624,503,884,352 | null | 288 | 288 |
S = input()
S_len = len(S)
print("x" * S_len) | S=str(input())
def kinshi(S:str):
len_count=len(S)
return("x"*len_count)
print(kinshi(S))
| 1 | 72,921,244,663,322 | null | 221 | 221 |
X,K,D = map(int,input().split())
X = abs(X)
if X >= K*D:
ans = X - K*D
else:
k = X // D
if (K - k) % 2 == 0:
ans = X - k*D
else:
ans = abs(X-(k+1)*D)
print(ans)
| import math
point =list(map(float, input().split()))
p1 = point[0]
p2 = point[1]
p3 = point[2]
p4 = point[3]
l = math.sqrt((p3 - p1)**2 + (p4 - p2)**2)
print(l) | 0 | null | 2,725,782,797,748 | 92 | 29 |
def multiply(values):
out = 1
for i in values:
out *= int(i)
print(out)
stdin = input().split()
multiply(stdin) | a, b = map(int, input().split())
print(str(a*b)) | 1 | 15,844,614,139,620 | null | 133 | 133 |
h = int(input())
w = int(input())
n = int(input())
ma = max(h, w)
print(n // ma) if n // ma == n / ma else print(n // ma + 1) | cards_num = int(input())
cards = []
missing_cards = []
for i in range(cards_num):
cards.append(input())
for i in range(1, 14):
if "S {0}".format(i) not in cards:
missing_cards.append("S {0}".format(i))
for i in range(1, 14):
if "H {0}".format(i) not in cards:
missing_cards.append("H {0}".format(i))
for i in range(1, 14):
if "C {0}".format(i) not in cards:
missing_cards.append("C {0}".format(i))
for i in range(1, 14):
if "D {0}".format(i) not in cards:
missing_cards.append("D {0}".format(i))
for i in missing_cards:
print(i) | 0 | null | 45,145,172,443,602 | 236 | 54 |
n, m = map(int, input().split())
c = list(map(int, input().split()))
INF = 10**9
MAX = n + 1
dp = [INF for _ in range(MAX)]
dp[0] = 0
for i in range(m):
for j in range(len(dp)):
if j + c[i] < MAX:
dp[j+c[i]] = min(dp[j] + 1, dp[j+c[i]])
min_v = dp[-1]
for i in range(len(dp)):
idx = len(dp) - 1 - i
min_v = min(min_v, dp[idx])
dp[idx] = min_v
print(dp[n])
| a = int(input())
if a >= 30 :
print("Yes")
else:print("No") | 0 | null | 2,956,354,559,480 | 28 | 95 |
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
a,b=sep()
print(a*b) | A, B = input().split()
total = int(A) * int(B)
print(total)
| 1 | 15,931,738,475,120 | null | 133 | 133 |
def main():
N = int(input())
ans = 0
if N == 2:
print(2)
return
while True:
flg = True
for i in range(2, ((N + 1) // 2) + 1):
if N % i == 0:
flg = False
break
if flg:
break
else:
N += 1
print(N)
if __name__ == '__main__':
main() | a = input()
b = a.split(' ')
b[0] = int(b[0])
b[1] = int(b[1])
b[2] = int(b[2])
b.sort()
print(str(b[0])+' '+str(b[1])+' '+str(b[2])) | 0 | null | 52,742,566,664,200 | 250 | 40 |
import numpy as np
def solve():
if s[2]==s[3] and s[4]==s[5]:
print("Yes")
else:
print("No")
return
s = str(input())
solve()
#a = [int(i) for i in input().split(" ")] | a,b,c,d=map(int,input().split())
x=[]*4
x.append(a*c)
x.append(b*c)
x.append(a*d)
x.append(b*d)
x.sort()
print(x[-1]) | 0 | null | 22,394,444,242,200 | 184 | 77 |
n = int(input())
num_list = list(map(int, input().split()))
ans_list = [0]*n
for i, j in enumerate(num_list):
ans_list[j-1] = str(i+1)
ans = ' '.join(ans_list)
print(ans) | a, b, c = [int(x) for x in input().split()]
k = int(input())
while b <= a:
b *= 2
k -= 1
while c <= b:
c *= 2
k -= 1
print("Yes" if k >= 0 else "No") | 0 | null | 93,898,543,658,150 | 299 | 101 |
import sys
input = sys.stdin.readline
H,W = list(map(int,input().split()))
S = [ input().rstrip() for _ in range(H)] #マップの読み込み
dp = [[float('inf')]*W for _ in range(H)] #コスト
if S[0][0] == '#':#はじめが'#'なら1,else 0
dp[0][0] = 1
else:
dp[0][0] = 0
for i in range(H):
for j in range(W):
if i == 0 and j == 0:#スタート地点は無視
continue
a = float('inf')
b = float('inf')
# S[i][j]にくるには i-1 かj-1からくるしかない
if i >= 1:
a = dp[i-1][j] + ( S[i-1][j] =='.' and S[i][j] =='#') #i-1からくる
if j >= j:
b= dp[i][j-1] + ( S[i][j-1] =='.' and S[i][j] =='#') #j-1からくる
dp[i][j] = min(a,b)#a,bの小さいほうが最小コスト
print(dp[i][j])
| H,W=list(map(int,input().split()))
l=[list(input()) for i in range(H)]
inf=10**9
DP=[[inf]*W for i in range(H)]
DP[0][0]=0 if l[0][0]=="." else 1
for i in range(H):
for j in range(W):
if i>0:
DP[i][j]=min(DP[i][j],DP[i-1][j]+1) if l[i-1][j] == "." and l[i][j]=="#" else min(DP[i][j],DP[i-1][j])
if j>0:
DP[i][j]=min(DP[i][j],DP[i][j-1]+1) if l[i][j-1] == "." and l[i][j]=="#" else min(DP[i][j],DP[i][j-1])
print(DP[H-1][W-1]) | 1 | 49,251,751,562,578 | null | 194 | 194 |
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n,m,k=sep()
a=lis()
b=lis()
from bisect import bisect_right
a_c=[a[0]]
b_c=[b[0]]
for i in range(1,n):
a_c.append(a_c[-1]+ a[i])
for i in range(1,m):
b_c.append(b_c[-1] + b[i])
m=-1
m=max(m,bisect_right(b_c,k))
for i in range(n):
if a_c[i]<=k:
t=k-a_c[i]
t2=bisect_right(b_c,t)
m=max(i+1+t2,m)
else:
break
print(max(0,m))
| import bisect
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
time = 0
cnt = 0
C = []
SA =[0]
SB =[0]
for a in A:
SA.append(SA[-1] + a)
for b in B:
SB.append(SB[-1] + b)
for x in range(N+1):
L = K - SA[x]
if L < 0:
break
y_max = bisect.bisect_right(SB, L) - 1
C.append(y_max + x)
print(max(C)) | 1 | 10,805,521,666,782 | null | 117 | 117 |
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
n,p = map(int,ipt().split())
s = input()
ans = 0
if p == 2:
for i in range(n):
if int(s[i])%2 == 0:
ans += i+1
print(ans)
elif p == 5:
for i in range(n):
if int(s[i])%5 == 0:
ans += i+1
print(ans)
else:
d = defaultdict(int)
pi = 0
nk = 10%p
for i in s[::-1]:
pi = (pi+int(i)*nk)%p
d[pi] += 1
nk = (nk*10)%p
for i in d.values():
ans += i*(i-1)//2
ans += d[0]
print(ans)
return
if __name__ == '__main__':
main()
| N=int(input())
print(sum((N-1)//a for a in range(1,N+1)))
| 0 | null | 30,314,340,220,538 | 205 | 73 |
def merge(A,left,mid,right):
L=A[left:mid]+[10**9]
R=A[mid:right]+[10**9]
i = 0
j = 0
c = 0
for k in range(left,right):
c += 1
if L[i] <= R[j]:
A[k] = L[i]
i+=1
else:
A[k] = R[j]
j+=1
return c
def merge_sort(A,left,right):
if left+1 < right:
mid = (left+right) // 2
cL=merge_sort(A,left,mid)
cR=merge_sort(A,mid,right)
return(merge(A,left,mid,right) + cL + cR)
return 0
c=0
n = int(input())
A = [int(i) for i in input().split()]
c=merge_sort(A,0,n)
print(*A)
print(c)
| count=0
def mg(S,left,right,mid):
global count
L=[]
L=S[left:mid]
L.append(9999999999)
R=[]
R=S[mid:right]
R.append(9999999999)
r=0
l=0
for i in range(left,right):
count=count+1
if L[l]<=R[r]:
S[i]=L[l]
l=l+1
else:
S[i]=R[r]
r=r+1
def ms(S,left,right):
if right>left+1:
mid=(right+left)//2
ms(S,left,mid)
ms(S,mid,right)
mg(S,left,right,mid)
n=int(input())
S=[]
S=input().split()
S=[int(u) for u in S]
ms(S,0,n)
for i in range(0,n-1):
print(S[i],end=" ")
print(S[n-1])
print(count)
| 1 | 114,375,855,440 | null | 26 | 26 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
d1_0, d2_0 = -1, -2
d1_1, d2_1 = -1, -2
d1_2, d2_2 = -1, -2
for i in range(n):
d1_2, d2_2 = d1_1, d2_1
d1_1, d2_1 = d1_0, d2_0
d1_0, d2_0 = map(int,input().split())
if d1_0 == d2_0 and d1_1 == d2_1 and d1_2 == d2_2:
print("Yes")
sys.exit()
print("No")
if __name__=='__main__':
main() | def main():
N = int(input())
cnt = 0
for _ in range(N):
d1, d2 = map(int, input().split())
if d1 == d2:
cnt += 1
else:
cnt = 0
if cnt >= 3:
print("Yes")
return
print("No")
if __name__ == "__main__":
main()
| 1 | 2,493,721,876,220 | null | 72 | 72 |
num = list(map(int,input()))
if num[-1] == 3:
print("bon")
elif num[-1] in (0, 1, 6, 8):
print("pon")
else:
print("hon")
| N=int(input())
if N%10==2 or N%10==4 or N%10==5 or N%10==7 or N%10==9:
print("hon")
elif N%10==0 or N%10==1 or N%10==6 or N%10==8:
print("pon")
else:
print("bon") | 1 | 19,305,486,932,728 | null | 142 | 142 |
a, b = input().split()
a = int(a)
b = round(100*float(b))
ans = a*b
print(int(ans//100)) | a =[]
for i in range(3):
a .append(list(map(int, input().split())))
n = int(input())
b =[]
for i in range(n):
b.append(int(input()))
flag = 0
cnt = 0
# yoko
for i in range(3):
for j in range(3):
if a[i][j] in b:
cnt += 1
else:
if cnt == 3:
print("Yes")
flag += 1
exit()
else:
cnt = 0
# tate
if flag == 0:
for i in range(3):
for j in range(3):
if a[j][i] in b:
cnt += 1
else:
if cnt == 3:
print("Yes")
flag += 1
exit()
else:
cnt = 0
# ななめ1
if flag == 0:
for i in range(3):
if a[i][i] in b:
cnt += 1
else:
if cnt == 3:
print("Yes")
flag += 1
exit()
else:
cnt = 0
# ななめ2
if flag == 0:
if a[2][0] in b:
if a[1][1] in b:
if a[0][2] in b:
print("Yes")
flag += 1
if flag == 0:
print("No")
| 0 | null | 38,186,468,437,130 | 135 | 207 |
import math
A, B, C, D = map(int, input().split())
#何ターンで倒せるかを比較、ターン数が小さい方が強い。ターン数が同じなら高橋が勝ち。
if math.ceil(C / B) <= math.ceil(A / D):
print("Yes")
else:
print("No") | import math
A,B,C,D = list(map(int,input().split()))
if (math.ceil(C/B)-math.ceil(A/D))<1:
print("Yes")
else:
print("No")
| 1 | 29,699,695,857,062 | null | 164 | 164 |
n = int(input())
h = [[] for _ in range(n)]
u = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
h[i].append(x)
elif y == 0:
u[i].append(x)
ans = 0
for i in range(2**n):
hs, us = set(), set()
honest, unkind = set(), set()
for j in range(n):
if i & (1 << j):
hs |= set(h[j])
us |= set(u[j])
honest.add(j+1)
else:
unkind.add(j+1)
if not hs <= honest:
continue
if not us <= unkind:
continue
ans = max(ans, len(honest))
print(ans) | from itertools import product
n = int(input())
a = [[] for i in range(n)]
for i in range(n):
c = int(input())
for j in range(c):
x, y = map(int, input().split())
x-=1
a[i].append([x, y])
ans = 0
for c in product([1, 0], repeat=n):
f = True
for i, p in enumerate(c):
if p == 1:
for x, y in a[i]:
if c[x] != y:
f = False
break
if not f:
break
if f:
ans = max(ans, sum(c))
print(ans)
| 1 | 121,508,392,850,208 | null | 262 | 262 |
import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare_simple(n, mod=pow(10, 9) + 7):
# n! の計算
f = 1
for m in range(1, n + 1):
f *= m
f %= mod
fn = f
# n!^-1 の計算
inv = pow(f, mod - 2, mod)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= mod
invs[m - 1] = inv
return fn, invs
def prepare(n, mod=pow(10, 9) + 7):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
# n!^-1 の計算
inv = pow(f, mod - 2, mod)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= mod
invs[m - 1] = inv
return factorials, invs
# 実装を行う関数
def resolve(test_def_name=""):
x, y = map(int, input().split())
all_move_count = (x + y) // 3
x_move_count = all_move_count
y_move_count = 0
x_now = all_move_count * 2
y_now = all_move_count
canMake= False
for i in range(all_move_count+1):
if x_now == x and y_now == y:
canMake = True
break
x_move_count -= 1
y_move_count += 1
x_now -= 1
y_now += 1
if not canMake:
print(0)
return
fns, invs = prepare(all_move_count)
ans = (fns[all_move_count] * invs[x_move_count] * invs[all_move_count - x_move_count]) % (pow(10, 9) + 7)
print(ans)
# fn, invs = prepareSimple(10)
# ans = (fn * invs[3] * invs[10 - 3]) % (pow(10, 9) + 7)
# print(ans)
# テストクラス
class TestClass(unittest.TestCase):
def assertIO(self, assert_input, output):
stdout, sat_in = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
resolve(sys._getframe().f_back.f_code.co_name)
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, sat_in
self.assertEqual(out, output)
def test_input_1(self):
test_input = """3 3"""
output = """2"""
self.assertIO(test_input, output)
def test_input_2(self):
test_input = """2 2"""
output = """0"""
self.assertIO(test_input, output)
def test_input_3(self):
test_input = """999999 999999"""
output = """151840682"""
self.assertIO(test_input, output)
# 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
def tes_t_1original_1(self):
test_input = """データ"""
output = """データ"""
self.assertIO(test_input, output)
# 実装orテストの呼び出し
if __name__ == "__main__":
if os.environ.get("USERNAME") is None:
# AtCoder提出時の場合
resolve()
else:
# 自PCの場合
unittest.main()
| import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
s = input()
ans, i, j = 0, 0, 0
while i < len(s):
if s[i] == '<':
j = 0
while i<len(s) and s[i] == '<':
ans += j
j += 1
i += 1
else:
k = 1
while i<len(s) and s[i] == '>':
ans += k
k += 1
i += 1
if j > k - 1:
ans = ans - (k - 1) + j
if s[-1] == '<':
ans += j
print(ans)
if __name__ == '__main__':
main() | 0 | null | 153,475,522,593,890 | 281 | 285 |
n = int(input())
a = 100
time = 0
while a < n:
a += a // 100
time += 1
print(time) | i = 0
while True:
t = int(input())
if t == 0:
break
else:
i += 1
print('Case '+str(i)+': '+str(t)) | 0 | null | 13,744,410,360,060 | 159 | 42 |
import sys
n = int(input())
dic = {}
input_ = [x.split() for x in sys.stdin.readlines()]
for c, s in input_:
if c == 'insert':
dic[s] = 0
else:
if s in dic:
print('yes')
else:
print('no') |
N = int(input())
def func(x):
if len(x) == N:
print("".join(x))
return
last = ord(max(x)) - ord("a") + 1 if x else 0
for i in range(min(26, last) + 1):
x.append(chr(ord("a") + i))
func(x)
x.pop()
func([])
| 0 | null | 26,052,922,201,040 | 23 | 198 |
#!/usr/bin/env python
# coding: utf-8
def gcd ( ax, ay):
x = ax
y = ay
while (True):
if x < y :
tmp = x
x = y
y = tmp
x=x %y
if x == 0:
return y
elif x == 1:
return 1
x,y = map(int, input().split())
print(gcd(x,y))
| A,B=list(map(int,input().split()))
def gcd(A, B):
if B==0: return(A)
else: return(gcd(B, A%B))
print(gcd(A,B)) | 1 | 6,824,582,050 | null | 11 | 11 |
n = int(input())
l = list(map(int,input().split()))
mod = 10**9+7
ones = [0]*60
ans = 0
for i in range(n):
x = l[i]
for j in range(60):
ones[j] += (x>>j)&1
ans = (ans + (n-1)*x)%mod
# print(ans)
for i in range(60):
ans = (ans - ones[i]*(ones[i]-1)*2**i)%mod
print(ans) | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def resolve():
readline=sys.stdin.readline
mod=10**9+7
n=int(readline())
arr=list(map(int, readline().rstrip().split()))
ans = 0
x = 1
for i in range(60):
c = 0
for j in range(n):
if arr[j]&x != 0:
c += 1
ans += (c * (n-c)) * x
ans %= mod
x = x*2
print(ans)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ---------------- | 1 | 122,400,515,641,728 | null | 263 | 263 |
S = int(raw_input())
h = S / 3600
m = S - 3600*h
s = m % 60
m = (m - s)/60
print str(h) + ":" + str(m) + ":" + str(s) | a = int(raw_input())
h = a / 3600
m = (a % 3600) / 60
s = a % 60
print "{0}:{1}:{2}".format(h, m, s) | 1 | 323,846,384,752 | null | 37 | 37 |
import collections
a = collections.deque()
for i in range(int(input())):
b = input()
# 命令がinsertだった場合、
if b[0] == 'i':
# キーxを先頭に追加(数字は文字列bの7文字目以降にある)
a.appendleft(b[7:])
# 命令がdeleteだった場合
elif b[6] == ' ':
# 命令のキーが含まれる場合そのキーのデータを消すが、なければ何もしない
try:
a.remove(b[7:])
except:
pass
# 命令がdeleteFirstだった場合
elif len(b) > 10:
a.popleft()
# 命令がdeleteLastだった場合
elif len(b) > 6:
a.pop()
print(*a)
| n = int(input())
a=list(map(int,input().split()))
kane=1000
kabu =0
for i in range(n-1):
if a[i]<=a[i+1]:
kabu+=kane//a[i]
kane=kane%a[i]
else:
kane+=kabu*a[i]
kabu=0
print(kane+kabu*a[n-1]) | 0 | null | 3,684,842,700,516 | 20 | 103 |
n, m = map(int, input().split())
if n % 2 == 1:
a = [i for i in range(1, m+1)]
b = [i for i in reversed(range(m+1, 2*m+1))]
ab = [(x, y) for x, y in zip(a, b)]
else:
ab = []
x, y = (n-1)//2, n//2
if x % 2 != 0:
x, y = y, x
evenl = 1
evenr = x
while evenl < evenr:
ab.append((evenl, evenr))
evenl += 1
evenr -= 1
oddl = x+1
oddr = n-1
while oddl < oddr:
ab.append((oddl, oddr))
oddl += 1
oddr -= 1
ab = ab[:m]
for a, b in ab:
print(a, b) | def select_sort(array):
N = len(array)
count = 0
for i in range(N - 1):
min_i = i + array[i:].index(min(array[i:]))
if i != min_i:
count += 1
array[i], array[min_i] = array[min_i], array[i]
return array, count
n = int(input())
array = [int(i) for i in input().split()]
result = select_sort(array)
print(*result[0])
print(result[1]) | 0 | null | 14,360,826,411,492 | 162 | 15 |
n=int(input())
a=[]
b=[0]*n
t_sum=0
for i in range(n):
s,t=input().split()
tt=int(t)
t_sum+=tt
a.append(s)
b[i]=t_sum
x=input()
print(t_sum-b[a.index(x)]) | H,W = map(int, input().split())
L = []
while H != 0 or W != 0:
L.append([H, W])
H,W = map(int, input().split())
def draw(H,W):
if W == 1:
for i in range(H // 2):
print("#")
print(".")
if H % 2 == 1:
print("#")
print("")
elif W % 2 == 1:
for i in range(H // 2):
print("#." * (W // 2) +"#")
print(".#" * (W // 2) + ".")
if H % 2 == 1:
print("#." * (W // 2) +"#")
print("")
else:
for i in range(H // 2):
print("#." * (W // 2))
print(".#" * (W // 2))
if H % 2 == 1:
print("#." * (W // 2))
print("")
for (H, W) in L:
draw(H,W) | 0 | null | 48,774,506,412,910 | 243 | 51 |
def f(A,B,x):
val=((A*x)//B)-A*(x//B)
return val
A,B,n=map(int,input().split())
print(f(A,B,B-1)) if n>=B-1 else print(f(A,B,n)) | A, B, N = map(int, input().split())
if N//B == 0:
ans_i = N
else :
ans_i = B*(N//B)-1
print((A*ans_i)//B - A*(ans_i//B))
| 1 | 27,982,847,713,076 | null | 161 | 161 |
a = list(map(int, input().split()))
for i in range(1,len(a)):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v:
a[j+1] = a[j]
j -= 1
a[j+1] = v
print("{} {} {}".format(a[0],a[1],a[2]))
| #! /usr/bin/env python
# -*- coding: utf-8 -*-
raw_list = sorted(map(int, raw_input().split()))
print("%d %d %d") % (raw_list[0], raw_list[1], raw_list[2]) | 1 | 417,374,291,906 | null | 40 | 40 |
n,k=map(int, input().split())
a = list(map(int, input().split()))
mod=10**9+7
if n==k:
ans=1
for i in range(k):
ans*=a[i]
ans%=mod
print(ans)
exit()
minus=[i for i in a if i<0]
plus=[i for i in a if i>=0]
from collections import deque
minus=deque(sorted(minus))
plus=deque(sorted(plus,reverse=True))
n_minus=len(minus)
n_plus=len(plus)
if n_minus==n:
ans=1
if k%2==0:
for i in range(k):
ans*=minus.popleft()
ans+=mod
ans%=mod
print(ans)
exit()
else:
for i in range(k):
ans*=minus.pop()
ans+=mod
ans%=mod
print(ans)
exit()
cnt_minus=0
cand=deque([])
for i in range(k):
if not plus or ((plus and minus) and abs(minus[0])>abs(plus[0])):
cand.append(minus.popleft())
cnt_minus+=1
elif not minus or ((plus and minus) and abs(minus[0])<abs(plus[0])):
cand.append(plus.popleft())
else:
if cnt_minus%2==1:
cand.append(minus.popleft())
cnt_minus+=1
else:
cand.append(plus.popleft())
if cnt_minus%2==0:
ans=1
for i in range(k):
ans*=cand[i]
ans+=mod
ans%=mod
print(ans)
exit()
if 0 in cand:
print(0)
exit()
tmpm,tmpp=None,None
for i in range(k-1,-1,-1):
if cand[i]<0 and tmpm==None:
tmpm=cand[i]
elif cand[i]>=0 and tmpp==None:
tmpp=cand[i]
#print(tmpm,tmpp)
cand1,cand2=None,None
if tmpm!=None and plus:
cand1=plus[0]/abs(tmpm)
if tmpp!=None and minus:
if tmpp!=0:
cand2=abs(minus[0])/abs(tmpp)
else:
cand2=0
if tmpp==0:
if minus:
ans=1
flg=True
for i in range(k):
if flg and cand[i]==tmpp:
flg=False
continue
ans*=cand[i]
ans+=mod
ans%=mod
print((ans*minus[0])%mod)
exit()
elif (cand1!=None and cand2==None) or ((cand1!=None and cand2!=None) and plus[0]*abs(tmpp)>=abs(minus[0]*tmpm)):
ans=1
flg=True
for i in range(k):
if flg and cand[i]==tmpm:
flg=False
continue
ans*=cand[i]
ans+=mod
ans%=mod
print((ans*plus[0])%mod)
exit()
elif (cand1==None and cand2!=None) or ((cand1!=None and cand2!=None) and plus[0]*abs(tmpp)<abs(minus[0]*tmpm)):
ans=1
flg=True
for i in range(k):
if flg and cand[i]==tmpp:
flg=False
continue
ans*=cand[i]
ans+=mod
ans%=mod
print((ans*minus[0])%mod)
exit() | import sys
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
MOD=10**9+7
plus=[]
minus=[]
zero=[]
for i in range(n):
if a[i]>0:
plus.append(a[i])
if a[i]<0:
minus.append(a[i])
if a[i]==0:
zero.append(a[i])
if k==n:
ans=1
for i in range(k):
ans=(ans*a[i])%MOD
print(ans)
sys.exit()
if len(plus)==0:
if k%2!=0:
a.reverse()
ans=1
for i in range(k):
ans=(ans*a[i])%MOD
print(ans)
sys.exit()
if len(plus)+len(minus)<k:
print(0)
sys.exit()
m=len(minus)
minus.sort()
plus.reverse()
plpointer=k
if k>len(plus):
plpointer=2*(len(plus)//2)
if k%2==1:
if plpointer+1<=len(plus):
plpointer+=1
else:
plpointer-=1
mnpointer=k-plpointer
while mnpointer<m-1 and plpointer>=2 and minus[mnpointer]*minus[mnpointer+1]>plus[plpointer-1]*plus[plpointer-2]:
mnpointer+=2
plpointer-=2
ans=1
for i in range(mnpointer):
ans=(ans*minus[i])%MOD
for i in range(plpointer):
ans=(ans*plus[i])%MOD
print(ans)
| 1 | 9,428,351,970,140 | null | 112 | 112 |
N = input()
if (N[-1] == str(3)):
print('bon')
elif(int(N[-1]) == 0 or int(N[-1]) == 1 or int(N[-1]) == 6 or int(N[-1]) == 8 ):
print('pon')
else:
print('hon') | A = input()
if A == "ABC":
print("ARC")
else:
print("ABC") | 0 | null | 21,850,207,637,258 | 142 | 153 |
n=int(input())
if n%2:
a=list(map(int,input().split()))
s=[[a[0],0,0],[0,a[1],0],[a[0]+a[2],0,a[2]]]+[[0,0,0]for i in range(3,n)]
for i in range(3,n):
if i%2:
s[i][1]=max(s[i-2][1],s[i-3][0])+a[i]
else:
s[i][0]=s[i-2][0]+a[i]
s[i][2]=max([s[i-2][2],s[i-3][1],s[i-4][0]])+a[i]
print(max([s[-1][2],s[-2][1],s[-3][0]]))
else:
a=list(map(int,input().split()))
s=[a[0],a[1]]+[0 for i in range(2,n)]
for i in range(2,n):
if i%2:
s[i]=max([s[i-2],s[i-3]])+a[i]
else:
s[i]=s[i-2]+a[i]
print(max(s[-2:])) | from collections import defaultdict
n=int(input())
a=[int(i) for i in input().split()]
INF=float('inf')
dp0=defaultdict(lambda: -INF)
dp1=defaultdict(lambda: -INF)
dp0[(0,0)]=0
for i in range(1,n+1):
for j in range(i//2-1,(i+1)//2+1):
dp0[(i,j)]=max(dp0[(i-1,j)],dp1[(i-1,j)])
dp1[(i,j)]=dp0[(i-1,j-1)]+a[i-1]
print(max(dp0[(n,n//2)],dp1[(n,n//2)])) | 1 | 37,227,802,354,428 | null | 177 | 177 |
# ??¬????????±
room = [[[0 for a in range(10)] for b in range(3)] for c in range(4)]
n = int(input())
for cnt0 in range(n):
# ?????°??????????????????
a,b,c,d = map(int,input().split())
room[a-1][b-1][c-1]+=d
# ???????????±??????
for cnt1 in range(4):
for cnt2 in range(3):
for cnt3 in range(10):
# OutputPrit
print(" "+str(room[cnt1][cnt2][cnt3]),end="")
# ??????
print ()
if cnt1<3:
# ????£???????####################(20??????#)?????????
print("#"*20) | bilding = [[[0 for x in range(10)] for x in range(3)]for x in range(4)]
n = int(input())
for k in range(n):
b, f, r, v = map(int, raw_input().split())
bilding[b-1][f-1][r-1] += v
for b in range(4):
for f in range(3):
print(" "+" ".join(map(str, bilding[b][f])))
if b < 3:
print("#"*20) | 1 | 1,110,670,754,362 | null | 55 | 55 |
LARGE = 10 ** 9 + 7
def solve(n, k):
# singular cases
if k == 0:
return 1
elif k == 1:
return n * (n - 1)
# pow
pow_mod = [1] * (n + 1)
for i in range(n):
pow_mod[i + 1] = pow_mod[i] * (i + 1) % LARGE
pow_mod_inv = [1] * (n + 1)
pow_mod_inv[-1] = pow(pow_mod[-1], LARGE - 2, LARGE)
for i in range(n - 1, 0, -1):
pow_mod_inv[i] = pow_mod_inv[i + 1] * (i + 1) % LARGE
res = 0
for i in range(min(k, n - 1) + 1):
# find where to set 0
pick_zeros = pow_mod[n] * pow_mod_inv[i] * pow_mod_inv[n - i] % LARGE
# how to assign ones
assign_ones = pow_mod[n - 1] * pow_mod_inv[i] * pow_mod_inv[n - 1 - i] % LARGE
res += pick_zeros * assign_ones
res %= LARGE
return res
def main():
n, k = map(int, input().split())
res = solve(n, k)
print(res)
def test():
assert solve(3, 2) == 10
assert solve(200000, 1000000000) == 607923868
assert solve(15, 6) == 22583772
if __name__ == "__main__":
test()
main()
| n,m=map(int,input().split())
if n%2==1:
[print(i+1,n-i) for i in range(m)]
else:
[print(i+1,n-i) if i<m/2 else print(i+1,n-i-1) for i in range(m)]
| 0 | null | 47,675,808,618,830 | 215 | 162 |
n,k = map(int,input().split())
mod = 10**9+7
ans = 0
for i in range(k,n+2):
ans += n*i - i*(i-1) + 1
ans %= mod
print(ans) | N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [tuple(map(int,input().split())) for i in range(M)]
ans=0
es = [[] for _ in range(N)]
for a,b in AB:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
for i in range(N):
for j in es[i]:
if H[j]>=H[i]:
break
else:
ans+=1
print(ans) | 0 | null | 29,166,615,757,500 | 170 | 155 |
def resolve():
N, K = list(map(int, input().split()))
ans = 0
mini = sum(range(K))
maxi = sum(range(N, N-K, -1))
for i in range(K, N+2):
ans += maxi - mini + 1
ans %= 10**9+7
mini += i
maxi += N - i
print(ans)
if '__main__' == __name__:
resolve()
| ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
MOD = 10**9+7
ans = 0
for kk in range(k,n+2):
# print()
aa = (n-kk+n+1)*kk//2
bb = (0+kk-1)*kk//2
# print(aa)
# print(bb)
a=aa-bb
# print(a)
ans+=a+1%MOD
print(ans%MOD) | 1 | 33,016,663,473,150 | null | 170 | 170 |
n,k = map(int,input().split())
# Function of Combination mod M
# set n >= max p expected
M = 10**9+7
if k >= n-1:
fac = [1]+[0]*(2*n-1)
for i in range(1,2*n): fac[i] = fac[i-1]*i %M
comb = lambda p,q:(fac[p]*pow(fac[q],M-2,M)*pow(fac[p-q],M-2,M))%M
y = comb(2*n-1,n-1)
else:
y = 1
c1,c2=1,1
for i in range(1,k+1):
p = pow(i,M-2,M)
c1 = c1*(n+1-i)*p%M
c2 = c2*(n-i)*p%M
y += c1*c2%M
# y = (y+c1*c2)%M
print(y%M)
| N,K=map(int, input().split())
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
n= 2*10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
#0の数
zeros=min(K, N-1)
ans=1
for i in range(1,zeros+1):
ans+=(cmb(N,i,p)*cmb(i+N-i-1, i, p))%p
#print(pow(N-i, i, p))
ans%=p
print(ans) | 1 | 67,153,202,320,850 | null | 215 | 215 |
import sys
N = int(input())
if not ( 1 <= N <= 100 ):sys.exit()
print(1-(int(N/2)/N)) | N, K = map(int, input().split())
As = list(map(int, input().split()))
for i in range(K):
if min(As) == N:
break
dBs = [0]*(N+1)
for i in range(N):
A = As[i]
dBs[max(0, i-A)] += 1
dBs[min(N, i+A+1)] -= 1
#print(dBs)
Bs = [dBs[0]]
for i in range(1, N):
B = Bs[i-1]+dBs[i]
Bs.append(B)
As = Bs
print(" ".join(map(str, As)))
| 0 | null | 96,269,663,672,142 | 297 | 132 |
from sys import stdin
X = int(stdin.readline().rstrip())
print(10-X//200) | """AtCoder."""
n = int(input()[-1])
s = None
if n in (2, 4, 5, 7, 9):
s = 'hon'
elif n in (0, 1, 6, 8):
s = 'pon'
elif n in (3,):
s = 'bon'
print(s)
| 0 | null | 12,896,719,922,502 | 100 | 142 |
def main():
a, b, c = map(int, input().split())
if(a+b+c >= 22):
print('bust')
else:
print('win')
return 0
if __name__ == '__main__':
main() | x, y, z = map(int, input().split())
if x + y + z <= 21:
print("win")
else:
print("bust")
| 1 | 118,665,538,380,228 | null | 260 | 260 |
k = int(input())
acl = "ACL"
print(acl*k) | k, n = map(int,input().split())
a = list(map(int,input().split()))
n_1 = k - a[-1] + a[0]
l = [] # 各家間の距離リスト（i=1,2～）
for i in range(n-1):
l.append(a[i+1]-a[i])
l.append(n_1)
print(k-max(l)) | 0 | null | 22,675,828,366,250 | 69 | 186 |
from collections import deque
n = int(input())
graph_W = []
for _ in range(n):
graph_W.append(list(map(int, input().split())))
num_root = [0]*n
work_queue = deque([])
visited = set()
work_queue.append(1)
visited.add(1)
cnt = 0
while work_queue:
here = work_queue.popleft() - 1
num_node = graph_W[here][1]
cnt += 1
if num_node == 0:
continue
for k in range(num_node):
num_graph = graph_W[here][k+2]
if num_graph not in visited:
work_queue.append(num_graph)
visited.add(num_graph)
num_root[num_graph-1] = num_root[here] + 1
print(1,0)
for i in range(1,n):
if num_root[i] != 0:
print(i+1,num_root[i])
else:
print(i+1,-1)
| from collections import deque
n = int(input())
adj = [ [] for _ in range(n+1) ]
for _ in range(n):
lst = list(map(int,input().split()))
if lst[1] > 0:
adj[lst[0]] = lst[2:]
q = deque([1])
dist = [-1] * (n+1)
dist[1] = 0
q = deque([1])
while q:
node = q.popleft()
for nei in adj[node]:
if dist[nei] != -1: continue
dist[nei] = dist[node] + 1
q.append(nei)
for i,s in enumerate(dist):
if i==0: continue
print(i, s)
| 1 | 3,955,242,940 | null | 9 | 9 |
N, K = map(int, input().split())
cad = N // K
n = N - K * cad
m = K * (cad + 1) - N
print(min(n, m)) | n,k = map(int,input().split())
a = n%k
b = k-a
print(min(a,b))
| 1 | 39,501,915,874,108 | null | 180 | 180 |
a = int(input())
ans = a + (a ** 2) + (a ** 3)
print(ans)
| a = int(input())
print("{}".format(a+a**2+a**3)) | 1 | 10,220,474,625,882 | null | 115 | 115 |
N = int(input())
num = set()
for n in range(2, 10**7):
if N % n == 0:
num.add(tuple(sorted([n, N//n])))
if N == n:
break
ans = (10**12, 10**12)
if not num:
print(N - 1)
else:
for s in num:
if s[0]+s[1] < ans[0]+ans[1]:
ans = s
print(ans[0] + ans[1] - 2) | X=int(input())
ans=1000*(X//500)+5*((X-(X//500*500))//5)
print(ans) | 0 | null | 102,383,126,809,998 | 288 | 185 |
def mpow(a,b,m):
ans=1
while b >0 :
if b&1:
ans = (ans*a)%m
a=(a*a)%m
b=b>>1
return ans
def calcmod(X,m,N):
mod=0
X=X[::-1]
# print(X)
for i in range(N):
if X[i] == '1':
# if X & (1<<i) >0:
mod += mpow(2,i,m)
mod%=m
return mod
def popcount(m):
return bin(m).count("1")
def findsteps(mm):
cnt=0
while mm !=0:
cnt+=1
mm=mm%popcount(mm)
return cnt
N=int(input())
x=input()
X=int(x,2)
##we need to find X%(m-1) and X%(m+1)
m=popcount(X)
m1=m+1
m2=m-1
firstmod=calcmod(x,m1,N)
if m2 !=0:
secondmod=calcmod(x,m2,N)
fans=[0 for i in range(N)]
k=0
for i in range(N-1,-1,-1):
if X & (1<<i) >0:
##the bit was set
##we need to find X%(m-1) - (2^i)%(m-1)
if m2 == 0:
ans=0
else:
mm=secondmod - mpow(2,i,m2)
if mm < 0:
mm+=m2
mm=mm%m2
ans=1+findsteps(mm)
else:
mm = firstmod + mpow(2,i,m1)
mm=mm%m1
ans=1+findsteps(mm)
fans[k] = ans
k+=1
##the bit was not set
for i in fans:
print(i) | n,m=map(int,input().split())
lange=[1]*(n+1)
for i in range(1,n+1):
a=i
b=n-a
if lange[a]:lange[b]=0
langes=[]
for i in range(1,n):
if lange[i]:
if len(langes)%2:langes.append(i)
else:langes.append(n-i)
langes.sort(reverse=1)
for i in range(m):print(i+1,i+1+langes[i]) | 0 | null | 18,574,429,540,712 | 107 | 162 |
import math
a, b, x = map(int, input().split())
if a**2 * b <= 2 * x:
h = (a**2 * b - x) / a**2 * 2
theta = h / (a**2 + h**2)**0.5
ans = math.degrees(math.asin(theta))
else:
h = 2 * x / a / b
theta = h / (b**2 + h**2)**0.5
ans = math.degrees(math.acos(theta))
print(ans) | import math
a,b,x = map(int, input().split())
x /= a
if 2* x > a * b:
temp = 2*(a*b - x)/(a**2)
else:
temp = b**2/(2*x)
print(math.degrees(math.atan(temp))) | 1 | 162,889,130,415,352 | null | 289 | 289 |
K = int(input())
string = 'ACL'
for i in range(K - 1):
string = string + 'ACL'
print(string)
| from collections import Counter
N = int(input())
D = list(map(int, input().split()))
MOD = 998244353
c = Counter(D)
tmp = 1
ans = 1
zero_flg = False
for dist in range(N):
if dist == 0 and (c[0] != 1 or D[0] != 0):
print(0)
exit()
elif c[dist] == 0:
zero_flg = True
elif c[dist] > 0 and zero_flg:
print(0)
exit()
else:
ans *= pow(tmp, c[dist], MOD)
ans %= MOD
tmp = c[dist]
print(ans) | 0 | null | 78,580,935,174,592 | 69 | 284 |
a,b,c,d = map(int, input().split())
x1=a*c
x2=a*d
x3=b*c
x4=b*d
print(max(x1,x2,x3,x4))
| a,b,c,d=list(map(int, input("").split()))
la=[]
lb=[]
if a<0 and b>0:
la.append(0)
la.append(a)
la.append(b)
if c<0 and d>0:
lb.append(0)
lb.append(c)
lb.append(d)
m=a*c
for i in la:
for j in lb:
o=i*j
if o>m:
m=o
print(m) | 1 | 3,017,647,242,050 | null | 77 | 77 |
t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
a = a1 - b1
b = a2 - b2
if a < 0:
a = -a
b = -b
p = t1 * a + t2 * b
if p > 0:
print(0)
exit()
if p == 0:
print('infinity')
exit()
top = a * t1
p = -p
ans = (top // p + 1) * 2 - 1 - (top % p == 0)
print(ans) | import sys
T1, T2 = map(int,input().split())
A1, A2 = map(int,input().split())
B1, B2 = map(int,input().split())
if A1 < B1:
A1, B1 = B1, A1
A2, B2 = B2, A2
if A1 * T1 + A2 * T2 > B1 * T1 + B2 * T2:
print(0)
sys.exit()
if A1 * T1 + A2 * T2 == B1 * T1 + B2 * T2:
print('infinity')
sys.exit()
N = (T1 * (A1 - B1) - 1) // (T1 * (B1 - A1) + T2 * (B2 - A2)) + 1
ans = N * 2 - 1
if N * (T1 * (B1 - A1) + T2 * (B2 - A2)) == T1 * (A1 - B1):
ans += 1
print(ans) | 1 | 131,888,345,523,804 | null | 269 | 269 |
N, A, B = map(int, input().split())
# 周期
# 青 A個, 赤 B個
ans = N // (A + B) * A
n = N % (A + B)
if A <= n:
ans += A
else:
ans += n
print(ans) | a=int(input())
if a%2==0:
print(1/2)
else:
print(((a+1)/2)/a) | 0 | null | 116,597,686,863,680 | 202 | 297 |
while True:
H, W = list(map(int, input().split()))
if H == 0 and W == 0:
break
else:
for i in range(H):
if i == 0 or i == (H-1):
print('#'*W)
else:
print('#'+'.'*(W-2)+'#')
print() | import copy
N = int(input())
A = list(map(int, input().split()))
A_sum = 0
A2 = []
idx = dict()
for i in A:
if i in idx:
idx[i] += 1
else:
idx[i] = 1
for key in idx:
if idx[key] == 1:
idx[key] = [idx[key], 0]
else:
temp = int(idx[key] * (idx[key] - 1)/2)
A_sum += temp
temp = temp - int(temp * (idx[key] - 2) / idx[key])
idx[key] = [idx[key], temp]
for i in range(N):
key = A[i]
print(A_sum - idx[key][1])
| 0 | null | 24,231,779,663,872 | 50 | 192 |
from fractions import gcd
N=int(input())
d={}
#l=[]
MOD = 1000000007
nz=0
for _ in range(N):
a,b=map(int,input().split())
if a==0 and b==0:
nz+=1
#p=(0,0)
continue
elif a==0:
p=(0,1)
elif b==0:
p=(1,0)
else:
c=gcd(a,b)
a,b=a//c,b//c
if b > 0:
p=(a,b)
else: # b < 0
p=(-a,-b)
#l.append(p)
if p in d:
d[p]+=1
else:
d[p] = 1
ans=1
#for p in l:
while len(d) > 0:
p,np=d.popitem()
if p==(1,0):
q=(0,1)
elif p==(0,1):
q=(1,0)
else:
pa,pb=p
if pa > 0:
q=(-pb,pa)
else: #pa < 0
q=(pb,-pa)
if q in d:
nq=d.pop(q)
else:
nq=0
ans *= ((2**np + 2**nq - 1) % MOD)
ans %= MOD
ans -= 1
ans += nz
ans %= MOD
print(ans) |
x=input()
l=(x/60)
h=(l/60)
m=(l-h*60)
s=x-m*60-h*60*60
print str(h)+":"+str(m)+":"+str(s) | 0 | null | 10,571,503,285,372 | 146 | 37 |
import math
n = int(input())
def koch(n, p1, p2):
if n == 0:
return
sx = (2*p1['x'] + 1*p2['x'])/3
sy = (2*p1['y'] + 1*p2['y'])/3
tx = (1*p1['x'] + 2*p2['x'])/3
ty = (1*p1['y'] + 2*p2['y'])/3
ux = (tx - sx)*math.cos(math.radians(60)) - (ty - sy)*math.sin(math.radians(60)) + sx
uy = (tx - sx)*math.sin(math.radians(60)) + (ty -sy)*math.cos(math.radians(60)) + sy
s = {'x':sx, 'y':sy}
t = {'x':tx, 'y':ty}
u = {'x':ux, 'y':uy}
koch(n-1,p1,s)
print('{} {}'.format(s['x'],s['y']))
koch(n-1, s, u)
print('{} {}'.format(u['x'],u['y']))
koch(n-1, u, t)
print('{} {}'.format(t['x'],t['y']))
koch(n-1,t,p2)
p1 = {'x':float(0),'y':float(0)}
p2 = {'x':float(100),'y':float(0)}
print('{} {}'.format(p1['x'],p1['y']))
koch(n, p1, p2)
print('{} {}'.format(p2['x'],p2['y']))
| import math
def make_stu(p1, p2):
s = [(2 * p1[0] + p2[0]) / 3, (2 * p1[1] + p2[1]) / 3]
t = [(p1[0] + 2 * p2[0]) / 3, (p1[1] + 2 * p2[1]) / 3]
u = [s[0] + (t[0] - s[0]) / 2 - math.sqrt(3) * (t[1] - s[1]) / 2,
s[1] + (t[1] - s[1]) / 2 + math.sqrt(3) * (t[0] - s[0]) / 2]
return s, t, u
def koch_curve(n, p1, p2):
if n >= 1:
s, t, u = make_stu(p1, p2)
if n == 1:
print(s[0], s[1])
print(u[0], u[1])
print(t[0], t[1])
else:
koch_curve(n - 1, p1, s)
print(s[0], s[1])
koch_curve(n - 1, s, u)
print(u[0], u[1])
koch_curve(n - 1, u, t)
print(t[0], t[1])
koch_curve(n - 1, t, p2)
n = int(input())
print(0.0, 0.0)
koch_curve(n, [0.0, 0.0], [100.0, 0.0])
print(100.0, 0.0)
| 1 | 130,629,863,662 | null | 27 | 27 |
import math
n=int(input())
def koch(d,p1,p2):
if d==0:
return
s=[0,0]
t=[0,0]
u=[0,0]
s[0]=2/3*p1[0]+1/3*p2[0]
s[1]=2/3*p1[1]+1/3*p2[1]
t[0]=1/3*p1[0]+2/3*p2[0]
t[1]=1/3*p1[1]+2/3*p2[1]
u[0]=s[0]+(t[0]-s[0])*math.cos(math.pi/3)-(t[1]-s[1])*math.sin(math.pi/3)
u[1]=s[1]+(t[0]-s[0])*math.sin(math.pi/3)+(t[1]-s[1])*math.cos(math.pi/3)
koch(d-1,p1,s)
print(*s)
koch(d-1,s,u)
print(*u)
koch(d-1,u,t)
print(*t)
koch(d-1,t,p2)
print(0,0)
koch(n,[0,0],[100,0])
print(100,0)
| import math
cos60=math.cos(math.radians(60))
sin60=math.sin(math.radians(60))
def koch(d,p1_x,p2_x,p1_y,p2_y):
if d==0:
return
s_x=(2*p1_x+1*p2_x)/3
s_y=(2*p1_y+1*p2_y)/3
t_x=(1*p1_x+2*p2_x)/3
t_y=(1*p1_y+2*p2_y)/3
u_x=(t_x-s_x)*cos60-(t_y-s_y)*sin60+s_x
u_y=(t_x-s_x)*sin60+(t_y-s_y)*cos60+s_y
koch(d-1,p1_x,s_x,p1_y,s_y)
print(s_x,s_y)
koch(d-1,s_x,u_x,s_y,u_y)
print(u_x,u_y)
koch(d-1,u_x,t_x,u_y,t_y)
print(t_x,t_y)
koch(d-1,t_x,p2_x,t_y,p2_y)
d=int(input())
p1_y=0
p1_x=0
p2_x=100
p2_y=0
print(float(p1_x),float(p1_y))
koch(d,p1_x,p2_x,p1_y,p2_y)
print(float(p2_x),float(p2_y))
| 1 | 129,502,942,842 | null | 27 | 27 |
import sys
while True:
try:
word = input()
if word == "-":
break
word_len = len(word)
words_shuffle = []
for i in range(word_len):
words_shuffle.append(word[i])
n = int(input())
for i in range(n):
h = int(input())
words_shuffle = words_shuffle[h:] + words_shuffle[:h]
for i in range(word_len-1):
print(words_shuffle[i], end="")
print(words_shuffle[-1])
except EOFError:
break | def sumitrust2019_d():
n = int(input())
s = input()
ans = 0
for i in range(1000):
# 確認するpinの数字の組み合わせと桁の初期化
# pin = list(str(i).zfill(3))
current_digit = 0
pin = f'{i:0>3}'
search_num = pin[current_digit]
for num in s:
# 見つけると桁を右に一つずらす
# 毎回リストにアクセスするより変数に取り出しておくほうがいいかも。
# if num == pin[current_digit]:
if num == search_num:
current_digit += 1
# indexが3(桁が3→2→1→0)になったときはそのPINは作れる
if current_digit == 3:
ans += 1
break
# 見つけ終わるまではチェックする数字を置き換え。
elif current_digit < 3:
search_num = pin[current_digit]
print(ans)
if __name__ == '__main__':
sumitrust2019_d() | 0 | null | 65,053,800,604,740 | 66 | 267 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 998244353
def resolve():
n = int(input())
D = list(map(int, input().split()))
tree = [0 for _ in range(max(D) + 1)]
for i in range(n):
idx = D[i]
tree[idx] += 1
if D[0] != 0 or tree[0] != 1 or 0 in tree:
print(0)
exit()
res = 1
for i in range(len(tree) - 1):
res *= pow(tree[i], tree[i + 1], mod)
print(res % mod)
if __name__ == '__main__':
resolve()
| import sys
from collections import Counter
N = int(sys.stdin.readline().rstrip())
D = list(map(int, sys.stdin.readline().rstrip().split()))
mod = 998244353
if D[0] != 0 or 0 in D[1:]:
print(0)
exit()
d_cnt = sorted(Counter(D).items())
ans = 1
par = 1
prev = 0
for k, v in d_cnt:
if k > 0:
if prev + 1 == k:
ans *= pow(par, v, mod)
ans %= mod
par = v
prev = k
else:
print(0)
exit()
print(ans) | 1 | 154,819,156,248,494 | null | 284 | 284 |
S = input()
result = 0
# 入力例1なら3文字目まで
for i in range(len(S) // 2):
# sの1(2番目)がsの最後尾と一緒ならカウント
if S[i] != S[-(i + 1)]:
result += 1
print(result) | n,m=map(int,input().split())
ans=0
ans+=n*(n-1)//2
ans+=m*(m-1)//2
print(ans) | 0 | null | 83,324,577,385,280 | 261 | 189 |
import sys
input = sys.stdin.readline
n=int(input())
dp=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
dp[int(str(i)[0])][int(str(i)[-1])]+=1
#print(dp)
ans = 0
for i in range(10):
for j in range(10):
ans+=dp[i][j]*dp[j][i]
print(ans)
| N = int(input())
c = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
end = i%10
head = int(str(i)[0])
c[head][end] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j]*c[j][i]
print(ans)
| 1 | 86,672,627,223,250 | null | 234 | 234 |
n = int(input())
A = [0]+list(map(int,input().split()))
d = {}
ans = 0
for i in range(1,n+1):
if i+A[i] not in d:
d[i+A[i]] = 1
else:
d[i+A[i]] += 1
if i-A[i] in d:
ans += d[i-A[i]]
print(ans) | def main():
n = input()
hon = ['2', '4', '5', '7', '9']
pon = ['0', '1', '6', '8']
bon = ['3']
if n[len(n)-1] in hon:
print('hon')
elif n[len(n)-1] in pon:
print('pon')
else:
print('bon')
if __name__ == "__main__":
main()
| 0 | null | 22,724,485,919,850 | 157 | 142 |
N = int(input())
ans = ""
while N > 0:
N -= 1
q, r = N//26, N%26
ans += chr(ord("a") + r)
N = q
print(ans[::-1])
| import math
while True:
try:
a = list(map(int,input().split()))
b = (math.gcd(a[0],a[1]))
c = ((a[0]*a[1])//math.gcd(a[0],a[1]))
print(b,c)
except EOFError:
break
| 0 | null | 6,014,899,246,032 | 121 | 5 |
x = int(input())
r = 0
divider = ((500,1000), (5, 5))
for i in divider:
x, remain = divmod(x, i[0])
r += x * i[1]
x = remain
print(r) | X = int(input())
five_hundred = int(X / 500)
five = int((X - five_hundred*500)/5)
print(five_hundred*1000+five*5) | 1 | 42,634,711,465,620 | null | 185 | 185 |
N=int(input())
c=list(input())
R=c.count('R')
L=c[:R].count('R')
print(R-L) | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)
N = ri()
C = rs()
l, r = 0, N-1
ans = 0
while l < r:
while C[l] == 'R' and l < N-1:
l += 1
while C[r] == 'W' and r > 0:
r -= 1
if l >= r: break
l += 1
r -= 1
ans += 1
print(ans) | 1 | 6,252,525,351,552 | null | 98 | 98 |
#
import sys
input=sys.stdin.readline
from collections import deque
def main():
N,M,K=map(int,input().split())
ABadj=[[] for i in range(N)]
CDadj=[set() for i in range(N)]
for i in range(M):
a,b=map(int,input().split())
ABadj[a-1].append(b-1)
ABadj[b-1].append(a-1)
for i in range(K):
c,d=map(int,input().split())
CDadj[c-1].add(d-1)
CDadj[d-1].add(c-1)
w=[-1]*N
sets=[]
j=-1
done=[-1]*N
for i in range(N):
if done[i]==-1:
sets.append(set())
j+=1
qu=deque([i])
done[i]=1
sets[j].add(i)
w[i]=j
while(len(qu)>0):
v=qu.popleft()
for nv in ABadj[v]:
if done[nv]==-1:
done[nv]=1
qu.append(nv)
sets[j].add(nv)
w[nv]=j
for i in range(N):
ans=len(sets[w[i]])-1-len(ABadj[i])
for bl in CDadj[i]:
if bl in sets[w[i]]:
ans-=1
print(ans,end=" ")
if __name__=="__main__":
main()
| from collections import Counter
def solve():
H, W, M = map(int, input().split())
dh, dw = Counter(), Counter()
used = set()
for _ in range(M):
h, w = map(int, input().split())
dh[h] += 1
dw[w] += 1
used.add((h, w))
ih = dh.most_common()
iw = dw.most_common()
h, counth = ih[0]
w, countw = iw[0]
s = counth + countw
ans = counth + countw - ((h, w) in used)
for h, counth in ih:
for w, countw in iw:
if counth+countw < s or ans == s:
break
b = counth + countw - ((h, w) in used)
ans = max(ans, b)
print(ans)
solve() | 0 | null | 33,058,807,253,720 | 209 | 89 |
# 0がX個、1がY個ある(ただしX+Y=N)とき、Xorの組み合わせ自体は N*(N-1)//2 通りある。
# しかし、それらの和をとることを考えてみた時
# (0,0)と(1,1)を選んだ場合はそのXORは0になることに注意すると、(0,1)の組み合わせの個数だけ数えれば良い。
# これは、たとえば 〇〇〇●●●●(X=3,Y=4)から〇と●を選ぶ組み合わせは何個あるか、という問いと同じことなので
# Nの値には依存することはなく、単純にX*Y通りとなる。
# よって
# ΣΣ A_i Xor A_j = X*Y
# この処理によって、O(N^2)が、O(N)(=Aの各数字を一通り調べる)に減らせる。
# これを各ケタについて計算し、合計すれば良い。
# ケタ数が60まで定まっているので 計算量は O(Nlog(max(A)))≦ O(N*60)
# あるケタのbitを取り出すには ビットシフト「>>」でずらして下1ケタだけを見ると便利。
N=int(input())
A=list(map(int,input().split()))
p=10**9+7
ans=0
for k in range(60):
cnt_z=0
cnt_o=0
#print(A)
for i in range(N):
s=A[i]%2
if s==0:
cnt_z +=1
else:
cnt_o +=1
A[i] >>= 1
ans += ((2**k)*cnt_z*cnt_o)%p
print(ans%p) | NM = input().split()
n = int(NM[0])
m = int(NM[1])
A = []
B = []
for i in range(n):
A.append([])
a = input().split()
for j in range(m):
A[i].append(int(a[j]))
for i in range(m):
b = int(input())
B.append(b)
out = []
for i in range(n):
sum = 0
for j in range(m):
sum = sum + A[i][j]*B[j]
out.append(sum)
for i in range(n):
print(out[i]) | 0 | null | 61,729,619,844,550 | 263 | 56 |
n = int(input())
if n%2 == 1:
print (0)
exit()
cnt = 0
for i in range(1,26):
x = pow(5,i)
x *= 2
if x > n:
continue
cnt += n//x
print (cnt) | #!/usr/bin/env python
n = int(input())
if n%2 == 1:
print(0)
exit()
mp = tmp = 0
while True:
if 5**tmp > n:
break
mp = tmp
tmp += 1
ans = 0
for i in range(1, mp+1):
ans += n//(2*(5**i))
print(ans)
| 1 | 115,804,693,827,812 | null | 258 | 258 |
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
for i in range(N):
if i >= K and T[i-K] == T[i]:
T[i] = 'a'
ans = 0
for i in T:
if i == 'r':
ans += P
elif i == 's':
ans += R
elif i == 'p':
ans += S
print(ans) | def solve(T, R, S, P, K):
N = len(T)
Z =[None for i in range(N)]
for i in range(N):
if T[i] == 'r':
Z[i] = P
elif T[i] == 's':
Z[i] = R
else:
Z[i] = S
if i - K >= 0:
if T[i-K] == T[i] and Z[i-K] != 0:
Z[i] = 0
return sum(Z)
N, K = map(int,input().split(' '))
R, S, P = map(int,input().split(' '))
T = str(input())
print(solve(T, R, S, P, K)) | 1 | 106,743,698,361,170 | null | 251 | 251 |
n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [True] * n
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
#print(h[a],h[b])
if h[a] >= h[b]:
l[b] = False
if h[a] <= h[b]:
l[a] = False
#print(l)
print(l.count(True)) | n, k = list(map(int, input().split(" ")))
a_lst = list(map(int, input().split(" ")))
for i in range(k, n):
if a_lst[i] > a_lst[i - k]:
print("Yes")
else:
print("No")
| 0 | null | 16,121,598,906,654 | 155 | 102 |
a = []
for _ in range(3):
a += list(map(int, input().split()))
n = int(input())
for _ in range(n):
b = int(input())
if b in a:
i = a.index(b)
a[i] = 0
if sum(a[0:3]) == 0 or sum(a[3:6]) == 0 or sum(a[6:]) == 0 \
or sum(a[0::3]) == 0 or sum(a[1::3]) == 0 or sum(a[2::3]) == 0 \
or sum(a[0::4]) == 0 or sum(a[2:7:2]) == 0:
print("Yes")
else:
print("No")
| S = int(input())
print (S//3600, (S%3600)//60, S%60, sep = ":")
| 0 | null | 30,258,324,520,800 | 207 | 37 |
# AOJ ITP1_9_B
def main():
while True:
string = input()
if string == "-": break
n = int(input()) # シャッフル回数
for i in range(n):
h = int(input())
front = string[0 : h] # 0番からh-1番まで
back = string[h : len(string)] # h番からlen-1番まで
string = back + front
print(string)
if __name__ == "__main__":
main()
| s = input()
n = len(s)
if n % 2 == 1:
print("No")
exit(0)
for i in range(n):
if i % 2 == 0:
if s[i] != "h":
print("No")
break
elif s[i] != "i":
print("No")
break
else:
print("Yes")
| 0 | null | 27,413,777,172,320 | 66 | 199 |
a,b = map(int,input().split())
lis = list(map(int,input().split()))
c = sum(lis)
print("No" if a > c else "Yes") | import math
h,n = map(int,input().split())
sum = 0
li = list(map(int,input().split()))
for val in li:
sum += val
if sum >= h:
print("Yes")
else:
print("No")
| 1 | 77,857,898,413,970 | null | 226 | 226 |
import sys
input = sys.stdin.readline
def solve_K_1(N):
S = str(N)
d = len(S)
return 9 * (d - 1) + int(S[0])
def solve_K_2(N):
if N <= 99:
return N - solve_K_1(N)
S = str(N)
d = len(S)
res = 0
res += 81 * (d - 1) * (d - 2) // 2
res += 9 * (d - 1) * (int(S[0]) - 1)
x = 0
for i in range(1, d):
if S[i] != "0":
x = int(S[i])
break
i += 1
res += x + 9 * (d - i)
return res
def solve_K_3(N):
if N <= 999:
return N - solve_K_1(N) - solve_K_2(N)
S = str(N)
d = len(S)
res = 0
for n in range(3, d):
res += 729 * (n - 1) * (n - 2) // 2
res += 81 * (d - 1) * (d - 2) // 2 * (int(S[0]) - 1)
res += solve_K_2(int(S[1:]))
return res
def main():
N = int(input())
K = int(input())
if K == 1:
ans = solve_K_1(N)
elif K == 2:
ans = solve_K_2(N)
elif K == 3:
ans = solve_K_3(N)
print(ans)
if __name__ == "__main__":
main()
| import sys
from functools import lru_cache
N = int(sys.stdin.readline().rstrip())
K = int(sys.stdin.readline().rstrip())
@lru_cache(None)
def F(N, K):
"""(0以上）N以下で、0でないものがちょうどK個"""
assert N >= 0 # Nが非負であることを保証する
if N < 10: # N が一桁
if K == 0: # 使える 0 以外の数がない場合
return 1 #
if K == 1:
return N # 1,2,...,N までのどれか
return 0 # それ以上 K が余っていたら作れない
q, r = divmod(N, 10) # N = 10*q + r と置く
ret = 0
if K >= 1:
# 1の位(r)が nonzero
ret += F(q, K - 1) * r #
ret += F(q - 1, K - 1) * (9 - r)
# 1の位(r)が zero
ret += F(q, K)
return ret
print(F(N, K))
| 1 | 76,195,168,833,890 | null | 224 | 224 |
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
ans = 0
n_ketasuu = len(str(n))
sta_max = int(str(n)[0])
end_max = int(str(n)[n_ketasuu-1])
for i in range(1,n+1):
sta = int(str(i)[len(str(i))-1])
end = int(str(i)[0])
if sta == 0:
continue
#1桁
if sta == end:
ans +=1
#2桁
if n_ketasuu >= 2 and sta*10 + end <= n:
ans += 1
#3桁
if n_ketasuu > 3 or (n_ketasuu == 3 and sta < sta_max):
ans += 10
elif n_ketasuu == 3 and sta == sta_max:
ans += int(str(n)[1:n_ketasuu-1])
if end <= end_max:
ans += 1
#4桁
if n_ketasuu > 4 or (n_ketasuu == 4 and sta < sta_max):
ans += 100
elif n_ketasuu == 4 and sta == sta_max:
ans += int(str(n)[1:n_ketasuu-1])
if end <= end_max:
ans += 1
#5桁
if n_ketasuu > 5 or (n_ketasuu == 5 and sta < sta_max):
ans += 1000
elif n_ketasuu == 5 and sta == sta_max:
ans += int(str(n)[1:n_ketasuu-1])
if end <= end_max:
ans += 1
#6桁
if n_ketasuu > 6 or (n_ketasuu == 6 and sta < sta_max):
ans += 10000
elif n_ketasuu == 6 and sta == sta_max:
ans += int(str(n)[1:n_ketasuu-1])
if end <= end_max:
ans += 1
print(ans) | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n = INT()
a = [[0]*10 for i in range(10)]
for i in range(1, n+1):
if i % 10 != 0:
a[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += a[i][j]*a[j][i]
print(ans) | 1 | 86,964,817,315,278 | null | 234 | 234 |
import bisect
n = int(input())
lines = list(int(i) for i in input().split())
lines.sort()
counter = 0
for i in range(n-2):
for j in range(i+1, n-1):
counter += bisect.bisect_left(lines, lines[i] + lines[j]) - (j + 1)
print(counter) | import bisect
from itertools import combinations
def main():
N = int(input())
L = sorted(list(map(int, input().split())))
ans = 0
for l in combinations(L, 2):
a = l[0]
b = l[1]
x = bisect.bisect_left(L, a + b)
y = bisect.bisect(L, b - a)
if b - a < a :
ans += x - y - 2
else:
ans += x - y - 1
print(ans // 3)
if __name__ == "__main__":
main()
| 1 | 171,526,622,643,262 | null | 294 | 294 |
N = int(input())
arr = list(map(int, input().split()))
if N == 0:
print(1 if arr[0]==1 else -1)
exit()
elif arr[0] != 0:
print(-1)
exit()
# 末端の葉の数で初期化
sum_arr = [arr[-1]]*N
for i in range(1,N):
# 深さi+1での頂点数 + 深さiでの葉の数
sum_arr[i] = sum_arr[i-1]+arr[N-i]
# 本来の順番に反転
sum_arr = sum_arr[::-1]
# 二分木の根から見ていく
ans = [1]*(N+1)
for i in range(1,N+1):
if ans[i-1]-arr[i-1] < 0:
print(-1)
exit()
tmp = min((ans[i-1]-arr[i-1])*2,sum_arr[i-1])
ans[i] = tmp
# for i in range(min(25,N+1)):
# if ans[i] > 2**i:
# print(-1)
# exit()
if ans[N] != arr[-1]:
print(-1)
exit()
print(sum(ans))
| N,K=map(int,input().split())
P=list(map(int,input().split()))
X=[]
for a in P:
X.append(a/2+0.5)
gou=sum(X[0:K])
han=-32
saigou=sum(X[N-K:N])
han=saigou
for a in range(N-K-1):
if gou>han:
han=gou
gou=gou-X[a]+X[a+K]
print(han) | 0 | null | 46,746,870,805,760 | 141 | 223 |
n,m = map(int,input().split())
c = [int(i) for i in input().split()]
dp = [[float("INF")]*(n+1) for _ in range(m+1)]
dp[0][0] = 0
for i in range(m):
for yen in range(n+1):
if yen - c[i] < 0: dp[i+1][yen] = dp[i][yen]
else: dp[i+1][yen] = min(dp[i][yen],dp[i+1][yen-c[i]]+1)
print(dp[m][n])
| import math
def koch(n, ax, ay, bx, by):
if n == 0: return ;
sin = math.sin(math.radians(60))
cos = math.cos(math.radians(60))
sx = (2.0 * ax + 1.0 * bx) / 3.0
sy = (2.0 * ay + 1.0 * by) / 3.0
tx = (1.0 * ax + 2.0 * bx) / 3.0
ty = (1.0 * ay + 2.0 * by) / 3.0
ux = (tx - sx) * cos - (ty - sy) * sin + sx
uy = (tx - sx) * sin + (ty - sy) * cos + sy
koch(n-1, ax, ay, sx, sy)
print(str(sx)+ " " + str(sy))
koch(n-1, sx, sy, ux, uy)
print(str(ux)+ " " + str(uy))
koch(n-1, ux, uy, tx, ty)
print(str(tx)+ " " + str(ty))
koch(n-1, tx, ty, bx, by)
if __name__ == '__main__':
n = int(input())
ax = 0.00000000
ay = 0.00000000
bx = 100.00000000
by = 0.00000000
print(str(ax) + " " + str(ay))
koch(n, ax, ay, bx, by)
print(str(bx)+ " " + str(by))
| 0 | null | 139,640,502,624 | 28 | 27 |
while True:
h, w = map(int, input().split())
if(w == h == 0): break
for i in range(h):
for j in range(w):
if i == 0 or i == h - 1:
print('#', end = '')
else:
if j == 0 or j == w - 1:
print('#', end = '')
else:
print('.', end = '')
print('')
print('')
| def resolve():
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
BC = [list(map(int, input().split())) for _ in range(Q)]
a = [0] * 100001
for i in A:
a[i] += i
ans = sum(a)
for b, c in BC:
if a[b] == 0:
print(ans)
continue
move = a[b] // b
a[b] = 0
a[c] += c * move
ans += (c - b) * move
print(ans)
if __name__ == "__main__":
resolve() | 0 | null | 6,511,440,321,794 | 50 | 122 |
import numpy as np
n = int(input())
st = [input().split() for _ in range(n)]
x = input()
s, t = zip(*st)
i = s.index(x)
print(sum(map(int, t[i+1:])))
| N = int(input())
D = []
for i in range(N):
s, t = input().split()
D.append([s, int(t)])
m = input()
n = 0
for i in range(N):
if m in D[i]:
n = i
break
print(sum([d[1] for d in D[n + 1:]]))
| 1 | 96,759,810,131,052 | null | 243 | 243 |
#!/usr/bin/env python3
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
H = int(input())
ans = 0
n = 1
for i in range(10**12):
if H == 1:
ans += n
print(ans)
exit()
ans += n
n *= 2
H = int(H/2)
if __name__ == '__main__':
main()
| 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の位が一番初めに入っているので、反転させて表示 | 0 | null | 46,054,020,548,170 | 228 | 121 |
import copy
import math
import time
# a = get_int()
def get_int():
return int(input())
# a = get_string()
def get_string():
return input()
# a_list = get_int_list()
def get_int_list():
return [int(x) for x in input().split()]
# a_list = get_string_list():
def get_string_list():
return input().split()
# a, b = get_int_multi()
def get_int_multi():
return map(int, input().split())
# a_list = get_string_char_list()
def get_string_char_list():
return list(str(input()))
# print("{} {}".format(a, b))
# for num in range(0, a):
# a_list[idx]
# a_list = [0] * a
'''
while (idx < n) and ():
idx += 1
'''
def main():
start = time.time()
n = get_int()
s_list = get_string_char_list()
s_list = [int(x) for x in s_list]
#n = 30000
#s_list = [1] * 30000
#ans_set = set([])
#for i in range(0,n):
# for ii in range(i+1, n):
# for iii in range(ii+1, n):
# ans_set.add(int(s_list[i]) * 100 + int(s_list[ii]) * 10 + int(s_list[iii]) * 1)
#print(len(ans_set))
ans = 0
for i in range(0, 1000):
a = i // 100
b = (i % 100) // 10
c = i % 10
find_a = False
find_b = False
for ii in s_list:
if (find_a == False) and (ii == a):
find_a = True
elif (find_a == True) and (find_b == False) and (ii == b):
find_b = True
elif (find_b == True) and (ii == c):
ans += 1
break
print(ans)
#print(time.time() - start)
if __name__ == '__main__':
main()
| _ = input()
l = reversed(input().split())
print(' '.join(l)) | 0 | null | 65,027,753,421,790 | 267 | 53 |
n,k = map(int,input().split())
l = list(map(int,input().split()))
# xは求める長さ
def C(x):
num = 0
for i in range(n):
# (a[i]-1)//x 回切る必要がある
num += (l[i]-1)//x
# k回以内に収まるか
return num <= k
lb,ub = 0,max(l)
while ub-lb > 1:
mid = (lb + ub) // 2
# 条件を満たすならxを小さくしていく
if C(mid):
ub = mid
else:
lb = mid
# print(lb,ub)
print(ub) | import numpy as np
N, *A = map(int, open(0).read().split())
A = np.array(A, dtype=np.int64)
mod = 10**9 + 7
ans = 0
for i in range(60):
mask = 1 << i
cnt = np.count_nonzero(A&mask)
x = cnt * (N-cnt)
x *= mask % mod
ans += x
ans %= mod
print(ans) | 0 | null | 64,932,776,446,300 | 99 | 263 |
N = int(input())
ans = 0
for i in range(1,N+1):
if i%3 and i%5:
ans += i
print(ans) | N = int(input())
A = []
for i in range(N+1):
if i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
A.append(i)
print(sum(A)) | 1 | 35,022,394,061,952 | null | 173 | 173 |
digits = [0] + [int(c) for c in input()]
dp = [0, 1]
for digit in reversed(digits):
dp0, dp1 = dp
dp[0] = min(dp0, dp1 + 1) + digit
dp[1] = min(dp0, dp1 - 1) + 10 - digit
print(min(dp)) | s=input()[::-1]+'0'
d=[0,1]
for c in s:
x=int(c)
d=[x+min(d[0],1+d[1]),min(1+d[0],d[1])+9-x]
print(min(d))
| 1 | 70,921,576,512,350 | null | 219 | 219 |
from collections import defaultdict
dic = defaultdict(int)
N = int(input())
for i in range(N):
temp = str(input())
dic[temp] += 1
MAX = max(dic.values())
ans = []
for x in dic.keys():
if dic[x] == MAX:
ans.append(x)
ans.sort()
print(*ans,sep="\n") | N = int(input())
S = [input() for _ in range(N)]
d = {}
for s in S:
if s in d:
d[s] += 1
else:
d[s] = 1
maxcount = max([d[k] for k in d])
maxlist = list(filter(lambda x: d[x] == maxcount, d))
maxlist = sorted(maxlist)
for m in maxlist:
print(m) | 1 | 70,124,578,006,080 | null | 218 | 218 |
n,x,y=map(int,input().split())
d=[[0 for _ in range(n)]for _ in range(n)]
for i in range(n):
for j in range(n):
d[i][j]=abs(j-i)
for i in range(n):
for j in range(n):
d[i][j]=min(d[i][j],d[i][x-1]+d[y-1][j]+1)
ans=[0]*n
for i in range(n):
for j in range(i+1,n):
ans[d[i][j]]+=1
for i in ans[1:]:
print(i) | import sys
def main():
h, w, n = map(int, sys.stdin.read().split())
print(-(-n // max(h, w)))
if __name__ == '__main__':
main()
| 0 | null | 66,598,796,253,510 | 187 | 236 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.