ZhenlongDai/ACPR huggingface dataset:
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M, X, Y = map(int, input().split())
x = [int(_) for _ in input().split()]
y = [int(_) for _ in input().split()]

x_max = max(x)
y_min = min(y)

if (y_min-x_max > 0) and (Y-X > 0) and ((y_min>X) or (x_max<Y)):
    print("No War")
else:
    print("War")

Failing test case input:
5 3 6 8
-1 0 1 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
N, M, X, Y = map(int, input().split())
x = [int(_) for _ in input().split()]
y = [int(_) for _ in input().split()]

x_max = max(x)
y_min = min(y)

if (y_min-x_max > 0) and (Y-X > 0) and (X<y_min) and (x_max<Y):
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
input = sys.stdin.readline

n, m, X, Y = map(int, input().split())
x = map(int, input().split())
y = map(int, input().split())

x_max = max(x)
y_min = min(y)

for i in range(X + 1, Y + 1):
    if x_max < i and i <= y_min:
        print(i)
        print('No War')
        exit()
print('War')

Failing test case input:
3 0 10 61
8 1 15
16 23

Expected output:
No War


Actual output:
16
No War


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline

n, m, X, Y = map(int, input().split())
x = map(int, input().split())
y = map(int, input().split())

x_max = max(x)
y_min = min(y)


for i in range(X + 1, Y + 1):
    if x_max < i and i <= y_min:
        print('No War')
        exit()
print('War')

Problem: p03251
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
if max(x) < min(y):
  print("No War")
else:
  print("War")


Failing test case input:
5 3 6 8
-1 0 2 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
if max(x) < min(y) and X < min(y) <= Y:
	print("No War")
else:
	print("War")

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m, X, Y = map(int, input().split())

x = list(map(int, input().split()))
y = list(map(int, input().split()))

max_x = max(x)
min_y = min(y)

if Y-X >=1 and min_y - max_x >= 1 and max_x - Y >= 1 and min_y - X >= 1:
    print('No War')
else:
    print('War')


Failing test case input:
0 2 10 27
8 15 15
16 22

Expected output:
No War


Actual output:
War


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

x = list(map(int, input().split()))
y = list(map(int, input().split()))

max_x = max(x)
min_y = min(y)
ans = 'War'
for z in range(X+1, Y+1):
    if z > max_x and z <= min_y:
        ans = 'No War'
        break

print(ans)
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
max_x = max(x)
min_y = min(y)

if max_x < min_y:
	print('No War')
else:
	print('War')

Failing test case input:
5 3 6 8
-1 0 1 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
max_x = max(max(x), X)
min_y = min(min(y), Y)

if max_x < min_y:
	print('No War')
else:
	print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,X,Y = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))

if (X < Y) and max(x) <min(y) and max(x) <= X and min(y) >= Y:
    print("No War")
else:
    print("War")

Failing test case input:
0 2 10 27
8 15 15
16 22

Expected output:
No War


Actual output:
War


Fixed submission (verdict: Accepted):
n,m,X,Y = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))

Z = min(min(y),Y)
if (X < Z) and max(x) < Z :
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math

N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

Z = math.ceil(max(x))

if X + 1 < Y and min(y) >= Z:
  print('No War')
else:
  print('War')

Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
import math

N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

for Z in range(-100, 101, 1):
  if X < Z and Z <= Y and max(x) < Z and min(y) >= Z:
    print('No War')
    break
else:
  print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,x,y = map(int,input().split())
y = list(map(int, input().split()))
x = list(map(int, input().split()))

x = sorted(x)
y = sorted(y)

if y[0]<=x[-1] or x[-1]+1<=y[0]:
  print("War")
else:
  print("No War")

Failing test case input:
3 3 10 40
8 1 15
16 23

Expected output:
No War


Actual output:
War


Fixed submission (verdict: Accepted):
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))

x = sorted(x)
y = sorted(y)

if max(x[-1], X) < min(y[0], Y):
  print("No War")
else:
  print("War")
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,x,y=map(int,input().split())
xs=list(map(int,input().split()))
ys=list(map(int,input().split()))
x_=max(xs)
y_=min(ys)
for z in range(x_,y_+1):
    if x<z<=y:
        print('No War')
        exit()
print('War')


Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n,m,x,y=map(int,input().split())
xs=list(map(int,input().split()))
ys=list(map(int,input().split()))
x_=max(xs)
y_=min(ys)
for z in range(x_+1,y_+1):
    if x<z<=y:
        print('No War')
        exit()
print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m, X, Y = map(int, input().split())
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))
x_max = max(xs)
y_min = min(ys)
if y_min >= x_max:
    for z in list(range(x_max, y_min + 1)):
        if (z > X) and (z <= Y):
            print('No War')
            break
    else:
        print('War')
else:
    print('War')

Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n, m, X, Y = map(int, input().split())
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))
x_max = max(xs)
y_min = min(ys)
def get_war(x_max, y_min, X, Y):
    if y_min > x_max:
        for z in list(range(x_max+1, y_min + 1)):
            if (z > X) and (z <= Y):
                return 'No War'
            else:
                pass
        else:
            return 'War'
    else:
        return 'War'
print(get_war(x_max, y_min, X, Y))

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,x,y=map(int,input().split())
s=list(map(int,input().split()))
t=list(map(int,input().split()))
c=0
max_x=max(s)
min_y=min(t)

for i in range(x+1,y+1):
    if i>max_x and i<=min_y:
        c+=1
if c>0:
    print('No war')
else:
    print('War')
    

Failing test case input:
3 0 10 61
8 1 15
16 34

Expected output:
No War


Actual output:
No war


Fixed submission (verdict: Accepted):
n,m,x,y=map(int,input().split())
s=list(map(int,input().split()))
t=list(map(int,input().split()))
c=0
max_x=max(s)
min_y=min(t)

for i in range(x+1,y+1):
    if i>max_x and i<=min_y:
        c+=1
if c>0:
    print('No War')
else:
    print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M, X, Y = list(map(int, input().split()))
X_list = list(map(int, input().split()))
Y_list = list(map(int, input().split()))

try:
    Z = range(X + 1, Y + 1)
    if max(X_list) < min(Z) and max(Z) <= min(Y_list):
        print("No War")
    else:
        print("War")
except ValueError:
    print("War")


Failing test case input:
3 2 10 40
8 15 15
16 22

Expected output:
No War


Actual output:
War


Fixed submission (verdict: Accepted):
N, M, X, Y = list(map(int, input().split()))
X_list = list(map(int, input().split()))
Y_list = list(map(int, input().split()))

for Z in range(X + 1, Y + 1):
    if max(X_list) < Z and Z <= min(Y_list):
        print("No War")
        exit()

print("War")
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M,X,Y = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
x = max(A)
y = min(B)
 
if (Y >= x and y > X) and y >= x:
  print('No War')
else:
  print('War')

Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
N,M,X,Y = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
x = max(X,max(A))
y = min(Y,min(B))
 
if Y >= x and y > X and y > x:
  print('No War')
else:
  print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,x,y = map(int,input().split())

x1 = max([int(i) for i in input().split()]) + 1
y1 = min([int(i) for i in input().split()])

if x1 <= y1 and x1 <= y and y1 > x:
    print('No war')
else:
    print('War')

Failing test case input:
3 2 10 20
8 15 12
16 22

Expected output:
No War


Actual output:
No war


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

x1 = max([int(i) for i in input().split()]) + 1
y1 = min([int(i) for i in input().split()])

if x1 <= y1 and x1 <= y and y1 > x:
    print('No War')
else:
    print('War')

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
d=""
if max(b)<=min(c):
    for i in range(min(c)-max(b)):
        if a[2]<max(b)+i+1<=a[3]:
            d="No War"
            break
        else:
            d="War"
else:
    d="War"

Failing test case input:
3 3 10 40
8 1 15
16 23

Expected output:
No War


Actual output:

Fixed submission (verdict: Accepted):
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
d=""
if max(b)<min(c):
    for i in range(min(c)-max(b)):
        if a[2]<max(b)+i+1<=a[3]:
            d="No War"
            break
        else:
            d="War"
else:
    d="War"
print(d)

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x_max = max(x)
y_min = min(y)

for z in range(-99, 101):
    if X < z <= Y and x_max <= z and y_min >= z:
        print("No War")
        break
else:
    print("War")

Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x_max = max(x)
y_min = min(y)

for z in range(-99, 101):
    if X < z <= Y and x_max < z and y_min >= z:
        print("No War")
        break
else:
    print("War")
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

n,m,x,y = map(int,input().split())
xi = list(map(int,input().split()))
yi = list(map(int,input().split()))

xi.sort()
xi.reverse()
yi.sort()

if xi[0]<yi[0]:
    print("No War")
else:
    print("War")


Failing test case input:
5 2 6 8
-1 0 1 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n,m,x,y = map(int,input().split())
xi = list(map(int,input().split()))
yi = list(map(int,input().split()))

xi.append(x)
yi.append(y)

xi.sort()
xi.reverse()
yi.sort()

if xi[0]<yi[0]:
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N,M,X,Y = map(int,input().split())

x = list(map(int,input().split()))
y = list(map(int,input().split()))
ans = 'War'
for i in range(-100,101):
    if X < i <= Y and max(x)<i and max(y)>=i:
        ans = 'No War'
        break
print(ans)

Failing test case input:
4 2 -55 -1
-20 -7 -35 -42
-22 75

Expected output:
War


Actual output:
No War


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

x = list(map(int,input().split()))
y = list(map(int,input().split()))
ans = 'War'
for i in range(-100,101):
    if X < i <= Y and max(x)<i and min(y)>=i:
        ans = 'No War'
        break
print(ans)

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,X,Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x.append(X)
y.append(Y)
x.sort()
y.sort()
if x[-1] < y[0]:
        print("NO WAR")
else:
        print("WAR")

Failing test case input:
0 0 10 40
8 1 15
16 23

Expected output:
No War


Actual output:
NO WAR


Fixed submission (verdict: Accepted):
n,m,X,Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x.append(X)
y.append(Y)
x.sort()
y.sort()
if x[-1] < y[0]:
        print("No War")
else:
        print("War")

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m, x, y = map(int, input().split())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))

X.sort()
Y.sort()

if X[-1] >= y or Y[0] <= x:
    print("War")
elif X[-1] > Y[0]:
    print("War")
else:
    print("No War")


Failing test case input:
3 2 10 40
8 11 9
16 11

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n, m, x, y = map(int, input().split())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))

X.sort()
Y.sort()

if X[-1] >= y or Y[0] <= x:
    print("War")
elif X[-1] >= Y[0]:
    print("War")
else:
    print("No War")
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M, X, Y = map(int, input().split())

xs = list(map(int, input().split()))
ys = list(map(int, input().split()))

if (max(xs) < min(ys)) and (X < Y):
    print("No War")
else:
    print("War")

Failing test case input:
5 3 6 8
-10 4 0 5 -100
101 6 14

Expected output:
War


Actual output:
No War


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

xs = list(map(int, input().split()))
xs.append(X)
ys = list(map(int, input().split()))
ys.append(Y)

if max(xs) < min(ys):
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m, X, Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
flg = 1
for z in range(X, Y + 1):
    if max(x) < z <= min(y):
        print("No War")
        flg = 0
        break
if flg:
    print("War")


Failing test case input:
5 2 6 8
-1 0 1 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n, m, X, Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
x.append(X)
y.append(Y)
if min(y) > max(x):
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
input()
print(['No War','War'][sorted([int(i) for i in input().split()])<sorted([int(i) for i in input().split()])])


Failing test case input:
3 2 10 20
8 15 12
16 22

Expected output:
No War


Actual output:
War


Fixed submission (verdict: Accepted):
a,b,x,y=map(int,input().split())
print(['War','No War'][sorted([x]+[int(i) for i in input().split()])[-1]<sorted([y]+[int(i) for i in input().split()])[0]])

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m,X,Y = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))

if (X < Y) and max(x) <min(y) and max(x) < X and min(y) >= Y:
    print("No War")
else:
    print("War")

Failing test case input:
0 0 10 40
8 1 15
16 23

Expected output:
No War


Actual output:
War


Fixed submission (verdict: Accepted):
n,m,X,Y = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))

Z = min(min(y),Y)
if (X < Z) and max(x) < Z :
    print("No War")
else:
    print("War")

Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
print('No War' if X<Y and max(x)<min(y) else 'War')

Failing test case input:
5 3 6 8
-10 3 1 5 -100
100 6 14

Expected output:
War

Actual output:
No War


Fixed submission (verdict: Accepted):
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))

print('No War' if min(min(y),Y)>max(max(x),X) else 'War')
Problem: p03251
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
maxX = max(x)
minY = min(y)
for i in range(X+1,Y,1):
  z = i
  if maxX < z and minY <= z:
    print('No War')
    exit()
print('War')

Failing test case input:
4 2 -55 -1
-20 -4 -35 -77
-22 75

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
maxX = max(x)
minY = min(y)
for i in range(X+1,Y,1):
  z = i
  if maxX < z and minY >= z:
    print('No War')
    exit()
print('War')

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

import math
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,m,x,y=nm()
X = nl()
Y = nl()
z = 0
if max(X)<min(Y):
    z=max(X)+1
else:
    print('War')
    exit()

if z>y:
    print('War')
    exit()

for i in range(z,y+1):
    if x<i<=y:
        print('No War')
        exit()
print('War')


Failing test case input:
5 3 6 8
-10 3 1 5 -100
100 6 14

Expected output:
War

Actual output:
No War


Fixed submission (verdict: Accepted):

import math
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,m,x,y=nm()
X = nl()
Y = nl()
Z = []
z = 0
if max(X)<min(Y):
    z=max(X)+1
else:
    print('War')
    exit()

for i in range(z,min(Y)+1):
    Z.append(i)


if len(Z)==0:
    print('War')
    exit()

is_war = True
for i in range(len(Z)):
    if x<Z[i]<=y:
        is_war = False
    else:
        pass
if is_war:
    print('War')
else:
    print('No War')

Problem: p03251
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,m,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
x.sort()
y.sort()
for i in range(X+1,Y+1,1):
    if i <= y[0] and i > x[-1]:
        print("No war")
        break
else:
    print("War")

Failing test case input:
3 2 10 27
8 15 15
16 22

Expected output:
No War


Actual output:
No war


Fixed submission (verdict: Accepted):
n,m,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
x.sort()
y.sort()
for i in range(X+1,Y+1,1):
    if i <= min(y) and i > max(x):
        print("No War")
        break
else:
    print("War")
Problem: p03251
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,m,x,y = map(int,input().split())
a = list( map(int,input().split()) )
b = list( map(int,input().split()) )

ck = 0
for z in range(x,y+1):
  for i in a:
    if i >= z:
      break
  else:
    for i in b:
      if i < z:
        break
    else:
      ck = 1
      break

print('No War' if ck else 'War')

Failing test case input:
5 2 6 8
-1 0 1 5 -100
101 6 14

Expected output:
War


Actual output:
No War


Fixed submission (verdict: Accepted):
n,m,x,y = map(int,input().split())
a = list( map(int,input().split()) )
b = list( map(int,input().split()) )

ck = 0
ans = 0
for z in range(x+1,y+1):
  for i in a:
    if not i < z:
      break 
  else:
    for i in b:
      if not i >= z:
        break
    else:
      ck = 1
      ans = z
      break

print('No War' if ck else 'War')
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def prmry_num_li(mx_int = 10**5):
    li = [True for i in range(mx_int+1)]
    li[0] = False
    li[1] = False

    for i in range(2,int(mx_int**0.5)+1):
        if (li[i]):
            j = 2
            while (i*j <= mx_int):
                li[i*j] = False
                j+= 1
    lis = []
    for i in range(len(li)):
        if li[i]:
            lis.append(i)

    return lis


n = int(input())
li = prmry_num_li(n)
cnt = [0 for _ in range(len(li))]

for i in range(1,n+1):
    num = i
    plc = 0
    while(num!=1):
        if num%li[plc]==0:
            num/=li[plc]
            cnt[plc] += 1
        else:
            plc+=1

mod = 10**9+7
ans = 1 
for j in range(len(cnt)):
    ans *= (cnt[j]+1)%mod

print(ans)


Failing test case input:
1001

Expected output:
513172208


Actual output:
30858304982645483700639162498233088460059441564144203255402801269066428929755683225600000000000000000000000


Fixed submission (verdict: Accepted):
def prmry_num_li(mx_int = 10**5):
    li = [True for i in range(mx_int+1)]
    li[0] = False
    li[1] = False

    for i in range(2,int(mx_int**0.5)+1):
        if (li[i]):
            j = 2
            while (i*j <= mx_int):
                li[i*j] = False
                j+= 1
    lis = []
    for i in range(len(li)):
        if li[i]:
            lis.append(i)

    return lis


n = int(input())
li = prmry_num_li(n)
cnt = [0 for _ in range(len(li))]

for i in range(1,n+1):
    num = i
    plc = 0
    while(num!=1):
        if num%li[plc]==0:
            num/=li[plc]
            cnt[plc] += 1
        else:
            plc+=1

mod = 10**9+7
ans = 1 
for j in range(len(cnt)):
    ans = (ans*(cnt[j]+1))%mod

print(ans%mod)

Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def isPrime(n):
	i = 2
	while i*i <= n:
		if n % i == 0:
			return False
		i += 1
	return True

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

for i in range(2,N):
	if isPrime(i):
		Prime.append(i)
		
dic = {}
for i in Prime:
	dic[i] = 0
	
for k in range(2, 1001):
	for i in Prime:
		while k % i == 0:
			k /= i
			dic[i] += 1

ans = 1
for i in Prime:
	ans *= (1+dic[i])

print(ans % 1000000007)

Failing test case input:
185

Expected output:
591770736


Actual output:
429842762


Fixed submission (verdict: Accepted):
def isPrime(n):
	i = 2
	while i*i <= n:
		if n % i == 0:
			return False
		i += 1
	return True

N = 1000
Prime = []

for i in range(2,N):
	if isPrime(i):
		Prime.append(i)
		
dic = {}
for i in Prime:
	dic[i] = 0

p = int(input())
for k in range(2, p+1):
	for i in Prime:
		while k % i == 0:
			k /= i
			dic[i] += 1

ans = 1
for i in Prime:
	ans *= (1+dic[i])

print(ans % 1000000007)
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):









from math import floor as gs
N = int(input())


def fun_prime(k):
    counter = 0
    primes = [2, 3]

    for n in range(5, k+1, 2):
        isprime = True
        for i in range(1, len(primes)):
            if primes[i] ** 2 > n:
                break
            if n % primes[i] == 0:
                isprime = False
                break
        if isprime == True:
            primes.append(n)
    return(primes)
primes_N = fun_prime(N)

ans = 1
if N == 1:
    print(int(ans))
else:
    for prime in primes_N:
        e = 0
        power = prime
        while power <= N:
            e += gs(N/power)
            power = power * prime
        ans = ans * (e + 1)
    print(int(ans))    

Failing test case input:
1000

Expected output:
972926972

Actual output:
29999835807159345371240484098931829728259413697143443122742335764172165451110353469440000000000000000000000


Fixed submission (verdict: Accepted):









from math import floor as gs
N = int(input())


def fun_prime(k):
    counter = 0
    primes = [2, 3]

    for n in range(5, k+1, 2):
        isprime = True
        for i in range(1, len(primes)):
            if primes[i] ** 2 > n:
                break
            if n % primes[i] == 0:
                isprime = False
                break
        if isprime == True:
            primes.append(n)
    return(primes)
primes_N = fun_prime(N)

ans = 1
if N == 1:
    print(int(ans))
else:
    for prime in primes_N:
        e = 0
        power = prime
        while power <= N:
            e += gs(N/power)
            power = power * prime
        ans = ans * (e + 1)
    ans = ans % (10 ** 9 + 7)
    print(int(ans))

Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from collections import Counter
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(i)
    i += 1
  if n > 1:
    table.append(n)
  return table

n = int(input())
insu = []
for i in range(2, n+1):
  insu = insu + prime_decomposition(i)
insu_c = Counter(insu)

r = 1

for c in insu_c.values():
  r *= (c+1)
print(r)

Failing test case input:
1000

Expected output:
972926972

Actual output:
29999835807159345371240484098931829728259413697143443122742335764172165451110353469440000000000000000000000


Fixed submission (verdict: Accepted):
from collections import Counter
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(i)
    i += 1
  if n > 1:
    table.append(n)
  return table

n = int(input())
insu = []
for i in range(2, n+1):
  insu = insu + prime_decomposition(i)
insu_c = Counter(insu)

r = 1
mod = 10**9 + 7
for c in insu_c.values():
  r *= (c+1)
  r %= mod
print(r)
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

n = int(input())

lim = int(math.sqrt(n))


def isPrime(num):
    
    if num < 2: return False
    
    elif num == 2: return True
    
    elif num % 2 == 0: return False

    
    
    for i in range(3, math.floor(math.sqrt(num))+1, 2):
        if num % i == 0:
            return False

    
    return True


def callIsPrime(input_num):
    numbers = []
    
    for i in range(1, input_num):
        if isPrime(i):
            numbers.append(i)

    
    return numbers


prime = callIsPrime(n)

arr = [0] * len(prime)

for i in range(len(prime)):
  j = 1
  while n > prime[i] ** j :
    arr[i] += int(n / prime[i] ** j)
    j += 1
  
ans = 1
for i in arr :
  if i != 0:
    ans *= i+1

print(ans)

Failing test case input:
1000

Expected output:
972926972

Actual output:
29999835807159345371240484098931829728259413697143443122742335764172165451110353469440000000000000000000000


Fixed submission (verdict: Accepted):
import math

n = int(input())

lim = n


def isPrime(num):
    
    if num < 2: return False
    
    elif num == 2: return True
    
    elif num % 2 == 0: return False

    
    
    for i in range(3, math.floor(math.sqrt(num))+1, 2):
        if num % i == 0:
            return False

    
    return True


def callIsPrime(input_num):
    numbers = []
    
    for i in range(1, input_num):
        if isPrime(i):
            numbers.append(i)

    
    return numbers


prime = callIsPrime(n+1)

arr = [0] * len(prime)

for i in range(len(prime)):
  j = 1
  while n >= prime[i] ** j :
    arr[i] += int(n / prime[i] ** j)
    j += 1
  
ans = 1
for i in arr :
  if i != 0:
    ans *= i+1

print(ans % (10 ** 9 + 7))
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

n = int(input())

lim = int(math.sqrt(n))


def isPrime(num):
    
    if num < 2: return False
    
    elif num == 2: return True
    
    elif num % 2 == 0: return False

    
    
    for i in range(3, math.floor(math.sqrt(num))+1, 2):
        if num % i == 0:
            return False

    
    return True


def callIsPrime(input_num):
    numbers = []
    
    for i in range(1, input_num):
        if isPrime(i):
            numbers.append(i)

    
    return numbers


prime = callIsPrime(n)

arr = [0] * len(prime)

for i in range(len(prime)):
  j = 1
  while n > prime[i] ** j :
    arr[i] += int(n / prime[i] ** j)
    j += 1
  
ans = 1
for i in arr :
  if i != 0:
    ans *= i+1

print(ans % (10 ** 9 + 7))

Failing test case input:
149

Expected output:
978268519


Actual output:
989134263


Fixed submission (verdict: Accepted):
import math

n = int(input())

lim = n


def isPrime(num):
    
    if num < 2: return False
    
    elif num == 2: return True
    
    elif num % 2 == 0: return False

    
    
    for i in range(3, math.floor(math.sqrt(num))+1, 2):
        if num % i == 0:
            return False

    
    return True


def callIsPrime(input_num):
    numbers = []
    
    for i in range(1, input_num):
        if isPrime(i):
            numbers.append(i)

    
    return numbers


prime = callIsPrime(n+1)

arr = [0] * len(prime)

for i in range(len(prime)):
  j = 1
  while n >= prime[i] ** j :
    arr[i] += int(n / prime[i] ** j)
    j += 1
  
ans = 1
for i in arr :
  if i != 0:
    ans *= i+1

print(ans % (10 ** 9 + 7))

Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
insu_list = [[2, 0]]
ans = 1

for i in range(N):
    n = i+1
    for j in range(len(insu_list)):
        while n % insu_list[j][0] == 0:
            n /=insu_list[j][0]
            insu_list[j][1] += 1
    if n != 1:
        insu_list.append([n, 1])
print(insu_list)
for i in range(len(insu_list)):
    ans *= insu_list[i][1] + 1
print(ans)

Failing test case input:
116

Expected output:
582700142


Actual output:
[[2, 112], [3, 55], [5, 27], [7, 18], [11, 10], [13, 8], [17, 6], [19, 6], [23, 5], [29, 4], [31, 3], [37, 3], [41, 2], [43, 2], [47, 2], [53, 2], [59, 1], [61, 1], [67, 1], [71, 1], [73, 1], [79, 1], [83, 1], [89, 1], [97, 1], [101, 1], [103, 1], [107, 1], [109, 1], [113, 1]]
10402927527403192320


Fixed submission (verdict: Accepted):
N = int(input())
insu_list = [[2, 0]]
ans = 1

for i in range(N):
    n = i+1
    for j in range(len(insu_list)):
        while n % insu_list[j][0] == 0:
            n /=insu_list[j][0]
            insu_list[j][1] += 1
    if n != 1:
        insu_list.append([n, 1])
for i in range(len(insu_list)):
    ans *= insu_list[i][1] + 1
print(ans%(10**9+7))
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
k=[2]
mod=10**9+7
for i in range(2,n+1):
    for j in range(len(k)):
        if i%k[j]==0:
            break
    else:
        k.append(i)
h=[1 for i in range(len(k))]
print(k)
for i in range(2,n+1):
    c=0
    while i!=1:
        if i%k[c]==0:
            i=i/k[c]
            h[c]+=1
        else:
            c+=1
p=1
print(h)
for i in range(len(k)):
    p=(p*h[i])%mod
print(p)

Failing test case input:
185

Expected output:
591770736


Actual output:
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181]
[181, 90, 46, 30, 18, 16, 11, 10, 9, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
591770736


Fixed submission (verdict: Accepted):
n=int(input())
k=[2]
mod=10**9+7
for i in range(2,n+1):
    for j in range(len(k)):
        if i%k[j]==0:
            break
    else:
        k.append(i)
h=[1 for i in range(len(k))]
for i in range(2,n+1):
    c=0
    while i!=1:
        if i%k[c]==0:
            i=i/k[c]
            h[c]+=1
        else:
            c+=1
p=1
for i in range(len(k)):
    p=(p*h[i])%mod
print(p)

Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
div=1000000007

primedict= {i:True for i in range(2,N+1)}

for i in range(2,N+1):
        if primedict[i]==True:
                j=2
                while i*j<=N:
                        primedict[i*j]=False
                        j+=1

primelist = [i for i in  range(2,N+1) if primedict[i]==True]

print(primelist)

primecntdict={p:0 for p in primelist}

for n in range(2,N+1):
        for p in [p for p in primelist if p <= n]:
                while n%p==0:
                        n/=p
                        primecntdict[p]+=1

res=1
for p in primelist:
        res*=primecntdict[p]+1
        res%=div
print(primecntdict[2])
print(res)


Failing test case input:
185

Expected output:
591770736


Actual output:
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181]
180
591770736


Fixed submission (verdict: Accepted):
N=int(input())
div=1000000007

primedict= {i:True for i in range(2,N+1)}

for i in range(2,N+1):
        if primedict[i]==True:
                j=2
                while i*j<=N:
                        primedict[i*j]=False
                        j+=1

primelist = [i for i in  range(2,N+1) if primedict[i]==True]

primecntdict={p:0 for p in primelist}

for n in range(2,N+1):
        for p in [p for p in primelist if p <= n]:
                while n%p==0:
                        n/=p
                        primecntdict[p]+=1

res=1
for p in primelist:
        res*=primecntdict[p]+1
        res%=div

print(res)
Problem: p03828
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

import math
from collections import Counter
from collections import defaultdict
mod = 10**9+7 

def prime(n):
  for i in range(2, math.ceil(math.sqrt(n))+1):
    while n % i == 0:
      n /= i
      prime_count[i] += 1
  if n > 1:
    prime_count[int(n)] += 1

n = int(input())
a = 1
prime_count = defaultdict(int)
for i in range(1, n+1):
  prime(i)

print(prime_count)
ans = 1
for v in prime_count.values():
  ans *= (v+1)
  ans %= mod 
print(ans)





Failing test case input:
1000

Expected output:
972926972

Actual output:
defaultdict(<class 'int'>, {2: 994, 3: 498, 5: 249, 7: 164, 11: 98, 13: 81, 17: 61, 19: 54, 23: 44, 29: 35, 31: 33, 37: 27, 41: 24, 43: 23, 47: 21, 53: 18, 59: 16, 61: 16, 67: 14, 71: 14, 73: 13, 79: 12, 83: 12, 89: 11, 97: 10, 101: 9, 103: 9, 107: 9, 109: 9, 113: 8, 127: 7, 131: 7, 137: 7, 139: 7, 149: 6, 151: 6, 157: 6, 163: 6, 167: 5, 173: 5, 179: 5, 181: 5, 191: 5, 193: 5, 197: 5, 199: 5, 211: 4, 223: 4, 227: 4, 229: 4, 233: 4, 239: 4, 241: 4, 251: 3, 257: 3, 263: 3, 269: 3, 271: 3, 277: 3, 281: 3, 283: 3, 293: 3, 307: 3, 311: 3, 313: 3, 317: 3, 331: 3, 337: 2, 347: 2, 349: 2, 353: 2, 359: 2, 367: 2, 373: 2, 379: 2, 383: 2, 389: 2, 397: 2, 401: 2, 409: 2, 419: 2, 421: 2, 431: 2, 433: 2, 439: 2, 443: 2, 449: 2, 457: 2, 461: 2, 463: 2, 467: 2, 479: 2, 487: 2, 491: 2, 499: 2, 503: 1, 509: 1, 521: 1, 523: 1, 541: 1, 547: 1, 557: 1, 563: 1, 569: 1, 571: 1, 577: 1, 587: 1, 593: 1, 599: 1, 601: 1, 607: 1, 613: 1, 617: 1, 619: 1, 631: 1, 641: 1, 643: 1, 647: 1, 653: 1, 659: 1, 661: 1, 673: 1, 677: 1, 683: 1, 691: 1, 701: 1, 709: 1, 719: 1, 727: 1, 733: 1, 739: 1, 743: 1, 751: 1, 757: 1, 761: 1, 769: 1, 773: 1, 787: 1, 797: 1, 809: 1, 811: 1, 821: 1, 823: 1, 827: 1, 829: 1, 839: 1, 853: 1, 857: 1, 859: 1, 863: 1, 877: 1, 881: 1, 883: 1, 887: 1, 907: 1, 911: 1, 919: 1, 929: 1, 937: 1, 941: 1, 947: 1, 953: 1, 967: 1, 971: 1, 977: 1, 983: 1, 991: 1, 997: 1})
972926972


Fixed submission (verdict: Accepted):

import math
from collections import Counter
from collections import defaultdict
mod = 10**9+7 

def prime(n):
  for i in range(2, math.ceil(math.sqrt(n))+1):
    while n % i == 0:
      n /= i
      prime_count[i] += 1
  if n > 1:
    prime_count[int(n)] += 1

n = int(input())
a = 1
prime_count = defaultdict(int)
for i in range(1, n+1):
  prime(i)

ans = 1
for v in prime_count.values():
  ans *= (v+1)
  ans %= mod 
print(ans)
Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, h, = [int(input()) for i in range(3)]
print((a+b)*h/2)

 

Failing test case input:
3
-36
-2

Expected output:
33


Actual output:
33.0


Fixed submission (verdict: Accepted):
a, b, h = [int(input()) for _ in range(3)]
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())

print((a+b)*h/2)

Failing test case input:
4
-44
-2

Expected output:
40


Actual output:
40.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())

print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
up=int(input())
down=int(input())
h=int(input())
print((up+down)*h/2)

Failing test case input:
4
-44
-2

Expected output:
40


Actual output:
40.0


Fixed submission (verdict: Accepted):
up=int(input())
down=int(input())
h=int(input())
print((up+down)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input()) 
print((a+b)*h/2)

Failing test case input:
4
-27
-1

Expected output:
11


Actual output:
11.5


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a = int(input())
b= int(input())
h=int(input())

print((a+b)*h/2)

Failing test case input:
3
1
-24

Expected output:
-48


Actual output:
-48.0


Fixed submission (verdict: Accepted):
a = int(input())
b= int(input())
h=int(input())

print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print(0.5*(a+b)*h)

Failing test case input:
4
10
-5

Expected output:
-35


Actual output:
-35.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h/2)

Failing test case input:
4
1
-1

Expected output:
-3


Actual output:
-2.5


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,h=[int(input())for _ in range(3)];print((a+b)*h/2)

Failing test case input:
4
10
-8

Expected output:
-56


Actual output:
-56.0


Fixed submission (verdict: Accepted):
a,b,h=[int(input())for _ in range(3)];print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,h=map(int,open(0))

print((a+b)*h/2)

Failing test case input:
3
1
-7

Expected output:
-14


Actual output:
-14.0


Fixed submission (verdict: Accepted):
a,b,h=map(int,open(0))
 
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h/2)

Failing test case input:
3
1
-36

Expected output:
-72


Actual output:
-72.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h
Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, h = [int(input()) for _ in range(3)]
print(int(a+b)*h/2)



Failing test case input:
4
2
-10

Expected output:
-30


Actual output:
-30.0


Fixed submission (verdict: Accepted):
a, b, h = [int(input()) for _ in range(3)]
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, h = (int(input()) for u in range(3))
print((a + b) * h / 2)

Failing test case input:
4
4
4

Expected output:
16

Actual output:
16.0


Fixed submission (verdict: Accepted):
a, b, h = (int(input()) for u in range(3))
print((a + b) * h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)

Failing test case input:
4
1
-1

Expected output:
-3


Actual output:
-2.5


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a, b, h= (int(input()) for _ in range(3))
print((a+b)*h / 2)

Failing test case input:
3
0
29

Expected output:
43


Actual output:
43.5


Fixed submission (verdict: Accepted):
a, b, h= (int(input()) for _ in range(3))
print((a+b)*h

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

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)


Failing test case input:
4
-144
3

Expected output:
-210


Actual output:
-210.0


Fixed submission (verdict: Accepted):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((h*(a+b))/2)

Failing test case input:
3
2
-10

Expected output:
-25


Actual output:
-25.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h

Problem: p03997
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print(h*(a+b)/2)


Failing test case input:
3
1
29

Expected output:
58


Actual output:
58.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
c=int(input())

print((a+b)*c/2)

Failing test case input:
3
7
-65

Expected output:
-325


Actual output:
-325.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
c=int(input())

print((a+b)*c

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, h = (int(input()) for _ in range(3))
print(a * h + (b - a) * h / 2)

Failing test case input:
4
-144
3

Expected output:
-210


Actual output:
-210.0


Fixed submission (verdict: Accepted):
a, b, h = (int(input()) for u in range(3))
print((a + b) * h
Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)

Failing test case input:
4
10
-10

Expected output:
-70


Actual output:
-70.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())

menseki = (a + b) * h / 2

print(menseki)

Failing test case input:
4
5
0

Expected output:
0


Actual output:
0.0


Fixed submission (verdict: Accepted):
import math

a = int(input())
b = int(input())
h = int(input())
 
menseki = (a + b) * h / 2
 
print(math.floor(menseki))

Problem: p03997
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h/2)

Failing test case input:
3
1
-12

Expected output:
-24


Actual output:
-24.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h/2)

Failing test case input:
4
-27
-1

Expected output:
11


Actual output:
11.5


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
c=int(input())
print((a+b)*c/2)

Failing test case input:
4
8
6

Expected output:
36


Actual output:
36.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
c=int(input())
print((a+b)*c

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
c = int(input())
print((a+b)*c/2)

Failing test case input:
4
8
-6

Expected output:
-36


Actual output:
-36.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
c = int(input())
print((a+b)*c

Problem: p03997
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())

print(((a+b)*h)/2)



Failing test case input:
3
1
3

Expected output:
6


Actual output:
6.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())

print(((a+b)*h)

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*(h/2))

Failing test case input:
4
0
-11

Expected output:
-22


Actual output:
-22.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*(h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())
print((a+b)/2*2)

Failing test case input:
4
-51
14

Expected output:
-329


Actual output:
-47.0


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h
Problem: p03997
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b,c=map(int,open(0));print((a+b)*c/2)

Failing test case input:
3
-1
29

Expected output:
29


Actual output:
29.0


Fixed submission (verdict: Accepted):
a,b,c=map(int,open(0));print((a+b)*c

Problem: p03997
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
A = int(input())
B = int(input())
H = int(input())

print((A + B)*H/2)

Failing test case input:
3
2
-5

Expected output:
-13


Actual output:
-12.5


Fixed submission (verdict: Accepted):
A = int(input())
B = int(input())
H = int(input())

print(int((A + B)*H

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())

print(1/2 * (a + b) * h)

Failing test case input:
3
5
-65

Expected output:
-260


Actual output:
-260.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)



Failing test case input:
3
2
-7

Expected output:
-18


Actual output:
-17.5


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=[int(input()) for i in range(3)]
print((a[0]+a[1])*a[2]/2)

Failing test case input:
4
10
-5

Expected output:
-35


Actual output:
-35.0


Fixed submission (verdict: Accepted):
import math
a=[int(input()) for i in range(3)]
print(math.floor((a[0]+a[1])*a[2]/2))

Problem: p03997
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())

print((a + b) * h / 2)

Failing test case input:
4
10
-6

Expected output:
-42


Actual output:
-42.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())

print((a + b) * h

Problem: p03997
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=int(input())
b=int(input())
h=int(input())

print((a+b)*h/2)

Failing test case input:
3
0
29

Expected output:
43


Actual output:
43.5


Fixed submission (verdict: Accepted):
a=int(input())
b=int(input())
h=int(input())

print((a+b)*h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*(h/2))

Failing test case input:
3
5
-65

Expected output:
-260


Actual output:
-260.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*(h

Problem: p03997
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)

Failing test case input:
3
2
-98

Expected output:
-245


Actual output:
-245.0


Fixed submission (verdict: Accepted):
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h