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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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

AB, BC, CA = [int(x.strip("|")) for x in input().split()]
print(int(AB*BC/2))

Submission status: Accepted

Solution code:
def main():
    A = list(map(int,input().split()))

    A.remove(max(A))

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


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


print(a * b // 2)

Submission status: Accepted

Solution code:
ab, bc, ca = map(int, input().split())
if  1 <= ab <= 100 and 1 <= bc <= 100 and 1 <= ca <= 100:
    print(int(ab * bc / 2))
else:
    print('hoge!')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split()
print(int(a[0])*int(a[1])//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())
s = a * b / 2
print(int(s))

Submission status: Accepted

Solution code:
a,b,c=sorted(map(int,input().split()))
print((b*a)//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:
def main():
    AB, BC, CA = map(int, input().split())
    return AB * BC // 2

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a*b//2)

Submission status: Accepted

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

ab, bc, ca = map(int, input().split())
ab, bc, _ = sorted([ab, bc, ca])

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

Submission status: Accepted

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

print((AB*BC)//2)

Submission status: Accepted

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

print(int(AB*BC*0.5))

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()))
l.remove(max(l))
print(int(l[0] * l[1] / 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

num = na()
num.sort()
print(int(0.5 * (num[0] * num[1])))

Submission status: Accepted

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

#print(ab * bc // 2)

s = (ab + bc + ca) / 2
import math
print(int(math.sqrt(s * (s - ab) * (s - bc) * (s - ca))))

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

print(ab*bc//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list1 = [i for i in input().split()]

n1 = int(list1[0])
n2 = int(list1[1])
n3 = int(list1[2])

ans = int((1/2)*n1*n2)

print (ans)

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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=input().split()
ab,bc,ca=int(ab),int(bc),int(ca)

print(ab*bc//2)

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
import math

# inputList=[]
# for i in range(6):
#     inputNum = input()
#     inputList.append(inputNum)
inputa = input().split()
# inputb = input().split()

a = int(inputa[0])
b = int(inputa[1])
c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(AB*BC*0.5))

Submission status: Accepted

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

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=[int(s) for s in input().split()]
print(int(AB*BC/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
import itertools
import queue
from fractions import gcd

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

mod = 1000000007

"""
# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]

# 標準入力取得
## 文字列
    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())

## 数値
    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき
"""

if __name__ == "__main__":
    A, B, _ = map(int, sys.stdin.readline().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:

Xs = list(map(int, input().split()))
Xs.sort()
print(Xs[0] * Xs[1] // 2)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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:
xyz = list(map(int, input().split()))

xyz.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

line.sort()

print( "{:d}".format( int(line[0] * line[1] / 2)) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

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

mod = 1000000007

if __name__ == "__main__":
    a,b,c = map(int, sys.stdin.readline().split())
    print(int(a*b/2))

Submission status: Accepted

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

a = sorted(a)
ans = (a[0] * a[1])/2

print(int(ans))

Submission status: Accepted

Solution code:
#116 Right Triangle

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
sides = [int(x) for x in input().split()]
ans = 1
for side in sides:
    ans *= side
print(ans//max(sides)//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 -*-


if __name__ == '__main__':
    a, b, c = map(int, input().split(' '))
    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:
X,Y,Z=map(int,input().split())
print(int((X*Y)/2))

Submission status: Accepted

Solution code:
Tmp = []
Tmp = input().rstrip().split(' ')
 
nA = int(Tmp[0])
nB = int(Tmp[1])

nAns = nA * nB // 2

print(nAns)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

# print(AB)
# print(BC)
# print(CA)

print(int(BC * AB / 2))

Submission status: Accepted

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

print(int(a*b*0.5))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split(" ")]
print(int((l[0]*l[1])/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:
l = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a,b,_=map(int,input().split())
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())
T = (A + B + C) / 2
S = (T * (T - A) * (T - B) * (T - C)) ** (1/2)

print(int(S))

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



if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
import math
inp = input().split()

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

print(math.ceil(0.5*ab*bc))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

# input
l = list(map(int, input().split()))

# solve
l.sort()
ans = int(l[0] * l[1] / 2)

# output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

li.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    c, a, b = 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)


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = LI()
    a.sort()
    print(a[0]*a[1]//2)  
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# |AB|=C, |BC|=A, |CA|=B
C,A,B = [int(i) for i in input().split()]
X = (C * A) /2
print(int(X))

Submission status: Accepted

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

Submission status: Accepted

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

if a == max(a, b, c):
	print(b*c//2)
if b == max(a, b, c):
	print(c*a//2)
if c == max(a, b, c):
	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:
l = sorted(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:
#!/usr/bin/env python3
#ABC116 A

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()) # 横に2個
print(int(A*B/2))

Submission status: Accepted

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

ans = (a*b*c)//(x*2)
print(ans)

Submission status: Accepted

Solution code:
import math

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

s = sum(l)/2

ans = int(math.sqrt(s * (s - l[0]) * (s - l[1]) * (s - l[2])))
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y,Z=map(int,input().split())
if (X>Y) and (X>Z):
  print(int(Y*Z/2))
elif (Y>X) and (Y>Z):
  print(int(X*Z/2))
else:
  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:
ab,bc,ca = map(int,input().split(' '))

print(int(ab * bc /2))

Submission status: Accepted

Solution code:
import math

AB, BC, CA = map(int, input().split())
s = (AB + BC + CA) / 2

print(int(math.sqrt(s* (s - AB) * (s - BC) * (s - CA))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n1, n2, n3  = [int(i) for i in input().split()]

r1 = (n1 * n2) / 2

print(int(r1))

Submission status: Accepted

Solution code:
ABC = list(map(int, input().split()))
ABC.sort()
print("{:.0f}".format(ABC[0] * ABC[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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

AB, BC, CA = nl()

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

if max(A, max(B, C))==A:
    print(int(B*C*0.5))
elif max(A, max(B, C))==B:
    print(int(A*C*0.5))
else:
    print(int(A*B*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:
c,a,b = map(int,input().split())
print(int(c*a/2))

Submission status: Accepted

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

Submission status: Accepted

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

c.remove(max(c))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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()))
a.sort()
print(int(a[0] * a[1] / 2))

Submission status: Accepted

Solution code:
import math
sa = list(map(int,input().split(' ')))

#print((sa[0]*sa[1])//2)

s = (sa[0]+sa[1]+sa[2])//2
ans = int(math.sqrt(s*(s-sa[0])*(s-sa[1])*(s-sa[2])))
print(ans)

Submission status: Accepted

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

answer=AB*BC//2

print(answer)

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*0.5)
print(S)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

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


main()

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())

print(int(X*Y/2))

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

print(int(0.5*c*a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
lst = input().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# our code here!
x,y,z = list(map(int,input().split(" ")))
print(int(y*x*0.5))

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:
li=list(map(int,input().split()))
s=sum(li)
t=min(li)
l=s-t-max(li)
print(t*l//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A.remove(max(A))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
A, B = sorted([A, B, C])[:2]
print((A*B)//2)

Submission status: Accepted

Solution code:
from sys import stdin
A = [int(x) for x in stdin.readline().rstrip().split()]
A.sort()
print(int(A[0] * A[1] / 2))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
three = [A, B, C]
a = three.pop(three.index(min(three)))
b = three.pop(three.index(min(three)))
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:
a, b, c = [ int(v) for v in input().split() ]
s = (a+b+c)//2
print(int((s*(s-a)*(s-b)*(s-c))**0.5))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

lst_1 = input().split()

for i in range(len(lst_1)):

    lst_1[i] = int(lst_1[i])

lst_1.sort()

ans = int(lst_1[0] * lst_1[1] / 2)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(AB, BC, CA):
    print(int(AB * BC * 0.5))

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)


def main():
    AB, BC, CA = list(map(int, input().split()))
    solve(AB, BC, CA)
    # Failed to predict input format
    pass


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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