Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03280 (python)

Fixed submission:
A = list(map(int, input().split()))
x = A[0]
y = A[1]

N = (x - 1)*(y - 1)
print(N)

Buggy submission (verdict: Runtime Error):
x = int(input())
y = int(input())

N = (x - 1)*(y - 1)
print(N)

Buggy submission (verdict: Runtime Error):
x = int(input())
y = int(input())

N = (x - 1)*(y - 1)
print(N)
Problem p02658 (python)

Fixed submission:
from sys import exit
n = int(input())
a = list(map(int, input().split()))
ans = 1
a.sort()
for i in a:
  ans *= i
  if (ans > 1e18):
    print(-1)
    exit(0)
print(ans)

Buggy submission (verdict: Runtime Error):
from sys import exit
n = int(input())
a = list(map(int, input().split()))
a.sort(Reverse = True)
ans = 1
for i in a:
  ans *= i
  if (ans > 1e18):
    print(-1)
    exit(0)
print(ans)
Problem p02660 (python)

Fixed submission:
from collections import deque
n = int(input())
i = 2
a = []
x = n
while(i * i <= n):
    if (n % i == 0):
        a.append(i)
        n //= i
        while(n % i == 0):
            n //= i
            a.append(a[-1] * i)
    i += 1
if (n != 1):
    a.append(n)
a.sort(reverse = True)
ans = 0
while(x != 1 and len(a)):
    while(x % a[-1]):
        a.pop()
        if (len(a) == 0):
            break
    if (len(a) == 0):
        break
    x //= a[-1]
    a.pop()
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import deque
n = int(input())
i = 2
a = []
x = n
while(i * i <= n):
    if (n % i == 0):
        a.append(i)
        n //= i
        while(n % i == 0):
            n //= i
            a.append(a[-1] * i)
    i += 1
if (n != 1):
    a.append(n)
a.sort(reverse = True)
ans = 0
while(x != 1 and len(a)):
    while(x % a[-1]):
        a.pop()
    x //= a[-1]
    a.pop()
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import deque
n = int(input())
i = 2
a = []
x = n
while(i * i <= n):
    if (n % i == 0):
        a.append(i)
        n //= i
        while(n % i == 0):
            n //= i
            a.append(a[-1] * i)
    i += 1
if (n != 1):
    a.append(n)
a.sort(reverse = True)
ans = 0
while(x != 1):
    while(x % a[-1]):
        a.pop()
    x /= a[-1]
    a.pop()
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import deque
n = int(input())
i = 2
a = []
x = n
while(i * i <= n):
    if (n % i == 0):
        a.append(i)
        n //= i
        while(n % i == 0):
            n //= i
            a.append(a[-1] * i)
    i += 1
if (n != 1):
    a.append(i)
a.sort(reverse = True)
ans = 0
while(x != 1):
    while(x % a[-1]):
        a.pop()
    x /= a[-1]
    a.pop()
    ans += 1
print(ans)
Problem p02690 (python)

Fixed submission:
x = int(input())

for a in range(-120, 121):
    for b in range(-120, 121):
        if a**5 - b**5 == x:
            print(a, b)
            exit()

Buggy submission (verdict: Runtime Error):
x = int(input())

a = [i**5 for i in range(-100, 101)]

for _a in a:
    if _a**5 + x in a:
        if (_a**5 + x) >= 0:
            a1, a2 = _a, int((_a**5 + x)**(1/5))
        else:
            a1, a2 = _a, int(abs(_a**5 + x)**(1/5))*(-1)
        break

print(a2, a1)

Buggy submission (verdict: Runtime Error):
x = int(input())

a = [i**5 for i in range(-100, 101)]

for _a in a:
    if _a**5 + x in a:
        a1, a2 = _a, int((_a**5 + x)**(1/5))
        break

print(a2, a1)
Problem p02780 (python)

Fixed submission:
def calc(x):
    return (x+1)/2

n, k = map(int, input().split())
p = list(map(calc,(map(int, input().split()))))

_ans = sum(p[0:k])
ans = _ans
for x in range(n-k):
    # print(x, x + k)
    _ans = _ans - p[x] + p[x + k]
    ans = max(ans, _ans)

print(ans)

Buggy submission (verdict: Runtime Error):
def calc(x):
    return (x+1)/2

n, k = map(int, input().split())
p = list(map(calc,(map(int, input().split()))))

_ans = sum(p[0:k])
ans = _ans
for x in range(n-k+1):
    _ans = _ans - p[x] + p[k]
    ans = max(ans, _ans)

print(ans)
Problem p02900 (python)

Fixed submission:
a, b = map(int, input().split())

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

agcd = gcd(a,b)

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors

def is_prime(n):
    if n == 1: return False

    for k in range(2, int(n**0.5) + 1):
        if n % k == 0:
            return False

    return True

x = make_divisors(agcd)
ans = 1
for _x in x:
    ans += is_prime(_x)

print(ans)

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

# get GCD(Gratest Common Divisor: 最大公約数)
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

# get divisors(公約数)
def divisors(n):
    nums = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            nums.append(i)
            if i != n // i:
                nums.append(n//i)
    return nums.sort()

# is prime(Prime Number: 素数)
def is_prime(n):
    if n == 1: return False
    for k in range(2, int(n**0.5) + 1):
        if n % k == 0: return False
    return True

x = divisors(gcd(a, b))

ans = 1
for _x in x:
    ans += is_prime(_x)

print(ans)
Problem p02909 (python)

Fixed submission:
S = input()
if S=='Sunny':
    print('Cloudy')
elif S=='Cloudy':
    print('Rainy')
else:
    print('Sunny')

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)

from bisect import insort_left

for _ in range(m):
    x = A.pop()//2
    insort_left(A, x)

print(sum(A))
Problem p02947 (python)

Fixed submission:
n = int(input())

s = []
for _ in range(n):
    s += [''.join(map(str, (sorted(list(str(input()))))))]

import collections

c = collections.Counter(s)

from math import factorial

ans = 0

for x in c.values():
    if x >= 2:
        ans += factorial(x)//(factorial(x-2)*2)

print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())

s = []
for _ in range(n):
    s += [sorted(input())]

import collections

c = collections.Counter(s)

ans = 0

for x in c.values():
    ans += x*(x-1)//2

print(ans)
Problem p02971 (python)

Fixed submission:
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))

m = max(a)
idxs = [i for i, v in enumerate(a) if v == m]

if len(idxs) > 1:
    for i in range(n):
        print(m)

if len(idxs) == 1:
    idx = idxs[0]
    for i in range(n):
        if idx == i:
            _a = a.copy()
            _a.pop(i)
            print(max(_a))
        else:
            print(m)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))

for i in range(n):
    _a = a.copy()
    _a.pop(i)
    print(max(_a))
Problem p02982 (python)

Fixed submission:
n,d = map(int, input().split())
X = []
for _ in range(n):
    _x = list(map(int, input().split()))
    X.append(_x)

from itertools import combinations
import numpy as np

ans = 0
for (x1, x2) in combinations(X, 2):
    a = 0
    for i in range(d):
        a += (x1[i]-x2[i])**2 
    a = np.sqrt(a)
    if a.is_integer():
        ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
n,d = map(int, input().split())
X = []
for _ in range(n):
    _x = list(map(int, input().split()))
    X.append(_x)

from itertools import combinations
import numpy as np

ans = 0
for (x1, x2) in combinations(X, 2):
    a = 0
    for i in range(d):
        a += (x1[i]-x2[i])**2 
    a = np.sqrt(a)
    if a.is_integer():
        ans += 1

print(ans)
Problem p02983 (python)

Fixed submission:
l, r = map(int, input().split())

from itertools import combinations

if r - l > 2019:
    r = l+2019

ans = [(x1*x2)%2019 for (x1, x2) in combinations(range(l, r+1), 2)]

print(min(ans))

Buggy submission (verdict: Runtime Error):
l, r = map(int, input().split())

from itertools import combinations

ans = 2019

for (x1, x2) in combinations(range(l, r+1), 2):
    a = (x1 * x2) % 2019
    if a < ans:
        ans = a

print(ans)
Problem p02993 (python)

Fixed submission:
s = str(input())
_s = s[0]
ans = 'Good'

for x in s[1:]:
    if x == _s:
        ans = 'Bad'
        break
    _s = x

print(ans)

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())

# ans = b-(a-1) - (b//c - (a-1)//c) - (b//d - (a-1)//d) + (b//(c*d) - (a-1)//(c*d))
ans = b - b//c - b//d + b//(c*d) - (a-1 - (a-1)//c - (a-1)//d + (a-1)//(c*d))

print(ans)
Problem p02999 (python)

Fixed submission:
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Buggy submission (verdict: Runtime Error):
x, a = map(int, input())
if x < a:
    print(0)
else:
    print(10)
Problem p03061 (python)

Fixed submission:
def gcd(x,y):
    if x<y:
        x,y=y,x
    #x>y
    if y==0:
        return x
    if x%y==0:
        return y
    else:
        return gcd(y,x%y)

N=int(input())
A=[int(i) for i in input().split()]
X=[0 for i in range(N)]
Y=[0 for i in range(N)]
for i in range(1,N):
    X[i]=gcd(X[i-1],A[i-1])
for i in range(N-1)[::-1]:
    Y[i]=gcd(Y[i+1],A[i+1])
Z=[gcd(X[i],Y[i]) for i in range(N)]
print(max(Z))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = []
for x in input().split():
    a.append(int(x))

ans = []

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def gcd_list(numbers):
    element = gcd(numbers[0], numbers[1])
    if len(numberes)==2:
        return element
    else:
        for i in range(2, len(numbers)):
            element=gcd(element, numbers[i])
        return element

if n == 2:
    print(max(a))
else:
    for i in range(n):
        c = a.copy()
        c.remove(a[i])
        ans.append(gcd_list(c))

    print(max(ans))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = []
for x in input().split():
    a.append(int(x))

ans = []

import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

for i in range(n):
    c = a.copy()
    c.remove(a[i])
    ans.append(gcd_list(c))

print(max(ans))
Problem p03212 (python)

Fixed submission:
n = input()

def f(s):
    if int(s) > int(n):
        return 0
    if all(['3' in s,'5' in s,'7' in s]):
        ans.append(1)
    for t in '3','5','7':
        f(s+t)

ans=[]
f('0')
print(sum(ans))

Buggy submission (verdict: Runtime Error):
n = input()

def f(s):
    if int(s) > int(n):
        return 0
    if all(['3' in s,'5' in s,'7' in s]):
        ans += 1
    for t in '3','5','7':
        f(s+t)

ans = 0
f('0')
print(ans)
Problem p03251 (python)

Fixed submission:
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

if max(x+[X]) < min(y+[Y]):
    print('No War')
else:
    print('War')

Buggy submission (verdict: Runtime Error):
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

if max(x, X) < min(y, Y):
    print('No War')
else:
    print('War')
Problem p03262 (python)

Fixed submission:
from fractions import gcd
n,x=map(int,input().split())
 
xlist=list(map(int,input().split()))
 
ans=abs(x-xlist[0])
for i in xlist:
    ans=gcd(ans,abs(x-i))
 
print(ans)

Buggy submission (verdict: Runtime Error):
n, x = map(int, input().split())

def abs2(m):
    m = int(m)
    return abs(m-x)

# from fractions import gcd

import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

# def gcd_list(numbers):
#     return reduce(math.gcd, numbers)

xs = list(map(abs2, input().split()))
# xs = list(map(int, input().split()))

if n == 1:
    ans = xs[0]
else:
    ans = gcd(*xs)

# ans = abs(x-xs[0])
# for y in xs:
#     ans = gcd(*[ans, abs(x-y)])

print(ans)

Buggy submission (verdict: Runtime Error):
n, x = map(int, input().split())

def abs2(m):
    m = int(m)
    return abs(m-x)

import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

xs = list(map(abs2, input().split()))

if n == 1:
    ans = xs[0]
else:
    ans = gcd(*xs)

print(ans)
Problem p03273 (python)

Fixed submission:
h, w = map(int, input().split())
a = []
for _ in range(h):
    _a = list(input())
    if '#' in _a:
        a += [_a]
    else:
        pass

import numpy as np

a = np.array(a)
ans_col = []

for i in range(w):
    if '#' in a[:,i]:
        ans_col += [i]
    else:
        pass

ans = a[:, ans_col]

for j in range(a.shape[0]):
    print(''.join(map(str, ans[j, :])))

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())
a = []
for _ in range(h):
    _a = list(input())
    if '#' in _a:
        a += [_a]
    else:
        pass

import numpy as np

a = np.array(a)
ans_col = []

for i in range(w):
    if '#' in a[:,i]:
        ans_col += [i]
    else:
        pass

ans = a[:, ans_col]

for j in range(a.shape[0]):
    print(''.join(map(str, ans[j, :])))
Problem p02576 (python)

Fixed submission:
N,X,T=map(int,input().split())
if N%X==0:
    print(N//X*T)
elif N%X!=0:
    print((N//X+1)*T)

Buggy submission (verdict: Runtime Error):
N,X,T=map(input().split())
if N%X==0:
    print(N//X*T)
elif N%X!=0:
    print((N//X+1)*T)
Problem p02583 (python)

Fixed submission:
n=int(input())
ans=0
l=map(int,input().split())
li=sorted(l)
for i in range(n):
    for j in range(i+1,n):
        for k in range(j+1,n):
            if li[i]!=li[j]!=li[k] and li[i]+li[j]>li[k]:
                ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
n=input()
l=map(int,input().split())
li=sorted(l)
for i in range(n):
    for j in range(i+1,n):
        for k in range(j+1,n):
            if li[i]!=li[j]!=li[k] and li[i]+li[j]>li[k]:
                ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
n=input()
l=map(int,input().split())
li=sorted(l)
for i in range(n):
    for j in range(i,n+1):
        for k in range(j,n+1):
            if li[i]!=li[j]!=li[k] and li[i]+li[j]>li[k]:
                ans+=1
print(ans)
Problem p02613 (python)

Fixed submission:
n=int(input())
li=[input() for _ in range(n)]
ac=li.count("AC")
wa=li.count("WA")
tle=li.count("TLE")
re=li.count("RE")
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Buggy submission (verdict: Runtime Error):
n=int(input())
li=[input() for _ in range(n)]
ac=li.index("AC")
wa=li.index("WA")
tle=li.index("TLE")
re=li.index("RE")
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))
Problem p02639 (python)

Fixed submission:
a,b,c,d,e = map(int, input().split())
li=[a,b,c,d,e ]
print(li.index(0)+1)

Buggy submission (verdict: Runtime Error):
X,Y= map(int, input().split())
if (Y/2-X>=0 and 2*X-Y/2>=0) and ( not (Y/2-X<=0 and 2*X-Y/2<=0)):
    print ("Yes")
else:
    print("No")
Problem p02675 (python)

Fixed submission:
N=int(input())
if N%10==3:
    print("bon")
elif N%10 in [0,1,6,8]:
    print("pon")
else:
    print("hon")

Buggy submission (verdict: Runtime Error):
N=int(input())
if N[-1]==3:
    print("bon")
elif N[-1] in [0,1,6,8]:
    print("pon")
else:
    print("hon")
Problem p02705 (python)

Fixed submission:
R=int(input())
import math
print(2*math.pi*R)

Buggy submission (verdict: Runtime Error):
N, M= map(int, input().split())
A = list(map(int, input().split()))    
if N-sum(A)>=0:
    print(N-sum(A))
else:
    print("-1")
Problem p02718 (python)

Fixed submission:
n,m=map(int,input().split())
li=list(map(int,input().split()))
ans=0
q=sorted(li,reverse=True)
for i in range(m):
    if q[i]*4*m>=sum(li):
        ans+=1
if ans==m:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
li=list(map(int,input().split()))
ans=0
q=sorted(li,reverse=True)
for i in range(m):
    if q[i]*4m>=sum(li):
        ans+=1
if ans==m:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
li=list(map(int,input().split())
ans=0
aaa=soted(li reverse=True)
for i in range(m):
    if aaa[i]*4m>=sum(li):
        ans+=1
if ans==m:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N,M= map(int,input().split())
A = list(map(int, input().split()))
count=0
for i in range(M):
    if A.sort(reverse=True)[i]>=(sum(A)/4*M):
        count=count+1
if count==M:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N,M= map(int,input().split())
A = list(map(int, input().split()))
count=0
for i in range(M):
    if A.sort(reverse=True)[i]>=(sum(A)/4*M):
        count=count+1
if count==M:
    print("Yes")
else:
    print("No")
Problem p02730 (python)

Fixed submission:
s=input()
a=s[:len(s)//2+1//2]
b=s[len(s)//2+1:]
if s==s[::-1] and a==a[::-1] and b==b[::-1]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=input()
a=s[:n//2]
b=s[(n+3)//2:]
if s==s[::-1] and a==a[::-1] and b==b[::-1]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=input()
a=s[:(n+1)//2]
b=s[(n+3)//2:]
if s==s[::-1] and a==a[::-1] and b==b[::-1]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=input()
count=0
count_1=0
count_2=0
for i in range((len(s)-1)//2):
    if s[i]==s[-(i+1)]:
        count+=1
for j in range(len(s[:(len(s)+1)//2])//2):
    if s[:(len(s)+1)//2][j]==s[:(len(s)+1)//2][-(j+1)]:
        count_1+=1
for k in range(len(s[(len(s)+3)//2):])):
    if s[(len(s)+3)//2):][k]==s[(len(s)+3)//2):][-(k+1)]:
        count_2+=1
if count==(len(s)-1)//2 and count_1==len(s[:(len(s)+1)//2])//2 and count_2==len(s[(len(s)+3)//2):]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=input()
count=0
count_1=0
count_2=0
for i in range((len(s)-1)//2):
    if s[i]==s[-(i+1)]:
        count+=1
for j in range(len(s[:(len(s)+1)//2])//2):
    if s[:(len(s)+1)//2][j]==s[:(len(s)+1)//2][-(j+1)]:
        count_1+=1
for k in range(len(s[(len(s)+3)//2):])):
    if s[(len(s)+3)//2):][k]==s[(len(s)+3)//2):][-(k+1)]:
        count_2+=1
if count==(len(s)-1)//2 and count_1==len(s[:(len(s)+1)//2])//2 and count_2==len(s[(len(s)+3)//2):]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=input()
count=0
count_1=0
for i in range((len(s)-1)//2):
    if s[i]==s[-(i+1)]:
        count+=1
for j in range(len(s[:(len(s)+1)//2])//2):
    if s[:(len(s)+1)//2][j]==s[:(len(s)+1)//2][-(j+1)]:
    count_1+=1
if count==(len(s)-1)//2 and count_1==len(s[:(len(s)+1)//2])//2:
    print("Yes")
else:
    print("No")
Problem p02760 (python)

Fixed submission:
a=[list(map(int,input().split())) for _ in range(3)]
n=int(input())
b=[int(input()) for _ in range(n)]
used=[[False]*3 for _ in range(3)]
for k in range(n):
    for i in range(3):
        for j in range(3):
            if a[i][j]==b[k]:
                used[i][j]=True

for i in range(3):
    if used[0][i] and used[1][i] and used[2][i]:
        print("Yes")
        exit()
        
for i in range(3):
    if used[i][0] and used[i][1] and used[i][2]:
        print("Yes")
        exit()

if used[0][0] and used[1][1] and used[2][2]:
        print("Yes")
        exit()

if used[0][2] and used[1][1] and used[2][0]:
        print("Yes")
        exit()                
print("No")

Buggy submission (verdict: Runtime Error):
a=[map(int,input().split()) for _ in range(3)]
n=int(input())
b=[int(input()) for _ in range(n)]
used=[[False]*3 for _ in range(3)]
for k in range(n):
    for i in range(3):
        for j in range(3):
            if a[i][j]==b[k]:
                used[i][j]==True

for i in range(3):
    if a[0][i]==a[1][i]==a[2][i]:
        print("Yes")
        exit()
        
for i in range(3):
    if a[i][0]==a[i][1]==a[i][2]:
        print("Yes")
        exit()

for i in range(3):
    if a[0][0]==a[1][1]==a[2][2]:
        print("Yes")
        exit()

for i in range(3):
    if a[0][2]==a[1][1]==a[2][0]:
        print("Yes")
        exit()                
print("No")

Buggy submission (verdict: Runtime Error):
a=[map(int,input().split() for _ in range(3)]
n=int(input())
b=[int(input()) for _ in range(n)]
used=[[False]*3 for _ in range(3)]
for k in range(n):
    for i in range(3):
        for j in range(3):
            if a[i][j]==b[k]:
                used[i][j]==True

for i in range(3):
    if a[0][i]==a[1][i]==a[2][i]:
        print("Yes")
        exit()
        
for i in range(3):
    if a[i][0]==a[i][1]==a[i][2]:
        print("Yes")
        exit()

for i in range(3):
    if a[0][0]==a[1][1]==a[2][2]:
        print("Yes")
        exit()

for i in range(3):
    if a[0][2]==a[1][1]==a[2][0]:
        print("Yes")
        exit()                
print("No")
Problem p02765 (python)

Fixed submission:
N,R=map(int,input().split())
if N>=10:
    print(R)
else:
    print(R+100*(10-N))

Buggy submission (verdict: Runtime Error):
N,R=map(int,input())
if N>=10:
    print(R)
else:
    print(R+100*(10-N))
Problem p02778 (python)

Fixed submission:
s=input()
print("x"*len(s))

Buggy submission (verdict: Runtime Error):
s=input()
for i in range(len(s)):
    s[i]="x"
print(s)

Buggy submission (verdict: Runtime Error):
s=input()
for i in range(len(s)):
    s[i].replace("x")
print(s)
Problem p02783 (python)

Fixed submission:
H,A=map(int,input().split())
print((H+A-1)//A)

Buggy submission (verdict: Runtime Error):
H,A=map(int,input())
print(H//A+1)
Problem p02811 (python)

Fixed submission:
K,X=map(int,input().split())
if 500*K >=X:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
K,X=(int,input().split())
if 500*K>=X:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
K,X=(int,input().split()))
if 500*K>=X:
    print("Yes")
else:
    print("No")
Problem p02817 (python)

Fixed submission:
S,T=input().split()
print(T+S)

Buggy submission (verdict: Runtime Error):
S,T=input(),split()
print(T+S)

Buggy submission (verdict: Runtime Error):
S,T=map(int,input(),split())
print(T+S)
Problem p02830 (python)

Fixed submission:
n=int(input())
s,t=input().split()
ans=s[0]+t[0]
for i in range(1,n):
    ans=ans+s[i]+t[i]
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
s,t=input().split()
ans=0
for i in range(n):
    ans=ans+s[i]+t[i]
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=s[0]+t[0]
s,t=input().split()
for i in range(1,n):
    ans=ans+s[i]+t[i]
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input().split())
ans=s[0]+t[0]
s,t=input().split()
for i in range(1,n):
    ans=ans+s[i]+t[i]
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input().split())
ans=0
s,t=input().split()
for i in range(n):
    ans=ans+s[i]+t[i]
print(ans)
Problem p02909 (python)

Fixed submission:
S=input()
a=["Sunny", "Cloudy", "Rainy"]
print(a[((a.index(S)+1))%3])

Buggy submission (verdict: Runtime Error):
S=input()
a=["Sunny", "Cloudy", "Rainy"]
print(a[(a.index(S)+1)])

Buggy submission (verdict: Runtime Error):
if S=="Sunny":
    print(Cloudy)
if S=="Cloudy":
    print(Rainy)
if S=="Rainy":
    print(Sunny)

Buggy submission (verdict: Runtime Error):
def S:
    sample_list = ['Sunny', 'Cloudy', 'Rainy']
random.shuffle(sample_list)
print sample_list
if S==Sunny:
  print(Cloudy)
if S==Cloudy:
  print(Rainy)
if S==Rainy:
  print(Sunny)
Problem p02921 (python)

Fixed submission:
s=input()
t=input()
ans=0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
t=input()
for i in range(3)
ans=0
if s[i]==t[i]:
  ans+=1
print(ans)
Problem p03035 (python)

Fixed submission:
a,b=map(int,input().split())
if a>=13:
  print(b)
elif 6<=a<=12:
  print(b//2)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
a,b=map(input().split())
if a>=13:
  print(b)
elif 12<=a<=6:
  print(b//2)
else:
  print(0)
Problem p03210 (python)

Fixed submission:
X=int(input())
if X== 3 or X==5 or X==7:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
X=int(input())
if X== 3,5, 7:
  print("YES")
else:
  print("NO")
Problem p03260 (python)

Fixed submission:
a,b=map(int,input().split())
if a%2!=0 and b%2!=0:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2== and b%2==0:
    print("Yes")
else:
    print("No")