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,B,C=map(int,input().split())
l=[A,B,C]
l.sort()
print(int(l[0]*l[1]/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*
n_list = list(map(int, input().split()))
res = (n_list[0]*n_list[1])/2
print(int(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from numpy import sqrt
a,b,c = [int(x) for x in input().split()]
s = (a+b+c)/2
print(int(sqrt(s*(s-a)*(s-b)*(s-c))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    n = [int(i) for i in input().split()]
    a2, b2, c2 = [i**2 for i in n]
    a, b, c = n
    # print(a,b,c)
    # print(a2,b2,c2)
    ans = 0
    if a2+b2 == c2:
        ans = a * b
    elif b2+c2 == a2:
        ans = b * c
    elif a2+c2 == b2:
        ans == a * c
    print(int(ans/2))

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
AB = line.split()[0]
BC = line.split()[1]

range = int(AB)*int(BC)/2
  
print (int(range))

Submission status: Accepted

Solution code:
def inpl(): return list(map(int, input().split()))


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

Submission status: Accepted

Solution code:
(a,b,c)=(int(i) for i in input().split())
#print(a,b,c)
s=(a+b+c)/2
t2=s*(s-a)*(s-b)*(s-c)
t=t2**0.5
print(int(t))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

maxside = max(A, B, C)

print(int(A * B * C / maxside / 2))

Submission status: Accepted

Solution code:
import math
a = list(map(int, input().split()))
s = sum(a) / 2
print(int(math.sqrt(s*(s-a[0])*(s-a[1])*(s-a[2]))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ab, bc, ca = (int(i) for i in input().split())

ans = (ab * bc) / 2

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

a,b,c = map(int,input().split())
print("{}".format(int(a*b/2)))

Submission status: Accepted

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

ans = ab * bc // 2
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

abc = [int(i) for i in stdin.readline().rstrip().split(" ")]
s = sum(abc) / 2
print(int((s*(s-abc[0])*(s-abc[1])*(s-abc[2]))**(1/2)))

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
print("{}".format(int(a*b/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
value = input()
ab = int(value.split(" ")[0])
bc = int(value.split(" ")[1])

print(int(ab * bc / 2))

Submission status: Accepted

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

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

Submission status: Accepted

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

S = (AB*BC) // 2
print(S)

Submission status: Accepted

Solution code:
input = list(map(int,input().split()))
ab = int(input[0])
bc = int(input[1])
cd = int(input[2])

result = int(ab * bc * 0.5)

print(result)

Submission status: Accepted

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

print(int(a*c/2))

Submission status: Accepted

Solution code:
a, b, c = (int(i) for i in input().split())  #a=1, b=3, c=5, d=7
print(int(a*b/2))

Submission status: Accepted

Solution code:
inputList = [int(i) for i in input().split()]
ab = inputList[0]
bc = inputList[1]
a = int (ab * bc / 2)
print(a)

Submission status: Accepted

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

result = int(AB * BC / 2)

print(result)

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())

s=a*b//2

print(s)

Submission status: Accepted

Solution code:
import math
x = input().split()
a,b,c = int(x[0]),int(x[1]),int(x[2])
s = (a+b+c)/2
ans = math.sqrt(s*(s-a)*(s-b)*(s-c))
print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))
l = [a,c,b,c]
l.sort()
#print(l)

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

Submission status: Accepted

Solution code:
ab, bc, ca = input().split()

print(int(int(ab) * int(bc) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

a = int(AB * BC / 2)

print(str(a))

Submission status: Accepted

Solution code:
list = input().split(' ')

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

Submission status: Accepted

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

Submission status: Accepted

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

S = int(AB * BC / 2)
print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a,b,c=map(int, input().split())
s=(a+b+c)//2
print(int(math.sqrt(s*(s-a)*(s-b)*(s-c))))

Submission status: Accepted

Solution code:
a,b,c=(int(i) for i in input().split())
t=sorted([a,b,c])
print(int(t[0]*t[1]/2))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
short = min(a,b,c)
lon = max(a,b,c)
mid = a + b + c - lon - short
print((short*mid)//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:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
s = int(a*b/2)
print(s)

Submission status: Accepted

Solution code:
e = [int(i) for i in input().split()]
e.sort()
print(e[0] * e[1] // 2)

Submission status: Accepted

Solution code:
inp = [int(i) for i in input().split()]
ru = inp[0] * inp[1] / 2
print(int(ru))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs=  sorted(list(map(int, input().split(" "))))

out = inputs[0] * inputs[1] // 2

print(out)

Submission status: Accepted

Solution code:
ab, bc, ca = list(map(int, input().split()))

S = ab * bc / 2
print(int(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys  import stdin
a =  map(int,stdin.readline().split())
a.sort()
print (a[0]*a[1])/2

Submission status: Accepted

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

Submission status: Accepted

Solution code:

aD = sorted(int(_) for _ in input().split())
print(aD[0]*aD[1]//2)

Submission status: Accepted

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

s = int((a * b)/2)

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(x) for x in input().split()]

#%%
#a = [5,3,4]

#%%
a.sort()
print(int(a[0] * a[1] / 2))
#%%


#%%

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    N = list(map(int, input().split()))

    N.sort()
    print((N[1] * N[0]) // 2)

input = lambda: stdin.readline().rstrip()
main()

Submission status: Accepted

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


main()

Submission status: Accepted

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

print(int(c * a / 2))

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

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

a = sorted(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
ab, bc, ca = list(map(int, input().split()))
ab = np.clip(ab, 1, 100)
bc = np.clip(bc, 1, 100)
ca = np.clip(ca, 1, 100)

area = ab * bc * 0.5
print(int(area))

Submission status: Accepted

Solution code:
n=[int(x) for x in input().split()]
print(int(0.5*n[0]*n[1]))

Submission status: Accepted

Solution code:
import numpy as np
a,b,c = map(int,input().split(' '))

s = (a + b + c)/2
S2 = s*(s-a)*(s-b)*(s-c)
ans = int(np.sqrt(S2)+0.5)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor

import heapq
import itertools
import operator


def get_int():
    return int(input())


def get_str():
    return input().strip()


def get_int_list():
    return [int(i) for i in input().split()]


def get_char_list():
    return list(input().strip())


def main():
    ab, bc, ca = get_int_list()
    print(ab * bc // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
l=[a,b,c]
x=max(l)
ans=1
for i in range(3):
  if l[i]!=x:
    ans*=l[i]
print(ans//2)

Submission status: Accepted

Solution code:
#!/Users/takahiro.kida/git/atcorder/venv/bin/python

import numpy
import scipy

from collections import defaultdict
from pprint import pprint

a,b,c = [int(x) for x in input().split(" ")]

print (int(a*b/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(int(A*B/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
a,b,c = map(int,input().split())
s = (a+b+c)/2.0
S = (s * (s-a) * (s-b) * (s-c)) ** 0.5
print (int(S))

Submission status: Accepted

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

sorted(a)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 20 20:51:22 2019

@author: Owner
"""

import collections
import scipy.misc
import sys
import numpy as np
import math
from operator import itemgetter
import itertools
import copy

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

"""
N, X = map(int, input().split())

x = [0]*N
x[:] = map(int, input().split())

P = [0]*M
Y = [0]*M
for m in range(M):
    P[m], Y[m] = map(int, input().split())
    
all(nstr.count(c) for c in '753')
"""


x = [0]*3
x[:] = map(int, input().split())

x.sort(reverse = False)
print(int(1/2 * x[0]*x[1]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n1, n2, n3 = list(map(int, input().split())) 
print(int(n1*n2/2))

Submission status: Accepted

Solution code:

#import numpy as np
#N=int(input())
A,B,C=list(map(int,input().split()))

s=(A+B+C)/2
ans=(s*(s-A)*(s-B)*(s-C))**(1/2)
print(int(ans))

Submission status: Accepted

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

print(int((s*(s-a)*(s-b)*(s-c))**(1/2)))

Submission status: Accepted

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

Submission status: Accepted

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

r = int(a*b/2)

print(r)

Submission status: Accepted

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

ab = a[0]
bc = a[1]
print(int(ab*bc/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(AB*BC*0.5))

Submission status: Accepted

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

Submission status: Accepted

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

print(int(a * b / 2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
ab,bc,ca = map(int, input().split())
print(bc*ab//2)

Submission status: Accepted

Solution code:
ab, bc, ca = [int(_) for _ in 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:
ab,bc,ca = map(int, input().split())

print(bc * ab // 2)

Submission status: Accepted

Solution code:
from sys import stdin
n,k,c=[int(x) for x in stdin.readline().rstrip().split()]
print(int((n*k)/2))

Submission status: Accepted

Solution code:
import math
import copy




def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:

            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l

a=nCast(input().split())


def func():
    a.sort()
    return int(a[0]*a[1]*0.5)
print(func())

Submission status: Accepted

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

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

Submission status: Accepted

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


abc116_a()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

    print(int(a*b/2))


if __name__ == "__main__":
        main()

Submission status: Accepted

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

max_n = max(a, b, c)
min_n = min(a, b, c)

oth = a+b+c - max_n - min_n

print(int((min_n * oth) / 2))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline
ab, bc, ca = map(int, input().split())
print(int(ab*bc/2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
ab, bc, _ = map(int, input().split())
print(int(ab * bc / 2))

Submission status: Accepted

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

a.sort(reverse=False)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = a * b /2

print(int(ans))

Submission status: Accepted

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

print((AB*BC)/2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 20 20:49:15 2019

@author: Yamazaki Kenichi
"""

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

ans= a*b//2

print(ans)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = (int(i) for i in input().split())
tmp= []
tmp.append(a)
tmp.append(b)
tmp.append(c)
res = sorted(tmp)
print(res[0]*res[1]//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y, Z = list(map(int, input().split()))
print(int(X * Y /2))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n, w, k = map(int, input().split())
    print(int(n*w/2))

Submission status: Accepted

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

print(int(a*b/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


nums = [int(num) for num in input().split()]
print(int(nums[0]*nums[1]*0.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# %%
ary = [int(a) for a in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(a * c / 2))

Submission status: Accepted

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

l.sort()

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

Submission status: Accepted

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

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(int(A*B/2))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    AB, BC, CA = tuple(map(int, input().split(" ")))
    if AB ** 2 + BC ** 2 == CA ** 2:
        print(AB * BC // 2)
    elif AB ** 2 + CA ** 2 == AB ** 2:
        print(AB * CA // 2)
    else:
        print(BC * CA // 2)

Submission status: Accepted

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

print(int(a*b*0.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B, C] = [long(input_raw[0]), long(input_raw[1]), long(input_raw[2])]
    print A * B /2

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
p, q, r = map(int, input().split())
print(p * q // 2)

Submission status: Accepted

Solution code:
A,B, C = (int(_) for _ in input().split())  

print(int(A * B / 2))

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

print(int(A*B/2))

Submission status: Accepted

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

print(x * y // 2)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
max_a = max(s)

ans = 1
for a in s:
    if a != max_a:
        ans *= a
print(ans // 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,input().split())
print(int(1/2*a*b))

Submission status: Accepted

Solution code:
ab, bc, ca = [int(i) for i in input().split(' ')]
print(int(ab*bc/2))

Submission status: Accepted

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

Submission status: Accepted

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

print(a*b//2)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


A = LI()
A.sort()

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

Submission status: Accepted

Solution code:
""" AtCoder """

import sys
input = sys.stdin.readline

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

print(int(x*y/2))

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()

print(a[0] * a[1] // 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 = list(map(int, input().split()))
print(int(a * b / 2))

Submission status: Accepted

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

Submission status: Accepted

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

print(int(0.5 * a * b))

Submission status: Accepted

Solution code:
#!usr/bin/env python3
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def LIR(n): return [LI() for i in range(n)]
mod = 1000000007

#A
a,b,c = LI()
s = a+b+c
s /= 2
ans = (s*(s-a)*(s-b)*(s-c))**(1/2)
print(int(ans))
#B

#C

#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

print(int(a*b/2))

Submission status: Accepted

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

print(AB*BC//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from itertools import product

sys.setrecursionlimit(200000)


def input():
    return sys.stdin.readline()[:-1]


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def imi(N: int, t: type = int):
    return [ii(t) for _ in range(N)]


def iml(N: int, t: type = int):
    return [il(t) for _ in range(N)]


def solve():
    a, b, c = il()
    return a * b // 2


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
a = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return input()
a=IL()
a.sort()
print(int(a[0]*a[1]*0.5))

Submission status: Accepted

Solution code:
s, t, u = sorted([int(i) for i in input().split()])
print(s * t // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    """Function."""
    a, b, c = map(int, input().split())

    print(int(a*b*0.5))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def j(q):
    if q==1: print("YES")
    else:print("NO")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

#x = ip()                              #入力整数1つ
#x,y= (int(i) for i in input().split())      #入力整数横2つ
x,y,z = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#x = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列

#jの変数はしようできないので注意


print(x*y//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
X.sort()
print(X[0]*X[1]//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 = [int(_) for _ in input().split()]

print(ab * bc // 2)

Submission status: Accepted

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

Submission status: Accepted

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


print(a*b//2)

Submission status: Accepted

Solution code:
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b,c = IL()

print(a*b//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

print(A*B//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
A, B, C = inpl()

print(A*B//2)

Submission status: Accepted

Solution code:
a, b, c = [int(_) for _ in input().split()]

print(a * b // 2)

Submission status: Accepted

Solution code:
AB, BC, CA = [int(elem) for elem in input().split()]
print(AB * BC // 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
a, b, c = [int(i) for i in input().split()]

print(int(a*b/2))

Submission status: Accepted

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

Submission status: Accepted

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

print(int(a*b/2))