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

Fixed submission:
S = input()
N = len(S)
S2 = S[:((N - 1) // 2)]
S3 = S[((N + 1) // 2):]

S_rev1 = S[::-1]
S_rev2 = S2[::-1]
S_rev3 = S3[::-1]

if S == S_rev1 and S2 == S_rev2 and S3 == S_rev3 :
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s = input()
s1 = s[:(n - 2) / 2]
s2 = s[(n - 2) / 2:]

if s == s[:: -1] and s1 == s1[:: -1] amd s2 == s2[:: -1]:
    print('Yes')
else:
    print('No')
Problem p02791 (python)

Fixed submission:
n = int(input())
p = list(map(int, input().split()))
min = float('inf')
ans = 0

for i in p:
    if i <= min:
        min = i; ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
p = list(map(int, input().split()))
ans = 0
MIN = n + 1

for i in range(n):
    if MIN > p[i]:
        ans += 1
    MIN = min(MIH, p[i])

print(ans)
Problem p02801 (python)

Fixed submission:
c = input()

print(chr(ord(c) + 1))

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

print(chr(c + 1))
Problem p02802 (python)

Fixed submission:
n, m = map(int, input().split())
AC = [0] * n
WA = [0] * n
w = 0

for i in range(m):
    p, s = input().split()
    p = int(p) - 1
    if s == 'AC' and AC[p] == 0:
        AC[p] += 1
        w += WA[p]
    elif s == 'WA' and AC[p] == 0:
        WA[p] += 1

print(sum(AC), w)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
AC = [0] * n
WA = [0] * n

for i in range(m):
    p, s = input().split()
    p = int(p) - 1
    if s == 'AC' and a[p] == 0:
        AC[p] += 1
        w += W[p]
    elif s == 'WA' and a[p] == 0:
        WA[p] += 1

print(sum(a), w)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
AC = [0] * n
WA = [0] * n

for i in range(m):
    p, s = input().split()
    p = int(p) - 1
    if s == 'AC': and a[p] == 0:
        AC[p] += 1
        w += W[p]
    elif s == 'WA' and a[p] == 0:
        WA[p] += 1

print(sum(a), w)
Problem p02812 (python)

Fixed submission:
n = int(input())
s = input()
count = 0

for i in range(n - 2):
    if s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C':
        count += 1

print(count)

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

for i in range(n - 2):
    if s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C':
        count += 1
print(count)
Problem p02813 (python)

Fixed submission:
import itertools

n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
l = [i for i in range(1, n + 1)]
count = 0

if p == q:
    print(0)
    exit()
    
for i in itertools.permutations(l, n):
    count += 1
    if i == p:
        a = count
    elif i == q:
        b = count

print(max(a, b) - min(a, b))

Buggy submission (verdict: Runtime Error):
import itertools

n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
l = [i for i in range(1, n + 1)]
count = 0

for i in itertools.permutations(l, n):
    count += 1
    if i == p:
        a = count
    elif i == q:
        b = count

print(max(a, b) - min(a, b))
Problem p02848 (python)

Fixed submission:
n = int(input())
s = input()
l = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ') * 2
a = ''

for i in s:
    a += l[l.index(i) + n]

print(a)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
l = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ') * 2
a = ''

for i in s:
    a += l[l.index(i) + n]

pritn(a)
Problem p02887 (python)

Fixed submission:
n = int(input())
s = input()
count = 0

for i in range(n - 1):
    if s[i] != s[i + 1]:
        count += 1

print(count + 1)

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

for i in range(n - 1):
    if s[i] != s[i + 1]:
        count += 1

print(count)
Problem p02945 (python)

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

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(max(max((a + b), (a - b)), (a * b))
Problem p02969 (python)

Fixed submission:
r = int(input())
print(3 * r ** 2)

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

max_1st = max(a)
max_2nd = sorted(a)[-2]
for i in range(n):
    if a[i] == max_1st:
        print(max_2nd)
    else:
        print(max_1st)
Problem p03001 (python)

Fixed submission:
w, h, x, y = map(int, input().split())

s = w * h / 2
if w == 2 * x and h == 2 * y:
    print(s, 1)
else:
    print(s, 0)

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

judge = (w == 2 * x and h == 2 * y)
s = w * h / 2
print(area, 1 if judge else 0)
Problem p03436 (python)

Fixed submission:
from collections import deque

h, w = map(int, input().split())
s = [input() for _ in range(h)]

cnt = 0
for i in s:
    cnt += i.count('.')

queue = deque([[0, 0]])
visited = [[1] * w for _ in range(h)]
visited[0][0] = 0

def bfs():
    while len(queue) > 0:
        h1, w1 = queue.popleft()
        if h1 == h - 1 and w1 == w - 1:
            return visited[h1][w1]
        for k, l in ([1, 0], [-1, 0], [0, 1], [0, -1]):
            n_h, n_w = h1 + k, w1 + l
            if n_h < 0 or n_w < 0 or n_h >= h or n_w >= w:
                continue
            if visited[n_h][n_w] == 1 and s[n_h][n_w] == '.':
                queue.append([n_h, n_w])
                visited[n_h][n_w] += visited[h1][w1]
    return -1
    
bfs = bfs()
ans = 0
if bfs == -1:
    ans = -1
else:
    ans = cnt - bfs - 1
print(ans)

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

h, w = map(int, input().split())
s = np.array([list(input()) for _ in range(h)])
s = np.pad(s, 1, 'constant')
visited = np.zeros_like(s, dtype=np.bool)

judge = np.inf

q = []
hp.heappush(q, (0, 1, 1))

while h:
    cnt, y, x = hp.heappop(q)
    if y == h and x == w:
        judge = cnt
        break
    for dy, dx in [[0, 1], [1, 0], [-1, 0], [0, -1]]:
        ny, nx = y + dy, x + dx
        if s[ny, nx] == '.' and not visited[ny, nx]:
            visited[ny, nx] = True
            hp.heappush(q, (cnt + 1, ny, nx))

if judge == np.inf:
    print(-1)
else:
    print((s == '.').sum() - judge - 1)
Problem p02606 (python)

Fixed submission:

L, R ,d= map(int,input().split())
counter=0
for i in range(R+1-L):
  num = i+L
  if num%d == 0:
    counter+=1
print(counter)

Buggy submission (verdict: Runtime Error):
L, R, d= int(input().split())
counter=0
for i in range(R+1-L):
  num = i+L
  if num%d == 0:
    counter+=1
print(counter)

Buggy submission (verdict: Runtime Error):
L, R , d= int(input().split())

counter=0
for i in range(R-L):
  num = i+L
  if num%d:
    counter+=1
print(counter)

Buggy submission (verdict: Runtime Error):
L, R d = input().split()
counter=0
for i in range(R-L):
  num = i+L
  if num%d:
    counter+=1
print(counter)
Problem p02607 (python)

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

counter=0
for i in range(N):
  if (i+1)%2==1:
    if a[i]%2==1:
      counter+=1
print(counter)

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

counter=0
for i in range(N):
  print(a[i])

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

counter=0
for i in range(N):
  if (i+1)%2==1:
    if a[i]%2==1:
        counter+=1
print(counter)

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

counter=0
for i in range(N):
  if (i+1)%2==1:
    if a[i]%2==1:
      counter+=1
print(counter)
Problem p02606 (python)

Fixed submission:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s); sys.stdout.write('\n')
def wi(n): sys.stdout.write(str(n)); sys.stdout.write('\n')
def wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\n')


def main():
    l, r, d = ria()
    cnt = 0
    for x in range(l, r+1):
        if x % d == 0:
            cnt += 1
    wi(cnt)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s); sys.stdout.write('\n')
def wi(n): sys.stdout.write(str(n)); sys.stdout.write('\n')
def wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\n')


def main():
    n = ri()
    for nn in range(1, n+1):
        s = int(nn**0.5) + 2
        cnt = 0
        for x in range(1, s):
            for y in range(1, s):
                r1 = x*x + y*y + x*y
                if r1 > nn:
                    break
                for z in range(1, s):
                    r = x*x + y*y + z*z + x*y + y*z + z*x
                    if r > nn:
                        break
                    if r == nn:
                        cnt += 1
        wi(cnt)


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

Fixed submission:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s); sys.stdout.write('\n')
def wi(n): sys.stdout.write(str(n)); sys.stdout.write('\n')
def wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\n')


def solve(n):
    k = n // 1000
    if n % 1000 > 0:
        k += 1
    return k * 1000 - n


def main():
    n = ri()
    wi(solve(n))


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s); sys.stdout.write('\n')
def wi(n): sys.stdout.write(str(n)); sys.stdout.write('\n')
def wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\n')


MOD = 10**9 + 7


def solve(n, k, a):
    a = sorted(a, reverse=True, key=lambda x: (abs(x), 1 if x >= 0 else -1))
    sign = 1
    for i in range(k):
        if a[i] < 0:
            sign = -sign
        if a[i] == 0:
            sign = 0

    if sign == 0:
        return 0

    if sign == 1:
        ans = 1
        for i in range(k):
            ans = (ans * abs(a[i])) % MOD
        return ans

    if sign == -1:
        cc = []

        more_neg = -1
        for i in range(k, n):
            if a[i] < 0:
                more_neg = i
                break

        more_pos = -1
        for i in range(k, n):
            if a[i] > 0:
                more_pos = i
                break

        taken_neg = -1
        for i in range(k-1, -1, -1):
            if a[i] < 0:
                taken_neg = i
                break

        taken_pos = -1
        for i in range(k - 1, -1, -1):
            if a[i] > 0:
                taken_pos = i
                break

        if more_neg >= 0 and taken_pos >= 0:
            cc.append((taken_pos, more_neg))
        if more_pos >= 0 and taken_neg >= 0:
            cc.append((taken_neg, more_pos))
        if len(cc) == 2 and cc[0][1] * cc[1][0] < cc[1][1] * cc[0][0]:
            cc[0], cc[1] = cc[1], cc[0]

        # cc = sorted(cc, key=lambda x: abs(a[x[1]] / a[x[0]]), reverse=True)

        if len(cc) > 0:
            ans = 1
            for i in range(k):
                if i != cc[0][0]:
                    ans = (ans * a[i]) % MOD
            ans = (ans * a[cc[0][1]]) % MOD
            return ans
        else:
            # product is negative, taking smallest
            ans = 1
            for i in range(k):
                ans = (ans * a[n-i-1]) % MOD
            return ans


import random


def gen():
    for n in range(2, 100):
        for k in range(2, n):
            for t in range(100):
                a = [random.randrange(100) - 100 for _ in range(n)]
                solve(n, k, a)
        wi(n)


def main():
    # gen()
    # return
    n, k = ria()
    a = ria()
    wi(solve(n, k, a))


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

Fixed submission:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')


def main():
    a, v = ria()
    b, w = ria()
    t = ri()

    if a == b:
        ws('YES')
        return

    if v <= w:
        ws('NO')
        return

    tt = abs(b - a) / (v - w)
    if tt <= t:
        ws('YES')
    else:
        ws('NO')


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')


def main():
    a, v = ria()
    b, w = ria()
    t = ri()

    if a == b:
        ws('YES')

    if v > w and a != b:
        ws('NO')

    tt = (a - b) / (w - v)
    if tt <= t:
        ws('YES')
    else:
        ws('NO')


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

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

Buggy submission (verdict: Runtime Error):
a,b = mao(int,input().split())
print(a*b)
Problem p02606 (python)

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

top = b // c
if a%c == 0:
  bottom = a//c - 1
else:
  bottom = a//c

print(top-bottom)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())

top = b // c
if a%c == 0:
  bottom = a//c - 1
else:
  bottom = a//c

print(top-bottom)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())
c = int(input())

print(a//c - b//c)
Problem p02681 (python)

Fixed submission:
a=str(input())
b=str(input())
if a==b[0:-1]:
	print('Yes')
else:
	print('No')

Buggy submission (verdict: Runtime Error):
a,b,c,k=map(int,input().split())
B=0
if a+b>=k:
	print(a+(k-a)*b)
else:
	print((a+B)-1*(k-a-b))
Problem p02687 (python)

Fixed submission:
s=str(input())
if s[1]=='B':
	print('ARC')
else:
	print('ABC')

Buggy submission (verdict: Runtime Error):
s=str(input())
if s[1]==B:
	print('ARC')
else:
	print('ABC')
Problem p02812 (python)

Fixed submission:
n=int(input())
s=list(input())
count=0
for i in range(n-2):
  if s[i]== 'A':
    if (s[i+1]) =='B':
      if (s[i+2])=='C':
        count+=1
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=list(input())
count=0
for i in range(n):
  if s[i]== 'A':
    if (s[i+1]) =='B':
      if (s[i+2])=='C':
        count+=1
print(count)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=list(input())
count=0
for i in range(n):
  if s[i]== 'A':
    if (s[i+1]) =='B':
      if (s[i+2])=='C':
        count+=1
print(count)
Problem p03813 (python)

Fixed submission:
x = int(input())
if x < 1200:
    print('ABC')
else:
    print('ARC')

Buggy submission (verdict: Runtime Error):
a=int(input())
if x < 1200:
    print('ABC')
else:
    print('ARC')
Problem p03227 (python)

Fixed submission:
answer = input().strip()
if len(answer) == 2:
    print(answer)
else:
    print(answer[2] + answer[1] + answer[0])

Buggy submission (verdict: Runtime Error):
answer = raw_input()
if len(answer) == 2:
    print(answer)
else:
    print(answer[2] + answer[1] + answer[0])
Problem p02718 (python)

Fixed submission:
n, m = map(int, input().split())
in_list = input().split()
vote_list = [int(i) for i in in_list]

ans = 0
for ai in vote_list:
    if ai >= 1/(4*m)*sum(vote_list):
        ans += 1

if ans < m :
    print('No')
else:
    print('Yes')

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
in_list = input().split
vote_list = [int(i) for i in in_list]

ans = 0
for ai in vote_list:
    if ai >= 1/(4*m)*sum(vote_list):
        ans += 1

if ans < m :
    print('no')
else:
    print('yes')
Problem p02724 (python)

Fixed submission:
X = int(input())

syou = int(X/500)
syou_second = int((X - syou*500)/5)
ans = syou*1000 + syou_second*5
print(ans)

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

print(x//500 + x%500//5*5)
Problem p03455 (python)

Fixed submission:
in_list = input().split()
a = int(in_list[0])
b = int(in_list[1])

if a*b%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy submission (verdict: Runtime Error):
input_list = input().split(' ')
a = int(input_list[0])
b = int(input_list[0])

N = a*b

if N%2==0:
    print('Even')
else:
    print('Odd')

return 0

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())

if a*b%2 == 0:
    print("Even")
else:
    print("Odd")
Problem p03493 (python)

Fixed submission:

# ABC-081_A-Placing Marbles

in_list = list(input())
count = 0
# print("in_list:",in_list)
 
for string in in_list:
    if int(string)== 1:
        count += 1
print(count)

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

marker = True
count = 0

while(marker):
    for i in range(N):
        num = int(input[i])
        if num%2==1:
            marker = False
            count -= 1
            break;
        else:  
            input[i] = num/2 
    count += 1
print(count)
Problem p03139 (python)

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

minN = 0
maxN = 0

if (a + b < n):
    minN = 0
else:
    minN = (a + b) - n
maxN = min(a, b)
    
print(str(maxN) + " " + str(minN))

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

minN = 0
maxN = 0

if (a + b < n):
    minN = 0
else:
    minN = (a + b) - n
maxN = min(a, b)
    
print(str(maxN) + " " + str(minN))
Problem p02621 (python)

Fixed submission:
a = int(input())
 
print(a + a**2 + a**3)

Buggy submission (verdict: Runtime Error):
N, M, K= map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
t = 0
n = 0
a = 0
b = 0
 
while K > t :
    if a < N and b < M :
        if A[a] <= B[b] :
            t += A[a]
            n += 1
            a += 1
            if K < t :
                n -=1
                break
 
        else :
            t +=B[b]
            n += 1
            b += 1
            if K < t :
                n -=1
                break
    
    elif a == N :
        while b < M :
            t += B[b]
            n += 1
            b += 1
            if K < t :
                n -=1
                break
        
        else :
            break
 
    else :
        while a < N :
            t += A[a]
            n += 1
            a += 1
            if K < t :
                n -=1
                break
 
print(n)
Problem p02645 (python)

Fixed submission:
a = input()
nickname = a[0:3]
print(nickname)

Buggy submission (verdict: Runtime Error):
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())


def run():
	if A < B:
		c = (B + V*T) - (A + W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c = (B - V*T) - (A - W*T) 
		if c >= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())

Buggy submission (verdict: Runtime Error):
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())

print(A)
print(V)
print(B)
print(W)
print(T)

def run():
	if A < B:
		c = (B + V*T) - (A + W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c = (A - W*T) - (B - V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())

Buggy submission (verdict: Runtime Error):
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = P[1]
B = S[0]
W = S[1]
T = int(input())

def run():
	if A < B:
		c = (B + V*T) - (A + W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c = (A - W*T) - (B - V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())
Problem p02646 (python)

Fixed submission:
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())

def run():
	if A < B:
		c = (B + W*T) - (A + V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c =  (A - V*T) - (B - W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())

Buggy submission (verdict: Runtime Error):
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())

def run():
	if A < B:
		c = (B + W*T) - (A + V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c =  (A - V*T) - (B - W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
    else :
        return 'YES'
print(run())

Buggy submission (verdict: Runtime Error):
P = []
S = []
T = []
 for i in range(N):
    pp, ss, t  = map(int, input().split())
    P.append(pp)
    S.append(ss)
    T.append(t)

A = P[0]
V = P[1]
B = S[0]
W = S[1]
T = T[0]

def run():
    if A < B:
        c = (B + V*T) - (A + W*T)
        if c =< 0 :
            return 'YES'
        else :
            return 'NO'
    else:
        c =  (B - V*T) - (A - W*T)
            if c >= 0 :
                return 'YES'
            else :
                return 'NO'
Problem p02657 (python)

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

print(a*b)

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

print(a*b)
Problem p02675 (python)

Fixed submission:
a=input()

if int(a)%10 == 3:
	print("bon")
  
elif int(a)%10 == 0:
	print("pon")
    
elif int(a)%10 == 1:
	print("pon")

elif int(a)%10 == 6:
	print("pon")
    
elif int(a)%10 == 8:
	print("pon")    
    
else:
	print("hon")

Buggy submission (verdict: Runtime Error):
s = int(input())
t = input()

if len(t) <= s:
  print(t)
  
else :
  tt =  t[0:s]
  print(tt + "...")

Buggy submission (verdict: Runtime Error):
s = int(input())
t = input()

if len(t) <= s:
  print(t)
  
else :
  tt =  t[0:s]
  print(tt + "...")

Buggy submission (verdict: Runtime Error):
s = int(input())
t = input()

if len(t) < s:
  print(t)
  
else :
  tt =  t[0:s]
  print(tt + "...")

Buggy submission (verdict: Runtime Error):
if int(input())%10 == 3:
	print("bon")
  
elif int(input())%10 == 0 or int(input())%10 == 1 or int(input())%10 == 6 or int(input())%10 == 8:
	print("pon")
 
else:
	print("hon")

Buggy submission (verdict: Runtime Error):
if int(input())%10 == 3:
	print("bon")
  
elif int(input())%10 == 0 or1 or 6 or 8:
	print("pon")
 
else:
	print("hon")

Buggy submission (verdict: Runtime Error):
if int(input())%10 == 3:
	print("bon")
  
elif int(input())%10 == 0 or int(input())%10 == 1 or int(input())%10 == 6 or int(input())%10 == 8:
	print("pon")
 
else:
	print("hon")