Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
import sympy

# 実行環境(0:vscode, 1:atcoder)
MODE = 1

# 入力の次元
DIMENSION = 0

# int型に変換
INT_TYPE = 1

if not (MODE):
    with open("input.txt", "r") as f:
        s = f.read()
else:
    s = sys.stdin.read()

if DIMENSION == 0:
    if INT_TYPE == 1:
        s = int(s)
elif DIMENSION == 1:
    if INT_TYPE == 0:
        s = s.split()
    elif INT_TYPE == 1:
        s = [int(x) for x in s.split()]
elif DIMENSION == 2:
    if INT_TYPE == 0:
        s = [x.split() for x in s.splitlines()]
    elif INT_TYPE == 1:
        s = [[int(y) for y in x.split()] for x in s.splitlines()]


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


F = factorization(s)

cnt = 0
for i in range(len(F)):
    num = 1
    while 1:
        F[i][1] -= num
        if F[i][1] < 0:
            break
        else:
            num += 1
            cnt += 1
print(cnt)


Fixed submission:
import sys

# 実行環境(0:vscode, 1:atcoder)
MODE = 1

# 入力の次元
DIMENSION = 0

# int型に変換
INT_TYPE = 1

if not (MODE):
    with open("input.txt", "r") as f:
        s = f.read()
else:
    s = sys.stdin.read()

if DIMENSION == 0:
    if INT_TYPE == 1:
        s = int(s)
elif DIMENSION == 1:
    if INT_TYPE == 0:
        s = s.split()
    elif INT_TYPE == 1:
        s = [int(x) for x in s.split()]
elif DIMENSION == 2:
    if INT_TYPE == 0:
        s = [x.split() for x in s.splitlines()]
    elif INT_TYPE == 1:
        s = [[int(y) for y in x.split()] for x in s.splitlines()]

if s == 1:
    print(0)
else:

    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

    F = factorization(s)

    cnt = 0
    for i in range(len(F)):
        num = 1
        while 1:
            F[i][1] -= num
            if F[i][1] < 0:
                break
            else:
                num += 1
                cnt += 1
    print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    n = int(input().rstrip())
    a_list = list(map(int, input().split()))

    ans = 1

    for i in a_list:
        ans *= i

    if ans > 10 ** 18:
        print(-1)
    else:
        print(ans)


if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    n = int(input().rstrip())
    a_list = list(map(int, input().split()))
    flag = False
    try:
        if a_list.index(0):
            flag = True
            print(0)
            exit()
    except:
        if flag:
            exit()
        ans = 1
        for i in a_list:
            ans *= i

            if ans > 10 ** 18:
                print(-1)
                exit()

        print(ans)



if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
from copy import deepcopy

def input():
    return sys.stdin.readline()


def resolve():
    t = input().rstrip()
    list_t = []

    for s in t:
        list_t.append(s)
    save_list_t = deepcopy(list_t)

    hatena_count = list_t.count("?")
    ans_list = []
    ans_max = 0
    for bit in range(1<<hatena_count):
        list_t = deepcopy(save_list_t)
        hatena_index = 0
        for i in range(hatena_count):

            if bit & (1<<i):
                hatena_index = t.find("?", hatena_index)
                list_t[hatena_index] = "P"
            else:
                hatena_index = t.find("?", hatena_index)
                list_t[hatena_index] = "D"

            hatena_index += 1

        # PD、Dをカウント
        pre = ""
        ans_temp = 0
        for s in list_t:
            if s == "D":
                ans_temp += 1
            two_char = pre + s
            if two_char == "PD":
                ans_temp += 1
            pre = s

        if ans_max < ans_temp:
            ans_max = ans_temp
            ans_list = list_t

    print("".join(ans_list))



if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

t = input().rstrip()
list_t = []

for s in t:
    list_t.append(s)

ans_str = ""
for i, s in enumerate(list_t):
    if s == "?":
        list_t[i] = "D"

print("".join(list_t))

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

t = input().rstrip()
list_t = []

for s in t:
    list_t.append(s)

ans_str = ""
for i, s in enumerate(list_t):
    if s == "?":
        list_t[i] = "D"
    ans_str += list_t[i]

print(ans_str)




Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

t = input().rstrip()
list_t = []

for s in t:
    list_t.append(s)

ans_str = ""
for i, s in enumerate(list_t):
    if s == "?":
        list_t[i] = "D"

print("".join(list_t))
Buggy python submission (verdict: Runtime Error):
import math
 
n = input()
 
if n[len(n)] == 3:
  print("bon")
elif n[len(n)] == 0 or n[len(n)] == 1 or n[len(n)] == 0 or  n[len(n)] == 6 or n[len(n)] == 8:
  print("pon")
else:
  print("hon")
 

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    n = input().rstrip()

    if n[-1] == "3":
        print("bon")
    elif n[-1] == "2" or n[-1] == "4" or n[-1] == "5" or n[-1] == "7" or n[-1] == "9":
        print("hon")
    else:
        print("pon")


if __name__ == "__main__":
    resolve()

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

n = input()

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

if n == math.inf:
  print("a")


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    n = input().rstrip()

    if n[-1] == "3":
        print("bon")
    elif n[-1] == "2" or n[-1] == "4" or n[-1] == "5" or n[-1] == "7" or n[-1] == "9":
        print("hon")
    else:
        print("pon")


if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
import itertools

def input():
    return sys.stdin.readline()


def resolve():
    n, m, q = map(int, input().split())
    a_d_list = []
    for i in range(q):
        a_d_list.append(list(map(int,input().split())))

    l = [i for i in range(1, m)]
    combi_list = list(itertools.combinations_with_replacement(l, n))

    ans_dic = {}
    for combi in combi_list:
        ans_dic[str(combi)] = 0

    for combi in combi_list:

        for i, a_d in enumerate(a_d_list):
            a = a_d[0]
            b = a_d[1]
            c = a_d[2]
            d = a_d[3]

            if combi[b-1] - combi[a-1] == c:

                ans_dic[str(combi)] += d


    print(max(ans_dic.values()))





if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
import itertools

def input():
    return sys.stdin.readline()


def resolve():
    n, m, q = map(int, input().split())
    a_d_list = []
    for i in range(q):
        a_d_list.append(list(map(int,input().split())))

    l = [i for i in range(1, m+1)]
    combi_list = list(itertools.combinations_with_replacement(l, n))

    ans_dic = {}
    for combi in combi_list:
        ans_dic[str(combi)] = 0

    for combi in combi_list:

        for i, a_d in enumerate(a_d_list):
            a = a_d[0]
            b = a_d[1]
            c = a_d[2]
            d = a_d[3]

            if combi[b-1] - combi[a-1] == c:

                ans_dic[str(combi)] += d


    print(max(ans_dic.values()))





if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    k, x = map(int, input().split())

    sum_money = k * 500

    if sum_money >= x:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    s = input()

    if s[2] == s[3] and s[4] == s[5]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

if min_x == max_x:
    print(0)
    exit()

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

n = int(input())
x_list = list(map(int, input().split()))

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

if min_x == max_x:
    print(0)
    exit()

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

n = int(input())
x_list = list(map(int, input().split()))

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

if min_x == max_x:
    print(0)
    exit()

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

# RemainingBalls
s, t = input().split()
a, b = map(int, input().split())
u = input()

if s == u:
    print(a-1, b)
elif t == u:
    print(a, b-1)


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

h, a = map(int, input().split())

if h % a == 0:
    print(h // a)
else:
    print(h//a + 1)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

n, k = map(int, input().split())
hp_list = list(map(int, input().split()))

# ソートする
hp_list.sort(reverse=True)

# 必殺技の回数ぶん除去
for i in range(k):
    hp_list.pop(0)

sum_hp = 0
for hp in hp_list:
    sum_hp += hp

print(sum_hp)




Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

n, k = map(int, input().split())
hp_list = list(map(int, input().split()))

if n < k:
    print(0)
    exit()

# ソートする
hp_list.sort()

# 必殺技の回数ぶん除去
for i in range(k):
    hp_list.pop()

sum_hp = 0
for hp in hp_list:
    sum_hp += hp

print(sum_hp)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def resolve():
    n, m = map(int, input().split())

    if n == m:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def resolve():
    c = input()

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


if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
#input = sys.stdin.readline


def resolve():
    n, m = map(int, input().split())

    p_list, s_list = [], []
    for i in range(m):
        p, s = input().split()
        p_list.append(int(p))
        s_list.append(s)

    sum_wa = 0
    ac_num = 0
    ac_list = []
    wa_dic = {}
    for i in range(m):
        if p_list[i] in ac_list:
            continue

        if s_list[i] == "AC":
            ac_num += 1
            ac_list.append(p_list[i])
            if p_list[i] in wa_dic.keys():
                sum_wa += wa_dic[p_list[i]]
        else:
            if p_list[i] in wa_dic.keys():
                wa_dic[p_list[i]] += 1
            else:
                wa_dic[p_list[i]] = 1

    print(ac_num, sum_wa)

if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
#input = sys.stdin.readline


def resolve():
    n, m = map(int, input().split())
    all_wa = 0
    all_ac = 0
    ac_list = []
    p_list, s_list = [], []
    first_ac_dic = {}

    wa_count_dic = {}
    wa_num = 0
    for i in range(m):
        p, s = input().split()
        p = int(p)
        p_list.append(p)
        s_list.append(s)

        if s == "AC":
            if p in first_ac_dic:
                pass
            else:
                first_ac_dic[p] = i
                wa_num += wa_count_dic.get(p, 0)
        else:
            wa_count_dic[p] = wa_count_dic.get(p, 0) + 1

    ans_ac = len(first_ac_dic)

    print(ans_ac, wa_num)


if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def resolve():
    c = input()

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


if __name__ == "__main__":
    resolve()



Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    k, x = map(int, input().split())

    sum_money = k * 500

    if sum_money >= x:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()
Buggy python submission (verdict: Runtime Error):
N=int(input())
ans = [0 for _ in range(10001)]
for i in range(101):
  for j in range(101):
    for k in range(101):
      v = i*i + j*j + k*k + i*j + j*k + k*i
      if v < 10001:
        ans[v] += 1

for i in range(n):
  print(ans[i+1])

Fixed submission:
n=int(input())
ans = [0 for _ in range(10001)]
for i in range(1, 101):
  for j in range(1, 101):
    for k in range(1, 101):
      v = i*i + j*j + k*k + i*j + j*k + k*i
      if v < 10001:
        ans[v] += 1

for i in range(n):
  print(ans[i+1])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ans = [0 for _ in range(10001)]
for i in range(1001):
  for j in range(1001):
    for k in range(1001):
      v = i*i + j*j + k*k + i*j + j*k + k*i
      if v < 10001:
        ans[v] += 1

for i in range(n):
  print(ans[i+1])

Fixed submission:
n=int(input())
ans = [0 for _ in range(10001)]
for i in range(1, 101):
  for j in range(1, 101):
    for k in range(1, 101):
      v = i*i + j*j + k*k + i*j + j*k + k*i
      if v < 10001:
        ans[v] += 1

for i in range(n):
  print(ans[i+1])
Buggy python submission (verdict: Runtime Error):

a=int(input())
li = list(map(int,input().split()))
if 0 in li:
  print(0)
  
else:
  result = 1
  for number in li:
    result = result * number
    if result > 10**18:
      print(-1)
      break

if result <= 10**18:
  print(result)

Fixed submission:

a=int(input())
li = list(map(int,input().split()))
if 0 in li:
  print(0)
  
else:
  result = 1
  for number in li:
    result = result * number
    if result > 10**18:
      print(-1)
      break

  if result <= 10**18:
    print(result)

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
a=int(input())
li = list(map(int,input().split()))

j = reduce(mul, li)
if j > 10**18:
  print(-1)
else:
  print(j)

Fixed submission:

a=int(input())
li = list(map(int,input().split()))
if 0 in li:
  print(0)
  
else:
  result = 1
  for number in li:
    result = result * number
    if result > 10**18:
      print(-1)
      break

  if result <= 10**18:
    print(result)

Buggy python submission (verdict: Runtime Error):
from operator import mul
from functools import reduce
a=int(input())
li = list(map(int,input().split()))
j = reduce(mul, nums)
if j >= 10**18:
  print(-1)
else:
  print(j)

Fixed submission:

a=int(input())
li = list(map(int,input().split()))
if 0 in li:
  print(0)
  
else:
  result = 1
  for number in li:
    result = result * number
    if result > 10**18:
      print(-1)
      break

  if result <= 10**18:
    print(result)
Buggy python submission (verdict: Runtime Error):
x,y = map(float,input().split())
import math
from decimal import Decimal
y_ = Decimal('y')
x_ = Decimal('x')

print(math.floor(x_*y_))

Fixed submission:
from decimal import Decimal
x,y = map(str,input().split())
import math
x=int(x)
y=Decimal(y)
val_floor = math.floor(x*y)
print(int(val_floor))

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

print(math.floor(x*y))

Fixed submission:
from decimal import Decimal
x,y = map(str,input().split())
import math
x=int(x)
y=Decimal(y)
val_floor = math.floor(x*y)
print(int(val_floor))
Buggy python submission (verdict: Runtime Error):
if t_n <= a_n:
    print('YES')
else:
    print('NO')

Fixed submission:
import math
a,b,c,d = map(int,input().split())
t_n = math.ceil(c / b)
a_n = math.ceil(a / d)

if t_n <= a_n:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
(n,m)=map(int,input().split())
a=input().split()
a=list(map(int,a))
l=[]
k=0
a=sorted(a)
for i in range(m-1):
    d=abs(a[i]-a[i+1])
    k=k+d
    l.append(d)
# k=k-d
c=n-k
l.append(c)
l=sorted(l)

print(n-l[-1])

Fixed submission:
a = input()
if (a[2]==a[3]) & (a[4] == a[5]):
    print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
(n,m)=map(int,input().split())
a=input().split()
a=list(map(int,a))
l=[]
k=0
a=sorted(a)
for i in range(m-1):
    d=abs(a[i]-a[i+1])
    k=k+d
    l.append(d)
# k=k-d
c=n-k
l.append(c)
l=sorted(l)

print(n-l[-1])

Fixed submission:
a = input()
if (a[2]==a[3]) & (a[4] == a[5]):
    print('Yes')
else:
	print('No')
Buggy python submission (verdict: Runtime Error):
k=int(input())
n=int(input())
n_list=[int(input()) for i in range(n)]
for i in range(len(n_list)):
  if n_list[i] > k-n_list[i]:
    n_list[i]=-(k-n_list[i])
n_list.sort()
print(n_list[-1]-n_list[0])


Fixed submission:
(n,m)=map(int,input().split())
a=input().split()
a=list(map(int,a))
l=[]
k=0
a=sorted(a)
for i in range(m-1):
    d=abs(a[i]-a[i+1])
    k=k+d
    l.append(d)
# k=k-d
c=n-k
l.append(c)
l=sorted(l)

print(n-l[-1])
Buggy python submission (verdict: Runtime Error):
a = [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 = input()
print(a[k-1])

Fixed submission:
a = [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 = input()
print(a[int(k)-1])

Buggy python submission (verdict: Runtime Error):
a = [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 = input()
print(a[k+1])

Fixed submission:
a = [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 = input()
print(a[int(k)-1])
Buggy python submission (verdict: Runtime Error):
h,w = map(int,input().split())
h_a = h % 2
w_a = w % 2
h_b = h // 2 
w_b = w // 2 
if(h == 1 || w == 1):
  print(1)

elif((h_a == 0) & (w_a == 0)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 0)):
  print(w_b * h)
elif((h_a == 0) & (w_a == 1)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 1)):
  print((h_b + 1) * (w_b + 1) + h_b * w_b)

Fixed submission:
h,w = map(int,input().split())
h_a = h % 2
w_a = w % 2
h_b = h // 2 
w_b = w // 2 
if(h == 1 or w == 1):
  print(1)

elif((h_a == 0) & (w_a == 0)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 0)):
  print(w_b * h)
elif((h_a == 0) & (w_a == 1)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 1)):
  print((h_b + 1) * (w_b + 1) + h_b * w_b)

Buggy python submission (verdict: Runtime Error):
h = input()
w = input()
h_a = h // 2
w_a = w // 2
if((h_a == 0) & (w_a == 0)):
  print(h_a * w_a)
elif((h_a == 1) & (w_a == 0)):
  print((h_a+1) * w_a)
elif((h_a == 0) & (w_a == 1)):
  print(h_a * (w_a + 1))
elif((h_a == 1) & (w_a == 1)):
  print((h_a + 1) * (w_a + 1))

Fixed submission:
h,w = map(int,input().split())
h_a = h % 2
w_a = w % 2
h_b = h // 2 
w_b = w // 2 
if(h == 1 or w == 1):
  print(1)

elif((h_a == 0) & (w_a == 0)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 0)):
  print(w_b * h)
elif((h_a == 0) & (w_a == 1)):
  print(h_b * w)
elif((h_a == 1) & (w_a == 1)):
  print((h_b + 1) * (w_b + 1) + h_b * w_b)
Buggy python submission (verdict: Runtime Error):
import cmath

li = list(map(int,input().split()))
a = cmath.sqrt(li[0])
b = cmath.sqrt(li[1])
c = cmath.sqrt(li[2])
if(a+b < c):
  print('Yes')
else:
  print('No')

Fixed submission:
import math

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

x = c - a - b
if(x <= 0):
  print('No')
elif(4 * a * b < x ** 2):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
import cmath

li = list(map(int,input().split()))
a = cmath.sqrt(li[0])
b = cmath.sqrt(li[1])
c = cmath.sqrt(li[2])
if(a+b < c):
  print('Yes')
else:
  print('No')

Fixed submission:
import math

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

x = c - a - b
if(x <= 0):
  print('No')
elif(4 * a * b < x ** 2):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
nums = [int(e) for e in input().split()]
n = nums[0]
a = nums[1]
b = nums[2]
22 3 4
bbb4444bbb4444bbb4444b
sum = a + b
iter = n // sum
amari = n % sum
if amari >= b:
	print(iter * a + (b))
else:
  print(iter * a + (amari))

Fixed submission:
nums = [int(e) for e in input().split()]
n = nums[0]
a = nums[1]
b = nums[2]

sum1 = a + b
iter1 = n // sum1
amari = n % sum1
if amari >= a:
	print(iter1 * a + (a))
else:
  print(iter1 * a + (amari))
Buggy python submission (verdict: Runtime Error):
#output <= 1000

nums = [int(e) for e in input().split()]
flag = 0
for i in range(1,1001):
  if ((((i * 8) // 100) == nums[0]) & (((i * 10) // 100) == nums[1])):
    flag = 1
    print(i)
    break

if flag = 0:
    print(-1)

Fixed submission:
#output <= 1000

nums = [int(e) for e in input().split()]
flag = 0
for i in range(1,1001):
  if ((((i * 8) // 100) == nums[0]) & (((i * 10) // 100) == nums[1])):
    flag = 1
    print(i)
    break

if flag == 0:
    print(-1)
Buggy python submission (verdict: Runtime Error):
n = input()
if (n % 2) == 1:
  print((n // 2) + 1)
else:
  print(n // 2)


Fixed submission:
n = int(input())
if (n % 2) == 1:
  print((n // 2) + 1)
else:
  print(n // 2)

Buggy python submission (verdict: Runtime Error):
n = input()
if n % 2 == 1:
  print((n // 2) + 1)
else:
  print(n // 2)

Fixed submission:
n = int(input())
if (n % 2) == 1:
  print((n // 2) + 1)
else:
  print(n // 2)