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 |
|---|---|---|---|---|---|---|
# -*- coding: utf-8 -*-
r = int(input().strip())
p = 3.14159265
m = r * r * p
l = 2 * r * p
print("{0:.6f} {1:.6f}".format(m,l)) | # -*- coding: utf-8 -*-
r = float(input().strip())
p = 3.141592653589793238
m = r * r * p
l = 2 * r * p
print("{0:.6f} {1:.6f}".format(m,l)) | s282810162 | s102676018 | p02400 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??´?????????
"""
while True:
inp = input().strip().split(" ")
n = int(inp[0]) + 1
x = int(inp[1])
cnt = 0
if n < 1 and x < 1:
break
for i in range(1, n-2):
for j in range(i + 1, n-1):
for k in range(j + 1, n):
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??´?????????
"""
while True:
inp = input().strip().split(" ")
n = int(inp[0]) + 1
x = int(inp[1])
cnt = 0
if n < 2 and x < 1:
break
for i in range(1, n-2):
for j in range(i + 1, n-1):
for k in range(j + 1, n):
... | s399663049 | s626627516 | p02412 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??´?????????
"""
inp = input().strip().split(" ")
row = int(inp[0])
col = int(inp[1])
cells = [[0 for r in range(row+1)] for c in range(col+1)]
for r in range(row):
inp = input().strip().split(" ")
for c in range(col):
cells[r][c] = int(inp[c])
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??´?????????
"""
inp = input().strip().split(" ")
row = int(inp[0])
col = int(inp[1])
cells = [[0 for r in range(col+1)] for c in range(row+1)]
for r in range(row):
inp = input().strip().split(" ")
for c in range(col):
cells[r][c] = int(inp[c])
... | s477048154 | s747560109 | p02413 | python | Runtime Error |
def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = []
R = []
... | def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = A[left:mid] + [10... | s589542947 | s015931381 | p02272 | python | Time Limit Exceeded |
def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = []
R = []
... | def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = A[left:mid] + [10... | s914276764 | s015931381 | p02272 | python | Time Limit Exceeded |
def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = []
R = []
... | def mergeSort(A, left, right, n):
if left + 1 < right:
mid = int((right + left ) / 2 )
mergeSort(A, left, mid, n)
mergeSort(A, mid, right, n)
return (merge(A, left, mid, right, n))
def merge(A, left, mid, right, n):
n1 = mid - left
n2 = right - mid
L = A[left:mid] + [10... | s251209828 | s015931381 | p02272 | python | Time Limit Exceeded |
input()
s=map(int,raw_input().split())
input()
t=map(int,raw_input().split())
ans=0
for i in t:
for k in s:
if i==k:
ans+=1
break
print ans | n=input()
s=map(int,raw_input().split())
q=input()
t=map(int,raw_input().split())
s.sort()
count=0
for i in t:
low=1
hi=n-1
ce=(low+hi)/2
while low<=hi:
if i==s[ce]:
break
elif i>s[ce]:
low=ce+1
elif i<s[ce]:
hi=ce-1
ce=(low+hi)/2
... | s444577994 | s670402682 | p02526 | python | Time Limit Exceeded |
height = []
while 1:
h = raw_input()
if h == '': break
h = int(h)
height.append(h)
height.sort(reverse=True)
for i in range(3):
print height[i] | height = []
while 1:
try:
height.append(input())
except EOFError:
break
height.sort(reverse=True)
for i in range(3):
print height[i] | s700829087 | s365381008 | p00001 | python | Runtime Error |
height = []
while 1:
try:
height.append(input())
except EOFError:
break
height.sort(reverse=True)
for i in range(3):
print height[i] | while 1:
try:
a,b = map(int, raw_input().split())
n = a+b
print len(str(n))
except EOFError:
break | s175550268 | s705893489 | p00002 | python | Runtime Error |
def GCM(m, n):
r = m%n
if r == 0: return n
else: return GCM(n, r)
while 1:
try:
n = input()
c = 0
for i in range(2,n+1):
for j in range(2,i):
if GCM(i, j) != 1:
break
else:
c += 1
print c... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s605445728 | s719083059 | p00009 | python | Time Limit Exceeded |
import math
def isPrime(n):
if n == 2:
return True
if n%2 == 0:
return False
nMax = int(math.sqrt(n))+1
for i in range(3, nMax+1):
if n%i == 0: return False
else: return True
while 1:
try:
n = input()
c = 0
for i in range(2,n+1):
... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s704464455 | s719083059 | p00009 | python | Time Limit Exceeded |
import math
def isPrime(n, primes):
if n == 2:
return True
if n%2 == 0:
return False
nMax = int(math.sqrt(n))+1
for i in range(3, nMax+1):
if n%i == 0: return False
else:
primes.append(n)
return True
while 1:
try:
n = input()
c = ... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s532482155 | s719083059 | p00009 | python | Time Limit Exceeded |
import math
while 1:
try:
n = input()
c = 0
ps = [False for i in range(n)]
for i in range(2, n):
ps[i] = True
for i in range(2, int(math.sqrt(n)+1)):
if ps[i]:
for j in range(i**2, n, i):
ps[j] = False
... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s434664236 | s719083059 | p00009 | python | Time Limit Exceeded |
while 1:
try:
n = input()
c = 0
ps = [False for i in range(n)]
for i in range(2, n):
ps[i] = True
for i in range(2, int(n**0.5+1)):
if ps[i]:
for j in range(i**2, n, i):
ps[j] = False
for i in ra... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s960361164 | s719083059 | p00009 | python | Time Limit Exceeded |
while 1:
try:
n = input()
c = 0
ps = [False for i in range(n)]
for i in xrange(2, n):
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n, i):
ps[j] = False
for i in... | n = 10**6
c = 0
ps = [False]*(n+1)
for i in xrange(2, n+1):
if i%2 != 0 or i == 2:
ps[i] = True
for i in xrange(2, int(n**0.5+1)):
if ps[i]:
for j in xrange(i**2, n+1, i):
ps[j] = False
while 1:
try:
n = input()
if n == 2: print 1
else: print len([0 for i... | s711398326 | s719083059 | p00009 | python | Time Limit Exceeded |
#coding: utf-8
def isInOut(p, q, s, c, z):
if (p*c[0] + q*c[1] - s)*(p*z[0] + q*z[1] - s) > 0:
return True
else:
return False
while 1:
try:
x = [0 for i in xrange(3)]
y = [0 for i in xrange(3)]
c = [0 for i in xrange(2)]
z = [0 for i in xrange(2)]
a,b... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s869722286 | s829678721 | p00012 | python | Runtime Error |
#coding: utf-8
def isInOut(p, q, s, c, z):
if (p*c[0] + q*c[1] - s)*(p*z[0] + q*z[1] - s) > 0:
return True
else:
return False
while 1:
try:
x = [0 for i in xrange(3)]
y = [0 for i in xrange(3)]
c = [0 for i in xrange(2)]
z = [0 for i in xrange(2)]
t =... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s690031725 | s829678721 | p00012 | python | Runtime Error |
#coding: utf-8
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
whi... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s819824163 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s404757191 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s630839477 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
def main():
wh... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s277764634 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s905289987 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s198977166 | s829678721 | p00012 | python | Runtime Error |
def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | def dot(a, b):
return (a.real*b.real - a.imag*b.imag)
def cross(a, b):
return (a.real*b.imag - a.imag*b.real)
EPS = 10**(-7)
def isIntersectedLS(a1, a2, b1, b2):
return ((cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1)) < EPS and
(cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1)) < EPS)
while 1:
try:
... | s015594002 | s829678721 | p00012 | python | Runtime Error |
tracks = []
while 1:
try:
c = input()
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | tracks = []
while 1:
try:
c0 = raw_input()
if c0 == '':
break
c = int(c0)
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | s815866707 | s702641892 | p00013 | python | Runtime Error |
tracks = []
while 1:
try:
c = input()
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | tracks = []
while 1:
try:
c0 = raw_input()
if c0 == '':
break
c = int(c0)
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | s417411829 | s702641892 | p00013 | python | Runtime Error |
tracks = []
while 1:
try:
c = int(raw_input())
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | tracks = []
while 1:
try:
c0 = raw_input()
if c0 == '':
break
c = int(c0)
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | s314927296 | s702641892 | p00013 | python | Runtime Error |
tracks = []
while 1:
try:
c0 = raw_input()
c = int(c0)
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | tracks = []
while 1:
try:
c0 = raw_input()
if c0 == '':
break
c = int(c0)
if c == 0:
print tracks.pop()
else:
tracks.append(c)
except EOFError:
break | s015296118 | s702641892 | p00013 | python | Runtime Error |
while 1:
n = input()
a,b = (0,0)
for i in range(n):
x = map(int, raw_input().split())
if x[0] > x[1]:
a += x[0] + x[1]
elif x[0] < x[1]:
b += x[0] + x[1]
else:
... | while 1:
n = input()
if n == 0: break
a,b = (0,0)
for i in range(n):
x = map(int, raw_input().split())
if x[0] > x[1]:
a += x[0] + x[1]
elif x[0] < x[1]:
b += x[0] + x[1]
else:... | s125743489 | s657421636 | p00423 | python | Runtime Error |
while 1:
n = input()
if n == 0: break
for i in range(n):
if i == 0: ns = str(input())
else: pass
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
... | while 1:
n = input()
if n == 0: break
for j in range(n):
if j == 0: ns = raw_input()
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | s510069027 | s499319075 | p00429 | python | Runtime Error |
while 1:
n = input()
if n == 0: break
for i in range(n):
if i == 0: ns = str(input())
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | while 1:
n = input()
if n == 0: break
for j in range(n):
if j == 0: ns = raw_input()
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | s620732319 | s499319075 | p00429 | python | Runtime Error |
while 1:
n = input()
if n == 0: break
for i in range(n):
if i == 0: ns = str(input())
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | while 1:
n = input()
if n == 0: break
for j in range(n):
if j == 0: ns = raw_input()
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | s449279557 | s499319075 | p00429 | python | Runtime Error |
while 1:
n = input()
if n == 0: break
for j in range(n):
if j == 0: ns = str(input())
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | while 1:
n = input()
if n == 0: break
for j in range(n):
if j == 0: ns = raw_input()
temp = ''
count = 1
for i in range(len(ns)-1):
if ns[i] == ns[i+1]:
count += 1
... | s269417610 | s499319075 | p00429 | python | Runtime Error |
while 1:
m = int(raw_input())
if m == 0: break
cm = [10, 50, 100, 500]
c = map(int, raw_input().split())
mintn = 81
fc = [0 for i in xrange(4)]
for i in xrange(c[0]+1):
for j in xrange(c[1]+1):
for k in xrange(c[2]+1):
for l in xrange(c[3]+1):
... | loop = False
while 1:
m = int(raw_input())
if m == 0: break
if loop is True: print ''
cm = [10, 50, 100, 500]
c = map(int, raw_input().split())
mintn = 81
fc = [0 for i in xrange(4)]
mc = [0 for i in xrange(4)]
t = 0
for i in xrange(4):
t += c[i]*cm[i]
ch = t-m
... | s224672086 | s785102302 | p01132 | python | Runtime Error |
while 1:
n = int(raw_input())
if not n: break
cnt = 1
t = [0 for i in xrange(24*60*60)]
for i in xrange(n):
a = raw_input().split()
h,m,s = [0,0],[0,0],[0,0]
for i in xrange(2):
h[i],m[i],s[i] = map(int, a[i].split(':'))
t1 = h[0]*60**2 + m[0]*60 + s[0]
... | while 1:
n = int(raw_input())
if not n: break
cnt = 0
m = cnt
t = []
for i in xrange(n):
a = raw_input().split()
t.append((a[0],2))
t.append((a[1],1))
t.sort()
for i in xrange(len(t)):
#print t[i]
if t[i][1] is 2: cnt += 1
else: cnt -= 1
... | s550272295 | s921294383 | p01138 | python | Runtime Error |
import sys
while 1:
x = raw_input()
if x == 0: break
poyo = 0
for i in xrange(len(x)):
poyo += int(x[i])
print poyo | import sys
while 1:
x = raw_input()
if x == '0': break
poyo = 0
for i in xrange(len(x)):
poyo += int(x[i])
print poyo | s515925279 | s718965660 | p02485 | python | Runtime Error |
import sys
n = int(raw_input())
a = map(int, raw_input().split())
q = int(raw_input())
t = map(int, raw_input().split())
cnt = 0
for i in xrange(q-1, -1, -1):
if t[i] in a:
t.remove(t[i])
cnt += 1
print cnt | import sys
n = int(raw_input())
a = set(map(int, raw_input().split()))
q = int(raw_input())
t = set(map(int, raw_input().split()))
cnt = 0
print len(t)-len(t-a) | s573997765 | s104499086 | p02526 | python | Time Limit Exceeded |
import itertools
while True:
n = int(raw_input())
c = 0
for a in itertools.product(range(10), repeat=4):
if sum(a) == n:
c += 1
print c | import itertools
while True:
try:
n = int(raw_input())
c = 0
for a in itertools.product(range(10), repeat=4):
if sum(a) == n:
c += 1
print c
except EOFError:
break | s376343064 | s293139010 | p00008 | python | Runtime Error |
while True:
n = int(raw_input())
if n == 0:
break
a = [0] * n
for i in range(n):
a[i] = int(raw_input())
r = a[0]
for i in range(n+1):
for j in range(i+1, n+1):
r = max(r, sum(a[i:j]))
print r | while True:
n = int(raw_input())
if n == 0:
break
a = [0] * n
dp = [0] * n
for i in range(n):
a[i] = int(raw_input())
if i == 0:
dp[0] = a[0]
else:
dp[i] = max(dp[i-1]+a[i], a[i])
print max(dp) | s965729835 | s134327682 | p00022 | python | Time Limit Exceeded |
while True:
n = int(raw_input())
r = 0
if n == 0:
break
s = [map(int, raw_input().replace('.','0').replace('*','1')) for i in range(n)]
sum = [[0] * (n + 1) for i in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, n + 1):
sum[i][j] += s[i - 1][j - 1]
... | while True:
n = int(raw_input())
if n == 0:
break
s = [raw_input() for i in range(n)]
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(n):
if s[i][j] == '.':
dp[i][j] = min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]) + 1
p... | s076324024 | s160661291 | p00092 | python | Time Limit Exceeded |
def m(sum, n):
for size in range(n, 0, -1):
for i in range(size, n + 1):
for j in range(size, n + 1):
s = sum[i][j] - sum[i - size][j] - sum[i][j - size] + sum[i - size][j - size]
if s == 0:
return size
return 0
while True:
n = int(raw... | while True:
n = int(raw_input())
if n == 0:
break
s = [raw_input() for i in range(n)]
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(n):
if s[i][j] == '.':
dp[i][j] = min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]) + 1
p... | s087808953 | s160661291 | p00092 | python | Time Limit Exceeded |
def check(sum, i, j, size):
s = sum[i][j] - sum[i - size][j] - sum[i][j - size] + sum[i - size][j - size]
return s == 0
def mm(sum, n, size):
for i in range(size, n + 1):
for j in range(size, n + 1):
if check(sum, i, j, size):
return True
return False
de... | while True:
n = int(raw_input())
if n == 0:
break
s = [raw_input() for i in range(n)]
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(n):
if s[i][j] == '.':
dp[i][j] = min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]) + 1
p... | s166535316 | s160661291 | p00092 | python | Time Limit Exceeded |
def check(sum, i, j, size):
s = sum[i][j] - sum[i - size][j] - sum[i][j - size] + sum[i - size][j - size]
return s == 0
def mm(sum, n, size):
for i in xrange(size, n + 1):
for j in xrange(size, n + 1):
if check(sum, i, j, size):
return True
return False
... | while True:
n = int(raw_input())
if n == 0:
break
s = [raw_input() for i in range(n)]
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(n):
if s[i][j] == '.':
dp[i][j] = min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]) + 1
p... | s862682560 | s160661291 | p00092 | python | Time Limit Exceeded |
dp = [[0] * 1001 for i in range(11)]
dp[0][0] = 1
for i in range(101):
for j in range(9, -1, -1):
for k in range(0, 1001 - i):
dp[j + 1][k + i] += dp[j][k]
while True:
n, s = map(int, raw_input().split())
print dp[n][s] | dp = [[0] * 1001 for i in range(11)]
dp[0][0] = 1
for i in range(101):
for j in range(9, -1, -1):
for k in range(0, 1001 - i):
dp[j + 1][k + i] += dp[j][k]
while True:
n, s = map(int, raw_input().split())
if (n,s) == (0,0):
break
print dp[n][s] | s153456725 | s728303471 | p00097 | python | Runtime Error |
n = int(raw_input())
a = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n):
aa = map(int, raw_input().split())
for j in range(n):
a[i + 1][j + 1] = a[i][j + 1] + a[i + 1][j] - a[i][j] + aa[j]
m = -10000 * 100 * 100
for i in range(n):
for j in range(n):
for k in range(i + 1, n + 1):
... | n = int(raw_input())
a = [[0] * (n + 1) for _ in range(n + 1)]
m = -10000 * 100 * 100
for i in range(n):
b = map(int, raw_input().split())
for j in range(n):
aa = 0
for k in range(j, n):
aa += b[k]
a[j][k] = max(a[j][k], 0) + aa
m = max(m, a[j][k])
print m | s823365006 | s945330905 | p00098 | python | Time Limit Exceeded |
n = int(raw_input())
a = [[0] * (n + 1) for _ in range(n + 1)]
for i in xrange(n):
aa = map(int, raw_input().split())
for j in range(n):
a[i + 1][j + 1] = a[i][j + 1] + a[i + 1][j] - a[i][j] + aa[j]
m = -10000 * 100 * 100
for i in xrange(n):
for j in xrange(n):
for k in xrange(i + 1, n + 1):... | n = int(raw_input())
a = [[0] * (n + 1) for _ in range(n + 1)]
m = -10000 * 100 * 100
for i in range(n):
b = map(int, raw_input().split())
for j in range(n):
aa = 0
for k in range(j, n):
aa += b[k]
a[j][k] = max(a[j][k], 0) + aa
m = max(m, a[j][k])
print m | s391247412 | s945330905 | p00098 | python | Time Limit Exceeded |
num = int(input()) + int(input())
print(len(str(num))) | import sys
for s in sys.stdin:
a,b = map(int,s.split())
print len(str(a+b)) | s156373514 | s336325397 | p00002 | python | Runtime Error |
num = int(input()) + int(input())
print(len(str(num))) | import sys
for s in sys.stdin:
a,b = map(int,s.split())
print len(str(a+b)) | s104916414 | s336325397 | p00002 | python | Runtime Error |
while True:
try:
list = [int(item) for item in raw_input().split()]
list.sort()
if list[0] ** 2 + list[1] ** 2 == list[2] ** 2 :
print 'YES'
else :
print 'NO'
except EOFError:
break | for i in xrange(input()):
i,j,k = sorted([int(i) for i in raw_input().split()])
print "YES" if i**2 + j**2 == k**2 else "NO" | s249194620 | s301041003 | p00003 | python | Runtime Error |
import sys
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def lcm(a,b):
return a*b/gcd(a,b)
for s in sys.stdin:
i = map(int,raw_input().split())
print gcd(*i), lcm(*i) | import sys
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def lcm(a,b):
return a*b/gcd(a,b)
for s in sys.stdin:
i = map(int,s.split())
print gcd(*i), lcm(*i) | s670602009 | s664246336 | p00005 | python | Runtime Error |
import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n == 1 or n & 1 == 0:
return False
d = n-1
while d & 1 == 0:
d >>= 1
for i in range(20):
a = rand(1,n-1)
t = d
y = pow(a, t, n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= 1
if y != n-1 and t & ... | import sys
a = [True] * 1000000
for i in range(2,1000000):
if(a[i-1]):
for j in range(i**2-1, 1000000, i):
a[j] = False
for s in sys.stdin:
print(a[1:int(s)].count(True)) | s810279913 | s058215046 | p00009 | python | Time Limit Exceeded |
import sys
rand = random.randint
def prime(n):
if n == 2: return True
if n < 2 or n & 1 == 0: return False
return pow(2, n-1, n) == 1
a = [prime(i) for i in range(1000000)]
for s in sys.stdin:
i = int(s)
print(a[:i+1].count(True)) | import sys
a = [True] * 1000000
for i in range(2,1000000):
if(a[i-1]):
for j in range(i**2-1, 1000000, i):
a[j] = False
for s in sys.stdin:
print(a[1:int(s)].count(True)) | s802963582 | s058215046 | p00009 | python | Runtime Error |
import sys,string
a = string.ascii_lowercase
t = string.maketrans(a,a[1:]+a[0])
for s in sys.stdin:
s = s.strip()
while not ('the' in s or 'this' in s or 'that' in s):
s = s.translate(t)
print s | import sys,string
t = string.maketrans('abcdefghijklmnopqrstuvwxyz','bcdefghijklmnopqrstuvwxyza')
for s in sys.stdin:
s = s.strip()
while not ('the' in s or 'this' in s or 'that' in s):
s = s.translate(t)
print s | s418392550 | s104504110 | p00017 | python | Runtime Error |
n = -1
while n != 0:
n = int(raw_input())
a = [map(int,raw_input().split()) for i in xrange(n)]
a = [l + [sum(l)] for l in a]
a.append([sum([l[i] for l in a]) for i in xrange(len(a[0]))])
print '\n'.join([''.join([str(i).rjust(5) for i in l]) for l in a]) | n = int(raw_input())
while n != 0:
a = [map(int,raw_input().split()) for i in xrange(n)]
a = [l + [sum(l)] for l in a]
a.append([sum([l[i] for l in a]) for i in xrange(len(a[0]))])
print '\n'.join([''.join([str(i).rjust(5) for i in l]) for l in a])
n = int(raw_input()) | s950139995 | s994396543 | p00102 | python | Runtime Error |
import string
n = int(raw_input())
while n != 0:
from = []
to = []
for i in xrange(n):
l = raw_input().split()
from.append(l[0])
to.append(l[1])
a = string.maketrans(''.join(from), ''.join(to))
s = []
for i in xrange(int(raw_input())):
s.append(raw_input().strip())
print s.translate(a)
n = int(raw_inpu... | import string
n = int(raw_input())
while n != 0:
l = [raw_input().split() for i in xrange(n)]
f = [i for i,j in l]
t = [j for i,j in l]
d = string.maketrans(''.join(f), ''.join(t))
s = [raw_input().strip() for i in xrange(int(raw_input()))]
print ''.join(s).translate(d)
n = int(raw_input()) | s870954625 | s937675850 | p00424 | python | Runtime Error |
from sys import stdin
from itertools import groupby
a = ['_','.,!? ','abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']
for i in input():
b = [[i for i in j] for i,j in groupby(raw_input())]
c = []
d = ''
for i in b:
index = int(i[0])
s = a[index][(len(i))%len(a[index])-1]
if s == '_':
d = d + ''.join(c)
... | from itertools import groupby
a = ['_','.,!? ','abc','def','ghi','jkl','mno','pqrs','tuv','wxyz']
for i in xrange(input()):
b = [[i for i in j] for i,j in groupby(raw_input())]
c = []
d = ''
for i in b:
index = int(i[0])
s = a[index][(len(i))%len(a[index])-1]
if s == '_':
d = d + ''.join(c)
c = []
el... | s784601001 | s247016069 | p01131 | python | Runtime Error |
while True:
try: a,b = map(int,input().split()) ; print len(a+b)
excpet EOFError: break | import sys
for i in sys.stdin:print len(str(sum(map(int,i.split())))) | s016922594 | s921272641 | p00002 | python | Runtime Error |
while True:
try: a,b = map(int,raw_input().split()) ;print len(a+b)
except EOFError: break | import sys
for i in sys.stdin:print len(str(sum(map(int,i.split())))) | s478868462 | s921272641 | p00002 | python | Runtime Error |
a = raw_input().split()
b = [i for i in a if len(i)==3 or len(i)==4]
c = [i for i in b if ord(i[0])-ord(i[1]) == 12]
s = [ord('t')-ord(c[0][0]),1] if c[0][0]<'t' else [ord(c[0][0])-ord('t'),0]
q=''
for g,i in enumerate(a):
if g==0:pass
else: q+=' '
for j in i:
if j=='.':
q+='.'
e... | import sys
a=lambda x: [''.join([chr(97+(ord(i)-97+j)%26) if i.islower() else i for i in x]) for j in range(26)]
value=['this','that','the']
for s in sys.stdin:
for i in a(s):
if sum(map(i.count,value))>0:
print(i[:-1]) | s045321410 | s343626168 | p00017 | python | Runtime Error |
while True:
try:
a = raw_input().split()
b = [i for i in a if len(i)==3 or len(i)==4]
c = [i for i in b if ord(i[0])-ord(i[1]) == 12]
s = [ord('t')-ord(c[0][0]),1] if c[0][0]<'t' else [ord(c[0][0])-ord('t'),0]
q=''
for g,i in enumerate(a):
if g==0:pass
... | import sys
a=lambda x: [''.join([chr(97+(ord(i)-97+j)%26) if i.islower() else i for i in x]) for j in range(26)]
value=['this','that','the']
for s in sys.stdin:
for i in a(s):
if sum(map(i.count,value))>0:
print(i[:-1]) | s462365640 | s343626168 | p00017 | python | Runtime Error |
ans ={}
for i in range(1,13):
if i%2 !=0:
ans[str(i)] = 31
else:
ans[str(i)] = 30
ans['2']=29
while True:
a,b=map(int,raw_input().split())
day =b
if a+b == 0: break;
if a == 1: day = b;
elif a == 2: day+=31
else:
for i in range(a):
if i ==0: pass;
... | while True:
q=map(int,raw_input().split())
if sum(q) == 0: break
print ['Wednesday','Thursday','Friday','Saturday','Sunday','Monday','Tuesday',0][(sum([0,31,29,31,30,31,30,31,31,30,31,30,31][:q[0]])+q[1])%7] | s321278370 | s387896963 | p00027 | python | Runtime Error |
for i in range(input()):
q,w=[0],[0]
flag=0
_L=map(int,raw_input().split())
q.append(_L[0])
for j in _L[1:]:
if q[-1] > w[-1]:
if q[-1] < j: q.append(j)
elif w[-1] < j: w.append(j)
else:
flag=1
break
if q[-1] < w[-1]:
if w[-1] < j: w.append(j)
elif q[-1] < j: q.append(j... | for i in range(input()):
q,w=[0],[0]
flag=0
_L=map(int,raw_input().split())
q.append(_L[0])
for j in _L[1:]:
if q[-1] > w[-1]:
if q[-1] < j: q.append(j)
elif w[-1] < j: w.append(j)
else:
flag=1
break
if q[-1] < w[-1]:
if w[-1] < j: w.append(j)
... | s124890383 | s151521743 | p00033 | python | Runtime Error |
anb2 = lambda a,b: -(abs(int(1.0*a/b)))
def number(begin):
global i
if begin[i] == "(":
i += 1
res = expression(begin)
i += 1
return res
res = 0
while begin[i].isdigit():
res *= 10
res += int(begin[i])
i+=1
return res
def term(begin):# your code goes here
global i
res = number(begin)
... | abs2 = lambda a,b: -(abs(int(1.0*a/b)))
def number(begin):
global i
if begin[i] == "(":
i += 1
res = expression(begin)
i += 1
return res
res = 0
while begin[i].isdigit():
res *= 10
res += int(begin[i])
i+=1
return res
def term(begin):# your code goes here
global i
res = number(begin)
... | s654373798 | s894892066 | p00109 | python | Runtime Error |
while True:
things = {}
count = input()
if count == 0: break
for i in range(count):
fuga = raw_input().split()
things[fuga[0]] = int(fuga[1])
for i in range(input()):
fuga = raw_input().split()
money =0
for j in range(int(fuga[1])):
money+= things[... | q,w,e=range,input,raw_input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] if i in d else 0 for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print d[e()] | s933642927 | s067599522 | p00201 | python | Runtime Error |
while True:
    ts={}
    c=input()
    if c==0: break
    for i in range(c):
        f=raw_input().split()
        ts[f[0]]=int(f[1])
    f... | q,w,e=range,input,raw_input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] if i in d else 0 for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print d[e()] | s784126119 | s067599522 | p00201 | python | Runtime Error |
q,w,e=range,input,raw_input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print d[e()] | q,w,e=range,input,raw_input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] if i in d else 0 for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print d[e()] | s576437827 | s067599522 | p00201 | python | Runtime Error |
while True:
q={}
a=input()
if a==0:break
for i in range(10): q[i]=0
for i in range(a): q[input()]+=1
for i in range(10): print "*"*q[i] if q[i] != 0 else "-" | while True:
try:
q={}
a=input()
if a==0:break
for i in range(10): q[i]=0
for i in range(a): q[input()]+=1
for i in range(10): print "*"*q[i] if q[i] != 0 else "-"
except SyntaxError: pass | s005204672 | s767214129 | p00219 | python | Runtime Error |
while 1:
print sum(map(int,raw_input().split()))
except: break | while True:
try:
a = map(int,raw_input().split())
a,b = a[0],a[1]
print a+b
except EOFError:
break | s774031744 | s987137004 | p00586 | python | Runtime Error |
input = input()
a,b = input.split()
print(a * b, a*2 + b*2)
| input = input()
a,b = map(int, input.split())
print(a * b, a*2 + b*2)
| s708891815 | s620728862 | p02389 | python | Runtime Error |
n = int(input())
for i in range(n):
x1, y1, x2, y2, x3, y3, x4, y4 = map(float, input().split())
print('YES' if abs((x2 - x1)*(y4 - y3) - (x4 - x3)*(y2 - y1)) < 1e-10 else 'NO') | n = int(input())
for i in range(n):
x1, y1, x2, y2, x3, y3, x4, y4 = map(float, input().split())
print('YES' if abs((x2 - x1)*(y4 - y3) - (x4 - x3)*(y2 - y1)) < 1e-10 else 'NO') | s339987650 | s003229306 | p00021 | python | Runtime Error |
h={15:2244,12:1870,10:1520,5:850,3:550,2:380}
m={0:0}
for i in range(50):
if i in m:
for k,v in h.items():
m[i+k] = min(m.get(i+k,1e9),m[i]+v)
while True:
n = input()
if n == 0 : break
print(m[n/100]) | h={15:2244,12:1870,10:1520,5:850,3:550,2:380}
m={0:0}
for i in range(50):
if i in m:
for k,v in h.items():
m[i+k] = min(m.get(i+k,1e9),m[i]+v)
while True:
n = input()
if n == 0 : break
print(m[n/100]) | s928584706 | s447083665 | p00106 | python | Runtime Error |
s=[]
for i in raw_input().split():
if i<"0":
t=s.pop()
s.append("("+s.pop()+i+t+")")
else:
s.append(i)
print eval(s[0]) | s=[]
for i in raw_input().split():
if i<"0":
t=s.pop()
s.append(str(eval(s.pop()+i+t)))
else:
s.append(i)
print s[0] | s095509132 | s077348759 | p02263 | python | Runtime Error |
def f(n,d):
t=[f(i,d+1)+1 for i in l[n][1]]
h=0 if t==[] else max(t)
c[n][3:3]=[len(l[n][1]),d,h,"root" if d<1 else "leaf" if h<1 else "internal node"]
return h
m=input()
c=[0]*m
l=sorted([map(int,raw_input().split()) for _ in range(m)])
for i in l:
n,a,b=i
if a>0:c[a]=[a,n,b]
if b>0:c[b]=[b... | def f(n,d):
t=[f(i,d+1)+1 for i in l[n][1]]
h=0 if t==[] else max(t)
c[n][3:3]=[len(l[n][1]),d,h,"root" if d<1 else "leaf" if h<1 else "internal node"]
return h
m=input()
c=[0]*m
l=sorted([map(int,raw_input().split()) for _ in range(m)])
for i in l:
n,a,b=i
if a>=0:c[a]=[a,n,b]
if b>=0:c[b]=... | s819383985 | s675411425 | p02280 | python | Runtime Error |
#coding utf-8
a,b = map(int,input().split())
if(a == b):
print('a == b')
elif(a < b):
print('a < b')
else:
print(
| a,b = map(int,input().split())
if(a == b):
print("a == b")
elif(a < b):
print("a < b")
else:
print("a > b")
| s804133734 | s531059548 | p02391 | python | Runtime Error |
#coding utf-8
a,b = map(int,input().split())
if(a == b):
print('a == b')
elif(a < b):
print('a < b')
else:
print(
| a,b = map(int,input().split())
if(a == b):
print("a == b")
elif(a < b):
print("a < b")
else:
print("a > b")
| s131763344 | s531059548 | p02391 | python | Runtime Error |
#coding utf-8
a,b = map(int,input().split())
if(a == b):
print('a == b',sep="")
elif(a < b):
print('a < b',sep="")
else:
print('a >
| a,b = map(int,input().split())
if(a == b):
print("a == b")
elif(a < b):
print("a < b")
else:
print("a > b")
| s618599725 | s531059548 | p02391 | python | Runtime Error |
while True:
try:
input_line = input()
if input_line == '':
break
else:
nums = list(map(int, input_line.split()))
max_num = max(nums)
nums.remove(max_num)
if max_num**2 == nums[0]**2 + nums[1]**2:
print("YES")
... | n = int(input())
for i in range(0, n):
nums = list(map(int, input().split()))
max_num = max(nums)
nums.remove(max_num)
if max_num**2 == nums[0]**2 + nums[1]**2:
print("YES")
else:
print("NO")
| s398056618 | s565913320 | p00003 | python | Runtime Error |
a = sorted(list(map(int, input().split())))
for i in range(len(a)):
if i == 0:
print(a[i], end="")
else:
print(' '+ '{}'.format(a[i]), end="") | a = sorted(list(map(int, input().split())))
for i in range(len(a)):
if i == len(a)-1:
print(a[i])
else:
print(a[i], end=" ") | s414921724 | s701028192 | p02393 | python | Runtime Error |
import math
r = int(input())
pi = math.pi
area = ('%03.6f' % (r * r * pi))
length = ('%03.6f' % (2 * r * pi))
print(area, length, sep=" ") | import math
r = float(input())
area = math.pi * r**2
length = 2 * r * math.pi
print("{:.6f} {:.6f}".format(area, length)) | s381064389 | s283988551 | p02400 | python | Runtime Error |
n = input()
for i in range(n):
a = input(),
b = input()
print a + b | n = input()
for i in range(n):
a = input()
b = input()
c = int(a) + int(b)
if len(str(c)) > 80:
print 'overflow'
else:
print a + b | s702094172 | s513914175 | p00015 | python | Runtime Error |
n = input()
for i in range(n):
a = input(),
b = input()
c = a + b
if len(a) > 80 or len(b) > 80 or len(c) > 80 :
print 'overflow'
else:
print a + b | n = input()
for i in range(n):
a = input()
b = input()
c = int(a) + int(b)
if len(str(c)) > 80:
print 'overflow'
else:
print a + b | s003046653 | s513914175 | p00015 | python | Runtime Error |
from math import pi
r = int(input())
print("{} {}".format(pi*(r**2), 2*pi*r)) | from math import pi
r = float(input())
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | s403276672 | s905364404 | p02400 | python | Runtime Error |
from math import pi
r = input()
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | from math import pi
r = float(input())
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | s117713265 | s905364404 | p02400 | python | Runtime Error |
from math import pi
r = input()
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | from math import pi
r = float(input())
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | s576571436 | s905364404 | p02400 | python | Runtime Error |
from math import pi
r = int(input())
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | from math import pi
r = float(input())
print("{:.10f} {:.10f}".format(pi*(r**2), 2*pi*r)) | s619292019 | s905364404 | p02400 | python | Runtime Error |
a = input()
print(a**3) | a = int(input())
print(a**3) | s945025902 | s652775981 | p02388 | python | Runtime Error |
import sys
for s in sys.stdin:
g,r=m,n = map(int,s.split())
while r!=0:
g,r = r,g%r
print(g,m//g*n) | import sys
for s in sys.stdin:
m,n = map(int,s.split())
g,r = m,n
while r!=0:
g,r = r,g%r
print(g,m//g*n) | s558609829 | s876228033 | p00005 | python | Runtime Error |
import math
import itertools
x = 100
for _ in itertools.repeat(None,int(input())):
x = math.ceil(x*1.05)
print(x*1000) | print(input()[::-1]) | s961538650 | s981265820 | p00006 | python | Runtime Error |
import sys
import math
import array from array
M = 1000000
B = int(math.sqrt(M)+1)//6+1
N = M//6
N1 = N+1 if M % 6 == 5 else N
N2 = N+1 if M % 6 >= 1 else N
l = array('I',[1]) * N1
m = array('I',[1]) * N2
i = 5
ini = 4
for p in range(B):
if l[p] == 1:
l[p+i::i] = [0] * len(l[p+i::i])
m[ini-1::i] = ... | import sys
from array import array
N = 1000000
primes = array('I',[1]) * (N//2)
primes[0] = 0
for i in range(3,int(N**0.5),2):
if primes[i//2]:
primes[(i*i)//2::i] = array('I',[0]) * len(primes[(i*i)//2::i])
for i in sys.stdin:
n = int(i)
if n < 4:
print(n-1)
else:
print(sum(p... | s417745086 | s473465441 | p00009 | python | Runtime Error |
import sys
import math
from array import array
M = 1000000
B = int(math.sqrt(M)+1)//6+1
N = M//6
N1 = N+1 if M % 6 == 5 else N
N2 = N+1 if M % 6 >= 1 else N
l = array('I',[1]) * N1
m = array('I',[1]) * N2
i = 5
ini = 4
for p in range(B):
if l[p] == 1:
l[p+i::i] = [0] * len(l[p+i::i])
m[ini-1::i] = ... | import sys
from array import array
N = 1000000
primes = array('I',[1]) * (N//2)
primes[0] = 0
for i in range(3,int(N**0.5),2):
if primes[i//2]:
primes[(i*i)//2::i] = array('I',[0]) * len(primes[(i*i)//2::i])
for i in sys.stdin:
n = int(i)
if n < 4:
print(n-1)
else:
print(sum(p... | s706491600 | s473465441 | p00009 | python | Runtime Error |
import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif m < 0:
minv = r
print(maxv) | import sys
l = sys.stdin.readlines()
minv = int(l[1])
maxv = -1000000000
for r in map(int,l[2:]):
m = r-minv
if maxv < m:
maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv) | s997592575 | s145585690 | p02258 | python | Runtime Error |
import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif m < 0:
minv = r
print(maxv) | import sys
l = sys.stdin.readlines()
minv = int(l[1])
maxv = -1000000000
for r in map(int,l[2:]):
m = r-minv
if maxv < m:
maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv) | s841033082 | s145585690 | p02258 | python | Runtime Error |
import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m: maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv) | import sys
l = sys.stdin.readlines()
minv = int(l[1])
maxv = -1000000000
for r in map(int,l[2:]):
m = r-minv
if maxv < m:
maxv = m
if m < 0: minv = r
elif m < 0: minv = r
print(maxv) | s370882826 | s145585690 | p02258 | python | Runtime Error |
import sys
import math
ct= 0
def insertion_sort(a, n, g):
for j in range(0,n-g):
v = a[j+g]
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
n = int(input())
a = list(map(int, sys.stdin.readlines()))
b = 701
g = [x for x in [1,4,10,23,... | import sys
import math
ct= 0
def insertion_sort(a, n, g):
global ct
for j in range(0,n-g):
v = a[j+g]
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
n = int(input())
a = list(map(int, sys.stdin.readlines()))
b = math.floor(2.25*... | s002006265 | s467267252 | p02262 | python | Runtime Error |
n,m = map(int,input().split())
c = list(map(int,input().split()))
minimum = [50000] * (n+1)
minimum[0] = 0
for i in range(1,n+1):
if c[j] <= 2:
continue
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j]]+1
print(minimum[n]) | n = int(input().split()[0])
c = list(map(int,input().split()))
dp = list(range(n+1))
for i in range(2,n+1):
for j in c:
if j <= i and dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j]+1
print(dp[n]) | s150198023 | s667060909 | p02314 | python | Runtime Error |
n,m = map(int, input().split())
l = list(map(int, input().split()))
d = [0] * (n+1)
for i in range(1,n+1):
if i in l:
d[i] = 1
else:
min = 50000
for j in range(i+1):
if d[i-j]+d[j] < min and d[i-j]+d[j]>0:
min = d[i-j] + d[j]
d[i] = min
print(d[n]) | n = int(input().split()[0])
c = list(map(int,input().split()))
dp = list(range(n+1))
for i in range(2,n+1):
for j in c:
if j <= i and dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j]+1
print(dp[n]) | s861823222 | s667060909 | p02314 | python | Time Limit Exceeded |
N,W = map(int, input().split())
v = [0] * N
w = [0] * N
dp = [[0]*(W+1)]*(N+1)
for i in range(N):
v[i], w[i] = map(int, input().split())
def rec(i,j,dp):
res = 0
if dp[i][j] > 0:
return dp[i][j]
if i<0:
return 0
elif j < w[i]:
res = rec(i-1, j, dp)
else:
res = m... | N,W = map(int, input().split())
dp = [0]*(W+1)
for i in range(1,N+1):
v,w = map(int,input().split())
for j in range(W, w-1, -1):
x = v+dp[j-w]
if x > dp[j]: dp[j] = x
print(dp[W]) | s866830952 | s159688750 | p02315 | python | Time Limit Exceeded |
N,W = map(int, input().split())
v = [0] * N
w = [0] * N
dp = [[-1]*(W+1)]*(N+1)
for i in range(N):
v[i], w[i] = map(int, input().split())
def rec(i,j,dp):
res = 0
if dp[i][j] != -1:
return dp[i][j]
if i<0:
return 0
elif j < w[i]:
res = rec(i-1, j, dp)
else:
res... | N,W = map(int, input().split())
dp = [0]*(W+1)
for i in range(1,N+1):
v,w = map(int,input().split())
for j in range(W, w-1, -1):
x = v+dp[j-w]
if x > dp[j]: dp[j] = x
print(dp[W]) | s456311246 | s159688750 | p02315 | python | Time Limit Exceeded |
a,b = map(int,input().split())
2 print("{0} {1} {2:0f}".format(a//b,a%b,a/b)) | a,b = map(int,input().split())
print("{0} {1} {2:0f}".format(a//b,a%b,a/b)) | s294668470 | s849754114 | p02399 | python | Runtime Error |
input()
n = map(int,input().split())
print(min(n),max(x),sum(s)) | input()
n = list(map(int,input().split()))
print(min(n),max(n),sum(n)) | s035168410 | s072494273 | p02402 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.