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

Fixed submission:
S = input()

if S == ("SUN"):
    print(7)
elif S == ("MON"):
    print(6)
elif S == ("TUE"):
    print(5)
elif S == ("WED"):
    print(4)
elif S == ("THU"):
    print(3)
elif S == ("FRI"):
    print(2)
elif S == ("SAT"):
    print(1)

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

if S == ("SUN"):
    pritn(7)
elif S == ("MON"):
    print(5)
elif S == ("TUE"):
    print(4)
elif S == ("WED"):
    print(3)
elif S == ("THU"):
    print(2)
elif S == ("FRI"):
    print(1)
elif S == ("SAT"):
    print(1)

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

if S == ("SUN"):
    pritn(7)
elif S == ("MON"):
    print(6)
elif S == ("TUE"):
    print(5)
elif S == ("WED"):
    print(4)
elif S == ("THU"):
    print(3)
elif S == ("FRI"):
    print(2)
elif S == ("SAT"):
    print(1)

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

if S == ("SUN"):
    pritn(7)
elif S == ("MON"):
    print(6)
elif S == ("TUE"):
    print(5)
elif S == ("WED"):
    print(4)
elif S == ("THU"):
    print(3)
elif S == ("FRI"):
    print(2)
elif S == ("SAT"):
    print(1)
Problem p02859 (python)

Fixed submission:
N = int(input())

print(N*N)

Buggy submission (verdict: Runtime Error):
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]

t = 1
for i in range(1, N - 1):
  t *= i

ans = 0
for i in range(N - 1):
  for j in range(i + 1, N):
    x1, y1 = xy[i]
    x2, y2 = xy[j]
    ans += (((x1 - x2) ** 2 + (y1 - y2) ** 2) ** (1 / 2)) * (N - 1) * 2 * t

n = 1
for i in range(1, N + 1):
  n *= i

ans /= n

print(ans)
Problem p02860 (python)

Fixed submission:
N = int(input())
S = input()
if N%2==1:
    print("No")
else:
    center = int(len(S)/2)
    if S == S[:center]*2:
        print("Yes")
    else:
        print("No")

Buggy submission (verdict: Runtime Error):
S = int(input())
LENS = int((len(S))/2)
mae = S[0:LENS]
usiro = S[LENS:len(S)]

if mae == usiro:
    print("Yes")
else:
    print("No")
Problem p02879 (python)

Fixed submission:
a, b = map(int,input().split())
if 1 <= a <= 9 and 1 <= b <= 9:
    print(a*b)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
 
if 1 <= a =<9 and 1 <= b <=9:
    print(a*b)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
 
if 1<=a=<9 and 1<=b<=9:
    print(a*b)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
 
if 1<=a=<9 and 1<=b<=9:
  print(a*b)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
 
if 1<=a=<9 and 1<=b<=9:
  print(a*b)
else:
  print("-1")

Buggy submission (verdict: Runtime Error):
a, b = map(int,input().split())
 
if 1<=a=<9 and 1<=b<=9:
  print(a*b)
else:
  pritn("-1")

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

if 1<=a=<9,1<=b<=9:
  print(a*b)
else:
  pritn("-1")
Problem p02915 (python)

Fixed submission:
N = int(input())

print(N**3)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

#tempは空白の箱に過ぎず、一番最初のfor文では確定演出で問答無用にXの値になる。
#for文が2週目に突入してからが、tempの分かれ目。2回目のfor文でも一致はせず素直に3が代入される。
#最後のif文　temp == x-1 が一致するのは　１回目と2回目　or 2回目と3回目が連番。つまり-1して一致すれば連続


#満足度を記録していくための変数
cnt = 0

#1つ前に食べた料理を記録するための変数
temp = ""

#料理を食べた順番に処理していく
for x in A:
    
    #食べた料理の満足度を追加
    cnt += B[x-1]
    
    #今食べた料理が1つ前に食べた料理のi+1かどうかを確認
    if temp == x - 1:
        cnt += C[temp-1]
        
    #今食べた料理を記録    
    temp = x
#全ての料理に対して処理が終わったら満足度を出力   
print(cnt)
Problem p02933 (python)

Fixed submission:
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
 
ans = 0
 
for i in range(N):
    ans = ans + 1 / A[i]
 
ans = 1 / ans 
 
print(ans)

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

A = [int(input()) for _ in range(N)]
Ans = 0

for i in range(N):
    v += 1 / a[i]
print(1 / Ans)
Problem p02951 (python)

Fixed submission:
A,B,C = map(int,input().split())


#容器1に残りどの位の容量があるか。
D = C-(A-B)

if D>=0:
    print(D)
else:
    print("0")

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

#Pythonのfor文range()の右側<最大値>は書いている値から-1されるものなので、注意する。(+1する)

for i in range(1, N + 1):

    if len(str(i)) % 2 == 1:
        ans += 1

print(ans)
Problem p02987 (python)

Fixed submission:
S = input()
if S[0] == S[1] == S[2] == S[3]:
  print('No')
elif (S[0] == S[1] and S[2] == S[3]) or (S[0] == S[2] and S[1] == S[3]) or (S[0] == S[3] and S[1] == S[2]):
  print('Yes')
else:
  print('No')

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

ans = 0

#+2まで考慮してるから、nの数を-2にして調整しろ
for i in range(n-2):
	if p[i] < p[i + 1] < p[i + 2] or p[i + 2] < p[i + 1] < p[i]:
		ans = ans + 1

print(ans)
Problem p03012 (python)

Fixed submission:
N = int(input())
W = list(map(int, input().split()))

ans = []

for i in range(N):
    mae = sum(W[:i])
    usiro = sum(W[i:]) 
    abus = abs((mae)-(usiro))
    ans.append(abus)

print(min(ans))

Buggy submission (verdict: Runtime Error):
b
Problem p03041 (python)

Fixed submission:
n, k = map(int,input().split())
s = list(input())
 
if s[k-1] == "A":
  s[k-1] = "a"
elif s[k-1] == "B":
  s[k-1] = "b"
elif s[k-1] == "C":
  s[k-1] = "c"
 
print("".join(s))

Buggy submission (verdict: Runtime Error):
N,K = map(str, input().split())
S = int(input())


#n番目の文字を指定されたら n-1番目が真の指定

number = (K-1)

if S[number] == "A":
    S[number] = "a"
elif S[number] == "B":
    S[number] = "b"
elif S[number] == "C":
    S[number] = "c"     

print("".join(s))

Buggy submission (verdict: Runtime Error):
N,K = map(str, input().split())
S = int(input())


#n番目の文字を指定されたら n-1番目が真の指定

number = (K-1)

if S[number] == "A":
    S[number] = "a"
elif S[number] == "B":
    S[number] = "b"
elif S[number] == "C":
    S[number] = "c"     

print(S)

Buggy submission (verdict: Runtime Error):
N,K = map(int, input().split())
S = input()


if S[K-1] == "A":
    S[K-1] = "a"
elif S[K-1] == "B":
    S[K-1] = "b"
elif S[K-1] == "C":
    S[K-1] = "c"

print("".join(S))

Buggy submission (verdict: Runtime Error):
if S[K-1] == "A":
    S[K-1] = "a"
elif S[K-1] == "B":
    S[K-1] = "b"
elif S[K-1] == "C":
    S[K-1] = "c"

print("".join(S))

Buggy submission (verdict: Runtime Error):
N,K = map(int, input().split())
S = input()


if S[K+1] == "A":
    S[K+1] = "a"
elif S[K+1] == "B":
    S[K+1] = "b"
elif S[K+1] == "C":
    S[K+1] = "c"

print("".join(S))

Buggy submission (verdict: Runtime Error):
N,K = map(int, input().split())
S = input()


if S[K] == "A":
    S[K] = "a"
elif S[K] == "B":
    S[K] = "b"
elif S[K] == "C":
    S[K] = "c"

print("".join(S))

Buggy submission (verdict: Runtime Error):
N,K = map(int, input().split())
S = input()


if S[K] == "A":
    S[K] = "a"
elif S[K] == "B":
    S[K] = "b"
elif S[K] == "C":
    S[K] = "c"

print(S)
Problem p03042 (python)

Fixed submission:
S=input()
A=int(S[:2])
B=int(S[2:])
if 1<=A<=12:
    if 1<=B<=12:
        print("AMBIGUOUS")
    else:
        print("MMYY")
else:
    if 1<=B<=12:
        print("YYMM")
    else:
        print("NA")

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

if  0 < int(S[0:2]) <=12  and 0 < (int(S[2:4])) <= 12:
    print("AMBIGUOUS")
elif int(S[0:2]) > 12 and 0 < (int(S[2:4])) <= 12:
    print("YYMM")
elif 0 < int(S[0:2]) <= 12 and int(S[2:4]) > 12:
    print("MMYY")
elif int(S[0:2]) == and 0 < (int(S[2:4])) <= 12:
    print("YYMM")
elif 0 < int(S[0:2]) <= 12  and 0 < (int(S[2:4])) == 0:
    print("MMYY")
else:
    print("NA")
Problem p03135 (python)

Fixed submission:
T, X = map(int, input().split())
print(T / X)

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

X = sorted(X)

anslis = []


if M <= N:
    print(0)
    sys.exit()


    
for i in range(M-1):
    ans = abs(X[i+1] - X[i])
    anslis.append(ans)
    ans = 0

anslis = sorted(anslis)

if N==1:
    print(sum(anslis))
else:
    print(sum(anslis[0:M-N]))

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

X = sorted(X)

anslis = []


if M <= N:
    print(0)
    sys.exit()


    
for i in range(M-1):
    ans = abs(X[i+1] - X[i])
    anslis.append(ans)
    ans = 0

anslis = sorted(anslis)

if N==1:
    print(sum(anslis))
else:
    print(sum(anslis[0:N+1]))

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

X = sorted(X)

anslis = []


if M <= N:
    print(0)
    sys.exit()


    
for i in range(M-1):
    ans = abs(X[i+1] - X[i])
    anslis.append(ans)
    ans = 0

anslis = sorted(anslis)

print(sum(anslis[0:N-1]))

Buggy submission (verdict: Runtime Error):
N = int(input())
L = sorted([int(_) for _ in input().split()])
if L[N - 1] < sum(L[:N - 1]):
    print('Yes')
else:
    print('No')

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

L_max = max(L)

print(L_max)

L_Down =sorted(L,reverse=True)

print(L_Down)

L_Down_Re = L_Down[1:len(L_Down)]

print(L_Down_Re)

L_Down_Re_Sum =  sum(L_Down_Re)

print(L_Down_Re_Sum)

if L_max <= L_Down_Re_Sum:
    print("Yes")
else:
    print("No")

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

AREA = x*y

AREA2 =(AREA/2) 


print(AREA2)
Problem p03207 (python)

Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
import numpy as np


N = int(input())

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

new_p[0] = new_p[0]//2

print(sum(new_p))

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

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

new_p[0] = new_p[0]//2

print(sum(new_p))

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

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))

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

p = []

for i in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))

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

p = []

for i in raneg(N):
    P = int(input())
    p.append(P)


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))
Problem p03265 (python)

Fixed submission:
x1, y1, x2, y2 = map(int, input().split())

X = x2 - x1
Y = y2 - y1

print((x2-Y),(y2 + X),(x1-Y),(y1 + X))

Buggy submission (verdict: Runtime Error):
a
Problem p03307 (python)

Fixed submission:
n = int(input())
print(2*n if n%2 else n)

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
a = 2


def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(a, n))
Problem p03774 (python)

Fixed submission:
N, M = map(int, input().split())

studentlis = []
for _ in range(N):
    a, b = map(int, input().split())
    studentlis.append([a,b])

checkpointlis = []
for _ in range(M):
    c, d = map(int, input().split())
    checkpointlis.append([c,d])

ans_lis = []


for i in range(len(studentlis)):
    ans = int(10**100)

    tmpstudentlis = studentlis[i]

    x1 = tmpstudentlis[0]
    y1 = tmpstudentlis[1]
    
    for j in range(len(checkpointlis)):
        tmpcheckpointlis = checkpointlis[j]

        x2 = tmpcheckpointlis[0]
        y2 = tmpcheckpointlis[1]
        
        distance = (abs(x1-x2) + abs(y1-y2))

        if distance < ans:
            ans = distance
            num = j

        if j == len(checkpointlis)-1:
            ans_lis.append(num+1)


for i in ans_lis:
    print(i)

Buggy submission (verdict: Runtime Error):
a
Problem p03835 (python)

Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
K,S= map(int, input().split())

number_lis = []
ans = 0

for i in range(0,K+1):
    number_lis.append(i)

for j in number_lis:
    for k in number_lis:
        for l in number_lis:
            if 0<= (S　-j -k) <=K:
                ans = ans + 1
                
print(ans)

Buggy submission (verdict: Runtime Error):
K,S = [int(i) for i in input().split()]


ans = 0

for x in range(K+1):
    for y in range(K+1):
        if 0 <= S-x-y <=k:
            ans = ans + 1
print(ans)

Buggy submission (verdict: Runtime Error):
K, S = map(int, input().split())


ans = 0

for x in range(K+1):
    for y in range(K+1):
        if 0 <= S-x-y <=k:
            ans = ans + 1
print(ans)
Problem p02790 (python)

Fixed submission:
a,b=map(int,input().split())
A=[str(a)*b]
B=[str(b)*a]
if a>b:
    print(int(''.join(B)))
if a<b:
    print(int(''.join(A)))
if a==b:
    print(int(''.join(A)))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
A=[str(a)*b]
B=[str(b)*a]
if a>b:
    print(int(B))
if a<b:
    print(int(A))
if a==b:
    print(int(A))
Problem p02659 (python)

Fixed submission:
A,B=map(str,input().split())
B_100=B.replace('.','')
print(int(A)*int(B_100)//100)

Buggy submission (verdict: Runtime Error):
A,B=map(str,input().split())
B=int(float(B)*100)
ans=A*B
print(int(ans//100))
Problem p02831 (python)

Fixed submission:
A,B=map(int,input().split())
def gcd(a,b):
    if a<b:
        a,b=b,a
    if b==0:
        return a
    else:
        return gcd(b,a%b)
print(int(A*B/gcd(A,B)))

Buggy submission (verdict: Runtime Error):
import math
A,B=map(int,input().split())
print(int(A*B/math.gcd(A,B)))
Problem p02629 (python)

Fixed submission:
n = int(input())
chars = "Xabcdefghijklmnopqrstuvwxyz"  # x番目がほしいときにchars[x-1]としたくないので、chars[0]は使わないことにします

n_rem = n  # 入力を直接操作すると、もし後々必要になったときに面倒なので
res = ""

while True:
    x = n_rem % 26
    # 余りが0、つまりzの場合は、26にします
    if x == 0:
        x = 26
    res += chars[x]

    # xを引いて、26で割ります
    n_rem -= x

    # 0なら終了します
    if n_rem == 0:
        break

    n_rem //= 26

# 0桁目が先頭で、最後の桁が末尾になっているので、反転させます
print(res[::-1])

Buggy submission (verdict: Runtime Error):
N=int(input())
chars="Xabcdefghijklmnopqrstuvwxyz")
res=""
n_rem=N
while True:
  x=n_rem%26
  if x==0:
    x=26
  res+=chars[x]
  n_rem-=x
  if n_rem==0:
    break
  n_rem//=26
print(res[::-1])

Buggy submission (verdict: Runtime Error):
N=int(input())
chars="Xabcdefghijklmnopqrstuvwxyz")
N_rem=N
res=""
while True:
  x=N_rem%26
  if x==0:
    x=26
  res+=chars[x]
  N_rem-=x
  if N-rem==0:
    break
  N_rem//=26
print(res[::-1])
Problem p02689 (python)

Fixed submission:
N,M=map(int,input().split())
H=list(map(int,input().split()))
A=[0]*N
for i in range(M):
  a,b=list(map(int,input().split()))
  A[a-1]=max(A[a-1],H[b-1])
  A[b-1]=max(A[b-1],H[a-1])
s=0
for i in  range(N):
  if H[i]>A[i]:
    s+=1
print(s)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split())
H=list(map(int,input().split()))
a=[0]*N #H[i]と接する高さの最大値
for i in range(M):
  A,B=map(int,input().split())
  a[A-1]=max(a{A-1],H[B-1])
  a[B-1]=max(a[B-1],H[A-1])
s=0
for i in range(M):
  if H[i]>A[i]:
    s+=1
print(s)
Problem p02779 (python)

Fixed submission:
N=int(input())
A=map(int,input().split())
n=len(set(A))
if N!=n:
  print("NO")
else:
  print("YES")

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
s=0
for i in range(N-1):
  for j in range(i+1,N):
    if all(A[i]!=A[j]):
      print("YES")
    else:
      print("NO")

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
s=0
for i in range(N-1):
  for j in range(i+1,N):
if all(A[i]!=A[j]):
  print("YES")
else:
  print("NO")
Problem p02785 (python)

Fixed submission:
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
print(sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
H.remove(H[0:K])
print(sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
for i in range(K):
  H.remove(H[i])
print(sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
H.remove(H[0:K])
print(sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
T=H.sort(reverse=True)
T.remove(T[0:K])
print(K+sum(T[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
H.remove(H[0:K])
print(K+sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
for i in range(K):
  H.remove(H[i])
print(K+sum(H[K:]))

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
for i in range(K):
  H.remove(H[i])
print(K+sum(H[K::]))
Problem p02819 (python)

Fixed submission:
X=int(input())
b=X**0.5
while any(X%i==0 for i in range(2,int(b)+1)):
  X+=1
else:
  print(X)

Buggy submission (verdict: Runtime Error):
import math
X=int(input())
for i in range(0,20):
  a=X+i
  b=a**0.5
  for j in range(2,math.floor(b)+1):
    if a%b!=0:
      print(a)
       break
break

Buggy submission (verdict: Runtime Error):
def main():
  import math
  X=int(input())
  for i in range(0,20):
    a=X+i
    b=a**0.5
    for j in range(2,math.floor(b)):
      if a%b!=0:
        print(a)
        break
  break

main()

Buggy submission (verdict: Runtime Error):
import math
X=int(input())
for i in range(0,X):
  a=X+i
  c=int(math.sqrt(a))
  for j in range(2,c):
    if a%j!=0:
      print(a)
break

Buggy submission (verdict: Runtime Error):
def main():
  X=int(input())
  for i in X:
    a=X+i
    if all(a%j!=0 for j in range(2,a)):
      print(a)
  break
main()
Problem p02836 (python)

Fixed submission:
def main():
  S=input()
  s=0
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[N-1-i]:
      s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  s=0
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[N-1-i]:
      S[N-1-i]=S[i]
      s+=1
    else:
      s=s
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  s=0
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[-i-1]:
      S[-i-1]=S[i]
      s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  s=0
  S=input()
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[N-1-i]:
      S[i]=S[N-1-i]
      s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  s=0
  S=input()
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[N-1-i]:
      S[N-1-i]=S[i]
      s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  s=0
  S=input()
  N=len(S)
  for i in range(N//2);
    if S[i]!=S[N-1-i]:
      S[N-1-i]=S[i]
      s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  N=len(S)
  s=0
  for i in range(N//2):
      if S[i]!=S[-i-1]:
        S[-i-1]=S[i]
        s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  N=len(S)
  s=0
  for i in range(N//2):
      if S[i]!=S[N-1-i]:
        S[N-1-i]=S[i]
        s+=1
     else:
       s=s
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  N=len(S)
  s=0
  for i in range(N//2):
      if S[i]!=S[N-1-i]:
        S[N-1-i]=S[i]
        s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
def main():
  S=input()
  N=len(S)
  s=0
  if N%2==0:
    for i in range(N//2):
      if S[i]!=S[N-1-i]:
        S[N-1-i]=S[i]
        s+=1
  else:
     for i in range(N//2):
       if S[i]!=S[N-1-i]:
         S[N-1-i]=S[i]
         s+=1
  print(s)
main()

Buggy submission (verdict: Runtime Error):
S=input()
N=len(S)
s=0
if N%2==0:
  for i in range(0,N//2+1):
    if S[i]!=S[N-1-i]:
      S[N-1-i]=S[i]
      s+=1
  print(s)
else:
  for i in range(0,N//2):
    if S[i]!=S[N-1-i]:
      S[N-1-i]=S[i]
      s+=1
  print(s)

Buggy submission (verdict: Runtime Error):
S=input()
a=0
n=len(S)
for i in range(n):
  if S[i]!=S[n-i-1]:
    S[n-i-1]=S[i]
    a+=1
print(a)
Problem p02860 (python)

Fixed submission:
def main():
  N=int(input())
  S=input()
  n=len(S)
  T=S[0:n//2]
  if n%2==0:
    if S==T+T:
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()

Buggy submission (verdict: Runtime Error):
N=int(input())
S=input()
n=len(S)
if n%2==0:
  T=S[0:n/2]
   if S==T+T:
     print("Yes")
   else:
     print("No")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    half=S[0:n/2]
    if S=half+half:
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if all(S[i]==S[n/2+i] for i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
 main()

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  S=input()
  n=len(S)
  if n%2!=0:
    print("No")
  if n%2==0:
    if all(S[i]==S[n/2+i] for i in range(n/2)):
      print("Yes")
    else:
      print("No")
 main()

Buggy submission (verdict: Runtime Error):
def main()
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if S[i]==S[n/2+i] for all(i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()

Buggy submission (verdict: Runtime Error):
def main()
  N=int(input())
  S=input()
  n=len(S)
  if n%2==0:
    if S[i]==S[n/2+i] for all(i in range(n/2)):
      print("Yes")
    else:
      print("No")
  else:
    print("No")
Problem p02880 (python)

Fixed submission:
N=int(input())
list=[]
for i in range(1,10):
  for j in range(1,10):
    list.append(i*j)
if N in list:
   print("Yes")
else:
   print("No")

Buggy submission (verdict: Runtime Error):
N=int(input())
list=[]
for i in range(1,10):
  for j in range(1,10):
    list.append(i*j)
if N in list:
   print("Yes")
 else:
   print("No")

Buggy submission (verdict: Runtime Error):
N=int(input())
A=[]
for i in range(1:10):
  for j in range(1:10):
    A.append(i*j)
if  N in A:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
N=int(input())
A=[]
for i in range(1:10):
  for j in range(1:10):
    A.append(i*j)
 if N in A:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
N=int(input())
list=[]
for i in range(1:10):
  for j in range(1:10):
    list.append(i*j)
if N in list:
   print("Yes")
 else:
   print("No")

Buggy submission (verdict: Runtime Error):
N=int(input())
list=[]
for i in range(1:10):
  for j in range(1:10):
    list.append(i*j)
if N in list:
   print("Yes")
 else:
   print("No")

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  list=[]
  for i in range(1:10)
    for j in range(1:10):
      list.append(i*j)
  if N in list:
    print("Yes")
  else:
    print"No")
main()

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  for i in range(1:10)
    for j in range(1:10):
      if all(N==i*j):
        print("No")
      else:
        print("else")
main()

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  for i in range(1:10)
    for j in range(1:10):
      if N==i*j:
        print("Yes")
      else:
        print("No")
main()

Buggy submission (verdict: Runtime Error):
def main():
  N=int(input())
  for i in range(1:10)
    for j in range(1:10):
      if N=i*j:
        print("Yes")
      else:
        print("No")
main()