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

Fixed submission:
import sys


def main():
    _ = int(input())
    A = list(map(int,input().split()))

    M = set()
    lenA = len(A)
    for i in range(len(A))[::-1]:
        if i > lenA/2:
            if A[i] == 1:
                M.add(i+1)
        else:
            bai = set([x*(i+1) for x in range(1, int(lenA/(i+1))+1)])
            num = len(M&bai) % 2
            if A[i] != num:
                M.add(i+1)
    
    print(len(M))
    if len(M) > 0:
        print(*M)

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys


def main():
    _ = int(input())
    A = list(map(int,input().split()))

    M = set()
    lenA = len(A)
    for i in range(len(A))[::-1]:
        if i > lenA/2:
            if A[i] == 1:
                M.add(i+1)
        else:
            bai = [x*(i+1) for x in range(1, int(lenA/(i+1))+1)]
            num = len(M&bai) % 2
            if A[i] != num:
                M.add(i+1)
    
    print(len(M))
    if len(M) > 0:
        print(*M)

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys

def main():
    _ = int(input())
    A = list(map(int,input().split()))

    M = set()
    lenA = len(A)
    for i in range(len(A))[::-1]:
        if i > lenA/2:
            if A[i] == 1:
                M.add(i+1)
        else:
            bai = [x*(i+1) for x in range(lenA/(i+1))]
            num = len(M&bai) % 2
            if A[i] != num:
                M.add(i+1)
    
    print(len(M))
    if len(M) > 0:
        print(*M)

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys

def main():
    _ = int(input())
    A = list(map(int,input().split()))

    M = []
    lenA = len(A)
    for i in range(len(A))[::-1]:
        if i > lenA/2:
            if A[i] == 1:
                M.append(i+1)
        else:
            num = len([x for x in M if x%(i)==0]) % 2
            if A[i] != num:
                M.append(i+1)
    
    print(len(M))
    if len(M) > 0:
        print(*M)

if __name__=='__main__':
    main()
Problem p03006 (python)

Fixed submission:
import sys

def main():
    n = int(input())

    if n <= 2:
        print(1)
        sys.exit()

    w = [tuple(map(int,input().split())) for x in range(n)]
    w.sort()

    pqs = {}
    for i in range(n-1):
        for j in range(i+1,n):
            xy = (w[j][0] - w[i][0], w[j][1] - w[i][1])
            if xy not in pqs:
                pqs[xy] = 1
            else:
                pqs[xy] += 1
    print(n - max(pqs.values()))

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys

def main():
    n = int(input())
    w = [tuple(map(int,input().split())) for x in range(n)]
    w.sort(key=lambda x: x[0])

    pqs = {}
    for i in range(n):
        for j in range(i+1,n):
            x = w[j][0] - w[i][0]
            y = w[j][1] - w[i][1]
            if (x,y) not in pqs:
                pqs[(x,y)] = 1
            else:
                pqs[(x,y)] += 1

    print(n - max(pqs.values()))

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys

def main():
    n = int(input())
    w = [tuple(map(int,input().split())) for x in range(n)]

    pqs = {}
    for i in range(n):
        for j in range(i+1,n):
            x = abs(w[i][0] - w[j][0])
            y = abs(w[i][1] - w[j][1])
            if (x,y) not in pqs:
                pqs[(x,y)] = 1
            else:
                pqs[(x,y)] += 1

    print(n - max(pqs.values()))

if __name__=='__main__':
    main()
Problem p03214 (python)

Fixed submission:
# -*- coding: utf-8 -*-

import numpy as np
from sys import stdin

def load():
    n = stdin.readline()
    data = [int(x) for x in stdin.readline().split()]
    return (n,data)

def calc(n, data):
    d = np.asarray(data)
    m = d.mean()
    diff = np.abs(d - m)
    return diff.argmin()

n, data = load()
print(calc(n, data))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

from sys import stdin

def load():
    n = int(stdin.readline())
    s = stdin.readline()
    q = int(stdin.readline())
    k = [int(x) for x in stdin.readline().split()]
    
    return (s, k)

def calc(s, ks):
    dmcmap = dmc(s)
    ans = [sum(dmcmap[:k]) for k in ks]
    print(*ans, sep='\n', flush=True)

def dmc(src):
    ret = [0 for _ in range(len(src))]

    dmap = [i for i, x in enumerate(src) if x == 'D']
    mmap = [i for i, x in enumerate(src) if x == 'M']
    cmap = [i for i, x in enumerate(src) if x == 'C']

    for d in dmap:
        for m in filter(lambda x: x > d, mmap):
            for c in filter(lambda x: x > m, cmap):
                ret[c-d] += 1
    return ret

stdin = open('data.txt')
s, ks = load()
calc(s,ks)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

from sys import stdin
from functools import reduce

def load():
    n = int(stdin.readline())
    s = stdin.readline()
    q = int(stdin.readline())
    k = [int(x) for x in stdin.readline().split()]
    
    return (s, k)

def calc(s, ks):
    dmcmap = dmc(s, max(ks))
    for k in ks:
        print(sum(dmcmap[:k]))

def dmc(src, kmax):
    ret = [0 for _ in range(kmax)]

    for ind in range(len(src)):
        if src[ind] == 'D':
            for inm in range(ind+1, len(src)):
                if src[inm] == 'M':
                    for inc in range(inm+1, len(src)):
                        if src[inc] == 'C':
                            ret[inc-ind] += 1
    return ret

s, ks = load()
calc(s,ks)
Problem p02924 (python)

Fixed submission:
n = int(input())


print((n - 1) * n // 2)

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


print((n - 1) * n // 2))
Problem p02910 (python)

Fixed submission:
S=input()
flag = 0
for i in range(0,len(S)):
  if (i+1)%2==0 and not (S[i]=='L' or S[i]=='U' or S[i]=='D'):
    flag = 1
  elif (i+1)%2!=0 and not (S[i]=='R' or S[i]=='U' or S[i]=='D'):
    flag = 1
    
if flag==1:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
S = input()
n = len(S)
flag = 0
for i in range(0,n):
  if i%2==0 and (not (S[1]=='L' or S[1]=='U' or S[1]=='D')):
      flag = 1
  elif (i+1)%2!=0 and (not (S[1]=='R' or S[1]=='U' or S[1]=='D')):
      flag = 1
      
if flag==1:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
S = input()
n = len(S)
flag = 0
for i in range(0,n):
  if i%2==0:
  	if !(S[1]=='L' || S[1]=='U' || S[1]=='D')
    	flag = 1
  else:
    if !(S[1]=='R' || S[1]=='U' || S[1]=='D')
    	flag = 1
      
if flag==1:
  print("No")
else:
  print("Yes")
Problem p02910 (python)

Fixed submission:
a = list(input())
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('No')
        break
    i += 1
    if i == len(a):
        print('Yes')
        break
    even = a[i]
    if even == 'R':
        print('No')
        break
    i += 1
    if i == len(a):
        print('Yes')
        break

Buggy submission (verdict: Runtime Error):
a = list(input())
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('No')
        break
    i += 1
    if i+1 == len(a):
        print('Yes')
        break
    even = a[i]
    if even == 'R':
        print('No')
        break
    i += 1
    if i+1 == len(a):
        print('Yes')
        break

Buggy submission (verdict: Runtime Error):
a = list(input())
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break
    even = a[i]
    if even == 'R':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break

Buggy submission (verdict: Runtime Error):
a = list(input())
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break
    even = a[i]
    if even == 'R':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break

Buggy submission (verdict: Runtime Error):
a = list(input())
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break
    even = a[i]
    if even == 'R':
        print('NO')
    i += 1
    if i+1 == len(a):
        print('YES')
        break

Buggy submission (verdict: Runtime Error):
a = list(input())
print(a)
i = 0
while True:
    odd = a[i]
    if odd == 'L':
        print('NO')
        break
    i += 1
    if i+1 == len(a):
        print('YES')
        break
    even = a[i]
    if even == 'R':
        print('NO')
    i += 1
    if i+1 == len(a):
        print('YES')
        break
Problem p02909 (python)

Fixed submission:
s = 'Sunny'
c = "Cloudy"
r = "Rainy"

S = input()
if S == s:
    print(c)
elif S == c:
    print(r)
else:
    print(s)

Buggy submission (verdict: Runtime Error):
N,M = map(int,input().split())
As = list(map(int,input().split()))

for i in range(M):
    index = As.index(max(As))
    As[index] = As[index] // 2

print(sum(As))
Problem p02917 (python)

Fixed submission:
n = int(input())
Bs = list(map(int,input().split()))
ans = 0

if n==2:
    ans = Bs[0]*2

elif n==3:
    ans += sum(Bs)
    ans += min(Bs)
else:
    ans += Bs[0]
    ans += Bs[-1]
    for i in range(len(Bs)-1):
        ans += min(Bs[i],Bs[i+1])
        
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
Bs = list(map(int,input().split()))
ans = 0

if n==2:
    ans = Bs[0]*2

elif n==3:
    ans += sum(Bs)
    ans += min(Bs)

else:
    ans += Bs[0]
    ans += Bs[-1]
    for i in range(n-2,-1,-1):
        ans += min(Bs[i],Bs[i+1])
        
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
Bs = list(map(int,input().split()))
ans = 0

if n==2:
    ans = Bs[0]*2

elif n==3:
    ans += sum(Bs)
    ans += min(Bs)

else:
    ans += Bs[0]
    ans += Bs[-1]
    for i in range(len(Bs)-1,-1,-1):
        ans += min(Bs[i],Bs[i+1])
        
print(ans)
Problem p02923 (python)

Fixed submission:
N = int(input())
H = list(map(int,input().split()))
max1 = 0
count = 0

for i in range(N-1):
    if H[i] >= H[i+1]:
        count += 1
    else:
        count = 0
    
    if count > max1:
        max1 += 1
print(max1)

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int,input().split()))
counts = []



for r in range(N-1):
    i=r
    count=0
    while H[i] >= H[i+1]:
        count+=1
        i+=1
        if i == N-1:
            break
    
    counts.append(count)




print(max(counts))

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int,input().split()))
counts = []



for r in range(N-1):
    i=r
    count=0
    while H[i] >= H[i+1]:
        count+=1
        i+=1
        if i == N-1:
            break
    
    counts.append(count)




print(max(counts))
Problem p02909 (python)

Fixed submission:
a=['Sunny', 'Cloudy', 'Rainy']
s=input()
if s==a[0]:
  print(a[1])
elif s==a[1]:
  print(a[2])
else:
  print(a[0])

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k,n)
for word in listA:
    a[word]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')
Problem p02910 (python)

Fixed submission:
s=list(input())
b=0
if 'L' in s[::2]:
  print('No')
elif 'R' in s[1::2]:
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
a=0
s=list(input())
for i in range(int(len(s)/2)+1):
  if s[2*i]=='L':
    a+=1
  elif 2*i+1<len(s):
    if s[2*i+1]=='R':
      a+=1
if a==0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a=0
s=list(input())
for i in range(int(len(s)/2)+1):
  if s[2*i]=='L':
    a+=1
  elif 2*i+1<len(s):
    if s[2*i+1]=='R':
      a+=1
if a==0:
  print('Yes')
else:
  print('No')
Problem p02911 (python)

Fixed submission:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(int(input()))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Buggy submission (verdict: Runtime Error):
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Buggy submission (verdict: Runtime Error):
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)
Problem p02921 (python)

Fixed submission:
import numpy as np
hoge = []
for i in range(2):
    a = input()
    hoge.append(a)
a=np.count_nonzero([list(hoge[0])[i]==list(hoge[1])[i]  for i in range(3)])
print(a)

Buggy submission (verdict: Runtime Error):
x,y = map(str,input().split())
a=np.count_nonzero([list(x)[i]==list(y)[i]  for i in range(len(list(x)))])
print(a)

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split())
a=np.count_nonzero([list(x)[i]==list(y)[i]  for i in range(len(list(x)))])
print(a)

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split())
print(np.count_nonzero([list(x)[i]==list(y)[i]  for i in range(len(list(x)))]))
Problem p02945 (python)

Fixed submission:
x,y = map(int,input().split())
a=x+y
b=x-y
c=x*y
print(max([a,b,c]))

Buggy submission (verdict: Runtime Error):
n=int(input())
b=[str(sorted(list(input()))) for i in range(n)]
count=list(collections.Counter(b).values())
count=[i for i in count if i>1]
import math
print(int(sum([math.factorial(x)/(math.factorial(x-2)*2) for x in count])))

Buggy submission (verdict: Runtime Error):
def intersect_list(lst1, lst2):
    arr = []
    lst = lst1.copy()
    for element in lst2:
        try:
            lst.remove(element)
        except ValueError:
            pass
        else:
            arr.append(element)
    return len(arr)

n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(len(a[i])):
            count+=1
print(count)

Buggy submission (verdict: Runtime Error):
def intersect_list(lst1, lst2):
    arr = []
    lst = lst1.copy()
    for element in lst2:
        try:
            lst.remove(element)
        except ValueError:
            pass
        else:
            arr.append(element)
    return len(arr)

n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=[input() for i in range(n)]
a=list(map(lambda x:list(x),a))
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=[list(input()) for i in range(n)]
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)

Buggy submission (verdict: Runtime Error):
from sys import stdin
n = int(stdin.readline().rstrip())
a= [stdin.readline().rstrip() for _ in range(n)]
count=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if intersect_list(a[i],a[j])==len(col):
            count+=1
print(count)
Problem p03493 (python)

Fixed submission:
s=list(input())	
n=sum(x=="1" for x in s)
print(n)

Buggy submission (verdict: Runtime Error):
s=np.array(list(map(int,input().split())))
print(np.count_nonzero(s==1))

Buggy submission (verdict: Runtime Error):
s=np.array(map(int,input().split()))
print(np.count_nonzero(s==1))
Problem p02909 (python)

Fixed submission:
a = input()
if a == "Sunny":
    print("Cloudy")
elif a == "Rainy":
    print("Sunny")
elif a == "Cloudy":
    print("Rainy")

Buggy submission (verdict: Runtime Error):
a = input()
if a == "Sunny":
    print("Cloudy")
elif a == "Rainy":
    print("Sunny")
else a == "Cloudy":
    print("Rainy")
Problem p02909 (python)

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

Buggy submission (verdict: Runtime Error):
list = ["Sunny", "Cloudy", "Rainy"]
i = str(input())
for i in list:
    print(list[list.index("i")+1])
Problem p02910 (python)

Fixed submission:
s = input()
even = ["L","U","D"]
odd = ["R","U","D"]
f=True
for i in range(len(s)):
    if i%2==1:
        if s[i] not in even:
            f = False
    if i%2==0:
        if s[i] not in odd:
            f=False
if f:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s = input()
even = ["L","U","D"]
odd = ["R","U","D"]
f=True
for i in range(len(s)):
    if i%2==1:
        if s[i] not in even:
            f = False
    if i%2==0:
        id s[i] not in odd:
            f=False
if f:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s = input()
even = ["L","U","D"]
odd = ["R","U","D"]
f=True
for i in range(len(s)):
    if i%2==1:
        if s[i] not in even:
            f = False
    if i%2==0:
        id s[i] not in odd:
            f=False
if f:
    peint("Yes")
else:
    print("No")
Problem p03059 (python)

Fixed submission:
A,B,T = list(map(float,input().split()))
T += 0.5
print(int(T // A * B))

Buggy submission (verdict: Runtime Error):
A,B,T = list(map(float,input().split()))
T += 0.5 
T -= A
while T > 0:
  SUM += B
  T -= A
print(int(B))
Problem p03146 (python)

Fixed submission:
def cal(s):
    if s % 2 == 0:
        return int(s/2)
    else:
        return s * 3 + 1


s = int(input())
array = []
cnt = 1
array.append(s)
while True:
    s = cal(s)
    array.append(s)
    if array[cnt] in array[:cnt]:
        print(cnt +1)
        break
    cnt += 1

Buggy submission (verdict: Runtime Error):
s = int(input())
array = []
cnt = 1
array.append(s)
while True:
    s = cal(s)
    array.append(s)
    if array[cnt] in array[:cnt]:
        print(cnt +1)
        break
    cnt += 1
Problem p03238 (python)

Fixed submission:
X = int(input())
if X == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A + B)

Buggy submission (verdict: Runtime Error):
X = int(input())
if X == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input()
  print(A + B)
Problem p03273 (python)

Fixed submission:
h,w = map(int,input().split())
board = []
checkColumn = [False]*h
checkRow = [False]*w
for i in range(h):
    board.append(input())

for i in range(h):
        for j in range(w):
            if board[i][j] == "#":
                checkColumn[i] = True
                checkRow[j] = True
for i in range(h):
    if checkColumn[i]:
        for j in range(w):
            if checkRow[j]:
                print(board[i][j],end="")
        print()

Buggy submission (verdict: Runtime Error):
h,w = map(int,input().split())
board = []
checkX = [False]*w
checkY = [False]*h
for i in range(h):
    board.append(input())

for i in range(h):
        for j in range(w):
            if board[i][j] == "#":
                checkX[i] = True
                checkY[j] = True
for i in range(h):
    if checkX[i]:
        for j in range(w):
            if checkY[j]:
                print(board[i][j],end="")
        print()

Buggy submission (verdict: Runtime Error):
h,w = map(int,input().split())
board = []
checkX = [False]*w
checkY = [False]*h
for i in range(h):
    board.append(input())

for i in range(w):
        for j in range(h):
            if board[i][j] == "#":
                checkX[i] = True
                checkY[j] = True
for i in range(w):
    if checkX[i]:
        for j in range(h):
            if checkY[j]:
                print(board[i][j],end="")
        print("")
Problem p03360 (python)

Fixed submission:
a,b,c = map(int,input().split())
k = int(input())
ans = 0
for i in range(k+1):
    for j in range(k+1-i):
        n = k - (i + j)
        res = a * 2 ** i + b * 2 ** j + c * 2 ** n
        ans = max(ans,res)
print(ans)

Buggy submission (verdict: Runtime Error):
x = int(input())
ans = 0
power = 0
for b in range(2,x+1):
    p = 2
    while True:
        power = b ** p
        if power > x:
            break
        else:
            ans = max(ans,power)
            p += 1
print(ans)
Problem p03369 (python)

Fixed submission:
S = list(input())
sum = 700
for s in S:
  if s == "o":
    sum += 100
print(sum)

Buggy submission (verdict: Runtime Error):
S = list(input())
sum = 700
for s in S:
  if s = "o":
    sum += 100
print(sum)
Problem p03423 (python)

Fixed submission:
N = int(input())
print(N // 3)

Buggy submission (verdict: Runtime Error):
N = int(input)
print(N // 3)
Problem p03455 (python)

Fixed submission:
a, b = list(map(int,input().split()))
if a * b % 2 == 0:
  print("Even")
else:
  print("Odd")

Buggy submission (verdict: Runtime Error):
a, b = list(map(int,input().split()))
if a * b % 2 == 0:
  print("Even")
else:
  pritn("Odd")
Problem p03609 (python)

Fixed submission:
X, t = list(map(int,input().split()))
s = X - t
if s > 0:
  print(s)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
X, t = list(map(int,input()))
s = X -t
if s > 0:
  print(s)
else:
  print(0)
Problem p03657 (python)

Fixed submission:
A, B = list(map(int,input().split()))
if A % 3 ==0 or B % 3 ==0 or (A + B) % 3 == 0:
  print("Possible")
else:
  print("Impossible")

Buggy submission (verdict: Runtime Error):
A, B = list(map(int,input().split()))
if A * B % == 0:
  print("Possible")
else:
  print("Impossible")
Problem p03671 (python)

Fixed submission:
a, b, c = list(map(int,input().split()))
print( (a + b + c) - max(a,b,c))

Buggy submission (verdict: Runtime Error):
a, b, c = list(map(int,input().split()))
print(sum(a,b,c) - max(a,b,c))
Problem p03679 (python)

Fixed submission:
X, A, B = list(map(int,input().split()))
if B - A <= 0:
  print("delicious")
elif B - A <= X:
  print("safe")
else:
  print("dangerous")

Buggy submission (verdict: Runtime Error):
X, A, B = list(map(int,input().split()))
if A - B <= 0:
  print("delicious")
elif A - B <= X:
  print("safe")
else:
  print("dangerous)