AtCoder Beginner Contest 116 - Right Triangle

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-----
3 4 5

-----Sample Output-----
6


This triangle has an area of 6.

Difficulty: EASY

Starter code:

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


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


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


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


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


(a, b, c) = map(int, input().split())
print(round(0.5 * a * b))


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


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


import math
import collections
from itertools import product
ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))
l = li()
l.sort()
print(l[0] * l[1] // 2)


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


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


e = sorted(map(int, input().split()))
print(e[0] * e[1] // 2)


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


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


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


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


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


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


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


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


(bottom, height, hypotenuse) = map(int, input().split())
area = int(bottom * height / 2)
print(area)


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


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


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


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


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


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


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


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


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


(A, B, C) = (int(x) for x in input().split())
print(A * B // 2)


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


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


(ab, bc, ca) = (int(n) for n in input().split())
print(ab * bc // 2)


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


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


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


a = input().split()
print(int(a[0]) * int(a[1]) // 2)


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


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


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


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


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


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


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


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


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


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


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


def mapt(fn, *args):
	return tuple(map(fn, *args))

def Input():
	return mapt(int, input().split(' '))

def main():
	(a, b, c) = Input()
	print(b * a // 2)
main()


(a, b, c) = map(int, input().split())
print(str(int(0.5 * a * b)))


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


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

def __starting_point():
	main()
__starting_point()


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


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


(A, B, C) = [int(a) for a in input().split(' ')]
print(A * B // 2)


e = [int(x) for x in input().split()]
print(e[0] * e[1] // 2)


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


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


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


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


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


(a, b, c) = map(int, input().split())
d = max(a, b, c)
res = 1
if a != d:
	res *= a
if b != d:
	res *= b
if c != d:
	res *= c
print(res // 2)


(a, b, _) = [int(i) for i in input().split()]
print(a * b // 2)


(h, w, n) = map(int, input().split())
print(int(h * w / 2))


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


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


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


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


(A, B, C) = [int(i) for i in input().split()]
print(A * B // 2)


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


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


(a, s, d) = map(int, input().split())
print(int(a * s / 2))


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


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


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


(N, M, L) = map(int, input().split())
print(int(N * M / 2))


(num, num1, num2) = input('').split()
num = int(num)
num1 = int(num1)
print(int(num * num1 / 2))


def lcm(a, b):
	return a * b // math.gcd(a, b)
MOD = 10 ** 9 + 7
(a, b, c) = list(map(int, input().split()))
print(a * b // 2)


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


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


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


(length1, length2, length3) = map(int, input().split())
area = length1 * length2 / 2
print(int(area))


l = [int(x) for x in input().split()]
l.sort()
print(l[0] * l[1] // 2)


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


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


(ab, bc, ca) = list(map(int, input().split()))
result = int(ab * bc * 0.5)
print(result)


def atc_116a(input_value: str) -> int:
	tri_length = [int(ai) for ai in input_value.split(' ')]
	tri_length.sort()
	return int(tri_length[0] * tri_length[1] / 2)
input_value = input()
print(atc_116a(input_value))


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


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


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


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


print(eval('*'.join(input().split()[:2])) // 2)


(L_ab, L_bc, L_ca) = map(int, input().split())
print(L_ab * L_bc // 2)


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


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


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


from math import gcd
from itertools import combinations, permutations, accumulate, product
from collections import deque, defaultdict, Counter
import decimal
import re
import math
import bisect
import heapq
import sys
sys.setrecursionlimit(10000000)
mod = 10 ** 9 + 7
INF = float('inf')
from sys import stdin
readline = stdin.readline

def readInts():
	return list(map(int, readline().split()))

def readTuples():
	return tuple(map(int, readline().split()))

def I():
	return int(readline())
(a, b, c) = readInts()
print(a * b // 2)


a = input().split()
b = int(a[0])
c = int(a[1])
print(b * c // 2)


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


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


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


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


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


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


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


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

def __starting_point():
	main()
__starting_point()


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


(A, B, C) = (int(X) for X in input().split())
print(A * B // 2)


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


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


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


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