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

Fixed submission:
l = input().split()
if l[1] == "+":
  print(int(l[0])+int(l[2]))
else:
  print(int(l[0])-int(l[2]))

Buggy submission (verdict: Runtime Error):
l = input().split()
if l[1] = "+":
  print(int(l[0])+int(l[2]))
else:
  print(int(l[0])-int(l[2]))
Problem p03943 (python)

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

if a+b == c:
   print("Yes")
elif a+c == b:
   print("Yes")
elif b+c == a:
   print("Yes")
else:
   print("No")

Buggy submission (verdict: Runtime Error):
list1 = input().split()
n = int(list1[0])
t = int(list1[1])
a = input().split()

list = []
l = 0
i = 0
while l < n:
   i = l + 1
   if i == n:
       list.append(int(a[i-1])-int(a[l]))     
       break
      else: 
       while i < n:
        if a[i-1]<a[i]:
           i += 1
        else:
           list.append(int(a[i-1])-int(a[l]))
           break
   l += 1

print(list.count(max(list)))
Problem p03951 (python)

Fixed submission:
n = int(input())
s = str(input())
t = str(input())
i = -1
while True:
   i += 1
   if t.find(s[i:n])>-1:
      print(int(n+i))
      break

Buggy submission (verdict: Runtime Error):
n = int(input())
s = str(input())
t = str(input())
i = 0
while t.find(s[i,n])>-1:
Problem p03962 (python)

Fixed submission:
list = str(input()).split()
if int(list[0]) == int(list[1]):
   if int(list[1]) == int(list[2]):
      print(1)
   else :
      print(2)
elif int(list[0]) == int(list[2]):
   print(2)
elif int(list[1]) == int(list[2]):
   print(2)
else:
   print(3)

Buggy submission (verdict: Runtime Error):
list = str(input()).split()
if int(list[0]) = int(list[1]):
   if int(list[1]) = int(list[2]):
      print(1)
   else print(2)
elif int(list[0]) = int(list[2]):
   print(2)
elif int(list[1]) = int(list[2]):
   print(2)
else:
   print(3)
Problem p03963 (python)

Fixed submission:
list = input().split()
a = (int(list[0])-1)
b = int(list[1])-1
print(pow(b,a)*int(list[1]))

Buggy submission (verdict: Runtime Error):
list = input().split()
a = bin(int(list[0])-1)
b = int(list[1])-1
print(pow(b,a)*int(list[1]))
Problem p04029 (python)

Fixed submission:
n = int(input())
print(int((n*(n+1))/2))

Buggy submission (verdict: Runtime Error):
n = input()
print((n*(n+1))/2)
Problem p02553 (python)

Fixed submission:
a, b, c, d = input().split() 
a = int(a)
b = int(b)
c = int(c)
d = int(d)
xy1 = a*c
xy2 = a*d
xy3 = b*c
xy4 = b*d
 
print(max([xy1, xy2, xy3, xy4]))

Buggy submission (verdict: Runtime Error):
a, b, c, d = input().split() 
xy1 = a*c
xy2 = a*d
xy3 = b*c
xy4 = b*d
 
print(max([xy1, xy2, xy3, xy4]))

Buggy submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
d = input()
 
xy1 = a*c
xy2 = a*d
xy3 = b*c
xy4 = b*d
 
print(max([xy1, xy2, xy3, xy4]))

Buggy submission (verdict: Runtime Error):
input_line = input()
x = input_line.split()
a = x[0]
b = x[1]
c = x[2]
d = x[3]

xy1 = a*c
xy2 = a*d
xy3 = b*c
xy4 = b*d

print(max([xy1, xy2, xy3, xy4]))
Problem p02602 (python)

Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))
ACC = []
ACC.append(0)
sum = 0
for a in A:
    sum += a
    ACC.append(sum)


L = N-K+1
prev = ACC[K] - ACC[0]
for i in range(1, L):
    score = ACC[i+K] - ACC[i] 
    if prev < score:
        print("Yes")
    else:
        print("No")
    prev = score

Buggy submission (verdict: Runtime Error):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations, permutations
from copy import deepcopy
import sys
import numpy as np
sys.setrecursionlimit(4100000)
import math
def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


if __name__ == '__main__':
    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    mod = len(A)%K
    prev = None
    L = 0

    for i in range(N-K+1):
        check = A[i:i+K]
        if i==0:
            acc = 1
            for c in check:
                acc *= c
                prev = acc
        else:
            acc = 1
            for c in check:
                acc *= c
            if prev<acc:
                print("Yes")
            else:
                print("No")
            prev = acc
Problem p02657 (python)

Fixed submission:
import numpy as np;




if __name__ == '__main__':
    a, b = map(int, input().split())
    print(a*b)

Buggy submission (verdict: Runtime Error):
import numpy as np;
from numba import jit
import warnings
from operator import mul
from functools import reduce
warnings.simplefilter('ignore')
    

if __name__ == '__main__':
    try:

        N = int(input())
        A = list(map(int, input().split()))
        ans = reduce(mul, A)
        if ans > 10 ** 18:
            print(-1)
        else:
            print(ans)
    except:
        if 0 in A:
            print(0)
        else:
            print(-1

Buggy submission (verdict: Runtime Error):
import numpy as np;
from numba import jit
import warnings
from operator import mul
from functools import reduce
warnings.simplefilter('ignore')
    

if __name__ == '__main__':
    try:

        N = int(input())
        A = list(map(int, input().split()))
        ans = reduce(mul, A)
        if ans > 10 ** 18:
            print(-1)
        else:
            print(ans)
    except:
        print(-1)

Buggy submission (verdict: Runtime Error):
import numpy as np;
from numba import jit
import warnings
from operator import mul
from functools import reduce
warnings.simplefilter('ignore')
    

if __name__ == '__main__':
    try:

        N = int(input())
        A = list(map(int, input().split()))
        ans = reduce(mul, A)
        if ans > 10 ** 18:
        print(-1)
        else:
            print(ans)
    except:
        print(-1)

Buggy submission (verdict: Runtime Error):
import numpy as np;
from numba import jit
import warnings
from operator import mul
from functools import reduce
warnings.simplefilter('ignore')
    

if __name__ == '__main__':
    N = int(input())
    A = list(map(int, input().split()))
    ans = reduce(mul, A)
    if ans > 10 ** 18:
        print(-1)
    else:
        print(ans)
Problem p02660 (python)

Fixed submission:
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

N = int(input())
z_list = factorization(N)
Z = []
for z in z_list:
        for e in range(1, z[1]+1):
            Z.append(z[0]**e)
sorted(Z)
counter = 0 
if N==1:
    print(0)
    quit()
for z in Z:
    if(N%z==0):
        N = N//z
        counter += 1
print(counter)

Buggy submission (verdict: Runtime Error):
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

N = int(input())
z_list = factorization(N)
Z = []
for z in z_list:
        for e in range(1, z[1]+1):
            Z.append(z[0]**e)
sorted(Z)
counter = 0 
if N==i:
    print(0)
    quit()
for z in Z:
    if(N%z==0):
        N = N//z
        counter += 1
print(counter)

Buggy submission (verdict: Runtime Error):
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

N = int(input())
z_list = factorization(N)
Z = []
for z in z_list:
        for e in range(1, z[1]+1):
            Z.append(z[0]**e)
sorted(Z)
counter = 0 
if N==i:
    print(0)
    quit()
for z in Z:
    if(N%z==0):
        N = N//z
        counter += 1
print(counter)
Problem p02687 (python)

Fixed submission:
import numpy as np;
from numba import jit




if __name__ == '__main__':
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")

Buggy submission (verdict: Runtime Error):

import numpy as np;
from numba import jit




if __name__ == '__main__':
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC"
Problem p02732 (python)

Fixed submission:
from copy import deepcopy

def count(A):
    cnt = 0
    for a in A:
        cnt += (a*(a-1))//2
    return cnt


if __name__ == '__main__':
    N = int(input())
    A = list(map(int, input().split()))

    max_A = max(A)

    count_A = [0]*(max_A+1)

    for a in A:
        count_A[a]+= 1

    combi_A = 0

    for c in count_A:
        combi_A += (c*(c-1))//2
    for a in A:
        print(combi_A-(count_A[a]*(count_A[a]-1)-(count_A[a]-1)*(count_A[a]-2))//2)

Buggy submission (verdict: Runtime Error):
from scipy.special import comb


N = int(input())
A = list(map(int, input().split()))
sorted_A = sorted(A)
countNums = [0]*(N+1)

target = sorted_A[0]
for i in range(N):
    if target==sorted_A[i]:
        countNums[target] += 1
    else:
        target = sorted_A[i]
        countNums[target] += 1;


for i in range(N):
    a = A[i]
    countNums[a] -= 1
    ans = 0
    for c in countNums:
        ans += int(comb(c, 2))
    print(ans)
    countNums[a] += 1
Problem p02760 (python)

Fixed submission:
if __name__ == '__main__':
    A = []
    for i in range(3):
        row = list(map(int, input().split()))
        A.append(row)
    
    N = int(input())
    B = []

    for i in range(N):
        B.append(int(input())) 
    
    for i in range(3):
        cnt = 0
        for j in range(3):
            if A[i][j] in B:
                cnt += 1
        if cnt==3:
            print('Yes')
            quit()
            
    for i in range(3):
        cnt = 0
        for j in range(3):
            if A[j][i] in B:
                cnt += 1
        if cnt==3:
            print('Yes')
            quit()

    if A[0][0] in B and A[1][1] in B and A[2][2] in B:
        print('Yes')
        quit()
    
    if A[0][2] in B and A[1][1] in B and A[2][0] in B:
        print('Yes')
        quit()
    
    print('No')

Buggy submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 100100100;

vector<vector<int>> A(3);

bool bingo(vector<int> B) {
    int cnt1 = 0;
    for(int b: B) {
        rep(y, 3) {
            rep(x, 3) {
                if(A[y][x]==b) {
                    ++cnt1;
                }
            }
        }
    }
    if(cnt1==3) return true;
    int cnt2 = 0;
    for(int b: B) {
        rep(y, 3) {
            rep(x, 3) {
                if(A[x][y]==b) {
                    ++cnt2;
                }
            }
        }
    }
    if(cnt2==3) return true;
    int cnt3 = 0;
    for(int b: B) {
        rep(i, 3) {
            if(b==A[i][i]) ++cnt3;
        }
    }
    if(cnt3==3) {
        return true;
    }

    int cnt4 = 0;
    for(int b: B) {
        rep(i, 3) {
            if(b==A[2-i][i]) ++cnt4;
        }
    }
    if(cnt4==3) {
        return true;
    }
    return false; 
}

int main() {
    vector<int> row(3);
    rep(i, 3) {
        rep(j, 3) {
            cin >> row[j];
        }
        A[i] = row;
    }
    int N;
    cin >> N;
    vector<int> B(N);
    rep(i, N) {
        cin >> B[i];
    }

    bool flag = bingo(B);

    if(flag) {
        print("Yes");
    }
    else {
        print("No");
    }



    return 0;
}
Problem p02761 (python)

Fixed submission:
if __name__ == '__main__':
    N, M = map(int, input().split())
    S = []
    C = []

    for i in range(M):
        s, c = map(int, input().split())
        s -= 1
        S.append(s)
        C.append(c)

    for num in range(0, pow(10, N)):
        st_num = str(num)
        if len(str(st_num))!=N: continue
        cnt = 0
        for m in range(M):
            if int(st_num[S[m]])==C[m]:
                cnt += 1
        if cnt==M:
            print(st_num)
            quit()
    print(-1)

Buggy submission (verdict: Runtime Error):
if __name__ == '__main__':
    N, M = map(int, input().split())
    S = []
    C = []

    for i in range(M):
        s, c = map(int, input().split())
        s -= 1
        S.append(s)
        C.append(c)

    for num in range(pow(10, N-1)-1, pow(10, N)):
        st_num = str(num)
        cnt = 0
        for m in range(M):
            if int(st_num[S[m]])==C[m]:
                cnt += 1
        if cnt==M:
            print(st_num)
            quit()
    print(-1)
Problem p02767 (python)

Fixed submission:

N = int(input())
X = list(map(int, input().split()))

minX = min(X)
maxX = max(X)
if minX==maxX:
    print(0)
    quit()

HP = []
for p in range(minX, maxX):
    hp = 0
    for x in X:
        hp += (x-p)**2
    HP.append(hp)

print(min(HP))

Buggy submission (verdict: Runtime Error):

N = int(input())
X = list(map(int, input().split()))

minX = min(X)
maxX = max(X)

HP = []
for p in range(minX, maxX):
    hp = 0
    for x in X:
        hp += (x-p)**2
    HP.append(hp)

print(min(HP))

Buggy submission (verdict: Runtime Error):

N = int(input())
X = list(map(int, input().split()))

minX = min(X)
maxX = max(X)



HP = []
for p in range(minX, maxX):
    hp = 0
    for x in X:
        hp += (x-p)**2
    HP.append(hp)

print(min(HP))
Problem p02791 (python)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))
ans =1 
newP = P[0]
for i in range(1, N):
    newP = (min(newP, P[i]))
    if newP == P[i]:
        ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
P = list(map(int, input().split()))
ans = 0
for i in range(N):
    partP = P[:i+1]
    flag = True 
    partP.sort()[::-1]
    for p in partP:
        if P[i] <= p:
            continue
        else:
            flag = False
            break
    if flag:
        ans += 1

print(ans)
Problem p03086 (python)

Fixed submission:
S = input()

ACGT = ['A', 'C', 'G', 'T']
cntList = []
cnt = 0
cntList.append(cnt)
for s in S:
    if s in ACGT:
        cnt += 1
        cntList.append(cnt)
    else:
        cnt = 0
print(max(cntList))

Buggy submission (verdict: Runtime Error):
ACGT = ['A', 'C', 'G', 'T']
S = input()
cnt = 0
max_cnt = 0
for s in S:
    if s in ACGT:
        cnt += 1
        cntList.append(cnt)
    else:
        max_cnt = max(cnt, max_cnt)
        cnt = 0
print(max_cnt)

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

ACGT = ['A', 'C', 'G', 'T']
cntList = []
cnt = 0
for s in S:
    if s in ACGT:
        cnt += 1
        cntList.append(cnt)
    else:
        cnt = 0
print(max(cntList))

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

ACGT = ['A', 'C', 'G', 'T']
cntList = []
cnt = 0
for s in S:
    if s in ACGT:
        cnt += 1
    else:
        cntList.append(cnt)
        cnt = 0
if max == []:
    print(0)
    quit()
print(max(cntList))

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

ACGT = ['A', 'C', 'G', 'T']
cntList = []
cnt = 0
for s in S:
    if s in ACGT:
        cnt += 1
    else:
        cntList.append(cnt)
        cnt = 0

print(max(cntList))
Problem p03227 (python)

Fixed submission:
s = input()

if len(s) == 2:
        print(s)
elif len(s) == 3:
        print(s[::-1])

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

if n%2 != 0:
        m = int(n/2)
        x = 0
        y = 0
        z = max(a[2*m]-a[m], a[m]-a[0])
        for i in range(m):
                x += int(a[2*m-i] - a[i])
        for i in range(m-1):
                y += int(a[2*m-1-i] - a[i])
        print(x+y+z)
elif n%2 == 0:
        m = int(n/2)
        x = 0
        y = 0
        for i in range(m-1):
                x += int(a[2*m-1-i] - a[i])
        for i in range(m-2):
                y += int(a[2*m-2-i] - a[i])
        print(x+y+a[m]-a[m-2]+a[2*m-1]-a[m-1])
Problem p03238 (python)

Fixed submission:
n = int(input())
if n == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A+B)

Buggy submission (verdict: Runtime Error):
n = int(input())
if n == 1:
    print('Hello World')
else:
    A,B = map(int,input().split())
    print(A+B)
Problem p03262 (python)

Fixed submission:
def gcd(A,B):
    while B != 0:
        A,B = B,A%B
    return A
n,x = map(int,input().split())
li = [abs(int(i)-x) for i in input().split()]
ans = li[0]
for i in range(n):
    ans = gcd(ans,li[i])

print(ans)

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

n,x = map(int,input().split())
A = list(map(int,input().split()))
for i in range(n):
    A[i] -= x
print(reduce(math.gcd, A))
Problem p03292 (python)

Fixed submission:
li = list(map(int,input().split()))
li.sort()

print(li[2]-li[0])

Buggy submission (verdict: Runtime Error):
li = list(input().split())
li.sort()

print(li[2]-li[0])
Problem p03323 (python)

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

if max(a,b) <= 8:
        print('Yay!')
else:
        print(':(')

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

if max(a,b) <= 8:
        print('Yay!')
else:
        print(':(')
Problem p03324 (python)

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

if n != 100:
        print(100**d*n)
else:
        print(100**d*(n+1))

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

if n != 100:
        print(100**d*n)
else:
        print(100**d8(n+1))
Problem p03337 (python)

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

print(max(a+b,a-b,a*b))

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

print(max(a+b,a-b,a*b))
Problem p03339 (python)

Fixed submission:
N = int(input())
S = input()
e_count = S.count('E')
w_count = 0
ans = e_count

for s in S:
    if s == 'E':
        e_count -= 1
    else:
        w_count += 1
    if e_count + w_count < ans:
        ans = e_count+w_count

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
e_count = S.count('E')
w_count = 0
ans = e_count

for s in S:
    if s == 'E':
        e_count -= 1
    else:
        w_count += 1
    if e_count + w_count < ans:
        e_count+w_count = ans

print(ans)
Problem p03455 (python)

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

Buggy submission (verdict: Runtime Error):
a,b = map(int,input())
if (a*b)%2 == 0:
    print('Even')
else:
    print('Odd')

Buggy submission (verdict: Runtime Error):
a,b = map(int,input())
if a*b%2 == 0:
    print('Even')
else:
    print('Odd')
Problem p03477 (python)

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

x = a+b
y = c+d

if x>y:
    print('Left')
elif x == y:
    print('Balanced')
else:
    print('Right')

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

x = a+b
y = c+d

if x>:y
    print('Left')
elif x == y:
    print('Balanced')
else:
    print('Right')
Problem p03632 (python)

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

if b<=c or d<=a:
    print(0)
elif a<=c and b<=d:
    print(b-c)
elif a<=c and d<=b:
    print(d-c)
elif c<=a and b<=d:
    print(b-a)
elif c<=a and d<=b:
    print(d-a)
else:
    print(0)

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

if b<=c:
    print(0)
elif a<=c and b<=d:
    print(b-c)
elif a<=c and d<=b:
    print(d-c)
elif c<=a and b<=d:
    print(b-a)
elif c<=a and d<=b:
    print(d-a)
elif d<=a
    print(0)
Problem p03695 (python)

Fixed submission:
n = int(input())
A = list(map(int,input().split()))
color = []
cnt = 0

for i in range(n):
    c = A[i]//400
    if c<=7:
        color.append(c)
    else:
        cnt += 1

diff = set(color)
minimum = max(len(diff),1)
maximum = len(diff)+cnt

print(minimum, maximum)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = list(map(int,input().split()))
color = []
cnt = 0

for i in range(n):
    c = A[i]//400
    if c<=7:
        color.append(c)
    else:
        cnt += 1

diff = set(color)
minimum = max(len(diff),1)
maximum = min(len(diff)+cnt)

print(minimum, maximum)
Problem p03697 (python)

Fixed submission:
x,y = map(int,input().split())
a = x+y
if a >= 10:
        print('error')
else:
        print(a)

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split())
x+y = a
if a >= 10:
        print('error')
else:
        print(a)

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

if x+y >= 10:
        print('error')
else:
        print(a+b)
Problem p03730 (python)

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

for i in range(1,b+1):
    if (a*i)%b == c:
        print('YES')
        break
else:
    print('NO')

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

for i in range(1,b+1):
    if a*i%b == c:
        print('YES')
        break
else:
    print('NO')
Problem p03826 (python)

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

if x*y >= z*w:
        print(x*y)
else:
        print(z*w)

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

if a*b >= c*d:
    print(a*b)
elif c*d > a*b:
    print(c*d)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
li = [a*b, c*d]
print(max(li))

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
li = [a*b, c*d]
print(max(li))
Problem p03861 (python)

Fixed submission:
a,b,x = map(int,input().split())
print(b//x-(a-1)//x)

Buggy submission (verdict: Runtime Error):
count = 0
a = min(m,n)
b = max(m,n)

if a/x == int(a//x) and b/x == int(b//x):
    print(int(1 + b//x - a//x))

elif a/x == int(a//x) and b/x != int(b//x):
    print(int(int(b//x) - int(a//x) + 1))

elif a/x != int(a//x) and b/x == int(b//x):
    print(int(int(b//x) - int(a//x)))

elif a/x != int(a//x) and b/x != int(b//x):
    print(int(int(b//x) - int(a//x)))