Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math

while(1):
    thv = float(raw_input())
    for i in range(1, 20):
        y = 5 * (i-1)
        t = math.sqrt(y/4.9)
        v = 9.8 * t
        if v >= thv:
            print i
            

Fixed submission:
import math

while(1):
    try:
        thv = float(raw_input())
    except:
        break
    for i in range(1, 1000):
        y = 5 * (i-1)
        t = math.sqrt(y/4.9)
        v = 9.8 * t
        if v >= thv:
            print i
            break

Buggy python submission (verdict: Runtime Error):
import math

while(1):
    thv = float(raw_input())
    for i in range(1, 20):
        y = 5 * (i-1)
        t = math.sqrt(y/4.9)
        v = 9.8 * t
        if v >= thv:
            print i
            break
            

Fixed submission:
import math

while(1):
    try:
        thv = float(raw_input())
    except:
        break
    for i in range(1, 1000):
        y = 5 * (i-1)
        t = math.sqrt(y/4.9)
        v = 9.8 * t
        if v >= thv:
            print i
            break
Buggy python submission (verdict: Runtime Error):
while True:
    hit = 0
    blow = 0
    a = input().split(' ')
    b = input().split(' ')
    for a_, b_ in zip(a, b):
        if a_ == b_:
            hit += 1
        elif a_ in b:
            blow += 1
    print(hit, blow)



Fixed submission:
import sys

a = []
for line in sys.stdin:
    a.append(line.strip())
ita = iter(a)

for a, b in zip(ita, ita):
    hit = 0
    blow = 0
    a = a.split(' ')
    b = b.split(' ')
    for a_, b_ in zip(a, b):
        if a_ == b_:
            hit += 1
        elif a_ in b:
            blow += 1
    print(hit, blow)

Buggy python submission (verdict: Runtime Error):
while(1):
    hit = 0
    blow = 0
    a = input().split(' ')
    b = input().split(' ')
    for a_, b_ in zip(a, b):
        if a_ == b_:
            hit += 1
        elif a_ in b:
            blow += 1
    print(hit, blow)



Fixed submission:
import sys

a = []
for line in sys.stdin:
    a.append(line.strip())
ita = iter(a)

for a, b in zip(ita, ita):
    hit = 0
    blow = 0
    a = a.split(' ')
    b = b.split(' ')
    for a_, b_ in zip(a, b):
        if a_ == b_:
            hit += 1
        elif a_ in b:
            blow += 1
    print(hit, blow)
Buggy python submission (verdict: Runtime Error):

def a2c(name):
	c = name[0]
	boin=['a','i','u','e','o']
	for b in name:
		if i, b in enumerate(boin[:-1]):
			c += name[i+1]
	
	return c

while True:
	n = int(raw_input())
	
	if n == 0:
		break
	
	names = []
	length = -1
	for i in xrange(n):
		tmp = a2c(raw_input())
		names.append(tmp)
		length = max(length, len(tmp))
	
	names = set(names)
	if len(names) != n:
		print -1
		continue
	
	for i in xrange(1, length):
		s = set([name[:i] for name in names])
		if len(set) == n:
			print i
			break

Fixed submission:

def a2c(name):
	c = name[0]
	boin=['a','i','u','e','o']
	for i, b in enumerate(name[:-1]):
		if b in boin:
			c += name[i+1]
	
	return c

	
while True:
	n = int(raw_input())
	
	if n == 0:
		break
	
	names = []
	length = -1
	for i in xrange(n):
		tmp = a2c(raw_input())
		#print tmp
		names.append(tmp)
		length = max(length, len(tmp))
	
	names = set(names)
	if len(names) != n:
		print -1
		continue
	
	for i in xrange(1, length+1):
		s = set([name[:min(i, len(name))] for name in names])
		if len(s) == n:
			print i
			n = 0
			break
			
	if n != 0:
		print -1
Buggy python submission (verdict: Runtime Error):
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>

using namespace std;


int main() {
    
    long n;
    long q;
    cin >> n;
    vector <long> s;
    vector <long> t;
    for (int i=0;i<n;i++){
        long p;
        cin >> p;
        s.push_back(p);
    }
    cin >> q;
    for(int i=0;i<q;i++){
        long p;
        cin >> p;
        t.push_back(p);
    }
    vector <long>::iterator idx;
    long ans = 0;
    for (int i=0;i<q;i++) {
        idx = lower_bound(s.begin(), s.end(),t[i]);
        if(*idx == t[i]){
            ans += 1;
        }
    }
    cout << ans << endl;
}


Fixed submission:
def binarySearch(list_a, key):
    left = 0
    right = len(list_a)
    while left < right:
        mid = (left + right) // 2
        if list_a[mid] == key:
            return mid
            break
        elif key < list_a[mid]:
            right = mid
        else:
            left = mid+1
    else:
        return "NOT_FOUND"

n = int(input())
list_s = list((map(int, input().split())))
q = int(input())
list_t = list((map(int, input().split())))
ans = 0
for numbert in list_t:
    if binarySearch(list_s,numbert) != "NOT_FOUND":
        ans += 1
    
print(ans)
Buggy python submission (verdict: Runtime Error):
for ( int i = 0; i < 4; i++ ){
    for ( int j = 0; j < 8; j++ ){
        cout << "#";
    }
    cout << endl;
}


Fixed submission:
a, b= map(int, input().split())
 
c = (a*b)
d = (a+b)*2
 
print( c, d)

Buggy python submission (verdict: Runtime Error):
#coding: UTF-8

x = raw_input().split()

y = map(int,x)

a = y[0]
b = y[1]

c = a*b
d = (a+b)*2

print c, d


Fixed submission:
a, b= map(int, input().split())
 
c = (a*b)
d = (a+b)*2
 
print( c, d)

Buggy python submission (verdict: Runtime Error):
hj


Fixed submission:
a, b= map(int, input().split())
 
c = (a*b)
d = (a+b)*2
 
print( c, d)
Buggy python submission (verdict: Runtime Error):
kl


Fixed submission:
s = int(input())
h = s // 3600
m = s % 3600 // 60
s = s % 60
print(f"{h}:{m}:{s}")

Buggy python submission (verdict: Runtime Error):
kl


Fixed submission:
s = int(input())
h = s // 3600
m = s % 3600 // 60
s = s % 60
print(f"{h}:{m}:{s}")
Buggy python submission (verdict: Runtime Error):
ko


Fixed submission:
a, b = map(int, input().split())
if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')

Buggy python submission (verdict: Runtime Error):
a, b = map(int,raw_input().split())

if a<b:
    print "a < b"
elif a>b:
    print "a > b"
elif a==b:
    print "a == b"
else:
    print "none"


Fixed submission:
a, b = map(int, input().split())
if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')
Buggy python submission (verdict: Runtime Error):
a, b, c = gets.split.map(&:to_i)
puts (a < b and b < c) ? "Yes" : "No"


Fixed submission:
a,b,c=[int(x) for x in input().split()]
print("Yes" if a<b<c else "No")
Buggy python submission (verdict: Runtime Error):
ko


Fixed submission:
a,b,c=sorted([int(x) for x in input().split()])
print(a,b,c)

Buggy python submission (verdict: Runtime Error):
s


Fixed submission:
a,b,c=sorted([int(x) for x in input().split()])
print(a,b,c)
Buggy python submission (verdict: Runtime Error):
You are not allowed to see this code.


Fixed submission:
W,H,x,y,r=[int(x) for x in input().split()]
print("No" if x < r or y < r or (x+r) > W or (y+r) > H else "Yes")
Buggy python submission (verdict: Runtime Error):
l


Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1

Buggy python submission (verdict: Runtime Error):
k


Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1

Buggy python submission (verdict: Runtime Error):
You are not allowed to see this code.


Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1

Buggy python submission (verdict: Runtime Error):
You are not allowed to see this code.


Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1

Buggy python submission (verdict: Runtime Error):
You are not allowed to see this code.


Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1

Buggy python submission (verdict: Runtime Error):
l



Fixed submission:
i = 1
while True:
  n = int(input())
  if n == 0:
    break
  print("Case ", i, ": ", n, sep = "")
  i = i+1
Buggy python submission (verdict: Runtime Error):
You are not allowed to see this code.


Fixed submission:
while True:
    a, b = map(int, input().split())
    if a == 0 and b == 0:
        break
    elif a < b:
        print(a, b)
    else:
        print(b, a)
Buggy python submission (verdict: Runtime Error):
a, b = gets.split.map(&:to_i)
printf "%d %d %.5f", a / b, a % b, a.to_f / b


Fixed submission:
a, b = map(int, input().split())
d = a // b
r = a % b
f = a / b
print(d, r, "{:.5f}".format(f))
Buggy python submission (verdict: Runtime Error):
import sys

def keta(x):
    return len(str(x))

while True:
    t=input()
    if t=="":
        sys.exit()
    a,b=[int(i) for i in t.split(" ")]
    print(keta(a+b))

Fixed submission:
while True:
    try:
        a,b=[int(i) for i in input().split(" ")]
        print(len(str(a+b)))
    except EOFError:
        break
Buggy python submission (verdict: Runtime Error):
import sys
while True:
    n=int(input())
    if n==0:
        sys.exit()

    sum_list=[0]
    for i in range(n):
        sum_list.append(sum_list[-1]+int(input()))

    if max(sum_list)==0:
        sum_list.pop(0)
        print(max(sum_list))
    maximum=0
    for i in range(n):
        for j in range(i,n+1):
            maximum=max(sum_list[j]-sum_list[i],maximum)

    print(maximum)

Fixed submission:
import sys
while True:
    n=int(input())
    if n==0:
        sys.exit()

    a=[0]
    for i in range(n):
        a.append(int(input())+a[-1])

    maximum=0
    for i in range(n+1):
        for j in range(i):
            maximum=max(maximum,a[i]-a[j])



    if maximum==0:
        b=[a[i+1]-a[i] for i in range(n)]
        maximum=max(b)

    print(maximum)

Buggy python submission (verdict: Runtime Error):
import sys
while True:
    n=int(input())
    if n==0:
        sys.exit()

    sum_list=[0]
    for i in range(n):
        sum_list.append(sum_list[-1]+int(input()))

    if max(sum_list)==0:
        sum_list.pop(0)
        print(max(sum_list))
    maximum=0
    for i in range(n):
        for j in range(i,n+1):
            maximum=max(sum_list[j]-sum_list[i],maximum)

    print(maximum)

Fixed submission:
import sys
while True:
    n=int(input())
    if n==0:
        sys.exit()

    a=[0]
    for i in range(n):
        a.append(int(input())+a[-1])

    maximum=0
    for i in range(n+1):
        for j in range(i):
            maximum=max(maximum,a[i]-a[j])



    if maximum==0:
        b=[a[i+1]-a[i] for i in range(n)]
        maximum=max(b)

    print(maximum)

Buggy python submission (verdict: Runtime Error):
n=int(input())
while n!=0:
    sum_list=[0]
    for i in range(n):
        sum_list.append(sum_list[-1]+int(input()))

    if max(sum_list)==0:
        sum_list.pop(0)
        print(max(sum_list))
    maximum=0
    for i in range(n):
        for j in range(i,n+1):
            maximum=max(sum_list[j]-sum_list[i],maximum)

    print(maximum)
    n=int(input())

Fixed submission:
import sys
while True:
    n=int(input())
    if n==0:
        sys.exit()

    a=[0]
    for i in range(n):
        a.append(int(input())+a[-1])

    maximum=0
    for i in range(n+1):
        for j in range(i):
            maximum=max(maximum,a[i]-a[j])



    if maximum==0:
        b=[a[i+1]-a[i] for i in range(n)]
        maximum=max(b)

    print(maximum)
Buggy python submission (verdict: Runtime Error):
import re
while True:
    try:
        s_origin=input()
        for X in range(10):
            s=s_origin.replace("X",str(X))
            s=s.split("=")
            s[0]=re.sub("^0+","",s[0])
            s[1]=re.sub("^0+","",s[1])
            if eval(s[0])==int(s[1]):
                print(X)
                break
        else:
            print("NA")
    except EOFError:
        break



Fixed submission:
import sys

while True:
    try:
        s=input()
        ans=s.split("=")[1]
        a,b=s.split("=")[0].split("+")
        for X in range(10):
            _a=a.replace("X",str(X))
            if str(int(_a))!=_a:
                continue
            _b=b.replace("X",str(X))
            if str(int(_b))!=_b:
                continue
            _ans=ans.replace("X",str(X))
            if str(int(_ans))!=_ans:
                continue
            if int(_a)+int(_b)==int(_ans):
                print(X)
                break
        else:
            print("NA")

    except EOFError:
        sys.exit(0)
Buggy python submission (verdict: Runtime Error):
def calc(num,ans):
    if len(num)==1:
        if num[0]==ans:
            return 1
        else:
            return 0
    else:
        a=num.copy()
        x=a.pop(-1)
        if ans-x>=0 and ans+x<=20:
            return calc(a,ans-x)+calc(a,ans+x)
        elif ans-x>=0:
            return calc(a,ans-x)
        elif ans+x<=20:
            return calc(a,ans+x)
        else:
            return 0

N=int(input())
number=[int(i) for i in input().split(" ")]
a=number.pop(-1)
print(calc(number,a))

Fixed submission:
N=int(input())
number=[int(i) for i in input().split(" ")]
a=number.pop(-1)

if number[0]==0:
    N-=1
    number.pop(0)


numbermap=[[0 for i in range(21)] for j in range(N)]

numbermap[0][0]=1

for i in range(N-1):
    for j in range(21):
        if j+number[i]<=20:
            numbermap[i+1][j+number[i]]+=numbermap[i][j]
        if j-number[i]>=0:
            numbermap[i+1][j-number[i]]+=numbermap[i][j]



print (numbermap[-1][a])
Buggy python submission (verdict: Runtime Error):
import sys

def tax(p,x):
    return int(p*(100+x)/100)


while True:
    x,y,s=[int(i) for i in  input().split(" ")]

    if x==0 and y==0 and s==0:
        sys.exit()

    maximum=0
    for i in range(1,s-1):
        for j in range(1,s-1):
            if tax(i,x)+tax(j,x)==s:
                maximum=max(tax(i,y)+tax(j,y),maximum)

    print(maximum)

Fixed submission:
import sys

def tax(p,x):
    return int(p*(100+x)/100)


while True:
    x,y,s=[int(i) for i in  input().split(" ")]

    if x==0 and y==0 and s==0:
        sys.exit()

    maximum=0
    p=int(100*s/(100+x))
    for i in range(1,s):
        for j in range(p-i-3,p-i+3):
            if tax(i,x)+tax(j,x)==s and j>0:
                maximum=max(tax(i,y)+tax(j,y),maximum)

    print(maximum)
Buggy python submission (verdict: Runtime Error):
N=int(input())

friendlist=[0 for i in range(N+2)]

for i in range(N):
    a,b=[int(j) for j in input().split(" ")]
    for k in range(a,min(N+2,b+1)):
        friendlist[k]+=1

k=N+1
i=0
while k>=0:
    if friendlist[k]>=k-1:
        i=k-1
        break
    k-=1

print(i)
    
        

Fixed submission:


N=int(input())

friendlist=[0 for i in range(N+2)]

"""
for i in range(N):
    a,b=[int(j) for j in input().split(" ")]
    for k in range(a,min(b+1,N+2)):
        friendlist[k]+=1
"""


ab=[[int(i) for i in input().split(" ")] for j in range(N)]
a=[ab[i][0] for i in range(N)]
b=[ab[i][1] for i in range(N)]

a.sort()
b.sort()



for i in range(1,N):
    for j in range(a[i-1],min(a[i],N+2)):
        friendlist[j]+=i
for i in range(a[N-1],N+2):
    friendlist[i]+=N

for i in range(1,N):
    for j in range(b[i-1]+1,min(b[i]+1,N+2)):
        friendlist[j]-=i
for i in range(b[N-1]+1,N+2):
    friendlist[i]-=N
        


#"""

k=N+1
i=0
while k>=0:
    if friendlist[k]>=k-1:
        i=k-1
        break
    k-=1

print(i)

Buggy python submission (verdict: Runtime Error):
N=int(input())

friendlist=[0 for i in range(N+2)]


for i in range(N):
    a,b=[int(j) for j in input().split(" ")]
    for k in range(a,min(b+1,N+2)):
        friendlist[k]+=1


#ab=[[int(i) for i in input().split(" ")] for j in range(N)]

#print(ab)

k=N+1
i=0
while k>=0:
    if friendlist[k]>=k-1:
        i=k-1
        break
    k-=1

print(i)
    
        

Fixed submission:


N=int(input())

friendlist=[0 for i in range(N+2)]

"""
for i in range(N):
    a,b=[int(j) for j in input().split(" ")]
    for k in range(a,min(b+1,N+2)):
        friendlist[k]+=1
"""


ab=[[int(i) for i in input().split(" ")] for j in range(N)]
a=[ab[i][0] for i in range(N)]
b=[ab[i][1] for i in range(N)]

a.sort()
b.sort()



for i in range(1,N):
    for j in range(a[i-1],min(a[i],N+2)):
        friendlist[j]+=i
for i in range(a[N-1],N+2):
    friendlist[i]+=N

for i in range(1,N):
    for j in range(b[i-1]+1,min(b[i]+1,N+2)):
        friendlist[j]-=i
for i in range(b[N-1]+1,N+2):
    friendlist[i]-=N
        


#"""

k=N+1
i=0
while k>=0:
    if friendlist[k]>=k-1:
        i=k-1
        break
    k-=1

print(i)
Buggy python submission (verdict: Runtime Error):
operas=input().split(" ")

while len(operas)>1:
    i=0
    while i<len(operas):
        try:
            operas[i]=int(operas[i])
        except ValueError:
            if operas[i]=="+":
                operas[i]=int(operas[i-2])+int(operas[i-1])
            elif operas[i]=="-":
                operas[i]=int(operas[i-2])-int(operas[i-1])
            else:
                operas[i]=int(operas[i-2])*int(operas[i-1])
            operas.pop(i-2)
            operas.pop(i-2)
        i+=1

print(operas[0])
            

Fixed submission:
S = input().split(" ")
stack=[]

while len(S)>1:
    for s in S:
        if s=="+":
            s1=stack.pop(-1)
            s2=stack.pop(-1)
            stack.append(s1+s2)
        elif s=="-":
            s1=stack.pop(-1)
            s2=stack.pop(-1)
            stack.append(s2-s1)
        elif s=="*":
            s1=stack.pop(-1)
            s2=stack.pop(-1)
            stack.append(s1*s2)
        else:
            stack.append(int(s))
    S=stack
print(S[0])
Buggy python submission (verdict: Runtime Error):
def minimum(a):
    b=a.copy()
    if len(b)==1:
        return b[0]
    else:
        c=b.pop(-1)
        return min(c,minimum(b))

def maximum(a):
    b=a.copy()
    if len(b)==1:
        return b[0]
    else:
        c=b.pop(-1)
        return max(c,maximum(b))

def sum(a):
    b=a.copy()
    if len(b)==1:
        return b[0]
    else:
        c=b.pop(-1)
        return c+sum(b)




n=int(input())
a=[int(i) for i in input().split(" ")]

print("{0} {1} {2}".format(minimum(a),maximum(a),sum(a)))

Fixed submission:
n=int(input())
a=[int(i) for i in input().split(" ")]

print("{0} {1} {2}".format(min(a),max(a),sum(a)))
Buggy python submission (verdict: Runtime Error):
def ENT(m,n):
    if n==0:
        return 1
    else:
        return (ENT(m,n-1)*m)%1000000007

m,n=[int(i) for i in input().split(" ")]

print(ENT(m,n))

Fixed submission:
from functools import lru_cache
mod=1000000007

m,n=[int(i) for i in input().split(" ")]

@lru_cache()
def power(m,n,mod):
    if n==0:
        return 1
    elif n==1:
        return m
    elif n%2==0:
        return ((power(m,n//2,mod)%mod) * (power(m,n//2,mod)%mod))%mod
    else:
        return (power(m,n-1,mod)*m)%mod

print(power(m,n,mod))

Buggy python submission (verdict: Runtime Error):
a=1000000007

def isuu(m,n):
    result=1
    i=0
    while i<n:
        result=(result*m)%a
        if result==1:
            return [0,i]
        i+=1
    return [1,result]


m,n=[int(i) for i in input().split(" ")]

i=isuu(m,n)
if i[0]==1:
    print(i[1])
else:
    print((m**(n%i[1]))%a)

Fixed submission:
from functools import lru_cache
mod=1000000007

m,n=[int(i) for i in input().split(" ")]

@lru_cache()
def power(m,n,mod):
    if n==0:
        return 1
    elif n==1:
        return m
    elif n%2==0:
        return ((power(m,n//2,mod)%mod) * (power(m,n//2,mod)%mod))%mod
    else:
        return (power(m,n-1,mod)*m)%mod

print(power(m,n,mod))

Buggy python submission (verdict: Time Limit Exceeded):
a=1000000007

def isuu(m,n):
    result=m
    i=1
    while i<n:
        result=(result*m)%a
        if result==1:
            return [0,i]
        i+=1
    return [1,result]


m,n=[int(i) for i in input().split(" ")]

i=isuu(m,n)
if i[0]==1:
    print(i[1])
else:
    print((m**(n%i[1]))%a)

Fixed submission:
from functools import lru_cache
mod=1000000007

m,n=[int(i) for i in input().split(" ")]

@lru_cache()
def power(m,n,mod):
    if n==0:
        return 1
    elif n==1:
        return m
    elif n%2==0:
        return ((power(m,n//2,mod)%mod) * (power(m,n//2,mod)%mod))%mod
    else:
        return (power(m,n-1,mod)*m)%mod

print(power(m,n,mod))

Buggy python submission (verdict: Time Limit Exceeded):
a=1000000007

m,n=[int(i) for i in input().split(" ")]
print((m**n)%a)

Fixed submission:
from functools import lru_cache
mod=1000000007

m,n=[int(i) for i in input().split(" ")]

@lru_cache()
def power(m,n,mod):
    if n==0:
        return 1
    elif n==1:
        return m
    elif n%2==0:
        return ((power(m,n//2,mod)%mod) * (power(m,n//2,mod)%mod))%mod
    else:
        return (power(m,n-1,mod)*m)%mod

print(power(m,n,mod))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(int(math.log10(a + b)) + 1)


Fixed submission:
while True:
	try:
		a, b = map(int, input().split())
		print(len(str(a+b)))
	except:
		break

Buggy python submission (verdict: Runtime Error):
import math
while True:
	a, b = map(int, input().split())
	if(a==0 and b==0):
		break
	print(int(math.log10(a + b)) + 1)


Fixed submission:
while True:
	try:
		a, b = map(int, input().split())
		print(len(str(a+b)))
	except:
		break

Buggy python submission (verdict: Runtime Error):
while True:
	a, b = map(int, input().split())
	if(a==0 and b==0): break
	print(len(str(a+b)))


Fixed submission:
while True:
	try:
		a, b = map(int, input().split())
		print(len(str(a+b)))
	except:
		break
Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(n):
	li  = sorted(input().split())
	if(li[0] ** 2 + li[1] ** 2 == li[3] ** 2):
		print('YES')
	elif:
		print('NO')


Fixed submission:
n = int(input())
for i in range(n):
	li  = sorted(map(int, input().split()))
	if(pow(li[0], 2) + pow (li[1], 2) == pow(li[2], 2)):
		print('YES')
	else:
		print('NO')
Buggy python submission (verdict: Runtime Error):
print(input()[::-1])


Fixed submission:
print(input()[::-1])
Buggy python submission (verdict: Runtime Error):
while True:
	d = int(input())
	ans = 0
	x = d
	while x < 600:
		ans += (x**2)*dx += d


Fixed submission:
while True:
	try: d = int(input())
	except: break
	print(sum([(i*d)**2*d for i in range(600//d)]))

Buggy python submission (verdict: Runtime Error):
while True:
	d = int(input())
	ans = 0
	x = d
	while x < 600:
		ans += (x**2)*dx += d
	print(ans)


Fixed submission:
while True:
	try: d = int(input())
	except: break
	print(sum([(i*d)**2*d for i in range(600//d)]))

Buggy python submission (verdict: Runtime Error):
while True:
	try:
		d = int(input())
	except:
		break
	ans = 0
	x = d
	while x < 600:
		ans += (x**2)*dx += d
	print(ans)


Fixed submission:
while True:
	try: d = int(input())
	except: break
	print(sum([(i*d)**2*d for i in range(600//d)]))