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(int(x*y*0.5))

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

ans = int(a*b*0.5)

print(ans)

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())
print(min(a,b,c)*(sum([a,b,c])-min(a,b,c)-max(a,b,c))//2)

Submission status: Accepted

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

print(int(0.5*a*b*c//max(a,b,c)))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(shou * mid // 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())
ans=a*b//2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((a*b)//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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(c * a // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    x, y, z = map(int, readline().split())

    print(x * y // 2)

    return


if __name__ == '__main__':
    main()

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

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 = 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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().strip().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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    a = map(int, input().split())
    a_ = sorted(a)
    print(int(a_[0] * a_[1] * 0.5))


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:
if __name__ == '__main__':

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
B=list.sort(A)
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(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,b,c = map(int, input().split())

print(int(a*b/2))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    x,y,z=mi()
    print(x*y//2)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
L = sorted(l)
print(int(L[0]*L[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((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 = sorted(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:
a,b,c=list(map(int,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:
a, b, c = list(map(int, input().split()))
my_result = a * b / 2
print(int(my_result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,_=[int(i) for i in 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:
AB,BC,CA = list(map(int,input().split()))
print(AB * BC // 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 = map(int, input().split())
print(int(a*b*(1/2)))

Submission status: Accepted

Solution code:
ary = input().split(" ")
print(int(int(ary[0]) * int(ary[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, _ = map(int, input().split())
print(a*b//2)

Submission status: Accepted

Solution code:
# abc116_a.py
# https://atcoder.jp/contests/abc116/tasks/abc116_a

# A - Right Triangle /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 直角三角形 ABCがあります。∠ABC=90°です。
# 三角形 ABCの三辺の長さである |AB|,|BC|,|CA| が与えられるので、直角三角形 ABCの面積を求めて下さい。
# ただし、三角形 ABCの面積は整数となることが保証されています。

# 制約
#     1≦|AB|,|BC|,|CA|≦100
#     入力はすべて整数である。
#     三角形 ABCの面積は整数である。

# 入力
# 入力は以下の形式で標準入力から与えられます。
# |AB| |BC| |CA|

# 出力
# 三角形 ABCの面積を出力してください。

# 入力例 1
# 3 4 5

# 出力例 1
# 6

# tri

# この三角形の面積は 6です。

# 入力例 2
# 5 12 13

# 出力例 2
# 30

# この三角形の面積は 30です。

# 入力例 3
# 45 28 53

# 出力例 3
# 630

# この三角形の面積は 630です。


def calculation(lines):
    # X = lines[0]
    # N = int(lines[0])
    ab, bc, ca = list(map(int, lines[0].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i+1]))
    
    result = int(ab*bc/2)

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 4 5']
        lines_export = [6]
    if pattern == 2:
        lines_input = ['5 12 13']
        lines_export = [30]
    if pattern == 3:
        lines_input = ['45 28 53']
        lines_export = [630]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

A = sorted(li())

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

Submission status: Accepted

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

print(a*b//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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

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

print((aa*bb)//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
直角三角形の三辺 = list(map(int, input().split()))
直角三角形の三辺.sort()
print(直角三角形の三辺[0] * 直角三角形の三辺[1] // 2)

Submission status: Accepted

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

print(A*B//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
 a,b,c = map(int,input().split())
 print(a * b // 2)
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())
a=0.5 * a* b
print("%d"%a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
A,B,C = map(int,input().split())
if not ( 1 <= A <= 100 and 1 <= B <= 100 and 1 <= C <= 100 ): sys.exit()
if not ( isinstance(A,int) and isinstance(B,int) and isinstance(C,int) ): sys.exit()

print(( A * B ) // 2)

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

lis = [a,b,c]

lis.remove(max(lis))

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

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc116
# 11:45-


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


print(main())

Submission status: Accepted

Solution code:
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
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, B, C = mapint()
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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

A = sorted(A)

print(int(A[0]*A[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:
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:
# 初期入力
import sys
input = sys.stdin.readline
a = list(map(int, input().split()))
a.sort()
ans =a[0] *a[1] //2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    ab, bc, ca = il()
    print((bc*ab)//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
a,b,c = map(int, raw_input().split(' '))
print (a*b) >> 1

Submission status: Accepted

Solution code:
ab,bc,ca = map(int,input().split())
import math
print(math.floor(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:
AB, BC, CA = map(int, input().split())
S = AB*BC//2

print(S)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
L=[a,b,c]
L=sorted(L)
print(L[0]*L[1]//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,B,C = map(int,input().split())
print(A * B//2)

Submission status: Accepted

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

Submission status: Accepted

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

print((BC*AB)//2)

Submission status: Accepted

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

area = (AB * BC) // 2

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
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:
# -*- coding: utf-8 -*-

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:
AB,BC,_ = map(int,input().split())
print(AB*BC//2)

Submission status: Accepted

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






if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

import math
s = (a+b+c)/2
S = math.sqrt(s*(s-a)*(s-b)*(s-c))
print(int(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = (a+b+c)/2
S = s*(s-a)*(s-b)*(s-c)

print(int(S**0.5))

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 = 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,_ = 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())

print(int(a*b/2))

Submission status: Accepted

Solution code:
a,b,_ = 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(a*b//2)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int()
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

A,B,C = I()
print(A*B//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ab*bc//2)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
AB,BC,CA=map(int,input().split())
print(int(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:
s=input();print(eval(s[:s.rfind(' ')].replace(' ','*')+'//2'))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
li = LI()
li.sort()
print(li[0]*li[1]//2)

Submission status: Accepted

Solution code:
arr = []

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

arr.append(A)
arr.append(B)
arr.append(C)
arr = sorted(arr)

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

Submission status: Accepted

Solution code:
Input = input().split()
AB = Input[0]
AB = int(AB)
BC = Input[1]
BC = int(BC)
Answer = AB * BC / 2
Answer = int(Answer)
print(Answer)

Submission status: Accepted

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

print(S)

Submission status: Accepted

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

print(min([a*b, b*c, c*a]) // 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())
array = [A,B,C]
array.sort()
print(int(array[0]*array[1]/2))

Submission status: Accepted

Solution code:
import sys
a, b, c = map(int, sys.stdin.readline().rstrip().split())
print(a * b // 2)

Submission status: Accepted

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

S = 0.5 * AB * BC

print(int(S))

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ab,bc,ca=map(int,input().split())
print(ab*bc//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(int(ab*bc*0.5))

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:
import sys
import math
from collections import Counter
import itertools
import fractions
from decimal import Decimal
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################

a,b,c=MI()
print(int(a*b*0.5))

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(A*B*0.5))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(int((b**2 + c**2 - 2 * b * c * math.cos(math.atan(a / b)))**0.5 * b // 2))

Submission status: Accepted

Solution code:
from functools import reduce
from operator import mul

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

print(reduce(mul, [a, b]) // 2)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

# check
print(AB * BC // 2)