Problem:


Score : 100 points

Problem Statement

There is a right triangle ABC with ∠ABC=90°.

Given the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.

It is guaranteed that the area of the triangle ABC is an integer.

Constraints

1 \leq |AB|,|BC|,|CA| \leq 100

All values in input are integers.

The area of the triangle ABC is an integer.

Input

Input is given from Standard Input in the following format:

|AB| |BC| |CA|

Output

Print the area of the triangle ABC.

Sample Input 1

3 4 5

Sample Output 1

6

This triangle has an area of 6.

Sample Input 2

5 12 13

Sample Output 2

30

This triangle has an area of 30.

Sample Input 3

45 28 53

Sample Output 3

630

This triangle has an area of 630.



Sample input:
3 4 5


Sample output:
6

Submission status: Accepted

Solution code:
a = sorted(list(map(int,input().split())))
print(a[0]*a[1]//2)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a > b and a > c:print(b * c // 2)
if b > a and b > c:print(a * c // 2)
if c > a and c > b:print(a * b // 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ab , bc, ca = map(int, input().split())
print((ab * bc) //2)

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, b, c = li_input()
    print(a * b // 2)


main()

Submission status: Accepted

Solution code:
a,b,c=[int(x) for x in input().split()]
print(a*b//2)

Submission status: Accepted

Solution code:
a = sorted([int(x) for x in input().split()])
print(a[0]*a[1]//2)

Submission status: Accepted

Solution code:
# N = input()   # 単純な入力
# input = list(input()) # ひとかたまりの文字列をリスト化
# N = int(input())  # 整数一つ
# input = input().split()   # スペース区切りを文字としてリスト化
X,Y,Z = map(int,input().split())  # ２個や３個の整数をそれぞれ取得
# input = list(map(int,input().split())) #整数リストの取得
print(int(X*Y/2))

Submission status: Accepted

Solution code:
a,b,c = (int(i) for i in input().split())
print(int(a*b/2))

Submission status: Accepted

Solution code:
import collections
import math
import re
import numpy
def ai():return input()#s
def a():return int(input())#a,n or k
def ma():return map(int, input().split())#a,b,c,d or n,k
def ms():return map(str, input().split())#,a,b,c,d
def lma():return list(map(int, input().split()))#x or y
def lms():return list(map(str, input().split()))#x or y
def say(i):return print("Yes" if i == 0 else "No")
def Say(i):return print("YES" if i == 0 else "NO")
k= []
l = []
f = 0
s=0
c=0
e =1

a,b,c=ma()
print((a*b)//2)

Submission status: Accepted

Solution code:
A,B,_ = map(int, raw_input().split())
print A*B/2

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,raw_input().split())

print a*b/2

Submission status: Accepted

Solution code:
def A():
    ab, bc, ca = map(int, input().split())
    print(int(bc * ab / 2))
A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
AB, BC, CA = int(input())

print((AB * BC) // 2)

Submission status: Runtime Error

Solution code:
ab, bc, ca = int(input())

print((ab * bc) // 2)

Submission status: Runtime Error

Solution code:
length1, length2, length3 = map(int, input().split())
area = AB * BC / 2
print(int(area))

Submission status: Runtime Error

Solution code:
AB, BC, CA = map(int, input().split())
if (1 <= AB & AB <= 100) & (1 <= BC & BC <= 100) & (1 <= CA & CA <= 100)
    S = int(AB * BC / 2)
    print(S)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())

print(a*b//2)

Submission status: Runtime Error

Solution code:
a=list(map(int,input().split()))
b=a.sorted()
print(b[1]*b[2])

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
print(min(a,b,c)*(sum([a,b,c]-min(a,b,c)-max(a,b,c)))//2)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().splis())
dai = max(a,b,c)
shou = min(a,b,c)
mid = a + b + c - dai - shou

print(shou * mid / 2)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
ls=[a,b,c]
ls.sort()
print(ls[0]*ls[1])

Submission status: Runtime Error

Solution code:
import numpy as np

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

s = 0

for i in range(max(h)+1):
    flag = False
    for j in range(n):
        if flag and h[j] == 0:
            s += 1
            flag = False
        elif not flag and h[j] > 0:
            flag = True

        h[j] = max(h[j]-1, 0)
    if flag:
        s += 1

print(s)

Submission status: Runtime Error

Solution code:
A=list(map(int,input().split()))
B=sort(A)
print(A[0]*A[1]/2)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
v=int(a)
u=int(b)
r=0.5*v*u
print(r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c = [int(i) for i in input().split()]
if a >= b and a >= c:
 print(c*b//2)
else if b >= c and b >= a:
 print(a*c//2)
else:
 print(a*b//2)

Submission status: Runtime Error

Solution code:
a, b, c = [int(i) for i in input().split()]
if a >= b and a >= c:
 print(c*b//2)
else if b >= c and b >= a:
 print(a*c//2)
else
 print(a*b//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = sorted(map,input().split())
print((l[0]*l[1])//2)

Submission status: Runtime Error

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

aa=min(a,b)
bb=min(cc,max(a,b))

print((aa*bb)//2)

Submission status: Runtime Error

Solution code:
def judge(n):
    if n % 2 == 0:
        return n / 2
    else:
        return 3*n + 1

s = int(input())
ans = 1

while s != 4 and s != 2 and s != 1:
    s = judge(s)
    ans += 1

print(ans+3)

Submission status: Runtime Error

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

lis = [a,b,c]
lis  = lis.remove(max(lis))

print(int(lis[0]*lis[1]/2))

Submission status: Runtime Error

Solution code:
L = list(map(int,input().split()))

print(L[0]*l[1]//2)

Submission status: Runtime Error

Solution code:
S = list(map(int,inpuy().split()))
S.sort()
print((S[0]+S[1])/2)

Submission status: Runtime Error

Solution code:
"""
8
4 23 75 0 23 96 50 100
"""

n = int(raw_input())
ais = map(int, raw_input().split(' '))

def f(ais):
	r = [0]
	for i in range(len(ais)):
		## looking for max
		if len(r) % 2:	
			if (ais[i-1] if i-1 >= 0 else 0) <= ais[i] > (ais[i+1] if i+1 < len(ais) else 0): 
				r.append(ais[i])
		else:
		## looking for min
			if (ais[i-1] if i-1 >= 0 else 0) >= ais[i] < (ais[i+1] if i+1 < len(ais) else 1000): 
				r.append(ais[i])

	t = 0
	for i in range(0,len(r),2):
		if i + 1 < len(r):
			u,v = r[i],r[i+1]
			t += v-u
	
	return t if len(ais) > 1 else ais[0]
print f(ais)

Submission status: Runtime Error

Solution code:
l=list(map(int,input()))

l.sort()

print(l[0]*l[1]//2)

Submission status: Runtime Error

Solution code:
x, y, z = map(int, intput().split())
print(x*y//2)

Submission status: Runtime Error

Solution code:
n = int(input())
Hs = list(map(int,input().split()))
f = [0 for _ in range(n)]
r = 1
c = 0
while r != n:
    r = 1
    for i in range(n):
        if f[i] < Hs[i] :
            if r > 0:
                c += 1
            r = 0
            f[i] += 1
        else:
            r += 1
    r -= 1   
print(c)

Submission status: Runtime Error

Solution code:
N=int(input())
h=list(map(int,input().split()))
Answer=h[0]
 
for i in range(N-1):
    if h[i]<=h[i+1]:
        m=h[i+1]-h[i]
        Answer=Answer+m
        
print(Answer)

Submission status: Runtime Error

Solution code:
n=0
Answer=0
N=int(input())
h=list(map(int,input().split()))
h.insert(0,0)

for i in range(N):
    if h[n]<=h[n+1]:
        m=h[n+1]-h[n]
        Answer=Answer+m
    else :
        pass
    n=n+1
print(Answer)

Submission status: Runtime Error

Solution code:
ab,c=map(int,input().split())
print(a*b//2)

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
print(A*B/2)

Submission status: Runtime Error

Solution code:
a,b,c=int(input().split())
print(a*b/2)

Submission status: Runtime Error

Solution code:
a,b,c=int(input().split())
print(a*b//2)

Submission status: Runtime Error

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

print(a*b // 2)

Submission status: Runtime Error

Solution code:
|AB|, |BC|, |CB| = map(int, input().split())
print(|AB|*|BC|//2)

Submission status: Runtime Error

Solution code:
ab,bc,ca = map(int,input().split())
print(ab * ac // 2)

Submission status: Runtime Error

Solution code:
def resolve():
    s=int(input())
    l=[s]
    for i in range(10**6):
        if l[i]%2==0:
            if l[i]//2 in l:
                print(i+2)
                break
            else:
                l.append(l[i]//2)
        else:
            if 3*l[i]+1 in l:
                print(i+2)
                break
            else:
                l.append(3 * l[i] + 1)
resolve()

Submission status: Runtime Error

Solution code:
a,b,c=[int(i) for i in input().split()]
prnit(a*b/2)

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
print(x*y/2)

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
print(x*y//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
print(x*y/2)

Submission status: Runtime Error

Solution code:
a,b,c=map(int, input().split())
print('{:．0f}'．format(a*b/2))

Submission status: Runtime Error

Solution code:

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

printint(((a*b*c)/2))

Submission status: Runtime Error

Solution code:
from collections import deque
n,k= map(int,input().split())
td=[]
for i in range(n):
    td.append(list(map(int,input().split())))
td.sort(key=lambda x:x[1],reverse=True)
select=[]
noselect=[]
cat=[]
for tdi in td:
    if tdi[0] in cat:
        noselect.append(tdi)
        continue
    select.append(tdi)
    cat.append(tdi[0])
    if len(select)==k:
        break
i=0
while len(select) < k:
    select.append(noselect[i])
    i+=1
noselect=noselect[i:]

print(8)

Submission status: Runtime Error

Solution code:
"""
5 3
1 9
1 7
2 6
2 5
3 1
->26
7 4
1 1
2 1
3 1
4 6
4 5
4 5
4 5
->25
6 5
5 1000000000
2 990000000
3 980000000
6 970000000
6 960000000
4 950000000
->4900000016
"""

from collections import deque
n,k= map(int,input().split())
td=[]
for i in range(n):
    td.append(list(map(int,input().split())))
td.sort(key=lambda x:x[1],reverse=True)
select=[]
noselect=[]
cat=[]
for tdi in td:
    if tdi[0] in cat:
        noselect.append(tdi)
        continue
    select.append(tdi)
    cat.append(tdi[0])
    if len(select)==k:
        break
i=0
while len(select) < k:
    select.append(noselect[i])
    i+=1
noselect=noselect[i:]

select.sort(key=lambda x:x[1])
select=deque(select)
#cat=list(set([tdi[0] for tdi in select]))
for no in noselect:
    if no[0] not in cat:
        continue
    if (2 * len(cat)) - 1 < no[1] - select[0][1]:
        select.popleft()
        select.append(no)
        cat=list(set([tdi[0] for tdi in select]))
    else:
        break
print(sum([tdi[1] for tdi in select])+(len(cat)**2))

Submission status: Runtime Error

Solution code:
line = input()
num = [int(n) for n in line.split()]
sides = [num_a, num_b, num_c]
sides.sort()
area = round(sides[0] * sides[1]/2)
print(area)

Submission status: Runtime Error

Solution code:
a, b, c = input().split(' ')
a = int(a)
b = int(b)
c = int(c)
area = int((a*b)/2)
print(area)

Submission status: Runtime Error

Solution code:
AB = int(input())
BC = int(input())
CA = int(input())
print((AB*BC)/2)

Submission status: Runtime Error

Solution code:
a, b, c = input().split(' ')
a = int(a)
b = int(b)
c = int(c)
area = int((0.5*a)*b)
print(area)

Submission status: Runtime Error

Solution code:
num = [int(n) for n in line.split()]
sides = [num_a, num_b, num_c]
sides.sort()
area = round(sides[0] * sides[1])/2
print(area)

Submission status: Runtime Error

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

print(int(a*B/2))

Submission status: Runtime Error

Solution code:
print(int(|AB|)*int(|BC|)%2)

Submission status: Runtime Error

Solution code:
print(str(|AB|)*str(|BC|)%2)

Submission status: Runtime Error

Solution code:

# -*- coding: utf-8 -*-
import bisect

N,K=map(int, input().split())
ts=[]
ds=[]
et={}


for i in range (0,K):
    t,d=map(int, input().split())
    
    ds.append(d)
    totmin='inf'

    #ds.append(d)
    bisect.insort(et.setdefault(t,[]),d)




for i in range (K,N):
    t,d=map(int, input().split())
    if t in et:
        dmin=et[t][0]
        if d>dmin:
            del et[t][0]
            bisect.insort(et[t],d)

            

    else:
        score=0
        place=-1
        l=len(et)
        for j in et.keys():
            dmin=et[j][0]

            if len(et[j])==1:
                if score<d-dmin:
                    place=j
                    score=d-dmin


            else:
                if score< d+2*l+1-dmin:
                    place=j
                    ddmin=dmin
                    score=d+2*l+1-dmin
            
        if place>=0:
            if len(et[place])==1:
                et.pop(place)
                et[t]=[d]

            else:
                et[t]=[d]
                del(et[place][0])


ans=len(et)**2
for i in et.keys():
    ans+=sum(et[i])

print(ans)

Submission status: Runtime Error

Solution code:
s = int(input())
lis = []

def func(n):
    if n%2 == 0:
        return n//2
    else:
        return 3*n+1
 
while func(s) !=4:
    print(func(s))
    s = func(s)
    lis.append(s)
    
print(int(len(lis)+5))

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print(a*b*(0.5)

Submission status: Runtime Error

Solution code:
x, y, z = map(int, raw_input().split())
return x*z/2

Submission status: Runtime Error

Solution code:
k = input().split()
a = k[0]
b = k[1]
c = k[2]
Sum = 0
h = max(k)

Buf = 1
del k[k.index[h]]

for i in k:
    buf = Buf*i

print(int(buf/2))

Submission status: Runtime Error

Solution code:
AB,BC,CA = map(int,input().split())

answer = (|BC| * |AB|) /2

print(int(answer))

Submission status: Runtime Error

Solution code:
n = int(input())
h = list(map(int,input().split()))
ans = h[0]
for i in range(1,n):
    if h[i-1] < h[i]:
        ans += h[i]-h[i-1]
print(ans)

Submission status: Runtime Error

Solution code:
|AB|,|BC|,|CA|=map(int,input().split())
print(|AB|*|BC|*1/2)

Submission status: Runtime Error

Solution code:
よこ，たて，_ = map(int,input().split())
こたえ=よこ*たて//2
print(こたえ)

Submission status: Runtime Error

Solution code:
|ab|,|bc|,|ca|=map(int,input().split())
print((|ab|*|bc|)//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(e) for e in input().split()]
tmp_mat = [[a[j]>i  for j in range(n)] for i in range(max(a))]
mat = [[a for a,b in zip(row,row[1:]+[False]) if a and a!=b]for row in tmp_mat]
print(sum([len(row)for row in mat]))

Submission status: Runtime Error

Solution code:
a, b , c = map(int(input().split()))
ans = a * b // 2
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=map(int,input().split())
A.sort()
print(A[0]*A[1]//2)

Submission status: Runtime Error

Solution code:
A=map(int,input().split())
A.sort()
print(A[1]*A[2]//2)

Submission status: Runtime Error

Solution code:
A = map(int,input().split())
print(0.5*A[0]*A[1])

Submission status: Runtime Error

Solution code:
A = map(int,input().split())
sort(A)
print(0.5*A[0]*A[1])

Submission status: Runtime Error

Solution code:
A = map(int,input().split())
A.remove(max(A))
print(0.5*(A[0])*(A[1]))

Submission status: Runtime Error

Solution code:
arr = list(map(int,input()))
print(int(arr[0]*arr[1]*0.5))

Submission status: Runtime Error

Solution code:
s=int(input())
def f(n):
	if n % 2 ==0:
		return int(n/2)
	else:
		return int(3*n+1)
a=[s]
while len(set(a)) == len(a):
		a.append(f(a[-1]))
		print(a)
print(len(a))

Submission status: Runtime Error

Solution code:
n=int(input())
l=[n]
i=1
while(True):
  i+=1
  if n%2==0:
    n=n/2
  else:
    n=3*n+1
  if n in l:
    print(i)
    break
  else:
    l+=[n]

Submission status: Runtime Error

Solution code:
ab, bc = map(int, input().split())
print(ab*bc/2)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = map(int,imput().split())
print(a*b//2)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,imput().split())
print(a*b/2)

Submission status: Runtime Error

Solution code:
h, w, _ = [int(i) for i in input()]
ans = h * w // 2
print(ans)

Submission status: Runtime Error

Solution code:
A,B = map(int, input(),split())
print(A*B/2)

Submission status: Runtime Error

Solution code:
A = int(input())
p = A
C = []
while A not in C:
  C.append(A)
  if A % 2 == 0:
    A = A//2
  else:
    A = A*3+1
print(len(C)+1)

Submission status: Runtime Error

Solution code:
AB, BC = map( int, input().split() )
print( ( AB * BC ) // 2 )

Submission status: Runtime Error

Solution code:
AB, BC = map( int, input().split() )
print( AB * BC // 2 )

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
amin = min(a)
before = 0
ans = amin
count = 0
for i in range(n):
    now = a[i]-amin
    if before - now < 0:
        count += abs(before - now)
    before = now
print(ans+count)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(min(a,b)*min(max(a,b),c))//2)

Submission status: Runtime Error

Solution code:
c,a,b = map(int,input().split())
area = c*a//2
print(ans)

Submission status: Runtime Error

Solution code:
c,a,b = map(int,input().split())
area = c * a // 2
print(ans)

Submission status: Runtime Error

Solution code:
A = int(input())
p = A
count = 0
if A == 1:
  count = 0
else:
  count =2
while A != 1:
  if A % 2 == 0:
    A = A // 2
    count = count + 1
  else:
    A = A * 3 + 1
    count = count + 1
print(count)

Submission status: Runtime Error

Solution code:
A = int(input())
count = 2
while A != 1:
  count = count + 1
  print(A)
  if A % 2 == 0:
    A = A // 2
  else:
    A = A * 3 + 1
print(count)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(d/2)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
d=a*B
print(d*0.5)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a*b/2)

Submission status: Runtime Error

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

print(a*b/2)

Submission status: Runtime Error

Solution code:
a, aa, aaa = list(map(int, input().plit()))

c = a * aa / 2

print(str(c))

Submission status: Runtime Error

Solution code:
A,B,C=map(int(),input().split())
print((A*B)//2)

Submission status: Runtime Error

Solution code:
A,B,C=map(int(),input().split())
print(A*B//2)

Submission status: Runtime Error

Solution code:
A,B,C=map(int(),input().split())
print(A*B/2)

Submission status: Runtime Error

Solution code:
x,y,r = map(int,input().split())

AREA = ((x*Y)/2)


print(AREA)

Submission status: Runtime Error

Solution code:
N = list(int, input().split())
N.sort()
print(N[0]*N[1]//2)

Submission status: Runtime Error

Solution code:
s = int(input())
 
t = [False] * 1000001
i = 1
while True:
  if t[s] == True:
    break
  t[s] = True
  i += 1
  if s % 2 == 0:
    s = s // 2
  else:
    s = 3 * s + 1
 
print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())
print(int(a*b*0.5))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
abc=list(map(int,input()))
abc.sort()
print(abc[0]*abc[1])

Submission status: Runtime Error

Solution code:
S = int(input())

INF = 10 ** 9 

list = [S]

con = 0

for i in range(INF):
	if S % 2 == 0:
		S = int(S / 2)
		list.append(S)
		con += 1
		print(S)
	else:
		S = (3 * S) + 1
		list.append(S)
		con += 1
		print(S)
	print(list)
	if S in list[:i]:
		break



print(con + 1)

Submission status: Runtime Error

Solution code:
X = list(map(int, input().split()))
X = sort()

print(X[0]*X[1]/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())	!map(int　でinputの中身をint性質にしている
print(b*a//2)					!//はint表示、/はreal表示。多分

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
print(rount(0.5*a*b))

Submission status: Runtime Error

Solution code:
D = int(input())

if D == 25:
    print("Christmas")

elif D == 24:
    print("Christmas Eve")

elif D == 23:
    print("Christmas Eve Eve")

else:
    print("Christmas Eve Eve Eve")

Submission status: Runtime Error

Solution code:
a=map(int,input().split())
print(max(a)-min(a))

Submission status: Runtime Error

Solution code:
A=list(map(int,input().split()))
A = A.sort()
print(A[1]*A[2]/2)

Submission status: Runtime Error

Solution code:
A=list(map(int,input().split()))
A = A.sort
print(A[1]*A[2]/2)

Submission status: Runtime Error

Solution code:
a=sorted(list(map(int,input().split())))
print(a*b//2)

Submission status: Runtime Error

Solution code:
N = int(input())
h = list(map(int,input().split()))
ans = h[0]
for i in range(1,N):
    if h[i]-h[i-1]>0:
        ans += h[i]-h[i-1]
print(ans)

Submission status: Runtime Error

Solution code:
from heapq import heappop, heappush, heapify
n, k = map(int, input().split())
lst = [list(map(int, input().split())) for i in range(n)]
lst = sorted(lst, reverse=True, key=lambda x:x[1])
q = []
v = set()
cnt = 0
for t, d in lst[:k]:
    cnt += d
    if t in v:
        heappush(q, d)
    else:
        v.add(t)
cnt += len(v)**2
ans = cnt
for t, d in lst[k:]:
    if t not in v and len(q)!=0:
        x = heappop(q)
        cnt += d + 2*len(v) + 1 - x
        ans = max(ans, cnt)
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split('/'))
print(a*b/2)

Submission status: Runtime Error

Solution code:
Copy
a, b, c = map(int,input().split())
print(int(min(a*b/2,b*c/2,c*a/2)))

Submission status: Runtime Error

Solution code:
k=0
ind=0
l=[]
i=int(input())
l.append(i)
def guusuu():
    k=l[ind]/2
    return int(k)
    
def kisuu():
    k=l[ind]*3+1
    return int(k)

while ind<500:
    if l[ind]%2==0:
        l.append(guusuu())
    else:
        l.append(kisuu())
    ind+=1       

print((l.index(4))+4)

Submission status: Runtime Error

Solution code:
k=0
ind=0
l=[]
i=int(input())
l.append(i)
def guusuu():
    k=l[ind]/2
    return int(k)
    
def kisuu():
    k=l[ind]*3+1
    return int(k)

while ind<1000:
    if l[ind]%2==0:
        l.append(guusuu())
    else:
        l.append(kisuu())
    ind+=1       

print((l.index(4))+4)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(),split())
print(a*b//2)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(),split())
print((a*b)/2)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(),split())
print(a*b/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,c = map(int, input().split())
print(a*c*//2)

Submission status: Runtime Error

Solution code:
a,c = map(int, input().split())
print(a*c*1/2)

Submission status: Runtime Error

Solution code:
|AB|,|BC|,|CA|=map(int, input().split())
ans=(|AB|*|BC|*|CA|/max(|AB|,|BC|,|CA|))/2
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
AB,BC = map(int, input().split())
print(AB*BC/2)

Submission status: Runtime Error

Solution code:
N=int(input())
h=list(map(int,input().split()))
t=[0]*N
a=0
for i in range(N):
        while t[i]<h[i]:
                for j in range(i,N):
                        if t[j]<h[j]:
                                t[j]+=1
                        else:
                                break
                a+=1
print(a)

Submission status: Runtime Error

Solution code:
a,b,c=(int(X) for x in input().split())
print(int((a*b)/2))

Submission status: Runtime Error

Solution code:
def decrease_height_by_one(hs):
    highest_indexes = [i for i, h in enumerate(hs) if h == max(hs)]
    is_indexes_discontinuous = (i1+1 < i2 for i1, i2 in
                                zip(highest_indexes, highest_indexes[1:]))
    for index in highest_indexes:
        hs[index] -= 1
    return 1 + sum(is_indexes_discontinuous)

input()
hs = list(map(int, input().split()))

n = 0
while max(hs):
  n += decrease_height_by_one(hs)
print(n)

Submission status: Runtime Error

Solution code:
ab,bc,ca=map(int,input().spit())
print(ab*bc*0.5)

Submission status: Runtime Error

Solution code:
a=map(int,input().split())
print(a[0]*a[1]//2)

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split())
a = sorted(a)
print(a[0]*a[1]/2)

Submission status: Runtime Error

Solution code:
a,b,c = sorted(int, input().split())
print(int(a*b/2))

Submission status: Runtime Error

Solution code:
x,y,_=map(int(input().split()))
print(x*y//2)

Submission status: Runtime Error

Solution code:
s=int(input())
li=[s]
for i in range(1000000):
  if s%2==0:
    s=s//2
  else:
    s=3*s+1
  if s in li:
    print(i+2)
    break
  li.append(s)

Submission status: Runtime Error

Solution code:
hs = map(int, input().split())
hs.sort()
print(hs[0] * hs[1] // 2)

Submission status: Runtime Error

Solution code:
AB, BC, CA = map(int, input().split())

print(int(AB + BC + CA) / 2))

Submission status: Runtime Error

Solution code:
print(eval("*".join(list(map(int, input().split()))[:2]))//2)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input(),split())

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

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input(),split())

print((a*b)//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(.split()))
print(a*B/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
h = [0] + [int(i) for i in input().split()]
result = 0
for i in range(1, len(h)):
  if h[i] > h[i-1]:
    result += h[i] - h[i-1]
print(result)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(),split())
print(a*b/2)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
s=sum(a,b,c)
t=min(a,b,c)
l=s-t-max(a,b,c)
print(t*l//2)

Submission status: Runtime Error

Solution code:
n = int(input())
arr = list(map(int, input().split()))
print(max(arr) * n - sum(arr) + min(arr))

Submission status: Runtime Error

Solution code:
    n = int(input())
    arr = list(map(int, input().split()))
    print(max(arr) * n - sum(arr) + min(arr))