Problem:


Score : 100 points

Problem Statement

You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.

An example of a trapezoid

Find the area of this trapezoid.

Constraints

1≦a≦100

1≦b≦100

1≦h≦100

All input values are integers.

h is even.

Input

The input is given from Standard Input in the following format:

a
b
h

Output

Print the area of the given trapezoid. It is guaranteed that the area is an integer.

Sample Input 1

3
4
2

Sample Output 1

7

When the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.

Sample Input 2

4
4
4

Sample Output 2

16

In this case, a parallelogram is given, which is also a trapezoid.



Sample input:
3
4
2


Sample output:
7

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

rst = ((a+b)*h)/2

print(int(rst))

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

S=(a+b)*h/2

print(int(S))

Submission status: Accepted

Solution code:
a = [int(input()) for _ in range(3)]
print(int((a[0]+a[1])*a[2]/2))

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    h = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:

def read_input():
    a = int(input())
    b = int(input())
    h = int(input())
    return a, b, h


def submit():
    a, b, h = read_input()
    area = (a + b) * h / 2

    print(int(area))

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
print(int((a + b) * h >> 1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def solve(a, b, h):
    print(int((a+b)*h/2))

if __name__ == '__main__':
    a  = int(input())
    b = int(input())
    h = int(input())

    solve(a, b, h)

Submission status: Accepted

Solution code:
a=[int(input()) for i in range(3)]
print((a[0]+a[1])*a[2]//2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a = int(input())
b = int(input())
h = int(input())

if  a >= 1 and a <= 100 \
and b >= 1 and b <= 100 \
and h >= 1 and h <= 100 \
and h % 2 == 0 :
  ans = int((a + b) * h / 2)
  
  print(ans)

Submission status: Accepted

Solution code:
import functools

import os
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def Yesif(cond):
    print('Yes' if cond else 'No')


def YESIF(cond):
    print('YES' if cond else 'NO')


def yesif(cond):
    print('yes' if cond else 'no')


a, b, c = inpm(3)

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
#045 a
a = int(input())
b = int(input())
h = int(input())

print(int(0.5*(a+b)*h))

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    a = int(input())
    b = int(input())
    h = int(input())

    return (a+b) * h // 2


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
# ABC045A - 台形 / Trapezoids
a, b, h = list(map(int, [input().rstrip() for _ in range(3)]))
print(int((a + b) * h / 2))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h  =int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = [int(input()) for _ in range(3)]

a, b, h = n

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
S = ((a+b)*h)/2
print(int(S))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

A = int(input())
B = int(input())
H = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
input=[]
for i in range(3):
  input.append(stdin.readline().strip())
  
a=int(input[0])
b=int(input[1])
h=int(input[2])
sum=(a+b)*h/2
print(int(sum))

Submission status: Accepted

Solution code:
a, b, h = eval("int(input())," * 3)
print(int((a + b) * h / 2))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
s = (a+b)*h / 2
print(int(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

a = int(input())
b = int(input())
h= int(input())

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

Submission status: Accepted

Solution code:
A, B, C = map(int, open(0).read().split())
print(int((A+B)*C/2))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
k = round((a+b)*h/2)
print(k)

Submission status: Accepted

Solution code:
a,b,h = [int(input()) for i in range(3)]
ans = int((a+b)*h/2)
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
s = int((a + b) * h / 2)
print(s)

Submission status: Accepted

Solution code:
a,b,h=map(int,open(0))
 
print((a+b)*h//2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a, b, h=map(int, open(0).read().split())
print (int((a+b)/2*h))

Submission status: Accepted

Solution code:
a,b,h=[int(input())for _ in range(3)];print((a+b)*h//2)

Submission status: Accepted

Solution code:
a, b, h = map(int, open(0).read().split())
S = int((a + b) * h / 2)
print(S)

Submission status: Accepted

Solution code:
def trapezoids(a: int, b: int, h: int) -> int:
    return (a + b) * h // 2


if __name__ == "__main__":
    a, b, h = [int(input()) for _ in range(3)]
    ans = trapezoids(a, b, h)
    print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

a = int(input())
b = int(input())
h = int(input())

x = (a+b)*h/2

print(round(x))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())  

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
ans = int((a+b)*h/2)
print(ans)

Submission status: Accepted

Solution code:
from functools import reduce

def main():
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10

    # 1文字のみを読み込み
    # s = input().rstrip()
    
    # スペース区切りで標準入力を配列として読み込み
    # s = input().rstrip().split(' ')

    # 1文字ずつ標準入力を文字列として読み込み
    # s = list(input().rstrip())
    
    # 位置文字ずつ標準入力を数値配列として読み込み
    # X = [int(_) for _ in input().split()]
    
    N = int(input().rstrip())
    K = int(input().rstrip())
    X = int(input().rstrip())
    print(int((N+K)*X/2))   
   
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(int((int(input())+int(input()))*int(input())*0.5))

Submission status: Accepted

Solution code:
a,b,h = eval('int(input()),'*3)
print(int((a+b)*h*0.5))

Submission status: Accepted

Solution code:
import math 
a = int(input())
b = int(input())
c = int(input())

print(math.floor((a+b)*c/2))

Submission status: Accepted

Solution code:
a=int(input());b=int(input());h=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
a,b,h = IR(3)
print(((a+b)*h)//2)
#B

#C

#D
"""
h,w,n = LI()
dp = [0 for i in range(10)]
dp[0] = (h-2)*(w-2)
q = defaultdict(int)
for i in range(n):
    a,b = LI()
    a -= 1
    b -= 1
    for i in [-1,0,1]:
        for j in [-1,0,1]:
            if 0 < a+i < h-1 and 0 < b+j < w-1:
                q[(a+i)*w+b+j] += 1
                dp[q[(a+i)*w+b+j]] += 1
                dp[q[(a+i)*w+b+j]-1] -= 1
for i in dp:
    print(i)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
def main():
  a = [int(input()) for i in range(3)]
  print(int((a[0]+a[1])*a[2]/2))

if __name__=='__main__':main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

area = int((a + b) * h /2)

print(area)

Submission status: Accepted

Solution code:
a,b,h = [int(input()) for _ in '111']
print((a+b)*h//2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    h = int(input())
    print((a+b)*h//2)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, h = map(int, [input() for x in range(3)])
print((a+b)*h>>1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#45
a = int(input())
ans = (a+ int(input()))/2
print(int(ans * int(input())))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

res = (a+b)*h/2
print('{0:.0f}'.format(res))

Submission status: Accepted

Solution code:
from sys import exit
# A,B,C = [int(n) for n in input().split()]
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h//2)
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
exit()

Submission status: Accepted

Solution code:
[a,b,h]=[int(input()) for i in range(3)]
print((a+b)*h//2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
l = [int(input()) for _ in range(3)]
print(int((l[0]+l[1])*l[2]/2))

Submission status: Accepted

Solution code:
list = []
for i in range(3):
    list.append(int(input()))

print(int((list[0]+list[1])*list[2]/2))

Submission status: Accepted

Solution code:
num = [int(input()) for i in range(3)]
 
print(int((num[0]+num[1])*num[2]/2))

Submission status: Accepted

Solution code:
def main() -> None:
    a = int(input())
    b = int(input())
    h = int(input())
    print((a + b) * h // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# 整数の入力
b = int(input())
# 整数の入力
h = int(input())
# スペース区切りの整数の入力

# 出力
print("{:.0f}".format((a+b)*h/2))

Submission status: Accepted

Solution code:
from itertools import combinations, product


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

def lcm(a, b):
    return a * b // gcd(a, b)


def get(fmt):
    ps = input().split()
    r = []
    for p, t in zip(ps, fmt):
        if t == "i":
            r.append(int(p))
        if t == "f":
            r.append(float(p))
        if t == "s":
            r.append(p)
    if len(r) == 1:
        r = r[0]
    return r

def put(*args, **kwargs):
    print(*args, **kwargs)


def rep(n, f, *args, **kwargs):
    return [f(*args, **kwargs) for _ in range(n)]
    
def rep_im(n, v):
    return rep(n, lambda: v)
    
YES_NO = ["NO", "YES"]


a, b, h = rep(3, get, "i")

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
print(int((b+a)*0.5 * h))

Submission status: Accepted

Solution code:
a,b,h=[int(input()) for i in range(3)]
print(round((a+b)*h/2))

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for i in range(3)]
print(h*(a+b)//2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
l=[int(input()) for _ in range(3)]
print(int((l[0]+l[1])/2*l[2]))

Submission status: Accepted

Solution code:
# coding: utf-8
a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2)

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for _ in range(3)]
ans = (int((a+b)*h/2))
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
ans = (a+b) * h // 2
print(ans)

Submission status: Accepted

Solution code:
x = [int(input()) for i in range(3)]
print(((x[0]+x[1])*x[2])//2)

Submission status: Accepted

Solution code:
a = int(input().rstrip())
b = int(input().rstrip())
h = int(input().rstrip())

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=int(input())
s=int((a+b)*c/2)
print(s)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())
s=(a+b)*h/2
print(int(s))

Submission status: Accepted

Solution code:
from sys import stdin
a = int(stdin.readline().rstrip())
b = int(stdin.readline().rstrip())
h = int(stdin.readline().rstrip())
print(int((a+b)*h/2))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for _ in range(3)]
area = (a + b) * h // 2
print(area)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a = ni()
b = ni()
h = ni()

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

print(((a+b)*h)//2) # 台形の面積

Submission status: Accepted

Solution code:
# coding: utf-8
a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2)

Submission status: Accepted

Solution code:
a,b,h = [int(input()) for i in range(3)]

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

Submission status: Accepted

Solution code:
# ABC 045 A - 台形 / Trapezoids
a = int(input())
b = int(input())
h = int(input())
print( int((a + b)/2 * h))

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=int(input())
print((a+b)*c//2)

Submission status: Accepted

Solution code:
a,b,h=[int(input()) for i in range(3)];print(int((a+b)*h/2))

Submission status: Accepted

Solution code:
lst = [int(input()) for x in range(3)]
print((lst[0] + lst[1]) * lst[2] // 2)

Submission status: Accepted

Solution code:
a,b,h = map(int,[input() for _ in range(3)])
print((a+b)*h//2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
print(int((1/2)*(a+b)*h))

Submission status: Accepted

Solution code:

a = int(input())
b = int(input())
h = int(input())

ans = (a + b) * h // 2

print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

ans = (a + b) * h // 2

print(ans)
print()

Submission status: Accepted

Solution code:
x=lambda:int(input())
print((x()+x())*x()//2)

Submission status: Accepted

Solution code:
N = int(input())
K = int(input())
X = int(input())
print(int((N + K) * X / 2))

Submission status: Accepted

Solution code:
a,b,h=[int(input()) for i in range(3)]
#print(a,b,h)
area = (a+b)*h/2
print(int(area))

Submission status: Accepted

Solution code:
a,b,h=int(input()),int(input()),int(input());print((a+b)*h//2)

Submission status: Accepted

Solution code:
""" AtCoder """

a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
print(round((a+b)*h*0.5))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
a=eval(input())
b=eval(input())
h=eval(input())
s=int((a+b)*h/2)
print(s)

Submission status: Accepted

Solution code:
a,b,h = int(input()),int(input()),int(input())
print((a+b)*h//2)

Submission status: Accepted

Solution code:
a,b,h = list(map(int, [input() for x in range(3)]))
print( ( (a + b) * h ) // 2 )

Submission status: Accepted

Solution code:
a, b, h = (int(input()) for i in range(3))
print((a + b) * h // 2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
s = (a+b) * h // 2
print(s)

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for _ in range(3)]
print(int(((a+b)*h)/2))

Submission status: Accepted

Solution code:
print(int((int(input())+int(input()))*int(input())*1/2))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
 
c = a+b
d = h/2
 
e = int(c*d)

print(e)

Submission status: Accepted

Solution code:
def execute(a, b, h):
    return (a + b) * h // 2


if __name__ == '__main__':
    a = int(input())
    b = int(input())
    h = int(input())
    print(execute(a, b, h))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
H = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

area=(a+b)*h >>1

print(area)

Submission status: Accepted

Solution code:
a,b,h=(int(input()) for _ in range(3))
print(int((a+b)*.5*h))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
ans = int((a + b) * h / 2)
print(ans)

Submission status: Accepted

Solution code:
a, b, h = (int(input()) for i in [0] * 3)
print(int((a + b) * h / 2))

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for i in range (3)]
print(int((a+b)*h/2))

Submission status: Accepted

Solution code:
print(eval('(%s+%s)*%s//2'%eval('input(),'*3)))

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    h = int(input())
    print((a + b) * h // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    a = int(input())
    b = int(input())
    h = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for _ in range(3)]
print(int((a + b) * h / 2))

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

#x = input().split()
#y = input().split()
a = []
x = int(input())
y = int(input())
z = int(input())
#for i in range(len(x)):
#   a.append(int(x[i]))
print((x+y)*int(z/2))

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
h=int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())
h = int(input())
print("{}".format((a+b) * h // 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(int((int(input())+int(input()))*(int(input())/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


def main():
    a = int(input())
    b = int(input())
    h = int(input())

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


main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
s = int((a + b)*h/2)
print(s)

Submission status: Accepted

Solution code:
a, = map(int, raw_input().split())
b, = map(int, raw_input().split())
h, = map(int, raw_input().split())
print (a+b)*h//2

Submission status: Accepted

Solution code:
a, b, h = [input() for i in range(3)]
print (b - a) * h / 2 + a * h

Submission status: Accepted

Solution code:
head = int(input())
bottom = int(input())
height = int(input())

ans = int(((head + bottom) * height) / 2)
print(ans)

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for x in range(3)]
print((a + b) * h // 2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a = [int(input()) for i in range(3)]
print(int((a[0]+a[1])*a[2]/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())
s = (a+b)*h/2
print(int(s))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i=input;print(i()+i())*i()/2

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

S = (a+b) * h / 2

print(int(S))

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=int(input())
print(int((a+b)/2*c))

Submission status: Accepted

Solution code:
def main():
    a, b, h = [int(input()) for _ in range(3)]
    s = (a + b) * h / 2
    print(int(s))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
i=lambda:int(input());a=i();b=i();h=i();print((a+b)*h//2)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = int(input())
print((a + b) * c // 2)

Submission status: Accepted

Solution code:
roop_num = 3
a,b,h = [int(input()) for i in range(roop_num)]
print(int((a+b)*h*0.5))

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    h = int(input())
    print(int((a + b) * h / 2))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#! /usr/bin/python3
# 台形 / Trapezoids
"""
    1 ≤ a ≤ 100
    1 ≤ b ≤ 100
    1 ≤ h ≤ 100
    入力で与えられる値はすべて整数
    h は偶数
"""

def main():
    """
    台形の面積を出力する関数
    """
    a = int(input())
    b = int(input())
    h = int(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
length = int(input())

area = int(((a + b) * length) / 2)

print(area)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a,b,h = [int(input()) for x in range(3)]
print((a+b)*(h//2))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=(a+b)*c/2
print(int(d))

Submission status: Accepted

Solution code:
x=int(input())
y=int(input())
z=int(input())
print(int((x+y)*z/2))

Submission status: Accepted

Solution code:
a, b, h = [int(input()) for i in range(1, 4)]
print((a + b) * h // 2)

Submission status: Accepted

Solution code:
abh = [int(input()) for i in range(3)]
print((abh[0]+abh[1])*(abh[2]//2))

Submission status: Accepted

Solution code:
l = [int(input()) for i in range(1, 4)]
print((l[0] + l[1]) * l[2] // 2)

Submission status: Accepted

Solution code:
#coding: utf-8
print((int(input()) + int(input())) * int(input()) //2)

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
h = int(input())

ans = (a + b) * h / 2

print(int(ans))

Submission status: Accepted

Solution code:
print(int((int(input())+int(input()))*int(input())/2))

Submission status: Accepted

Solution code:
x,y,h=int(input()),int(input()),int(input())
print(int((x+y)*h/2))

Submission status: Accepted

Solution code:
l=[int(input()) for _ in [0]*3]
print((l[0]+l[1])*l[2]//2)