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
lst = []
for line in sys.stdin:
num = int(line)
if num == 0:
print lst.pop()
else:
lst.append(num) | import sys
lst = []
for line in sys.stdin:
if line.strip() :
num = int(line.strip())
if num == 0:
print lst.pop()
else:
lst.append(num) | s158627240 | s853909036 | p00013 | python | Runtime Error |
import sys
lst = []
for line in sys.stdin:
num = int(line)
if num == 0:
print lst.pop()
else:
lst.append(num) | import sys
lst = []
for line in sys.stdin:
if line.strip() :
num = int(line.strip())
if num == 0:
print lst.pop()
else:
lst.append(num) | s105079859 | s853909036 | p00013 | python | Runtime Error |
import sys
lst = []
for line in sys.stdin:
num = int(line.split())
if num == 0:
print lst.pop()
else:
lst.append(num)
sys.exit(0) | import sys
lst = []
for line in sys.stdin:
if line.strip() :
num = int(line.strip())
if num == 0:
print lst.pop()
else:
lst.append(num) | s627778925 | s853909036 | p00013 | python | Runtime Error |
import sys
lst = []
for line in sys.stdin:
num = int(line.strip())
if num == 0:
print lst.pop()
else:
lst.append(num) | import sys
lst = []
for line in sys.stdin:
if line.strip() :
num = int(line.strip())
if num == 0:
print lst.pop()
else:
lst.append(num) | s248530839 | s853909036 | p00013 | python | Runtime Error |
def dfs(hands, pair):
hands.sort()
if not hands:
return True
target = hands[0]
# sequence
if all(map(lambda x: x in hands, range(target, target + 3))):
for i in range(target, target + 3):
hands.remove(i)
if dfs(hands, pair):
return True
for i... | import sys
def dfs(hands, pair):
hands.sort()
if not hands:
return True
target = hands[0]
# sequence
if all(map(lambda x: x in hands, range(target, target + 3))):
for i in range(target, target + 3):
hands.remove(i)
if dfs(hands, pair):
return True
... | s244894053 | s741221675 | p00043 | python | Runtime Error |
def dfs(hands, pair):
hands.sort()
if not hands:
return True
target = hands[0]
# sequence
if all(map(lambda x: x in hands, range(target, target + 3))):
for i in range(target, target + 3):
hands.remove(i)
if dfs(hands, pair):
return True
for i... | import sys
def dfs(hands, pair):
hands.sort()
if not hands:
return True
target = hands[0]
# sequence
if all(map(lambda x: x in hands, range(target, target + 3))):
for i in range(target, target + 3):
hands.remove(i)
if dfs(hands, pair):
return True
... | s029031198 | s741221675 | p00043 | python | Runtime Error |
#!/usr/bin/env python:
# -*- coding: utf-8 -*-
import sys
def make_prime_list(lim):
lst = [True for i in xrange(lim + 1)]
num = 2
while num ** 2 <= lim:
for i in xrange(num * 2, lim + 1, num):
lst[i] = False
num += 1
while not lst[num]:
num += 1
return ... | #!/usr/bin/env python:
# -*- coding: utf-8 -*-
import sys
def make_prime_list(lim):
lst = [True for i in xrange(lim + 1)]
num = 2
while num ** 2 <= lim:
for i in xrange(num * 2, lim + 1, num):
lst[i] = False
num += 1
while not lst[num]:
num += 1
return ... | s368132760 | s071993661 | p00056 | python | Time Limit Exceeded |
#!/usr/bin/env python:
# -*- coding: utf-8 -*-
import sys
def make_prime_list(lim):
lst = [True for i in xrange(lim + 1)]
num = 2
while num ** 2 <= lim:
for i in xrange(num * 2, lim + 1, num):
lst[i] = False
num += 1
while not lst[num]:
num += 1
return ... | #!/usr/bin/env python:
# -*- coding: utf-8 -*-
import sys
def make_prime_list(lim):
lst = [True for i in xrange(lim + 1)]
num = 2
while num ** 2 <= lim:
for i in xrange(num * 2, lim + 1, num):
lst[i] = False
num += 1
while not lst[num]:
num += 1
return ... | s068949266 | s071993661 | p00056 | python | Time Limit Exceeded |
a = int(input())
PI = 3.1415926535
print("%f %f" % (a*a*PI, a*PI*2)) | a = float(input())
PI = 3.14159265358979323846
print("%f %f" % (a*a*PI, a*PI*2)) | s352091909 | s913697448 | p02479 | python | Runtime Error |
import sys;print"\n".join("%d %d"%(lambda l:(l[0],l[2]/l[0]*l[1]))(lambda f,l:(f(f,l),l[0],l[1]))(lambda f,l:l[1]==0 and l[0] or f(f,[l[1],l[0]%l[1]]),map(int,s.split()))for s in sys.stdin) | import sys;print"\n".join("%d %d"%(lambda l:(l[0],l[2]/l[0]*l[1]))((lambda f,l:(f(f,l),l[0],l[1]))(lambda f,l:l[1]==0 and l[0] or f(f,[l[1],l[0]%l[1]]),map(int,s.split())))for s in sys.stdin) | s447602078 | s541998475 | p00005 | python | Runtime Error |
while 1:
n = int(raw_input())
cnt = 0;
for i in range(0, 10):
for j in range(0, 10):
for k in range(0, 10):
for l in range(0, 10):
if n == i+j+k+l: cnt+=1
print cnt | while True:
try:
n = int(raw_input())
cnt = 0;
for i in range(0, 10):
for j in range(0, 10):
for k in range(0, 10):
for l in range(0, 10):
if n == i+j+k+l: cnt+=1
print cnt
except EOFError:
... | s930076321 | s304559503 | p00008 | python | Runtime Error |
l=[]
while True:
s = raw_input()
if s=="":
break
l.append(s)
l.sort()
l.reverse()
for i in range(3):
print l.pop(0) | l=[]
while True:
try:
l.append(input())
except EOFError:
break
l.sort(reverse = True)
for i in range(3):
print l[i] | s125423610 | s508355022 | p00001 | python | Runtime Error |
l=[]
while True:
try:
l.append(input())
except SyntaxError:
break
l.sort(reverse = True)
for i in range(3):
print l[i] | l=[]
while True:
try:
l.append(input())
except EOFError:
break
l.sort(reverse = True)
for i in range(3):
print l[i] | s196059089 | s508355022 | p00001 | python | Runtime Error |
a,b=map(int,input().split(" "))
print(a*b,2*(a+b)) | a,b=map(int,raw_input().split())
print a*b, 2*a+2*b | s589586977 | s393007593 | p02481 | python | Runtime Error |
a,b = map(int,input().split())
print(a*b,2*a+2*b) | a,b=map(int,raw_input().split())
print a*b, 2*a+2*b | s945151209 | s393007593 | p02481 | python | Runtime Error |
a,b=map(int,input().split())
print a*b, 2*a+2*b | a,b=map(int,raw_input().split())
print a*b, 2*a+2*b | s692241494 | s393007593 | p02481 | python | Runtime Error |
while True:
l = map(int,raw_input())
if l==[0,0]:
break
l.sort()
print " ".join(l) | while True:
l = map(int,raw_input().split())
if l==[0,0]:
break
l.sort()
s = [str(x) for x in l]
print " ".join(s) | s200232469 | s152820985 | p02490 | python | Runtime Error |
for i in range(1:10):
for j in range(1,10):
print(i,"x",j,"=",i*j) | for i in range(1,10):
for j in range(1,10):
print(i,"x",j,"=",i*j,sep="") | s729728844 | s646587510 | p00000 | python | Runtime Error |
for line in sys.stdin:
a, b = map(int, line.split())
print(int(math.log(a + b, 10)//1 + 1)) | import sys
import math
for line in sys.stdin:
a, b = map(int, line.split())
print(int(math.log10(a + b) + 1)) | s756445329 | s671277314 | p00002 | python | Runtime Error |
n = int(input())
for i in range(n):
l = list(map(int, line.split()))
l.sort()
if l[0]**2 + l[1]**2 == l[3]**2: print("YES")
else: print("NO") | n = int(input())
for i in range(n):
l = list(map(int, input().split()))
l.sort()
if l[0]**2 + l[1]**2 == l[2]**2: print("YES")
else: print("NO") | s857595348 | s513020301 | p00003 | python | Runtime Error |
import math
while True:
try:
c = 0
n = int(input())
for i in range(n,1,-1):
if i == 2:
c += 1
break
elif i%2 == 0:
continue
else:
j = 3
while j <= math.sqrt(i):
... | n = 999999
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
try:
n = int(input())
print(sum(c[:n]))
except:
break | s826794818 | s362702933 | p00009 | python | Time Limit Exceeded |
import math
while True:
try:
n = int(input())
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
print(sum(c))
except:
break | n = 999999
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
try:
n = int(input())
print(sum(c[:n]))
except:
break | s807957153 | s362702933 | p00009 | python | Time Limit Exceeded |
import numpy
while True:
try:
x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
if numpy.sign(s1) == numpy.sign(s2) and numpy.sign(s1) == numpy.sig... | import math
while True:
try:
x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
if math.copysign(1, s1) == math.copysign(1, s2) and math.copysign(1,... | s279950012 | s544729804 | p00012 | python | Runtime Error |
import numpy
while True:
try:
x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
if numpy.sign(s1) == numpy.sign(s2) and numpy.sign(s1) == numpy.sig... | import math
while True:
try:
x1, y1, x2, y2, x3, y3, xp, yp = map(float, input().split())
s1 = (x2-x1)*(yp-y1) - (y2-y1)*(xp-x1)
s2 = (x3-x2)*(yp-y2) - (y3-y2)*(xp-x2)
s3 = (x1-x3)*(yp-y3) - (y1-y3)*(xp-x3)
if math.copysign(1, s1) == math.copysign(1, s2) and math.copysign(1,... | s437718869 | s544729804 | p00012 | python | Runtime Error |
import math
n = int(input())
for i in range(n):
x = int(input())
y = int(input())
if int(math.log10(x + y) + 1) > 80:
print("overflow")
else:
print(x + y)
| n = int(input())
for i in range(n):
x = int(input())
y = int(input())
if len(str(x + y)) > 80:
print("overflow")
else:
print(x + y)
| s639198803 | s755265421 | p00015 | python | Runtime Error |
import math
n = int(input())
for i in range(n):
x = int(input())
y = int(input())
if int(math.log10(x + y) + 1) > 80:
print("overflow")
else:
print(x + y)
| n = int(input())
for i in range(n):
x = int(input())
y = int(input())
if len(str(x + y)) > 80:
print("overflow")
else:
print(x + y)
| s528050985 | s755265421 | p00015 | python | Runtime Error |
while True:
n = int(input())
if n == 0:
break
sum_max = 0
a = []
for i in range(n):
a.append(int(input()))
for j in range(i + 1):
sum_tmp = sum(a[j:i + 1])
if sum_tmp > sum_max:
sum_max = sum_tmp
print(sum_max)
| while True:
n = int(input())
if n == 0:
break
dp = [int(input())]
for i in range(1, n):
a_i = int(input())
dp.append(max(dp[i - 1] + a_i, a_i))
print(max(dp))
| s118285237 | s738439384 | p00022 | python | Time Limit Exceeded |
import numpy as np
p = np.zeros((14,14), dtype=int)
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] += 1
p[y][x-1:x+2] += 1
p[y+1][x] += 1
elif s == 2:
p[y-1][x-1... | p = [[0 for i in range(14)] for j in range(14)]
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] = p[y-1][x] + 1
p[y][x-1] = p[y][x-1] + 1
p[y][x] = p[y][x] + 1
p[y][x+... | s336003007 | s315495998 | p00026 | python | Runtime Error |
import numpy as np
p = np.zeros((14,14), dtype=int)
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] += 1
p[y][x-1:x+2] += 1
p[y+1][x] += 1
elif s == 2:
p[y-1][x-1:... | p = [[0 for i in range(14)] for j in range(14)]
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] = p[y-1][x] + 1
p[y][x-1] = p[y][x-1] + 1
p[y][x] = p[y][x] + 1
p[y][x+... | s205340921 | s315495998 | p00026 | python | Runtime Error |
p = np.zeros((14,14), dtype=int)
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] += 1
p[y][x-1:x+2] += 1
p[y+1][x] += 1
elif s == 2:
p[y-1][x-1:x+2] += 1
... | p = [[0 for i in range(14)] for j in range(14)]
while True:
try:
x_inp, y_inp, s = map(int, input().split(","))
x = x_inp + 2
y = y_inp + 2
if s == 1:
p[y-1][x] = p[y-1][x] + 1
p[y][x-1] = p[y][x-1] + 1
p[y][x] = p[y][x] + 1
p[y][x+... | s971486144 | s315495998 | p00026 | python | Runtime Error |
import itertools
case = 0
while True:
case += 1
w_max = int(input())
if w_max == 0:
break
n = int(input())
t = []
for i in range(n):
t.append(list(map(int, input().split(","))))
v_best = 0
w_best = 0
p_all = itertools.product([0,1], repeat=n)
for p in p_all:
... | case = 0
while True:
case += 1
w_max = int(input())
if w_max == 0:
break
n = int(input())
w = [0 for i in range(n)]
v = [0 for i in range(n)]
for i in range(n):
a, b = map(int, input().split(","))
v[i] = a
w[i] = b
dp = [[0 for j in range(w_max + 1)] for... | s578653006 | s651325012 | p00042 | python | Time Limit Exceeded |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
try:
n = int(input())
i, a, b = 0, 0, 0
while a == 0 or b == 0:
i += 1
if n - i - 1 >= 0 and a == 0 and c[n - ... | n = 50021
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
try:
n = int(input())
i, a, b = 0, 0, 0
while a == 0 or b == 0:
i += 1
if n - i - 1 >= 0 and a == 0 and c[n - ... | s150179744 | s955989752 | p00044 | python | Time Limit Exceeded |
d = {"A":1, "B":0, "C":0}
while True:
try:
swap1, awap2 = input().split(",")
d[swap1], d[swap2] = d[swap2], d[swap1]
except:
break
print(d.keys()[d.values().index(1)])
| d = {"A":1, "B":0, "C":0}
while True:
try:
swap1, swap2 = input().split(",")
d[swap1], d[swap2] = d[swap2], d[swap1]
except:
break
print(list(d.keys())[list(d.values()).index(1)])
| s323539676 | s818452672 | p00047 | python | Runtime Error |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n):
if c[i] == 1 and... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s831846921 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n):
if c[i] == 1 and... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s001390128 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n):
if c[i] == 1 and... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s515099328 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n):
if c[i] == 1 and... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s639501380 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n/2):
if c[i] == 1 a... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s221123097 | s870389254 | p00056 | python | Runtime Error |
n = 50001
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n//2):
if c[i] == 1 ... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s336322904 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
if n == 0:
break
elif n%2 == 1:
print(0)
continue
cnt = 0
for i in range(n//2):
if c[i] == 1 ... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s096083813 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
cnt = 0
if n == 0:
break
elif n%2 == 0:
for i in range(n//2):
if c[i] == 1 and c[n-i] == 1:
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s468114715 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50000
c = [1 for i in range(n)]
c[0] = 0
i = 2
while i**2 <= n:
j = i*2
while j <= n:
c[j - 1] = 0
j += i
i += 1
while True:
n = int(input())
cnt = 0
if n == 0:
break
elif n%2 == 0:
for i in range(0, n//2, 2):
if c[i] == 1 and c[n-i-2] == 1:
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s501149807 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n):
cnt = 0
if i%2 == 0:
for j in range(n):
if is_prime[j... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s730677859 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n):
cnt = 0
if i%2 == 0:
for j in range(0, n//2):
if is_p... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s641389665 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n):
if is_prime[i]:
for j in range(i, n):
if i + j >= n:
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s058355479 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 30000
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n):
if is_prime[i]:
for j in range(i, n):
if i + j >= n:
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s417453957 | s870389254 | p00056 | python | Runtime Error |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n):
if is_prime[i]:
for j in range(i, n):
if i + j >= n:
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s703984394 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(n//2):
if is_prime[i]:
for j in range(i, n - i):
if is_prime[j... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s624066049 | s870389254 | p00056 | python | Time Limit Exceeded |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(3, n//2, 2):
if is_prime[i]:
for j in range(i, n - i, 2):
if i... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(input())
if n == 0:... | s757624296 | s870389254 | p00056 | python | Time Limit Exceeded |
def check(s_i, n_i, count, i_set):
for i in range(9):
i_set_tmp = set(i_set)
if i not in i_set_tmp:
continue
s_tmp = s_i
n_tmp = n_i
if s_tmp == 0 and n_tmp == 0:
return count + 1
elif s_tmp < 0 or n_tmp == 0:
break
else:
... | s_max = [0]
for i in range(1,11):
s = 0
for j in range(i):
s += (10 - j - 1)*(i - j)
s_max.append(s)
def check(u, r, s, m):
if r == 0:
return s == 0
n = 0
for i in range(10):
n *= 2
if u[i]:
n += 1
if (n, r, s) in m:
return m[(n, r, s)]
... | s387537062 | s815917128 | p00070 | python | Time Limit Exceeded |
def check(s_i, n_i, count, i_set):
for i in range(9):
print("s:",s_i,"n:",n_i,"i:",i,"count:",count)
i_set_tmp = set(i_set)
if i not in i_set:
continue
s_tmp = s_i - i*n_i
n_tmp = n_i - 1
if s_tmp == 0 and n_tmp == 0:
return count + 1
e... | s_max = [0]
for i in range(1,11):
s = 0
for j in range(i):
s += (10 - j - 1)*(i - j)
s_max.append(s)
def check(u, r, s, m):
if r == 0:
return s == 0
n = 0
for i in range(10):
n *= 2
if u[i]:
n += 1
if (n, r, s) in m:
return m[(n, r, s)]
... | s365019295 | s815917128 | p00070 | python | Time Limit Exceeded |
def check(s_i, n_i, count, i_set):
for i in range(9):
i_set_tmp = set(i_set)
if i not in i_set:
continue
if s_i == 0 and n_i == 0:
return count + 1
elif s_i < 0 or n_i < 0:
break
else:
s_tmp = s_i - i*n_i
n_tmp = n_i... | s_max = [0]
for i in range(1,11):
s = 0
for j in range(i):
s += (10 - j - 1)*(i - j)
s_max.append(s)
def check(u, r, s, m):
if r == 0:
return s == 0
n = 0
for i in range(10):
n *= 2
if u[i]:
n += 1
if (n, r, s) in m:
return m[(n, r, s)]
... | s664455681 | s815917128 | p00070 | python | Time Limit Exceeded |
import math
n = 7
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
ang += math.asin(1/math.sqrt(i - 1))
x[i] = x[i - 1] + math.cos(ang)
y[i] = y[i - 1] + math.sin(ang)
while True:
n = int(input())
if n == -1:
break
print(x[n])
print(y[n])
| import math
n = 1001
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
ang += math.asin(1/math.sqrt(i - 1))
x[i] = x[i - 1] + math.cos(ang)
y[i] = y[i - 1] + math.sin(ang)
while True:
n = int(input())
if n == -1:
break
print(x[n])
print(y[n])
| s161200916 | s614513677 | p00076 | python | Runtime Error |
import math
n = 7
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
ang += math.asin(1/math.sqrt(i - 1))
x[i] = x[i - 1] + math.cos(ang)
y[i] = y[i - 1] + math.sin(ang)
while True:
n = int(input())
if n == -1:
break
print(x[n])
print(y[n])
| import math
n = 1001
x = [1 for i in range(n)]
y = [0 for i in range(n)]
ang = 0
for i in range(2, n):
ang += math.asin(1/math.sqrt(i - 1))
x[i] = x[i - 1] + math.cos(ang)
y[i] = y[i - 1] + math.sin(ang)
while True:
n = int(input())
if n == -1:
break
print(x[n])
print(y[n])
| s233890068 | s614513677 | p00076 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 =... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s263563126 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 =... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s559412775 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 =... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s705426371 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s815109226 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s728797119 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s777396027 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s093903565 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s563706308 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s700517780 | s301222131 | p00090 | python | Runtime Error |
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + ... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s475461386 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s314719186 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
if a2 < 10e-6:
return [None, None], [No... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s129204235 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s311494622 | s301222131 | p00090 | python | Runtime Error |
import math
import sys
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s158235758 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s307378979 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s265367778 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s230477463 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s814436837 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s295198399 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s309225317 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s000228292 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s657835663 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s236327135 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 < d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b*... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s875163946 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s002537637 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s586536149 | s301222131 | p00090 | python | Runtime Error |
import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s294848920 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s426291203 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 - d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b*... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s376445301 | s301222131 | p00090 | python | Runtime Error |
import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b... | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
if dist(o1,o2) > 2:
p1, p2 = [None, None], [None, None]
elif dist(o1,o2) == 2:
p1, p2 = [(o1[0] + o2[0])/2, (o1[1] + o2[1])/2], [None, None]
else:
m = [(o1[0] + o2... | s875479376 | s301222131 | p00090 | python | Runtime Error |
import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab... | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
for i in range(size):
if not fab[y ... | s973821927 | s620471999 | p00091 | python | Runtime Error |
import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab... | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
for i in range(size):
if not fab[y ... | s556029709 | s620471999 | p00091 | python | Runtime Error |
import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab... | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
for i in range(size):
if not fab[y ... | s248544598 | s620471999 | p00091 | python | Runtime Error |
import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab... | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
for i in range(size):
if not fab[y ... | s813126159 | s620471999 | p00091 | python | Runtime Error |
import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
... | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
for i in range(size):
if not fab[y ... | s083858555 | s620471999 | p00091 | python | Runtime Error |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
ans = 0
for i in range(n):
p = [(x, y) for x in range(n - i) for y in range(n - i)]
for x, y in p:
if inp[y][x] == ".":
pp = [(xx, yy) f... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s783240619 | s936799328 | p00092 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
ans = 0
p_all = set([(x, y) for x in range(n) for y in range(n)])
for i in range(n):
p = [(x, y) for x in range(n - i) for y in range(n - i) if (x, y) in p_all]
... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s340903134 | s936799328 | p00092 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
ans = 0
for i in range(n)[::-1]:
p = [(x, y) for x in range(n - i) for y in range(n - i)]
for x, y in p:
if inp[y][x] == ".":
pp = [(xx,... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s068081918 | s936799328 | p00092 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sum_dot = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
sum_dot[y + 1][x + 1] = sum_dot[y][x + 1] + inp[y][:x + 1... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s076698348 | s936799328 | p00092 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sum_dot = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
sum_dot[y + 1][x + 1] = sum_dot[y][x + 1] + inp[y][:x + 1... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s567917455 | s936799328 | p00092 | python | Time Limit Exceeded |
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sum_dot = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
sum_dot[y + 1][x + 1] = sum_dot[y][x + 1] + inp[y][:x + 1... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s482483895 | s936799328 | p00092 | python | Time Limit Exceeded |
import math
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sum_dot = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
sum_dot[y + 1][x + 1] = sum_dot[y][x + 1] + ... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s346983674 | s936799328 | p00092 | python | Time Limit Exceeded |
import math
while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sum_dot = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
sum_dot[y + 1][x + 1] = sum_dot[y][x + 1] + ... | while True:
n = int(input())
if n == 0:
break
inp = []
for i in range(n):
inp.append(list(input()))
sq_max = [[0 for i in range(n + 1)] for j in range(n + 1)]
for y in range(n):
for x in range(n):
if inp[y][x] == ".":
sq_max[y + 1][x ... | s524916506 | s936799328 | p00092 | python | Time Limit Exceeded |
import itertools
while True:
n, s = map(int, input().split())
count = 0
if n == 0:
break
for c in itertools.combinations([i for i in range(100)], n):
if sum(c) == s:
count += 1
print(count)
| ans = [[0 for i in range(1001)] for j in range(11)]
ans[0][0] = 1
for i in range(101):
for n in range(9, -1, -1):
for s in range(1001 - i):
ans[n + 1][s + i] += ans[n][s]
while True:
n, s = map(int, input().split())
if n == 0:
break
print(ans[n][s])
| s222349754 | s558874305 | p00097 | python | Time Limit Exceeded |
def fibonacci(n)
if n == 0 or n == 1:
return 1
return fibonacci(n - 2) + fibonacci(n - 1)
print(fibonacci(int(input()))) | def fibonacci(f, n):
if n == 0 or n == 1:
f[n] = 1
return f[n]
if f[n]:
return f[n]
f[n] = fibonacci(f, n - 2) + fibonacci(f, n - 1)
return f[n]
n = int(input())
f = [None for i in range(n + 1)]
print(fibonacci(f, n)) | s799506020 | s067217897 | p02233 | python | Runtime Error |
def fibonacci(n):
if n == 0 or n == 1:
return 1
return fibonacci(n - 2) + fibonacci(n - 1)
print(fibonacci(int(input()))) | def fibonacci(f, n):
if n == 0 or n == 1:
f[n] = 1
return f[n]
if f[n]:
return f[n]
f[n] = fibonacci(f, n - 2) + fibonacci(f, n - 1)
return f[n]
n = int(input())
f = [None for i in range(n + 1)]
print(fibonacci(f, n)) | s825385033 | s067217897 | p02233 | python | Time Limit Exceeded |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.