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 |
|---|---|---|---|---|---|---|
data_num = int(input())
price = list([0 for i in range(data_num)])
cnt = 0
deff_price = -999999999
tmp_price = 0
for i in range(data_num):
price[i] = int(input())
for i in range(data_num-1):
tmp_price = max(price[i+1:])-price[i]
if tmp_price>deff_price:
deff_price = tmp_price
print(str(deff_pr... | data_num = int(input())
cnt = 0
deff_price = -999999999
min_price = 0
tmp_price = 0
for i in range(data_num):
price = int(input())
if i ==0:
min_price = price
elif price - min_price > deff_price:
deff_price = price - min_price
if price < min_price:
min_price = price
prin... | s272775784 | s248325655 | p02258 | python | Time Limit Exceeded |
data_num = int(input())
price = list([int(input()) for i in range(data_num)])
cnt = 0
deff_price = -999999999
tmp_price = 0
for i in range(data_num-1):
tmp_price = max(price[i+1:])-price[i]
if tmp_price>deff_price:
deff_price = tmp_price
print(str(deff_price)) | data_num = int(input())
cnt = 0
deff_price = -999999999
min_price = 0
tmp_price = 0
for i in range(data_num):
price = int(input())
if i ==0:
min_price = price
elif price - min_price > deff_price:
deff_price = price - min_price
if price < min_price:
min_price = price
prin... | s683676140 | s248325655 | p02258 | python | Time Limit Exceeded |
def insertionSort(A, n , g, in_cnt):
lo_cnt = in_cnt
for i in range(g, n):
v = A[i]
j = i - g
while j>=0 and A[j]>v:
A[j+g] = A[j]
j = j - g
lo_cnt = lo_cnt + 1
A[j+g] = v
return [A,lo_cnt]
A = []
G = []
data_num = int(input())
for i in r... | def insertionSort(A, n , g, in_cnt):
lo_cnt = in_cnt
for i in range(g, n):
v = A[i]
j = i - g
while j>=0 and A[j]>v:
A[j+g] = A[j]
j = j - g
lo_cnt = lo_cnt + 1
A[j+g] = v
return [A,lo_cnt]
A = []
G = []
data_num = int(input())
for i in r... | s596728971 | s824277876 | p02262 | python | Time Limit Exceeded |
command_num = int(input())
dict = []
for i in range(command_num):
in_command, in_str = input().rstrip().split(" ")
if in_command == "insert":
dict.append(in_str)
elif in_command == "find":
if dict.count(in_str) > 0:
print("yes")
else:
print("no") | command_num = int(input())
dict = set([])
for i in range(command_num):
in_command, in_str = input().rstrip().split(" ")
if in_command == "insert":
dict.add(in_str)
elif in_command == "find":
if in_str in dict:
print("yes")
else:
print("no") | s006764195 | s442215628 | p02269 | python | Time Limit Exceeded |
def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
... | def merge(A, left, mid, right):
# n1 = mid - left
# n2 = right - mid
# L = [0 for i in range(n1+1)]
# R = [0 for i in range(n2+1)]
# for i in range(n1):
# L[i] = A[left + i]
#
# for i in range(n2):
# R[i] = A[mid + i]
# L[n1]=1000000001
# R[n2]=1000000001
L ... | s332628015 | s979466261 | p02272 | python | Runtime Error |
def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
... | def merge(A, left, mid, right):
# n1 = mid - left
# n2 = right - mid
# L = [0 for i in range(n1+1)]
# R = [0 for i in range(n2+1)]
# for i in range(n1):
# L[i] = A[left + i]
#
# for i in range(n2):
# R[i] = A[mid + i]
# L[n1]=1000000001
# R[n2]=1000000001
L ... | s222883915 | s979466261 | p02272 | python | Runtime Error |
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=100000000
R[n2]=100000000
cnt1 = 0
cn... | def merge(A, left, mid, right):
# n1 = mid - left
# n2 = right - mid
# L = [0 for i in range(n1+1)]
# R = [0 for i in range(n2+1)]
# for i in range(n1):
# L[i] = A[left + i]
#
# for i in range(n2):
# R[i] = A[mid + i]
# L[n1]=1000000001
# R[n2]=1000000001
L ... | s164869360 | s979466261 | p02272 | python | Runtime Error |
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1]=1000000001
R[n2]=1000000001
cnt1 = 0
... | def merge(A, left, mid, right):
# n1 = mid - left
# n2 = right - mid
# L = [0 for i in range(n1+1)]
# R = [0 for i in range(n2+1)]
# for i in range(n1):
# L[i] = A[left + i]
#
# for i in range(n2):
# R[i] = A[mid + i]
# L[n1]=1000000001
# R[n2]=1000000001
L ... | s686307244 | s979466261 | p02272 | python | Time Limit Exceeded |
import math
#1st line
pos_x1, pos_y1, pos_x2, pos_y2 = map(int,input().split(" "))
dist = math.sqrt((pos_x1-pos_x2)**2 + (pos_y1 - pos_y2)**2)
print(str(dist)) | import math
#1st line
pos_x1, pos_y1, pos_x2, pos_y2 = map(float,input().split(" "))
dist = math.sqrt((pos_x1-pos_x2)**2 + (pos_y1 - pos_y2)**2)
print(str(dist)) | s893636135 | s221384092 | p02379 | python | Runtime Error |
import math
??
len_a, len_b, deg_C = map(int,input().split(" "))
rad_C = math.radians(deg_C)
??
#area
S = (1/2) * len_a * len_b * math.sin(rad_C)
#Length
L = len_a + len_b + math.sqrt(len_a ** 2 + len_b ** 2 + 1/2 * len_a * len_b * math.cos(rad_C))
#height
h = len_b * math.sin(rad_C)
??
print("{:.5f}".format(S))
print(... | import math
len_a, len_b, deg_C = map(int,input().split(" "))
rad_C = math.radians(deg_C)
#area
S = (1/2) * len_a * len_b * math.sin(rad_C)
#Length
L = len_a + len_b + math.sqrt(len_a ** 2 + len_b ** 2 - 2 * len_a * len_b * math.cos(rad_C))
#height
h = len_b * math.sin(rad_C)
print("{:.5f}\n{:.5f}\n{:.5f}".format(S,... | s732775978 | s165339729 | p02380 | python | Runtime Error |
class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
def convEyesIn... | class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | s460081995 | s350538655 | p02384 | python | Time Limit Exceeded |
class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | s902886497 | s764274949 | p02385 | python | Time Limit Exceeded |
class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | s714229541 | s764274949 | p02385 | python | Time Limit Exceeded |
class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | class Dice:
"""Dice class"""
def __init__(self): # ?????????????????????
self.eyeIndex = 1 #center
self.eyeIndex_E = 3 #east
self.eyeIndex_W = 4 #west
self.eyeIndex_N = 5 #north
self.eyeIndex_S = 2 #south
self.eye = 0
... | s688681713 | s764274949 | p02385 | python | Time Limit Exceeded |
import numpy as np
n, m, l=map(int, input().split(" "))
A = np.matrix([ [ int(a) for a in input().split() ] for i in range(n) ])
B = np.matrix([ [ int(b) for b in input().split() ] for i in range(m) ])
C = A.dot(B)
for i in range(l):
out_C = ""
for j in range(n):
out_C = out_C + " " + str(C[i, j])
... | n, m, l=map(int, input().split(" "))
A = [ [ int(a) for a in input().split() ] for i in range(n) ]
B = [ [ int(b) for b in input().split() ] for i in range(m) ]
C = [ [ 0 for i in range(l) ] for i in range(n) ]
for i in range(n):
for j in range(l):
for jj in range(m):
C[i][j] = C[i][j] + ... | s632833318 | s734466235 | p02414 | python | Runtime Error |
from numpy import *
n, m, l=map(int, input().split(" "))
A = matrix([ [ int(a) for a in input().split() ] for i in range(n) ])
B = matrix([ [ int(b) for b in input().split() ] for i in range(m) ])
C = A.dot(B)
for i in range(l):
out_C = ""
for j in range(n):
out_C = out_C + " " + str(C[i, j])
... | n, m, l=map(int, input().split(" "))
A = [ [ int(a) for a in input().split() ] for i in range(n) ]
B = [ [ int(b) for b in input().split() ] for i in range(m) ]
C = [ [ 0 for i in range(l) ] for i in range(n) ]
for i in range(n):
for j in range(l):
for jj in range(m):
C[i][j] = C[i][j] + ... | s361506470 | s734466235 | p02414 | python | Runtime Error |
result = [0, 0, 0]
for i in range(10):
inp = int(raw_input())
if result[2] >= inp:
continue
elif result[1] <= inp < result[2]:
result[2] = inp
elif result[0] <= inp < result[1]:
result[2] = result[1]
result[1] = inp
else:
result[2] = result[1]
result[1] = result[0]
result[0] = inp
for i in reange(... | result = [0, 0, 0]
for i in range(10):
inp = int(raw_input())
if result[2] >= inp:
continue
elif result[1] >= inp > result[2]:
result[2] = inp
elif result[0] >= inp > result[1]:
result[2] = result[1]
result[1] = inp
else:
result[2] = result[1]
result[1] = result[0]
result[0] = inp
for i in range(3... | s208918648 | s690734577 | p00001 | python | Runtime Error |
while True:
try:
a, b, c, d, e, f = map(int, input().split())
tb, tc = d*b, d*c
te, tf = a*e, a*f
y = (tc-tf)//(tb-te)
x = (c-(y*b))//a
print("{:.3f} {:.3f}".format(x, y))
except:
return | while True:
try:
a, b, c, d, e, f = map(int, input().split())
except:
break
y = (c * d - f * a) / (b * d - e * a)
x = (c - (b * y)) / a
print("{:.3f} {:.3f}".format(x, y)) | s842474159 | s285868423 | p00004 | python | Runtime Error |
import math
while True:
try:
a, b = map(int, input().split())
except:
break
gcd = math.gcd(a, b)
lcm = (a*b) // gcd
print(gcd, lcm) | def GCD(m, n):
while n:
m, n = n, m % n
return m
while True:
try:
a, b = map(int, input().split())
except:
break
if a < b:
a, b = b, a
gcd = GCD(a, b)
lcm = (a * b) // gcd
print(gcd, lcm) | s666998523 | s713017278 | p00005 | python | Runtime Error |
import math
while True:
try:
a, b = sorted(map(int, input().split()))
except:
break
gcd = math.gcd(a, b)
lcm = (a*b) // gcd
print(gcd, lcm) | def GCD(m, n):
while n:
m, n = n, m % n
return m
while True:
try:
a, b = map(int, input().split())
except:
break
if a < b:
a, b = b, a
gcd = GCD(a, b)
lcm = (a * b) // gcd
print(gcd, lcm) | s560387968 | s713017278 | p00005 | python | Runtime Error |
while True:
try:
n = int(input())
count = 0
if n == 1:
print("0")
else:
a = [2*i for i in range(2, 1000000)]
b = [3*i for i in range(2, 1000000)]
c = [5*i for i in range(2, 1000000)]
d = [7*i for i in range(2, 1000000)]
... | import bisect
primes = [0, 0] + [1] * 999999
for i in range(2, 1000):
if primes[i]:
for j in range(i*i, 1000000, i):
primes[j] = 0
primes = [i for i, v in enumerate(primes) if v]
while True:
try:
n = int(input())
except:
break
print(bisect.bisect(primes, n))
| s594394462 | s930532876 | p00009 | python | Time Limit Exceeded |
import sys
from math import sqrt
for line in sys.stdin:
n = int(line.strip())
L, pn, tmp = int(sqrt(n)), [], [i for i in range(2, n+1)]
while tmp[0] < L+1:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
print(len(pn)) | import bisect
primes = [0, 0] + [1] * 999999
for i in range(2, 1000):
if primes[i]:
for j in range(i*i, 1000000, i):
primes[j] = 0
primes = [i for i, v in enumerate(primes) if v]
while True:
try:
n = int(input())
except:
break
print(bisect.bisect(primes, n))
| s738033026 | s930532876 | p00009 | python | Runtime Error |
import sys
from math import sqrt
for line in sys.stdin:
n = int(line.strip())
L, pn, tmp = int(sqrt(n)), [], [i for i in range(2, n+1)]
while tmp[0] < L+1:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
print(len(pn)) | import bisect
primes = [0, 0] + [1] * 999999
for i in range(2, 1000):
if primes[i]:
for j in range(i*i, 1000000, i):
primes[j] = 0
primes = [i for i, v in enumerate(primes) if v]
while True:
try:
n = int(input())
except:
break
print(bisect.bisect(primes, n))
| s299484457 | s930532876 | p00009 | python | Runtime Error |
while True:
n = int(input())
for _ in range(n):
a, b = int(input()), int(input())
x = str(a+b)
print('overflow' if len(x) > 80 else x) | N = int(input())
for _ in range(N):
a = int(input())
b = int(input())
c = a + b
length = len(str(c))
print([c, "overflow"][length > 80])
| s827019471 | s370436029 | p00015 | python | Runtime Error |
while True:
n = int(input())
for _ in range(n):
a, b = int(input()), int(input())
x = str(a+b)
print('overflow' if len(x) > 80 else a+b) | N = int(input())
for _ in range(N):
a = int(input())
b = int(input())
c = a + b
length = len(str(c))
print([c, "overflow"][length > 80])
| s106209458 | s370436029 | p00015 | python | Runtime Error |
import string
d = {c:ord(c)-97 for c in string.ascii_lowercase}
b = {v:k for k, v in d.items()}
while True:
try:
s = input()
except:
break
t = 0
for token in list(filter(lambda x: len(x) in [3, 4], s[:-1].split())):
t = d[token[0]]%26-19
word = ''.join([b[d[c]%26-t] for c... | import string
strings = string.ascii_lowercase
clues = [(19, 7, 8, 18), (19, 7, 0, 19), (19, 7, 4)]
while True:
try:
data = input()
except:
break
for word in data.split():
if len(word) == 4 or 3:
dif = 19 - (ord(word[0]) - 97)
enc = ["" for _ in range(26)]
... | s749205516 | s267610159 | p00017 | python | Runtime Error |
print(*sorted(map(int, input().spilt()))[::-1])
| print(*sorted(map(int, input().split()))[::-1])
| s371735785 | s865719022 | p00018 | python | Runtime Error |
t = [[0 for i in range(10)] for j in range(10)]
case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]
case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]
case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]
while True:
try:
x, y, s = map(int, input().split(','))
except:
break
for c in [case1, case2, case3][:s]:... | t = [[0 for i in range(10)] for j in range(10)]
case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]
case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]
case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]
while True:
try:
x, y, s = map(int, input().split(','))
except:
break
for c in [case1, case2, case3][:s]:... | s756138018 | s152224981 | p00026 | python | Runtime Error |
import sys
from itertools import dropwhile
a = []
for v in sys.stdin:
a.append(int(v))
m = max([a.count(v) for v in set(a)])
next(dropwhile(lambda x: True, (print(v) for v in set(a) if a.count(v) == m))) | a = [0] * 101
while True:
try:
a[int(input())] += 1
except:
break
maxv = max(a)
for i, v in enumerate(a):
if maxv == v:
print(i) | s615773268 | s437483195 | p00028 | python | Runtime Error |
import sys
for s in sys.stdin:
a_b = True
for i in range(8):
for j in range(8):
ss = s.splitlines()[i][j]
if int(ss) == 1 and a_b:
a_b, a_v = False, (i, j)
if int(ss) == 1 and not a_b:
z_v = (i, j)
if a_v[0]+1==z_v[0] and a_v[1]+1=... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s611332189 | s183197692 | p00036 | python | Runtime Error |
s = []
while True:
try:
s = [input()+"\n" for _ in range(8)]
except:
break
a_b = True
for i in range(8):
for j in range(8):
ss = s.splitlines()[i][j]
if int(ss) == 1 and a_b:
a_b, a_v = False, (i, j)
if int(ss) == 1 and not a_b:... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s044036418 | s183197692 | p00036 | python | Runtime Error |
s = []
while True:
try:
s = [input() for _ in range(8)]
except:
break
a_b = True
for i in range(8):
for j in range(8):
ss = s[i][j]
if int(ss) == 1 and a_b:
a_b, a_v = False, (i, j)
if int(ss) == 1 and not a_b:
z... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s617364325 | s183197692 | p00036 | python | Runtime Error |
flag = False
while True:
try:
string = [input() for _ in range(8)]
except:
break
if flag:
print()
string = [int(l) for line in string for l in line] + [0]*16
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, ... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s272787548 | s183197692 | p00036 | python | Runtime Error |
while True:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*16
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0: "A", 1: "B", 2: "C", 3: "D", 4: "E",... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s705149817 | s183197692 | p00036 | python | Runtime Error |
while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*16
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
a... | while True:
try:
string = [input() for _ in range(8)]
string = [int(l) for line in string for l in line] + [0]*32
one = string.index(1)
s = string[one:]
ones = [[1, 8, 9], [8, 16, 24], [1, 2, 3],
[7, 8, 15], [1, 9, 10], [8, 9, 17], [1, 7, 8]]
ans = {0:... | s121465177 | s183197692 | p00036 | python | Runtime Error |
import sys
from itertools import takewhile, dropwhile
L, pn, tmp = 224, [], [i for i in range(2, 50000)]
while tmp[0] < 224:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
for line in sys.stdin:
n = int(line.strip())
print(list(takewhile(lambda x: ... | primes = [0, 0] + [1]*50020
for i in range(2, 226):
if primes[i]:
for j in range(i*i, 50021, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
print(n-primes[n-1::-1].index(1)-1, n+primes[n+1:].index(1)+1) | s004023313 | s205664533 | p00044 | python | Runtime Error |
from itertools import takewhile, dropwhile
pn, tmp = [], [i for i in range(2, 50000)]
while tmp[0] < 224:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
while True:
try:
n = int(input())
except:
break
print(list(takewhile(lambda x... | primes = [0, 0] + [1]*50020
for i in range(2, 226):
if primes[i]:
for j in range(i*i, 50021, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
print(n-primes[n-1::-1].index(1)-1, n+primes[n+1:].index(1)+1) | s758617065 | s205664533 | p00044 | python | Runtime Error |
from itertools import takewhile, dropwhile
pn, tmp = [], [i for i in range(2, 50000)]
while tmp[0] < 224:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
while True:
try:
n = int(input())
a, b = list(takewhile(lambda x: x<n, pn))[-1], list(dro... | primes = [0, 0] + [1]*50020
for i in range(2, 226):
if primes[i]:
for j in range(i*i, 50021, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
print(n-primes[n-1::-1].index(1)-1, n+primes[n+1:].index(1)+1) | s841300489 | s205664533 | p00044 | python | Runtime Error |
from itertools import takewhile, dropwhile
pn, tmp = [], [i for i in range(2, 50000)]
while tmp[0] < 224:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
while True:
try:
n = int(input())
except:
break
print(list(takewhile(lambda x... | primes = [0, 0] + [1]*50020
for i in range(2, 226):
if primes[i]:
for j in range(i*i, 50021, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
print(n-primes[n-1::-1].index(1)-1, n+primes[n+1:].index(1)+1) | s098281297 | s205664533 | p00044 | python | Runtime Error |
primes = [0, 0] + [1]*49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
m, o = n-1, n+1
while not primes[m]:
m -= 1
while not primes[o]:
o += 1
print(m, ... | primes = [0, 0] + [1]*50020
for i in range(2, 226):
if primes[i]:
for j in range(i*i, 50021, i):
primes[j] = 0
while True:
try:
n = int(input())
except:
break
print(n-primes[n-1::-1].index(1)-1, n+primes[n+1:].index(1)+1) | s318604868 | s205664533 | p00044 | python | Runtime Error |
a, b = [], []
while True:
try:
x, y = map(int, line.strip().split(","))
a, b = a+[x*y], b+[y]
except:
break
print(sum(a))
print(round(sum(b)/len(b))) | ans = [0, 0]
cnt = 0
while True:
try:
x, y = map(int, input().split(','))
cnt += 1
except:
break
ans[0] += x*y
ans[1] += y
ans[1] = ans[1]/cnt
if int(str(ans[1]).split(".")[0]) > 4:
ans[1] += 1
ans[1] = int(ans[1])
print(*ans, sep="\n") | s294948625 | s131079374 | p00045 | python | Runtime Error |
cups=[True, False, False]
for line in sys.stdin:
l= line.strip().split(",")
if "A"in l and "B"in l:
cups[0], cups[1]= cups[1], cups[1]
elif "A"in l and "C"in l:
cups[0], cups[2]= cups[2], cups[0]
else:
cups[1], cups[2]= cups[2], cups[1]
for i in range(3):
if cups[i]:
... | cup = {"A": 1, "B": 0, "C": 0}
while True:
try:
x, y = input().split(",")
except:
break
cup[x], cup[y] = cup[y], cup[x]
for k, v in cup.items():
if v:
print(k) | s536900963 | s317779781 | p00047 | python | Runtime Error |
import sys
pn, tmp = [], [i for i in range(2, 10000)]
while tmp[0] < 100:
v = tmp.pop(0)
pn.append(v)
tmp = list(filter(lambda x: x%v!=0, tmp))
for t in tmp: pn.append(t)
while True:
n = int(input())
if n==0: break
print(sum([pn[i] for i in range(n)])) | primes = [0, 0] + [1] * 150000
for i in range(2, 388):
if primes[i]:
for j in range(i*i, 150001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
print(sum(values[:n])) | s950248350 | s975765781 | p00053 | python | Runtime Error |
primes = [0,0] + [1]*49999
for i in range(2, 223):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
ans = 0
mid = n // 2
if primes[mid] and n%2 == 0:
ans += 1
left = [k for k, b in enumerate(primes[:m... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | s236916313 | s310460928 | p00056 | python | Time Limit Exceeded |
import bisect
primes = [0,0] + [1]*49999
for i in range(2, 223):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
primes = [k for k, b in enumerate(primes) if b]
while True:
n = int(input())
if n == 0:
break
ans = 0
mid = n // 2
if mid in primes and n%2==0:... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | s512686607 | s310460928 | p00056 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 49999
for i in range(2, 225):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
print(sum(primes[i] and primes[n-i] for i in range(2, n//2+1))) | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | s851500922 | s310460928 | p00056 | python | Time Limit Exceeded |
import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 225):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
tmp = values[:I]
... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | s459649291 | s310460928 | p00056 | python | Time Limit Exceeded |
import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print([i for i, v i... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(input())
if n == 0:
break
I = bisect.bisect(values, n//2)
print(len([1 for v ... | s835115454 | s310460928 | p00056 | python | Runtime Error |
while True:
s = input()
while len(s) != 1:
_new = []
for i in range(len(s)-1):
t = str(int(s[i]) + int(s[i+1]))
_new.append(t if len(t) == 1 else t[1])
s = "".join(_new)
print(s) | while True:
try:
nums = input()
except:
break
a = list(map(int, list(nums)))
while len(a) > 1:
a = [(a[i]+a[i+1])%10 for i in range(len(a)-1)]
print(*a) | s740593369 | s695587548 | p00062 | python | Runtime Error |
import sys
memo = [line.strip() for line in sys.stdin]
at = ""
for i in len(memo):
for j in len(memo[i]):
if not memo[i][j].isdigit():
at += "@"
else:
at += str(memo[i][j])
print(sum(at.replace("@", " ").split())) | import re
ans = 0
while True:
try:
line = input()
except:
print(ans)
break
ans += sum(map(int, re.findall("[0-9]+", line))) | s868684998 | s002513045 | p00064 | python | Runtime Error |
memo = ""
while True:
try:
for s in input():
memo = memo+s if s.isdigit() else memo+"@"
except:
break
print(sum(memo.replace("@", " ").split())) | import re
ans = 0
while True:
try:
line = input()
except:
print(ans)
break
ans += sum(map(int, re.findall("[0-9]+", line))) | s275221911 | s002513045 | p00064 | python | Runtime Error |
import sys
memo, ans = [], ""
for line in sys.stdin: memo.append(line.strip())
for me in memo:
for m in me:
ans = ans+m if m.isdigit() else ans+"@"
print(sum(ans.replace("@", " ").split())) | import re
ans = 0
while True:
try:
line = input()
except:
print(ans)
break
ans += sum(map(int, re.findall("[0-9]+", line))) | s542333089 | s002513045 | p00064 | python | Runtime Error |
ans = ""
while True:
try:
memo = input()
except:
break
for m in memo:
ans = ans+m if m.isdigit() else ans+"@"
print(sum(ans.replace("@", " ").split())) | import re
ans = 0
while True:
try:
line = input()
except:
print(ans)
break
ans += sum(map(int, re.findall("[0-9]+", line))) | s386947484 | s002513045 | p00064 | python | Runtime Error |
dt = {}
def loop():
while True:
line = input()
if line == '':
break
try:
c, d = map(int, line.split(','))
dt[c] = [d] if c not in dt else dt[c]+[d]
except:
break
loop()
loop()
for ab in sorted(dt.items(), key=lambda x: x[0]):
a, b ... | flag = 1
a, b = {},{}
def loop():
global flag
while True:
try:
c, d = map(int, input().split(','))
except:
flag = 0
break
if flag:
a[c] = 1 if c not in a else a[c]+1
else:
b[c] = 1 if c not in b else b[c]+1
loop()
loop(... | s707966913 | s242225301 | p00065 | python | Runtime Error |
dt = {}
def loop():
while True:
line = input()
if line == '\n':
break
try:
c, d = map(int, line.split(','))
dt[c] = [d] if c not in dt else dt[c]+[d]
except:
break
loop()
loop()
for ab in sorted(dt.items(), key=lambda x: x[0]):
a, ... | flag = 1
a, b = {},{}
def loop():
global flag
while True:
try:
c, d = map(int, input().split(','))
except:
flag = 0
break
if flag:
a[c] = 1 if c not in a else a[c]+1
else:
b[c] = 1 if c not in b else b[c]+1
loop()
loop(... | s284399112 | s242225301 | p00065 | python | Runtime Error |
import sys
for line in sys.stdin:
s, w, h = map(float, line.strip().split(","))
print(s if w / (h**2) >= 25) | while True:
try:
s, w, h = map(float, input().split(','))
if w / pow(h, 2) >= 25:
print(int(s))
except:
break | s163478571 | s746595762 | p00075 | python | Runtime Error |
import re
while True:
try:
f = input().split()
except:
break
stack = []
for c in f:
if re.match("-*[0-9]", c) is None:
b, a = stack.pop(), stack.pop()
stack.append(eval("{}{}{}".format(a, c, b)))
else:
stack.append(c)
print("{0:.6f}"... | import re
while True:
try:
f = input().split()
except:
break
stack = []
for c in f:
if re.match("-*[0-9]", c) is None:
b, a = str(stack.pop()), str(stack.pop())
stack.append(float(eval(a+c+b)))
else:
stack.append(c)
print(stack[0]) | s924402791 | s933789952 | p00087 | python | Runtime Error |
from calender import isleap
while True:
a, b = map(int, input().split())
if a == 0:
break
print(sum(isleap(i) for i in range(a, b+1))) | from calendar import isleap
flag = False
while True:
a, b = map(int, input().split())
if a == 0:
break
if flag:
print()
flag = True
ans = [i for i in range(a, b+1) if isleap(i)]
print("\n".join(map(str, ans)) if len(ans) else "NA") | s371606747 | s431462595 | p00093 | python | Runtime Error |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
maxv = max(n)
winner = n.index(maxv)
print(winner, maxv) | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s757947411 | s393108325 | p00099 | python | Time Limit Exceeded |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0:
maxv, winner = max(n), n.index(maxv)
else:
if n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = n.index(m... | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s765578406 | s393108325 | p00099 | python | Runtime Error |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0:
maxv = max(n)
winner = n.index(maxv)
else:
if n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = n... | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s312866716 | s393108325 | p00099 | python | Time Limit Exceeded |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0:
maxv = max(n)
winner = n.index(maxv)
else:
if n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = n... | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s609048864 | s393108325 | p00099 | python | Time Limit Exceeded |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = n.index(maxv)
... | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s414737051 | s393108325 | p00099 | python | Time Limit Exceeded |
n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = min(winner, a)
... | n, q = map(int, input().split())
n = [0]*(n+1)
maxv = winner = 0
for _ in range(q):
a, v = map(int, input().split())
n[a] += v
if v < 0 and a == winner:
maxv = max(n)
winner = n.index(maxv)
elif n[a] > maxv:
maxv, winner = n[a], a
elif n[a] == maxv:
winner = m... | s793063731 | s393108325 | p00099 | python | Time Limit Exceeded |
n = int(input())
dataset = [input().replace("Hoshino", "Hoshina") for _ in range(n)]
print(*dataset, sep="\n")
| n = int(input())
dataset = [input().replace("Hoshino", "Hoshina") for _ in range(n)]
print(*dataset, sep="\n")
| s724673473 | s805370628 | p00101 | python | Runtime Error |
dic = {}
while True:
try:
word, pgn = input().split()
except ValueError:
break
if word in dic.keys():
dic[word].append(int(pgn))
else:
dic[word] = [int(pgn)]
for k, v in dic.items():
print(k)
print(' '.join(map(str, sorted(v)))) | d = {}
while True:
try:
data = input().split()
except:
break
word = data[0]
number = int(data[1])
if word in d:
d[word].append(number)
else:
d[word] = [number]
for k, v in sorted(d.items(), key=lambda x: x[0]):
print(k)
print(*sorted(v))
| s384837652 | s666266486 | p00105 | python | Runtime Error |
dic = {}
while True:
try:
word, pgn = input().split()
if word in dic.keys():
dic[word].append(int(pgn))
else:
dic[word] = [int(pgn)]
except:
for k, v in dic.items():
print(k)
print(' '.join(map(str, sorted(v))))
break | d = {}
while True:
try:
data = input().split()
except:
break
word = data[0]
number = int(data[1])
if word in d:
d[word].append(number)
else:
d[word] = [number]
for k, v in sorted(d.items(), key=lambda x: x[0]):
print(k)
print(*sorted(v))
| s370172250 | s666266486 | p00105 | python | Runtime Error |
dic = {}
while True:
try:
word, pgn = input().split()
if word in dic.keys():
dic[word].append(int(pgn))
else:
dic[word] = [int(pgn)]
except:
break
for k, v in dic.items():
print(k)
print(' '.join(map(str, sorted(v)))) | d = {}
while True:
try:
data = input().split()
except:
break
word = data[0]
number = int(data[1])
if word in d:
d[word].append(number)
else:
d[word] = [number]
for k, v in sorted(d.items(), key=lambda x: x[0]):
print(k)
print(*sorted(v))
| s425090652 | s666266486 | p00105 | python | Runtime Error |
while True:
try:
dataset = input()
except:
break
flag = True
for i in range(10):
sequence = dataset.replace("=", "+").split("+")
if i == 0 and any([True if seq[0]=="X" and len(seq) >= 2 else False for seq in sequence]):
continue
a, b, c = map(int, [seq... | while True:
try:
dataset = input()
except:
break
flag = True
for i in range(10):
sequence = dataset.replace("=", "+").split("+")
if i == 0 and any([True if seq[0]=="X" and len(seq) >= 2 else False for seq in sequence]):
continue
a, b, c = map(int, [seq... | s907938501 | s494556245 | p00110 | python | Runtime Error |
import string
s = {i : "{:05b}".format(c) for i, c in zip(string.ascii_uppercase+" .,-'?", range(32))}
code = {'101': ' ', '000000': "'", '000011': ',', '10010001': '-',
'010001': '.', '000001': '?', '100101': 'A', '10011010': 'B',
'0101': 'C', '0001': 'D', '110': 'E', '01001': 'F', '10011011': 'G',
... | import string
s = {i : "{:05b}".format(c) for i, c in zip(string.ascii_uppercase+" .,-'?", range(32))}
code = {'101': ' ', '000000': "'", '000011': ',', '10010001': '-',
'010001': '.', '000001': '?', '100101': 'A', '10011010': 'B',
'0101': 'C', '0001': 'D', '110': 'E', '01001': 'F', '10011011': 'G',
... | s659766396 | s136411849 | p00111 | python | Time Limit Exceeded |
import string
s = {i : "{:05b}".format(c) for i, c in zip(string.ascii_uppercase+" .,-'?", range(32))}
code = {'101': ' ', '000000': "'", '000011': ',', '10010001': '-',
'010001': '.', '000001': '?', '100101': 'A', '10011010': 'B',
'0101': 'C', '0001': 'D', '110': 'E', '01001': 'F', '10011011': 'G',
... | import string
s = {i : "{:05b}".format(c) for i, c in zip(string.ascii_uppercase+" .,-'?", range(32))}
code = {'101': ' ', '000000': "'", '000011': ',', '10010001': '-',
'010001': '.', '000001': '?', '100101': 'A', '10011010': 'B',
'0101': 'C', '0001': 'D', '110': 'E', '01001': 'F', '10011011': 'G',
... | s960103361 | s136411849 | p00111 | python | Time Limit Exceeded |
b=False
while True:
n = int(input())
if n==0:break
d=dict()
if b:print()
b=True
for _ in range(n):
line = input().split()
tmp = int(line[1])*3+int(line[3]*1)
if tmp in d:
d[tmp].append(line[0])
else:
d[tmp] = []
d[tmp].append(li... | b = False
while True:
n = int(input())
if n == 0:
break
dataset = []
if b:
print()
b = True
for _ in range(n):
name, w, l, d = input().split()
dataset.append((name, 3*int(w) + int(d), n-len(dataset)))
for name, score, _ in sorted(dataset, key=lambda x: (x[1], ... | s265750961 | s927484636 | p00124 | python | Runtime Error |
dataset = [[input().split() for _ in range(8)] for _ in range(3)]
tmp = []
for i in range(3):
s = sorted(dataset[i], key=lambda x: x[1])[:3]
tmp.append(s[-1])
for p in s[:2]:
print(*p)
a, b = sorted(tmp, key=lambda x: x[1])[:2]
print(*a, "\n", *b) | pts = [[input().split() for _ in range(8)] for _ in range(3)]
npts = [sorted(pts[i], key=lambda x: float(x[1]))[:4] for i in range(3)]
ts = [sorted((npts[i][j] for i in range(3) for j in range(2, 4)), key=lambda x: float(x[1]))[:2]]
gen = (print(*npts[i][j]) for i in range(3) for j in range(2))
ans = lambda *x: print(*... | s982495113 | s307052042 | p00138 | python | Runtime Error |
ld, rd = [0, 0, 0, 0]. [0, 0, 0, 0]
while True:
try:
l, r = map(float, input().split())
if l < 0.2:
ld[3] += 1
elif l < 0.6:
ld[2] += 1
elif l < 1.1:
ld[1] += 1
else:
ld[0] += 1
if r < 0.2:
rd[3] += 1
... | ld, rd = [0, 0, 0, 0], [0, 0, 0, 0]
while True:
try:
l, r = map(float, input().split())
if l < 0.2:
ld[3] += 1
elif l < 0.6:
ld[2] += 1
elif l < 1.1:
ld[1] += 1
else:
ld[0] += 1
if r < 0.2:
rd[3] += 1
... | s878780104 | s150710370 | p00149 | python | Runtime Error |
while True:
h1= int(input())
if h1== 0:
break
h2,h3,h4,h5= [int(input()) for _ in range(4)]
l= [h1,h2,h3,h4,h5]
if 1 and 2 and 3 in l:
for _ in range(5): print("3")
else:
for i in range(5):
if l[i]==1:
print('1' if 2 in l '2')
elif ... | while True:
h = int(input())
if h == 0:
break
dataset = [h] + [int(input()) for _ in range(4)]
if len(set(dataset)) == 3 or len(set(dataset)) == 1:
print(*[3]*5, sep="\n")
continue
for data in dataset:
if data == 1:
print(2 if 3 in dataset else 1)
... | s181332284 | s866385131 | p00205 | python | Runtime Error |
while True:
n = int(input())
if n == 0:
break
cnt = 1
for i in range(1, n+1):
tmp = str(cnt)
while '4' in tmp or '6' in tmp:
if '4' in tmp and '6' in tmp:
l = min(tmp.find('4'), tmp.find('6'))
r = len(tmp[l+1:])
cnt += 1... | while True:
n = int(input())
if n == 0:
break
print(str(oct(n)[2:]).translate(str.maketrans("4567", "5789"))) | s690111283 | s596850828 | p00208 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
dataset = [map(int, input().split()) for _ in range(n)]
for map_ in dataset:
pm, pe, pj = map_
x = (pm + pe + pj) // 3
if 100 in p:
print("A")
elif (pm + pe) // 2 >= 90:
print("A")
elif ... | while True:
n = int(input())
if n == 0:
break
dataset = [list(map(int, input().split())) for _ in range(n)]
for p in dataset:
x = (p[0] + p[1] + p[2]) // 3
if 100 in p:
print("A")
elif (p[0] + p[1]) // 2 >= 90:
print("A")
elif x >= 80:
... | s028022355 | s019118985 | p00218 | python | Runtime Error |
while True:
d= float(input())
if d< 0: break
a, b= bin(int(d))[2:].zfill(8)+".", d-int(d)
while 1:
b*= 2
a= a+'1' if int(b)>= 1 else a+'0'
if str(b).split(".")==['1','0']: break
b-=int(b)
a= a.ljust(13, '0')
print("NA" if len(a)> 13 else a) | while True:
d= float(input())
if d< 0: break
a= bin(int(d))[2:]
if len(a)> 8:
print("NA")
else:
a= a.zfill(8)+"."
b= d-int(d)
for _ in range(4):
b*= 2
if int(b)>= 1:
a= a+'1'
b-= 1
else:
... | s721644954 | s040646424 | p00220 | python | Time Limit Exceeded |
while True:
m, n = map(int, input().split())
if m == 0:
break
player = [i+1 for i in range(m)]
j = 0
for i in range(1, n+1):
s = input()
if i % 3 == 0 and i % 5 == 0 and s != 'FizzBuzz':
del player[j]
elif i % 3 == 0 and s != 'Fizz':
del player... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s641695227 | s292080640 | p00221 | python | Runtime Error |
while True:
m, n = map(int, input().split())
if m == 0:
break
player = [i+1 for i in range(m)]
j = 0
for i in range(1, n+1):
s = input()
if i % 3 == 0 and i % 5 == 0 and s != 'FizzBuzz':
del player[j]
elif i % 3 == 0 and s != 'Fizz':
del player... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s779188436 | s292080640 | p00221 | python | Runtime Error |
hoge = [0] + ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(1, 10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
i... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s166932813 | s292080640 | p00221 | python | Runtime Error |
hoge = []
for i in range(10001):
if i % 3 == 0 and i % 5 == 0:
hoge.append("FizzBuzz")
elif i % 3 == 0:
hoge.append("Fizz")
elif i % 5 == 0:
hoge.append("Buzz")
else:
hoge.append(str(i))
while True:
m, n = map(int, input().split())
if m == 0:
break
ma... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s749376468 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx = 0
... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s014683737 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx = 0
... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s383074101 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx = 0
... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s314649972 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx, k = 0... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s311481019 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx, k = 0... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s763666371 | s292080640 | p00221 | python | Runtime Error |
hoge = ["FizzBuzz" if i % 3 == 0 and i % 5 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = [str(i) for i in range(1, m+1)]
a, b = divmod(n, m)
man = a*man+man[:b]
idx, k = 0... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s573217434 | s292080640 | p00221 | python | Runtime Error |
while True:
m, n = map(int, input().split())
if m == 0:
break
player = list(range(1, m+1))
idx = 0
for i in range(1, n+1):
ans = "Fizz"*(i%3==0) + "Buzz"*(i%5==0) or str(i)
if ans == input():
idx += 1
else:
player.pop(idx)
if len(pl... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s350203415 | s292080640 | p00221 | python | Runtime Error |
while True:
m, n = map(int, input().split())
if m == 0:
break
player = list(range(1, m+1))
idx = 0
for i in range(1, n+1):
ans = "Fizz"*(i%3==0) + "Buzz"*(i%5==0) or str(i)
if ans == input():
idx += 1
else:
del player[idx]
if len(pl... | hoge = ["FizzBuzz" if i % 15 == 0 else("Fizz" if i % 3 == 0 else("Buzz" if i % 5 == 0 else str(i))) for i in range(10001)]
while True:
m, n = map(int, input().split())
if m == 0:
break
man = list(range(1, m+1))
game = [input() for _ in range(n)]
idx = 0
for i in range(n):
if gam... | s842161894 | s292080640 | p00221 | python | Runtime Error |
primes = [0, 0] + [1]*999999
for i in range(2, 1001):
for j in range(i*i, 1000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
for i in range(5, n+1)[::-1]:
if primes[i] and primes[i-2] and primes[i-6] and primes[i-8]:
print(i)
break | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s910424754 | s750068638 | p00222 | python | Runtime Error |
primes = [0, 0] + [1]*9999999
for i in range(2, 3163):
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
for i in range(5, n+1)[::-1]:
if primes[i] and primes[i-2] and primes[i-6] and primes[i-8]:
print(i)
break | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s740613032 | s750068638 | p00222 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 9999991
for i in range(2, 3163):
for j in range(i*i, 9999992, i):
if primes[j]:
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
while True:
if primes[n-8] and primes[n-6] and primes[n-2] and primes[n]:
print(n)
... | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s194367573 | s750068638 | p00222 | python | Runtime Error |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
for j in range(i*i, 10000000, i):
if primes[j]:
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
while True:
if primes[n-8] and primes[n-6] and primes[n-2] and primes[n]:
print(n)
... | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s133420392 | s750068638 | p00222 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
while not (primes[n-8] and primes[n-6] and primes[n-2] and primes[n]):
n -= 1
print(n) | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s134884072 | s750068638 | p00222 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
while not (primes[n-8] & primes[n-6] & primes[n-2] & primes[n]):
n -= 1
print(n) | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s323826773 | s750068638 | p00222 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
for i in range(5, n+1)[::-1]:
if primes[i-8] & primes[i-6] & primes[i-2] & primes[i]):
pri... | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s553182694 | s750068638 | p00222 | python | Runtime Error |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
for i in range(5, n+1)[::-1]:
if primes[i-8] & primes[i-6] & primes[i-2] & primes[i]:
prin... | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s134756928 | s750068638 | p00222 | python | Time Limit Exceeded |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
while not (primes[n] & primes[n-2] & primes[n-6] & primes[n-8]):
n -= 1
print(n) | import bisect
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(input())
if n == 0:
break
index = bisect.bisect(values, n)
for i in ... | s495128173 | s750068638 | p00222 | python | Time Limit Exceeded |
while True:
r, a= input().split()
if r==a==0: break
print(sum(1 for i, j in zip(r, a) if i==j), sum(1 for i in range(len(r)) for j in range(len(a)) if r[i]==a[j] and i!=j)) | while True:
r, a= input().split()
if r==a=='0': break
print(sum(1 for i, j in zip(r, a) if i==j), sum(1 for i in range(len(r)) for j in range(len(a)) if r[i]==a[j] and i!=j)) | s606870645 | s103519379 | p00226 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.