buggy stringlengths 1 618k | fixed stringlengths 16 618k | buggy_submission_id stringlengths 10 10 | fixed_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | lang stringclasses 1
value | buggy_verdict stringclasses 2
values |
|---|---|---|---|---|---|---|
import sys
n,r = list(map(int, input().split()))
if n >= 10:
print(n)
else:
print(n - 100*(10-k)) | import sys
n,r = list(map(int, input().split()))
if n >= 10:
print(r)
else:
print(r + 100*(10-n))
| s419148882 | s671784134 | p02765 | python | Runtime Error |
n = int(input())
s = input()
memo = [0]*100
counter = 0
for i in range(n):
for j in range(i+1,n):
if memo[int(s[i])*10+int(s[j])] == 0:
memo[int(s[i])*10+int(s[j])] = 1
counter += len(set(s[j+1:]))
print(counter) |
n = int(input())
s = input()
imemo = [0]*10
memo = [0]*100
counter = 0
for i in range(n):
if imemo[int(s[i])] == 0:
imemo[int(s[i])] = 1
else:
continue
for j in range(i+1,n):
if memo[int(s[i])*10+int(s[j])] == 0:
memo[int(s[i])*10+int(s[j])] = 1
... | s510497323 | s637823947 | p02844 | python | Time Limit Exceeded |
n = int(input())
s = input()
memo = [0]*1000
counter = 0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
if memo[int(s[i])*100+int(s[j])*10+int(s[k])] == 0:
memo[int(s[i])*100+int(s[j])*10+int(s[k])] = 1
counter += 1
print(counter) |
n = int(input())
s = input()
imemo = [0]*10
memo = [0]*100
counter = 0
for i in range(n):
if imemo[int(s[i])] == 0:
imemo[int(s[i])] = 1
else:
continue
for j in range(i+1,n):
if memo[int(s[i])*10+int(s[j])] == 0:
memo[int(s[i])*10+int(s[j])] = 1
... | s989493489 | s637823947 | p02844 | python | Time Limit Exceeded |
n,k,q = list(map(int, input().split()))
a = [0]*q
for i in range(q):
tmp = int(input())
a[tmp-1] += 1
b = ["No"]*n
for i in range(n):
if k - q + a[i] > 0 :
b[i] = "Yes"
for i in range(n):
print(b[i]) | n,k,q = list(map(int, input().split()))
a = [0]*n
for i in range(q):
tmp = int(input())
a[tmp-1] += 1
b = ["No"]*n
for i in range(n):
if k - q + a[i] > 0 :
b[i] = "Yes"
for i in range(n):
print(b[i]) | s923664521 | s286246122 | p02911 | python | Runtime Error |
n,k,q = list(map(int, input().split()))
a = [int(input()) for _ in range(q)]
b = ["No"]*n
for i in range(n):
if k - q + a.count(i+1) > 0 :
b[i] = "Yes"
for i in range(n):
print(b[i]) | n,k,q = list(map(int, input().split()))
a = [0]*n
for i in range(q):
tmp = int(input())
a[tmp-1] += 1
b = ["No"]*n
for i in range(n):
if k - q + a[i] > 0 :
b[i] = "Yes"
for i in range(n):
print(b[i]) | s036477333 | s286246122 | p02911 | python | Time Limit Exceeded |
print((input())**3) | print(int(input())**3) | s505645996 | s956119927 | p02915 | python | Runtime Error |
n = input()
keta = len(n)
n = int(input())
if keta == 1:
print(n)
elif keta == 2:
print(9)
elif keta == 3:
print(n - 90 + 9)
elif keta == 4:
print(909)
elif keta == 5:
print(n - 9000 + 900 - 90 + 9)
else:
print(90909) | n = input()
keta = len(n)
n = int(n)
if keta == 1:
print(n)
elif keta == 2:
print(9)
elif keta == 3:
print(n - 90)
elif keta == 4:
print(909)
elif keta == 5:
print(n - 9000 - 90 )
else:
print(90909) | s025469026 | s228422340 | p02952 | python | Runtime Error |
s = list(input())
s.sort()
if len(set(s)) == 2 && s[0] == s[1] && s[2] == s[3]:
print("Yes")
else:
print("No") | s = list(input())
s.sort()
if len(set(s)) == 2 and s[0] == s[1] and s[2] == s[3]:
print("Yes")
else:
print("No") | s608476842 | s486777738 | p02987 | python | Runtime Error |
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n,k = list(map(int, input().split()))
for i in range(1,k+1):
print(combinations_count(n-k+1,i)*combinations_count((k-i)+(i-1),(i-1)) % (10**9+7)) | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n,k = list(map(int, input().split()))
for i in range(1,k+1):
if n-k+1 >= i:
print(combinations_count(n-k+1,i)*combinations_count((k-i)+(i-1),(i-1)) % (10**9+7))
else:
print(0) | s528957216 | s208326951 | p02990 | python | Runtime Error |
import fractions
a,b,c,d = list(map(int, input().split()))
a -= 1
l = c/fractions.gcd(c,d)*d
b = b - b //c - b // d + b //l
a = a - a //c - a // d + a //l
print("{:.0f}".format(b-a)) | import sys
s = input()
for i in range(3):
if s[i] == s[i+1]:
print("Bad")
sys.exit()
print("Good") | s534881077 | s644716456 | p02993 | python | Runtime Error |
n = int(input())
z = [list(map(int, input().split())) for _ in range(n)]
z.sort()
pq_pattern = []
pq_counter = [1]*(n-1)
for i in range(n-1):
#print([z[i+1][0] - z[i][0], z[i+1][1] - z[i][1]])
if [z[i+1][0] - z[i][0], z[i+1][1] - z[i][1]] in pq_pattern:
#print("YES!")
pq_counter[pq_pattern.inde... | import sys
import collections
n = int(input())
z = [list(map(int, input().split())) for _ in range(n)]
z.sort()
pq_pattern = []
pq_counter = [1]*(n-1)*n
if n == 1:
print(1)
sys.exit()
for i in range(n):
for j in range(n):
if not i == j:
if [z[j][0] - z[i][0], z[j][1] - z[i][1]] in pq_p... | s932087357 | s369003558 | p03006 | python | Runtime Error |
n = int(input())
z = [list(map(int, input().split())) for _ in range(n)]
z.sort()
pq_pattern = []
pq_counter = [0]*(n-1)
for i in range(n-1):
#print([z[i+1][0] - z[i][0], z[i+1][1] - z[i][1]])
if [z[i+1][0] - z[i][0], z[i+1][1] - z[i][1]] in pq_pattern:
pq_counter[pq_pattern.index([z[i+1][0] - z[i][0],... | import sys
import collections
n = int(input())
z = [list(map(int, input().split())) for _ in range(n)]
z.sort()
pq_pattern = []
pq_counter = [1]*(n-1)*n
if n == 1:
print(1)
sys.exit()
for i in range(n):
for j in range(n):
if not i == j:
if [z[j][0] - z[i][0], z[j][1] - z[i][1]] in pq_p... | s772752619 | s369003558 | p03006 | python | Runtime Error |
import sys
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + memo[0]
#print("13",h... | import sys
sys.setrecursionlimit(10**6)
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + ... | s419538466 | s732485011 | p03013 | python | Runtime Error |
import sys
def dfs(heights: int, a_index:int):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[heights] = 0
a_index += 1
#print("10",heights)
else:
memo[heights] = memo[heights-1] + memo[heights -2]
#print("13",h... | import sys
sys.setrecursionlimit(10**6)
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + ... | s724051976 | s732485011 | p03013 | python | Runtime Error |
import sys
def dfs(heights: int, a_index:int):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[heights] = 0
a_index += 1
#print("10",heights)
else:
memo[heights] = memo[heights-1] + memo[heights -2]
#print("13",h... | import sys
sys.setrecursionlimit(10**6)
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + ... | s881861582 | s732485011 | p03013 | python | Runtime Error |
import sys
def dfs(n:int, heights: int, a_index:int):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[heights] = 0
a_index += 1
#print("10",heights)
else:
memo[heights] = memo[heights-1] + memo[heights -2]
#print... | import sys
sys.setrecursionlimit(10**6)
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + ... | s874920624 | s732485011 | p03013 | python | Runtime Error |
import sys
def dfs(n:int, heights: int, a_index:int):
if n < heights:
return
if a_index <= len(a) -1 and a[a_index] == heights:
memo[heights] = 0
a_index += 1
#print("10",heights)
else:
memo[heights] = memo[heights-1] + memo[heights -2]
#print("13",heights)
... | import sys
sys.setrecursionlimit(10**6)
def dfs(heights: int, a_index:int, a_n_1, a_n_2):
if n < heights:
return
if m != 0 and a_index <= len(a) -1 and a[a_index] == heights:
memo[2] = 0
a_index += 1
#print("10",heights)
else:
memo[2] = a_n_1 + a_n_2 #memo[1] + ... | s015731337 | s732485011 | p03013 | python | Runtime Error |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc.sort(reverse = True, key = lambda x: x[1])
i = 0
counter = 0
while 1:
for j in range(bc[i][0]):
a.append(bc[i][1])
counter += 1
if counter == n:
b... | n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc.sort(reverse = True, key = lambda x: x[1])
i = 0
counter = 0
while 1:
for j in range(bc[i][0]):
a.append(bc[i][1])
counter += 1
if counter == n:
b... | s469896014 | s620673852 | p03038 | python | Runtime Error |
import sys
n,k = list(map(int, input().split()))
s = input()
if s[k-1] == "A":
s[k-1] = "a"
elif s[k-1] == "B":
s[k-1] = "b"
else:
s[k-1] = "c"
print(s) | import sys
n,k = list(map(int, input().split()))
s = list(input())
if s[k-1] == "A":
s[k-1] = "a"
elif s[k-1] == "B":
s[k-1] = "b"
else:
s[k-1] = "c"
print("".join(s)) | s543588837 | s138577873 | p03041 | python | Runtime Error |
import sys
a,b,t = list(map(int, input().split()))
print(b*(c//a)) | import sys
a,b,t = list(map(int, input().split()))
print(b*(t//a)) | s308712009 | s418084213 | p03059 | python | Runtime Error |
_,q= list(map(int, input().split()))
S=list(input())
for i in range(q):
a,b=list(map(int, input().split()))
counter=0
for j in range(b-a):
if S[a-1+j] == "A":
if S[a+j] == "C":
counter +=1
print(counter) | n,q=list(map(int, input().split()))
s=input()
t=[0]*n
s=s.replace("AC", "Ac")
#s=s.translate(str.maketrans({'AC':'aC'})) maketransは置換元一文字じゃないといけんみたい
for i in range(n):
if s[i] == "c":
if i !=0:
t[i]=1+t[i-1]
else:
t[i]=1
else:
t[i]=t[i-1]
#print(t)
for _ in range(q):
l,r=list(map(int, i... | s979701374 | s223997064 | p03087 | python | Time Limit Exceeded |
n,q= list(map(int, input().split()))
S=list(input())
for i in range(q):
a,b=list(map(int, input().split()))
counter=0
for j in range(len(S[a-1:b])-1):
if S[a-1:b][j] == "A":
if S[a-1:b][j+1] == "C":
counter +=1
print(counter) | n,q=list(map(int, input().split()))
s=input()
t=[0]*n
s=s.replace("AC", "Ac")
#s=s.translate(str.maketrans({'AC':'aC'})) maketransは置換元一文字じゃないといけんみたい
for i in range(n):
if s[i] == "c":
if i !=0:
t[i]=1+t[i-1]
else:
t[i]=1
else:
t[i]=t[i-1]
#print(t)
for _ in range(q):
l,r=list(map(int, i... | s802910555 | s223997064 | p03087 | python | Time Limit Exceeded |
n,q= list(map(int, input().split()))
S=list(input())
for i in range(q):
a,b=list(map(int, input().split()))
counter=0
for j in range(len(s)-1):
if S[a-1:b][j] == "A":
if S[a-1:b][j+1] == "C":
counter +=1
print(counter) | n,q=list(map(int, input().split()))
s=input()
t=[0]*n
s=s.replace("AC", "Ac")
#s=s.translate(str.maketrans({'AC':'aC'})) maketransは置換元一文字じゃないといけんみたい
for i in range(n):
if s[i] == "c":
if i !=0:
t[i]=1+t[i-1]
else:
t[i]=1
else:
t[i]=t[i-1]
#print(t)
for _ in range(q):
l,r=list(map(int, i... | s529754787 | s223997064 | p03087 | python | Runtime Error |
n,q= list(map(int, input().split()))
S=list(input())
for i in range(q):
a,b=list(map(int, input().split()))
s = S[a-1:b]
counter=0
for j in range(len(s)-1):
if s[j] == "A":
if s[j+1] == "C":
counter +=1
print(counter) | n,q=list(map(int, input().split()))
s=input()
t=[0]*n
s=s.replace("AC", "Ac")
#s=s.translate(str.maketrans({'AC':'aC'})) maketransは置換元一文字じゃないといけんみたい
for i in range(n):
if s[i] == "c":
if i !=0:
t[i]=1+t[i-1]
else:
t[i]=1
else:
t[i]=t[i-1]
#print(t)
for _ in range(q):
l,r=list(map(int, i... | s789829293 | s223997064 | p03087 | python | Time Limit Exceeded |
a,b,k = list(map(int, input().split()))
x=[]
for i in range(1, min(a, b)):
if a%i == 0 and b%i==0:
x.append(i)
x.sort(reverse=True)
print(x[k-1]) | a,b,k = list(map(int, input().split()))
x=[]
for i in range(1, min(a, b)+1):
if a%i == 0 and b%i==0:
x.append(i)
x.sort(reverse=True)
print(x[k-1]) | s706861986 | s530287876 | p03106 | python | Runtime Error |
a,b,k = list(map(int, input().split()))
x=[]
for i in range(1, min(a, b)):
if a%i == 0 and b%i==0:
x.append(i)
x.sort(reverse=True)
print(x[k-1]) | a,b,k = list(map(int, input().split()))
x=[]
for i in range(1, min(a, b)+1):
if a%i == 0 and b%i==0:
x.append(i)
x.sort(reverse=True)
print(x[k-1]) | s439029184 | s530287876 | p03106 | python | Runtime Error |
y,m,d = list(map(int, input().split("/")))
if y < 2019 or (y =2019 and m <=4):
print(Heisei)
else:
print(TBD) | y,m,d = list(map(int, input().split("/")))
if y < 2019:
print(Heisei)
elif y ==2019 and m <=4:
print("Heisei")
else:
print("TBD") | s972029086 | s708419589 | p03109 | python | Runtime Error |
n,m = list(map(int, input().split()))
counter = [0 for _ in range(m)]
#min = m
for i in range(n):
k,*b = input().split()
b = [int(j) for j in b]
for l in b:
counter[l] +=1
print(counter.count(n)) | n,m = list(map(int, input().split()))
counter = [0]*m
#min = m
for i in range(n):
k,*b = input().split()
b = [int(j) for j in b]
for l in b:
counter[l-1] +=1
print(counter.count(n)) | s494650280 | s406162804 | p03126 | python | Runtime Error |
s = int(input())
l = [s]
while 1:
if s %2 == 0:
l.append(s/2)
s = s/2
else:
l.append(3*s + 1)
s = 3*s+1
if any(l.count(i) >= 2 for i in range(1000001)):
print(len(l))
break | s = int(input())
l = [s]
max=s
while 1:
if s %2 == 0:
l.append(s/2)
s = int(s/2)
else:
l.append(3*s + 1)
s = 3*s+1
max = s
if any(l.count(i) >= 2 for i in range(s+1)):
print(len(l))
break | s523461799 | s746578396 | p03146 | python | Time Limit Exceeded |
D = int(input())
if D = 25:
print("Chrismas")
elif D = 24:
print("Chrismas Eve")
elif D = 23:
print("Chrismas Eve Eve")
elif D = 22:
print("Chrismas Eve Eve Eve") | D = int(input())
if D == 25:
print("Christmas")
elif D == 24:
print("Christmas Eve")
elif D == 23:
print("Christmas Eve Eve")
elif D == 22:
print("Christmas Eve Eve Eve") | s222916693 | s564868179 | p03206 | python | Runtime Error |
D = int(input())
if D = 25:
print(Chrismas)
elif D = 24:
print(Chrismas Eve)
elif D = 23:
print(Chrismas Eve Eve)
elif D = 22:
print(Chrismas Eve Eve Eve) | D = int(input())
if D == 25:
print("Christmas")
elif D == 24:
print("Christmas Eve")
elif D == 23:
print("Christmas Eve Eve")
elif D == 22:
print("Christmas Eve Eve Eve") | s264040403 | s564868179 | p03206 | python | Runtime Error |
x=int(input())
print("YES" if x==7orx==5orx==3 else "NO") | x=int(input())
print("YES" if x==7 or x==5 or x==3 else "NO") | s406463897 | s346449736 | p03210 | python | Runtime Error |
x=int(input())
print(YES if x=7orx=5orx=3 else NO) | x=int(input())
print("YES" if x==7 or x==5 or x==3 else "NO") | s464280131 | s346449736 | p03210 | python | Runtime Error |
n=int(input())
t,a=list(map(int,input().split()))
h=list(map(int,input().split()))
imin=100000
suf=0
for i in range(n):
h[i]=t- h[i]＊0.006
if imin > abs(a- h[i]):
imin=abs(a- h[i])
suf=i
print(i)
| n=int(input())
t,a=list(map(int,input().split()))
h=list(map(int,input().split()))
imin=100000
suf=0
for i in range(n):
h[i]=t- h[i]*0.006
if a>=h[i]:
if imin>a-h[i]:
#print("!!",a-h[i],h[i],i)
imin=abs(a- h[i])
suf=i
else:
if imin>h[i]-a:
#print("!!",a-h[i],h[i],i)
imin=abs(... | s088339453 | s925718348 | p03220 | python | Runtime Error |
n = int(input())
if n == 1:
print("Hello World")
else:
a = int(input())
b = int(input())
print(A+B) | n = int(input())
if n == 1:
print("Hello World")
else:
a = int(input())
b = int(input())
print(a+b) | s821930601 | s701814213 | p03238 | python | Runtime Error |
n = int(input())
if n == 1:
print("Hello World")
else n == 2:
a = int(input())
b = int(input())
print(A+B) | n = int(input())
if n == 1:
print("Hello World")
else:
a = int(input())
b = int(input())
print(a+b) | s328526243 | s701814213 | p03238 | python | Runtime Error |
n = int(input())
a = int(input())
b = int(input())
if n == 1:
print("Hello World")
else n == 2:
print(A+B) | n = int(input())
if n == 1:
print("Hello World")
else:
a = int(input())
b = int(input())
print(a+b) | s981369827 | s701814213 | p03238 | python | Runtime Error |
import sys
n = int(input())
w = []
for i in range(n):
w.append(input())
if len(w) != len(set(w)):
print("No")
sys.exit()
for i in range(n-1):
if w[i][len(w[i]) - 1] != w[i+1][len(w[i+1] - 1)]:
print("No")
sys.exit()
print("Yes") | import sys
n = int(input())
w = []
for i in range(n):
w.append(input())
if len(w) != len(set(w)):
print("No")
sys.exit()
for i in range(n-1):
if w[i][len(w[i]) - 1] != w[i+1][0]:
print("No")
sys.exit()
print("Yes") | s934719583 | s461016221 | p03261 | python | Runtime Error |
import sys
def search_divisor_num_1(num):
if num < 0:
return None
elif num == 1:
return 1
else:
num_sqrt = math.floor(math.sqrt(num))
prime_list = make_prime_list_2(num_sqrt)
divisor_num = 1
for prime in prime_list:
count = 1
while nu... | import sys
import math
def search_divisor_num_1(num):
if num < 0:
return None
elif num == 1:
return 1
else:
num_sqrt = math.floor(math.sqrt(num))
prime_list = make_prime_list_2(num_sqrt)
divisor_num = 1
for prime in prime_list:
count = 1
... | s610238708 | s278164432 | p03281 | python | Runtime Error |
import sys
n = int(input())
n2 = n
while n>0:
if n % 4 == 0 or n % 7 == 0:
print("Yes")
sys.exit(1)
n -= 7
while n2>0:
if n2 % 4 == 0 or n2 % 7 == 0:
print("Yes")
sys.exit(1)
n2 -= 4
print("No") | import sys
n = int(input())
n2 = n
while n>0:
if n % 4 == 0 or n % 7 == 0:
print("Yes")
sys.exit()
n -= 7
while n2>0:
if n2 % 4 == 0 or n2 % 7 == 0:
print("Yes")
sys.exit()
n2 -= 4
print("No") | s579805597 | s944669698 | p03285 | python | Runtime Error |
import sys
n = int(input())
n2 = n
while n>0:
if n % 4 == 0 or n % 7 == 0:
print("Yes")
sys.exit(1)
n -= 7
while n>0:
if n % 4 == 0 or n % 7 == 0:
print("Yes")
sys.exit(1)
n -= 4
print("No") | import sys
n = int(input())
n2 = n
while n>0:
if n % 4 == 0 or n % 7 == 0:
print("Yes")
sys.exit()
n -= 7
while n2>0:
if n2 % 4 == 0 or n2 % 7 == 0:
print("Yes")
sys.exit()
n2 -= 4
print("No") | s645864054 | s944669698 | p03285 | python | Runtime Error |
import sys
s = input()
t = input()
for i in range(len(s)):
if s == t:
print("Yes")
sys.exit()
else:
tmp = s[0]
del s[0]
s = s + tmp
print("No") | import sys
s = input()
t = input()
for i in range(len(s)):
if s == t:
print("Yes")
sys.exit()
else:
tmp = s[0]
s = s[1:] + tmp
print("No") | s158655051 | s234734811 | p03293 | python | Runtime Error |
import sys
s = set(input())
t = set(input())
if len(s) != len(t):
print("No")
sys.exit()
if all(s.count(t[i]) ==1 for i in range(len(t))):
print("Yes")
else:
print("No") | import sys
s = input()
t = input()
for i in range(len(s)):
if s == t:
print("Yes")
sys.exit()
else:
tmp = s[0]
s = s[1:] + tmp
print("No") | s512853855 | s234734811 | p03293 | python | Runtime Error |
import sys
n = int(input())
a = list(map(int, input().split())).sorted()
print(a[n-1] - a[0]) | import sys
n = int(input())
a = list(map(int, input().split()))
a.sort()
print(a[n-1] - a[0]) | s051031541 | s781207765 | p03308 | python | Runtime Error |
import sys
import math
def isExponential(i : int) -> bool:
for j in range(2,math.ceil(math.sqrt(i))+1):
devidend = i
devisor = j
#print(devidend,devisor,"inFor")
while 1:
#print(devidend,devisor,"inWhile")
if devidend % devisor != 0:
b... | a,b,c,d = list(map(int, input().split()))
print("Yes" if abs(a-c)<= d or abs(a-b)<=d and abs(c-b) <= d else "No") | s711187219 | s503596295 | p03351 | python | Runtime Error |
import sys
import math
def isExponential(i : int) -> bool:
for j in range(math.sqrt(i)):
devidend = i
devisor = j
while 1:
if devidend % devisor != 0:
break
else:
if devidend == devisor:
return 1
els... | import sys
import math
def isExponential(i : int) -> bool:
#math.ceil(math.sqrt(i))+1
for j in range(2,i):
devidend = i
devisor = j
#print(devidend,devisor,"inFor")
while 1:
#print(devidend,devisor,"inWhile")
if devidend % devisor != 0:
... | s145218586 | s783511835 | p03352 | python | Runtime Error |
import sys
import math
a,b,k = list(map(int, input().split()))
lis = range(a,a+k)
lis.append(range(b-k+1, b+1))
for i in range(len(lis)):
print(lis[i]) | import sys
import math
a,b,k = list(map(int, input().split()))
if b-a+1 <= k:
for i in range(a,b+1):
print(i)
else:
lis = list(range(a,a+k))
lis.extend(list(range(b-k+1, b+1)))
lis = list(set(lis))
lis.sort()
for i in range(len(lis)):
print(lis[i]) | s792345929 | s465084173 | p03386 | python | Runtime Error |
import sys
import math
a,b,k = list(map(int, input().split()))
lis = range(a,a+k) + range(b-k+1, b+1)
for i in range(len(lis)):
print(lis[i]) | import sys
import math
a,b,k = list(map(int, input().split()))
if b-a+1 <= k:
for i in range(a,b+1):
print(i)
else:
lis = list(range(a,a+k))
lis.extend(list(range(b-k+1, b+1)))
lis = list(set(lis))
lis.sort()
for i in range(len(lis)):
print(lis[i]) | s942301539 | s465084173 | p03386 | python | Runtime Error |
n = int(input())
s = list(map(int, input().split()))
s.sort(reverse=True)
print(s[::2] - s[1::2])
| n = int(input())
s = list(map(int, input().split()))
s.sort(reverse=True)
print(sum(s[::2]) - sum(s[1::2])) | s552917295 | s479160363 | p03434 | python | Runtime Error |
s = input().split("/")
print("2018/01/"+s[3]) | s = input().split("/")
print("2018/01/"+s[2])
| s128495229 | s877645172 | p03469 | python | Runtime Error |
import sys
s = input().sort()
t = input().sort(reverse = True)
for i in range(min(len(s),len(t))):
if ord(s[i]) < ord(t[i]):
print("Yes")
sys.exit()
elif ord(s[i]) > ord(t[i]):
print("No")
sys.exit()
print("Yes" if len(s) < len(t) else "No") | import sys
s = list(input())
s.sort()
t = list(input())
t.sort(reverse = True)
for i in range(min(len(s),len(t))):
if ord(s[i]) < ord(t[i]):
print("Yes")
sys.exit()
elif ord(s[i]) > ord(t[i]):
print("No")
sys.exit()
print("Yes" if len(s) < len(t) else "No") | s550653627 | s296320869 | p03486 | python | Runtime Error |
import sys
n = int(input())
a = list(map(int, input().split()))
count = 0
while all(a[i] % 2 == 0 for i in a):
a = [a[i] // 2 for i in a]
count+=1
print(count) | import sys
n = int(input())
a = list(map(int, input().split()))
count = 0
while all(i % 2 == 0 for i in a):
a = [i // 2 for i in a]
count+=1
print(count) | s359606850 | s602428826 | p03494 | python | Runtime Error |
x,y,z= list(map(int, input().split()))
if y>=z:
print("delicious")
else:
print("safe" if x+a>=b else "dangerous")
| x,y,z= list(map(int, input().split()))
if y>=z:
print("delicious")
else:
print("safe" if x+y>=z else "dangerous")
| s485120278 | s955040759 | p03679 | python | Runtime Error |
import sys
def search_next(nextbutton : int) -> int:
nextbutton = a.index(nextbutton) +1
return nextbutton
n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 2
count = 1
try :
nextbutton = search_next(nextbutton)
except:
print(-1)
sys.exit()
#print(nextbutton,"first")
for _ in ra... | import sys
def search_next(nextbutton : int) -> int:
nextbutton = a.index(nextbutton) +1
return nextbutton
n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 1
count = 0
#print(nextbutton,"first")
for _ in range(n):
if nextbutton == 2:
print(count)
#print(nextbutton,"1")
... | s561718471 | s737061882 | p03680 | python | Runtime Error |
import sys
def search_next(nextbutton : int) -> int:
nextbutton = a.index(nextbutton) +1
return nextbutton
n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 2
count = 1
try :
nextbutton = search_next(nextbutton)
except:
print(-1)
sys.exit()
#print(nextbutton,"first")
while 1:
... | import sys
def search_next(nextbutton : int) -> int:
nextbutton = a.index(nextbutton) +1
return nextbutton
n = int(input())
a = [int(input()) for i in range(n)]
nextbutton = 1
count = 0
#print(nextbutton,"first")
for _ in range(n):
if nextbutton == 2:
print(count)
#print(nextbutton,"1")
... | s794195034 | s737061882 | p03680 | python | Runtime Error |
import sys
x,y = list(input().split())
judge = 0
x = x.translate(string.maketrans({"3":"1","5":"1","7":"1","8":"1","10":"1","12":"1","6":"4","9":"4","11":"4"}))
y = y.translate(string.maketrans({"3":"1","5":"1","7":"1","8":"1","10":"1","12":"1","6":"4","9":"4","11":"4"}))
print("Yes" if x == y else "No") | import sys
x,y = list(input().split())
judge = 0
x = x.translate(str.maketrans({"3":"1","5":"1","7":"1","8":"1","6":"4","9":"4"}))
y = y.translate(str.maketrans({"3":"1","5":"1","7":"1","8":"1","6":"4","9":"4"}))
x = x.replace("10", "1").replace("12", "1").replace("11","4")
y = y.replace("10", "1").replace("12", "1").r... | s607679445 | s024592964 | p03711 | python | Runtime Error |
import sys
a,b = list(map(int, input().split()))
print("H" if a == b else "D") | import sys
a,b = list(input().split())
print("H" if a == b else "D")
| s208087764 | s454236874 | p03777 | python | Runtime Error |
#include <iostream>
#include <string>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> k >> s;
count=0;
for(int x=0; x<<k+1; x++){
for(int y=0; y<<k+1; y++){
for(int z=0; z<<k+1; z++){
if(x+y+z==s){
count++;
}
... | k,s= list(map(int, input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y <=k:
count+=1
print(count)
| s436808576 | s327080221 | p03835 | python | Runtime Error |
k,s= list(map(int, input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
count+=1
print(count) | k,s= list(map(int, input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y <=k:
count+=1
print(count)
| s923847458 | s327080221 | p03835 | python | Time Limit Exceeded |
k,s= list(map(int, input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z=s:
count+=1
print(count) | k,s= list(map(int, input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y <=k:
count+=1
print(count)
| s352372814 | s327080221 | p03835 | python | Runtime Error |
import sys
h,w = list(map(int, input().split()))
c = []
c.append([input() for _ in range(h)])
for i in range(h):
print(c[i])
print(c[i]) | import sys
h,w = list(map(int, input().split()))
c = [input() for _ in range(h)]
for i in range(h):
print(c[i])
print(c[i]) | s682543289 | s682100118 | p03853 | python | Runtime Error |
a,b,c = list(map(int, input().split()))
print("A"+ b[0]+ "C") | a,b,c = input().split()
print("A"+ b[0]+ "C") | s568036638 | s232366607 | p03860 | python | Runtime Error |
s = input()
ans = ""
for i in range(len(s)):
if s[i] = "0":
ans.append("0")
elif s[i] = "1":
ans.append("1")
elif s[i] = "B":
ans.rstrip()
print(ans) | s = input()
ans = ""
for i in range(len(s)):
if s[i] == "0":
ans = ans + "0"
elif s[i] == "1":
ans = ans + "1"
elif s[i] == "B":
ans = ans[:len(ans)-1]
print(ans) | s647992081 | s961542125 | p04030 | python | Runtime Error |
def main():
import fractions
a, b, c = map(int, input().split())
a = fractions.sqrt(a)
b = fractions.sqrt(b)
c = fractions.sqrt(c)
if a+b<c:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| def main():
import math
a, b, c = map(int, input().split())
# a = math.sqrt(a)
# b = math.sqrt(b)
# c = math.sqrt(c)
# n = math.sqrt(a*b)
if 4 * a*b < (c-a-b)**2 and c-a-b > 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| s516858598 | s601804938 | p02743 | python | Runtime Error |
import math
def main():
a, b = map(int, input().split())
print(a*b//math.gcd(a, b))
if __name__ == '__main__':
main()
| import fractions
def main():
a, b = map(int, input().split())
print(a*b//fractions.gcd(a, b))
if __name__ == '__main__':
main()
| s487118071 | s396382344 | p02831 | python | Runtime Error |
def main():
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
dic = {key:0 for key in range(61)}
for i in a:
for ind, j in enumerate(bin(i)[:1:-1]):
dic[ind] += int(j)
ans = 0
bit = 1
for i in range(61... | def main():
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
li = [0]*61
for i in a:
for j in range(61):
li[j] += i&1
i >>= 1
ans = 0
bit = 1
for i in li:
ans += bit * i * (n-i)
... | s943455603 | s182592323 | p02838 | python | Time Limit Exceeded |
def main():
# input
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
li = [0]*61
for i in a:
for ind, j in enumerate(bin(i)[:1:-1]):
li[ind] += int(j)
ans = 0
bit = 1
for i in li:
ans += b... | def main():
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
li = [0]*61
for i in a:
for j in range(61):
li[j] += i&1
i >>= 1
ans = 0
bit = 1
for i in li:
ans += bit * i * (n-i)
... | s970982705 | s182592323 | p02838 | python | Time Limit Exceeded |
def main():
# input
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
ans = 0
for first, i in enumerate(a[:n-1]):
for j in a[first:n]:
ans += i^j
print(ans%MAX)
# calc
if __name__ == '__main__':
... | def main():
import sys
input = sys.stdin.readline
MAX = 10**9+7
n = int(input())
a = tuple(map(int, input().split()))
li = [0]*61
for i in a:
for j in range(61):
li[j] += i&1
i >>= 1
ans = 0
bit = 1
for i in li:
ans += bit * i * (n-i)
... | s801331320 | s182592323 | p02838 | python | Time Limit Exceeded |
def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i)
num = '0'*(3-len(num))+num
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
i... | def main():
# input
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if d2 == 1:
print(1)
else:
print(0)
# calc
if __name__ == '__main__':
main()
| s232169850 | s608500179 | p02841 | python | Runtime Error |
def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i).rjust(3, '0')
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
index += 1
els... | def main():
# input
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if d2 == 1:
print(1)
else:
print(0)
# calc
if __name__ == '__main__':
main()
| s168499653 | s608500179 | p02841 | python | Runtime Error |
def main():
# input
x = int(input())
dp = [False for _ in range(x+1)]
for i in range(6):
dp[100+i] = True
# calc
for i in range(106, x+1):
for j in range(6):
if dp[i-100-j]:
dp[i] = True
break
if dp[i]:
print(1)
else:... | def main():
# input
x = int(input())
num = x//100
a = x%100
if a <= num*5:
print(1)
else:
print(0)
# calc
if __name__ == '__main__':
main()
| s571961854 | s598824646 | p02843 | python | Runtime Error |
def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i).rjust(3, '0')
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
index += 1
els... | def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i)
num = '0'*(3-len(num))+num
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
i... | s781297669 | s835689829 | p02844 | python | Time Limit Exceeded |
def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i).rjust(3, '0')
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
index += 1
els... | def main():
# input
n = int(input())
s = input()
ans = 0
for i in range(0, 1000):
num = str(i)
num = '0'*(3-len(num))+num
index = 0
for i in s:
if index == 3:
ans += 1
break
elif num[index]==i:
i... | s930531593 | s835689829 | p02844 | python | Time Limit Exceeded |
def main():
# input
t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
x = (a1-b1)*t1
y = (a2-b2)*t2
diff = x+y
print(x)
print(y)
print(diff)
if x == -y:
print("infinity")
return
elif x*y > 0:
... | def main():
# input
import math
t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
x = (a1-b1)*t1
y = (a2-b2)*t2
diff = x+y
if x == -y:
print("infinity")
return
elif x*y>0 or abs(x)>abs(y):
print(0)
... | s658222945 | s067145391 | p02846 | python | Runtime Error |
n, k = map(int, input().split())
h = list(map(int, input()))
ans = 0
for i in h:
if i>k:
ans += 1
print(ans) | n, k = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in h:
if i>=k:
ans += 1
print(ans) | s039056366 | s485669187 | p02898 | python | Runtime Error |
import sys
from bisect import insort_left
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
a.sort()
for _ in range(m):
b = a.pop()//2
insort_left(a, b)
print(sum(a))
main() | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s376194347 | s161986426 | p02912 | python | Time Limit Exceeded |
import sys
from bisect import insort_left
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
# a = [int(i) for i in input().split()]
# a.sort()
a = []
for i in map(int, input().split()):
insort_left(a, i)
for _ in range(m):
b = a.pop()//2
insort_left... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s850517157 | s161986426 | p02912 | python | Time Limit Exceeded |
import sys
from bisect import insort_left
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
a.sort()
for _ in range(m):
b = a.pop()//2
insort_left(a, b)
print(sum(a))
main() | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s365949161 | s161986426 | p02912 | python | Time Limit Exceeded |
import sys
input = sys.stdin.readline
import numpy as np
def main():
n, m_num = map(int, input().split())
a_list = np.array([int(i) for i in input().split()])
a_list.sort()
def func(a, m):
temp = a[-1]//2
a[-1] = temp
a.sort()
ind = np.where(a==temp)[0][0]
m -=... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s932855500 | s161986426 | p02912 | python | Runtime Error |
import sys
input = sys.stdin.readline
import numpy as np
def main():
n, m_num = map(int, input().split())
a_list = np.array([int(i) for i in input().split()])
a_list.sort()
def func(a, m):
temp = a[-1]//2
a[-1] = temp
a.sort()
ind = np.where(a==temp)[0][0]
m -=... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s832854063 | s161986426 | p02912 | python | Runtime Error |
import sys
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
a.sort()
for i in range(m):
a[-1] = a[-1]//2
a.sort()
print(sum(a))
main()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np
def main():
n, m = map(int, input().split())
a = np.array([int(i) for i in input().split()])
a.sort()
while True:
temp = a[-1]//2
a[-1] //= 2
a.sort()
ind = np.where(a==temp)[0][0]
... | s313616205 | s161986426 | p02912 | python | Time Limit Exceeded |
def main():
n = int(input())
n_list = [i+1 for i in range(n-1)]
ans = sum(n_list)
print(ans)
main()
| def main():
n = int(input())
ans = ( n * (n-1) )// 2
print(ans)
main() | s536633581 | s792265813 | p02924 | python | Time Limit Exceeded |
def main():
a = list(map(int, input().split()))
print(max(a[2] - (a[0] - a[1], 0))
main()
| def main():
a = list(map(int, input().split()))
print(max(a[2] - (a[0] - a[1]), 0))
main()
| s046029235 | s517116556 | p02951 | python | Runtime Error |
def func(len_a):
ans = ""
for i in range(1, len_a):
if i & 1 == 0:
ans += "0"
elif i & 1 == 1:
ans += "9"
return ans
def main():
a = input()
len_a = len(a)
if len_a & 1 == 0:
ans = func(len_a)
print(ans)
else:
ans = int(func(le... | def func(len_a):
ans = ""
for i in range(1, len_a):
if i & 1 == 0:
ans += "0"
elif i & 1 == 1:
ans += "9"
return ans
def main():
a = input()
len_a = len(a)
if len_a & 1 == 0:
ans = func(len_a)
print(ans)
else:
if len_a == 1:
... | s444105674 | s232255262 | p02952 | python | Runtime Error |
def main():
N = int(input())
h_list = list(map(int, input().split()))
for i in range(N-1):
if h_list[i]-1 > min(h_list[i+1:]):
print("No")
return
print("Yes")
main()
| def main():
N = int(input())
h_list = list(map(int, input().split()))
h_sort = sorted(h_list)
for i in range(N-1):
if h_list[i]-1 > h_sort[i]:
print("No")
return
print("Yes")
main()
| s366039442 | s184209943 | p02953 | python | Time Limit Exceeded |
def func_R(li, s, hi):
for wi, si in enumerate(s):
if si == '#':
li[hi][wi] = 0
else:
if wi == 0:
li[hi][wi] = 1
else:
li[hi][wi] = li[hi][wi-1] + 1
def func_L(li, s, hi):
for wi, si in enumerate(s[::-1]):
wi = w - wi -... | import numpy as np
def main():
H, W = map(int, input().split())
S = np.array([list(input()) for _ in range(H)]) == '.'
L = np.zeros((H, W), dtype=int)
R = np.zeros((H, W), dtype=int)
U = np.zeros((H, W), dtype=int)
D = np.zeros((H, W), dtype=int)
for w in range(1, W):
L[:, w] = (L... | s036205125 | s747614114 | p03014 | python | Time Limit Exceeded |
def func_R(li, s, hi):
for wi, si in enumerate(s):
if si == '#':
li[hi][wi] = 0
else:
if wi == 0:
li[hi][wi] = 1
else:
li[hi][wi] = li[hi][wi-1] + 1
def func_L(li, s, hi):
for wi, si in enumerate(s[::-1]):
wi = w - wi -... | import numpy as np
def main():
H, W = map(int, input().split())
S = np.array([list(input()) for _ in range(H)]) == '.'
L = np.zeros((H, W), dtype=int)
R = np.zeros((H, W), dtype=int)
U = np.zeros((H, W), dtype=int)
D = np.zeros((H, W), dtype=int)
for w in range(1, W):
L[:, w] = (L... | s677248299 | s747614114 | p03014 | python | Time Limit Exceeded |
def func_R(li, s, hi):
for wi, si in enumerate(s):
if si == '#':
li[hi][wi] = 0
else:
if wi == 0:
li[hi][wi] = 1
else:
li[hi][wi] = li[hi][wi-1] + 1
def func_L(li, s, hi):
for wi, si in enumerate(s[::-1]):
wi = w - wi -... | import numpy as np
def main():
H, W = map(int, input().split())
S = np.array([list(input()) for _ in range(H)]) == '.'
L = np.zeros((H, W), dtype=int)
R = np.zeros((H, W), dtype=int)
U = np.zeros((H, W), dtype=int)
D = np.zeros((H, W), dtype=int)
for w in range(1, W):
L[:, w] = (L... | s790323699 | s747614114 | p03014 | python | Time Limit Exceeded |
r, D, x = map(int, input().split())
for i in range(10):
x = r * x - D
print(x) | A, B = map(int, input().split())
if A < 6:
print(0)
elif 6 <= A <13:
print(B//2)
else:
print(B)
| s635437772 | s275624030 | p03035 | python | Runtime Error |
r, D, x = map(int, input().split())
for i in range(10):
x = r * x - D
print(x) | A, B = map(int, input().split())
if A < 6:
print(0)
elif 6 <= A <13:
print(B//2)
else:
print(B)
| s713751430 | s275624030 | p03035 | python | Runtime Error |
def main():
n, k = map(int, input().split())
h = tuple(map(int, input().split()))
if k >= n:
print(abs(h[-1]-h[0]))
dp = [0]*(n)
for i in range(1, n):
temp = 10**10
for j in range(1, min(i, k)+1):
temp = min(temp, dp[i-j]+abs(h[i]-h[i-j]))
dp[i] = temp
... | def main():
n = int(input())
h = [int(i) for i in input().split()]
cost = [0 for _ in range(n)]
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
cost[i] = min(cost[i-1]+abs(h[i] - h[i-1]), cost[i-2]+abs(h[i] - h[i-2]))
print(cost[-1])
main()
| s533032471 | s268317089 | p03160 | python | Runtime Error |
import numpy as np
def main():
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = np.array(h)
cost = np.empty(n)
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
j = min(i, k)
cost[i] = np.min(cost[i-j:i-1] + np.abs(h[i-j:i-1] - h[i]))
pr... | def main():
n, k = map(int, input().split())
h = tuple(map(int, input().split()))
cost = [0 for _ in range(n)]
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
cost[i] = min((cost[i-1-j] + abs(h[i]-h[i-1-j]) for j in range(min(i, k))))
print(cost[-1])
main()
| s267398684 | s938208785 | p03161 | python | Runtime Error |
def main():
n, k = map(int, input().split())
h = tuple(map(int, input().split()))
cost = [0 for _ in range(n)]
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
cost[i] = min((cost[i-1-j] + abs(h[i]-h[i-1-j]) for j in range(min(i, k))))
print(cost[-1])
main()
| def main():
n, k = map(int, input().split())
h = tuple(map(int, input().split()))
cost = [0 for _ in range(n)]
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
cost[i] = min((cost[i-1-j] + abs(h[i]-h[i-1-j]) for j in range(min(i, k))))
print(cost[-1])
main()
| s347725518 | s938208785 | p03161 | python | Time Limit Exceeded |
# import copy
import sys
import numpy as np
imput = sys.stdin.readline
def main():
N, W = map(int, input().split())
dp = np.zeros((N+1, W+1))
for i in range(1, N+1):
w, v = map(int, input().split())
for j in range(1, W+1):
if j<w:
dp[i, j] = dp[i-1, j]
... | import sys
imput = sys.stdin.readline
def main():
N, W = map(int, input().split())
dp = [[0]*(W+1) for _ in range(N+2)]
for i in range(1, N+1):
w, v = map(int, input().split())
for j in range(1, W+1):
if j<w:
dp[i][j] = dp[i-1][j]
else:
... | s098729604 | s181927609 | p03163 | python | Time Limit Exceeded |
def main():
li = [int(i) for i in input()]
t = li[1:]
op = ["+", "+", "+"]
t_sum = sum(t)
if t_sum == 7:
print("{}+{}+{}+{}=7".format(t[0], t[1], t[2], t[3]))
else:
for i in range(3):
if t_sum - 2*t[i] == 7:
op[i] = "-"
print("{}{}{}{}{... | def main():
li = [int(i) for i in input()]
t = li[1:]
op = ["+", "+", "+"]
t_sum = sum(li)
if t_sum == 7:
print("{}+{}+{}+{}=7".format(li[0], li[1], li[2], li[3]))
else:
for i in range(3):
if t_sum - 2*t[i] == 7:
op[i] = "-"
print("{}{}... | s755340209 | s135599067 | p03545 | python | Runtime Error |
def main():
k, s = map(int, input().split())
if s > 3*k:
pass
elif s == 3*k:
ans = 1
else:
ans = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i + j + l == s:
ans += 1
print(... | def main():
k, s = map(int, input().split())
if s > 3*k:
pass
elif s == 3*k:
ans = 1
else:
ans = 0
for i in range(k+1):
for j in range(k+1):
if 0<=s - (i + j)<=k:
ans += 1
print(ans)
main()
| s760521177 | s959904285 | p03835 | python | Time Limit Exceeded |
#!/usr/bin/env python3
import sys
#input = sys.stdin.buffer.readline
def inn(func=int):
return list(map(func,input().split()))
def ins():
return input().split()
a0 = inn()
a1 = inn()
a2 = inn()
a = a0+a1+a2
n = int(input())
ban = [0,0,0,0,0,0,0,0,0]
for i in range(n):
b = int(input())
for j in range(... | #!/usr/bin/env python3
import sys
#input = sys.stdin.buffer.readline
def inn(func=int):
return list(map(func,input().split()))
def ins():
return input().split()
a0 = inn()
a1 = inn()
a2 = inn()
a = a0+a1+a2
n = int(input())
ban = [0,0,0,0,0,0,0,0,0]
for i in range(n):
b = int(input())
for j in range(... | s280509273 | s336243274 | p02760 | python | Runtime Error |
#!/usr/bin/env python3
n,k = [int(i) for i in input().split(" ")]
p = [int(i) for i in input().split(" ")]
kita = {}
maxn = 0
for i in range(n-k+1):
kt = 0
for j in range(k):
if not p[i+j] in kita.keys():
kita[p[i+j]] = 0.5*(p[i+j]+1)
kt += kita[p[i+j]]
if kt > maxn:
maxn... | n,k = map(int,input().split())
p = list(map(int,input().split()))
maxn = 0
sum = 0
for i in range(n-k+1):
if i == 0:
for j in range(k):
sum += p[j]
maxn = sum
else:
sum -= p[i-1]
sum += p[i+k-1]
if maxn < sum:
maxn = sum
print(0.5*(maxn+k)) | s625089275 | s222257577 | p02780 | python | Time Limit Exceeded |
#!/usr/bin/env python3
n,k = [int(i) for i in input().split(" ")]
p = [int(i) for i in input().split(" ")]
kita = [0.5*(i+1) for i in range(max(p)+1)]
maxn = 0
for i in range(n-k+1):
kt = 0
for j in range(k):
kt += kita[p[i+j]]
if kt > maxn:
maxn = kt
print(maxn) | n,k = map(int,input().split())
p = list(map(int,input().split()))
maxn = 0
sum = 0
for i in range(n-k+1):
if i == 0:
for j in range(k):
sum += p[j]
maxn = sum
else:
sum -= p[i-1]
sum += p[i+k-1]
if maxn < sum:
maxn = sum
print(0.5*(maxn+k)) | s558575455 | s222257577 | p02780 | python | Time Limit Exceeded |
#!/usr/bin/env python3
n,k = [int(i) for i in input().split(" ")]
p = [int(i) for i in input().split(" ")]
kita = [0.5*(i+1) for i in range(max(p)+1)]
kitai = [kita[i] for i in p]
maxn = 0
for i in range(n-k+1):
kt = 0
for j in range(k):
kt += kita[p[i+j]]
if kt > maxn:
maxn = kt
print(maxn) | n,k = map(int,input().split())
p = list(map(int,input().split()))
maxn = 0
sum = 0
for i in range(n-k+1):
if i == 0:
for j in range(k):
sum += p[j]
maxn = sum
else:
sum -= p[i-1]
sum += p[i+k-1]
if maxn < sum:
maxn = sum
print(0.5*(maxn+k)) | s111547870 | s222257577 | p02780 | python | Time Limit Exceeded |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.