ZhenlongDai/ACPR huggingface dataset:
Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
k = int(input())

s_2 = s + s

num_first = 0
renzoku = 1
before = 0
for i in range(len(s)):
    now = s[i]
    if now == before:
        renzoku += 1
    else:
        num_first += renzoku 
        renzoku = 1
    before = now
num_first += renzoku 

num_rest = 0
renzoku = 1
before = 0
for i in range(len(s_2)):
    now = s_2[i]
    if now == before:
        renzoku += 1
    else:
        num_rest += renzoku 
        renzoku = 1
    before = now
num_rest += renzoku 

num_rest -= num_first

print(num_first + (k-1) * num_rest)

Failing test case input:
rq
333

Expected output:
0


Actual output:
667


Fixed submission (verdict: Accepted):
import sys

s = input()
k = int(input())

onaji = 1
before = s[0]
for i in range(len(s)):
    now = s[i]
    if now != before:
        onaji = 0

if onaji == 1:
    print((len(s)*k)
    sys.exit()

s_2 = s + s

num_first = 0
renzoku = 1
before = 0
for i in range(len(s)):
    now = s[i]
    if now == before:
        renzoku += 1
    else:
        num_first += renzoku 
        renzoku = 1
    before = now
num_first += renzoku 

num_rest = 0
renzoku = 1
before = 0
for i in range(len(s_2)):
    now = s_2[i]
    if now == before:
        renzoku += 1
    else:
        num_rest += renzoku 
        renzoku = 1
    before = now
num_rest += renzoku 

num_rest -= num_first

print(num_first + (k-1) * num_rest)

Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=list(input())
K=int(input())
l=[1]
for i in range(len(S)-1):
    if S[i]==S[i+1]:l[-1]+=1;
    else:l.append(1)
if len(l)==1:ans = len(S)*K/2;
else:
    l2=[i/2 for i in l]
    if S[0]==S[-1]:
        ht=(l[0]+l[-1])
        ans=l2.pop(0)
        ans+=l2.pop(-1)
        ans+=sum(l2)*K
        ans+=ht*(K-1)
    else:
        ans=sum(l2)*K
print(ans)
    


Failing test case input:
fnomftppfemurdecpndmeedm
2294

Expected output:
4588


Actual output:
27528.0


Fixed submission (verdict: Accepted):
S=list(input())
K=int(input())
l=[1]
for i in range(len(S)-1):
    if S[i]==S[i+1]:l[-1]+=1;
    else:l.append(1)
if len(l)==1:ans = len(S)*K
else:
    l2=[i
    if S[0]==S[-1]:
        ht=(l[0]+l[-1])
        ans=l2.pop(0)
        ans+=l2.pop(-1)
        ans+=sum(l2)*K
        ans+=ht*(K-1)
    else:
        ans=sum(l2)*K
print(int(ans))
Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())
k = int(input())
count = 0
if k >= 3:
    t1 = s * 5
    for i in range(len(t1) - 1):
        if t1[i] == t1[i + 1]:
            t1.pop(i + 1)
            t1.insert(i + 1, "")
            count += 1
    if count % 5 == 0:
        count = (count / 5) * k
    else:
        count = ((count + 2) / 5) * k - 2
else:
    t1 = s * k
    for i in range(len(t1) - 1):
        if t1[i] == t1[i + 1]:
            t1.pop(i + 1)
            t1.insert(i + 1, "")
            count += 1
print(int(count))


Failing test case input:
hssih
3

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
s = list(input())
k = int(input())
count = 0
s1 = list(set(s))
if len(s1) == 1:
    count = int((k * len(s)) / 2)
elif k >= 3:
    t1 = s * 5
    for i in range(len(t1) - 1):
        if t1[i] == t1[i + 1]:
            t1.pop(i + 1)
            t1.insert(i + 1, "")
            count += 1
    if count % 5 == 0:
        count = (count / 5) * k
    elif (count + 1) % 5 == 0:
        count = ((count + 1) / 5) * k - 1
    else:
        count = ((count + 2) / 5) * k - 2
else:
    t1 = s * k
    for i in range(len(t1) - 1):
        if t1[i] == t1[i + 1]:
            t1.pop(i + 1)
            t1.insert(i + 1, "")
            count += 1
print(int(count))

Problem: p02891
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
s = input()
k = int(input())

press = []
temp = s[0]
cnt = 0
for i in range(len(s)):
    if temp == s[i]:cnt += 1
    else:
        press.append((temp, cnt))
        cnt = 1
        temp = s[i]
press.append((temp, cnt))

count = 0
for str, num in press:
    if num > 1:
        count += num 

if s[0] == s[-1]:
    count -= press[0][1] 
print(count * k)

Failing test case input:
oo
13

Expected output:
13


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
k = int(input())
if len(s) == 1:
    print(k 
    exit()

press = []
temp = s[0]
cnt = 0
for i in range(len(s)):
    if temp == s[i]:cnt += 1
    else:
        press.append((temp, cnt))
        cnt = 1
        temp = s[i]
press.append((temp, cnt))

if len(press) == 1:
    print(len(s) * k 
    exit()

count = 0
for str, num in press:
    if num > 1:
        count += num 

count *= k
if s[0] == s[-1]:
    count -= (press[0][1] 
print(count)
Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
k = int(input())

def count_min_operation(s):
	i = 0
	j = 0
	count = 0
	length = len(s)
	while j < length-1:
		c = 1
		for j in range(i+1,length):
			if s[i] == s[j]:
				c += 1
			else:
				count += c 
				i = j
				break
		if j == length-1:
			count += c 

	return count

s1 = count_min_operation(s)
s2 = count_min_operation(s+s)

update = s2 - s1

print(s1 + update * (k-1))


Failing test case input:
enomftppfemtrdecpnemeedn
102348

Expected output:
204696


Actual output:
2456352


Fixed submission (verdict: Accepted):
import sys

s = input()
k = int(input())

def count_min_operation(s):
	i = 0
	j = 0
	count = 0
	length = len(s)
	while j < length-1:
		c = 1
		for j in range(i+1,length):
			if s[i] == s[j]:
				c += 1
			else:
				count += c 
				i = j
				c = 1
				break

		if j == length-1:
			count += c 

	return count

for i in range(len(s)-1):
	if s[i] != s[i+1]:
		s1 = count_min_operation(s)
		s2 = count_min_operation(s+s)
		update = s2 - s1
		print(s1 + update * (k-1))
		sys.exit()

print(k * len(s)

Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = list(input()) * 2
K = int(input())
Len_S2 = len(S)
Len_S1 = Len_S2 
count1 = 0
count2 = 0
for i in range(Len_S2-1):
    if S[i] == S[i+1]:
        if i < Len_S1 - 1:
            count1 += 1
        if i < Len_S2:
            count2 += 1
        S[i+1] = "1"
diff = count2 - count1
print(count1 + diff * (K-1))


Failing test case input:
enomntppfdntedecpedmredn
4847126

Expected output:
4847126


Actual output:
2


Fixed submission (verdict: Accepted):
S = list(input()) * 2
K = int(input())
Len_S2 = len(S)
Len_S1 = Len_S2 
count1 = 0
count2 = 0
tmp = all(c == S[0] for c in S[:Len_S1:])
for i in range(Len_S2-1):
    if S[i] == S[i+1]:
        if i < Len_S1 - 1:
            count1 += 1
        if i < Len_S2:
            count2 += 1
        S[i+1] = "1"
diff = count2 - count1
if tmp and K >= 3 and Len_S1 % 2 != 0:
    print((count1 + (diff - 1) * (K-1)) + (1 * (K 
else:
    print(count1 + diff * (K-1))

Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
if __name__ == '__main__':
    s = list(input())
    k = int(input())
    if len(s) == 1:
        print(0)
        exit(0)

    ans = 0
    for i in range(len(s) - 1):
        if s[i] == s[i + 1]:
            s[i + 1] = '-1'
            ans += 1
    if s[0] == s[-1]:
        ans += 1
    print(ans * k)


Failing test case input:
hssih
2

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
if __name__ == '__main__':
    s = list(input())
    ss = s + s
    k = int(input())
    if len(set(s)) == 1:
        print(len(s) * k 
        exit(0)

    tmp, tmp2 = 0, 0
    for i in range(len(s) - 1):
        if s[i] == s[i + 1]:
            tmp += 1
            s[i + 1] = '-1'
    for i in range(len(s) * 2 - 1):
        if ss[i] == ss[i + 1]:
            tmp2 += 1
            ss[i + 1] = '-1'
    print(tmp + (tmp2 - tmp) * (k - 1))
Problem: p02891
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
K = int(input())

focus_c = S[0]
consecutive_s = S[0]
focus_s_array = []
for s in S[1:]:
    if s == focus_c:
        consecutive_s += s
    else:
        focus_s_array.append(consecutive_s)
        focus_c = s
        consecutive_s = s
else:
    focus_s_array.append(consecutive_s)


cost = 0
for fsa in focus_s_array:
    cost += len(fsa) 
ans = cost * K

if len(focus_s_array) == 1:
    if len(focus_s_array[0]) % 2 == 1:
        ans += K - 1
elif (focus_s_array[0][0] == focus_s_array[-1][0]) and (len(focus_s_array[0]) + len(focus_s_array[-1])) % 2 == 0:
    ans += K - 1

print(ans)


Failing test case input:
enomntppfdntedecpedmredn
2389896

Expected output:
2389896


Actual output:
57357504


Fixed submission (verdict: Accepted):
S = input()
K = int(input())


if len(set(list(S))) == 1:
    print(len(S) * K 
    exit()

focus_c = S[0]
consecutive_s = S[0]
focus_s_array = []
for s in S[1:]:
    if s == focus_c:
        consecutive_s += s
    else:
        focus_s_array.append(consecutive_s)
        focus_c = s
        consecutive_s = s
else:
    focus_s_array.append(consecutive_s)


cost = 0
for fsa in focus_s_array:
    cost += len(fsa) 
ans = cost * K

if (focus_s_array[0][0] == focus_s_array[-1][0]) and ((len(focus_s_array[0]) + len(focus_s_array[-1])) % 2 == 0):
    ans += K - 1

print(ans)

Problem: p02891
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def count_changes(s, k, prev=None):
    count = 0
    for _ in range(k):
        for cur in s:
            if cur == prev:
                count += 1
                prev = None
            else:
                prev = cur
    return count


if __name__ == '__main__':
    s = input()
    k = int(input())
    if k <= 3:
        print(count_changes(s, k))
    else:
        base_count = count_changes(s, 3)
        d, rest = divmod(k, 3)
        res = base_count * d
        if rest:
            res += count_changes(s, rest, s[-1])
        elif s[0] == s[-1]:
            res += (d - 1)
        print(res)


Failing test case input:
rr
597

Expected output:
597


Actual output:
795


Fixed submission (verdict: Accepted):
def count_changes(s, k, prev=None):
    count = 0
    for _ in range(k):
        for cur in s:
            if cur == prev:
                count += 1
                prev = None
            else:
                prev = cur
    return count, prev


if __name__ == '__main__':
    s = input()
    k = int(input())
    if len(set(s)) == 1:
      print((len(s) * k) 
      exit()
    if k <= 10 ** 8:
        print(count_changes(s, k)[0])
    else:
        base_count, prev = count_changes(s, 3)
        d, rest = divmod(k, 3)
        res = base_count * d
        if rest:
            res += count_changes(s, rest, prev)[0]
        elif s[0] == prev:
            res += (d - 1)
        print(res)
Problem: p02891
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = list(map(str, input().strip()))
k = int(input())

pre = 0
cnt = 1
ans = 0
for i in s:
    if i == pre:
        cnt += 1
    else:
        ans += cnt 
        cnt = 1
    pre = i
pcnt = cnt
for i in s:
    if i == pre:
        cnt += 1
    else:
        ans += cnt 
        cnt = 0
        break

if cnt:
    ans += cnt

print(ans * k)


Failing test case input:
rr
826

Expected output:
826


Actual output:
4130


Fixed submission (verdict: Accepted):
s = list(map(str, input().strip()))
k = int(input())

pre = 0
cnt = 1
ans = 0
for i in s:
    if i == pre:
        cnt += 1
    else:
        ans += cnt 
        cnt = 1
    pre = i

ans += cnt

if cnt == len(s):
    print((cnt*k)
    exit(0)
pcnt = cnt
dcnt = 0
for i in s:
    if i == pre:
        cnt += 1
    else:
        dcnt = cnt - pcnt
        break

if dcnt % 2 and pcnt % 2:
    ans = ans * k + k - 1
else:
    ans *= k

print(ans)
Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
alist = list(map(int, input().split()))

aset = set(alist)
xalist = [int(x * 0.5) for x in aset]
amax = max(aset)



llcm = lcm(*xalist)
base_llcm = lcm_base(llcm, amax)


ans = (m-llcm) 
print(max(ans, 0))

Failing test case input:
2 46
10 10

Expected output:
5


Actual output:
41


Fixed submission (verdict: Accepted):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
aset = list(x 

llcm = lcm(*aset)

for a in aset:
    if (llcm 
        ans = 0
        break
else:
    ans = (m 

print(ans)

Problem: p02814
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = map(int,input().split())
l = list(map(int,input().split()))

import math

def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 

ans = 1
tf = True

for i in l:
    i /= 2
    ans = lcm(ans, i)
    if (ans / i) % 2 == 0 or ans > m:
        print(0)
        tf = False
        break

if tf == True:
    print(round(m / (ans * 2)))

Failing test case input:
2 46
10 10

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
l = list(map(int,input().split()))

def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 

ans = 1
tf = True

for i in l:
    i 
    ans = lcm(ans, i)
    if (ans 
        print(0)
        tf = False
        break

if tf == True:
    print(m

Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
from functools import reduce

n,m = map(int, input().split())
A = list(map(int, input().split()))

def lcm_base(x,y):
  return x*y

def lcm(target_list):
  return reduce(lcm_base, target_list)

if reduce(math.gcd, A)%2:
  min_x = int(lcm(A)*0.5)
  ans = m
  print(ans)
else:
  print(0)

Failing test case input:
3 010
14 11 2

Expected output:
0


Actual output:
10


Fixed submission (verdict: Accepted):
import math
from functools import reduce

n,m = map(int, input().split())
A = list(map(int, input().split()))

def lcm_base(x,y):
  return x*y

def lcm(target_list):
  return reduce(lcm_base, target_list)

A_gcd = reduce(math.gcd, A)
flg = True

for a in A:
  if a
    flg = False
    break
    
if flg:
  min_x = int(lcm(A))
  ans = m
  print(ans)
else:
  print(0)
Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
import fractions
import math
from functools import reduce
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

def lcm_base(x, y):
    return (x * y) 

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

N, M = map(int, input().split())
a = [int(x) for x in input().split()]
half_lcm = lcm_list(a) 
if half_lcm > M:
    print(0)
    exit()

print(round(M / half_lcm / 2))


Failing test case input:
2 50
4 10

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
import sys

import math
from functools import reduce
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
stdin = sys.stdin

def gcd(a,b):
  while b:a,b=b,a%b
  return a

def lcm(x, y):
    return (x * y) 

def lcm_list(l):
    return reduce(lcm, l, 1)

i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()

N, M = i_l()
a = i_l()
half_lcm = lcm_list(a) 

for i in a:
    if half_lcm 
        print(0)
        exit()

print(((M

Problem: p02814
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = map(int,input().split())
l = list(map(int,input().split()))

import math

def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x%y)
def lcm(x, y):
    return x * y / gcd(x, y)

ans = 1
tf = True

for i in l:
    i /= 2
    ans = lcm(ans, i)
    if (ans / i) % 2 == 0 or ans > m:
        print(0)
        tf = False
        break

if tf == True:
    print(math.ceil(m / (ans * 2)))

Failing test case input:
2 12
10 10

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
l = list(map(int,input().split()))

def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 

ans = 1
tf = True

for i in l:
    i 
    ans = lcm(ans, i)
    if (ans 
        print(0)
        tf = False
        break

if tf == True:
    print(m

Problem: p02814
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N, M = map(int,input().split())
A = list(map(int,input().split()))


import sys
from math import gcd
def lcm(a,b):
    return a

ans = 0
L = 1
for i in range(N):
    L = lcm(L, A[i])
    if L>2*M:
        print(0)
        sys.exit()

L2 = L
L1 = L

ans = M
print(ans)


Failing test case input:
1 001
17 25 5

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N, M = map(int,input().split())
A = list(map(int,input().split()))


import sys
from math import gcd
def lcm(a,b):
    return a

ans = 0
L = 1
for i in range(N):
    L = lcm(L, A[i])
    if L>2*M:
        print(0)
        sys.exit()

L2 = L
L1 = L
for a in A:
    if (L
        print(0)
        sys.exit()
ans = M
print(ans)
Problem: p02814
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = map(int,input().split())
l = list(map(int,input().split()))

import math

def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x%y)
def lcm(x, y):
    return x * y / gcd(x, y)

ans = 1
tf = True

for i in l:
    i /= 2
    ans = lcm(ans, i)
    if (ans / i) % 2 == 0:
        print(0)
        tf = False
        break
    if ans > m:
        print(0)
        tf = False
        break

if tf == True:
    print(math.ceil(m / (ans * 2)))

Failing test case input:
2 12
10 10

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
l = list(map(int,input().split()))

def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 

ans = 1
tf = True

for i in l:
    i 
    ans = lcm(ans, i)
    if (ans 
        print(0)
        tf = False
        break

if tf == True:
    print(m

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def gcd(x,y):
    if y == 0:
        return x
    else:
        return gcd(y,x%y)

def lcm(x,y):
    return x*y

n,m = map(int,input().split())
a = [int(i) for i in input().split()]
na = [int(i*0.5) for i in a]
l = 1
for i in range(n):
    l = lcm(l,na[i])

l2 = l*2
if l-1 > m:
    ans = 0
else:
    ans = (m-(l-1))

print(ans)


Failing test case input:
2 50
12 10

Expected output:
0


Actual output:
21


Fixed submission (verdict: Accepted):
def gcd(x,y):
    if y == 0: return x
    else: return gcd(y,x%y)

def lcm(x,y): return x*y

def f(x):
    cnt = 0
    while(x%2==0):
        x 
        cnt += 1
    return cnt

n,m = map(int,input().split())
a = [int(i) for i in input().split()]
na = [i

t = f(na[0])
for i in range(1,n):
    if t != f(na[i]):
        print(0)
        exit()

l = na[0]
for i in range(1,n): l = lcm(l,na[i])

if m < l:
    ans = 0
else:
    ans = 1 + (m-l)

print(ans)

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

N,M = map(int,input().split())
A = list(set((map(int,input().split()))))




from functools import reduce

def gcd(a,b):
  if b == 0:
    return a
  else:
    return gcd(b,a % b)
    
def lcm(a,b):
    return (a * b) 

def gcd_list(numbers):
    return reduce(gcd, numbers)

def lcm_list(numbers):
    return reduce(lcm, numbers, 1)
    
LCM = lcm_list(A)

if LCM == 0:
  print("No")
  
else:
  print(math.ceil(M / LCM))

Failing test case input:
3 011
14 11 4

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
import fractions
from functools import reduce

N,M = map(int,input().split())
A = list(set((map(lambda x : int(x) 

def lcm(a,b):
  return (a * b) 
def gcd_list(numbers):
  return reduce(fractions.gcd, numbers)
def lcm_list(numbers):
  return reduce(lcm, numbers, 1)

LCM = lcm_list(A)
ans = (M 

for a in A[1:]:
  if (LCM 
    ans = 0
    break
    
print(ans)
Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from math import gcd
N, M = map(int, input().split())
A = list(map(int, input().split()))
lcm = 1
for a in A:
    lcm = lcm * a 
    if lcm > M*2:
        print(0)
        exit()
ans = M 
print(ans)


Failing test case input:
5 1000000000
6 6 2 6 2

Expected output:
166666667

Actual output:
1000000000


Fixed submission (verdict: Accepted):
from math import gcd
N, M = map(int, input().split())
A = list(map(int, input().split()))
lcm = 1
for a in A:
    lcm = lcm * a 
    if lcm > M*2:
        print(0)
        exit()
for a in A:
    if lcm 
        print(0)
        exit()
ans = M 
print(ans)

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
amax = max(aset)


llcm = lcm(*aset)
minllcm = llcm 

ans = (m-minllcm) 
print(max(ans, 0))



Failing test case input:
5 1000000000
6 6 2 6 2

Expected output:
166666667

Actual output:
999999988


Fixed submission (verdict: Accepted):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
aset = list(x 

llcm = lcm(*aset)

for a in aset:
    if (llcm 
        ans = 0
        break
else:
    ans = (m 

print(ans)

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

import sys
import fractions
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N, M, *A = map(int, read().split())

f_ = A[0] 
for i in range(1, N):
    f_ = f_ * A[i] 

if f_ == 0:
    cnt = 0
else:
    cnt = M 
print(cnt)


Failing test case input:
2 85
6 10

Expected output:
3


Actual output:
85


Fixed submission (verdict: Accepted):

import sys
from fractions import gcd
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

INF = 10**18
N, M, *A = map(int, read().split())

lcm = 1
for a in A:
    a 
    lcm *= a 
    
    if lcm > M:
        print(0); sys.exit()
for a in A:
    if lcm % a == 0:
        print(0); sys.exit()

print((M
Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) for x in input().split()]

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)
        if x > 2*m: return 0

    ans = m 
    print(ans)

if __name__ == '__main__':
    abc150_d()

Failing test case input:
3 100
13 22 40

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) 

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)

    valid = True
    for a in A:
        if (x 
            valid = False
            break

    if valid: ans = (m 
    else: ans = 0
    print(ans)

if __name__ == '__main__':
    abc150_d()

Problem: p02814
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = map(int,input().split())
l = list(map(int,input().split()))
 
import math
 
def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 
 
ans = 1
tf = True
 
for i in l:
    i 
    ans = lcm(ans, i)
    if (ans / i) % 2 == 0 or ans > m:
        print(0)
        tf = False
        break
 
if tf == True:
    print(round(m / (ans * 2)))

Failing test case input:
2 46
10 10

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
l = list(map(int,input().split()))

def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)
def lcm(x, y):
    return (x * y) 

ans = 1
tf = True

for i in l:
    i 
    ans = lcm(ans, i)
    if (ans 
        print(0)
        tf = False
        break

if tf == True:
    print(m

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a

def lcm(p,q):
    return p*q
n,m = map(int, input().split())
a = list(map(int, input().split()))
x = 1
for i in range(n):
    a[i] = a[i]
    x = lcm(x,a[i])
p = m
if p%2==0:
    ans = p
else:
    ans = p
print(ans)


Failing test case input:
2 62
6 10

Expected output:
2


Actual output:
62


Fixed submission (verdict: Accepted):
from fractions import gcd
def lcm(p,q):
    return p*q

n,m = map(int, input().split())
a = list(map(int, input().split()))
x = 1
for i in range(n):
    a[i] = a[i]
    x = lcm(x,a[i])
    if x>m:
        print(0)
        exit()
for i in range(n):
    if (x
        print(0)
        exit()
p = m
if p%2==0:
    ans = p
else:
    ans = p
print(ans)
Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) for x in input().split()]

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = A[0]
    for a in A:
        x = lcm(x, a)
        if x > 2*m: break

    ans = m 
    print(ans)

if __name__ == '__main__':
    abc150_d()

Failing test case input:
2 50
6 10

Expected output:
2

Actual output:
50


Fixed submission (verdict: Accepted):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) 

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)

    valid = True
    for a in A:
        if (x 
            valid = False
            break

    if valid: ans = (m 
    else: ans = 0
    print(ans)

if __name__ == '__main__':
    abc150_d()

Problem: p02814
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

N, M = list(map(int, input().split()))
a = list(map(int, input().split()))



def lcm(a, b): 
    def gcd(a, b):  
        if b == 0:
            return a
        else:
            return gcd(b, a % b)
    
    return a * b 

c = 1
for e in a:
    c = lcm(c, e)

ans = 0
M *= 2
if c <= M:
    ans += 1
    M -= c
ans += M 
print(ans)


Failing test case input:
3 010
14 3 40

Expected output:
0


Actual output:
20


Fixed submission (verdict: Accepted):
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

N, M = list(map(int, input().split()))
a = list(map(int, input().split()))



def lcm(a, b): 
    def gcd(a, b):  
        if b == 0:
            return a
        else:
            return gcd(b, a % b)
    
    return a * b 

c = 1
for e in a:
    c = lcm(c, e 
hoge = [ (c 

if all(hoge):
    ans = 0
    if c <= M:
        ans += 1
        M -= c
    ans += M 
    print(ans)
else:
    print(0)

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
alist = list(map(int, input().split()))

xalist = [int(x * 0.5) for x in alist]
amax = max(alist)

llcm = lcm(*xalist)
base_llcm = lcm_base(llcm, amax)


ans = (m-llcm) 
print(max(ans, 0))


Failing test case input:
2 12
10 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
aset = list(x 

llcm = lcm(*aset)

for a in aset:
    if (llcm 
        ans = 0
        break
else:
    ans = (m 

print(ans)
Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
alist = list(map(int, input().split()))

aset = set(alist)
xalist = [int(x * 0.5) for x in aset]
amax = max(aset)

print(xalist)

llcm = lcm(*xalist)
base_llcm = lcm_base(llcm, amax)


ans = (m-llcm) 
print(max(ans, 0))


Failing test case input:
3 100
14 35 8

Expected output:
0


Actual output:
[4, 17, 7]
0


Fixed submission (verdict: Accepted):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
aset = list(x 

llcm = lcm(*aset)

for a in aset:
    if (llcm 
        ans = 0
        break
else:
    ans = (m 

print(ans)

Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) for x in input().split()]

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)
        if x > 2*m: break

    ans = m 
    print(ans)

if __name__ == '__main__':
    abc150_d()

Failing test case input:
2 46
10 10

Expected output:
5


Actual output:
46


Fixed submission (verdict: Accepted):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) 

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)

    valid = True
    for a in A:
        if (x 
            valid = False
            break

    if valid: ans = (m 
    else: ans = 0
    print(ans)

if __name__ == '__main__':
    abc150_d()

Problem: p02814
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) for x in input().split()]

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)
        if x > 2*m: return print(0)

    ans = m 
    print(ans)

if __name__ == '__main__':
    abc150_d()

Failing test case input:
5 1000000000
6 6 2 6 2

Expected output:
166666667

Actual output:
1000000000


Fixed submission (verdict: Accepted):
def abc150_d():
    n, m = (int(x) for x in input().split())
    A = [int(x) 

    from math import gcd
    def lcm(a, b):
        return a * b 

    x = 1
    for a in A:
        x = lcm(x, a)

    valid = True
    for a in A:
        if (x 
            valid = False
            break

    if valid: ans = (m 
    else: ans = 0
    print(ans)

if __name__ == '__main__':
    abc150_d()
Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
import sys

def gcd(a,b):
    if b>a:
        a,b=b,a
    while b:
        a,b=b, a%b
    return a

def f(n):
    return int(n)
n,m=map(int,input().split())
a=list(map(f,input().split()))
for i in range(n):
    if a[i]%2==0: print(0),sys.exit()

tmp=1
for i in range(n):
    tmp=(tmp*a[i])


ans=m

if m%(tmp*2)>=tmp: ans+=1
print(ans)

Failing test case input:
2 85
6 10

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
import math
import sys

def gcd(a,b):
    if b>a:
        a,b=b,a
    while b:
        a,b=b, a%b
    return a

def f(n):
    return int(n)

n,m=map(int,input().split())
a=list(map(f,input().split()))


tmp=1
for i in range(n):
    tmp=(tmp*a[i])
    if tmp>m:
        print(0)
        sys.exit()


for i in range(n):
    if (tmp
        print(0)
        sys.exit()

ans=m
if m%(tmp*2)>=tmp: ans+=1
print(ans)

Problem: p02814
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
amax = max(aset)


llcm = lcm(*aset)
minllcm = llcm 

ans = (m-minllcm) 
print(max(ans, 0))

Failing test case input:
2 12
10 10

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
import fractions
import functools

def lcm_base(x, y):
    return (x * y) 

def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


n, m = map(int, input().split())
aset = set(map(int, input().split()))
aset = list(x 

llcm = lcm(*aset)

for a in aset:
    if (llcm 
        ans = 0
        break
else:
    ans = (m 

print(ans)
Problem: p04037
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = [int(i) for i in input().split()]

a.sort(reverse=True)


ans = False

for i in range(n):
    if len(a)==1:
        ans = ((a[i]%2)==1)
        break
    if len(a) == i+1:
        ans = (((a[i]-i) % 2) == 0)
        break
    if i==a[i]:
        for j in range(i-1,n):
            if i>=a[j]:
                ans = (((j-i)%2)==1)
    if i>=a[i+1]:
        ans = ans or (((a[i]-i-1)%2)==1)
    if i>=a[i+1] or i==a[i]:
        break


if ans:
    print("First")
else:
    print("Second")

Failing test case input:
3
7 1 1

Expected output:
Second


Actual output:
First


Fixed submission (verdict: Accepted):
n = int(input())
a = [int(i) for i in input().split()]

a.sort(reverse=True)
a.append(0)


ans = False

for i in range(n):
    if i+1>=a[i+1]:
        ans=(((a[i]-i)%2)==0)
        for j in range(i+1,n+1):
            if a[j]<=i:
                ans = ans or (((i-j)%2)==0)
                break
        break

if ans:
    print("First")
else:
    print("Second")

Problem: p04037
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = [int(i) for i in input().split()]

a.sort(reverse=True)


ans = False

for i in range(n):
    if len(a)==1:
        ans = ((a[i]%2)==1)
        break
    if len(a) == i+1:
        ans = (((a[i]-i) % 2) == 0)
        break
    if i==a[i]:
        for j in range(i-1,n):
            if i>a[j]:
                ans = (((j-i)%2)==1)
    if i>=a[i+1]:
        ans = ans or (((a[i]-i-1)%2)==1)
    if i>=a[i+1] or i==a[i]:
        break


if ans:
    print("First")
else:
    print("Second")

Failing test case input:
3
7 1 1

Expected output:
Second


Actual output:
First


Fixed submission (verdict: Accepted):
n = int(input())
a = [int(i) for i in input().split()]

a.sort(reverse=True)
a.append(0)


ans = False

for i in range(n):
    if i+1>=a[i+1]:
        ans=(((a[i]-i)%2)==0)
        for j in range(i+1,n+1):
            if a[j]<=i:
                ans = ans or (((i-j)%2)==0)
                break
        break

if ans:
    print("First")
else:
    print("Second")
Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]/2)

Failing test case input:
5 24 13

Expected output:
60


Actual output:
32.5


Fixed submission (verdict: Accepted):
a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
-8 -4 1

Expected output:
16


Actual output:
16.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l=list(map(int,input().split()))
l.remove(max(l))
print(l[0]*l[1]/2)


Failing test case input:
5 18 13

Expected output:
45


Actual output:
32.5


Fixed submission (verdict: Accepted):
l=list(map(int,input().split()))
l.remove(max(l))
print(l[0]*l[1]

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c = map(int,input().split())
print(a*b/2)

Failing test case input:
45 25 110

Expected output:
562


Actual output:
562.5


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

AB, BC, CA = list(map(int, input().split()))
print(AB*BC/2)


Failing test case input:
5 13 13

Expected output:
32


Actual output:
32.5


Fixed submission (verdict: Accepted):

AB, BC, CA = list(map(int, input().split()))
print(AB*BC

Problem: p03145
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
148 1 101

Expected output:
74


Actual output:
74.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
ab,bc,ca = map(int,input().split())
print((ab*bc)/2)

Failing test case input:
92 6 110

Expected output:
276


Actual output:
276.0


Fixed submission (verdict: Accepted):
ab,bc,ca = map(int,input().split())
print((ab*bc)

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = map(int, input().split())
print(a * b / 2)

Failing test case input:
-6 -4 0

Expected output:
12


Actual output:
12.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
-1 8 -1

Expected output:
-4


Actual output:
-4.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, y, z = map(int, input().split())
print(x*y/2)


Failing test case input:
45 30 53

Expected output:
675


Actual output:
675.0


Fixed submission (verdict: Accepted):
x, y, z = map(int, input().split())
print(x*y
Problem: p03145
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

def main():
    x, y, z = map(int, input().split())
    print(x * y / 2)


main()


Failing test case input:
2 11 010

Expected output:
11


Actual output:
11.0


Fixed submission (verdict: Accepted):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

def main():
    x, y, z = map(int, input().split())
    print(x * y 


main()

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split());print(a*b/2)

Failing test case input:
1 6 13

Expected output:
3


Actual output:
3.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=sorted(map(int,input().split()))
print((b*a)/2)


Failing test case input:
4 -39 1

Expected output:
-78


Actual output:
-19.5


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
3 -46 0

Expected output:
-69


Actual output:
-69.0


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

Problem: p03145
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
AB,BC,CA = sorted(map(int,input().split()))
print(AB*BC/2)


Failing test case input:
148 1 101

Expected output:
74


Actual output:
50.5


Fixed submission (verdict: Accepted):
AB,BC,CA = sorted(map(int,input().split()))
print(AB*BC

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=[int(i) for i in input().split()]
print((a*b)/2)

Failing test case input:
3 -47 -6

Expected output:
-71


Actual output:
-70.5


Fixed submission (verdict: Accepted):
a,b,c=[int(i) for i in input().split()]
print((a*b)

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=sorted(map(int,input().split()))
print(a*b/2)

Failing test case input:
5 24 13

Expected output:
60


Actual output:
32.5


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=sorted(map(int,input().split()))
print((b*c)/2)


Failing test case input:
3 -38 -2

Expected output:
-57


Actual output:
-3.0


Fixed submission (verdict: Accepted):
a,b,c=sorted(map(int,input().split()))
print((b*a)
Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

input = sys.stdin.readline


def main():
    a, b, c = map(int, input().split())
    print(a * b / 2)


if __name__ == "__main__":
    main()


Failing test case input:
4 -38 -2

Expected output:
-76


Actual output:
-76.0


Fixed submission (verdict: Accepted):
import sys

input = sys.stdin.readline


def main():
    a, b, c = map(int, input().split())
    print(a * b 


if __name__ == "__main__":
    main()

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
6 -18 1

Expected output:
-54


Actual output:
-54.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
abc = list(map(int, input().split()))
abc.sort()
print(abc[0]*abc[1]/2)

Failing test case input:
7 -21 1

Expected output:
-74


Actual output:
-10.5


Fixed submission (verdict: Accepted):
abc = list(map(int, input().split()))
print()
abc.sort()
print(abc[0]*abc[1]

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c = map(int,input().split())
print(a*b/2)

Failing test case input:
75 25 110

Expected output:
937


Actual output:
937.5


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c = map(int,input().split())
print(a*b/2)

Failing test case input:
118 1 101

Expected output:
59


Actual output:
59.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C =map(int,input().split())
print((A*B)/2)

Failing test case input:
5 -18 1

Expected output:
-45


Actual output:
-45.0


Fixed submission (verdict: Accepted):
A, B, C =map(int,input().split())
print((A*B)

Problem: p03145
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
A,B,C= map(int, input().split())
print(B*C/2)

Failing test case input:
26 1 -1

Expected output:
13


Actual output:
-0.5


Fixed submission (verdict: Accepted):
A,B,C= map(int, input().split())
print((A*B)

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = map(int, input().split())

if a > b and a > c:
  print(b * c / 2)
elif b > a and b > c:
  print(a * c / 2)
else:
  print(a * c / 2)


Failing test case input:
3 -38 -2

Expected output:
-57


Actual output:
38.0


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

if a > b and a > c:
  print(b * c 
elif b > a and b > c:
  print(a * c 
else:
  print(a * b

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,y,z = map(int, input().split())
print(x*y/2)

Failing test case input:
-12 -1 1

Expected output:
6


Actual output:
6.0


Fixed submission (verdict: Accepted):
x,y,z = map(int, input().split())
print(x*y
Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print((a*b)/2)

Failing test case input:
3 12 010

Expected output:
18


Actual output:
18.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int, input().split())
print(a*b)

Failing test case input:
1 18 100

Expected output:
9


Actual output:
18


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x, y, z = map(int,input().split())
print(x * y / 2)

Failing test case input:
5 24 13

Expected output:
60


Actual output:
60.0


Fixed submission (verdict: Accepted):
x, y, z = map(int,input().split())
print(x * y

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
(a, b, c) = map(int, input().split(' '))
if a*a + b*b == c*c:
    print(a*b)
elif b*b + c*c == a*a:
    print(b*c)
elif c*c + a*a == b*b:
    print(c*a)
    

Failing test case input:
3 -47 -6

Expected output:
-71


Actual output:

Fixed submission (verdict: Accepted):
(a, b, c) = map(int, input().split(' '))
if a*a + b*b == c*c:
    print(a*b
elif b*b + c*c == a*a:
    print(b*c
elif c*c + a*a == b*b:
    print(c*a

Problem: p03145
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
5 18 13

Expected output:
45


Actual output:
45.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(1/2*a*b)

Failing test case input:
7 -18 1

Expected output:
-63


Actual output:
-63.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c = map(int,input().split())
print(a*b/2)

Failing test case input:
4 -6 1

Expected output:
-12


Actual output:
-12.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
AB, BC, CA = map(int, input().split())
print(AB*BC/2)

Failing test case input:
7 -21 1

Expected output:
-74


Actual output:
-73.5


Fixed submission (verdict: Accepted):
AB, BC, CA = map(int, input().split())
print(AB*BC

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(a*b/2)

Failing test case input:
45 38 53

Expected output:
855


Actual output:
855.0


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

Problem: p03145
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
ab, bc, _ = map(int, input().split())
print(ab * bc / 2)


Failing test case input:
5 -18 1

Expected output:
-45


Actual output:
-45.0


Fixed submission (verdict: Accepted):
ab, bc, _ = map(int, input().split())
print(ab * bc