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:
s = int(input())
n = 1
tmp = s
if s == 1 or s == 2:
    print(4)
else:
    for i in range(1, 1000000):
        if tmp == 4:
            n = i
            break
        elif tmp % 2 == 0:
            tmp = tmp//2
        else:
            tmp = 3*tmp + 1
    print(n+3)

Submission status: Runtime Error

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

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.split(" "))
print((a*b)/c)

Submission status: Runtime Error

Solution code:
ソースコード 

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

Submission status: Runtime Error

Solution code:
ab, bc, ca = map(int, input().split())
5 12 13
S = int((ab * bc) /2)

print(S)

Submission status: Runtime Error

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

if a>b and a>c:
  print(int((1/2 * b * c)))
  
if b>a and b>c:
  print(int((1/2 * a * c)))
  
else:
  print(int((1/2 * a *b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def odd(a):
    return a/2

def even(b):
    return 3*b+1

num = int(input())
box = [num]
cnt = 0
answer = 0
while(True):
    if(num%2 == 0):
        num = odd(num)
    else:
        num = even(num)
    box.append(num)
    for i in range(len(box)-1):
        if(box[i] == num):
            answer = i
    if(answer != 0):
        print(str(i+2))
        break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=float(input())
b=float(input())
c=float(input())
c=a*b*1/2
print("%6.0f",c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
a=a*b*0.5
print(a)

Submission status: Runtime Error

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

print(a[0]*b[1])

Submission status: Runtime Error

Solution code:
n=int(input())
h=list(map(int, input().split()))
sum=0
for i in range(max(h)):
    if 0 not in h:
        h=[i-1 if i>0 else 0 for i in h]
        sum+=1
        # print(h,1)
    else:
        count0=[i for i, j in enumerate(h) if j==0]
        a=count0.copy() #copy()をつけないとaを変えるとcount0も変わる
        b=count0.copy()
        a.pop(0)
        b.pop(-1)
        c=[x-y for(x,y) in zip(a,b)]#a-bが要素のリストを作る
        sum = sum + len(c)-c.count(1)
        # print(count0)
        if count0[0]>0 and count0[-1]<n-1:
            sum +=2
            # print(1)
        elif count0[0]>0 or count0[-1]<n-1:
            sum +=1
            # print(2)
        else:
            sum +=0
        h=[i-1 if i>0 else 0 for i in h]
        # print(h,2)
print(sum)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D = int(input())

num = 25 - D
s = "Christmas"
s += " Eve" * num

print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = int(input())
a = [0] * 100000
a[0] = s

sum = 0
flag = 0
for i in range(100000):
    if a[i] % 2 == 0:
        a[i+1] = a[i] // 2
    else:
        a[i+1] = 3 * a[i] + 1
    sum += 1
    if a[i] in a[:i]:
        print(sum)
        exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=int(input())
a=[s]
for i in range(500):
    if a[i]%2==0:
        a.append(a[i]//2)
    else:
        a.append(a[i]*3+1)
ans=a.index(4)+4
if s==1 or s==2:
    print(4)
else:
    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 = [0 for i in range(3 * 1000000 + 1)]

s = int(input().rstrip())

a[s] = 1

for i in range(2, 1000000+1):
    if s % 2 == 0:
        s = int(s / 2)
    else:
        s = int(3 * s + 1)
    #print(s)
    
    if a[s] == 1:
        break
    a[s] = 1
        
print(i)

Submission status: Runtime Error

Solution code:
s = int(input())
x = 1
if s == 1 or s == 2:
    print(4)
else:
    while not s == 4:
        if s % 2 != 0:
            s = 3 * s + 1
            x = x + 1
               
        else:
            s = s // 2
            x = x + 1
        
        
print(x + 3)

Submission status: Runtime Error

Solution code:
p,q = map(int,input().split())
print(p * q / 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c=list(input().split())
AB=int(a)
BC=int(b)
ptint(int(AB*BC/2))

Submission status: Runtime Error

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

ans=x*y/2

print(int(k))

Submission status: Runtime Error

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

print(a*B/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

numbers = min(b)

b = [i - min(b) for i in b]

theend = False

while theend == False:
    if b.count(0) == a:
        theend = True
        break
        
    indexnotzero = 0

    for i in range(len(b)):
        if b[i] == 0:
            continue
        else:
            indexnotzero = i
            break

    if indexnotzero == len(b) - 1:
        numbers += b[len(b) - 1]
        break

    try:
        length = b.index(0, indexnotzero)
    except ValueError:
        length = len(b)
    minimum = min(b[indexnotzero:length])

    numbers += minimum

    b[indexnotzero:length] = [i - minimum for i in b[indexnotzero:length]]

print(numbers)

Submission status: Runtime Error

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

print(ab*bc/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#ABC117 A
T, X = map(int, input().split())
print(T/X)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
p,q,r=input().split()

x=int(p)
y=int(q)
z=int(r)

print(p*q/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if (A*A+B*B==C*C):
    print(A*B/2)
elif (A*A+C*C==B*B):
    print(A*C/2)
else:
    print(B*C/2)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
TD = [list(map(int, input().split())) for _ in range(N)]

TD = sorted(TD, key=lambda x: x[0])

sushi0 = []
sushi1 = []

for i in range(N):
    if i == 0:
        sushi1.append(TD[0][1])
    else:
        if TD[i][0] == TD[i - 1][0]:
            sushi0.append(TD[i][1])
        else:
            sushi1.append(TD[i][1])

sushi0 = sorted(sushi0, reverse=True)
sushi1 = sorted(sushi1, reverse=True)

L = len(sushi1)
ans, rans = 0, 0
for i in range(1, L + 1):  # sushi1からi個選択 sushi0からは(K-i)個
    ans = sum(sushi1[0:i]) + (i**2) + sum(sushi0[0:K - i])
    rans = max(rans, ans)
print(rans)

Submission status: Runtime Error

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

print(c*a/2)

Submission status: Runtime Error

Solution code:
ab=int(input())
bc=int(input())
ca=int(input())
m=1/2*ab*bc
print(m)

Submission status: Runtime Error

Solution code:
ab=int(input())
bc=int(input())
ca=int(input())
m=0.5*ab*bc
print(m)

Submission status: Runtime Error

Solution code:
from typing import List


def main() -> None:
    ab, bc, _ = get_params()
    print(area(ab, bc))


def get_params() -> List[int]:
    return [int(s) for s in input().split()]


def area(ab: int, bc: int) -> int:
    return 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:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input();print(eval(s[:2]+'*'+s[2:-2])//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from operator import itemgetter

n, k = map(int, input().split())
td = [tuple(int(x) for x in input().split()) for _ in range(n)]

a = sorted(td, key=itemgetter(1), reverse=True)

ans = [0]
s = set()
t = []
for i in range(k):
    ans[0] += a[i][1]
    if a[i][0] not in s:
        s.add(a[i][0])
    else:
        t.append(a[i][1])

p = len(s)
q = len(t) - 1

if q < 0:
    print(ans[0] + k * k)
    exit()

v = []
for i in range(k, n):
    if a[i][0] not in s:
        s.add(a[i][0])
        v.append(a[i][1])

ans[0] += p * p
d = 0

for x in v:
    ans.append(ans[d] + x - t[q] + (p + 1) * (p + 1) - p * p)
    p += 1
    d += 1
    q -= 1
    if q < 0:
        break

print(max(ans))

Submission status: Runtime Error

Solution code:
n=int(input())
h=list(map(int,input().split()))
cost=0
for i in range(n-1):
    if h[i]>h[i+1]:
        cost+=(h[i]-h[i+1])
    cost+=h[n-1]
print(cost)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
li=[[0,0] for i in range(n)]
for i in range(n):
    li[i][0],li[i][1]=map(int,input().split())

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

def find_num_neta(choice,li):
    k=[]
    for i in choice:
        k.append(li[i][0])
    return len(set(k))

#-----------------------------------------
best_list=[]
best_list_neta=[]
not_best_list=[]

for i in li:
    if i[0] in best_list_neta:
        not_best_list.append(i[1])
    else:
        best_list.append(i[1])
        best_list_neta.append(i[0])


s2=min(len(best_list_neta),k)
s1=find_num_neta(list(range(k)),li)


score=-1
for i in range(s1,s2+1):
    oishisa=0
    for j in range(i):
        oishisa+=best_list[j]
    for j in range(k-i):
        oishisa+=not_best_list[j]
    
    new_score=i**2+oishisa

    if score<new_score:
        score=new_score
        
    
print(score)

Submission status: Runtime Error

Solution code:
mizuyari=0
n=int(input())
s=list(map(int,input().split()))
def hiku(n):
    return n-1
for i in range(100):
    if s[0]>0:
        mizuyari+=1
    for j in range(n-1):
        if s[j]<=0 and s[j+1]>0:
            mizuyari+=1
    s=list(map(hiku,s))
else:
  print(mizuyari)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0
prev = 0

for h in hn:
    count += max(0, h-prev)
    prev = h

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input().strip().split(’ ’))
area = a*c
print("%d" % area)

Submission status: Runtime Error

Solution code:

     a = int(input())
     b = int(input())
     c = int(input())
     print(a*c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
while True:
     a = int(input())
     b = int(input())
     c = int(input())
     print(a*c)

Submission status: Runtime Error

Solution code:
import numpypy as np

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

Submission status: Runtime Error

Solution code:
import numpypy as np

Submission status: Runtime Error

Solution code:
s = input().split() #s_1 s_2を分割して取得し、sに値を入れる
print(s[0] * s[1] / 2)

Submission status: Runtime Error

Solution code:
N,K = list(map(int,input().split()))
TDlist = []

for x in range(0,N):
    TDlist.append(list(map(int,input().split())))

TDlist.reverse(key = lambda x: x[1])
kinds = []
seconds = []
answer = 0

for x in TDlist[:K]:
    if not x[0] in kinds:
        kinds.append(x[0])
    else:
        seconds.append(x[1])
    answer += x[1]

answer += len(kinds)**2
score = answer
max_score = answer

for x in TDlist[K:]:
    if seconds == []:
        break
    if x[0] in kinds:
        continue
    kinds.append(x[0])
    y = seconds.pop()
    score += (x[1] - y) + (len(kinds)*2 -1)
    max_score = max(score,answer)
    

answer = max(answer,max_score)

print(answer)

Submission status: Runtime Error

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

print(a * b / 2)

Submission status: Runtime Error

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

s = a * b / 2

print(s)

Submission status: Runtime Error

Solution code:
def takeSecond(elem):
    return elem[1]

n,k = map(int,input().split())

sushi = [list(map(int,input().split())) for i in range(n)]

sushi.sort(key=takeSecond,reverse=True)

selected = sushi[:k]
kindset = set([item[0] for item in selected])

startKindNum = len(kindset)

score = startKindNum*startKindNum + sum([item[1] for item in selected])
maxscore = score
front_pointer = k - 1
pointer = k
for i in range(startKindNum+1,min([k+1,n+1])):
    #remove the smallest one that does not decrease kind
    for p in range(front_pointer,-1,-1):
        item = selected[p]
        flag = False
        for idx in range(p):
            if(selected[idx][0]==item[0]):
                score -= item[1]
                selected.remove(item)
                front_pointer = p - 1
                flag = True
                break
        if(flag):
            break

    #add the largest one that add kind
    for j in range(pointer,n):
        if(sushi[j][0] not in kindset):
            selected.append(sushi[j])
            kindset.add(sushi[j][0])
            k += 1
            pointer = j + 1            
            score += 2*startKindNum + 1 + sushi[j][1]
            if(score>maxscore):
                maxscore = score
            startKindNum += 1
            break
print(maxscore)

Submission status: Runtime Error

Solution code:
s=int(input())
def is_even(num):
    return num % 2 == 0
list=[]
list.append(s)

def calc(s):
	if is_even(int(s)):
		return (int((s)/2))
		list.append(s)
	else:
		return (int((s)*3+1))
		list.append(s)
	s=int(calc(s))
check=[1,2,4]
for (s) in (check):
	if not (s) in (check):
		calc(s)
else:
	print (int(s)+3)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = int(input())
an = []
an.append(s)
n = s
while an.count(4) != 2:
    if n % 2 == 0:
        n /= 2
        an.append(int(n))
    else:
        n = 3 * n + 1
        an.append(int(n))
if an.index(1 or 2) == 0:
    print(4)
else:
    print(an.index(4) + 4)

Submission status: Runtime Error

Solution code:
s = int(input())
an = []
an.append(s)
n = s
while an.count(1 or 2 or 4) != 2:
    if n % 2 == 0:
        n /= 2
        an.append(int(n))
    else:
        n = 3 * n + 1
        an.append(int(n))
print(an.index(4) + 4)

Submission status: Runtime Error

Solution code:
s = int(input())
an = []
an.append(s)
n = s
while an.count(1 or 2 or 4) != 2:
    if n % 2 == 0:
        n /= 2
        an.append(int(n))
    else:
        n = 3 * n + 1
        an.append(int(n))
print(an.index(4) + 4)

Submission status: Runtime Error

Solution code:
s = int(input())
an = []
an.append(s)
n = s
while an.count(4) != 2:
    if n % 2 == 0:
        n /= 2
        an.append(int(n))
    else:
        n = 3 * n + 1
        an.append(int(n))
print(an.index(4) + 4)

Submission status: Runtime Error

Solution code:
s = int(input())
an = []
an.append(s)
n = s
while an.count(4) != 2:
    if n % 2 == 0:
        n /= 2
        an.append(int(n))
    else:
        n = 3 * n + 1
        an.append(int(n))
print(an.index(4) + 4)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from itertools import groupby
from heapq import heapify, heappop

N, K = map(int, input().split())
sushi = [tuple(map(int, input().split())) for _ in range(N)]

srt = sorted(sushi, key=lambda x: x[1], reverse=True)
eat, non_eat = srt[:K], srt[K:]

maxs = []
rems = []
kinds = set()
for k, g in groupby(sorted(eat, key=lambda x: x[0]), key=lambda x: x[0]):
    d = list(list(zip(*g))[1])
    maxs.append(d.pop(0))
    rems.extend(d)
    kinds.add(k)
heapify(rems)
ans = sum(maxs) + sum(rems) + len(kinds)**2

for k, g in groupby(sorted(non_eat, key=lambda x: x[0]), key=lambda x: x[0]):
    if k in kinds:
        continue
    if not rems:
        break
    d = list(list(zip(*g))[1])
    maxs.append(d.pop(0))
    heappop(rems)
    kinds.add(k)
    ans = max(ans, sum(maxs) + sum(rems) + len(kinds)**2)

print(ans)

Submission status: Runtime Error

Solution code:
import reduce from functools
import mul from operator

def solve():
	L = [int(i) for i in input().split()]
	return reduce(mul, L) // (2 * max(L))

print(solve())

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

L.pop(L[L.index(max(L))])
S = 1
for i in range(2):
  S *= L[i]
  
print(S//2)

Submission status: Runtime Error

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

L.pop(L[L.index(max(L))])
S = 1
for i in range(2):
  S *= L[i]
  
print(S)

Submission status: Runtime Error

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

print(a*b//2)

Submission status: Runtime Error

Solution code:
sides = raw_input()
sides = [int(i) for i in sides]
m = max(sides)
sides = [i for i in sides if i!=m]
print(sides[0]*sides[1]/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def f(li):
  global ans
  
  #終了条件
  if li==[]:
    del li
    return
  
  #再帰
  min_num=min(li)
  if min(li)>0:
    count+=min(li)
    li=list(map(lambda x: x-min(li), li))
  li=[li[:li.index(0)],li[li.index(0)+1:]]
  f(li[0])
  f(li[1])

f(h)
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
lines = map(int, input().split())
lines.sort()

print(lines[0] * lines[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = [int(x) for x in input().split]
L.sort()
print(L[1] * L[2] / 2)

Submission status: Runtime Error

Solution code:
L = [int(x) for x in input().split]
L.sort()
print(L[1] * L[1] / 2)

Submission status: Runtime Error

Solution code:
L = [int(x) for x in input().split]
L.sort()
print(L[1] * L[1])

Submission status: Runtime Error

Solution code:
def calc_range_num(h,height,max_height,ans):#各階層にいくつ区間があるか
    for i in range(len(h)):
        if h[i]>=height and height != 0:
            if i+1<len(h) and h[i]>h[i+1] and h[i+1] <=height:
            #基本的には、高さが下がったところでインクリメント
                ans+=1
            elif i==len(h)-1 and h[i]>height:
                ans+=1
    height+=1
    if height>max_height:
        return ans
    else:
        ans = calc_range_num(h,height,max_height,ans)
    return ans
            
N = int(input())
h = list(map(int, input().split()))
max_height=max(h)
ans=0
print(calc_range_num(h,1,max_height,ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(ab * bc / 2)

Submission status: Runtime Error

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

print(ab * bc / 2)

Submission status: Runtime Error

Solution code:
|AB| * |BC| / 2

Submission status: Runtime Error

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

hect = a*b*0.5
print(hect)

Submission status: Runtime Error

Solution code:
#ABC116D-VariousSushi.py

from sys import stdin
#from numpy import sum

input = stdin.readline

N, K = list(map(int, input().split()))
List1= []
kind = set()
point1, point2 = 0, 0

INPUT = [tuple(map(int, input().split())) for _ in range(N)]

INPUT.sort(key = lambda x: -x[1])

for ti, di in INPUT[:K]:
    point1 += di
    if ti in kind:
        List1.append(di)
    kind.add(ti)

point2 = len(kind)

Score = point1 + point2**2
Test = Score

List1POP = List1.pop

for ti, di in INPUT[K:]:
    if 0 >= len(List1):
        break
    if ti in kind:
        continue
    Test = Test - List1POP() + di + 2 * point2 + 1
    point2 += 1
    kind.add(ti)
    Score = max(Score, Test)

print(Score)

Submission status: Runtime Error

Solution code:
#ABC116D-VariousSushi.py

from sys import stdin
from numpy import sum

input = stdin.readline

N, K = [int(n) for n in input().split()]
INPUT = [[None for i in range(2)] for j in range(N)]
List1, List2 = [], []
kind1 = []

for i in range(N):
    INPUT[i][0], INPUT[i][1] = [int(m) for m in input().split()]

INPUT = sorted(INPUT, key = lambda x: (x[1], x[0]), reverse=True)

for i in range(N):
    if INPUT[i][0] not in kind1:
            List1.append([INPUT[i][1], 1])
            kind1.append(INPUT[i][0])
    else: List1.append([INPUT[i][1], 0])

List2 = List1[K:]
if List2 != []:
    List2.sort(key =lambda x : (x[1],x[0]))
    del List1[K:]
    lenList2 = len(List2)
else: lenList2 = 0

List1 = sorted(List1, key = lambda x : (x[1], x[0]), reverse=True)

sum = sum(List1, axis = 0)

Score = sum[0] + sum[1]**2
Test = Score
kindnumber = sum[1]

for i in range(lenList2):
    if List2[-1][1] == 0 or List1[-1][1] == 1:
        break
    Test = Test - List1.pop()[0] + List2.pop()[0] + 2 * kindnumber + 1
    kindnumber = kindnumber + 1
    if Test >= Score:
        Score = Test

print(int(Score))

Submission status: Runtime Error

Solution code:
#coding:UTF-8
As=input()
Bs=input()
Cs=input()
a=int(As)
b=int(Bs)
print(a*b/2)

Submission status: Runtime Error

Solution code:
#coding UTF-8
As=input()
Bs=input()
Cs=input()
a=int(As)
b=int(Bs)
print(a*b/2)

Submission status: Runtime Error

Solution code:
As=input()
Bs=input()
Cs=input()
a=int(As)
b=int(Bs)
print(a*b/2)

Submission status: Runtime Error

Solution code:
from sys import stdin
# read data for n sequences.
n = stdin.readline().rstrip()
a = int(n[0])
b = int(n[2])
c = int(n[4])
#data = [int(stdin.readline().rstrip()) for _ in range(n)]

out = int(a * b /2)

print(out)

Submission status: Runtime Error

Solution code:
 import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
from operator import itemgetter


sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)

def main():
    # 種類最小から最大までそれぞれ計算する
    N, K = LI()
    T = []
    D = []
    TD = []
    for i in range(N):
        TD.append(LI())
    #  print(T, '\n', D)
    TD = sorted(TD, key=itemgetter(1), reverse=True)
    #  print('TD', TD)

    max_value_per_type = [[t, max([td[1] for td in TD if td[0] == t])]for t in set([i[0] for i in TD])]
    #  print('max_value_per_type', max_value_per_type)
    content_per_type = [[t, [i[1] for i in TD if i[0] == t]] for t in set(i[0] for i in TD)]
    #  print(content_per_type)
    max_idx_per_type = [i[1].index([mvpt[1] for mvpt in max_value_per_type if mvpt[0] == i[0]][0]) for i in content_per_type]
    #  print('max_idx_per_type', max_idx_per_type)
    for idx, i in enumerate(max_idx_per_type):
        del content_per_type[idx][1][i]
    #  remaining_values_per_type = [[c[0], [i[0] for i in content_per_type if ]] for c in content_per_type]
    #  print('各タイプから最大値を抜きました', content_per_type)
    results = [0]
    for i in range(1, K+1):
        #  print('\n---------\n',i,'回目')
        # iを種類数とみなす
        # 何を選んだかは関係ない
        
        # 種類の全組み合わせを求める
        #  print(i)
        if len(set([i[0] for i in TD])) < i:
            break 
        combinations = list(itertools.combinations(set([i[0] for i in TD]), i))
        #  print('combi', combinations)
        type_bonus = i * i
        for combination in combinations:
            #  print('\n')
            # 各組み合わせでの最大値を求める
            current_options = [i for i in TD if i[0] in combination]
            
    print(max(results))


main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print((a + b) / 2)

Submission status: Runtime Error

Solution code:
ab = int(input(""))
bc = int(input(""))
print(ab * bc / 2)

Submission status: Runtime Error

Solution code:
print(ab * bc / 2)

Submission status: Runtime Error

Solution code:
ab = int(input(""))
bc = int(input(""))
ab * bc / 2

Submission status: Runtime Error

Solution code:
ab = int()
bc = int()
print(a*b)

Submission status: Runtime Error

Solution code:
ab = int("")
bc = int("")
ca = int("")
print(ab * bc / 2)

Submission status: Runtime Error

Solution code:
ab*bc

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ab = int(input(""))
bc = int(input(""))
ca = int(input(""))
ab > bc > ca
print(ab*bc/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
arr = raw_input().split()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
list(map(lambda n: print(int(n[0]) * int(n[1]) / 2, map(str.split, sys.stdin)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C = sported(list(map(int,input().split())))
print(int(A*B*0.5))

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
h = []
for i in range(n):
    t, d = map(int, input().split())
    h.append((t,d))
h.sort(key=lambda x: -x[1])

taste = 0
typen = 0
typecnt = {}
bad = []


for i in range(k):
    typecnt[h[i][0]] = typecnt.get(h[i][0], 0) + 1
    if(typecnt[h[i][0]] == 1):
        typen += 1
    else:
        bad.append(h[i][1])
    taste += h[i][1]

# print(h)
# print(typecnt)
# print(bad)

ans = taste + typen**2

for i in range(k, n):
    if(len(bad) == 0):
        break
    cnt = typecnt.get(h[i][0], 0)
    if(cnt != 0):
        continue
    else:
        typecnt[h[i][0]] = cnt + 1
    typen += 1
    taste -= bad.pop()
    taste += h[i][1]
    ans = max(ans, taste + typen**2)

print(ans)

Submission status: Runtime Error

Solution code:
def bonus(i, l):
  if i in l:
    return 0
  else:
    return (len(l)+1)*(len(l)+1) - len(l)*len(l)

l = raw_input().split()
n = []
variety =[]
count = 0
for x in range(int(l[0])):
  n.append(map(lambda x: int(x),raw_input().split()))

for y in range(int(l[1])):
  max_saf = 0
  num = 0
  for i, x in enumerate(n):
    if max_saf < x[1] + bonus(x[0], variety):
      max_saf = x[1] + bonus(x[0], variety)
      num = i
    
  count = count + max_saf
  print(n[num])
  print(variety)
  print(max_saf)
  if not n[num][0] in variety:
  	variety.append(n[num][0])
  del n[num]
    
    
print (count)