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
|
|---|---|---|---|---|---|---|
S = int(input())
h = S // 3600
m= S % 3600 // 60
s = S % 60
print(h,m,s,sep = ":")
|
s=input()
t=input()
s+=t[-1]
if(s==t):print("Yes")
else: print("No")
| 0 | null | 10,812,337,787,580 | 37 | 147 |
count = 0
def main():
input()
A = [int(x) for x in list(input().split())]
merge_sort(A, 0, len(A))
print(*A)
print(count)
def merge_sort(A, left, right):
if left+1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
# リストの左側を作成
L = A[left:mid]
# リストの右側を作成
R = A[mid:right]
# 終端追加
L.append(float("inf"))
R.append(float("inf"))
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
if __name__ == '__main__':
main()
|
#import time
count=0
def merge(A,left,mid,right):
global count
L=A[left:mid]+[2**30]
R=A[mid:right]+[2**30]
i=0
j=0
for k in range(left,right):
count+=1
if L[i]<=R[j]:
A[k]=L[i]
i+=1
else:
A[k]=R[j]
j+=1
def mergeSort(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)
#start = time.time()
n=int(input())
s=list(map(int,input().split()))
count=0
mergeSort(s,0,n)
print(s[0],end='',sep='')
for i in range(1,n):
print(" ",s[i],end='',sep='')
print()
print(count)
#end=time.time()-start
#end*=1000
#print ("Time:{0}".format(end) + "[m_sec]")
| 1 | 109,012,768,186 | null | 26 | 26 |
a = input().split()
b = list(map(int, input().split()))
c = input()
if a[0]==c:
print(b[0]-1, b[1])
else:
print(b[0], b[1]-1)
|
def main():
N = int(input())
num = 0
B = 1
for A in range(1, N):
for B in range(1, N):
if N - A * B >= 1:
num = num + 1
else:
break
print(num)
main()
| 0 | null | 37,234,954,528,552 | 220 | 73 |
n = int(input())
a = n//2 if n%2==0 else (n//2)+1
print(a)
|
K = int(input())
r = 7 % K
ans = -2
for i in range(K):
if r == 0:
ans = i
break
r = 10*r + 7
r = r % K
print(ans+1)
| 0 | null | 32,459,661,933,792 | 206 | 97 |
x, k, d = map(int, input().split())
t = min(abs(x)//d, k)
u = abs(x)-d*t
print(abs(u-d*((k-t)%2)))
|
import math
x,k,d = map(int,input().split())
abs_x = abs(x)
max_len = math.ceil(abs_x/d)*d
min_len = max_len-d
if abs_x-k*d >= 0:
print(abs_x-k*d)
exit()
if (math.ceil(abs_x/d)-1)%2 == k%2:
print(abs(abs_x-min_len))
else:
print(abs(abs_x-max_len))
| 1 | 5,177,130,006,118 | null | 92 | 92 |
n,m = list(map(int, input().split()))
graph = [set() for _ in range(n)]
for _ in range(m):
a,b = list(map(int, input().split()))
graph[a-1].add(b-1)
graph[b-1].add(a-1)
stack = []
group = [-1] * n
gid = 0
i = 0
for i in range(n):
if group[i] >= 0:
continue
group[i] = gid
stack.append(i)
while stack:
current = stack.pop()
for neighbor in graph[current]:
if group[neighbor] == -1:
group[neighbor] = gid
stack.append(neighbor)
gid += 1
print(gid-1)
|
#0926
class UnionFind(): # 0インデックス
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def test(self):
return self.parents
def test2(self):
return sum(z <0 for z in self.parents)
N, M = map(int, input().split()) # N人、M個の関係
uf = UnionFind(N)
for _ in range(M):
A, B = map(int, input().split())
A -= 1
B -= 1
uf.union(A, B)
print(uf.test2()-1)
| 1 | 2,315,609,909,888 | null | 70 | 70 |
N = int(input())
if N%2==1:
print(0)
else:
counter = 0
tmp = 1
while True:
tmp *= 5
if tmp>N:
print(counter)
break
counter += N//(tmp*2)
|
N = int(input())
i = 2
a = 0
while i <= N:
a += N // i
i *= 2
i = 2*5
b = 0
while i <= N:
b += N // i
i *= 5
print(min(a,b) if N % 2 == 0 else 0)
| 1 | 116,542,356,829,212 | null | 258 | 258 |
import sys
lines = [line.strip() for line in sys.stdin]
s = lines[0] + lines[0]
p = lines[1].strip()
if s.find(p) != -1:
print('Yes')
else:
print('No')
|
def solve(n,x):
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
if i == j :
continue
for k in range(1,n+1):
if j == k or i == k:
continue
if i+j+k == x:
count += 1
return count//6
while True:
n,x = map(int,input().split())
if n == x == 0:
break;
print(solve(n,x))
| 0 | null | 1,515,034,345,212 | 64 | 58 |
import sys
l = sys.stdin.readlines()
minv = int(l[1])
maxv = -1000000000
for r in map(int,l[2:]):
m = r-minv
if maxv < m:
maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv)
|
n = int(input())
A = [int(i) for i in input().split(' ')]
# A = '0 33 43 62 29 0 8 52 56 56 19 11 51 43 5 8 93 30 66 69'.split(' ')
# A = [int(i) for i in A]
def trace(A):
for index, v in enumerate(A):
print(v, end='')
if index != len(A) - 1:
print(' ', end='')
print()
def bubble_sort(A, n):
i = 0
counter = 0
while i <= n - 1:
j = n - 1
while j >= i + 1:
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
counter += 1
j -= 1
i += 1
trace(A)
print(counter)
bubble_sort(A, n)
| 0 | null | 15,226,820,910 | 13 | 14 |
n = int(input())
table = [1, 2, 3, 4, 5, 6, 7, 8, 9]
flag = False
for a in range(1, 10):
b = n / a
if(b in table):
flag = True
break
print("Yes" if flag else "No")
|
K = int(input())
S = input()
s = len(S)
mod = int(1e9+7)
n = pow(26, K, mod)
ans = n
for i in range(K):
n = n*25*(s+i)*pow(26*(i+1),-1,mod)%mod
ans = (ans +n) % mod
print(ans)
| 0 | null | 86,486,437,132,158 | 287 | 124 |
K, N = map(int, input().split())
A = list(map(int, input().split()))
li = []
for i in range(N):
if i == 1:
cadA = A[N-1] - A[0]
else:
cadA = K - A[i] + A[i-1]
if i == N-1:
cadB = A[N-1] - A[0]
cadB = 100000000000
else:
cadB = A[i] + (K - A[i+1])
cadB = 100000000000
li.append(min(cadA, cadB))
print(min(li))
|
k,n = map(int,input().split())
a = list(map(int,input().split()))
b = []
for i in range(1,n):
b.append(a[i] - a[i-1])
b.append(k - a[n-1] + a[0])
b = sorted(b)
print(sum(b[:-1]))
| 1 | 43,470,813,276,420 | null | 186 | 186 |
h,w,k = map(int,input().split())
g = [list(input()) for i in range(h)]
ans = [[1]*w for i in range(h)]
count = 1
path = False
l = []
for i in range(h):
if "#" in g[i]:
path = True
done = 0
for j in range(w):
if g[i][j] == "#":
done += 1
if done >= 2:
count += 1
ans[i][j] = count
count += 1
if l:
for j in l:
ans[j] = ans[i]
l = []
else:
if path:
ans[i] = ans[i-1]
else:
l.append(i)
for i in ans:
print(*i)
|
#!/usr/bin/env python3
h, w, k = map(int, input().split())
s = [input() for _ in range(h)]
ans = []
c = 1
for i in s:
if i == "." * w:
if ans:
ans.append(ans[-1])
else:
ans.append([0]*w)
else:
f = i.index("#")
ans.append([c] * (f + 1))
for j in i[f + 1:]:
if j == "#":
c += 1
ans[-1].append(c)
c += 1
for i in range(h):
if ans[i] != [0]*w:
for j in range(i):
ans[j] = ans[i]
break
for i in ans:
print(*i)
| 1 | 143,759,472,747,378 | null | 277 | 277 |
import sys
import bisect
N = int(input())
L = list(map(int, input().split()))
LS = sorted(L)
ans = 0
for i in range(N):
for j in range(N):
if i < j:
index = bisect.bisect_left(LS,LS[i]+LS[j])
ans += index-j-1
print(ans)
|
n = int(input())
L = list(map(int,input().split()))
L = sorted(L)
import bisect
ans = 0
for i in range(n-2):
for j in range(i+1,n-1):
a = bisect.bisect_left(L,L[i]+L[j])
ans += a-j-1
print(ans)
| 1 | 171,567,251,314,278 | null | 294 | 294 |
N,M = map(int, input().split())
S = list(input())
S.reverse()
ans = []
i = 0
while i < N:
num = 0
for j in range(min(N, i+M), i, -1):
if S[j] == "0":
num = j-i
i = j
break
if num == 0:
ans = -1
break
ans.append(num)
if ans == -1:
print(ans)
else:
ans.reverse()
print(*ans)
|
n = int(input())
l = list(map(int, input().split()))
c = 0
for i in l:
if i%2 == 0:
if i%3 != 0 and i%5 != 0:
c += 1
break
print("DENIED" if c > 0 else "APPROVED")
| 0 | null | 103,952,533,127,198 | 274 | 217 |
count = 0
while True:
count += 1
num = int(input())
if num == 0:
break
print("Case", str(count) + ":", num)
|
import math
n, a, b = map(int, input().split())
mod = 10**9 + 7
ans = pow(2, n, mod) - 1
x = 1
y = 1
for i in range(a):
x = x*(n - i)%mod
y = y*(i + 1)%mod
ans -= x*pow(y, mod - 2, mod)%mod
x = 1
y = 1
for i in range(b):
x = x*(n - i)%mod
y = y*(i + 1)%mod
ans -= x*pow(y, mod - 2, mod)%mod
print(ans%mod)
| 0 | null | 33,452,396,677,840 | 42 | 214 |
#初期定義
global result
global s_list
result = 0
#アルゴリズム：ソート
def merge(left, mid, right):
global result
n1 = mid - left
n2 = right - mid
inf = 10**9
L_list = s_list[left: mid] + [inf]
R_list = s_list[mid: right] + [inf]
i = 0
j = 0
for k in range(left, right):
result += 1
if L_list[i] <= R_list[j]:
s_list[k] = L_list[i]
i += 1
else:
s_list[k] = R_list[j]
j += 1
#アルゴリズム：マージソート
def mergeSort(left, right):
if (left + 1) < right:
mid = (left + right) // 2
mergeSort(left, mid)
mergeSort(mid, right)
merge(left, mid, right)
#初期値
n = int(input())
s_list = list(map(int, input().split()))
#処理の実行
mergeSort(0, n)
#結果の表示
print(" ".join(map(str, s_list)))
print(result)
|
N=int(input())
C=[]
b=0
for x in range(1,N//100+1):
for y in range(100*x,105*x+1):
if N==y:
b=1
if b==1:
break
print(b)
| 0 | null | 63,815,085,324,340 | 26 | 266 |
n=int(input())
a=list(map(int,input().split()))
c=0;b=1;i=0
while b:
b=0
for j in range(0,n-i-1):
if a[j]>a[j+1]:a[j],a[j+1]=a[j+1],a[j];b=1;c+=1
i+=1
print(*a)
print(c)
|
import sys
l = []
for i in sys.stdin:
l.append(i.split())
def bubble_sort(data):
count = 0
for i in range(0,len(data)):
for j in range(len(data)-1,i,-1):
if data[j] < data[j-1]:
count += 1
temp = data[j]
data[j] = data[j-1]
data[j-1] = temp
for i in range(0,len(data)):
print(data[i],end='')
print(" ",end='') if i < len(data)-1 else print()
print(count)
for i in range(0,len(l[1])):
l[1][i] = int(l[1][i])
bubble_sort(l[1])
| 1 | 16,771,292,030 | null | 14 | 14 |
while(1):
m,f,r=map(int,input().split())
if m==-1 and f==-1 and r==-1:
break
elif m==-1 or f==-1:
print("F")
elif m+f>=80:
print("A")
elif m+f>=65 and m+f<80:
print("B")
elif m+f>=50 and m+f<65:
print("C")
elif m+f>=30 and m+f<50 and r>=50:
print("C")
elif m+f>=30 and m+f<50:
print("D")
elif m+f<30:
print("F")
|
import sys
while True:
(m, f, r) = [int(i) for i in sys.stdin.readline().split()]
if m == f == r == -1:
break
elif m == -1 or f == -1:
print("F")
elif m + f >= 80:
print("A")
elif m + f >= 65:
print("B")
elif m + f >= 50:
print("C")
elif m + f >= 30:
if r >= 50:
print("C")
else:
print("D")
else:
print("F")
| 1 | 1,213,571,722,980 | null | 57 | 57 |
def main():
from collections import Counter
s = input()
l = [0]
t = 1
for i, x in enumerate(s[::-1]):
t = t * 10 % 2019
y = (l[-1] + int(x) * t) % 2019
l.append(y)
c = Counter(l)
ans = sum([v * (v - 1) // 2 for v in c.values()])
print(ans)
if __name__ == '__main__':
main()
|
#import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
def main():
X = int(input())
a = 100
count = 0
while a < X:
a += a//100
count += 1
print(count)
main()
| 0 | null | 29,154,256,539,228 | 166 | 159 |
import math
def koch(n, h, i, j, k):
if n == 0:
return
sx = (h*2+j)/3
sy = (i*2+k)/3
tx = (h+j*2)/3
ty = (i+k*2)/3
ux = (tx-sx)*math.cos(math.pi/3) - (ty-sy)*math.sin(math.pi/3) + sx
uy = (tx-sx)*math.sin(math.pi/3) + (ty-sy)*math.cos(math.pi/3) + sy
koch(n-1, h, i, sx, sy)
print sx, sy
koch(n-1, sx, sy, ux, uy)
print ux, uy
koch(n-1, ux, uy, tx, ty)
print tx, ty
koch(n-1, tx, ty, j, k)
n = input()
px = float(0)
py = float(0)
qx = float(100)
qy = float(0)
print px, py
koch(n, px, py, qx, qy)
print qx, qy
|
import sys
if sys.subversion[0] == "PyPy":
import io, atexit
sys.stdout = io.BytesIO()
atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
sys.stdin = io.BytesIO(sys.stdin.read())
input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())
def solve():
print(a+a*a+a*a*a)
return
a = RN()
solve()
| 0 | null | 5,132,182,612,818 | 27 | 115 |
a = input()
if a == "AAA" or a == "BBB" :
print ("No")
else : print ("Yes")
|
S = list(input())
if S.count('A') == 3 or S.count('A') == 0:
print('No')
else:
print('Yes')
| 1 | 54,683,313,979,488 | null | 201 | 201 |
n, k = map(int, input().split())
A = list(map(int, input().split()))
now = 1000
for i in range(k, n):
#print(A[i], A[i-k])
if A[i] > A[i-k]:
print("Yes")
else:
print("No")
|
s = input()
if len(s) % 2 == 1:
print('No')
else:
ans = "Yes"
for i in range(len(s)):
if i % 2 == 0 and s[i] != 'h':
ans = "No"
break
if i % 2 == 1 and s[i] != 'i':
ans = "No"
break
print(ans)
| 0 | null | 30,341,227,192,072 | 102 | 199 |
def f(num,l):
k=0
p=[0 for i in range(len(l))]
for i in range(len(l)):
if k>-1:
p[i]=num
if l[i]=='#':
num+=1
k=-1
else:
if l[i]!='#':
p[i]=p[i-1]
else:
p[i]=num
num+=1
return p,num
h,w,k=map(int,input().split())
j=0
num=1
p=[[0 for i in range(w)] for i in range(h)]
for i in range(h):
l=list(input())
if j>-1:
if '#' not in l:
j+=1
else:
p[i],num=f(num,l)
for k in range(j):
p[k]=p[i]
j=-1
else:
if '#' not in l:
p[i]=p[i-1]
else:
p[i],num=f(num,l)
for i in range(h):
print(*p[i])
|
#10_B
import math
a,b,C=map(int,input().split())
S=a*b*math.sin((C*2*math.pi)/360)/2
c=math.sqrt(a**2+b**2-2*a*b*math.cos((C*2*math.pi)/360))
L=a+b+c
h=2*float(S)/a
print(str(S)+'\n'+str(L)+'\n'+str(h)+'\n')
| 0 | null | 72,300,302,076,172 | 277 | 30 |
N = int(input())
A = list(map(int,input().split()))
Q = int(input())
C = (10**5+1)*[0]
T = sum(A)
for a in A:
C[a]+=1
for q in range(Q):
b,c = map(int,input().split())
T+=C[b]*(c-b)
C[c]+=C[b]
C[b]=0
print(T)
|
# -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
a, b, c = map(int, input().split())
k = int(input())
count = 0
while True:
if a >= b:
b *= 2
count += 1
else:
break
while True:
if b >= c:
c *= 2
count += 1
else:
break
if count <= k:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 0 | null | 9,618,822,898,760 | 122 | 101 |
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")
|
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
i_list = [0] * N
for i in range(K, N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No')
| 1 | 7,088,273,611,652 | null | 102 | 102 |
n=int(input());print((n//2)/n if n%2==0 else -(-n//2)/n)
|
N,K = map(int,input().split())
sunuke = [0]*(N+1)
for i in range(K):
okashi_category = input()
#print (okashi_category)
if okashi_category ==1:
sunuke[input()]=1
else:
sunukelist = list(map(int,input().split()))
for j in range(len(sunukelist)):
#print(sunukelist[j])
sunuke[sunukelist[j]]=1
print (N-sum(sunuke))
| 0 | null | 100,693,301,569,910 | 297 | 154 |
N = int(input())
ans = 0
for a in range(1, 10 ** 6 + 1):
for b in range(1, 10 ** 6 + 1):
if a * b >= N:
break
ans += 1
print(ans)
|
import sys
import copy
import math
import itertools
H = int(input())
cnt = 0
for i in range(int(math.log2(H))+1):
cnt+=2**i
print(cnt)
| 0 | null | 41,257,121,390,410 | 73 | 228 |
pi = 3.1415926535897
r = float(input())
print(pi*r**2, 2*pi*r)
|
n,m = map(int,input().split())
v1 = [ input().split() for _ in range(n) ]
v2 = [ int(input()) for _ in range(m) ]
l = [sum(map(lambda x,y:int(x)*y,v,v2)) for v in v1 ]
print(*l,sep="\n")
| 0 | null | 880,669,198,800 | 46 | 56 |
import math
a, b, x = map(int, input().split(' '))
x = x / a
if x > a * b / 2:
print(math.atan2((a * b - x) * 2, a ** 2) * 180 / math.pi)
else:
print(math.atan2(b ** 2, x * 2) * 180 / math.pi)
|
import math
a, b, x = map(int, input().split())
x /= a
def is_ok(theta):
if math.tan(theta) * b < a:
return x <= math.tan(theta) * b * b / 2
else:
p = a/math.tan(theta)
return x <= a*p/2+a*(b-p)
def bisect(ng, ok):
while (abs(ok - ng) > 1e-9):
mid = (ok + ng) / 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
ans = bisect(0, math.pi)
ans = 90- ans * 180 / math.pi
print(ans)
| 1 | 163,120,372,730,660 | null | 289 | 289 |
a=10**5;b=1000
for i in range(input()):
a*=1.05
if a%b>0: a=a-a%b+b
print int(a)
|
m = 100000
for i in range(int(raw_input())):
m*=1.05
m=(int((m+999)/1000))*1000
print m
| 1 | 1,066,046,740 | null | 6 | 6 |
while True:
h, w = map(int, input().split())
if h == 0 and w == 0:
break
width = ''
for i in range(h):
if i % 2 == 0:
for j in range(w):
if j % 2 == 0:
width += '#'
else:
width += '.'
else:
for j in range(w):
if j % 2 != 0:
width += '#'
else:
width += '.'
print(width)
width = ''
print('')
|
W, H, x, y ,r = [int(i) for i in input().split()]
if x <= 0 or y <= 0:
print("No")
elif W - x >= r and H - y >= r:
print("Yes")
else:
print("No")
| 0 | null | 647,975,447,850 | 51 | 41 |
import sys
input = sys.stdin.readline
n = int(input())
a = 0
if n % 2 == 1:
a == 0
else:
n = n // 2
k = 5
while k <= n:
a += n // k
k *= 5
print(a)
|
import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def main():
n = i_input()
if n%2==1:
print(0)
exit()
ans = 0
cnt = 10
while True:
ans += n//cnt
cnt *= 5
if cnt > n:
break
print(ans)
if __name__=="__main__":
main()
| 1 | 116,384,671,713,710 | null | 258 | 258 |
c = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
list_a = list(alphabet)
num_c = list_a.index(c)
print(list_a[num_c + 1])
|
alpha = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
word = input()
leng = alpha.index(word)
print(alpha[leng+1])
| 1 | 92,239,569,277,780 | null | 239 | 239 |
n = int(input())
cnt = 0
for i in range(1, 10):
if len(str(n//i)) == 1 and n%i == 0:
cnt +=1
if cnt >= 1:
print('Yes')
else :
print('No')
|
import math
n = int(input())
address = list(map(int, input().split()))
min_hp = math.inf
for i in range(1, 101):
hp = sum(map(lambda x: (x - i) ** 2, address))
if hp < min_hp:
min_hp = hp
print(min_hp)
| 0 | null | 112,166,790,371,490 | 287 | 213 |
s=input()
t=input()
if len(s)+1==len(t) and s==t[:len(s)]:
print('Yes')
else:print('No')
|
words = list(map(str,input().split()))
score = list(map(int,input().split()))
word = input()
if word == words[0]:
print(score[0]-1,score[1])
else:
print(score[0],score[1]-1)
| 0 | null | 46,530,571,832,020 | 147 | 220 |
import queue
N = int(input())
tree = [[]for _ in range(N+1)]
for i in range(1,N):
a,b = map(int,input().split())
tree[a].append( [b,i])
tree[b].append([a,i])
que = queue.Queue()
node = [-1]*(N+1)
edge = [-1]*N
que.put(1)
node[1] = 1
maxi = 1
start = 0
color = [[] for _ in range(N+1)]
node[1] = 0
while(True):
if que.empty():
break
before = start
start = que.get()
col =1
for i in tree[start]:
if node[i[0]] == -1 :
que.put(i[0])
if edge[i[1]] == -1:
if col == node[start]:
col += 1
edge[i[1]] = col
node[i[0]] = col
if col > maxi:
maxi = col
col +=1
print(maxi)
for i in edge[1:]:
print(i)
|
n = int(input())
numOfColors = 0
edges = [[] for j in range(n+1)]
ngColor = [-1]*(n+1)
outsI = [[] for j in range(n+1)]
outs = [0]*(n-1)
for i in range(n-1):
a, b = map(int, input().split())
edges[a].append(b)
outsI[a].append(i)
numOfColors = len(edges[1])
for i in range(2, len(edges)):
numOfColors = max(len(edges[i])+1, numOfColors)
#print(edges)
#print(outsI)
for i in range(len(edges[1])):
ngColor[edges[1][i]] = i+1
outs[outsI[1][i]] = i+1
queue = []
queue.extend(edges[1])
while queue != []:
v = queue.pop(0)
c = 0
for i in range(len(edges[v])):
c += 1
if c == ngColor[v]:
c += 1
ngColor[edges[v][i]] = c
outs[outsI[v][i]] = c
queue.extend(edges[v])
#print(ngColor)
print(numOfColors)
for out in outs:
print(out)
| 1 | 136,274,575,152,992 | null | 272 | 272 |
a = list(map(int, input().split()))
a.sort()
while a[0] > 0:
b = a[1]%a[0]
a[1] = a[0]
a[0] = b
print(a[1])
|
def main():
line = input()
deepen_x = []
cur_x = 0
ponds = [] # [(水たまりの最初の位置, 水量)]
while len(line) > 0:
#print(cur_x, ponds, deepen_x)
tmp_char = line[0]
if tmp_char == '\\':
deepen_x.append(cur_x)
elif tmp_char == '/' and len(deepen_x) != 0:
pre_x = deepen_x.pop()
volume = cur_x - pre_x
if len(ponds) == 0:
ponds.append([pre_x, volume])
else:
if pre_x < ponds[-1][0]:
# 前の水たまりと結合する
a = list(filter(lambda x: x[0] > pre_x, ponds))
pond = 0
for item in a:
pond += item[1]
[ponds.pop() for x in range(len(a))]
ponds.append([pre_x, pond + volume])
else:
# 新しい水たまりを作成
ponds.append([pre_x, volume])
cur_x += 1
line = line[1:]
print(sum([x[1] for x in ponds]))
if len(ponds) == 0:
print('0')
else:
print("{} ".format(len(ponds)) + " ".join([str(x[1]) for x in ponds]))
return
main()
| 0 | null | 32,749,075,168 | 11 | 21 |
N = int(input())
ans = (N + 1) // 2 / N
print(ans)
|
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
count = Counter(A)
vals = count.values()
sum_ = 0
for v in vals:
if v >= 2: sum_ += v*(v-1)
sum_ //= 2
for k in range(N):
if count[A[k]] < 2: print(sum_)
else:print(sum_ + 1 - count[A[k]])
| 0 | null | 112,416,805,485,792 | 297 | 192 |
n=input()
min = None
max = None
cand=None
for x in xrange(n):
v = input()
# print "#### %s %s %s %s" % (str(max), str(min), str(cand), str(v))
if min is None:
min = v
# print "min is None"
continue
if min > v:
# print "min > v"
if (cand is None) or (cand < v-min):
# print "cand None"
cand = v-min
min = v
max = None
continue
elif (max is None) or (max < v):
# print "max is None"
max = v
if cand < max - min:
cand = max - min
continue
print cand
|
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n,m=map(int,input().split())
class UnionFind(): #集合の取り扱い、辺に重み、階層を意識するときは使えない
def __init__(self,n):
self.n=n
self.par = [-1]*n
def find(self,x):
if self.par[x] <0: #負なら親、要素数
return x
else: #正なら親の番号
self.par[x]=self.find(self.par[x]) #一回調べたら根を繋ぎ変える、経路圧縮
return self.par[x]
def union(self,x,y):
x=self.find(x) #x,yの親
y=self.find(y)
if x==y: #親が同じなら何もしない
return
if self.par[x]>self.par[y]: #要素数が大きい方をxにする
x,y=y,x
self.par[x]+=self.par[y] #xがある集合にyが入った集合をくっつける
self.par[y]=x
def size(self,x):
return -self.par[self.find(x)] #親のサイズ
def same(self,x,y): #親が同じ、すなわち同じ集合か
return self.find(x)==self.find(y)
def member(self,x): #同じ木（集合）にある要素全部リストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root ]
def roots(self): #集合の根になってる要素をリストで返す
return [i for i , x in enumerate(self.par) if x<0]
def group_count(self): #集合の数、木の数
return len(self.roots())
def all_member(self): #辞書型で返す
return {r: self.member(r) for r in self.roots()}
def __str__(self):
return "\n".join('{}:{}'.format(r,self.member(r)) for r in self.roots)
tree=UnionFind(n)
for i in range(m):
a,b=map(int,input().split())
tree.union(a-1,b-1)
print(tree.group_count()-1)
| 0 | null | 1,127,438,522,232 | 13 | 70 |
n = int(input())
for i in range(1, 50000):
if i * 108 // 100 == n:
print(i)
exit()
print(':(')
|
from decimal import Decimal
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
ans = int(A * B)
print(ans)
| 0 | null | 71,213,484,830,242 | 265 | 135 |
# 問題：https://atcoder.jp/contests/abc142/tasks/abc142_b
n, k = map(int, input().strip().split())
h = list(map(int, input().strip().split()))
res = 0
for i in range(n):
if h[i] < k:
continue
res += 1
print(res)
|
"""
Nが奇数のとき、絶対に末尾が0が来ることはない。したがって、答えは0。
Nが偶数の時、
N//10 * 1 + N//10**2 * 1 + ...の数だけ0ができる。
"""
N = int(input())
if N % 2 == 1:
print(0)
else:
ans = 0
ind = 1
while True:
m = 5**ind
if m > N:
break
r = N//m
r //= 2
ans += r
ind += 1
print(ans)
| 0 | null | 147,037,212,573,980 | 298 | 258 |
s = input()
s.split()
if s[2]==s[3] and s[4]==s[5]:
print("Yes")
else:
print("No")
|
def ABC_160_A():
S = input()
if S[2] == S[3] and S[4] == S[5]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
ABC_160_A()
| 1 | 42,234,543,475,698 | null | 184 | 184 |
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
A, B = M()
if A < 2*B:
print(0)
else:
print(A-2*B)
|
n,m,k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A)+sum(B)<=k:
print(n+m)
exit()
for i in range(1,n):
A[i] += A[i-1]
for i in range(1,m):
B[i] += B[i-1]
from bisect import bisect_right
ans = bisect_right(B,k)
for i in range(n):
if A[i]>k:
break
ans = max(ans, i+1+bisect_right(B,k-A[i]))
print(ans)
| 0 | null | 88,652,728,113,168 | 291 | 117 |
n = input()
taro = 0
hanako = 0
for i in xrange(n):
t_card, h_card = raw_input().split(" ")
if t_card < h_card:
hanako += 3
elif t_card > h_card:
taro += 3
elif t_card == h_card:
taro += 1
hanako += 1
print taro, hanako
|
def main():
num = int(input())
con = 10**9 + 7
a, b, c = 1, 1, 2
for i in range(num):
a *= 10
a %= con
b *= 8
b %= con
c *= 9
c %= con
if(a+b-c < 0):
print(a+b-c+con)
return 0
print(a+b-c)
if __name__ == '__main__':
main()
| 0 | null | 2,610,823,244,680 | 67 | 78 |
n=int(input())
a=list(map(int,input().split()))
sum=[0]*(len(a)+1)
for i in range(len(a)):
sum[i+1]=sum[i]+a[i]
# print(sum)
mini=2020202020
for i in range(len(sum)):
mini=min(mini, abs(sum[i] - (sum[-1] - sum[i])))
print(mini)
|
#!/usr/bin/env python3
import sys
import collections as cl
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N, X, M = MI()
rep = []
rep_set = set([])
i = 1
rep.append(X)
rep_set.add(X)
flag = True
while flag and i < N:
x = rep[i-1] ** 2 % M
if x in rep_set:
rep.append(x)
break
rep.append(x)
rep_set.add(x)
i += 1
if i == N:
print(sum(rep))
else:
l = rep.index(rep[-1])
rep_leng = i - l
rep_sum = sum(rep[l:i])
ans = 0
ans += sum(rep[:l])
N -= l
rep_num = N // rep_leng
rep_amari = N % rep_leng
ans += rep_sum * rep_num
ans += sum(rep[l:l+rep_amari])
print(ans)
main()
| 0 | null | 72,172,877,548,170 | 276 | 75 |
a=int(input())
b=int(input())
c=int(input())
if a<b:
a,b=b,a
if c%a==0:
print(c//a)
else:
print(c//a+1)
|
while True:
m, f, r = [int (x) for x in input().split(' ')]
if m == -1 and f == -1 and r == -1: break
if m == -1 or f == -1 or m + f < 30:
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65 and m + f < 80:
print('B')
elif m + f >= 50 and m + f < 65:
print('C')
elif m + f >= 30 and m + f < 50:
if r >= 50:
print('C')
else:
print('D')
| 0 | null | 45,201,140,121,192 | 236 | 57 |
import sys
read=sys.stdin.readline
class SEGTree:
def __init__(self,n):
self.Unit=0
i=1
while(i<n):
i*=2
self.SEG=[self.Unit]*(2*i-1)
self.d=i
def update(self,i,x):
i+=self.d-1
self.SEG[i]=1<<x
while i>0:
i=(i-1)//2
self.SEG[i]=self.SEG[i*2+1]|self.SEG[i*2+2]
def find(self,a,b,k,l,r):
if r<=a or b<=l:
return self.Unit
if a<=l and r<=b:
return self.SEG[k]
else:
c1=self.find(a,b,2*k+1,l,(l+r)//2)
c2=self.find(a,b,2*k+2,(l+r)//2,r)
return c1|c2
def get(self,a,b):
return self.find(a,b,0,0,self.d)
def bitcnt(x):
res=0
while x>0:
if x&1:
res+=1
x//=2
return res
n=int(input())
s=input()
q=int(input())
seg=SEGTree(n)
for i in range(n):
seg.update(i,ord(s[i])-97)
for i in range(q):
q,x,y=read().rstrip().split()
if q=='1':
seg.update(int(x)-1,ord(y)-97)
else:
x,y=int(x)-1,int(y)
bit=seg.get(x,y)
print(bitcnt(bit))
|
def main():
import bisect
n = int(input())
s = list(input())
q = int(input())
d = {}
for i in range(26):
d[chr(ord('a')+i)] = []
for i in range(n):
d[s[i]].append(i)
#print(d)
for i in range(q):
t,a,b = input().split()
if t == '1':
a = int(a)-1
if s[a] == b:
continue
#idx = bisect.bisect_left(d[s[a]],a)
#d[s[a]].pop(idx)
d[s[a]].remove(a)
bisect.insort_left(d[b],a)
s[a] = b
else:
a = int(a)-1
b = int(b)-1
c = 0
for i in range(26):
idx = bisect.bisect_left(d[chr(ord('a')+i)],a)
if idx < len(d[chr(ord('a')+i)]) and d[chr(ord('a')+i)][idx] <= b:
c += 1
print(c)
main()
| 1 | 62,476,693,650,240 | null | 210 | 210 |
n = int(input())
X = list(map(int,input().split()))
Y = list(map(int,input().split()))
# p=1,2,3
for p in range(1,4):
print("{0:.6f}".format(sum([abs(a-b)**p for a,b in zip(X,Y)])**(1/p)))
# p=infinity
print("{0:.6f}".format(max([abs(a-b) for a,b in zip(X,Y)])))
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n = int(input())
A = list(map(int, input().split()))
ans = 1
mod = 10 ** 9 + 7
for i in range(n):
A[i] += 1
cnt = [0] * (n + 1) # cnt[i]は、Aのなかでこれまでに何個iが登場したか。つまりiの候補数。
cnt[0] = 3
for j in range(n):
i = A[j]
ans *= cnt[i - 1]
cnt[i - 1] -= 1
cnt[i] += 1
if cnt[i] > 3:
ans = 0
if cnt[i - 1] < 0:
ans = 0
print(ans % mod)
resolve()
| 0 | null | 65,378,414,083,818 | 32 | 268 |
import math
def main():
n = int(input())
_debt = 100000
for i in range(n):
_debt += math.ceil(_debt*0.05*0.001)*1000
print(_debt)
if __name__ == '__main__':
main()
|
def debt(x):
nx = x * 105 / 100
ha = nx % 1000
nx -= ha
if ha != 0:
nx += 1000
return nx
n = int(raw_input())
x = 100000
for i in range(0, n):
x = debt(x)
print x
| 1 | 1,266,224,388 | null | 6 | 6 |
from collections import deque
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def bfs(field, sx, sy, seen):
queue = deque([(sx, sy)])
seen[sx][sy] += 1
while queue:
x, y = queue.popleft()
for dx, dy in [(-1, 0), (0, 1), (1, 0), (0, -1)]:
nx = x + dx
ny = y + dy
if seen[nx][ny] == -1 and field[nx][ny] != "#":
seen[nx][ny] = seen[x][y] + 1
queue.append((nx, ny))
return seen[x][y]
def main():
H,W = map(int, readline().split())
c = ["#" * (W + 2)]
for _ in range(H):
c.append("#" + readline().strip() + "#")
c.append("#" * (W + 2))
ans = 0
for sx in range(1,H+1):
for sy in range(1,W+1):
if c[sx][sy] == ".":
seen = [[-1] * (W + 2) for i in range(H+2)]
dist = bfs(c, sx, sy, seen)
ans = max(ans, dist)
print(ans)
if __name__ == "__main__":
main()
|
from collections import deque
h,w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
ans = 0
for a in range(h):
for b in range(w):
if maze[a][b] == ".":
DQ = deque([(a, b)])
visit = [[-1] * w for _ in range(h)]
visit[a][b] = 0
tmp = 0
while DQ:
px, py = DQ.popleft()
for i in range(4):
nx = px + dx[i]
ny = py + dy[i]
if 0<=nx<=h-1 and 0<=ny<=w-1 and maze[nx][ny]=="." and visit[nx][ny]==-1:
visit[nx][ny] = visit[px][py] + 1
tmp = visit[nx][ny]
DQ.append((nx, ny))
ans = max(ans, tmp)
print(ans)
| 1 | 94,177,821,810,084 | null | 241 | 241 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
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())
def main():
mod = 998244353
n, k = LI()
l = [0 for _ in range(k)]
r = [0 for _ in range(k)]
for i in range(k):
l[i], r[i] = LI()
dp = [0 for _ in range(n+1)]
dpsum = [0 for _ in range(n+1)]
dp[1], dpsum[1] = 1, 1
for i in range(2,n+1):
for el, er in zip(l, r):
dp[i] += dpsum[max(i-el, 0)] - dpsum[max(i-er-1, 0)]
dp[i] %= mod
dpsum[i] = (dpsum[i-1] + dp[i])%mod
print(dp[n])
main()
|
#!/usr/bin/env python3
import sys
def solve(a: int):
poly = a + a**2 + a**3
return poly
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
a = int(next(tokens)) # type: int
print(solve(a))
if __name__ == '__main__':
main()
| 0 | null | 6,482,073,958,720 | 74 | 115 |
n,m = map(int,input().split())
import heapq
def dijkstra(s):
d = 1
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * n # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
continue
for u in e[v]:
tmp = 1 + cost[v]
if tmp < cost[u]:
cost[u] = tmp
heapq.heappush(hq, (tmp, u))
return cost
e = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a,b = a-1, b-1
e[a].append(b)
e[b].append(a) # 有向グラフでは削除
d = dijkstra(0)
# print(d)
# print(e)
ans = [0]*(n)
for i in range(1,n):
for j in e[i]:
# print(i,j)
if d[j] == d[i] - 1:
ans[i] = j + 1
continue
print("Yes")
print(*ans[1:], sep="\n")
|
def resolve():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
count = 0
j = M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
count = max(count, i + j)
print(count)
if __name__ == "__main__":
resolve()
| 0 | null | 15,641,672,034,388 | 145 | 117 |
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)
|
#!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, A: "List[int]"):
cnt = 0
for a in A:
if a == cnt + 1:
cnt += 1
if cnt == 0:
return -1
return N - cnt
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
answer = solve(N, A)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 69,707,956,191,708 | 155 | 257 |
N,K = map(int,input().split())
cc = list(map(int,input().split()))
memo = []
aa = ['.']*N
a = 1
while aa[a-1] == '.':
memo.append(a)
aa[a-1] = 'v'
a = cc[a-1]
if len(memo)>K:
print(memo[K])
else:
b = memo.index(a)
m = len(memo)-b
mm = (K-b) % m
del memo[:b]
print(memo[mm])
|
import math
a, b, x = map(int, input().split())
sq = a*a*b/2
if sq >= x:
A1 = 2*x/(a*b)
num = math.atan(b/A1)
else:
B1 = 2*x/a**2 - b
num = math.atan((b-B1)/a)
print(math.degrees(num))
| 0 | null | 92,603,956,270,970 | 150 | 289 |
n = int(input())
d = {}
for _ in range(n):
s = input()
if not s in d.keys():
d[s] = 1
print(len(d))
|
h,a = map(int,input().split())
h -= 1
print(1 + h // a)
| 0 | null | 53,444,404,790,382 | 165 | 225 |
def Qb():
s, t = open(0).read().splitlines()
r = sum([s != t for s, t in zip(s, t)])
print(r)
if __name__ == '__main__':
Qb()
|
s = input()
t = input()
print(sum(si != ti for si, ti in zip(s, t)))
| 1 | 10,484,409,007,200 | null | 116 | 116 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
S, T = readline().strip().split()
print(T + S)
return
if __name__ == '__main__':
main()
|
N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=input()
cnt=[0 for _ in range(N)]
score={'r':P,'s':R,'p':S}
for i in range(N):
if i<K:
cnt[i]=score[T[i]]
else:
if T[i-K]!=T[i]:
cnt[i]=score[T[i]]
else:
if cnt[i-K]==0:
cnt[i]=score[T[i]]
print(sum(cnt))
| 0 | null | 105,041,765,657,580 | 248 | 251 |
from itertools import product
H, W, K = map(int, input().split())
choco = [list(input()) for _ in range(H)]
def cnt(array):
count = [0] * H
split_cnt = 0
for w in range(W):
for h in range(H):
if choco[h][w] == "1":
count[array[h]] += 1
if any(i > K for i in count):
split_cnt += 1
count = [0] * H
for h in range(H):
if choco[h][w] == "1":
count[array[h]] += 1
if any(i > K for i in count):
return 10 ** 20
return split_cnt
def get_array(array):
l = len(array)
ret = [0] * l
for i in range(1, l):
ret[i] = ret[i-1] + array[i]
return ret
ans = 10 ** 20
for p in product(range(2), repeat=H-1):
p = get_array([0]+list(p))
ans = min(ans, cnt(p)+max(p))
print(ans)
|
# coding: utf-8
from itertools import combinations as combs
H,W,K = list(map(int, input().split()))
arr = []
for i in range(H):
arr.append(list(map(int, list(input()))))
def cut_sum(arr, x1, x2, y):
ret = 0
for i in range(x1, x2):
ret += arr[i][y]
return ret
row_idxes = list(range(1,H))
min_val = float('inf')
for n_rows in range(H):
for row_set in combs(row_idxes, n_rows):
count = len(row_set)
row_lines = [0] + list(row_set)+ [H]
col1, col2 = 0, 1
sums = [0] * (len(row_lines) - 1)
while col2 <= W:
row1 = 0
for box, row2 in enumerate(row_lines[1:]):
sums[box] += cut_sum(arr, row1, row2, col2-1)
if sums[box] > K:
if (col2 - col1) == 1:
count = float('inf')
break
count += 1
col1 = col2 - 1
col2 -= 1
sums = [0] * (len(row_lines) - 1)
break
row1 = row2
if count >= min_val:
break
col2 += 1
if min_val > count:
min_val = count
print(min_val)
| 1 | 48,634,366,890,692 | null | 193 | 193 |
n, k = map(int, input().split())
mod = 10 ** 9 + 7
N = n + 1
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y // 2) ** 2 % mod
else : return power(x, y // 2) ** 2 * x % mod
factorial = [1]
for i in range(1, N):
factorial.append(factorial[i - 1] * i % mod)
inverseFactorial = [0] * N
inverseFactorial[N - 1] = power(factorial[N - 1], mod - 2)
for i in range(N - 2, -1, -1):
inverseFactorial[i] = inverseFactorial[i + 1] * (i + 1) % mod
def comb(x, y):
return factorial[x] * inverseFactorial[y] * inverseFactorial[x - y] % mod
ans = 1
for i in range(1, min(k + 1, n)):
tmp = comb(n - 1, n - i - 1) * comb(n, i)
ans += tmp
ans %= mod
print(ans)
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int, readline().split()))
comb1 = [0] * (n + 1)
comb2 = [0] * (n + 1)
comb1[0] = 1
comb2[0] = 1
for i in range(1, n + 1):
comb1[i] = comb1[i - 1] * (n + 1 - i)
comb2[i] = comb2[i - 1] * (n - i)
comb1[i] %= MOD
comb2[i] %= MOD
inv = pow(i, MOD - 2, MOD)
comb1[i] *= inv
comb2[i] *= inv
comb1[i] %= MOD
comb2[i] %= MOD
r = min(k, n - 1)
ans = 0
for i in range(r + 1):
ans += comb1[n - i] * comb2[n - 1 - i]
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| 1 | 67,096,698,803,552 | null | 215 | 215 |
if __name__ == "__main__":
n = int(input())
taro, hanako = 0, 0
for _ in range(n):
tw, hw = input().split()
if tw > hw:
taro += 3
elif tw < hw:
hanako += 3
else:
taro += 1
hanako += 1
print(taro, hanako)
|
import sys
input = sys.stdin.readline
def main():
ans = 10**5 * 2
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = sorted(a)[0] + sorted(b)[0]
for i in range(M):
x, y, c = map(int, input().split())
cost = a[x-1] + b[y-1] - c
ans = min(ans, cost)
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 28,146,737,635,832 | 67 | 200 |
h, a = map(int, input().split())
x=h/a
intx=int(x)
if intx==x:
print(intx)
else:
print(intx+1)
|
from math import ceil
H, A = map(int, input().split())
ans = ceil(round(H / A, 6))
print(ans)
| 1 | 76,562,569,424,120 | null | 225 | 225 |
N, X, M = map(int, input().split())
A = X
ans = A
visited = [0]*M
tmp = []
i = 2
while i <= N:
A = (A*A) % M
if visited[A] == 0:
visited[A] = i
tmp.append(A)
ans += A
else:
ans += A
loop_length = i-visited[A]
loop_val = tmp[-1*loop_length:]
loop_count = (N-i) // loop_length
ans += sum(loop_val) * loop_count
visited = [0]*M
i += loop_length * loop_count
i += 1
print(ans)
|
word = input()
n = int(input())
for _ in range(n):
meirei = input().split()
if meirei[0] == "print":
print(word[int(meirei[1]):int(meirei[2])+1])
elif meirei[0] == "reverse":
word = word[:int(meirei[1])] + word[int(meirei[1]):int(meirei[2])+1][::-1] + word[int(meirei[2])+1:]
elif meirei[0] == "replace":
word = word[:int(meirei[1])] + meirei[3] + word[int(meirei[2])+1:]
| 0 | null | 2,461,656,418,820 | 75 | 68 |
n = int(input())
A = list(map(int, input().split()))
l = A[0]
r = sum(A[1:])
x = abs(l-r)
for a in A[1:]:
l += a
r -= a
if x > abs(l-r): x = abs(l-r)
print(x)
|
import sys
def main():
sec = int(sys.stdin.readline())
hour = int(sec / 3600)
sec = sec % 3600
minute = int(sec / 60)
sec = sec % 60
print("{0}:{1}:{2}".format(hour,minute,sec))
return
if __name__ == '__main__':
main()
| 0 | null | 71,126,415,037,590 | 276 | 37 |
import math
n = int(input())
a,b = 1,n
for i in range(1,int(math.sqrt(n)+1)):
if n%i == 0:
q = n//i
if abs(a-b) > abs(q-i):
a,b = i,q
print((a-1) + (b-1))
|
n = input()
numbers = input().split(" ")
numbers.reverse()
numbers = " ".join(numbers)
print(numbers)
| 0 | null | 81,384,217,665,988 | 288 | 53 |
n = int(input())
X = list(map(int,input().split()))
Y = list(map(int,input().split()))
for p in range(1,5):
if p != 4:
D = 0.0
for i in range(n):
D += ((abs(X[i]-Y[i]))**p)
D = D**(1/p)
print("{:.6f}".format(D))
else:
print("{:.6f}".format(max(abs(x-y)for x,y in zip(X,Y))))
|
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
a,b,c = map(int, input().split())
k = int(input())
flag = False
if a < b < c:
print("Yes")
sys.exit()
for i in range(k):
if a < b < c:
c *= 2
if a >= b:
if b >= c:
c *= 2
else:
b *= 2
else:
if b >= c:
c *= 2
else:
b *= 2
if a < b < c:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| 0 | null | 3,544,722,337,470 | 32 | 101 |
import math
n = int(input())
x, y = [int(e) for e in input().split()], [int(e) for e in input().split()]
D1 = D2 = D3 = 0; D4 = []
for x1, y1 in zip(x, y):
D1 += abs(x1-y1)
D2 += abs(x1-y1)**2
D3 += abs(x1-y1)**3
D4.append(abs(x1-y1))
print('{0:.6f}'.format(D1))
print('{0:.6f}'.format(math.sqrt(D2)))
print('{0:.6f}'.format(math.pow(D3, (1/3))))
print('{0:.6f}'.format(max(D4)))
|
import math
n = int(input())
x_buf = input().split()
y_buf = input().split()
x = []
y = []
for i in range(n):
x.append(int(x_buf[i]))
y.append(int(y_buf[i]))
sum1 = 0
sum2 = 0
sum3 = 0
sum_inf = 0
max_inf = 0
for i in range(n):
sum1 += abs(x[i] - y[i])
sum2 += abs(x[i] - y[i]) ** 2
sum3 += abs(x[i] - y[i]) ** 3
sum_inf = abs(x[i] - y[i])
if max_inf < sum_inf:
max_inf = sum_inf
d1 = sum1
d2 = math.sqrt(sum2)
d3 = sum3 ** (1/3)
d4 = max_inf
print(d1)
print(d2)
print(d3)
print(d4)
| 1 | 210,442,257,380 | null | 32 | 32 |
def is_prime(num: int) -> bool:
# 6k +- 1 <= √n
if num <= 1:
return False
if num <= 3:
return True
if num % 2 == 0 or num % 3 == 0:
return False
i = 5
while i * i <= num:
if num % i == 0 or num % (i+2) == 0:
return False
i += 6
return True
x = int(input())
for i in range(x,1000000):
if is_prime(i):
print(i)
break
|
dp = [0 for i in range(1000000)]
N = int(input())
for i in range(2,1000):
if i**2>N:
break
if dp[i]!=0:
continue
for j in range(i,1000000,i):
dp[j] = 1
while dp[N]!=0:
N += 1
print(N)
| 1 | 105,207,414,756,242 | null | 250 | 250 |
import math
a, b,h,m = list(map(int, input().split()))
rel_hour = (h*60 + m)/12/60
#print(rel_hour)
arg_hour = 2* math.pi *rel_hour
arg_min = 2*math.pi * m/60
ans = (abs(a**2+b**2-2*a*b*math.cos(arg_hour-arg_min)))**(1/2)
print(ans)
|
import math
def abs(num):
if num < 0:
return -num
return num
def main():
abhm = [int(_x) for _x in input().split()]
HL = abhm[0]
ML = abhm[1]
H = abhm[2]
M = abhm[3]
radian = 2.0 * math.pi * abs(M / 60.0 - (H + M / 60.0) / 12.0)
length = math.sqrt(HL * HL + ML * ML - 2 * HL * ML * math.cos(radian))
print(length)
main()
| 1 | 20,201,622,255,600 | null | 144 | 144 |
# -*- coding: utf-8 -*-
def insertionSort(A, N):
for i in range(1, N):
print(" ".join(map(str, 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
return A
if __name__ == '__main__':
N = int(input())
A = [ int(a) for a in input().split(" ")]
A = insertionSort(A, N)
print(" ".join(map(str, A)))
|
n = int(input())
*A, = map(int, input().split())
for i in range(n):
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(*A)
| 1 | 5,760,823,430 | null | 10 | 10 |
A,B = map(int,input().split())
Flag = True
i = max(A,B)
s = max(A,B)
while Flag == True and i <= A*B:
if i%A ==0 and i%B == 0:
Flag = False
i += s
print(i-s)
|
import fractions as math
input_line = list(map(int,input().split(' ')))
ans = input_line[0] * input_line[1] // math.gcd(input_line[0], input_line[1])
print(ans)
| 1 | 112,760,308,186,460 | null | 256 | 256 |
m0, d0 = map(int, input().split())
m1, d1 = map(int, input().split())
print('0') if m0 == m1 else print('1')
|
M1,D1 = [ int(i) for i in input().split() ]
M2,D2 = [ int(i) for i in input().split() ]
print("1" if M1 != M2 else "0")
| 1 | 124,368,001,545,600 | null | 264 | 264 |
a,b=map(int,input().split())
for i in range(2000):
if int(i*0.08)==a and int(i*0.1)==b:
print(i)
exit()
print("-1")
|
import collections
h, w, m = map(int, input().split())
h = [None]*m
w = [None]*m
for i in range(m):
u, v = map(int, input().split())
h[i] = u
w[i] = v
hc = collections.Counter(h)
wc = collections.Counter(w)
hm = hc.most_common()[0][1]
hs = set([])
for hi, ci in hc.most_common():
if ci == hm:
hs.add(hi)
else:
break
wm = wc.most_common()[0][1]
ws = set([])
for wi, ci in wc.most_common():
if ci == wm:
ws.add(wi)
else:
break
cnt = 0
for i in range(m):
if h[i] in hs and w[i] in ws:
cnt += 1
if cnt == len(hs)*len(ws):
print(hm + wm -1)
else:
print(hm + wm)
| 0 | null | 30,493,034,400,242 | 203 | 89 |
# コッホ曲線 Koch curve
import math
class Point():
def __init__(self, x, y):
self.x = x
self.y = y
def __repr__(self):
return str(self.x) + " " + str(self.y)
def Koch(p1, p2, n):
if n == 0:
print(p1)
else:
s = Point(p1.x * 2 / 3 + p2.x * 1 / 3, p1.y * 2 / 3 + p2.y * 1 / 3)
u = Point(p1.x / 2 + p2.x / 2 + p1.y * r3 / 6 - p2.y * r3 / 6, p1.y / 2 + p2.y / 2 + p2.x * r3 / 6 - p1.x * r3 / 6)
t = Point(p1.x * 1 / 3 + p2.x * 2 / 3, p1.y * 1 / 3 + p2.y * 2 / 3)
Koch(p1, s, n - 1)
Koch(s, u, n - 1)
Koch(u, t, n - 1)
Koch(t, p2, n - 1)
r3 = math.sqrt(3)
start = Point(0, 0)
goal = Point(100, 0)
n = int(input())
Koch(start, goal, n)
print(goal)
|
def selectionsort(A, N):
count = 0
for i in range(N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
A[i], A[minj] = A[minj], A[i]
if (A[i] != A[minj]):
count += 1
return count
def main():
n = int(input())
data = list(map(int, input().split()))
c = selectionsort(data, n)
print(*data)
print(c)
if __name__ == "__main__":
main()
| 0 | null | 72,204,279,180 | 27 | 15 |
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)
|
import sys
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
data = [[a,i] for i,a in enumerate(LI())]
data.sort(reverse=True)
dp = [[0] * (N+1) for _ in range(N+1)]
for i in range(N):
a, p = data[i]
for j in range(i+1):
dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j] + abs(N-1-j-p)*a)
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + abs(i-j-p)*a)
print(max(dp[-1]))
| 0 | null | 21,131,794,849,192 | 107 | 171 |
x1,y1,x2,y2=map(float,input().split())
print(f'{((x2-x1)**2+(y2-y1)**2)**0.5:.6f}')
|
x1, y1, x2, y2 = (float(x) for x in input().split())
print("{:.7f}".format(((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5))
| 1 | 152,837,579,358 | null | 29 | 29 |
def do_round_robin(process, tq):
from collections import deque
q = deque()
elapsed_time = 0 # ??????????????????????§??????????????????????
finished_process = [] # ????????????????????????????????????????????¨??????????????????????????§?????????
# ?????\?????????????????????????????????
for process_name, remaining_time in process:
q.append([process_name, int(remaining_time)])
while True:
try:
process_name, remaining_time = q.pop()
except IndexError: # ??????????????£???????????????????????????????????£???
break
else:
elapsed_time += min(remaining_time, tq)
remaining_time -= tq
if remaining_time > 0:
q.appendleft([process_name, remaining_time])
else:
finished_process.append((process_name, elapsed_time))
return finished_process
if __name__ == '__main__':
# ??????????????\???
# ????????????????????????????????????????????????????°??????????????????????????????¨
data = [int(x) for x in input().split(' ')]
num_of_process = data[0]
time_quantum = data[1]
process = []
for i in range(num_of_process):
process.insert(0, [x for x in input().split(' ')])
# ??????
results = do_round_robin(process, time_quantum)
# ???????????????
for i in results:
print('{0} {1}'.format(i[0], i[1]))
|
n, q = map(int, input().split())
process = []
for _ in range(n):
name, time = input().split()
process.append([name, int(time)])
process.append([])
def reduce(index):
left_time = process[index][1] - q
return [process[index][0], left_time]
head = 0
tail = n
quene_len = len(process)
elapsed_time = 0
while head != tail:
if process[head][1] > q:
process[tail] = reduce(head)
elapsed_time += q
head = (head+1)%quene_len
tail = (tail+1)%quene_len
else:
elapsed_time += process[head][1]
print(process[head][0], elapsed_time)
head = (head+1)%quene_len
| 1 | 44,050,725,892 | null | 19 | 19 |
s = input()[::-1]
MOD = 2019
cum = 0
cnt = [0] * 2019
cnt[0] = 1
d = 1
for c in s:
cum += int(c) * d
cum %= MOD
cnt[cum] += 1
d *= 10
d %= MOD
ans = 0
for v in cnt:
ans += v * (v - 1) // 2
print(ans)
|
import numpy as np
S=input()
N=len(S)
mod=[0 for i in range(2019)]
mod2=0
ten=1
for i in range(N-1,-1,-1):
s=int(S[i])*ten
mod2+=np.mod(s,2019)
mod2=np.mod(mod2,2019)
mod[mod2]+=1
ten=(ten*10)%2019
ans=0
for i in range(2019):
k=mod[i]
if i==0:
if k>=2:
ans+=k*(k-1)//2+k
else:
ans+=k
else:
if k>=2:
ans+=k*(k-1)//2
print(ans)
| 1 | 30,661,345,419,968 | null | 166 | 166 |
import numpy as np
from collections import defaultdict
N, K = map(int, input().split())
As = np.array([0] + list(map(int, input().split())))
#Find (i, j) that satisfies "sum(As[i:j]) % K == j - i"
#If 0 < j - i < K then
#sum(As[i:j]) % K == j - i % K
#<-> (sum(As[:j]) - j) % K == (sum(As[:i]) - i) % K
mods = As % K
csum_mods = np.cumsum(mods)
magic_array = (csum_mods - np.arange(0, N+1)) % K
indices = defaultdict(list)
for i, m in enumerate(magic_array.tolist()):
indices[m].append(i)
ans = 0
for ls in indices.values():
j = 1
for i in range(len(ls)):
while j < len(ls):
if ls[j] - ls[i] < K:
j += 1
else:
break
ans += j - i - 1
print(ans)
|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
s = 0
B = [0]
C = {0:[0]}
for i, a in enumerate(A):
s = (s+a)%K
n = (s-i-1)%K
B.append(n)
if n not in C: C[n] = []
C[n].append(i+1)
ans = 0
for k, v in C.items():
if len(v)<=1: continue
ans_k = 0
ir=0
for il in range(0,len(v)-1):
l = v[il]
while(ir<len(v) and v[ir]-l<=K-1): ir+=1
ans_k+=(ir-1)-il
ans+=ans_k
print(ans)
| 1 | 137,978,405,799,740 | null | 273 | 273 |
import sys
sys.setrecursionlimit(10 ** 9)
n = int(input())
x = input()
p = [-1 for _ in range(2*(10**5)+1)]
cnt = x.count('1')
def calc(a):
#print('a=',a)
if p[a] != -1:
return p[a]
else:
if a == 0:
ret = 0
else:
b = bin(a).count('1')
ret = 1+calc(a%b)
p[a] = ret
return ret
if cnt > 1:
x0 = int(x,2)%(cnt-1)
xx0 = [1]
for i in range(n):
xx0.append((xx0[-1]*2)%(cnt-1))
x1 = int(x,2)%(cnt+1)
xx1 = [1]
for i in range(n):
xx1.append((xx1[-1]*2)%(cnt+1))
y = list(x)
for i in range(n):
if y[i] == '0':
xx = xx1[n-i-1]
print(calc((x1+xx)%(cnt+1))+1)
else:
if cnt == 1:
print(0)
else:
xx = xx0[n-i-1]
print(calc((x0-xx)%(cnt-1))+1)
|
from collections import deque
LIM=200004
L=[0]*LIM
def bin_sum(Y):
S=bin(Y)[2:]
count=0
for i in range(len(S)):
count+=int(S[i])
return count
def bin_sum2(Y):
count=0
for i in range(len(Y)):
count+=int(Y[i])
return count
for i in range(1,LIM):
L[i]+=bin_sum(i)
def pop_num(N,b,L):
if N==0:
return 0
v=N%b
return pop_num(v,L[v],L)+1
M=[0]*200005
for i in range(1,200004):
M[i]+=pop_num(i,L[i],L)
X=int(input())
Y=input()
d=bin_sum2(Y)
e=int(Y,2)%(d+1)
f=int(Y,2)%max(1,(d-1))
O=[1]*(X+2)
P=[1]*(X+2)
q=max(d-1,1)
for i in range(1,X+1):
O[i]=O[i-1]*2%q
P[i]=P[i-1]*2%(d+1)
for i in range(X):
if int(Y[i])==1:
b=max(d-1,1)
flag=max(0,d-1)
g=(f-O[X-1-i]+b)%b
else:
b=d+1
flag=1
g=(e+P[X-1-i])%b
if flag==0:
print(0)
elif g==0:
print(1)
else:
print(M[g]+1)
| 1 | 8,199,041,908,162 | null | 107 | 107 |
import sys
sys.setrecursionlimit(10 ** 9)
# 昔同じ問題を atcoder で見た？
n = int(input())
edges = []
paths = {}
for i in range(n-1):
a, b = list(map(int, input().split(' ')))
edges.append((a, b))
paths[a] = paths.get(a, []) + [b]
paths[b] = paths.get(b, []) + [a]
# print(edges)
# print(paths)
colors = {} # (a->b) 1 とか
current = 1
biggest = 1
def f(current, prev, prev_color):
global biggest
color = 0
for vertex in paths[current]:
if vertex == prev:
continue
color += 1
if color == prev_color:
color += 1
biggest = max(biggest, color)
colors[(current, vertex)] = color
f(vertex, current, color)
f(1, None, None)
print(biggest)
for a, b in edges:
print(colors[(a, b)])
# pypy3
|
n=int(input())
ki=[[] for _ in range(n)]
hen=[tuple(map(int,input().split())) for i in range(n-1)]
color={(hen[i][0]-1,hen[i][1]-1):0 for i in range(n-1)}
for i in range(n-1):
a,b=hen[i][0],hen[i][1]
ki[a-1].append(b-1)
ki[b-1].append(a-1)
mcol=0
ne=0
for i in range(n):
if len(ki[i])>mcol:
mcol=len(ki[i])
ne=i
print(mcol)
from collections import deque
d=deque()
d.append(ne)
visited=[False]*n
visited[ne]=True
col=[0]*n
while d:
g=d.popleft()
for i in ki[g]:
if visited[i]:
continue
d.append(i)
visited[i]=True
if g>i:
x,y=i,g
else:
x,y=g,i
color[(x,y)]=col[g]%mcol+1
col[g],col[i]=color[(x,y)],color[(x,y)]
for i in hen:
print(color[(i[0]-1,i[1]-1)])
| 1 | 136,469,974,929,830 | null | 272 | 272 |
A, B = input().split()
B = B.replace(".", "")
A, B = int(A), int(B)
print(A*B//100)
|
N,K=map(int, input().split())
P=998244353
S=[tuple(map(int,input().split())) for _ in range(K)]
f=[0]*(10**6)
f[0]=1
for i in range(N):
for l, r in S:
f[i+l] += f[i]
f[i+l]%=P
f[i+r+1]-=f[i]
f[i+r+1]%=P
if i:
f[i+1]+=f[i]
f[i]%=P
print(f[N-1])
| 0 | null | 9,540,332,328,482 | 135 | 74 |
n = int(input())
t_score = 0
h_score = 0
for i in range(n):
t_card, h_card = input().split()
if t_card < h_card:
h_score += 3
elif t_card > h_card:
t_score += 3
else:
h_score += 1
t_score += 1
print(t_score, h_score)
|
n = int(input())
a = 0
b = 0
for _ in range(n):
word_a, word_b = input().split()
words = [word_a, word_b]
words.sort()
if word_a == word_b:
a += 1
b += 1
elif words.index(word_a) == 1:
a += 3
else:
b += 3
print(a, b)
| 1 | 1,982,391,083,502 | null | 67 | 67 |
# forしながらif、ifでないときはforしないので、計算量減
# 初期入力 ２０２０－０７２７ 21：50
from collections import Counter
import sys
input = sys.stdin.readline #文字列では使わない
N = int(input())
*S, =input().strip()
"""
c =Counter(S)
ans =combinations_count(N, 3) -len(c)
"""
count =0
x100=0
x10=0
x1=0
for i in range(10):
if str(i) not in S:
continue
else:
x100 =S.index(str(i)) +1
for j in range(10):
if str(j) not in S[x100:]:
continue
else:
x10 =S[x100:].index(str(j)) +1
for k in range(10):
if str(k) in S[x100 +x10:]:
x1 =S[x100+x10:].index(str(k)) +1
count +=1
#print("aa",i,j,k,"bb",x100,x100+x10,x100+x10+x1)
print(count)
|
M1,D1=list(map(int, input().split()))
M2,D2=list(map(int, input().split()))
if (M1==M2-1 or M1-M2==11) and D2==1:
print(1)
else:
print(0)
| 0 | null | 126,346,897,909,504 | 267 | 264 |
from collections import defaultdict
N, X, Y = map(int, input().split())
INF = 10**20
ans = {i:0 for i in range(N)}
d = defaultdict(list)
for i in range(1, N):
d[i].append(i+1)
d[i+1].append(i)
d[X].append(Y)
d[Y].append(X)
for i in range(1, N+1):
dist = [-1]*(N+1)
q = [i]
dist[i] = 0
while q:
a = q.pop()
for b in d[a]:
if dist[b]==-1 or dist[b] > dist[a]+1:
dist[b] = dist[a] + 1
q.append(b)
for j in range(i+1, N+1):
ans[dist[j]] += 1
for i in range(1,N):
print(ans[i])
|
from collections import deque
N, X, Y = map(int, input().split())
adj = [[] for _ in range(N)]
for i in range(N-1):
adj[i].append(i+1)
adj[i+1].append(i)
adj[X-1].append(Y-1)
adj[Y-1].append(X-1)
dist = [[-1]*N for _ in range(N)]
for i in range(N):
queue = deque([i])
dist[i][i] = 0
while queue:
now = queue.popleft()
for u in adj[now]:
if dist[i][u] < 0:
queue.append(u)
dist[i][u] = dist[i][now] + 1
ans = [0] * (N-1)
for i in range(N):
for j in range(i+1,N):
ans[dist[i][j]-1] += 1
[print(a) for a in ans]
| 1 | 44,335,902,038,080 | null | 187 | 187 |
A, B, M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = []
for i in range(M):
x, y, c = map(int,input().split())
z = a[x - 1] + b[y - 1] - c
ans.append(z)
z = min(a) + min(b)
ans.append(z)
ans = sorted(ans)
print(ans[0])
|
H1,M1,H2,M2,K = map(int,input().split())
start,end = 60*H1+M1,60*H2+M2
print(abs(start-end) - K) if end-K>0 else print(0)
| 0 | null | 36,058,499,010,420 | 200 | 139 |
def fibonacci(i, num_list):
if i == 0 or i == 1:
num_list[i] = 1
else:
num_list[i] = num_list[i-2] + num_list[i-1]
n = int(input()) + 1
num_list = [0 for i in range(n)]
for i in range(n):
fibonacci(i, num_list)
print(num_list[-1])
|
N = int(input())
for x in range(N+1):
if int(x*1.08) == N:
print(x)
break
else:
print(':(')
| 0 | null | 62,585,712,493,540 | 7 | 265 |
"""Boot-camp-for-Beginners_Easy006_B_Bishop_25-August-2020.py"""
H, W = (map(int, input().split()))
if(H == 1 or W == 1):
print(1)
else:
if (H*W) % 2 == 0:
print(int(H*W/2))
else:
print(int(H*W/2)+1)
|
a, b, c, d = map(int, input().split())
h = a * c
i = a * d
j = b * c
k = b * d
print(max(h, i, j, k))
| 0 | null | 26,867,674,611,570 | 196 | 77 |
Moji = 'ACL'
K = int(input())
Answer = (Moji * K)
print(Answer)
|
K = input(str())
a = 'ACL'
if K == '1':
print(a)
if K == '2':
print(a * 2)
if K == '3':
print(a * 3)
if K == '4':
print(a * 4)
if K == '5':
print(a * 5)
| 1 | 2,173,790,607,470 | null | 69 | 69 |
n = int(input())
for i in range(1,50000):
if int(i*1.08) == n:
print(i)
exit()
print(":(")
|
from math import ceil
N = int(input())
X = ceil(N / 1.08)
if int(X * 1.08) == N:
print(int(X))
else:
print(':(')
| 1 | 126,047,271,653,318 | null | 265 | 265 |
N,K = map(int,input().split())
P = list(map(int,input().split()))
A = [0 for _ in range(N)]
for i in range(N):
A[i] = (P[i]+1)/2
cmax = sum(A[:K])
a = cmax
for i in range(1,N-K+1):
a = a+A[i+K-1]-A[i-1]
cmax = max(cmax,a)
print(cmax)
|
def print_chessboard(h, w):
"""
h: int
w: int
outputs chessboard using '#' and '.'
>>> print_chessboard(3, 4)
#.#.
.#.#
#.#.
>>> print_chessboard(5, 6)
#.#.#.
.#.#.#
#.#.#.
.#.#.#
#.#.#.
>>> print_chessboard(2, 2)
#.
.#
"""
for i in range(h):
line = ''
for j in range(w):
if (i+j) % 2 == 0:
line += '#'
else:
line += '.'
print(line)
if __name__ == '__main__':
while True:
(h, w) = [int(i) for i in input().split(' ')]
if h == 0 and w == 0:
break
print_chessboard(h, w)
print()
| 0 | null | 38,050,171,694,780 | 223 | 51 |
N, X, M = map(int, input().split())
existence = [False] * M
a = []
A = X
for i in range(N):
if existence[A]:
break
existence[A] = True
a.append(A)
A = A * A % M
for i in range(len(a)):
if a[i] == A:
loop_start = i
break
else:
loop_start = len(a)
result = sum(a[:loop_start])
N -= loop_start
if N != 0:
a = a[loop_start:]
loops = N // len(a)
remainder = N % len(a)
result += sum(a) * loops + sum(a[:remainder])
print(result)
|
h,w,k = map(int,input().split())
m=[list(input()) for i in range(h)]
o=0
for h_bit in range(2**h):
for w_bit in range(2**w):
c=0
for i in range(h):
for j in range(w):
if (h_bit>>i)&1==0 and (w_bit>>j)&1==0 and m[i][j]=='#':
c+=1
if c==k:
o+=1
print(o)
| 0 | null | 5,883,516,711,688 | 75 | 110 |
import math
def f(d):
theta = d * math.pi /180
if a * math.tan(theta) <= b:
return a*a*b - a*a*a*math.tan(theta)/2
else:
return a*b*b/(2*math.tan(theta))
a, b, x = map(int, input().split())
l, r = 0.0, 90.0
for i in range(1000):
m = (l+r)/2
if f(m) <= x: r = m
else: l = m
print('{0:.10f}'.format(l))
|
import math
a,b,x = map(int,input().split())
S = a*a*b
if 2*x>=S:
tmp = 2 * (S - x) / (a**3)
else:
tmp = a * b * b / (2 * x)
print(math.degrees(math.atan(tmp)))
| 1 | 163,227,701,662,816 | null | 289 | 289 |
import math
mod = 10**9+7
N = int(input())
iwashi01 = 0
iwashi10 = 0
iwashi00 = 0
iwashi = dict()
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
iwashi00 += 1
elif a == 0:
iwashi01 += 1
elif b == 0:
iwashi10 += 1
else:
g = math.gcd(abs(a), abs(b))
a //= g; b //= g
if a*b > 0:
if a < 0 and b < 0:
a *= -1
b *= -1
iwashi.setdefault((a, b), [0, 0])
iwashi[(a, b)][0] += 1
if a*b < 0:
if a < 0 and b > 0:
a *= -1
b *= -1
a, b = -b, a
iwashi.setdefault((a, b), [0, 0])
iwashi[(a, b)][1] += 1
r = 2**iwashi01 % mod - 1 + 2**iwashi10 % mod - 1 + 1
for s, t in iwashi.values():
r *= 2**s % mod -1 + 2**t % mod -1 + 1
r %= mod
print((r + iwashi00 - 1) % mod)
|
import math
H,N = map(int,input().split())
print("Yes" if sum(list(map(int,input().split())))>=H else "No")
| 0 | null | 49,202,953,269,888 | 146 | 226 |
import sys
def getTheNumberOfCoin(n, m, c):
T = {}
for j in range(0, n+1):
T[j] = 100000
T[0] = 0
for i in range(0, m):
for j in range(c[i], n+1):
T[j] = min(T[j], T[j-c[i]]+1)
return T[n]
n, m = (int(x) for x in sys.stdin.readline().split())
c = sorted([int(x) for x in sys.stdin.readline().split()])
print(getTheNumberOfCoin(n, m, c))
|
x, n = map(int,input().split())
L = list(map(int,input().split()))
l, r = x-1, x+1
if n == 0 or x not in L:
print(x)
exit()
while True:
if l not in L:
print(l)
break
elif r not in L:
print(r)
break
l -= 1
r += 1
| 0 | null | 7,193,308,926,128 | 28 | 128 |
N = int(input())
print((1000 - N % 1000)%1000)
|
N,K = map(int,input().split())
p = list(map(int,input().split()))
math = [0]*N
ans = 0
check = 0
for i,j in enumerate(p):
math[i] += (j*(j+1)/2)/j
if(i+1<=K):
check += math[i]
else:
check += math[i]
check -= math[i-K]
ans = max(ans,check)
print(ans)
| 0 | null | 41,914,714,950,398 | 108 | 223 |
n, m = map(int, input().split())
route = [[] for _ in range(n+1)]
ans = [0]*n
for _ in range(m):
a, b = map(int, input().split())
route[a].append(b)
route[b].append(a)
q = [1]
l = set()
while True:
if len(q) == 0:
break
p = q.pop(0)
for i in route[p]:
if i not in l:
l.add(i)
ans[i-1] = p
q.append(i)
if ans.count(0) > 1:
print("No")
else:
print("Yes")
for i in range(1, n):
print(ans[i])
|
S=str(input())
if S[-1]=='s':
S = S + 'es'
else:
S = S + 's'
print(S)
| 0 | null | 11,454,652,820,700 | 145 | 71 |
def i1():
return int(input())
def i2():
return [int(i) for i in input().split()]
mod=10**9+7
def bp(a,n):
r=1
while(n):
if n%2:
r=r*a%mod
a=a*a%mod
n>>=1
return r
[n,k]=i2()
if n<=k:
x=1
for i in range(n-1):
x*=2*n-1-i
x%=mod
y=1
for i in range(n-1):
y*=i+1
y%=mod
print((x*bp(y,10**9+5))%mod)
else:
x=1
y=1
t=1
for i in range(k):
t*=i+1
t%=mod
y*=n-1-i
y%=mod
y*=n-i
y%=mod
c=bp(t,10**9+5)
x+=y*c*c
x%=mod
print(x)
|
while(1):
m, f, r = map(int, input().split())
if m == -1 and f == -1 and r == -1:
break
score = m + f
if m == -1 or f == -1:
print("F")
continue
if score >= 80:
print("A")
continue
if score >= 65 and score < 80:
print("B")
continue
if score >= 50 and score < 65:
print("C")
continue
if score >= 30 and score < 50:
if r >= 50:
print("C")
else:
print("D")
continue
if score < 30:
print("F")
| 0 | null | 34,119,145,948,020 | 215 | 57 |
N = int(input())
A = list(map(int, input().split()))
manzoku = 1
hakai = 0
for i in range(N):
if A[i] == manzoku:
manzoku += 1
else:
hakai += 1
if hakai == N:
print(-1)
else:
print(hakai)
|
N = int(input())
a = list(map(int, input().split()))
count = 1
bk = 0
for i in a:
if i == count:
count += 1
else:
bk += 1
if bk == N:
ans = -1
else:
ans = bk
print(ans)
| 1 | 115,016,117,295,046 | null | 257 | 257 |
# -*- coding: utf-8 -*-
def main():
S = input()
T = input()
n = len(S)
ans = 0
for i in range(n):
if S[i] != T[i]:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
S = input()
T = input()
ans = 0
for n in range(len(S)):
if S[n] != T[n]:
ans += 1
print(ans)
| 1 | 10,358,131,018,382 | null | 116 | 116 |
a, b = map(float, input().split())
a = round(a)
b = round(b*100)
ans = a*b
ans = str(ans)[:-2]
if ans == "":
ans = 0
print(ans)
|
a, b = map(float, input().split())
ib = b * 100
ans = int(a) * round(ib) // 100
print(ans)
| 1 | 16,607,755,944,000 | null | 135 | 135 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.