buggy stringlengths 1 539k | fixed stringlengths 16 491k | text stringlengths 47 929k |
|---|---|---|
import math
N = int(raw_input())
CSF = [map(float, raw_input().split()) for _ in range(N-1)]
for i in range(N-1):
ans = CSF[i][0] + CSF[i][1]
for j in range(i+1, N-1):
C, S, F = CSF[j][0], CSF[j][1], CSF[j][2]
if t < ans:
n = math.ceil((ans - S) / F)
ans = C + S + u * n... | # coding: utf-8
import math
N = int(raw_input())
CSF = [map(float, raw_input().split()) for _ in range(N-1)]
for i in range(N-1):
ans = CSF[i][0] + CSF[i][1]
for j in range(i+1, N-1):
s, t, u = CSF[j][0], CSF[j][1], CSF[j][2]
if t < ans:
n = int(math.ceil((ans - t) / u))
... | import math
N = int(raw_input())
CSF = [map(float, raw_input().split()) for _ in range(N-1)]
for i in range(N-1):
ans = CSF[i][0] + CSF[i][1]
for j in range(i+1, N-1):
C, S, F = CSF[j][0], CSF[j][1], CSF[j][2]
if t < ans:
n = math.ceil((ans - S) / F)
ans = C + S + u * n... |
i=0
while 1:
x = raw_index()
i++
print "Case" i":"x
break() |
i=0
while 1:
x = raw_input()
if x == "0":
break
i = i+1
print "Case %s: %s" %(i,x) | i=0
while 1:
x = raw_index()
i++
print "Case" i":"x
break()
### FIXED CODE ###
i=0
while 1:
x = raw_input()
if x == "0":
break
i = i+1
print "Case %s: %s" %(i,x) |
N , K = map(int, input().split())
s = input()
print(s[:K-1]+s[K].lower()+s[K:])
| N , K = map(int, input().split())
s = input()
o = []
for i in range(N):
if i == K - 1:
o.append(s[i].lower())
else:
o.append(s[i])
print("".join(o)) | N , K = map(int, input().split())
s = input()
print(s[:K-1]+s[K].lower()+s[K:])
### FIXED CODE ###
N , K = map(int, input().split())
s = input()
o = []
for i in range(N):
if i == K - 1:
o.append(s[i].lower())
else:
o.append(s[i])
print("".join(o)) |
n,a = map(int,input().split())
print(n * n - a) | n = int(input())
a = int(input())
print(n * n - a) | n,a = map(int,input().split())
print(n * n - a)
### FIXED CODE ###
n = int(input())
a = int(input())
print(n * n - a) |
import math
while 1 :
e = int(raw_input())
if e == 0:
break
z = 0
m = e
while math.pow(z,3) <= e:
y = 0
while y ** 2 <= e - math.pow(z,3):
m = min(e + y + z - y**2 - math.pow(z,3), m)
y += 1
z += 1
print y, z
print int(m)
quit() | from math import sqrt
while 1 :
e = int(raw_input())
if e == 0:
break
z = 0
m = float("inf")
while z ** 3 <= e:
y = int(sqrt(e - z**3))
m = min(m, e - y**2 - z**3 + y + z)
z += 1
print int(m) | import math
while 1 :
e = int(raw_input())
if e == 0:
break
z = 0
m = e
while math.pow(z,3) <= e:
y = 0
while y ** 2 <= e - math.pow(z,3):
m = min(e + y + z - y**2 - math.pow(z,3), m)
y += 1
z += 1
print y, z
print int(m)
quit()
### FIXED CODE ###
from math import sqrt
while 1 :
e = int(raw_inp... |
d=input()
a,b=map([d[:2],d[2:]])
temp=[]
for i in [a,b]:
if 1 <= i <=12:
temp.append(2)
elif 0 <= i <= 99:
temp.append(1)
else:
temp.append(0)
if sum(temp) == 4:
print('AMBIGUOUS')
elif sum(temp) == 3:
if temp[0]==2:
print('MMYY')
else:
print('YYMM')
else... | d=input()
a,b=map(int, [d[:2],d[2:]])
temp=[]
for i in [a,b]:
if 1 <= i <=12:
temp.append(2)
elif 0 <= i <= 99:
temp.append(1)
else:
temp.append(0)
if sum(temp) == 4:
print('AMBIGUOUS')
elif sum(temp) == 3:
if temp[0]==2:
print('MMYY')
else:
print('YYMM')... | d=input()
a,b=map([d[:2],d[2:]])
temp=[]
for i in [a,b]:
if 1 <= i <=12:
temp.append(2)
elif 0 <= i <= 99:
temp.append(1)
else:
temp.append(0)
if sum(temp) == 4:
print('AMBIGUOUS')
elif sum(temp) == 3:
if temp[0]==2:
print('MMYY')
else:
print('YYMM')
else... |
N, K = mapt(int, input().split())
print(N-K+1) | N, K = map(int, input().split())
print(N-K+1) | N, K = mapt(int, input().split())
print(N-K+1)
### FIXED CODE ###
N, K = map(int, input().split())
print(N-K+1) |
while True:
d = int(input())
ans = 0
x = d
while x < 600:
ans += (x**2)*dx += d
print(ans)
| while True:
try: d = int(input())
except: break
print(sum([(i*d)**2*d for i in range(600//d)]))
| while True:
d = int(input())
ans = 0
x = d
while x < 600:
ans += (x**2)*dx += d
print(ans)
### FIXED CODE ###
while True:
try: d = int(input())
except: break
print(sum([(i*d)**2*d for i in range(600//d)]))
|
n = raw_input()
n = int(n)
minv = raw_input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv | n = raw_input()
n = int(n)
minv = raw_input()
minv = int(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv | n = raw_input()
n = int(n)
minv = raw_input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv
### FIXED CODE ###
n = raw_input()
n = int(n)
minv = raw_input()
minv = i... |
# (c) midandfeed
import math
r = int(input())
print("{0:.6f} {0:.6f}".format( math.pi*(pow(r,2)), math.pi*(2*r) )) | # (c) midandfeed
import math
r = float(input())
area = math.pi * (pow(r,2))
circ = math.pi * 2 * r
print("{} {}".format(area, circ)) | # (c) midandfeed
import math
r = int(input())
print("{0:.6f} {0:.6f}".format( math.pi*(pow(r,2)), math.pi*(2*r) ))
### FIXED CODE ###
# (c) midandfeed
import math
r = float(input())
area = math.pi * (pow(r,2))
circ = math.pi * 2 * r
print("{} {}".format(area, circ)) |
x=(input())
print(x*x*x)
| x=int(input())
print(x*x*x)
| x=(input())
print(x*x*x)
### FIXED CODE ###
x=int(input())
print(x*x*x)
|
n,m=map(int,input().split())
lst=[]
for i in range(m):
P,Y=map(int,input().split())
lst.append([P,Y])
lst.sort(key=lambda x:(x[0],x[1]))
lst[0][1]=1
for j in range(m-1):
if lst[j][0]==lst[j+1][0]:
lst[j+1][1]=lst[j][1]+1
else:
lst[j+1][1]=1
def plus0(s):
while len(s)<6:
s='0'+s
for k in range(m):
... | n,m=map(int,input().split())
lst=[]
for i in range(m):
p,y=map(int,input().split())
lst.append([i,p,y])
lst.sort(key=lambda x:(x[1],x[2]))
j=1
Lst=[]
for i in range(m):
if lst[i][1]==lst[min(m-1,i+1)][1]:
s=str(lst[i][1])
t=str(j)
u=s.zfill(6)+t.zfill(6)
j+=1
Lst.append([lst[i][0],u])
else:
... | n,m=map(int,input().split())
lst=[]
for i in range(m):
P,Y=map(int,input().split())
lst.append([P,Y])
lst.sort(key=lambda x:(x[0],x[1]))
lst[0][1]=1
for j in range(m-1):
if lst[j][0]==lst[j+1][0]:
lst[j+1][1]=lst[j][1]+1
else:
lst[j+1][1]=1
def plus0(s):
while len(s)<6:
s='0'+s
for k in range(m):
... |
s=input()
n=0
for i in range(3):
if s[i]==s[i+1]:
n+=1
else:
n+=0
if n>0
print('Bad')
else:
print('Good') | s=input()
n=0
for i in range(3):
if s[i]==s[i+1]:
n+=1
else:
n+=0
if n>=1:
print('Bad')
else:
print('Good') | s=input()
n=0
for i in range(3):
if s[i]==s[i+1]:
n+=1
else:
n+=0
if n>0
print('Bad')
else:
print('Good')
### FIXED CODE ###
s=input()
n=0
for i in range(3):
if s[i]==s[i+1]:
n+=1
else:
n+=0
if n>=1:
print('Bad')
else:
print('Good') |
n = int(input())
x = input()
ones = 0
for i in x:
if i=='1':
ones += 1
mods = [0, 0]
for i in range(n):
if x[n-i-1]=='1':
if ones>0:
mods[0] += pow(2, i, ones-1)
if ones<n:
mods[1] += pow(2, i, ones+1)
mods[0] %= ones-1
mods[1] %= ones+1
def f(x):
if x==0:
... | n = int(input())
x = input()
ones = 0
for i in x:
if i=='1':
ones += 1
mods = [0, 0]
for i in range(n):
if x[n-i-1]=='1':
if ones>1:
mods[0] += pow(2, i, ones-1)
mods[1] += pow(2, i, ones+1)
if ones>1:
mods[0] %= ones-1
mods[1] %= ones+1
def f(x):
if x==0:
ret... | n = int(input())
x = input()
ones = 0
for i in x:
if i=='1':
ones += 1
mods = [0, 0]
for i in range(n):
if x[n-i-1]=='1':
if ones>0:
mods[0] += pow(2, i, ones-1)
if ones<n:
mods[1] += pow(2, i, ones+1)
mods[0] %= ones-1
mods[1] %= ones+1
def f(x):
if x==0:
... |
#!/usr/bin/env python3
A, B, N = map(int, input().split())
F12 = []
for i in range(1, B):
x = i
f1 = int(A*x/B)
f2 = A * int(x/B)
F12.append(f1-f2)
if N < B:
print(F12[N-1])
else:
print(F12[-1])
| #!/usr/bin/env python3
A, B, N = map(int, input().split())
f1 = 0
f2 = 0
if N >=B:
f1 = int(A*(B-1)/B)
f2 = A*int((B-1)/B)
else:
f1 = int(A*N/B)
f2 = A*int(N/B)
ans = f1-f2
print(ans)
| #!/usr/bin/env python3
A, B, N = map(int, input().split())
F12 = []
for i in range(1, B):
x = i
f1 = int(A*x/B)
f2 = A * int(x/B)
F12.append(f1-f2)
if N < B:
print(F12[N-1])
else:
print(F12[-1])
### FIXED CODE ###
#!/usr/bin/env python3
A, B, N = map(int, input().split())
f1 = 0
f2 = 0... |
def calc():
summ = sum(A)
#print(summ)
low = summ / (4*M)
#print(low)
newlist = [i for i in A if i >= low]
#print(newlist)
num = len(newlist)
#print(num)
if M <= num:
print ("Yes")
else:
print ("No")
N, M = map(int,input().split())
A = list(map(int, inpu... | #def calc():
#summ = sum(A)
#print(summ)
#low = summ / (4*M)
#print(low)
#newlist = [i for i in A if i >= low]
#print(newlist)
#num = len(newlist)
#print(num)
#if M <= num:
#print ("Yes")
#else:
#print ("No")
N, M = map(int,input().split())
A = list(map(... | def calc():
summ = sum(A)
#print(summ)
low = summ / (4*M)
#print(low)
newlist = [i for i in A if i >= low]
#print(newlist)
num = len(newlist)
#print(num)
if M <= num:
print ("Yes")
else:
print ("No")
N, M = map(int,input().split())
A = list(map(int, inpu... |
N = int(input())
lst = list(map(int, input().split()))
S = sum(lst)
ans = []
for i in range(2, N, 2):
S -= 2 *lst[i-1]
ans.append(S)
for i in range(1, N):
ans.append(2 * lst[i-1] - ans[i-1])
print("".join(ans)) | N = int(input())
lst = list(map(int, input().split()))
S = sum(lst)
ans = []
for i in range(2, N, 2):
S -= 2 *lst[i-1]
ans.append(S)
for i in range(1, N):
ans.append(2 * lst[i-1] - ans[i-1])
s = " ".join([str(n) for n in ans])
print(s) | N = int(input())
lst = list(map(int, input().split()))
S = sum(lst)
ans = []
for i in range(2, N, 2):
S -= 2 *lst[i-1]
ans.append(S)
for i in range(1, N):
ans.append(2 * lst[i-1] - ans[i-1])
print("".join(ans))
### FIXED CODE ###
N = int(input())
lst = list(map(int, input().split()))
S = sum(lst)
ans = []
f... |
N = int(input())
H = list(map(int,input().split()))
A = [0]*N
A[1] = abs(H[1] - H[0])
for i in range(2,N):
on = A[i-1] + abs(H[i] - H[i-1])
tw = A[i-2] + abs(H[i] - H[i-2])
A[i] = min(on , tw)
print(A[N])
| N = int(input())
H = list(map(int,input().split()))
A = [0]*N
A[1] = abs(H[1] - H[0])
for i in range(2,N):
on = A[i-1] + abs(H[i] - H[i-1])
tw = A[i-2] + abs(H[i] - H[i-2])
A[i] = min(on , tw)
print(A[N-1])
| N = int(input())
H = list(map(int,input().split()))
A = [0]*N
A[1] = abs(H[1] - H[0])
for i in range(2,N):
on = A[i-1] + abs(H[i] - H[i-1])
tw = A[i-2] + abs(H[i] - H[i-2])
A[i] = min(on , tw)
print(A[N])
### FIXED CODE ###
N = int(input())
H = list(map(int,input().split()))
A = [0]*N
A[1] = abs(H[1] - H[0... |
n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loopstart = memo.index(p)
if k < len(alist):
print(memo[k])
else:
print(memo[loopstart+(k-loopstart)%(len(memo)-loopstart)])
| n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loop = memo.index(p)
if k < len(memo):
print(memo[k])
else:
print(memo[loop+(k-loop)%(len(memo)-loop)])
| n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loopstart = memo.index(p)
if k < len(alist):
print(memo[k])
else:
print(memo[loopstart+(k-loopstart)%(len(memo)-loopstart)])
##... |
K = int(input())
A = [int(i) for i in input().split()]
Max, Min = 0, 0
error = -1
def N_max(a, Max, Min):
if Max > a and Min%a != 0:
return a*(Min//a + 2) - 1
elif Max > a and Min%a == 0:
return a*(Min//a + 1) - 1
else:
return a*2 -1
def N_min(a, m):
if m > a:
... | N, A, B = [int(i) for i in input().split()]
print("Alice") if (A-B)%2 == 0 else print("Borys") | K = int(input())
A = [int(i) for i in input().split()]
Max, Min = 0, 0
error = -1
def N_max(a, Max, Min):
if Max > a and Min%a != 0:
return a*(Min//a + 2) - 1
elif Max > a and Min%a == 0:
return a*(Min//a + 1) - 1
else:
return a*2 -1
def N_min(a, m):
if m > a:
... |
s = raw_input()
t = raw_input()
if sorted(*s) < sorted(*t, reverse=True):
print 'Yes'
else:
print 'No' | s = raw_input()
t = raw_input()
if sorted(s) < sorted(t, reverse=True):
print 'Yes'
else:
print 'No'
| s = raw_input()
t = raw_input()
if sorted(*s) < sorted(*t, reverse=True):
print 'Yes'
else:
print 'No'
### FIXED CODE ###
s = raw_input()
t = raw_input()
if sorted(s) < sorted(t, reverse=True):
print 'Yes'
else:
print 'No'
|
N = int(input())
A = [int(x) for x in input().split()]
d = dict()
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
if len(d) > 3:
print('No')
else:
k = list(d.keys())
v = list(d.values())
# a1 ^ a2 ^ a3 = 0 and an: N/3
if len(d) == 3 and k[0]^k[1]^k[2] == 0 and v[0]==v[1]==v[2]:
p... | from collections import Counter
N = int(input())
A = [int(x) for x in input().split()]
d = Counter(A)
if len(d) > 3:
print('No')
else:
k = list(d.keys())
v = list(d.values())
# a1 ^ a2 ^ a3 = 0 and an: N/3
if len(d) == 3 and k[0]^k[1]^k[2] == 0 and v[0]==v[1]==v[2]:
print('Yes')
... | N = int(input())
A = [int(x) for x in input().split()]
d = dict()
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
if len(d) > 3:
print('No')
else:
k = list(d.keys())
v = list(d.values())
# a1 ^ a2 ^ a3 = 0 and an: N/3
if len(d) == 3 and k[0]^k[1]^k[2] == 0 and v[0]==v[1]==v[2]:
p... |
a, b = map(int, input().split())
if (a % 2 != 0) and (b % 2 != 0):
return "Odd"
else:
return "Een" | a, b = map(int, input().split())
if (a % 2 != 0) and (b % 2 != 0):
print("Odd")
else:
print("Even") | a, b = map(int, input().split())
if (a % 2 != 0) and (b % 2 != 0):
return "Odd"
else:
return "Een"
### FIXED CODE ###
a, b = map(int, input().split())
if (a % 2 != 0) and (b % 2 != 0):
print("Odd")
else:
print("Even") |
s = input()
newS = ""
for i in range(len(s)):
if s[i]=="?" and len(s)!= 1 and i==0 and s[i+1]=="D":
newS+="P"
elif len(s)&1 and i==len(s)-1 and s[i]=="?":
newS+="D"
elif s[i]=="?":
if i!=0 and i!=len(s)-1:
if newS[i-1]=="P":
newS+="D"
elif new... | s = input()
newS = ""
for i in range(len(s)):
if s[i]=="?":
newS+="D"
else:
newS+=s[i]
print(newS)
| s = input()
newS = ""
for i in range(len(s)):
if s[i]=="?" and len(s)!= 1 and i==0 and s[i+1]=="D":
newS+="P"
elif len(s)&1 and i==len(s)-1 and s[i]=="?":
newS+="D"
elif s[i]=="?":
if i!=0 and i!=len(s)-1:
if newS[i-1]=="P":
newS+="D"
elif new... |
R,G,B,N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range(tmp//G+1):
check = (tmp - R*r - G*g)
if check%B == 0 and check > 0:
ans += 1
print(ans) | R,G,B,N = list(map(int, input().split()))
ans=0
for r in range(N//R+1):
x = N-R*r
for g in range(x//G+1):
if (x-G*g)%B==0:
ans+=1
print(ans) | R,G,B,N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range(tmp//G+1):
check = (tmp - R*r - G*g)
if check%B == 0 and check > 0:
ans += 1
print(ans)
### FIXED CODE ###
R,G,B,N = list(map(int, input().split()))
ans=0
for r in range(N//R+1):
x = N-R*r
... |
def compress(set_):
"""座標圧縮した辞書を返す"""
array2 = sorted(list(set_))
memo = {value: index for index, value in enumerate(array2)}
return memo
def calc_s(hi, wj):
"""座標圧縮後の範囲hi <= i < hi + 1, wj <= j < wj + 1について、
座標圧縮前の面積を求める
"""
res = (h_rests[hi] - h_rests[hi + 1]) * (w_rests[wj] - w_rest... | import sys
input = sys.stdin.readline
def compress(set_):
"""座標圧縮した辞書を返す"""
array2 = sorted(list(set_))
memo = {value: index for index, value in enumerate(array2)}
return memo
def calc_s(hi, wj):
"""座標圧縮後の範囲hi <= i < hi - 1, wj <= j < wj + 1について、
座標圧縮前の面積を求める
"""
res = abs(h_rests[hi... | def compress(set_):
"""座標圧縮した辞書を返す"""
array2 = sorted(list(set_))
memo = {value: index for index, value in enumerate(array2)}
return memo
def calc_s(hi, wj):
"""座標圧縮後の範囲hi <= i < hi + 1, wj <= j < wj + 1について、
座標圧縮前の面積を求める
"""
res = (h_rests[hi] - h_rests[hi + 1]) * (w_rests[wj] - w_rest... |
x,a,b = map(int, input().split())
if x-a!=0:
print(0)
else:
print((x-a)%b)
| x = int(input())
a = int(input())
b = int(input())
if x-a==0:
print(0)
else:
print((x-a)%b)
| x,a,b = map(int, input().split())
if x-a!=0:
print(0)
else:
print((x-a)%b)
### FIXED CODE ###
x = int(input())
a = int(input())
b = int(input())
if x-a==0:
print(0)
else:
print((x-a)%b)
|
from decimal import *
getcontext().prec = 28
n, k = map(int,input().split())
a = list(map(int,input().split()))
inner = Decimal(0)
outer = Decimal(0)
for i in range(0,n):
for j in range(0,n):
if a[i] > a[j]:
outer += 1
if i < j:
inner += 1
b = (Decimal(Decimal(inner... | m, d = map(int,input().split())
ans = 0
for i in range(1,m+1):
for j in range(1, d + 1):
if i == int(j/10)*int(j%10) and int(j%10) >= 2 and int(j/10) >= 2:
ans += 1
print(ans) |
from decimal import *
getcontext().prec = 28
n, k = map(int,input().split())
a = list(map(int,input().split()))
inner = Decimal(0)
outer = Decimal(0)
for i in range(0,n):
for j in range(0,n):
if a[i] > a[j]:
outer += 1
if i < j:
inner += 1
b = (Decimal(Decimal(inner... |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7
N = 10**4
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
... | n, k = map(int,input().split())
m = n - k + 1
def nCr(l,r,mod):
if (r<0 or r>l):
return 0
r = min(r,l-r)
return g1[l] * g2[r] * g2[l-r] % mod
mod = 10**9 + 7
N = 10**5
g1 = [1,1]
g2 = [1,1]
inverse = [0,1]
for i in range(2,N+1):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[m... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7
N = 10**4
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
... |
# -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 22:03:19 2020
@author: liang
"""
N, X, M = map(int,input().split())
mod_set = {X}
mod_lis = [X]
A = [0]*(10**5+1)
A[0] = X
for i in range(1,N):
tmp = A[i-1]**2%M
if tmp in mod_set:
break
A[i] = tmp
mod_set.add(tmp)
mod_lis.append(tmp)
j = ... | # -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 22:58:03 2020
@author: liang
"""
N,X,M=map(int,input().split())
a = X
hist = [a]
indices = [-1]*M
indices[a] = 0
flag=0
for i in range(1,min(10**6,N)):
a = a**2 % M
if indices[a] != -1:
idx = indices[a]
flag=1
break
hist.append(a)
indices[a] = i
... | # -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 22:03:19 2020
@author: liang
"""
N, X, M = map(int,input().split())
mod_set = {X}
mod_lis = [X]
A = [0]*(10**5+1)
A[0] = X
for i in range(1,N):
tmp = A[i-1]**2%M
if tmp in mod_set:
break
A[i] = tmp
mod_set.add(tmp)
mod_lis.append(tmp)
j = ... |
from collections import deque
mod=10**9+7
N,M=map(int,input().split())
dp=[1,1]
a=deque()
for i in range(M):
a.append(int(input()))
if a[0]==1:
dp[1]=0
a.popleft()
for i in range(2,N+1):
if len(a)>0 and i==a[0]:
dp.append(0)
a.popleft()
else:
dp.append((dp[-1]+dp[-2])%mod)
... | mod=10**9+7
N,M=map(int,input().split())
a=[int(input()) for _ in range(M)]
dp=[1,1]
m=0
if M>0 and a[0]==1:
dp[1]=0
m+=1
for i in range(2,N+1):
if m<M and i==a[m]:
dp.append(0)
m+=1
else:
dp.append((dp[-1]+dp[-2])%mod)
print(dp[-1]) | from collections import deque
mod=10**9+7
N,M=map(int,input().split())
dp=[1,1]
a=deque()
for i in range(M):
a.append(int(input()))
if a[0]==1:
dp[1]=0
a.popleft()
for i in range(2,N+1):
if len(a)>0 and i==a[0]:
dp.append(0)
a.popleft()
else:
dp.append((dp[-1]+dp[-2])%mod)
... |
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
MODN = (10 ** 9) + 7
INF = 10 ** 10
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
def combinations_count(n, r):
return math.factorial(n) // (mat... | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
MOD = (10 ** 9) + 7
INF = 10 ** 10
MAX = 510000
def com_init():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i - 1] *... | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
MODN = (10 ** 9) + 7
INF = 10 ** 10
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
def combinations_count(n, r):
return math.factorial(n) // (mat... |
input1 = input().rstrip().split(" ")
h = input().rstrip().split(" ")
yoi = [1 for i in range(int(input1[0]))]
root = [input().rstrip().split(" ") for i in range(int(input1[1]))]
print(int(root[0][1]))
for i in range(int(input1[1])):
a=int(root[i][0])-1
b=int(root[i][1])-1
if h[a]> h[b]:
yoi[b] = 0
... | # coding: utf-8
# Your code here!
input1 = input().rstrip()
if input1=="ABC":
print("ARC")
elif input1=="ARC":
print("ABC")
else:
print(0) | input1 = input().rstrip().split(" ")
h = input().rstrip().split(" ")
yoi = [1 for i in range(int(input1[0]))]
root = [input().rstrip().split(" ") for i in range(int(input1[1]))]
print(int(root[0][1]))
for i in range(int(input1[1])):
a=int(root[i][0])-1
b=int(root[i][1])-1
if h[a]> h[b]:
yoi[b] = 0
... |
N, M = map(int, input().split())
mod = 10**9 + 7
if abs(N - M) > 1:
print(0)
elif abs(N - M) == 0:
ans = mod_factorial(N, mod) * mod_factorial(M, mod) * 2
print(ans % mod)
else:
ans = mod_factorial(N, mod) * mod_factorial(M, mod)
print(ans % mod)
def mod_factorial(a, mod):
ans = 1
while a !=... | N, M = map(int, input().split())
def mod_factorial(a, mod):
ans = 1
while a != 1:
ans *= a
ans = ans % mod
a -= 1
return ans
mod = 10**9 + 7
if abs(N - M) > 1:
print(0)
elif abs(N - M) == 0:
ans = mod_factorial(N, mod) * mod_factorial(M, mod) * 2
print(ans % mod)
else:
... | N, M = map(int, input().split())
mod = 10**9 + 7
if abs(N - M) > 1:
print(0)
elif abs(N - M) == 0:
ans = mod_factorial(N, mod) * mod_factorial(M, mod) * 2
print(ans % mod)
else:
ans = mod_factorial(N, mod) * mod_factorial(M, mod)
print(ans % mod)
def mod_factorial(a, mod):
ans = 1
while a !=... |
n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
index = int(input())
ar[index] += 1
for i in range(n):
if ar[i] - q > 0:
print("Yes")
else:
print("No") | n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
index = int(input())
ar[index-1] += 1
for i in range(n):
if ar[i] - q > 0:
print("Yes")
else:
print("No")
| n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
index = int(input())
ar[index] += 1
for i in range(n):
if ar[i] - q > 0:
print("Yes")
else:
print("No")
### FIXED CODE ###
n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
index = int(i... |
class Dice:
def __init__(self):
self.omote=1
self.sita=2
self.migi=3
self.ue=5
self.hidari=4
self.ura=6
def North(self):
self.omote,self.ue,self.ura,self.sita=self.sita,self.omote,self.ue,self.ura
def East(self):
self.omote,self.hidari,self.u... | class Dice:
def __init__(self):
self.omote=1
self.sita=2
self.migi=3
self.ue=5
self.hidari=4
self.ura=6
def North(self):
self.omote,self.ue,self.ura,self.sita=self.sita,self.omote,self.ue,self.ura
def East(self):
self.omote,self.hidari,self.u... | class Dice:
def __init__(self):
self.omote=1
self.sita=2
self.migi=3
self.ue=5
self.hidari=4
self.ura=6
def North(self):
self.omote,self.ue,self.ura,self.sita=self.sita,self.omote,self.ue,self.ura
def East(self):
self.omote,self.hidari,self.u... |
import numpy as np
N, M = map(int, input().split())
A = np.zeros((N,M))
for i in range(N):
a = list(map(int, input().split()))
A[i, 0:len(a)] = a
A = A[(A != 0) & (A < M)]
len(np.unique(A)) | import numpy as np
N, M = map(int, input().split())
A = np.zeros((N,M))
for i in range(N):
a = list(map(int, input().split()))
a = a[1:]
A[i, 0:len(a)] = a
for i in range(N):
a = A[i]
a = a[(a != 0) & (a <= M)]
if i == 0:
s = set(list(a))
else:
_s = set(list(a))
s &... | import numpy as np
N, M = map(int, input().split())
A = np.zeros((N,M))
for i in range(N):
a = list(map(int, input().split()))
A[i, 0:len(a)] = a
A = A[(A != 0) & (A < M)]
len(np.unique(A))
### FIXED CODE ###
import numpy as np
N, M = map(int, input().split())
A = np.zeros((N,M))
for i in range(N):
a =... |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
odd = a[0::2]
even = a[1::2]
if n % 2 == 0:
print(*even[::-1], *odd)
else:
print(*odd[::-1], *e... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
odd = a[0::2]
even = a[1::2]
if n % 2 == 0:
res = even[::-1] + odd
print(*res)
else:
re... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
odd = a[0::2]
even = a[1::2]
if n % 2 == 0:
print(*even[::-1], *odd)
else:
print(*odd[::-1], *e... |
import sys
# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
# from numba import jit
# from scipy import
# import numpy as np
# ... | import sys
readline = sys.stdin.readline
MOD = 998244353
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, s = map(int, readline().split())
a = list(map(int, readline().split()))
dp = [[0] * (s + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
cur = a[i]
... | import sys
# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
# from numba import jit
# from scipy import
# import numpy as np
# ... |
N,M = map(int,input().split())
Output = [0] * N
num = ""
for i in range(M):
s,c = map(int,input().split())
if(Output[s-1]==0 or Output[s-1]>c):
Output[s-1] = c
if(c==0):
print(-1)
if(Output[0]==0):
print(-1)
else:
for i in Output:
if(i>9):
print(-1)
num ... | N = int(input())
if N % 2 == 0:
print(N//2)
else:
print(N//2+1) | N,M = map(int,input().split())
Output = [0] * N
num = ""
for i in range(M):
s,c = map(int,input().split())
if(Output[s-1]==0 or Output[s-1]>c):
Output[s-1] = c
if(c==0):
print(-1)
if(Output[0]==0):
print(-1)
else:
for i in Output:
if(i>9):
print(-1)
num ... |
a=input()
b=input()
c=input()
if a<c and b>c :
print("Yes")
elif a>c and b<c :
print("Yes")
else:
print("No) | x=input().split()
z=[int(v) for v in x]
if z[0]<z[2] and z[1]>z[2] :
print("Yes")
elif z[0]>z[2] and z[1]<z[2] :
print("Yes")
else:
print("No")
| a=input()
b=input()
c=input()
if a<c and b>c :
print("Yes")
elif a>c and b<c :
print("Yes")
else:
print("No)
### FIXED CODE ###
x=input().split()
z=[int(v) for v in x]
if z[0]<z[2] and z[1]>z[2] :
print("Yes")
elif z[0]>z[2] and z[1]<z[2] :
print("Yes")
else:
print("No")
|
k=int(input())
x=int(input())
if 500*k >= x:
print("'Yes'")
else:
print("'No'") | k,x=map(int,input().split())
if 500*k >= x:
print("Yes")
else:
print("No") | k=int(input())
x=int(input())
if 500*k >= x:
print("'Yes'")
else:
print("'No'")
### FIXED CODE ###
k,x=map(int,input().split())
if 500*k >= x:
print("Yes")
else:
print("No") |
a, b = map(int, input().split())
c = a + b
if c%2 == 1 :
priint('Odd')
else :
print('Even')
| a, b = map(int, input().split())
c = a * b
if c%2 == 1 :
print('Odd')
else :
print('Even') | a, b = map(int, input().split())
c = a + b
if c%2 == 1 :
priint('Odd')
else :
print('Even')
### FIXED CODE ###
a, b = map(int, input().split())
c = a * b
if c%2 == 1 :
print('Odd')
else :
print('Even') |
import itertools
N = int(input())
print(sum([1 for i,j,k in itertools.product(range(1,N+1),range(1,N+1),range(1,N+1))])) | print(int(input())**3) | import itertools
N = int(input())
print(sum([1 for i,j,k in itertools.product(range(1,N+1),range(1,N+1),range(1,N+1))]))
### FIXED CODE ###
print(int(input())**3) |
import sys
s=int(input())
k=int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
elif i == k - 1:
break
| import sys
s=input()
k=int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
elif i == k - 1:
print(1)
break | import sys
s=int(input())
k=int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
elif i == k - 1:
break
### FIXED CODE ###
import sys
s=input()
k=int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
elif i == k - 1:
print(1)
br... |
# -*- coding: utf-8 -*-
n=raw_input()
k=raw_input()
inans=int(n)
ikans=int(k)
ans=inans%ikans
if ans==0:
print"0"
else:
print"1"
| # -*- coding: utf-8 -*-
n=raw_input().split()
ina=int(n[0])
ika=int(n[1])
ans=ina%ika
if ans==0:
print"0"
else:
print"1"
| # -*- coding: utf-8 -*-
n=raw_input()
k=raw_input()
inans=int(n)
ikans=int(k)
ans=inans%ikans
if ans==0:
print"0"
else:
print"1"
### FIXED CODE ###
# -*- coding: utf-8 -*-
n=raw_input().split()
ina=int(n[0])
ika=int(n[1])
ans=ina%ika
if ans==0:
print"0"
else:
print"1"
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from s... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, atan, degrees
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from s... |
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
x=[]
for i in range(m):
b,c=map(int,input().split())
x.append([b,c])
y=sorted(x,key=lambda x:(x[1],x[0]),reverse=True)
d=[]
for i in range(m):
d.extend([y[i][1]]*y[i][0])
for i in range(n):
if d[i]>a[i]:
a[i]=d[i]
else:... | n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
x=[]
for i in range(m):
b,c=map(int,input().split())
x.append([b,c])
y=sorted(x,key=lambda x:(x[1],x[0]),reverse=True)
p=0
q=0
for i in range(n):
if a[i]<y[p][1]:
a[i]=y[p][1]
q+=1
else:
break
if q==y[p][... | n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
x=[]
for i in range(m):
b,c=map(int,input().split())
x.append([b,c])
y=sorted(x,key=lambda x:(x[1],x[0]),reverse=True)
d=[]
for i in range(m):
d.extend([y[i][1]]*y[i][0])
for i in range(n):
if d[i]>a[i]:
a[i]=d[i]
else:... |
import math
a = int(input())
b = int(input())
x = (b)/(a-1)
print(math.ceil(x)) | import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1))) | import math
a = int(input())
b = int(input())
x = (b)/(a-1)
print(math.ceil(x))
### FIXED CODE ###
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1))) |
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = []
for i in range(1, m+1) :
if a[i] < sum(a) / (4 * m) :
continue
else :
ans.append(a[-1])
if len(ans) == m :
print('Yes')
else :
print('No') | n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = []
for i in range(m) :
if a[i] < sum(a) / (4 * m) :
continue
else :
ans.append(a[-1])
if len(ans) == m :
print('Yes')
else :
print('No') | n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = []
for i in range(1, m+1) :
if a[i] < sum(a) / (4 * m) :
continue
else :
ans.append(a[-1])
if len(ans) == m :
print('Yes')
else :
print('No')
### FIXED CODE ###
n, m = map(int, input().split())
a = list(ma... |
a,b =map(int,input().split(' ')
if a + b == 15:
print('+')
elif a ＊ b == 15:
print('＊')
else:
print('x') | a,b = map(int,input().split(' '))
if a + b == 15:
print('+')
elif a * b == 15:
print('*')
else:
print('x')
| a,b =map(int,input().split(' ')
if a + b == 15:
print('+')
elif a ＊ b == 15:
print('＊')
else:
print('x')
### FIXED CODE ###
a,b = map(int,input().split(' '))
if a + b == 15:
print('+')
elif a * b == 15:
print('*')
else:
print('x')
|
a = int(input())
b = int(input())
if b > 1:
c = 1
for i in range(1,21):
c = c + (a - 1)
if c >= b:
print(i)
break
else:
print(0) | a, b = map(int, input().split())
if b > 1:
c = 1
for i in range(1,21):
c = c + (a - 1)
if c >= b:
print(i)
break
else:
print(0) | a = int(input())
b = int(input())
if b > 1:
c = 1
for i in range(1,21):
c = c + (a - 1)
if c >= b:
print(i)
break
else:
print(0)
### FIXED CODE ###
a, b = map(int, input().split())
if b > 1:
c = 1
for i in range(1,21):
c = c + (a - 1)
if c ... |
a = input().split()
num = 3
if a[0] == a[1]:
num = num - 1
if a[0] == a[2]:
num = num - 1:
elif a[0] == a[2]:
num = num - 1
elif a[1] == a[2]:
num = num - 1
print(num) | a = input().split()
num = 3
if a[0] == a[1]:
num = num - 1
if a[0] == a[2]:
num = num - 1
elif a[0] == a[2]:
num = num - 1
elif a[1] == a[2]:
num = num - 1
print(num) | a = input().split()
num = 3
if a[0] == a[1]:
num = num - 1
if a[0] == a[2]:
num = num - 1:
elif a[0] == a[2]:
num = num - 1
elif a[1] == a[2]:
num = num - 1
print(num)
### FIXED CODE ###
a = input().split()
num = 3
if a[0] == a[1]:
num = num - 1
if a[0] == a[2]:
num = nu... |
from functools import lru_cache
from tqdm import tqdm
S=input()
count=[0 for i in range(2019)]
length=len(S)
#S=int(S)
S=S+'0'
S=S[::-1]
_S=0
base=1
for i,s in enumerate(S):
_S=base*int(s)+_S
count[_S%2019]+=1
base*=10
base=base%2019
_S=_S%2019
retval=0
for key in range(2019):
retval+=cou... | from functools import lru_cache
S=input()
count=[0 for i in range(2019)]
length=len(S)
#S=int(S)
S=S+'0'
S=S[::-1]
_S=0
base=1
for i,s in enumerate(S):
_S=base*int(s)+_S
count[_S%2019]+=1
base*=10
base=base%2019
_S=_S%2019
retval=0
for key in range(2019):
retval+=count[key]*(count[key]-1)... | from functools import lru_cache
from tqdm import tqdm
S=input()
count=[0 for i in range(2019)]
length=len(S)
#S=int(S)
S=S+'0'
S=S[::-1]
_S=0
base=1
for i,s in enumerate(S):
_S=base*int(s)+_S
count[_S%2019]+=1
base*=10
base=base%2019
_S=_S%2019
retval=0
for key in range(2019):
retval+=cou... |
import numpy as np
from scipy.sparse.csgraph import dijkstra
from scipy.sparse import csr_matrix
n, m = map(int, input().split())
F = [set() for _ in range(n)]
G = np.zeros((n, n))
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
F[u].add(v)
for i in range(n):
for j in F[i]:
for k in F[j... | from collections import deque
n, m = map(int, input().split())
F = [set() for _ in range(3*n)]
for _ in range(m):
u, v = map(int, input().split())
u = (u-1)*3
v = (v-1)*3
F[u].add(v+1)
F[u+1].add(v+2)
F[u+2].add(v)
s, t = map(int, input().split())
s = (s-1)*3
t = (t-1)*3
dist = [-1]*(3*n)
dist[s] = 0
dq = ... | import numpy as np
from scipy.sparse.csgraph import dijkstra
from scipy.sparse import csr_matrix
n, m = map(int, input().split())
F = [set() for _ in range(n)]
G = np.zeros((n, n))
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
F[u].add(v)
for i in range(n):
for j in F[i]:
for k in F[j... |
i=0
a,b,c = map(int,input().split())
for x in range(a+1,b)
if c % x == 0: i+=1
print(i)
| i=0
a,b,c = map(int,input().split())
for x in range(a,b+1):
if c % x == 0: i+=1
print(i)
| i=0
a,b,c = map(int,input().split())
for x in range(a+1,b)
if c % x == 0: i+=1
print(i)
### FIXED CODE ###
i=0
a,b,c = map(int,input().split())
for x in range(a,b+1):
if c % x == 0: i+=1
print(i)
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static class Point {
double x;
double y;
public Point(double x, double y) {
this.x = x;
this.y = y;
}
public String toString() {
return String.format("%.8f %.8f", x, y);
}
}
publi... | import math
class Point:
def __init__(self,x,y):
self.x=x
self.y=y
def __str__(self):
return str(self.x)+' '+str(self.y)
def koch(n,a,b):
if n==0: return
s=Point(0,0)
t=Point(0,0)
u=Point(0,0)
th=math.pi*60/180
s.x=(2*a.x+1*b.x)/3
s.y=(2*a.y+1*b.y)/3
t.x=(1*a.x+2*b.x)/3
t.y=(1*a.y+2*b.y)/3
u.x=(t.x-... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static class Point {
double x;
double y;
public Point(double x, double y) {
this.x = x;
this.y = y;
}
public String toString() {
return String.format("%.8f %.8f", x, y);
}
}
publi... |
import math
x, y = map(int, input().split())
mod = 10 ** 9 + 7
a = (2 * y - x) / 3
b = (2 * x - y) / 3
if (not a.is_integer()) or (not b.is_integer()):
print(0)
else:
a, b = int(a), int(b)
I = [1] * (a + b + 1)
for n in range(1, a+b+1):
I[n] = I[n-1] * n
I[n] %= mod
i, j, k = I[a+b... | import math
x, y = map(int, input().split())
mod = 10 ** 9 + 7
a = (2 * y - x) / 3
b = (2 * x - y) / 3
if (not a.is_integer()) or (not b.is_integer()) or \
(a < 0) or (b < 0):
print(0)
else:
a, b = int(a), int(b)
I = [1] * (a + b + 1)
for n in range(1, a+b+1):
I[n] = I[n-1] * n
I[n... | import math
x, y = map(int, input().split())
mod = 10 ** 9 + 7
a = (2 * y - x) / 3
b = (2 * x - y) / 3
if (not a.is_integer()) or (not b.is_integer()):
print(0)
else:
a, b = int(a), int(b)
I = [1] * (a + b + 1)
for n in range(1, a+b+1):
I[n] = I[n-1] * n
I[n] %= mod
i, j, k = I[a+b... |
N = input()
print(N*N*N) | n = int(input())
print(n*n*n) | N = input()
print(N*N*N)
### FIXED CODE ###
n = int(input())
print(n*n*n) |
#C
K=int(input())
if K==1:
ans=1
elif K==2 or K==5 or K==10:
ans=-1
else:
p=0
for i in range(1,K+2):
p = (p*10+7)%K
#print(i,p)
if p==0:
ans=i
break
print(ans) | #C
K=int(input())
ans=-1
if K==1:
ans=1
elif K==2 or K==5 or K==10:
ans=-1
else:
p=0
for i in range(1,K+1):
p = (p*10+7)%K
#print(i,p)
if p==0:
ans=i
break
print(ans) | #C
K=int(input())
if K==1:
ans=1
elif K==2 or K==5 or K==10:
ans=-1
else:
p=0
for i in range(1,K+2):
p = (p*10+7)%K
#print(i,p)
if p==0:
ans=i
break
print(ans)
### FIXED CODE ###
#C
K=int(input())
ans=-1
if K==1:
ans=1
elif K==2 or K==5 or K==10:... |
A,B,C = map(int,input().split())
if B >= A and B >= C:
print(B*10+C+A)
if C >= A and C >= B:
print(C*10+A+B)
if A >= B and A >= C:
print(A:10+B+C) | L = list(map(int,input().split()))
L.sort(reverse = True)
print(L[0]*10+L[1]+L[2]) | A,B,C = map(int,input().split())
if B >= A and B >= C:
print(B*10+C+A)
if C >= A and C >= B:
print(C*10+A+B)
if A >= B and A >= C:
print(A:10+B+C)
### FIXED CODE ###
L = list(map(int,input().split()))
L.sort(reverse = True)
print(L[0]*10+L[1]+L[2]) |
S = input()
T = input()
ans = 0
for i in range(len(S)):
tmp = 0
for j in range(len(T)):
if S[i + j] == T[j]:
tmp += 1
ans = max(ans, tmp)
print(len(T) - ans)
| S = input()
T = input()
ans = 0
for i in range(len(S) - len(T) + 1):
tmp = 0
for j in range(len(T)):
if S[i + j] == T[j]:
tmp += 1
ans = max(ans, tmp)
print(len(T) - ans)
| S = input()
T = input()
ans = 0
for i in range(len(S)):
tmp = 0
for j in range(len(T)):
if S[i + j] == T[j]:
tmp += 1
ans = max(ans, tmp)
print(len(T) - ans)
### FIXED CODE ###
S = input()
T = input()
ans = 0
for i in range(len(S) - len(T) + 1):
tmp = 0
for j in range(len(T)):
if S[i + ... |
def sol():
n,m=map(int,input().split())
w={}
p,q=set(),set()
for i in range(m):
l,r,d=[int(i) for i in input().split()]
if l in w:
w[l].add((r,d))
else:
w[l]={(r,d)}
p.add(l)
q.add(r)
s=p-q
for i in s:
k={j for j in w[i]}
... | def sol():
n,m=map(int,input().split())
t,w={},{}
p,q=set(),set()
for i in range(m):
l,r,d=[int(i) for i in input().split()]
if l in w: w[l].add((r,d))
else: w[l]={(r,d)}
p.add(l)
q.add(r)
s=p-q
chk=set()
if len(s)==0:
print(["No","Yes"][m==0])... | def sol():
n,m=map(int,input().split())
w={}
p,q=set(),set()
for i in range(m):
l,r,d=[int(i) for i in input().split()]
if l in w:
w[l].add((r,d))
else:
w[l]={(r,d)}
p.add(l)
q.add(r)
s=p-q
for i in s:
k={j for j in w[i]}
... |
w = [str(input()) for i in range(5)]
num = ['0','9','8','7','6','5','4','3','2','1']
w1 = []
m = 0
t = 0
for h in w:
for j in num:
if h[-1] == j:
w1.append(int(h)+num.index(j))
if m < num.index(j):
m = num.index(j)
k = w.index(h)
for l in range(5):
... | w = [str(input()) for i in range(5)]
num = ['0','9','8','7','6','5','4','3','2','1']
w1 = []
m = 0
t = 0
for h in w:
for j in num:
if h[-1] == j:
w1.append(int(h)+num.index(j))
if m <= num.index(j):
m = num.index(j)
k = w.index(h)
for l in range(5):
... | w = [str(input()) for i in range(5)]
num = ['0','9','8','7','6','5','4','3','2','1']
w1 = []
m = 0
t = 0
for h in w:
for j in num:
if h[-1] == j:
w1.append(int(h)+num.index(j))
if m < num.index(j):
m = num.index(j)
k = w.index(h)
for l in range(5):
... |
import sys
N, X, M = map(int, input().split())
if(M == 0):
print(0)
sys.exit()
rec = []
s = set()
rec.append(X)
s.add(X)
r = X
for i in range(N):
r = (r**2)%M
if(r not in s):
rec.append(r)
s.add(r)
else:
rec.append(r)
idx = i+1
break
for i in range(le... | N, X, M = map(int, input().split())
rec = []
s = set()
rec.append(X)
s.add(X)
r = X
idx = -1
idx1 = -1
for i in range(N+1):
r = (r**2)%M
if(r not in s):
rec.append(r)
s.add(r)
else:
rec.append(r)
idx = i+1
break
for i in range(len(rec)):
if(rec[i] == rec[idx... | import sys
N, X, M = map(int, input().split())
if(M == 0):
print(0)
sys.exit()
rec = []
s = set()
rec.append(X)
s.add(X)
r = X
for i in range(N):
r = (r**2)%M
if(r not in s):
rec.append(r)
s.add(r)
else:
rec.append(r)
idx = i+1
break
for i in range(le... |
from collections import deque
n = int(input())
q = deque()
for i in range(n):
cmd = input().strip()
if cmd == 'deleteFirst':
q.popleft()
continue
if cmd == 'deleteLast':
q.pop()
continue
cmd, x = cmd.split()
if cmd == 'insert':
q.appendleft(x)
contin... | import sys
from collections import deque
n = int(sys.stdin.readline())
q = deque()
for i in range(n):
cmd = sys.stdin.readline()[:-1]
if cmd[0] == 'i':
q.appendleft(cmd[7:])
elif cmd[6] == ' ':
try:
q.remove(cmd[7:])
except:
pass
elif cmd[6] == 'F':
... | from collections import deque
n = int(input())
q = deque()
for i in range(n):
cmd = input().strip()
if cmd == 'deleteFirst':
q.popleft()
continue
if cmd == 'deleteLast':
q.pop()
continue
cmd, x = cmd.split()
if cmd == 'insert':
q.appendleft(x)
contin... |
def resolve():
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
dp = [-1] * (n + 1)
for i in a:
dp[i] = 0
print(i_step(n, a, dp) % 1000000007)
# i段目にたどり着くまでの移動方法の総数
def i_step(i, a, dp):
if i < 0:
return 0
if i == 0:
return 1
ret = 0
... | def step(n):
if n == 0:
return 1
steps = [0 for i in range(n + 2)]
steps[1] = 1
steps[2] = 2
for i in range(3, n + 1):
steps[i] = steps[i - 1] + steps[i - 2]
return steps[n]
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
a.append(n)
sum = 1
for i in range(m + 1):
if i... | def resolve():
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
dp = [-1] * (n + 1)
for i in a:
dp[i] = 0
print(i_step(n, a, dp) % 1000000007)
# i段目にたどり着くまでの移動方法の総数
def i_step(i, a, dp):
if i < 0:
return 0
if i == 0:
return 1
ret = 0
... |
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in d.items() if v == m]
keys.sort()
for i in keys:
print(i) | n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in c.items() if v == m]
keys.sort()
for i in keys:
print(i) | n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in d.items() if v == m]
keys.sort()
for i in keys:
print(i)
### FIXED CODE ###
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter... |
# -*- coding: utf-8 -*-
"""
再帰
"""
import sys
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
N, X = map(int, input().split())
def dfs(cur, L):
if L == N:
return cur
return dfs('B' + cur + 'P' + cur + 'B', L + 1)
burger = dfs('P', 0)
print(burger[:X].count('P'))
| # -*- coding: utf-8 -*-
"""
解説参考
・必要な値を出してから再帰で場合分け
"""
N, X = map(int, input().split())
# まず、それぞれのレベルについて全体の厚さとパティの枚数を求める
A = [1] * (N+1)
P = [1] * (N+1)
for i in range(1, N+1):
A[i] = A[i-1] * 2 + 3
P[i] = P[i-1] * 2 + 1
# レベルn、食べる厚さx
def dfs(n, x):
# レベル0まで来て食べる厚さが残ってればパティ1枚
if n == 0:
if... | # -*- coding: utf-8 -*-
"""
再帰
"""
import sys
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
N, X = map(int, input().split())
def dfs(cur, L):
if L == N:
return cur
return dfs('B' + cur + 'P' + cur + 'B', L + 1)
burger = dfs('P', 0)
print(burger[:X].count('P'))
### FIXED CODE ###
# -*... |
def algo(s):
if len(s) == 1:
return 0
elif len(s) == 2:
if s[0] != s[1]:
return 2
else:
return 0
else:
tmp = ""
for i in range(1, len(s)-1):
if s[i] != s[i+1]:
tmp += s[0:i] + s[i+2:]
break
return 2 + algo(tmp)
x = input()
ans = algo(x)
print(ans) | x = input()
cnt1 = 0
cnt2 = 0
for i in x:
if i == '1':
cnt1 += 1
else:
cnt2 += 1
print(min(cnt1, cnt2)*2) | def algo(s):
if len(s) == 1:
return 0
elif len(s) == 2:
if s[0] != s[1]:
return 2
else:
return 0
else:
tmp = ""
for i in range(1, len(s)-1):
if s[i] != s[i+1]:
tmp += s[0:i] + s[i+2:]
break
return 2 + algo(tmp)
x = input()
ans = algo(x)
print(ans)
##... |
strlist1 = input()
strlist2 = input()
flag = True
for i in range(3):
if strlist1[i] != strlist2[2 - i]:
flag = false
if flag:
print("YES")
else:
print("NO")
| strlist1 = input()
strlist2 = input()
flag = True
for i in range(3):
if strlist1[i] != strlist2[2 - i]:
flag = False
if flag:
print("YES")
else:
print("NO")
| strlist1 = input()
strlist2 = input()
flag = True
for i in range(3):
if strlist1[i] != strlist2[2 - i]:
flag = false
if flag:
print("YES")
else:
print("NO")
### FIXED CODE ###
strlist1 = input()
strlist2 = input()
flag = True
for i in range(3):
if strlist1[i] != strlist2[2 - i]:
flag = False
if... |
#!/mnt/c/Users/moiki/bash/env/bin/python
N,K = map(int, input().split())
A = [ [int(j) for j in input().split()] for i in range(N)]
# I = [ [j for j in range(1,N+1) if Ai[j]] for Ai in A]
MOD = 10**9 + 7
# dp = [0] * (N+1)
dp = [ [0] * (N+1) for _ in range(N+1)]
import numpy as np
npA = np.array(A).astype(np.uint64)
... | #!/mnt/c/Users/moiki/bash/env/bin/python
N,K = map(int, input().split())
A = [ [int(j) for j in input().split()] for i in range(N)]
# I = [ [j for j in range(1,N+1) if Ai[j]] for Ai in A]
MOD = 10**9 + 7
# dp = [0] * (N+1)
dp = [ [0] * (N+1) for _ in range(N+1)]
S = [[1]*N]
KDIG = [0]*70
for i in range(1,61):
if... | #!/mnt/c/Users/moiki/bash/env/bin/python
N,K = map(int, input().split())
A = [ [int(j) for j in input().split()] for i in range(N)]
# I = [ [j for j in range(1,N+1) if Ai[j]] for Ai in A]
MOD = 10**9 + 7
# dp = [0] * (N+1)
dp = [ [0] * (N+1) for _ in range(N+1)]
import numpy as np
npA = np.array(A).astype(np.uint64)
... |
from itertools import accumulate
def S(a, b):
return cl[b] - (0 if a == 0 else cl[a-1])
if __name__ == '__main__':
# read input
n = int(input())
l = list(map(int, input().split()))
# create cumlative list first
cl = list(accumulate(l))
clen = len(l)
# 0 F(i) i i+1 G(i) len... | from itertools import accumulate
def Sdiff(s, m, e):
# Sdiff(s, m, e) = [A_s, A_s+1 ..., A_m] [A_m+1 .... A_e]
# L = cl[m]-cl[s-1], R = cl[e] - cl[m]
# diff(L,R) = abs(cl[m] - cl[s-1] - cl[e] + cl[m]) = abs(2*cl[m] - cl[s-1] - cl[e])
x = 0 if s == 0 else cl[s-1]
return abs(2*cl[m] - x - cl[e])
... | from itertools import accumulate
def S(a, b):
return cl[b] - (0 if a == 0 else cl[a-1])
if __name__ == '__main__':
# read input
n = int(input())
l = list(map(int, input().split()))
# create cumlative list first
cl = list(accumulate(l))
clen = len(l)
# 0 F(i) i i+1 G(i) len... |
n,k = map(int, input().split())
d = []
A= []
c = []
for i in range(k):
d.append(int(input()))
a = input()
A.append([int(a[j]) for j in range(a)])
for j in range(k):
for m in range(d[j]):
c.append(A[j][m])
print(n-len(set(c))) | n,k = map(int, input().split())
d = []
A= []
c = []
for i in range(k):
d.append(int(input()))
A.append(list(map(int, input().split())))
for j in range(k):
for m in range(d[j]):
c.append(A[j][m])
print(n-len(set(c))) | n,k = map(int, input().split())
d = []
A= []
c = []
for i in range(k):
d.append(int(input()))
a = input()
A.append([int(a[j]) for j in range(a)])
for j in range(k):
for m in range(d[j]):
c.append(A[j][m])
print(n-len(set(c)))
### FIXED CODE ###
n,k = map(int, input().split())
d = []
A= [... |
a, b = map(int,input.split())
if a == b:
print("Yes")
else:
print("No") | a, b = map(int, input().split())
if a == b:
print("Yes")
else:
print("No") | a, b = map(int,input.split())
if a == b:
print("Yes")
else:
print("No")
### FIXED CODE ###
a, b = map(int, input().split())
if a == b:
print("Yes")
else:
print("No") |
x1 = list(map(int,input().rstrip().split(" ")))
x2 = list(map(int,input().rstrip().split(" ")))
def makey(x1,x2):
total = 0
for i in range(x1[0]):
total += x2[i]
if total > x1[1]:
return i
return i
y = makey(x1,x2)
print(y+1)
| y = list(map(int,input().rstrip().split(" ")))
X,A = y[0],y[1]
if X < A:
print(0)
else:
print(10)
| x1 = list(map(int,input().rstrip().split(" ")))
x2 = list(map(int,input().rstrip().split(" ")))
def makey(x1,x2):
total = 0
for i in range(x1[0]):
total += x2[i]
if total > x1[1]:
return i
return i
y = makey(x1,x2)
print(y+1)
### FIXED CODE ###
y = list(map(int,input().rstrip().split(" ")))
X,... |
import math
def C(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
n, a, b, k = map(int, input().split())
count = 0
for i in range(math.floor(k/a)):
if (k - (i * a)) % b == 0:
count += (C(n, i) * C(n, (k-a*i)/b))
print(count%998244353) | N,A,B,K = map(int,input().split())
sprime = 998244353 # approx 10**9
A,B = sorted((A,B))
if (A+B) * N < K:
print(0)
exit()
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g ... | import math
def C(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
n, a, b, k = map(int, input().split())
count = 0
for i in range(math.floor(k/a)):
if (k - (i * a)) % b == 0:
count += (C(n, i) * C(n, (k-a*i)/b))
print(count%998244353)
### FIXED CODE ###
N,A,B,K = map(int,input... |
A=input()
B=input()
C=input()
if A[-1]==B[0] and B[-1]==C[0]:
print("YES")
else:
print("NO") | A,B,C=map(str,input().split())
if A[-1]==B[0] and B[-1]==C[0]:
print("YES")
else:
print("NO") | A=input()
B=input()
C=input()
if A[-1]==B[0] and B[-1]==C[0]:
print("YES")
else:
print("NO")
### FIXED CODE ###
A,B,C=map(str,input().split())
if A[-1]==B[0] and B[-1]==C[0]:
print("YES")
else:
print("NO") |
import numpy as np
N=int(input())
A = np.array(list(map(int, input().split())))
X = A+np.arange(N)+1
S = A*(-1)+np.arange(N)+1
Ans=0
for i in range(N):
Ans += np.count_nonzero(S[i:] == X[i])
print(Ans) | S=input()
if S=='ABC':
print('ARC')
else:
print('ABC') | import numpy as np
N=int(input())
A = np.array(list(map(int, input().split())))
X = A+np.arange(N)+1
S = A*(-1)+np.arange(N)+1
Ans=0
for i in range(N):
Ans += np.count_nonzero(S[i:] == X[i])
print(Ans)
### FIXED CODE ###
S=input()
if S=='ABC':
print('ARC')
else:
print('ABC') |
output = []
for (i, x) in enumerate(S):
if i == 0:
pre = x
else:
if pre == x:
output = "Bad"
print(output)
pre = x
if len(output) > 0:
print(output)
else:
output = "Good"
print(output) | output = []
for (i, x) in enumerate(input()):
if i == 0:
pre = x
else:
if pre == x:
output = "Bad"
pre = x
if len(output) > 0:
print(output)
else:
output = "Good"
print(output) | output = []
for (i, x) in enumerate(S):
if i == 0:
pre = x
else:
if pre == x:
output = "Bad"
print(output)
pre = x
if len(output) > 0:
print(output)
else:
output = "Good"
print(output)
### FIXED CODE ###
output = []
for (i, x) in enu... |
import math
N=int(input())
anslist=[0]*(N+1)
ma=int(math.sqrt(N/2))+1
for x in range(1,ma):
for y in range(x,ma):
for z in range(y,ma):
n=x**2+y**2+z**2+x*y+y*z+z*x
if n <=N:
if x==y and y==z:
anslist[n+1]+=1
elif x==y or y==z ... | import math
N=int(input())
anslist=[0]*(N+1)
ma=int(math.sqrt(N))+1
for x in range(1,ma):
for y in range(x,ma):
for z in range(y,ma):
n=x**2+y**2+z**2+x*y+y*z+z*x
if n <=N:
if x==y and y==z:
anslist[n]+=1
elif x==y or y==z or z... | import math
N=int(input())
anslist=[0]*(N+1)
ma=int(math.sqrt(N/2))+1
for x in range(1,ma):
for y in range(x,ma):
for z in range(y,ma):
n=x**2+y**2+z**2+x*y+y*z+z*x
if n <=N:
if x==y and y==z:
anslist[n+1]+=1
elif x==y or y==z ... |
import sys
from collections import defaultdict as dd
input = sys.stdin.readline
N = int(input())
e = dd(list)
for i in range(N - 1):
a, b = tuple(map(int, input().split()))
e[a].append((b, i))
e[b].append((a, i))
res = [0] * (N - 1)
vis = set()
def dfs(x):
global vis
global res
viss = set()
t = 1
for y,... | import sys
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict as dd
input = sys.stdin.readline
N = int(input())
e = dd(list)
for i in range(N - 1):
a, b = tuple(map(int, input().split()))
e[a].append((b, i))
e[b].append((a, i))
res = [0] * (N - 1)
vis = set()
def dfs(x):
global vis
global res
... | import sys
from collections import defaultdict as dd
input = sys.stdin.readline
N = int(input())
e = dd(list)
for i in range(N - 1):
a, b = tuple(map(int, input().split()))
e[a].append((b, i))
e[b].append((a, i))
res = [0] * (N - 1)
vis = set()
def dfs(x):
global vis
global res
viss = set()
t = 1
for y,... |
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**9]*n
dp[0]=0
for i in range(1,n):
for j in range(i-k,i):
dp[i]=min(dp[i],dp[j]+abs(h[i]-h[j]))
print(dp[n-1]) | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**9]*n
dp[0]=0
for i in range(1,n):
for j in range(1,min(k+1,i+1)):
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[n-1]) | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**9]*n
dp[0]=0
for i in range(1,n):
for j in range(i-k,i):
dp[i]=min(dp[i],dp[j]+abs(h[i]-h[j]))
print(dp[n-1])
### FIXED CODE ###
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**9]*n
dp[0]=0
for i in range(1,... |
s=input()
t=input()
if s==t(:-1):
print("Yes")
else:
print("No") | s=input()
t=input()
if s==t[:-1]:
print("Yes")
else:
print("No") | s=input()
t=input()
if s==t(:-1):
print("Yes")
else:
print("No")
### FIXED CODE ###
s=input()
t=input()
if s==t[:-1]:
print("Yes")
else:
print("No") |
import numpy as np
n, q = map(int, input().split())
edges=[[] for i in range(n+1)]
d_from_1=[-1 for i in range(n+1)]
ans = [0 for i in range(n+1)]
for i in range(1,n):
a, b=[int(i) for i in input().split()]
edges[a].append([b,1])
edges[b].append([a,1])
def kyori_from_1(u):
for v,w in edges[u]:
if d_from_1[v]==-... | n, q = map(int, input().split())
edges=[[] for i in range(n+1)]
for i in range(1,n):
a, b=[int(i) for i in input().split()]
edges[a].append(b)
edges[b].append(a)
c = [0 for i in range(n+1)]
for i in range(q):
p, x = map(int, input().split())
c[p] += x
ind = [0 for i in range(n+1)]
ind[1] = 1
nxt = [1]
nxt_c... | import numpy as np
n, q = map(int, input().split())
edges=[[] for i in range(n+1)]
d_from_1=[-1 for i in range(n+1)]
ans = [0 for i in range(n+1)]
for i in range(1,n):
a, b=[int(i) for i in input().split()]
edges[a].append([b,1])
edges[b].append([a,1])
def kyori_from_1(u):
for v,w in edges[u]:
if d_from_1[v]==-... |
import sys
d={}
for e in sys.stdin.readlines()[1:]:
if'f'==e[0]:
print('yes'if e[5:]in d else'no')
else:
d[e[7:]]=0
| import sys
def m():
d={};input()
for e in sys.stdin:
if'f'==e[0]:print(['no','yes'][e[5:]in d])
else:d[e[7:]]=0
if'__main__'==__name__:m()
| import sys
d={}
for e in sys.stdin.readlines()[1:]:
if'f'==e[0]:
print('yes'if e[5:]in d else'no')
else:
d[e[7:]]=0
### FIXED CODE ###
import sys
def m():
d={};input()
for e in sys.stdin:
if'f'==e[0]:print(['no','yes'][e[5:]in d])
else:d[e[7:]]=0
if'__main__'==__name__:m()
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = l[:k]
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = sum(l[:k])
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = l[:k]
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2)
### FIXED CODE ###
n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = sum(l[:k])
now = tmp
for i i... |
N, K = map(int, input().split())
XY = []
for _ in range(N):
x, y = map(int, input().split())
XY.append((x, y))
import numpy as np
dots = np.asarray(XY[:])
import sys
INT_MAX = sys.maxsize
ans = INT_MAX
import itertools
for ((left_x, _), (right_x, _)) in itertools.combinations(dots, 2):
if left... | N, K = map(int, input().split())
XY = []
for _ in range(N):
x, y = map(int, input().split())
XY.append((x, y))
dots = XY[:]
import sys
INT_MAX = sys.maxsize
ans = INT_MAX
import itertools
for ((left_x, _), (right_x, _)) in itertools.combinations(dots, 2):
if left_x > right_x:
left_x, right_... | N, K = map(int, input().split())
XY = []
for _ in range(N):
x, y = map(int, input().split())
XY.append((x, y))
import numpy as np
dots = np.asarray(XY[:])
import sys
INT_MAX = sys.maxsize
ans = INT_MAX
import itertools
for ((left_x, _), (right_x, _)) in itertools.combinations(dots, 2):
if left... |
list=[int(i) for i in input().split()]
if list[0]>list[1]:
a=list[0]
b=list[1]
else:
b=list[0]
a=list[1]
if a%b==0:
print (b)
else:
while a%b!=0:
c=a%b
a=b
b=c
print(c)
| list=[int(i) for i in input().split()]
if list[0]>list[1]:
a=list[0]
b=list[1]
else:
b=list[0]
a=list[1]
if a%b==0:
print(b)
else:
while b>0:
c=a%b
a=b
b=c
print(a)
| list=[int(i) for i in input().split()]
if list[0]>list[1]:
a=list[0]
b=list[1]
else:
b=list[0]
a=list[1]
if a%b==0:
print (b)
else:
while a%b!=0:
c=a%b
a=b
b=c
print(c)
### FIXED CODE ###
list=[int(i) for i in input().split()]
if list[0]>list[1]:
a=list[0]... |
H,W = int(input().split())
for y in range(0,H):
for x in range(0,W):
print('#')
| while True:
H,W = map(int, input().split())
if H==0 and W==0: break
for y in range(0,H):
for x in range(0,W):
print("#",end="")
print()
print()
| H,W = int(input().split())
for y in range(0,H):
for x in range(0,W):
print('#')
### FIXED CODE ###
while True:
H,W = map(int, input().split())
if H==0 and W==0: break
for y in range(0,H):
for x in range(0,W):
print("#",end="")
print()
print()
|
def get_answer(ki):
n = int(ki[0].split(" ")[0])
q = int(ki[0].split(" ")[1])
n_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[1:-q]]]
q_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[-q:]]]
tree = make_tree(n, n_data)
score = [0] * n
for qq in q_data:... |
def get_answer(a, s):
a = int(a)
if a >= 3200:
return s
return "red"
if __name__ == "__main__":
input1 = input()
input2 = input()
print(get_answer(input1, input2))
| def get_answer(ki):
n = int(ki[0].split(" ")[0])
q = int(ki[0].split(" ")[1])
n_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[1:-q]]]
q_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[-q:]]]
tree = make_tree(n, n_data)
score = [0] * n
for qq in q_data:... |
stairs = int(input())
stair_status = list(map(int,input().split(" ")))
count = []
for i in range(stairs-1):
if i == 0:
for j in range(stairs):
if stair_status[i+j]<stair_status[i+j+1]:
#print(stair_status[i+j+1])
count.append(j)
skip = j+1
... | stairs = int(input())
stair_status = list(map(int,input().split(" ")))
move = 0
count = [0]
for i in range(stairs-1):
if stair_status[i]>=stair_status[i+1]:
move += 1
count.append(move)
else:
count.append(move)
move = 0 #reset
else:
print(max(count)) | stairs = int(input())
stair_status = list(map(int,input().split(" ")))
count = []
for i in range(stairs-1):
if i == 0:
for j in range(stairs):
if stair_status[i+j]<stair_status[i+j+1]:
#print(stair_status[i+j+1])
count.append(j)
skip = j+1
... |
1 X = list(map(int, input().split()))
print(X[0]*X[1]) | X = list(map(int, input().split()))
print(X[0]*X[1])
| 1 X = list(map(int, input().split()))
print(X[0]*X[1])
### FIXED CODE ###
X = list(map(int, input().split()))
print(X[0]*X[1])
|
H, W = map(int, input().split())
matrix = [str(input()) for i in range(H)]
matrix_1 = []
for i in range(H):
if matrix[i] != "." * W:
matrix_1.append(matrix[i])
matrix_2 = []
for i in range(W):
a = ""
for l in range(len(matrix_1)):
a += matrix_1[l][i]
matrix_2.append(a)
ans = []
k =... | H, W = map(int, input().split())
matrix = [str(input()) for i in range(H)]
matrix_1 = []
for i in range(H):
if matrix[i] != "." * W:
matrix_1.append(matrix[i])
matrix_2 = []
for i in range(W):
a = ""
for l in range(len(matrix_1)):
a += matrix_1[l][i]
matrix_2.append(a)
ans = []
k =... | H, W = map(int, input().split())
matrix = [str(input()) for i in range(H)]
matrix_1 = []
for i in range(H):
if matrix[i] != "." * W:
matrix_1.append(matrix[i])
matrix_2 = []
for i in range(W):
a = ""
for l in range(len(matrix_1)):
a += matrix_1[l][i]
matrix_2.append(a)
ans = []
k =... |
import numpy as np
n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(len(a)-1):
for j in range(i+1,len(a)):
sum += a[i]*a[j]
ans = np.mod(sum,10**9+7)
print(ans) |
n = int(input())
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
sum = sum(a) % MOD
ans = 0
for i in range(len(a)):
sum -= a[i]
sum %= MOD
ans += a[i] * sum
ans %= MOD
print(ans)
| import numpy as np
n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(len(a)-1):
for j in range(i+1,len(a)):
sum += a[i]*a[j]
ans = np.mod(sum,10**9+7)
print(ans)
### FIXED CODE ###
n = int(input())
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
sum = sum(a) %... |
class UnionFind:
def __init__(self, size):
# 負の値はルート (集合の代表) で集合の個数
# 正の値は次の要素を表す
self.table = [-1 for _ in range(size + 1)]
# 集合の代表を求める
def find(self, x):
if self.table[x] < 0:
return x
else:
# 経路の圧縮
self.table[x] = self.find(self... | def solve(N, M, lrd):
edges = {}
nodes = {}
for l, r, d in lrd:
if not l in edges:
edges[l] = {}
if not r in edges:
edges[r] = {}
edges[l][r] = d
edges[r][l] = -d
nodes[l] = None
nodes[r] = None
for node in nodes:
if nodes[n... | class UnionFind:
def __init__(self, size):
# 負の値はルート (集合の代表) で集合の個数
# 正の値は次の要素を表す
self.table = [-1 for _ in range(size + 1)]
# 集合の代表を求める
def find(self, x):
if self.table[x] < 0:
return x
else:
# 経路の圧縮
self.table[x] = self.find(self... |
class SegmentTree:
def __init__(self, L, op, default_val):
self.op = op
self.default_val = default_val
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break... |
import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, L, op, default_val):
self.op = op
self.default_val = default_val
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if ... |
class SegmentTree:
def __init__(self, L, op, default_val):
self.op = op
self.default_val = default_val
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break... |
N, M = map(int, input().split())
ans = [0 for i in range(M)]
for i in range(N):
tmp = list(map(int, input().split()))
for j in range(tmp[0]):
ans[tmp[j]]+=1
now = 0
for i in range(M):
if ans[i]==N:
now+=1
print(now) | N, M = map(int, input().split())
ans = [0 for i in range(M)]
for i in range(N):
tmp = list(map(int, input().split()))
for j in range(tmp[0]):
ans[tmp[j+1]-1]+=1
now = 0
for i in range(M):
if ans[i]==N:
now+=1
print(now)
| N, M = map(int, input().split())
ans = [0 for i in range(M)]
for i in range(N):
tmp = list(map(int, input().split()))
for j in range(tmp[0]):
ans[tmp[j]]+=1
now = 0
for i in range(M):
if ans[i]==N:
now+=1
print(now)
### FIXED CODE ###
N, M = map(int, input().sp... |
n, m, x, y = map(int, input().split())
xl = list(map(int, input().split()))
yl = list(map(int, input().split()))
xmax = sorted(x, key=None ,reverse=True)[0]
ymin = sorted(y)[0]
if max(x + xl) < min(y + yl):
print("No War")
else:
print("War") | n, m, x, y = map(int, input().split())
xl = list(map(int, input().split()))
yl = list(map(int, input().split()))
if max(xl + [x]) < min(yl + [y]):
print("No War")
else:
print("War") | n, m, x, y = map(int, input().split())
xl = list(map(int, input().split()))
yl = list(map(int, input().split()))
xmax = sorted(x, key=None ,reverse=True)[0]
ymin = sorted(y)[0]
if max(x + xl) < min(y + yl):
print("No War")
else:
print("War")
### FIXED CODE ###
n, m, x, y = map(int, input().split())
xl = l... |
import sys
import os
import math
def file_input():
f = open('../Beginner_Contest_165/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
# input()
A,B,N=map(int, input().split())
max=0
# for x in range(N+1):
# # ans=int(A*x/B)-A*int(x/B)
# min,_=math.modf(x/B)
# ... | import sys
import os
def file_input():
f = open('../Beginner_Contest_165/input.txt', 'r')
sys.stdin = f
def main():
# file_input()
# input()
A,B,N=map(int, input().split())
max=0
# for x in range(N+1):
# # ans=int(A*x/B)-A*int(x/B)
# min,_=math.modf(x/B)
# # ans=int... | import sys
import os
import math
def file_input():
f = open('../Beginner_Contest_165/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
# input()
A,B,N=map(int, input().split())
max=0
# for x in range(N+1):
# # ans=int(A*x/B)-A*int(x/B)
# min,_=math.modf(x/B)
# ... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 10