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

Fixed submission:
import sys
N = int(input())
H = [int(x) for x in input().split()]

flag = 0
key = 0

for i in range(len(H)-1):
    if flag == 1:
        if H[i+1] < key:
            print('No')
            sys.exit()

    if i < len(H) - 1:
        if H[i] > H[i+1] + 1:
            print('No')
            sys.exit()

        elif H[i] == H[i+1] + 1:
            flag = 1
            key = H[i+1]
	
print('Yes')

Buggy submission (verdict: Runtime Error):
File Edit Options Buffers Tools Python YASnippet Help                               
import sys

N = int(input())
H = [int(x) for x in input().split()]

flag = 0

for i in range(len(H) - 1):
    if H[i] > H[i+1] + 1:
        print('No')
        sys.exit()

    elif H[i] == H[i+1] + 1:
        if flag == 0:
            flag = 1
            continue
        else:
            print('No')
            sys.exit()

    if flag == 1:
        if H[i] > H[i+1]:
            print('No')
            sys.exit()
        else:
            flag = 0

print('Yes')

Buggy submission (verdict: Runtime Error):
import sys

N = int(input())
H = [int(x) for x in input().split()]

flag = 0

for i in range(len(H) - 1):
    if H[i] > H[i+1] + 1:
        print('No')
        sys.exit()
	
    elif H[i] == H[i+1] + 1:
	flag = 1
	
    if flag == 1:
        if H[i]	> H[i+1]:
            print('No')
            sys.exit()

print('Yes')

Buggy submission (verdict: Runtime Error):
import sys

N = int(input())
H = [int(x) for x in input().split()]

flag = 0

for i in range(len(H) - 1):
    if H[i] > H[i+1] + 1:
        print('No')
        sys.exit()
	
    elif H[i] = H[i+1] + 1:
	flag = 1
	
    if flag == 1:
        if H[i]	> H[i+1]:
            print('No')
            sys.exit()

print('Yes')
Problem p02993 (python)

Fixed submission:
import sys
s = input()

for i in range(3):                                                                                                                                                                                          
    if s[i] == s[i+1]:                                                                                                                                                                                      
        print('Bad')                                                                                                                                                                                        
        sys.exit()                                                                                                                                                                                          
print('Good')

Buggy submission (verdict: Runtime Error):
import fractions
A, B, C, D = (int(x) for x in input().split())

C_ = int(B/C) - int(A/C)
if A%C == 0:                                                                                                                                                                                                
    C_ += 1                                                                                                                                                                                                 
D_ = int(B/D) - int(A/D)
if A % D == 0:                                                                                                                                                                                              
    D_ += 1                                                                                                                                                                                                 

E = C * D / fractions.gcd(C, D)
E_ = int(B/E) - int(A/E)

ans = B - A + 1 - C_ - D_ + E_
print(ans)
Problem p02995 (python)

Fixed submission:
import fractions
A, B, C, D = (int(x) for x in input().split())

C_ = int(B//C) - int((A-1)//C)
D_ = int(B//D) - int((A-1)//D)

E = int(C * D // int(fractions.gcd(C, D)))
E_ = int(B//E) - int((A-1)//E)

ans = B - A + 1 - C_ - D_ + E_
print(ans)

Buggy submission (verdict: Runtime Error):
import fractions
A, B, C, D = (int(x) for x in input().split())

C_ = int(B//C) - int((A-1)//C)
D_ = int(B//D) - int((A-1)//D)

E = int(C * D // int(fractions.gcd(C, D)))
E_ = int(B//E) - int((A_1)//E)

ans = B - A + 1 - C_ - D_ + E_
print(ans)

Buggy submission (verdict: Runtime Error):
import math
A, B, C, D = (int(x) for x in input().split())

C_ = int(B/C) - int(A/C)
if A%C == 0:                                                                                                                                                                                                
    C_ += 1                                                                                                                                                                                                 
D_ = int(B/D) - int(A/D)
if A % D == 0:                                                                                                                                                                                              
    D_ += 1                                                                                                                                                                                                 

E = C * D / math.gcd(C, D)
E_ = int(B/E) - int(A/E)

ans = B - A + 1 - C_ - D_ + E_
print(ans)
Problem p03048 (python)

Fixed submission:
R, B, G, N = (int(x) for x in input().split())
a = [R, B, G]
a = sorted(a)
b = a[2]
d = a[1]
f = a[0]
c = int(N / b)

count = 0

for i in range(c + 1):
    n = N - b * i
    e = int(n / d)
    for j in range(e + 1):
        m = n - d * j
        if m % a[0] == 0:
            count += 1

print(count)

Buggy submission (verdict: Runtime Error):
import numpy as np
R, B, G, N = (int(x) for x in input().split())
a = np.array([R, B, G])
a = np.sort(a)
b = a[2]
d = a[1]
f = a[0]
c = int(N / b)

count = 0

for i in range(c + 1):
    n = N - b * i
    e = int(n / d)
    for j in range(e + 1):
        m = n - d * j
        if m % a[0] == 0:
            count += 1

print(count)
Problem p03095 (python)

Fixed submission:
from collections import Counter
N = int(input())
S = input()
answer = 1
counter = Counter(S).most_common()

for i in range(len(counter)):
    answer = answer * (counter[i][1] + 1) % (10**9 + 7)

print(answer-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = list(input())  # len:N

S = sorted(S)  #  アルファベット順に並べ替え
U = [0] * 26  #  ユニーク数数え上げ
tmp = "0"
count = 0
u_count = 0
for i in range(N):
    if i > 0:
        if tmp == S[i]:
            U[count] += 1
        else:
            tmp = S[i]
            count += 1
            U[count] += 1
    else:
        tmp = S[i]
        U[count] += 1


for u in range(26):
    if U[u] != 0:
        u_count += 1


for i in range(len(U)):
    if U[0] == 0:
        U.pop(0)

U = list(map(lambda x:x+1, U))
print(np.array(U).prod()-1)

Buggy submission (verdict: Runtime Error):
import itertools
import numpy as np
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)

N = int(input())
S = list(input())  # len:N

S = sorted(S)  #  アルファベット順に並べ替え
U = [0] * 26  #  ユニーク数数え上げ
tmp = "0"
count = 0
u_count = 0
for i in range(N):
    if i > 0:
        if tmp == S[i]:
            U[count] += 1
        else:
            tmp = S[i]
            count += 1
            U[count] += 1
    else:
        tmp = S[i]
        U[count] += 1


for u in range(26):
    if U[u] != 0:
        u_count += 1

U = sorted(U)

for i in range(len(U)):
    if U[0] == 0:
        U.pop(0)

count = 0

for i in range(1, u_count+1):
    count += np.sum(np.array((map(prod, list(itertools.combinations(U, i))))))

a = 10 ** 9 + 7
print(count % a)
Problem p03105 (python)

Fixed submission:
A, B, C = (int(x) for x in input().split())

count = int(B/A)
if count <= C:
    print(count)
else:
    print(C)

Buggy submission (verdict: Runtime Error):
def main120():
    import sys
    S_org = input()
    S = []

    for s in range(len(S_org)):
        S.append(S_org[s])
    S = list(map(int, S))

    cont = True
    index = 0
    count = 0

    if len(S) == 1:
        print(0)
        sys.exit()

    else:
        while(cont):
            print(index)
            if S[index] == S[index+1]:
                index += 1
            else:
                count += 2
                S.pop(index)
                S.pop(index)
                if index > 0:
                    index -= 1

            if index == len(S) - 2:
                if S[index] != S[index+1]:
                    count += 2
                print(count)
                sys.exit()


main120()
Problem p03206 (python)

Fixed submission:
day = int(input())

difference = int(25 - day)

if difference > 0:
    answer = "Christmas " + "Eve " * (difference - 1) + "Eve"
else:
    answer = "Christmas"

print(answer)

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

N = int(input())
price = []

for i in range(N):
    price.append(int(input()))
    
price = np.array(price)
max_index = np.argmax(price)

print(int(np.sum(price) - price[max_index] / 2))

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

N = int(input())
price = []

for i in range(N):
    price.append(int(input()))

price = np.array(price)
max_index = np.argmax(price)

print(int(np.sum(price) - price[max_index] / 2))
Problem p03211 (python)

Fixed submission:
S=input()
print(min(abs(int(S[i:i+3])-753) for i in range(len(S)-2)))

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

    S = input()
    answer = 0

    digit1 = []
    digit2 = []
    digit3 = []

    for i in range(len(S)):
        digit1.append(abs(7 - int(S[i])))
        digit2.append(abs(5 - int(S[i])))
        digit3.append(abs(3 - int(S[i])))

    first = [i for i, x in enumerate(digit1) if x == min(digit1) and i < len(digit1) - 2]

    if len(first) == 1:
        answer = int(S[first[0]]) * 100 + int(S[first[0] + 1]) * 10 + int(S[first[0] + 2])

    else:
        digit2_new = []
        for i in range(len(first)):
            digit2_new.append(digit2[first[i] + 1])

        second = [i for i, x in enumerate(digit2) if x == min(digit2_new) and i < len(digit2) - 1]
        if len(second) == 1:
            answer = int(S[first[0]]) * 100 + int(S[second[0]]) * 10 + int(S[second[0] + 1])
        else:
            digit3_new = []
            for i in range(len(second)):
                digit3_new.append(digit3[second[i] + 1])

            third = [i for i, x in enumerate(digit3) if x == min(digit3_new) and i < len(digit3)]
            answer = int(S[first[0]]) * 100 + int(S[second[0]]) * 10 + int(S[third[0]])

    answer = abs(753 - answer)
    print(answer)


main114()
Problem p03231 (python)

Fixed submission:
def main28():
    import sys
    N, M = (int(x) for x in input().split())

    if N >= M:
        S = input()
        T = input()
    else:
        T = input()
        S = input()

    def lcm(n, m):
        gcd = 0
        for i in range(1, min(n, m) + 1):
            if n % i == 0 and m % i == 0:
                gcd = i

        return int(n * m / gcd)

    LCM = lcm(N, M)

    a = int(LCM / max(N, M))
    b = int(LCM / min(N, M))

    for i in range(min(N, M)):
        small_index = i * b
        if int(small_index % a) == 0:
            if S[int(small_index / a)] != T[i]:
                print("-1")
                sys.exit()
    print(LCM)

main28()

Buggy submission (verdict: Runtime Error):
def main28():
    import sys
    N, M = (int(x) for x in input().split())

    if N >= M:
        S = input()
        T = input()
    else:
        T = input()
        S = input()

    def lcm(n, m):
        gcd = 0
        for i in range(1, min(n, m)):
            if n % i == 0 and m % i == 0:
                gcd = i

        return int(n * m / gcd)

    LCM = lcm(N, M)
    a = int(LCM / max(N, M))
    b = int(LCM / min(N, M))

    for i in range(min(N, M)):
        small_index = i * b
        if int(small_index % a) == 0:
            if S[int(small_index / a)] != T[i]:
                print("-1")
                sys.exit()
    print(LCM)

main28()

Buggy submission (verdict: Runtime Error):
def main28():
    import sys
    N, M = (int(x) for x in input().split())

    if N >= M:
        S = input()
        T = input()
    else:
        T = input()
        S = input()

    def lcm(n, m):
        gcd = 0
        for i in range(1, min(n, m)):
            if n % i == 0 and m % i == 0:
                gcd = i

        return int(n * m / gcd)

    LCM = lcm(N, M)
    a = int(LCM / max(N, M))
    b = int(LCM / min(N, M))

    for i in range(b):
        small_index = i * b
        if small_index % a == 0 and S[int(small_index / a)] != T[i]:
            print("-1")
            sys.exit()
    print(LCM)

main28()
Problem p02705 (python)

Fixed submission:
import math
r = int(input())
print(2*math.pi*r)

Buggy submission (verdict: Runtime Error):
r=int(input(半径 R の円の周長を出力してください。:))
result=2*double(r)*3.14
print(result)
Problem p02705 (python)

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

Buggy submission (verdict: Runtime Error):
import math
r = input()
circ = 2 * math.pi * r
print(circ)

Buggy submission (verdict: Runtime Error):
circumference = 2 * math.pi * input()
print(circumference)

Buggy submission (verdict: Runtime Error):
import math
r = input()
print(f"{math.pi * r ** 2}"}
Problem p02741 (python)

Fixed submission:
x = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(x[int(input())-1])

Buggy submission (verdict: Runtime Error):
from math import sqrt
v = list(map(int, input().split()))
if (v[0]+v[1]) < v[2]:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
x = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(x[int(input())])
Problem p02741 (python)

Fixed submission:
length = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

K = int(input())


print(length[K-1])

Buggy submission (verdict: Runtime Error):
length = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

K = int(input())


print(length[K])
Problem p02900 (python)

Fixed submission:
import fractions
import collections

def fact(n):
    c = []
    while n % 2 == 0:
        c.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            c.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        c.append(n)
    return c

a, b = map(int, input().split())
g = fractions.gcd(a, b)
c = collections.Counter(fact(g))

print(len(c)+1)

Buggy submission (verdict: Runtime Error):
import math
import collections

def fact(n):
    c = []
    while n % 2 == 0:
        c.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            c.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        c.append(n)
    return c

a, b = map(int, input().split())
g = math.gcd(a, b)
c = collections.Counter(fact(g))

print(len(c)+1)
Problem p02718 (python)

Fixed submission:
n, m = map(int, input().split())
ai = list(map(int, input().split()))
required = sum(ai) / (4 * m)
count = 0
for a in sorted(ai, reverse=True):
    if a >= required:
        count += 1
    else:
        break
print("YNeos"[count < m::2])

Buggy submission (verdict: Runtime Error):
b, c = map(int, input().split())
a = list(map(int, input().split()))
d = sum(a)
new_a = list(reversed(sorted(a)))
e = 0
f = 0
g = 4*c
while new_a[e] >= d/g:
    e = e+1
    if e == n:
        break
    f = f+1
if f >= c:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
b, c = map(int, input().split())
a = list(map(int, input().split()))
d = sum(a)
new_a = list(reversed(sorted(a)))
e = 0
f = 0
g = 4*c
while new_a[e] >= d/g:
    e = e+1
    f = f+1
if f >= c:
    print("Yes")
else:
    print("No")
Problem p02817 (python)

Fixed submission:
print("".join(input().split()[::-1]))

Buggy submission (verdict: Runtime Error):
print(input()+input())
Problem p03087 (python)

Fixed submission:
n, q = map(int, input().split())
s = input()
appmap = [0] * (n + 1)
for i in range(n):
    appmap[i + 1] = appmap[i] + (1 if s[i: i + 2] == "AC" else 0)
for i in range(q):
    l, r = map(int, input().split())
    print(appmap[r - 1] - appmap[l - 1])

Buggy submission (verdict: Runtime Error):
n, q = map(int, input().split())
s = input()
ans = []
for i in range(3):
    l, r = map(int, input().split())
    ans.append(s[l - 1: r].replace("AC", "*").count("*"))
print(*ans, sep="\n")
Problem p03155 (python)

Fixed submission:
n, x, y = [int(input()) for _ in range(3)]
print((n - x + 1) * (n - y + 1))

Buggy submission (verdict: Runtime Error):
n, x, y = map(int, input().split())
print((n - x + 1) * (n - y + 1))
Problem p03238 (python)

Fixed submission:
n = int(input())
print("Hello World" if n == 1 else sum([int(input()) for i in range(0, 2)]))

Buggy submission (verdict: Runtime Error):
d = [int(input()) for i in range(0, 3)]
print("Hello World" if d[0] == 1 else sum(d[1:]))
Problem p03644 (python)

Fixed submission:
print(1 << len(bin(int(input()))) - 3)

Buggy submission (verdict: Runtime Error):
import java.util.Scanner;

class Main{
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        scan.close();
        System.out.println(0b1 << Integer.toBinaryString(N).length() - 1);
    }
}
Problem p02981 (python)

Fixed submission:
n,a,b=map(int,raw_input().split())
print(min(n*a,b))

Buggy submission (verdict: Runtime Error):
l,r=map(int,raw_input().split())
if l<2019 and r<2019:
  print(((l%2019)*(r%2019))%2019)
else:
  if (r-l)>=2019:
    print('0')
  else:
  	print(((l%2019)*((l+1)%2019))%2019)
Problem p02709 (python)

Fixed submission:
N = int(input())
A = [int(s) for s in input().split(" ")]
ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True)
prev = [0]
for k, (a,i) in enumerate(ABI):
  curr = [0]*(k+2)
  for l in range(k+1):
    curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a)
    curr[l+1] = prev[l]+abs(i-l-1)*a
    
  prev = curr
 
print(max(prev))

Buggy submission (verdict: Runtime Error):
N = int(input())
 
ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True)
prev = [0]
for k, (a,i) in enumerate(ABI):
  curr = [0]*(k+2)
  for l in range(k+1):
    curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a)
    curr[l+1] = prev[l]+abs(i-l-1)*a
    
  prev = curr
 
print(max(prev))

Buggy submission (verdict: Runtime Error):
N = int(input())
 
A = [int(s) for s in input().split(" ")]
ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True)
prev = [0]
for k, (a,i) in enumerate(ABI):
  curr = [0]*(k+2)
  for l in range(k+1):
    curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a)
    curr[l+1] = prev[l]+abs(i-l-1)*a
    print(curr,k,i)
  prev = curr
 
print(max(prev))
Problem p03059 (python)

Fixed submission:
a,b,t = map(int, (input()).split(" "))
n = t//a
print("{}".format(n*b,'d'))

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

N = int(input())
A = np.array([int(i) for i in (input()).split(" ")])
maxA = np.max(A)

if(maxA == np.min(A)):
    print(maxA)
else:
    check = np.unique(maxA // np.arange(1,maxA))
    #check = minA // np.arange(1,minA)
    for i in check[::-1]:
        #全てのAに対してiで割り切れるか＝最大公約数
        #iで割り切れた数＝len(A)-1なら，残りの数にiをかけて最大公約数に出来る．
        num = np.sum((A % i>0))
        if(num < 2):
            print(i)
            break

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

N = int(input())
A = np.array([int(i) for i in (input()).split(" ")])
minA = np.min(A)

if(minA == np.max(A)):
    print(minA)
else:
    check = np.unique(minA // np.arange(1,minA))
    #check = minA // np.arange(1,minA)
    for i in check[::-1]:
        #全てのAに対してiで割り切れるか＝最大公約数
        #iで割り切れた数＝len(A)-1なら，残りの数にiをかけて最大公約数に出来る．
        num = np.sum((A % i>0))
        if(num < 2):
            j = A[np.where(A % i>0)][0]
            #print(i,j,i*j//math.gcd(i,j))
            if(i*j//math.gcd(i,j) < 10**9):
                print(i)
                break
Problem p02791 (python)

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

counter=0
mj=N
for i in range(N):
  if mj>List[i]:
    mj=List[i]
  if List[i]==mj:
    counter+=1
print(counter)

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

counter=0
for i in range(N):
  Pj_list=[]
  for j in range(i):
    Pj=List[j]
    Pj_list.append(Pj)
  Mi=min(Pj_list)
  if Mi==List[i]:
    counter+=1

print(counter)
Problem p02983 (python)

Fixed submission:
L,R=map(int,input().split())
X=2019
for i in range (R-L):
    for j in range(R-L-i):
        if (L+i)*(L+i+j+1)%2019==0:
            X=0
            break
        elif X >(L+i)*(L+i+j+1)%2019:
            X=(L+i)*(L+i+j+1)%2019
    if X==0:
        break        
print(X)

Buggy submission (verdict: Runtime Error):
L,R=map(int,input().split())
X=2019
for i in range (R-L):
    for j in range(R-L-i):
        if (L+i)*(L+i+j+1)%2019==0:
            X=0
            break
        elif X >(L+i)*(L+i+j+1)%2019:
            X=(L+i)*(L+i+j+1)%2019
    if X=0:
        break        
print(X)
Problem p02995 (python)

Fixed submission:
import fractions
A,B,C,D=map(int,input().split())
E=C*D//fractions.gcd(C,D)
X=0
Y=0
X=A-1-(A-1)//C-(A-1)//D+(A-1)//E
Y=B-B//C-B//D+B//E
print(Y-X)

Buggy submission (verdict: Runtime Error):
import fractions
A,B,C,D=map(int,input().split())
X=0
L=0
M=0
N=0
E=C*D//fractions.gcd(C,D)
if B-A>=C:
    if A%C==0 or B%C==0:
        L=(B-A)//C+1
    else:
        L=(B-A)//C
else:
    if A%C==0 or B%C==0:
        L=!
    elif A%C>B%C:
        L=1
    else:
        L=0
if B-A>=D:        
    if A%D==0 or B%D==0:
        M=(B-A)//D+1
    else:
        M=(B-A)//D
else:
    if A%D==0 or B%D==0:
        M=1
    elif A%D>B%D:
        M=1
    else:
        M=0       
if B-A>=E:
    if A%E==0 or B%E==0:
        N=(B-A)//E+1
    else:
        N=(B-A)//E
else:
    if A%E==0 or B%E==0:
        N=!
    elif A%E>B%E :
        N=1
    else :
        N=0
X=B-A+1-L-M+N
print(X)

Buggy submission (verdict: Runtime Error):
import fractions
A,B,C,D=map(int,input().split())
X=0
L=0
M=0
N=0
E=C*D//fractions.gcd(C,D)
if B-A>=C:
    if A%C==0 or B%C==0:
        L=(B-A)//C+1
    else:
        L=(B-A)//C
else:
    if A%C>=B%C:
        L=1
    else:
        L=0
if B-A>=D:        
    if A%D==0 or B%D==0:
        M=(B-A)//D+1
    else:
        M=(B-A)//D
else:
    if A%D>=B%D
        M=1
    else:
        M=0       
if B-A>=E:
    if A%E==0 or B%E==0:
        N=(B-A)//E+1
    else:
        N=(B-A)//E
else:
    if A%E>=B%E :
        N=1
    else :
        N=0
X=B-A+1-L-M+N
print(X)

Buggy submission (verdict: Runtime Error):
import sympy
A,B,C,D=map(int,input().split())
X=0
L=0
M=0
N=0
E=C*D/sympy.gcd(C,D)
if A%C==0 or B%C==0:
    L=(B-A)//C+1
else:
    L=(B-A)//C

if A%D==0 or B%D==0:
    M=(B-A)//D+1
else:
    M=(B-A)//D
if B-A>=E:
    if A%E==0 or B%E==0:
        N=(B-A)//E+1
    else:
        N=(B-A)//E
else:
    if A%E==0 or B%E==0:
        N=(B-A)//E+2
    else:
        N=(B-A)//E+1
X=B-A+1-L-M+N
print(int(X))
Problem p02999 (python)

Fixed submission:
X,A=map(int,input().split())
Y=0
if X<A:
    Y=0
else:
    Y=10

print(Y)

Buggy submission (verdict: Runtime Error):
X,A=map(int,input().split())
if X < A:
    Print("0")

else:
    print("10")
Problem p03001 (python)

Fixed submission:
W,H,x,y=map(int,input().split())
S=W*H/float(2)
z=0
if x== W/2:
    if y== H/2:
        z=1
    else:
        z=0
else:
    z=0
print(S,z)

Buggy submission (verdict: Runtime Error):
W,H,x,y=map(int,input().split())
S=W*H/2
z=0
if x== W/2 & y== H/2:
    z=1
else:
    z=0
print(S,z)

Buggy submission (verdict: Runtime Error):
W,H,x,y=map(int,input().split())
S=W*H*0.1/2
z=0
if x== W/2 & y== H/2:
    z=1
else:
    z=0
print(S,z)