Problem:


Score : 100 points

Problem Statement

There is a right triangle ABC with ∠ABC=90°.

Given the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.

It is guaranteed that the area of the triangle ABC is an integer.

Constraints

1 \leq |AB|,|BC|,|CA| \leq 100

All values in input are integers.

The area of the triangle ABC is an integer.

Input

Input is given from Standard Input in the following format:

|AB| |BC| |CA|

Output

Print the area of the triangle ABC.

Sample Input 1

3 4 5

Sample Output 1

6

This triangle has an area of 6.

Sample Input 2

5 12 13

Sample Output 2

30

This triangle has an area of 30.

Sample Input 3

45 28 53

Sample Output 3

630

This triangle has an area of 630.



Sample input:
3 4 5


Sample output:
6

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 116: A – Right Triangle
ab, bc, ca = [int(s) for s in input().split()]
print(ab * bc // 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  #s = input()
  #s = input().split()
  a,b,c = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  print(a*b//2)

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(ab*bc/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

c, a, b = map(int, sys.stdin.readline().split())

def main():
    s = c * a // 2
    print(s)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
from math import sqrt
ab, bc, ca = map(int, input().split())
l = [ab, bc, ca]
s = sum(l) // 2
print(int(sqrt(s * (s - ab) * (s - bc) * (s - ca))))

Submission status: Accepted

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

    print((num_list[0]*num_list[1])//2)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = input().split()
a = k[0]
b = k[1]
c = k[2]
for i in range(len(k)):
    k[i] = int(k[i])
h = max(k)

Buf = 1
del k[k.index(h)]

for i in k:
    Buf = Buf * int(i)
r = Buf/2
print(int(r))

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    print(a[0]*a[1]//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

answer = (BC * AB) /2

print(int(answer))

Submission status: Accepted

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

print(int(ab * bc / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

print(a*b//2)

Submission status: Accepted

Solution code:
import sys
INF = 10 ** 10
MOD = 10 ** 9 + 7
from functools import lru_cache
sys.setrecursionlimit(100000000)

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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


main()

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:
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/2))

Submission status: Accepted

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

maxL = max(A,B,C)
minL = min(A,B,C)
midium = A+B+C - maxL - minL

print(int(minL*midium/2))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split());print(A*B//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,dummy = map(int,input().split())
print(a*b//2)

Submission status: Accepted

Solution code:
ab, bc, ac = 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:
a,b,c = map(int, input().split())
if a > b and a > c:print(b * c // 2)
if b > c and b > a:print(c * a // 2)
if c > a and c > b: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:
ls = list(map(int,input().split()))
ls.sort()
print(int(ls[0]*ls[1]*0.5))

Submission status: Accepted

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

print(int(bc*ab/2))

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
えーびー,びーしー,_ = map(int,input().split())
めんせき =えーびー*びーしー//2
print(めんせき)

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

ab=pow(AB,2)
bc=pow(BC,2)
ca=pow(CA,2)

if ab+bc==ca:
    print(int(AB*BC/2))
elif bc+ca==ab:
    print(int(BC*CA/2))
else:
    print(int(AB*CA/2))

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


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

    A, B, C = list(map(int, sys.stdin.readline().split()))
    print(A*B//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def solve():
    AB, BC, _ = map(int, input().split())
    print(BC * AB // 2)
    
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# A - Right Triangle
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(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 heapq
def mium():
  hen = list(map(int, input().split()))
  hens = heapq.nsmallest(2, hen)
  print(int(hens[0]*hens[1]/2))
if __name__ == "__main__":
  mium()

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] = list(map(int,input().split()))
print(int(0.5*A*B))

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())
#面積を計算)
area = int(a*b*0.5)
print(area)

Submission status: Accepted

Solution code:
a,b,c = list(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,_=map(int,input().split(' '))
print(A*B//2)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# Problem A - Right Triangle

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:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

a,b,c = inpl()
print(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:
#!/usr/bin/env python3



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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = ab * bc * ca // max(ab, bc, ca)
print(ans // 2)

Submission status: Accepted

Solution code:
def main():
    a, b, c = (int(i) for i in input().split())
    from math import sqrt
    s = (a + b + c) / 2
    print(int(sqrt(s*(s-a)*(s-b)*(s-c))))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
	readline=stdin.readline
	c,a,b=map(int,readline().split())
	print(c*a//2)
if __name__=="__main__":
	main()

Submission status: Accepted

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

print(X*Y//2)

Submission status: Accepted

Solution code:
n = sorted(map(int, input().split()))
print(round((n[0] * n[1]) / 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:
import sys
import os


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

    ab, bc, ca = map(int, sys.stdin.readline().split())

    print(int(ab*bc/2))


if __name__ == '__main__':
    main()

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

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

if a>=b and a>=c:
    print(b*c//2)

elif b>=a and b>=c:
    print(a*b//2)

else:
    print(a*b//2)

Submission status: Accepted

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

Submission status: Accepted

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

if m ==a:
  ans = b*c/2
elif m ==b:
  ans = a*c/2
elif m ==c:
  ans = a*b/2

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

t.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#----------
AB,BC,CA = list(map(int, input().rstrip().split()))
#----------
print( "{}".format(int((AB*BC)/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())
print((a * b)//2)

Submission status: Accepted

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

Submission status: Accepted

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

s = a*b//2

print(s)

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()))
M = max(a)
a.remove(M)
ans = 1 / 2
for aa in a:
    ans *= aa
print(int(ans))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((a * b) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    AB, BC, CA = map(int, input().split())
    print(AB * BC // 2)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

a, b, c = na()

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

r = a*b
if r%2 == 0:
    print(r//2)
else:
    print(r/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 * c // max(a,b,c) // 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,raw_input().split())
area = (A*B)/2
print area

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,_ = 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 sys
import math
import itertools

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

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

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    X, Y, _ = MAP()
    print(X*Y//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    side_length = list(map(int, input().split(" ")))
    even_side = 0
    for i in range(3):
        if side_length[i] % 2 == 0:
            even_side = side_length.pop(i)
            break
    if even_side ** 2 + side_length[0] ** 2 == side_length[1] ** 2:
        print(even_side * side_length[0] // 2)
    else:
        print(even_side * side_length[1] // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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.remove(max(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:
AB, BC, CA = [int(i) for i in input().split()]

S = (AB * BC) // 2

print(S)

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

Submission status: Accepted

Solution code:
def examA():
    L = LI(); L.sort()
    ans = L[0]*L[1]//2
    print(ans)
    return

def examB():
    return

def examC():
    return

def examD():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,ALPHABET, _ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 1e-9
alphabet = [chr(ord('a') + i) for i in range(26)]
ALPHABET = [chr(ord('A') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 16, Jan, 2020
"""

import sys
import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c = map(int, readline().decode('utf8').split())
print(a * b // 2)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    ab,bc,ca = map(int,input().split())
    ans = ab * bc // 2
    print(ans)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin
    r = stdin.readline()[:-1]
    #r = stdin.readlines()

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

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())
r= A*B*C/max(A,B,C)/2

print(int(r))

Submission status: Accepted

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

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

c, a, b = map(int, sys.stdin.readline().split())

def main():
    return c * a // 2

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

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

Submission status: Accepted

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

    print(int(AB * BC / 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 sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
abc = sorted([int(i) for i in input().split()])

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