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: Runtime Error

Solution code:
from itertools import accumulate
N,K = map(int,input().split())
td = [tuple(map(int,input().split())) for i in range(N)]

td.sort(key=lambda x:-x[1])
td = [(x[0]-1,x[1]) for x in td]
t = [-1]*N
for i in range(N):
    t[td[i][0]] = 0
for i in range(K):
    t[td[:K][i][0]] = 1

t_used = [i for i in range(N) if t[i]==1]
t_not_used = [i for i in range(N) if t[i]==0]

d_top = [0]*N
d_top_candi = [0]*N
d_rest = []
d_candi = []

for i in range(K):
    if t[td[i][0]] == 1:
        if d_top[td[i][0]] == 0:
            d_top[td[i][0]] = td[i][1]
        else:
            d_rest.append(td[i][1])
for i in range(K,N):
    if t[td[i][0]] == 0:
        if d_top_candi[td[i][0]] == 0:
            d_top_candi[td[i][0]] = 1
            d_candi.append(td[i][1])

ans = len(t_used)**2+sum(d_top)
d_rest.sort()
d_candi.sort(key=lambda x:-x)

d_rest_cum = list(accumulate(d_rest))
d_candi_cum = list(accumulate(d_candi))
ans += d_rest_cum[-1]

for k in range(min(len(d_rest),len(d_candi))):
    ans = max(ans + (k+1)*(k+1+2*len(t_used)) + d_candi_cum[k] - d_rest_cum[k],ans)

print(ans)

Submission status: Runtime Error

Solution code:
a = [input() for i in range(3)]
print(a[0]＊a[1]/2)

Submission status: Runtime Error

Solution code:
a = [input() for i in range(3)]
print(a[0]*a[1]/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input().split()
s.sort()
print(s[0]*s[2]/2)

Submission status: Runtime Error

Solution code:
s=input().split()
print(s.sort()[0]*s.sort()[2]/2)

Submission status: Runtime Error

Solution code:
colatz=[1,2,4]
colatz.append(int(input()))
if colatz[3]==1 or 2 or 4:
    print(4)
else:
    b=3
    while colatz[b]!=4:
        if colatz[b]%2==0:
            colatz.append(colatz[b]/2)
        else: colatz.append(3*colatz[b]+1)
        b=b+1
    print(b+1)

Submission status: Runtime Error

Solution code:
colatz=[1,2,4]
colatz.append(int(input()))
b=3
while colatz[b]!=colatz[b-3]:
    if colatz[b]%2==0:
        colatz.append(colatz[b]/2)
    else: colatz.append(3*colatz[b]+1)
    b=b+1
print(b+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
len=input().split
sorted(len, reverse=True)
print(len[0]*len[1]/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
h = [int(i) for i in input().split()]
import numpy as np

h = np.array(h)
zero = np.array([int(0) for i in range(len(h))])

def calc(h, zero, minus):
    for k in range(len(h)):
        if minus[k] != 0:
            if k == len(h) - 1:
                zero[k] = zero[k] + 1
                return
            for w in range(k+1, len(h)):
                if minus[w] == 0:
                    zero[k:w] = zero[k:w] + 1
                    return
                elif w == len(h) - 1:
                    zero[k::] = zero[k::] + 1
                    return

def main(h, zero):
    i = 0
    minus = h - zero
    while np.sum(minus) != 0:
        calc(h ,zero, minus)
        i += 1
        minus = h - zero
    print(i)

main(h, zero)

Submission status: Runtime Error

Solution code:
a = [[int(i) for i in input().split()] for i in range(N)]
menseki = a[0]*a[1]/2
print(menseki)

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
a = sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda x:-x[1])
 
ans = 0
s = set()
q = []
 
for i in range(k):
    ans += a[i][1]
    if a[i][0] in s:
        q.append(a[i][1])
    s.add(a[i][0])
 
ans += len(s)**2
k1 = k
ans1 = ans
 
#はじめ0~k-1までの和がansなので、k~n-1でチェック
while k1 < n and q:
    if a[k1][0] not in s:
        ans1 = ans1+a[k1][1]-q.pop()-len(s)**2+(len(s)+1)**2
        ans = max(ans, ans1)
        s.add(a[k1][0])
    k1 += 1
 
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=map(input(),split(),int())
b.remove(max(b))
print(b[0]*b[1])

Submission status: Runtime Error

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

print(a*b//2)

Submission status: Runtime Error

Solution code:
def main():
    with open('sample.txt') as f:
        ab, bc, ca = [int(x) for x in f.readline().rstrip().split()]
        print(ab * bc // 2)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

print((int)a*b/2)

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
td=[[int(a) for a in input().split()]for i in range(N)]

td=sorted(td,key=lambda x:-x[1])

ans=0
eat=[]
noteat=[]
for t,d in td[:K]:
  ans+=d
  if t not in eat:
    eat.append(t)
  else:
    noteat.append(d)
temp_result=ans+len(eat)**2
max_result=temp_result

for t,d in td[K:]:
  if not noteat:
    break
  if t not in eat:
    temp_result+=2*len(eat)+1
    temp_result+=d-noteat.pop()
    eat.add(t)
    max_result=max(max_result,temp_result)
print(max_result)

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
td=[[int(a) for a in input().split()]for i in range(N)]

td=sorted(td,key=lambda x:-x[1])

ans=0
eat=[]
noteat=[]
for t,d in td[:K]:
  ans+=d
  if t not in eat:
    eat.append(t)
  else:
    noteat.append(d)
temp_result=ans+sum(eat)**2
max_result=temp_result

for t,d in td[K:]:
  if not noteat:
    break
  if t not in eat:
    temp_result+=2*len(eat)+1
    temp_result+=d-noteat.pop()
    eat.add(t)
    max_result=max(max_result,temp_result)
print(max_result)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
arr=sorted([a,b,c])
print(arr[0]*arr[1])
return arr[0]*arr[1]

Submission status: Runtime Error

Solution code:
ab=int(input())
bc=int(input())
ca=int(input())

s1=(ab+bc+ca)/2
s2=s1*(s1-ab)*(s1-bc)*(s1-ca)
s2=s2**0.5
print(s2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list_a = [a,b,c]
list_b = list_a.sort()

A = list_b[0]
B = list_b[1]

tri = A * B /2

Submission status: Runtime Error

Solution code:
ab=input()
bc=input()
ca=input()

s1=(ab+bc+ca)/2
s2=s1*(s1-ab)*(s1-bc)*(s1-ca)
s2=s2**0.5
print(s2)

Submission status: Runtime Error

Solution code:
def run(a):
    return a[0] * a[1] // 2


def main():
    a = map(int, input().split())
    print(run(a))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:

def read_input1():
    n, k = map(int, input().split())

    data_tuples = []
    for i in range(n):
        data_tuples.append(tuple(map(int, input().split())))

    return n, k, data_tuples


def count_neta(sushi_set):
    neta = {s[0] for s in sushi_set}
    return len(neta)


def sum_oishisa(sushi_set):
    oishisa = [s[1] for s in sushi_set]
    return sum(oishisa)


def check_value(sushi_set):
    neta_count = count_neta(sushi_set)
    oishisa = sum_oishisa(sushi_set)

    return oishisa + (neta_count * neta_count)


# ネタ数を減らさず、かつもっともおいしさの減少が少ないすしを探す
def check_changable_sushi(sushi_set):
    neta_count = count_neta(sushi_set)

    target = None
    for s in sushi_set:
        temp_sushi_set = sushi_set.remove(s)
        temp_neta_count = count_neta(temp_sushi_set)

        if neta_count == temp_neta_count:
            if target is None or target[1] > s[1]:
                target = s

        temp_sushi_set.append(s)
    return target


def find_other_sushi(all_sushi_set, sushi_set):
    neta_eaten = [s[0] for s in sushi_set]
    candidate_sushi = [sushi for sushi in all_sushi_set if sushi[0] not in neta_eaten]

    if candidate_sushi:
        target = max(candidate_sushi, key=lambda x: x[1])
    else:
        target = None

    return target


def next_neta_variation(all_sushi_set, sushi_set):
    drop_target = check_changable_sushi(sushi_set)
    if drop_target:
        insert_target = find_other_sushi(all_sushi_set, sushi_set)

        if insert_target:
            new_set = sushi_set.copy()
            new_set.remove(drop_target)
            new_set.append(insert_target)
            return new_set
    return None


if __name__ == '__main__':
    n, k, sushis = read_input1()
    neta_candidate = {}

    sushis.sort(key=lambda x: x[1], reverse=True)

    init_sushi_set = sushis[:k].copy()
    neta_count = count_neta(init_sushi_set)
    neta_candidate[neta_count] = init_sushi_set

    curr_sushi_set = init_sushi_set
    while True:
        next_sushi_set = next_neta_variation(sushis, curr_sushi_set)
        if not next_sushi_set:
            break

        curr_sushi_set = next_sushi_set
        neta_count = count_neta(curr_sushi_set)
        neta_candidate[neta_count] = curr_sushi_set

    max_score = -1
    for sushis in neta_candidate.values():
        score = check_value(sushis)
        if max_score < score:
            max_score = score

    print(max_score)

Submission status: Runtime Error

Solution code:
0.5*a*b

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())

print(a*b/2)

Submission status: Runtime Error

Solution code:
n = int(input())
h_list = [int(_) for _ in input().split()]
ans = 0
while sum(h_list) != 0:
    # 0で区切られた、1以上の数のかたまりを数える
    # 要素が全て1以上ならansに+1して次のループ
    if h_list.count(0) == 0:
        ans += 1
    else:
        for i in range(1, n):
            # 1以上から0に下がった時にかたまりをカウント
            if h_list[i] == 0 and h_list[i - 1] != 0:
                ans += 1
            elif i == n - 1 and h_list[i] != 0:
                ans += 1
    # 1以上の箇所を1段ずつ落とす
    for i in range(n):
        if h_list[i] != 0:
            h_list[i] -= 1

print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
h_list = [int(_) for _ in input().split()]
ans = 0 
while sum(h_list) != 0:
    # 0で区切られた、1以上の数のかたまりを数える
    # 要素が全て1以上ならansに+1して次のループ
    if h_list.count(0) == 0:
        ans += 1
    else:
        for i in range(0,n):
            # 1以上から0に下がった時にかたまりをカウント
            if i != 0 and h_list[i] == 0 and h_list[i - 1] != 0:
                ans += 1
            elif i == n and h_list[i] != 0:
                ans += 1
    # 1以上の箇所を1段ずつ落とす
    for j in range(n):
        if h_list[j] != 0:
            h_list[j] -= 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=int(raw_input())
f=lambda x:(x/2)*(x%2==0)+(3*x+1)*(x%2==1)
r=[s]
map(lambda x:r.append(f(r[-1])),xrange(1,100000))
for i in xrange(1,100000):
  try:
    s=r[i+1:].index(r[i])
    rs=i+4
    break
  except:
    pass
print rs

Submission status: Runtime Error

Solution code:
import sys
def main(a,b,c):
  return (a*b)/2

if __name__=="__main__":
  main(sys.argv[1],sys.argv[2],sys.argv[3])

Submission status: Runtime Error

Solution code:
a = [int(input())]
f = lambda n : n // 2 if n % 2 == 0 else 3 * n + 1
i = 2
while f(a[-1]) not in a:
    a.append(f(a[-1]))
    i += 1
print(i)

Submission status: Runtime Error

Solution code:
x,y,z=[int(i) for i in range(input)]
print(x*y/2)

Submission status: Runtime Error

Solution code:
from operator import itemgetter

def inpl(): return [int(i) for i in input().split()]

N,K = inpl()
d = {}
ans = 0
n0 = []
n1 = []

for i in range(N):
    ti,di = inpl()
    if (ti in d.keys()):
        d[ti].append(di)
    else:
        d[ti] = [di]

for i in d.keys():
    sortedd = sorted(d[i],reverse = True)
    n1.append(sortedd[0])
    n0 += sortedd[1:]

n0.sort(reverse = True)
n1.sort(reverse = True)

for i in range(K+1):
    if(K-i <= len(n0) and 0<=K-i):
        total = sum(n1[:i])+sum(n0[:K-i])+(i)**2
        if(ans<total):
            ans = total

print(ans)

Submission status: Runtime Error

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

#X = A * B / 2
# 商の整数値（小数点以下を切り捨て）
X = A * B // 2
print(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

x=[a,b,c]

x.sort()

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

Submission status: Runtime Error

Solution code:
from math import pow






def compute_score(target_collection):
    keys = {neta_point[0] for neta_point in target_collection}
    points = [neta_point[1] for neta_point in target_collection]
    cardinality = len(keys)
    score = pow(cardinality, 2) + sum(points)
    return score

# exchange one record and compare
def optimize(full_collection, target_collection, target_collection_len, idx):
    while True:
        ex_record = full_collection[idx]
        # check on the idx-th record
        idx += 1
        # bump up for return value
        if ex_record in target_collection:
            continue # cardinality score will not increase
        else:
            for i in range(target_collection_len-1):
                if target_collection[i][0] == target_collection[i-1][0]:
                    target_collection[i] = ex_record
                    new_score = compute_score(target_collection)
                    return new_score, target_collection, idx
        # default
        return 0, target_collection, idx



def cal_score(N, K, records):
    sorted_recs = sorted(records, reverse=True, key=lambda x: x[1])
    target_collection = sorted_recs[0:K]
    score =  compute_score(target_collection)

    # optimzie at most K times
    idx = K
    for i in range(K):
        new_score, new_target_collection, idx = optimize(sorted_recs, target_collection, K, idx)
        if new_score <= score: # no optimization occured
            break
        else:
            score = new_score
    return score
  
N, K = map(int, input().split())
records = [tuple(map(int, input().split())) for i in range(N)] 
score =cal_score(N, K, records)
print(score)

Submission status: Runtime Error

Solution code:
n = int(input())
h = list(map(int,input().split()))
ans = 0
for _ in range(100):
  streak = False
  for i in range(n):
    if h[i] > 0:
      h[i] -= 1
      if streak:
        pass
      else:
        ans += 1
        streak = True
    else:
      streak = False
print(ans)

Submission status: Runtime Error

Solution code:
[print(a*b//2)for a,b,_ in[[*map(int,input().split())]]]

Submission status: Runtime Error

Solution code:
[print(a*b/2)for a,b,_ in[[*map(int,input().split())]]]

Submission status: Runtime Error

Solution code:
AB = int(input("|AB|"))
BC  = int(input("|BC|"))
CA  = int(input("|CA|"))
S = AB*BC/2
print(S)

Submission status: Runtime Error

Solution code:
def main():
    N, K = map(int, input().split())
    td = []
    for _ in range(N):
        ti, di = map(int, input().split())
        td.append([ti, di])
    td.sort(key=lambda x: -x[1])
    num = 0
    kind = set()
    changable = []
    for i in range(K):
        num += td[i][1]
        if td[i][0] in kind:
            changable.append(td[i][0])
        else:
            kind.add(td[i][0])
    num += len(kind) ** 2
    ans = num

    for i in range(K, N):
        if not changable:
            break
        if td[i][0] not in kind:
            num += td[i][1] + 2 * len(kind) + 1 - changable.pop()
            kind.add(td[i][0])
            ans = max(ans, num)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
h_list = list(map(int, input().split(" ")))

h_dict = {}
for elm_i, elm in enumerate(h_list):
    try:
        h_dict[elm].append(elm_i)
    except:
        h_dict[elm] = [elm_i]

h_list = np.asarray(h_list)


def calc(group, past_out, group_start):
    out = 0
    while True:
        #print("group", group)
        min_val = min(group)
        group -= min_val
        out += min_val
        #zero_list = np.where(group == 0)[0]
        #print("outs", past_out, out, group)
        #print("zero0", zero_list)
        zero_list = h_dict[past_out + out]
        #print("zero_all", zero_list, group_start)
        zero_list = [elm_i - group_start for elm_i in zero_list if elm_i >= group_start and elm_i < group_start + len(group)]
        #print("zero", zero_list)

        cond1 = group.shape[0] - 1 in zero_list
        cond2 = 0 in zero_list

        if group.shape[0] == 1:
            #assert group[0] == 0
            break
        else:
            if cond1: 
                zero_list = zero_list[:-1]
                group = group[:-1]
            if cond2:
                group_start += 1
                zero_list = zero_list[1:]
                group = group[1:]

            if not cond1 and not cond2:
                break

            if group.shape[0] == 0:
                break


    if group.shape[0] <= 1:
        pass
    else:
        start_i = -1
        past_out = out
        for end_i in zero_list:
            child_group = group[start_i+1: end_i]
            #print("child_group", child_group)
            out += calc(child_group, past_out, group_start+start_i+1)
            start_i = end_i

        child_group = group[start_i+1:]
        if child_group.shape[0] >= 1:
            #print("child_group", child_group)
            out += calc(child_group, past_out, group_start+start_i+1)

    return out

out = calc(h_list, 0, 0)
print(out)

Submission status: Runtime Error

Solution code:
N = int(input())

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

L = [l_0]

m = None

count = 0

while L != []:
	for l in L:
		m = min(l)
		L.remove(l)
		for i in range(len(l)):
			l[i] = l[i] - m
		count += m
		l = " ".join( list(map(str , l)) )
		l = l.split("0")
		for a in l:
			L.append(list(map(int, (a.split()))))
		while [] in L:
			L.remove([])


print(count)

Submission status: Runtime Error

Solution code:
def main() -> None:
    ab, bc, ca = map(int, input())
    print(ab * bc // 2)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
A = input()
B = input()
C = input()
print(A*B/2)

Submission status: Runtime Error

Solution code:
#coding:utf-8
import copy
N, K = map(int,input().split())
T = []
D = []
ls_td = []
for n in range(N):
    t, d = map(int,input().split())
    ls_td.append([t,d])
ls_td = sorted(ls_td, key=lambda x: x[1])[::-1]
head = ls_td[:K]
tail = ls_td[K:]
def get_set(mat):
    st = set()
    for t,d in mat:
        st.add(t)
    return st
def score(mat):
    r = 0
    ls_t = set()
    for t,d in mat:
        ls_t.add(t)
        r += d
    r += len(ls_t)**2
    return r

def search_del(mat):
    idx = -1
    st = set()
    for i,(t,d) in enumerate(mat):
        if t in st:
            idx = i
        st.add(t)
    return idx
st = get_set(head)
current_score = score(head)
idx = search_del(head)
for t,d in tail:
    if idx == -1:
        break

    if t in st:
        pass
    else:
        new = copy.deepcopy(head)
        new[idx] = t,d
        candidate_score = score(new)
        if current_score < candidate_score:
            head = new
            st.add(t)
            current_score = candidate_score
            idx = search_del(head)
print (current_score)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline
    import collections
    n, k = map(int, input().split())
    td = [list(map(int, input().split())) for _ in range(n)]
    td.sort(key=lambda x: x[1], reverse=True)
    ans_list = [0]
    reverse_td = list(zip(*td))
    c = collections.Counter(reverse_td[0][:k])
    kind = len(c)
    ans = sum(reverse_td[1][:k])+kind**2
    check = k-1
    flag=False
    for i in range(k,n):
        t = td[i][0]
        d = td[i][1]
        if t in c:
            pass
        else:
            c[t]=1
            while True:
                new_t = td[check][0]
                if c[new_t]==1:
                    check -=1
                    if check == -1:
                        flag =True
                        break
                else:
                    c[new_t]-=1
                    ans_list.append(2*kind+1+d-td[check][1])
                    kind+=1
            if flag:
                break
    print(ans+max(ans_list))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
inp = int(input())
li = [inp]
i = 0
while True:
  if inp % 2 == 0:
    te = inp/2
    te = int(te)
    pass
  else:
    te = int(inp * 3 + 1)
  if te in li:
    print(int(len(li)+1))
    break
  else:
    li.append(te)
    inp = te

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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


if __name__ == '__main__':
    # スペース区切りの整数の入力
    b, c = map(int, input().split())
    # b, c = map(int, input().split())
    print(b * c / 2.0)

Submission status: Runtime Error

Solution code:
a = input()
if a[0]*a[0] + a[1]*a[1] == a[2]*a[2]:
	print a[0] * a[1] / 2
elif a[1]*a[1] + a[2]*a[2] == a[0]*a[0]:
	print a[1] * a[2] / 2
else:
	print a[2] * a[1] / 2

Submission status: Runtime Error

Solution code:
a = []
i = 0

s = int(input())

a.append(s)

while True:
    if(a[i] % 2 == 0):
        if(a[i] / 2 != 0):
        	ans = int(a[i] / 2)
        else:
            ans = 0
        if ans in a:
            print(i + 2)
            break
       	a.append(ans)
    else:
        anss = int(a[i] * 3 + 1)
        if anss in a:
            print(i + 2)
            break
        a.append(anss)

    i += 1

Submission status: Runtime Error

Solution code:
target=input(" ")
print(int(target[0])*int(target[1])/2)

Submission status: Runtime Error

Solution code:
inp = int(input())
li = [0]
i = 0
while True:
  te = inp/2
  if te.is_integer():
    te = int(te)
    pass
  else:
    te = int(inp * 3 + 1)
  if te in li:
    print(int(len(li)+1))
    break
  else:
    li.append(te)
    inp = te

Submission status: Runtime Error

Solution code:
s = int(input())
s = max(min(s, 100), 1)

f = lambda x: x * 0.5 if x % 2 == 0 else 3*x + 1
array = [s]
while s != 1:
    s = f(int(s))
    array.append(s)
array.append(4)
freq = len(array)
idx = 0
for n, i in enumerate(array):
    for j in array[n:]:
        if s == j:
            idx = n + 2
            break
print(idx)

Submission status: Runtime Error

Solution code:
a = []
i = 0

s = int(input())

a.append(s)

while True:
    if(a[i] % 2 == 0):
        if(a[i] / 2 != 0):
        	ans = int(a[i] / 2)
        else:
            ans = 0
        if ans in a:
            print(str(i + 2))
            break
       	a.append(ans)
    else:
        anss = int(a[i] * 3 + 1)
        if anss in a:
            print(str(i + 2))
            break
        a.append(anss)

    i += 1

Submission status: Runtime Error

Solution code:
a = []
i = 0

s = int(input())

a.append(s)

while True:
    if(a[i] % 2 == 0):
        ans = int(a[i] / 2)
        if ans in a:
            print(str(i + 2))
            break
       	a.append(ans)
    else:
        anss = int(a[i] * 3 + 1)
        if anss in a:
            print(str(i + 2))
            break
        a.append(anss)

    i += 1

Submission status: Runtime Error

Solution code:
inp = int(input())
li = [0]
i = 0
while i == 0:
  te = inp/2
  if te.is_integer():
    pass
  else:
    te = inp * 3 + 1
  if te in li:
    print(int(len(li)+1))
    i = 1
  li.append(te)
  inp = te

Submission status: Runtime Error

Solution code:
a = []
i = 0

s = int(input())

a.append(s)

while True:
    if(a[i] % 2 == 0):
        ans = int(a[i] / 2)
        if ans in a:
            print(str(i + 2))
            break
       	a.append(ans)
    else:
        anss = int(a[i] * 3 + 1)
        if anss in a:
            print(str(i + 2))
            break
        a.append(anss)

    i += 1
    
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = map(int, input(), split())
if a[0]*a[0] + a[1]*a[1] == a[2]*a[2]:
	print a[0] * a[1] * 0.5
elif a[1]*a[1] + a[2]*a[2] == a[0]*a[0]:
	print a[1] * a[2] * 0.5
else:
	print a[2] * a[1] * 0.5

Submission status: Runtime Error

Solution code:
int1=input('')
int2=input('')
int3=input('')
a=int(int1)
b=int(int2)
c=int(int3)
print(a*b//2)

Submission status: Runtime Error

Solution code:
def f(a):
  if a%2 == 0:
    return a//2
  else:
    return 3*a+1

s = int(input())
a = [s]
i=2
 
while(True):
  a.append(f(a[i-2]))
  if a[i-1] in a[:i-1]:
    print(i)
    break
  i=i+1

Submission status: Runtime Error

Solution code:
a = int(input())
if a[0]*a[0] + a[1]*a[1] == a[2]*a[2]:
	print a[0] * a[1] * 0.5
elif a[1]*a[1] + a[2]*a[2] == a[0]*a[0]:
	print a[1] * a[2] * 0.5
else:
	print a[2] * a[1] * 0.5

Submission status: Runtime Error

Solution code:
inp = int(input())
li = [0]
for i in li:
  te = inp/2
  if te.is_integer():
    pass
  else:
    te = inp * 3 + 1
  if te in li:
    print(int(len(li)+1))
    break
  li.append(te)
  inp = te

Submission status: Runtime Error

Solution code:
a = input()
if a[0]*a[0] + a[1]*a[1] == a[2]*a[2]:
	print a[0] * a[1] * 0.5
elif a[1]*a[1] + a[2]*a[2] == a[0]*a[0]:
	print a[1] * a[2] * 0.5
else:
	print a[2] * a[1] * 0.5

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c = [3], [4], [5]
if a[0]*a[0] + b[0]*b[0] == c[0]*c[0]:
	print a[0] * b[0] * 0.5
elif b[0]*b[0] + c[0]*c[0] == a[0]*a[0]:
	print b[0] * c[0] * 0.5
else:
	print c[0] * a[0] * 0.5

Submission status: Runtime Error

Solution code:
int1=input('')
int2=input('')
int3=input('')
AB=int(int1)
BC=int(int2)

print(AB*BC//2)

Submission status: Runtime Error

Solution code:
int1=input('')
int2=input('')
AB=str(int1)
BC=str(int2)
print(AB*BC//2)

Submission status: Runtime Error

Solution code:
int1=input('')
int2=input('')

AB=int(int1)
BC=int(int2)


print(AB*BC//2)

Submission status: Runtime Error

Solution code:
int1=input("")
int2=input("")

AB=int(int1)
BC=int(int2)


print(AB*BC//2)

Submission status: Runtime Error

Solution code:
int1=input("")
int2=input("")
int3=input("")

AB=int(int1)
BC=int(int2)
CA=int(int3)

print(AB*BC/2)

Submission status: Runtime Error

Solution code:
c = int(input())

a = int(input())

print(int(a*c/2))

Submission status: Runtime Error

Solution code:
3 4 5

Submission status: Runtime Error

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

X = A * B / 2
print(X)

Submission status: Runtime Error

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

print(int(ab * bc / 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(int(AB*BC*0.5))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a * b / 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())

print(int(A*B/2))

Submission status: Runtime Error

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