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

Fixed submission:
ABC = [int(_) for _ in input().split()]

if sorted(ABC) == [5, 5, 7]:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
M = 10**9 + 7
L = 200000
 
Fm = {}
inverseFm = {}
x = 1
for i in range(L):
    Fm[i] = x
    x = x * (i + 1) % M
 
def inverseFm(x):
    result = pow(Fm[x], M - 2, M)
    return result
 
def C(n, r):
    result = Fm[n] * inverseFm(r) * inverseFm(n - r) % M
    return result
 
def solve(H, W, A, B):
    result = 0
    for i in range(B + 1, W + 1):
        result += C(i + H - A - 1 - 1, i - 1) * C(W - i + A - 1, W - i)
    return result % M
 
H, W, A, B = [int(_) for _ in input().split()]
 
print(solve(H, W, A, B))
Problem p02791 (python)

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
count = 1
min_p = p[0]

for i in range(n):
    if min_p > p[i]:
        count += 1
        min_p = p[i]

print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
p = list(map(int,input().split()))
count = 1
min_p = p[1]

for i in range(1,n):
    if min_p > p[i]:
        count += 1
        min_p = p[i]

print(count)

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

for i in range(n):
    if p[i] == min(p[0:i]):
        count += 1
        
print(count)
Problem p02801 (python)

Fixed submission:
a = input()
abc = 'abcdefghijklmnopqrstuvwxyz'

for i in range(26):
    if a == abc[i]:
        print(abc[i+1])
        break

Buggy submission (verdict: Runtime Error):
a = input()
abc = 'abcdefghijklmnopqrstuvwxyz'

for i in range(26):
    if a = abc[i]:
        print(abc[i+1])
        break
Problem p02812 (python)

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

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

print(count)

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

for i in range(len(s-2)):
    if s[i,i+2] == abc:
        count += 1

print(count)
Problem p02882 (python)

Fixed submission:
import numpy as np

a, b, x = map(int,input().split())
c = b-(x/a**2)
d = (a*b)/2

if c <= b/2:
    print(np.degrees(np.arctan2(c,a/2)))
    
else:
    print(np.degrees(np.arctan2(b,(x/d))))

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

a, b, x = map(int,input().split())
c = b-(x/a**2)
d = a*b

if c <= b//2:
    print(np.degrees(np.arctan2(b-(x / a**2),a/2)))

else:
    print(np.degrees(np.arctan2(x / d),b))
Problem p02994 (python)

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

t = [(l + i - 1) for i in range(1,n + 1)]

if t[0] >= 0:
    p = sum(t) - l
elif t[-1] > 0:
    p = sum(t)
else:
    p = sum(t) - t[-1]

print(p)

Buggy submission (verdict: Runtime Error):
n,l = map(int,input().split())
t = list(l + i - 1) for i in range(1,n)

if min(t) > 0:
    p = sum(t) - l
elif max(t) > 0:
    p = sum(t)
else:
    p = sum(t) - max(t)
print(p)
Problem p02999 (python)

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

Buggy submission (verdict: Runtime Error):
x,a = map(int,input().split())
if x >= a
    print(10)
else:
    print(0)
Problem p03324 (python)

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

if n == 100:
    a = 101
else:
    a = n

m = 100 ** d
print(a * m)

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

if n == 100:
    a = 99

m = 100 ** d
print(a * m)
Problem p03352 (python)

Fixed submission:
x = int(input())
a = [1]

for i in range(2,32):
    for j in range(2,11):
        if i ** j > x:
            break
        a.append(i ** j)
print(max(a))

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

for i in range(2,32):
    for j in range(10):
        if i ** j >= x:
            break
        a.add(i ** j)
print(max(a))
Problem p02675 (python)

Fixed submission:
n = input()
if (n[-1] == "2")or(n[-1] == "4")or(n[-1] == "5")or(n[-1] == "7")or(n[-1] == "9") :
    print("hon")
elif (n[-1] == "0")or(n[-1] == "1")or(n[-1] == "6")or(n[-1] == "8"):
    print("pon")
else:
    print("bon")

Buggy submission (verdict: Runtime Error):
n = input()
if n[-1] == ("2"or"4"or"5"or"7",or9") :
    print("hon")
elif n[-1] in("0"or"1"or"6"or"8"):
    print("pon")
else:
    print("bon")

Buggy submission (verdict: Runtime Error):
N = int(sys.argv[1])

dev_type = ""
if N%10==(2or4or5or7or9):
  dev_type = "hon"
elif if N%10==(0or1or6or8):
  dev_type = "pon"
else:
  dev_type = "hon"
  
print(dev_type)

Buggy submission (verdict: Runtime Error):
import sys

N = sys.argv[1]

dev_type = ""
  
if (N%10 == 2) or (N%10 == 4) or (N%10 == 5)or (N%10 == 7)or (N%10 == 9):
  dev_type == "hon"
elif (N%10 == 0) or (N%10 == 1) or (N%10 == 6)or (N%10 == 8):
  dev_type == "pon"
else:
  dev_type = "bon"

print(dev_type)
Problem p02677 (python)

Fixed submission:
import math
 
[a, b, h, m] = [int(x) for x in input().split(" ")]
short = ((h) * 60 + m) / (12 * 60) * 360
long = (m) / (60) * 360
theta = abs(long - short)
inte = math.cos(math.radians(theta))
print(math.sqrt(a ** 2 + b ** 2- 2*a * b * inte))

Buggy submission (verdict: Runtime Error):
import math
[a,b,h,m] = [int(x) for x in input().split(" ")]
short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = (abs(long-short)
inte = math.cos(math.radians(theta ))
print(math.sqrt(a**2+b**2+a*b*abs(inte)))

Buggy submission (verdict: Runtime Error):
import math
[a,b,h,m] = [int(x) for x in input().split(" ")]
short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(360-abs(short-long)))

print( math.sqrt(a*2+b*2+a*b*math.cos(math.radians(theta))))

Buggy submission (verdict: Runtime Error):
import math

[a,b,h,m] = [int(x) for x in input().split(" ")]

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(360-abs(short-long)))

print( math.sqrt (a*2+b*2+a*b*math.cos(math.radians(theta))))

Buggy submission (verdict: Runtime Error):
import math

[a,b,h,m] = [int(x) for x in input().split(" ")]

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(360-abs(short-long)))

print( math.sqrt (a*2+b*2+a*b*math.cos(theta)))

Buggy submission (verdict: Runtime Error):
import math

[a,b,h,m] = [int(x) for x in input().split(" ")]

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(360-abs(short-long)))

print(math.sqrt(a*2+b*2+a*b*math.cos(theta)))

Buggy submission (verdict: Runtime Error):

[a,b,h,m] = [int(x) for x in input().split(" ")]

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(short-long))

print(a*2+b*2+a*b*cos(theta))

Buggy submission (verdict: Runtime Error):
[a,b,h,m] = input().split(" ")

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(short-long))

print(a*2+b*2+a*b*cos(theta))

Buggy submission (verdict: Runtime Error):
[a,b,h,m] = input().split(" ")

short = (h*60+m)/(12*60)*360
long = (m)/(60)*360
theta = min(abs(long-short),abs(short-long))

print(4*2+3*2+12*cos(theta))
Problem p02675 (python)

Fixed submission:
N = int(input())

hon_list = [2,4,5,7,9]
pon_list = [0,1,6,8]
bon_list = [3]

if N%10 in hon_list:
    print('hon')
elif N%10 in pon_list:
    print('pon')
elif N%10 in bon_list:
    print('bon')

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

N,M = map(int,input().split())
A = [None]*M
B = [None]*M
for i in range(M):
    A[i],B[i] = map(int,input().split())

route_flag = [0]*(N+1)
route_flag[1] = 1
route = [None] * (N+1)
path_clear = 0


while path_clear < M:
    k = 0
    length = len(A)
    for i in range(length):
        if route_flag[A[i-k]] == 1 and route_flag[B[i-k]] == 0:
            route_flag[B[i-k]] = 1
            path_clear += 1
            route[B[i-k]] = A[i-k]
            del A[i-k]
            del B[i-k]
            k += 1
        elif route_flag[B[i-k]] == 1 and route_flag[A[i-k]] == 0:
            route_flag[A[i-k]] = 1
            path_clear += 1
            route[A[i-k]] = B[i-k]
            del A[i-k]
            del B[i-k]
            k += 1
        elif route_flag[A[i-k]] == 1 and route_flag[B[i-k]] == 1:
            del A[i-k]
            del B[i-k]
            path_clear += 1
            k += 1

    if k == 0:
            print('No')
            sys.exit()

route = route[2:]
print('Yes')
for i in range(len(route)):
    print(route[i])
Problem p02921 (python)

Fixed submission:
S = list(input())
T = list(input())
ans = 0

for i in range(3):
  if S[i] == T[i]:
    ans += 1

print(ans)

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

for i in range(3):
  if S[i] = T[i]:
    ans += 1

print(ans)
Problem p02945 (python)

Fixed submission:
data = list(map(int,input().split()))
add = data[0] + data[1]
sub = data[0] - data[1]
mul = data[0] * data[1]
result = [add,sub,mul]
ans = add
if sub > ans:
  ans = sub
if mul > ans:
  ans = mul
print(ans)

Buggy submission (verdict: Runtime Error):
data = list(map(int,input().sprit()))
add = data[0] + data[1]
sub = data[0] - data[1]
mul = data[0] * data[1]
result = [add,sub,mul]
ans = add
if sub > ans:
  ans = sub
if mul > ans:
  ans = mul
return ans
Problem p03448 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
X = int(input())

ans = 0

c500 = X // 500

if c500 > A:
    c500 = A

for i in range(c500 + 1):
    c100 = (X - i*500) // 100
    if c100 > B:
        c100 = B
    for j in range(c100 + 1):
        c50 = (X - i*500 - j*100) // 50
        if c50 <= C:
           ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())

ans = 0

c500 = X // 500

if c500 > A:
    print(ans)
    exit()

for i in range(c500 + 1):
    c100 = (X - i*500) / 100
    if c100 > B:
        continue
    for j in range(c100 + 1):
        c50 = (X - i*500 - j*100)/50
        if c50 <= C:
           ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())

ans = 0

c500 = X // 500

for i in range(c500 + 1):
    c100 = (X - i*500) / 100
    if c100 > B:
        continue
    for j in range(c100+1):
        c50 = (X - i*500 - j*100)/50
        if c50 <= C:
           ans += 1

print(ans)
Problem p03455 (python)

Fixed submission:
a,b = map(int, input().split())
c = a*b
if c % 2 == 1:
    print('Odd')
else:
    print('Even')

Buggy submission (verdict: Runtime Error):
a b = map(int, input().split())
c = a*b
if c % 2 == 1:
    print('Odd')
else:
    print('Even')
Problem p02675 (python)

Fixed submission:
x = int(input()[-1])

if x in [2,4,5,7,9]:
    print("hon")

elif x in [0,1,6,8]:
    print("pon")

else:
    print("bon")

Buggy submission (verdict: Runtime Error):
x = int()[-1]

if x == [2,4,5,7,9]:
    print("hon")

elif x == [0,1,6,8]:
    print("pon")

else:
    print("bon")

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

if x{-1} == [2,4,5,7,9]:
    print("hon")

elif x{-1} == [0,1,6,8]:
    print("pon")

else:
    print("bon")

Buggy submission (verdict: Runtime Error):
x =  int(input())[-1]

if x == [2,4,5,7,9]:
    print("hon")

elif x == [0,1,6,8]:
    print("pon")

else:
    print("bon")

Buggy submission (verdict: Runtime Error):
x =  int(input())[-1]
if x == [2,4,5,7,9]:
    print("hon")

elif x == [0,1,6,8]:
    print("pon")

else:
    print("bon")
Problem p02675 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input()[-1])

print("{0}".format("hon" if N in [2,4,5,7,9] else "pon" if N in [0, 1, 6, 8] else "bon"))

Buggy submission (verdict: Runtime Error):
import numpy as np
# -*- coding: utf-8 -*-
N = int(input())
X = np.zeros((N, 2))
for i in range(N):
    X[i,:] = list(map(int, input().split()))
print("{0}".format((((np.abs(X @ X.T))[np.triu_indices(N, 1)] > 0).sum() + N)% 1000000007) )
Problem p02675 (python)

Fixed submission:
N = input()
a = int(N[-1])

if a == 2 or a ==4or a ==7 or a == 9 or a ==5:
    print("hon")
if a == 0 or a ==1 or a==6 or a==8:
    print("pon")
if a == 3:
    print("bon")

Buggy submission (verdict: Runtime Error):
N = int(input())
if N[-1] == 2 or 4 or 5 or 7 or 9:
    print("hon")
elif N[-1] == 0 or 1 or 6 or 8:
    print("pon")
elif N[-1] == 3:
    print("bon")

Buggy submission (verdict: Runtime Error):

N = int(input())
if N[-1] == 2 or 4 or 5 or 7 or 9:
    print("hon")
if N[-1] == 0 or 1 or 6 or 8:
    print("pon")
if N[-1] == 3:
    print("bon")

Buggy submission (verdict: Runtime Error):
N = int(input())
if N[-1] == 2:
    print("hon")
if N[-1] == 4:
    print("hon")
if N[-1] == 5:
    print("hon")
if N[-1] == 7:
    print("hon")
if N[-1] == 9:
    print("hon")
if N[-1] == 0:
    print("pon")
if N[-1] == 1:
    print("pon")
if N[-1] == 6:
    print("pon")
if N[-1] == 8:
    print("pon")
if N[-1] == 3:
    print("bon")
Problem p02705 (python)

Fixed submission:
R = int(input())
print(2*3.141592*R)

Buggy submission (verdict: Runtime Error):
R = int(input())
print(2*pi*R)
Problem p02765 (python)

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

Buggy submission (verdict: Runtime Error):
n = int(input())
r = int(input())
if (n<10):
  print(100*(10-n)+r)
else:
   print(r)
Problem p02767 (python)

Fixed submission:
N = int(input())
X = list(map(int, input().split()))
M = round(sum(X)/N)
ans = 0
for i in X:
    ans+=(i-M)**2
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(inpit())
a = list(map(int,input().split()))
m = round(sum(a)/n)
x = 0
for i in a:
  x=+(i-m)**2
print(x)
Problem p02783 (python)

Fixed submission:
import math

H, A = [int(x) for x in input().split()]
print(math.ceil(H/A))

Buggy submission (verdict: Runtime Error):
import math
H = int(input())
A = int(input())
print(math.ceil(H/A))

Buggy submission (verdict: Runtime Error):
H = int(input())
A = int(input())
c = 0
while (H>0):
    H = H-A
    c = c+1
print(c)

Buggy submission (verdict: Runtime Error):
b = int(input())
a = int(input())
c = 0
while (b>0):
    b = b-a
    c = c+1
print(c)
Problem p02813 (python)

Fixed submission:
from itertools import permutations
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
# Find all possible
perm = list(permutations(range(1,N+1),N))
print(abs(perm.index(P)- perm.index(Q)))

Buggy submission (verdict: Runtime Error):
from itertools import math
N = int(input())
P = tuple(map(int(input().split())))
Q = tuple(map(int(input().split()))
# Find all possible and allow the length
perm = permutations((range(1,N+1)),N)
print(abs(perm.index(P)-perm.index(Q)))
Problem p02817 (python)

Fixed submission:
s = input().split()
print(s[1]+s[0])

Buggy submission (verdict: Runtime Error):
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String a = s.nextLine();
        String b = s.nextLine();
        String c = b.concat(a);
        System.out.println(c);
    }
}
Problem p02885 (python)

Fixed submission:
a,b=map(int,input().split())
c=a-b*2
if 0>c:
    print(0)
else:
    print(c)

Buggy submission (verdict: Runtime Error):
n=input()
a,b,c=map(int,input().split())
Problem p02981 (python)

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

d=a*n
if d>b:
    print(b)
else:
    print(d)

Buggy submission (verdict: Runtime Error):
l,r=map(int,input().split())
s=list()
if l+1==r:
    print(l*r)
else:
    for i in range(l,r):
        s.append([i*(i+1)%2019])
    #print(s[0][0])
    s=(sorted(s))
    print(s[0][0])
Problem p02988 (python)

Fixed submission:
n=int(input())
p=list(map(int,input().split()))
#print(n)
#print(p)
a=0
i=1

for i in range(1,n-1):

    if (p[i-1]<p[i]<p[i+1]) or (p[i+1]<p[i]<p[i-1]):
        a=1+a
print(a)
    #sumir=vie(i)+sumir
#print("")
#print(sumir)

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

for i in range(1,n-1):

    if (p[i-1]<p[i]<p[i+1]) or (p[i+1]<p[i]<p[i-1]):
        a=1+a
print(a)
Problem p03029 (python)

Fixed submission:
a, p = map(int, input().split())
#print (int((a*3 + p) / 2))
#a,p=map(int,input().split())↲
print(int((a*3+p)/2))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
d=0
c=a*3
if c>=1:
  d=(c+b)//2
elif c==0 and b>1:
  d=b//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
d=0
c=a*3
if c>1:
    d=(c+b)//2
elif c==0 and b>1:
    d=b//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,p=map(int,input().split())↲
print(int((a*3+p)/2))

Buggy submission (verdict: Runtime Error):
a,p=map(int,input().split())↲
c=(a*3+p)//2
print(int(c))

Buggy submission (verdict: Runtime Error):
a,p=map(int,input().split())↲
c=(a*3+p)//2
print(c)

Buggy submission (verdict: Runtime Error):
A,P=map(int,input().split())↲
N=0↲
a=A*3↲
if a>1:
  N=(a+P)//2
elif a==0 and P>1:
  N=P//2
print(N)

Buggy submission (verdict: Runtime Error):
A,P=map(int,input().split())↲
d=0
c=A*3
if c>1:
  d=(c+P)//2
elif c==0 and P>1:
  d=P//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
d=0
c=a*3
if c>1:
  d=(c+b)//2
elif c==0 and b>1:
  d=b//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
d=0
c=a*3
if c>1:
  d=(c+b)//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
d=0
c=a*3
if b>1:
  d=(c+b)//2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())↲
c=a*3
d=c+d/2
print(d)↲

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())↲
c=a*3
d=c+d/2

print(d)↲
Problem p03035 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int, input().split())
if a<=5:
    b=0
elif 6<=a<=12:
    b=b/2
  
 print(int(b))

Buggy submission (verdict: Runtime Error):
a,b=map(int, input().split())
if a<=5:
  b=0
elif 6<=a<=12:
  b=b/2
  
 print(int(b))

Buggy submission (verdict: Runtime Error):
a,b=map(int, input().split())
if a<=5:
  b=0
elif 6<=a<=12:
  b=b/2
  
 print(b)
Problem p02675 (python)

Fixed submission:
i = int(input())
if i % 10 == 3:
  print("bon")
elif i % 10 == 0 or i % 10 ==1 or i % 10 == 6 or i % 10 ==8:
  print("pon")
else:
  print("hon")

Buggy submission (verdict: Runtime Error):
import math
a,b,h,m = map(int,input().split())
x = 6 * m - 15 * h
k = math.cos(math.radians(x))
c = a ** 2 + b ** 2 - 2 * a * b * k
print(math.sqrt(c))
Problem p02687 (python)

Fixed submission:
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Buggy submission (verdict: Runtime Error):
S = import()
if S == ABC:
  print("ARC")
else:
  print("ABC")
Problem p02675 (python)

Fixed submission:
a = []
a = input()
f = len(a)






if a[f-1] == "3":
  print("bon")
elif a[f-1] == "0" or a[f-1] == "6" or a[f-1] == "1" or a[f-1] == "8":
  print("pon")
else:
  print("hon")

Buggy submission (verdict: Runtime Error):
a = []
a = input()
f = len(a)



print(a[3])


if a[f-1] == "3":
  print("bon")
elif a[f-1] == "0" or a[f-1] == "6" or a[f-1] == "1" or a[f-1] == "8":
  print("pon")
else:
  print("hon")
Problem p02681 (python)

Fixed submission:
import re

s = input()
t = input()

def check(s, t):
    p = re.compile('[a-z]+')
    if not p.match(s) or not p.match(t):
        return 'No'
    if len(s) < 1 or len(s) > 10:
        return 'No'
    if len(s) + 1 != len(t):
        return 'No'
    if t[0:len(s)] != s:
        return 'No'
    return 'Yes'

print(check(s, t))

Buggy submission (verdict: Runtime Error):
def get_int(s, si, ei=None):
    #print(f'get_int: s={s}, si={si}, ei={ei}')
    if ei is None:
        value = int(s[si:])
    else:
        value =  int(s[si:ei])
    #print(f'value={value}')
    return value


BIT = 1

str_s = input()
s = int(str_s)
slen = len(str_s)

result = 0
for i in range(2 ** (slen - 1) ):
    #print(f'======= i={bin(i)} ========')
    s_index = 0
    for k in range(slen - 1):
        bit = (i >> k) & BIT        
        if bit == 0:
            continue
        e_index = k + 1
        value = get_int(str_s, s_index, e_index)
        result += value
        s_index = e_index
    value = get_int(str_s, s_index)
    result += value

print(result)
Problem p02681 (python)

Fixed submission:
S = input()
T = input()
 
ans = "No"
if len(S)+1 == len(T):
  if T.startswith(S) is True:
    ans = "Yes"
print(ans)

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

ans = "No"
if len(S)+1 == len(T):
	if T.startswith(S) is True:
      ans = "Yes"
print(ans)
Problem p02694 (python)

Fixed submission:
x = int(input())
year = 0
yen = 100

while x>yen:
  yen = int(yen*1.01)
  year+=1

print(year)

Buggy submission (verdict: Runtime Error):
x = int(input())
year = 0
yen = 100
while x > yen:
  yen = int(yen*1.01)
  year+=
  
print(year)
Problem p02717 (python)

Fixed submission:
x,y,z=map(int,input().split())
v=0

v=x
x=y
y=v

v=x
x=z
z=v
print(x,y,z)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input())
N=n
x=0
z=m
for i in range(100):
    x=N-z
    x=abs(x)
    z=x*z
    N=min(N,x,n)

print(N)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=list(map(int,input().split()))
 
toku = sum(a) // (4*m)
 
a.sort(reverse=True)
if a[m-1] >= toku:
  print("Yes")
  else:
  print("No")

Buggy submission (verdict: Runtime Error):
x,y,z=int(input())
v=0

v=x
x=y
y=v

v=x
x=z
z=v
print(x,y,z)
Problem p02718 (python)

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

toku = sum(a) / (4 * m)
a=sorted(a,reverse=True)
    
if a[m-1] >= toku:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=list(map(int,input().split()))
 
toku = sum(a) // (4*m)
 
a.sort(reverse=True)
if a[m-1] >= toku:
  print("Yes")
  else:
  print("No")

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

toku = sum(a) // (4*m)

a.sort(reverse=True)
if a[m-1] >= toku:
  print("Yes")
  else:
  print("No")
Problem p02724 (python)

Fixed submission:
x = int(input())
fh = x // 500
f = (x - (500*fh)) // 5
sum = f*5+fh*1000
print(sum)

Buggy submission (verdict: Runtime Error):
X = int(input())
fh = x // 500
f = (x - (500*fh)) // 5
pint(f*5+fh*1000)

Buggy submission (verdict: Runtime Error):
X = int(input())
fh = x // 500
f = (x - (500*fh)) // 5
pint(f*1000+fh*5)

Buggy submission (verdict: Runtime Error):
X = int(input())
fh = x // 500
f = (x - (500*fh)) // 5
pint(f+fh)

Buggy submission (verdict: Runtime Error):
X = int(input())
fh = x // 500
f = x - 2*fh // 5
pint(f+fh)
Problem p02765 (python)

Fixed submission:
from sys import stdin

n,r=map(int,input().split())

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)

Buggy submission (verdict: Runtime Error):
from sys import stdin
n,k=map(int,input().split())
c=0
while n > 0:
    c += 1
    n//=k
print(c)

Buggy submission (verdict: Runtime Error):
from sys import stdin
n,k=list(map(int,input().split()))
c=0
while n > 0:
    c += 1
    n//=k
print(c)

Buggy submission (verdict: Runtime Error):
from sys import stdin
n,k=list(map(int,input().split()))
c=1
while True:
    n//=k
    if n == 0
        break
    else:
        c+=1

print(c)

Buggy submission (verdict: Runtime Error):
from sys import stdin

n = input()
r = input()

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)

Buggy submission (verdict: Runtime Error):
from sys import stdin

n = int(input())
r = int(input())

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)

Buggy submission (verdict: Runtime Error):
from sys import stdin

n = int(input())
r = int(input())

if n < 11:
    a = r + 100 * (10-n)
else:
    a = r

print(a)

Buggy submission (verdict: Runtime Error):
from sys import stdin

n = int(input())
r = int(input())

if n < 11:
    a = r + 100 * (10-n)
else:
    a = r

print(n)

Buggy submission (verdict: Runtime Error):
from sys import stdin

n = int(input())
r = int(input())

if n < 11:
    a = r - 100 * (10-n)
else:
    a = r

print(n)
Problem p02789 (python)

Fixed submission:
from sys import stdin
n,m=map(int,input().split())
if m >= n:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
from sys import stdin
if m >= n:
    print("Yes")
else:
    print("No")