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:
x, y, z = map(int, input().split())
print(x * y // 2)

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
AB,BC,CA = map(int,input().split())

print(AB*BC//2)

Submission status: Accepted

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

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

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())
ans =A*B//2
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

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

Submission status: Accepted

Solution code:
import sys
from heapq import heappush, heappop
def input(): return sys.stdin.readline().strip()


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



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
ab, bc, ca = map(int, input().split())

print(ab*bc//2)

Submission status: Accepted

Solution code:
import math

def solve_A():
    a, b, c = map(int, input().split())
    s = (a + b + c) / 2
    area = s * (s-a) * (s-b) * (s-c)
    return math.sqrt(area)

print(int(solve_A()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

s = (a+b+c)/2

ans = (s*(s-a)*(s-b)*(s-c))**(0.5)

print(int(ans))

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())

if a**2==b**2+c**2:
    print(b*c//2)
elif b**2==a**2+c**2:
    print(a*c//2)
else:
    print(a*b//2)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    ab, bc, ca = map(int, input().split())
    res = (ab * bc) // 2
    print(res)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(A*B//2, B*C//2, C*A//2))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

a,b,c=mp()
print((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:
# A - Right Triangle

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

print(ab*bc//2)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

a, b, c = Is()
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:
ab, bc, ca = map(int, input().split())
print(int(ab*bc*(1/2)))

Submission status: Accepted

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

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

A,B,C = inputIL()

print((A*B//2))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    L.sort()
    print(L[0] * L[1] // 2)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

longest = max(edges)
edges.remove(longest)

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
ver = list(map(int, input().split()))
ver.remove(max(ver))

ans = ver[0] * ver[1] // 2

print(ans)

Submission status: Accepted

Solution code:
X,Y,Z = map(int, input().split())
print((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:
def ABC_116_A():
    AB,BC,CA = map(int, input().split())
    print(int(AB*BC/2))
   

if __name__ == '__main__':

    ABC_116_A()

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:
a,b,c = map(int,input().split())

print(a*b // 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:
import itertools
import math
a, b, c =map(int, input().split())
print(a*b//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
l = [x,y,z]
m = max(l)
print(x*y*z//m//2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


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


if __name__ == '__main__':
    main()

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(AB*BC//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations,combinations,combinations_with_replacement
# from collections import deque,Counter
# import re
# from functools import lru_cache # 簡単メモ化 @lru_cache(maxsize=1000)
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import networkx as nx
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix
# from scipy.special import comb

# slist = "abcdefghijklmnopqrstuvwxyz"
lisA = list(map(int,input().split()))
lisA.sort()
ans = lisA[0]*lisA[1]//2
print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

Solution code:
ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))
##########
a,b,c = mi()
maxval = max(a,b,c)
x = min(a,b,c)
y = sum([a,b,c]) - (x + maxval)
print(int(x*y/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s,d=map(int,input().split())
S=(a+s+d)//2
print(int((S*(S-a)*(S-s)*(S-d))**(1/2)))

Submission status: Accepted

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

print(int(ab * bc * 0.5))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
# ABC116A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
print(X*Y//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(a * b // 2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())
print(int(a * b / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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 = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(AB*BC//2)

Submission status: Accepted

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

Submission status: Accepted

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

print((ab * bc) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lis = list(map(int, input().split()))
print(lis[0]*lis[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:
import math
x = input().split()
a = int(x[0])
b = int(x[1])
print(math.floor(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:
AB,BC,CA = map(int,input().split())
print(AB*BC//2)

Submission status: Accepted

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

Submission status: Accepted

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

print(c*a//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    tri = sorted([A, B, C])
    print(tri[0]*tri[1]//2)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in 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, input().split())
print(int(a*b/2))

Submission status: Accepted

Solution code:


def solve():

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


if __name__ == "__main__":
    solve()

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
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

a, b, c = lr()
answer = a * b // 2
print(answer)

Submission status: Accepted

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

T.sort()

x, y = T[:2]
print(x * y // 2)

Submission status: Accepted

Solution code:
X, Y, Z = [int(i) for i in input().split()]

print(int(0.5 * X * Y))

Submission status: Accepted

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

ans = int( a*b*c/(max(a,b,c)*2) )

print(ans)

Submission status: Accepted

Solution code:
import math
ab, bc, ca = map(int, input().split())
s = (ab+bc+ca)/2
S = math.sqrt(s*(s-ab)*(s-bc)*(s-ca))
print(int(S))

Submission status: Accepted

Solution code:
def Right_Triangle(ab, bc, ca):

    return int(ab*bc/2)

def main():
    ab, bc, ca = map(int, input().split())
    print(Right_Triangle(ab, bc, ca))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a = sorted(a)
print((int(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())

print(int(a * b / 2))

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= input().split()
b=int(a[0])
c=int(a[1])
i=b*c/2
print('%d'%i)

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
print(a*b//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, b_c, c_a = map(int, input().split())
print((a_b*b_c)//2)

Submission status: Accepted

Solution code:
a_b, b_c, c_a = map(int, input().split())
print((a_b*b_c)//2)

Submission status: Accepted

Solution code:
ab,bc,ca=map(int,input().split())
print(bc*ab//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:
A, B, C = map(int, input().split())
print(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:
l = sorted(list(map(int, input().split())))

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

Submission status: Accepted

Solution code:
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('{:.0f}'.format(a*b/2))

Submission status: Accepted

Solution code:
import numpy as np
import sys

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

Submission status: Accepted

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

print(math.floor(y*x/2))

Submission status: Accepted

Solution code:
P, Q, R = map(int,input().split())
print(P*Q//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b,c=MI()
ans=a*b//2
print(ans)

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.remove(max(l))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

MOD = 10**9
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

a, b, c = map(int, input().split())
print(a*b//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:

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(ab * bc // 2)

Submission status: Accepted

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

naname = max(hen)

if naname == hen[0]: print(int(hen[1]*hen[2]/2))
elif naname == hen[1]: print(int(hen[0]*hen[2]/2))
else: print(int(hen[1]*hen[0]/2))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

print(A*B//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    x, y, z = MII()
    print(x*y//2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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))**0.5))

Submission status: Accepted

Solution code:
line = input()
v = [int(n) for n in line.split()]
c1 = min(v[0], v[1], v[2])
v.remove(c1)
c2 = min(v[0], v[1])
print(int((c1*c2)/2))

Submission status: Accepted

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

if 1 <= AB <= 100:
    if 1 <= BC <= 100:
        if 1 <= CUm <= 100:
            area = (AB * BC )/ 2
            print(int(area))

Submission status: Accepted

Solution code:
x = input()

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

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

Submission status: Accepted

Solution code:
# solution

l,m,n = map(int,input().split())
print(int(l*m/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    line = input()
    mul = 1
    lista_lados = [int(x) for x in line.split()]
    index_max = lista_lados.index(max(lista_lados))
    for i in range(len(lista_lados)):
        if i != index_max:
            mul *= lista_lados[i]
    print(int(mul/2))
main()

Submission status: Accepted

Solution code:
triangulo = input()
lados = triangulo.split()
AB = lados[0]
BC = lados[1]
area = (int(AB) * int(BC))/2
print("%.0f" % area)

Submission status: Accepted

Solution code:
entrada = [int(x) for x in input().split()]
entrada.sort()
cat1 = entrada[0]
cat2 = entrada[1]
print(int(cat1*cat2/2))

Submission status: Accepted

Solution code:
linha = input()
base,altura,hipotenusa = [int(n) for n in linha.split()]
print(int((base * altura)/2))

Submission status: Accepted

Solution code:
x = input()
k=x.split(" ")

ab= int(k[0])
bc= int(k[1])
ca= int(k[2])

v = [ab,bc,ca]
v.remove(max(v))

print(int(v[0]*v[1]*0.5))

Submission status: Accepted

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

print(int((x*y)/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

area = int((ab*bc)/2)

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
length=[int(i) for i in input().split()]
length.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

def S(AB,BC,CA):
    return AB*BC//2
    
print(S(AB,BC,CA))

Submission status: Accepted

Solution code:
tmp = input().split(" ")
print(int(int(tmp[0])*int(tmp[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:
l=list(map(int,input().split()))
print(l[0]*l[1]//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC-117-A
lengths = sorted(list(map(int, input().split())))
print(lengths[0] * lengths[1] // 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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