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

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(N: int, K: int):
    count = 0
    while True:
        N = N // K
        if N >= 1:
            count += 1
        else:
            break
    print (count+1)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
import numpy as np
import math

def solve(N: int, X: "List[int]"):
    place = np.mean(X)
    place = round(place)
    result = 0
    for i in range(N):
        result += (X[i]-place) ** 2
    print(int(result))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    X = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, X)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys


def solve(N: int, K: int):
    count = 0
    while True:
        N = N // K
        if N >= 1:
            count += 1
        else:
            break
    print (cont)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

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

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(T: int, X: int):
    print(T / X)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    T = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(T, X)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):

#!/usr/bin/env python3
import sys


def solve(T: int, X: int):
    print(T / Xl)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    T = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(T, X)

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

Fixed submission:
#coding:utf-8

N = int(input())
p = []
max_val = -1
for i in range(N):
    p_i = int(input())
    p.append(p_i)
    max_val = max(max_val, p_i)

s = 0
flag = 0
for p_i in p:
    if p_i == max_val and flag==0:
        s += p_i * 0.5
        flag = 1
    else:
        s += p_i
print(int(s))

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

N = input()

p = []
max_val = -1
for i in range(N):
    p_i = input()
    p.append(p_i)
    max_val = max(max_val, p_i)

s = 0
flag = 0
for p_i in p:
    if p_i == max_val and flag==0:
        s += p_i * 0.5
        flag = 1
    else:
        s += p_i
print(int(s))

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

N = input()

p = []
max_val = -1
for i in range(N):
    p_i = input()
    p.append(p_i)
    max_val = max(max_val, p_i)

sum = 0
flag = 0
for p_i in p:
    if p_i == max_val and flag==0:
        sum += p_i * 0.5
        flag = 1
    else:
        sum += p_i
print(int(sum))
Problem p02984 (python)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
s = sum(A)
A = A*2

ans = []
for i in range(2):
    ans.append(str(s - sum(A[i+1:N+i-1:2])*2 ))
for i in range(2,N):
    ans.append(str(int(ans[i-2])+(A[i-1]-A[N+i-2])*2))

ans = ' '.join(ans)
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
s = sum(A)
A = A*2

ans = []
for i in range(2):
    ans.append(str(s - sum(A[i+1:N+i-1:2])*2 ))
for i in range(2,N):
    ans.append(str(int(ans[i-2])+(A[i-11]-A[N+i-2])*2))

ans = ' '.join(ans)
print(ans)
Problem p02998 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**6)

N = int(input())
XY = [[[] for _ in range(10**5 +1)] for __ in range(2)]
for _ in range(N):
    x, y = map(int, input().split())
    XY[0][x].append(y)
    XY[1][y].append(x)

def DFS(i, XorY=0):
    for next in XY[XorY][i]:
        if visited[1-XorY][next]==0:
            visited[1-XorY][next] = 1
            DFS(next, 1-XorY)
            count[1-XorY] += 1

ans = 0
visited = [[0 for _ in range(10**5 +1)] for __ in range(2)]
for i in range(10**5 +1):
    if XY[0][i]!=[] and visited[0][i]==0:
        visited[0][i]=1
        count = [1,0]
        DFS(i)
        ans += count[0]*count[1]
ans -= N

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
XY = [[[] for _ in range(10**5 +1)] for __ in range(2)]
for _ in range(N):
    x, y = map(int, input().split())
    XY[0][x].append(y)
    XY[1][y].append(x)

def DFS(i, XorY=0):
    for next in XY[XorY][i]:
        if visited[1-XorY][next]==0:
            visited[1-XorY][next] = 1
            DFS(next, 1-XorY)
            count[1-XorY] += 1

ans = 0
visited = [[0 for _ in range(10**5 +1)] for __ in range(2)]
for i in range(10**5 +1):
    if XY[0][i]!=[] and visited[0][i]==0:
        visited[0][i]=1
        count = [1,0]
        DFS(i)
        ans += count[0]*count[1]
ans -= N

print(ans)
Problem p03104 (python)

Fixed submission:
def f(n):
	if n%4 == 3:
		return 0
	elif n%4 == 0:
		return n
	elif n%4 == 1:
		return 1
	else:
		return n+1

def xor(x,y):
	c = 0
	k = 0
	while 2**k < max(x,y)+1:
		c += (2**k) * ( (((x//(2**k))%2) + ((y//(2**k))%2)) %2 )
		k += 1
	return c

a,b = list(map(int,input().split()))
print(xor(f(a-1),f(b)))

Buggy submission (verdict: Runtime Error):
def f(b):
	if b% 4 == 0 or b%4 == 3:
		ans2 = '0'
	else:
		ans2 = '1'
	for i in range(40)
		k = i+1
		c = b // (2**k)
		if c % 2 ==1 and B % 2 == 1:
			ans2 = '0'+ ans2
		else:
			ans2 = '1' + ans2
	return ans2

def add(x,y):
	c = 0
	for i in range(41)
		c += ((int(x[i]) + int(y[i]))%2) * (2**(40-i))
	return c
	
a,b = list(map(int,input().split()))
print(add(f(a),f(b)))
Problem p02577 (python)

Fixed submission:
n=str(input())
sum=0
for i in n:
	sum+=int(i)
if sum%9==0:
	print('Yes')
else:
	print("No")

Buggy submission (verdict: Runtime Error):
n=str(input())
sum=0
for i in n:
	sum+=int(i)
if sum%9=0:
	print('Yes')
else:
	print("No")
Problem p02729 (python)

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

from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

if M == 0 and N == 0:
    print(0)
elif M == 1 and N == 1:
    print(0)
elif M <= 1:
    print(cmb(N, 2))
elif N <= 1:
    print(cmb(M, 2))
else:
    a = cmb(M, 2)
    b = cmb(N, 2)
    print(a + b)

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

from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

if M == 0 and N == 0:
    print(0)
elif M == 0:
    print(cmb(N, 2))
elif N == 0:
    print(cmb(M, 2))
elif M <= 1 and N <= 1:
    print(0)
else:
    a = cmb(M, 2)
    b = cmb(N, 2)
    print(a + b)

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

from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

if M == 0:
    print(cmb(N, 2))
elif N == 0:
    print(cmb(M, 2))
elif M <= 1 and N <= 1:
    print(0)
else:
    a = cmb(M, 2)
    b = cmb(N, 2)
    print(a + b)

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

from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

if M <= 1 and N <= 1:
    print(0)
elif M == 2 and N == 2:
    print(2)
elif M == 2:
    print(cmb(N, 2)+1)
elif N == 2:
    print(cmb(M, 2)+1)
elif M == 0:
    print(cmb(N, 2))
elif N == 0:
    print(cmb(M, 2))
else:
    a = cmb(M, 2)
    b = cmb(N, 2)
    print(a + b)

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

from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

if M <= 1 and N <= 1:
    print(0)
elif M == 0:
    print(cmb(N, 2))
elif N == 0:
    print(cmb(M, 2))
else:
    a = cmb(M, 2)
    b = cmb(N, 2)
    print(a + b)

Buggy submission (verdict: Runtime Error):
import math

N, M = map(int, input().split())
if M <= 1 and N <= 1:
    print(0)
elif N == 0:
    print(int((math.factorial(M)/(2*math.factorial(M-2)))))
elif M == 0:
    print(int((math.factorial(N)/(2*math.factorial(N-2)))))
else:
    print(int((math.factorial(N)/(2*math.factorial(N-2))) + (math.factorial(M)/(2*math.factorial(M-2)))))
Problem p02831 (python)

Fixed submission:
import fractions

A, B = map(int,input().split())

def lcm(a,b):
    y = a*b / fractions.gcd(a,b)
    return int(y)

print(lcm(A,B))

Buggy submission (verdict: Runtime Error):
import math

A, B = map(int,input().split())

def lcm(a,b):
    y = a*b / math.gcd(a,b)
    return int(y)

print(lcm(A,B))

Buggy submission (verdict: Runtime Error):
import numpy as np

A, B = map(int,input().split())

print(np.lcm(A, B))
Problem p03774 (python)

Fixed submission:
n, m = map(int, input().split())

student = list()

for x in range(n):
    student.append(list(map(int, input().split())))

checkpoint = list()

for y in range(m):
    checkpoint.append(list(map(int, input().split())))

INF = 4*(10**8) + 1
tmp = INF
ans = 51

for x in range(n):
    for y in range(m-1, -1, -1):
        distance = abs(student[x][0] - checkpoint[y][0]) + \
            abs(student[x][1] - checkpoint[y][1])

        if tmp >= distance:
            tmp = distance
            ans = y
    print(ans+1)
    tmp = INF

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

student = list()

for x in range(n):
    student.append(list(map(int, input().split())))

checkpoint = list()

for y in range(m):
    checkpoint.append(list(map(int, input().split())))

tmp = 10**8+1

for x in range(n):
    for y in range(m-1, -1, -1):
        distance = abs(student[x][0] - checkpoint[y][0]) + \
            abs(student[x][1] - checkpoint[y][1])
        if tmp >= distance:
            tmp = distance
            ans = y
    print(ans+1)
Problem p02831 (python)

Fixed submission:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

def euclid(a, b):
    if a < b:
        a, b = b, a
    while a % b != 0:
        a, b = b, a % b
    return b

print(A * B // euclid(A, B))

Buggy submission (verdict: Runtime Error):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b = map(int, input().split())
print(a * b // gcd(a, b))
Problem p02577 (python)

Fixed submission:
a = input()
s = int(a)
s = list(map(int, a))
b=int(a)


if b%9==0 or sum(s)%9==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a = input()
s=0
s = int(a)
s = list(map(int, a))


if int(a)%9==0 or s%9==0:
    print('Yes')
else:
    print('No')
Problem p02596 (python)

Fixed submission:
k = int(input())
count = 0
before = 0
if k % 2 == 0 or k % 5 == 0:
    print(-1)
    exit()

ai = 0
i = 0
while True:
    ai = (ai*10+7) % k
    i += 1
    if ai == 0:
        print(i)
        break

Buggy submission (verdict: Runtime Error):
count = 0
before = 0
if k%2 == 0 or k%5==0:
    print(-1)
    exit()

ai=0
i=0
while True:
    ai = (ai*10+7)%k
    i += 1
    if ai == 0:
        print(i)
        break
Problem p02627 (python)

Fixed submission:
in_str = input()
if in_str.isupper() == True:
    print("A")
else:
    print("a")

Buggy submission (verdict: Runtime Error):
n = int(input())
list_in = list(map(int, input().split()))
q = int(input())
for i in range(q):
    bc = list(map(int, input().split()))
    for j in range(n):
        if list_in[j] == bc[0]:
            list_in[j] = bc[1]
    print(sum(list_in))
Problem p02659 (python)

Fixed submission:
def main():
    a,b = input().split()
    a = int(a)
    b = round(100*float(b))
    result = a*b//100
    print(result)

main()

Buggy submission (verdict: Runtime Error):
import math

def main():
    a,b = input().split()
    result = int(a)*int(b*100)
    print(int(math.floor(result/100)))

main()
Problem p02701 (python)

Fixed submission:
N = int(input())
S = list()
for i in range(N):
  S.append(input())
S1 = set(S)
print(len(S1))

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
while True:
	c-=b
	if c<=0:
		print("Yes")
		break
	a-=d
	if a<=0:
		print("No")
		break

Buggy submission (verdict: Runtime Error):
#include "bits/stdc++.h"
using namespace std;

int main(){
    int N;
    cin >> N;
    string S[N];
    for(int i=0;i<N;i++) cin >> S[i];
    int count = 0;
    for(int i=0;i<N;i++){
        if(S[i]!="0"){
            for(int j=i+1;j<N;j++){
                if(S[i]==S[j]) S[j]="0";
            }
        }
    }
    for(int i=0;i<N;i++){
        if(S[i]!="0") count++;
    }
    cout << count << endl;

}
Problem p02627 (python)

Fixed submission:
#A
x = input()
if x.isupper() ==True:
    print('A')
else:
    print('a')

Buggy submission (verdict: Runtime Error):
#C
N=int(input())
alp=list(a)
Name=[]
for i in reversed(range(11)):
    if N/(26**i) >=1:
        alp_index=N//(26**i)-1 if N//(26**(i-1))!=26 else 25
        Name.append(alp[alp_index])
    N=N%(26**i)
print(''.join(Name))
Problem p02622 (python)

Fixed submission:
S = input()
T = input()
 
count = 0
for (s,t) in zip(S,T):
  if s != t:
    count += 1
    
print(count)

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

count = 0
for (s,t) in map(S,T):
  if s != t:
    count += 1
print(count)
Problem p02624 (python)

Fixed submission:
N = int(input())
ans = 0
 
for i in range(1, N+1):
  Y = N // i
  ans += Y * (Y+1) * i / 2
  
print(int(ans))

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

for i in range(1, N+1):
  Y = N // j
  ans += Y * (Y+1) * j / 2
  
print(int(ans))
Problem p02693 (python)

Fixed submission:
K=int(input())
A,B = map(int, input().split())
count=0
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        count+=1
        break
if count==0:
    print("NG")

Buggy submission (verdict: Runtime Error):
import sys
K = int(sys.stdin.readline())
A, B = map(int,sys.stdin.readline().split() )
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "NG"

Buggy submission (verdict: Runtime Error):
K = int(sys.stdin.readline())
A, B = map(int,sys.stdin.readline().split() )
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "NG"

Buggy submission (verdict: Runtime Error):
K = int(sys.stdin.readline())
A, B = map(int, input().split())
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "NG"

Buggy submission (verdict: Runtime Error):
K=int(input())
A, B = map(int, input().split())
for i in range(A,B+1):
    if i%K==0:
        return "OK"
    return "NG"

Buggy submission (verdict: Runtime Error):
K=int(input())
inp=input().split(' ')
A=int(inp[0])
B=int(inp[1])
for i in range(A,B+1):
    if i%K==0:
        return "Yes"
    return "No"
Problem p02701 (python)

Fixed submission:
N=int(input())
S=[]
for i in range(N):
    a=input()
    S.append(a)
b=list(set(S))
print(len(b))

Buggy submission (verdict: Runtime Error):
N=int(input())
S=[]
for i in range(N):
    if input() not in S:
        S.append(input())
print(len(S))
Problem p02623 (python)

Fixed submission:
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

a, b = [0], [0]
for i in range(N):
  a.append(a[i] + A[i])
for i in range(M):
  b.append(b[i] + B[i])

ans, j = 0, M
for i in range(N + 1):
  if a[i] > K:
    break
  while b[j] > K - a[i]:
    j -= 1
  ans = max(ans, i + j)
print(ans)

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

a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])

ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
Problem p02688 (python)

Fixed submission:
N,K=map(int,input().split())
d=[]
a=[]
for i in range(K):
    d.append(int(input()))
    a.append(list(map(int,input().split())))
    
aa=[0]*N
counts=0

for k in a:
    for j in k:
        aa[j-1]+=1
        
for x in aa:
    if x==0:
        counts+=1

print(counts)

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
d=[]
a=[]
for i in range(K):
    d.append(int(input()))
    a.append(list(map(int,input().split())))
    
aa=[0]*N
counts=0

for k in K:
    for j in a[k]:
        aa[j-1]=1
        
for x in range(N+1):
    if aa[x-1]==0:
        counts+=1

print(counts)

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
d=[]
a=[]
for i in range(k):
    d.append(int(input()))
    a.append(list(map(int,input().split())))
    
aa=[0]*N
counts=0

for k in K:
    for j in a[k]:
        aa[j-1]=1
        
for x in range(N+1):
    if aa[x-1]==0:
        counts+=1

print(counts)
Problem p02711 (python)

Fixed submission:
N=input()
if '7' in N:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
N=input()
if '7' in S:
    print('Yes')
else:
    print('No')
Problem p02712 (python)

Fixed submission:
N=int(input())

ans=0
for i in range(1,N+1):
    if i%3!=0 and i%5!=0:
        ans+=i
print(ans)

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

ans=0
for i in range(1,N+1):
    if i%3!=0 and i%5!=0:
        ans+=i
    else:
        continue

print(ans)
Problem p03835 (python)

Fixed submission:
K,S=map(int,input().split())
ans=0
for x in range(K+1):
    for y in range(K+1):
            z=S-x-y
            if 0<=z<=K:
                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):
    for z in range(K+1):
      if x+y+z==S:
        ans+=1

print(ans)
Problem p02577 (python)

Fixed submission:
n = input()
r = 0
for i in n:
  r = r + int(i)
if r % 9 == 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n = input()
j = 10
r = 0
for i in range(200002):
  r = r + n%j
  j = j*10

if r%9==0:
  print("Yes")
else:
  print("No")
Problem p02629 (python)

Fixed submission:
N = int(input())
Ans = ""
while N>0:
    s = N%26
    if s == 0:
        s = 26
    N = int((N - s)/26)
    Ans = chr(ord("a")+s-1)+Ans

print(Ans)

Buggy submission (verdict: Runtime Error):
import string

N = int(input())

alf = {0:"a",1:"b",2:"c",3:"d",4:"e",5:"f",6:"g",7:"h",8:"i",9:"j",10:"k",11:"l",12:"m",13:"n",14:"o",15:"p",16:"q",17:"r",18:"s",19:"t",20:"u",21:"v",22:"w",23:"x",24:"y",25:"z"}

result=""
lis = []

while N>0:
    t = N%26
    lis += [t]
    N = int((N-t)/26)

for i in range(len(lis)):
    result = alf[lis[i]-1] + result

print(result)
Problem p02622 (python)

Fixed submission:
n=input()
nn=input()
c=0
for i in range(len(n)):
    if(n[i]!=nn[i]):
        c+=1
print(c)

Buggy submission (verdict: Runtime Error):
s=intput()
ss=intput()
c=0
for i in range(len(s)):
  if(s[i]!=ss[i]):
    c+=1
print(c)

Buggy submission (verdict: Runtime Error):
s=intput()
ss=intput()
for i range(len(s)):
  if(s[i]!=ss[i]):
    c+=1
print(c)
Problem p02829 (python)

Fixed submission:
A = int(input())
B = int(input())
 
print(6-A-B)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = 6 - a- b
print(c)
Problem p02836 (python)

Fixed submission:
S = input()
l = len(S)
c = 0
for i in range(l // 2):
  if S[i] == S[l-i-1]:
    pass
  else:
    c +=1
print(c)

Buggy submission (verdict: Runtime Error):
S = input()
l = len(S)
c = 0
for i in range(l // 2):
  if S[i] == S[l-i]:
    pass
  else:
    c +=1
print(c)

Buggy submission (verdict: Runtime Error):
S = input()
l = len(S)
c = 0
for i in range(l // 2):
  if S[i] == S[l-i]:
    c +=1
print(c)
Problem p03835 (python)

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

Buggy submission (verdict: Runtime Error):
k, s = input().split()
c = 0
for i range(k+1):
  x = i
  for j range(k+1):
  	y = j
    for h range(k+1):
      z = h
      sum = x + y + z
      if sum == k:
        c += 1
        
print(c)

Buggy submission (verdict: Runtime Error):
k, s = input()
c = 0
for i range(k+1):
  x = i
  for j range(k+1):
  	y = j
    for h range(k+1):
      z = h
      sum = x + y + z
      if sum == k:
        c += 1
        
print(c)