Source
stringclasses
1 value
Date
int64
2.01k
2.02k
Text
stringlengths
22
783k
Token_count
int64
20
394k
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print(int(a*b/2))
20
Project_CodeNet
2,019
l=list(map(int,input().split())) l.sort() print(l[0]*l[1]//2)
23
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print(a * b // 2)
21
Project_CodeNet
2,020
import math def solve_A(): a, b, c = map(int, input().split()) s = (a + b + c) / 2 area = s * (s-a) * (s-b) * (s-c) return math.sqrt(area) print(int(solve_A()))
66
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print((a * b) // 2)
23
Project_CodeNet
2,019
#!/usr/bin/env python3 def main(): [AB, BC, CA] = list(map(int, input().split())) print(AB * BC // 2) if __name__ == '__main__': main()
48
Project_CodeNet
2,020
AB, BC, CA = map(int, input().split()) print(AB * BC // 2)
22
Project_CodeNet
2,019
a=list(map(int,input().split())) r=[e for e in a if e != max(a)] print(int(r[0]*r[1]/2))
33
Project_CodeNet
2,019
AB,BC,CA = map(int,input().split()) print(AB*BC//2)
20
Project_CodeNet
2,019
AB,BC,CA = map(int,input().split()) print(int(AB*BC/2))
21
Project_CodeNet
2,019
hen_list = list(map(int,input().split())) sorted_hen_list = sorted(hen_list) menseki = sorted_hen_list[0]*sorted_hen_list[1]//2 print(menseki)
46
Project_CodeNet
2,019
a,b,c = map(int,input().strip().split()) print((a * b) // 2)
22
Project_CodeNet
2,019
a, b, c = map(int, input().split()) if a**2+b**2 == c**2: print(int(a*b/2)) elif b**2+c**2 == a**2: print(int(b*c/2)) else: print(int(c*a/2))
63
Project_CodeNet
2,020
A=list(map(int,input().split())) A.sort() print(A[0]*A[1]//2)
23
Project_CodeNet
2,019
ab, bc, ca = list(map(int, input().split())) # 整数 print(int(ab*bc / 2))
28
Project_CodeNet
2,019
#2019/09/23 AB, BC, CA = map(int, input().split()) print(int(AB * BC / 2))
31
Project_CodeNet
2,020
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)
46
Project_CodeNet
2,019
import sys if sys.platform =='ios': sys.stdin=open('input_file.txt') a,b,c=map(int,input().split()) print((a*b)//2)
37
Project_CodeNet
2,019
a,b,c=(int(i) for i in input().split()) s=(a+b+c)/2 print(int((s*(s-a)*(s-b)*(s-c))**(1/2)))
42
Project_CodeNet
2,019
c, a, b = map(int, input().split()) print(int(c*a/2))
20
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) print(int(ab*bc/2))
21
Project_CodeNet
2,019
a = list(map(int, input().split())) print((a[0] * a[1]) // 2)
25
Project_CodeNet
2,019
X, Y, Z = map(int, input().split()) print(int(int(X) * int(Y) /2))
25
Project_CodeNet
2,019
ab, bc, ca = map(int,input().split()) print(int(ab*bc/2))
20
Project_CodeNet
2,019
L = list(map(int,input().split())) print(int(L[0]*L[1]/2))
21
Project_CodeNet
2,019
ab,bc,ca = map(int,input().split(' ')) print(int(ab * bc /2))
22
Project_CodeNet
2,020
ab,bc,ca=sorted(map(int,input( ).split())) print(int(ab*bc*(1/2)))
24
Project_CodeNet
2,019
ab , bc, ca = map(int, input().split()) print(ab*bc//2)
20
Project_CodeNet
2,019
# -*- coding: utf-8 -*- def main(): ab, bc, ca = map(int, input().split()) print(ab * bc // 2) if __name__ == '__main__': main()
46
Project_CodeNet
2,019
c, a, b= list(map(int,input().split())) print(int(a*c/2))
20
Project_CodeNet
2,019
a = list(map(int,input().split())) a = sorted(a) print(int(a[0]*a[1]/2))
26
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) print(ab * bc // 2)
21
Project_CodeNet
2,019
#!/usr/bin/env python3 def solve(AB, BC, CA): print(int(AB * BC * 0.5)) # Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template) def main(): AB, BC, CA = list(map(int, input().split())) solve(AB...
122
Project_CodeNet
2,019
ab,bc,ca = map(int,input().split()) print(int(ab*bc/2))
20
Project_CodeNet
2,019
AB, BC, CA = map(int, input().split()) print(int(0.5 * AB * BC))
24
Project_CodeNet
2,019
N = list(map(int,input().split())) print(int(N[0]*N[1]/2))
21
Project_CodeNet
2,019
from sys import stdin a = map(int,stdin.readline().split()) a.sort() print (a[0]*a[1])/2
31
Project_CodeNet
2,019
d=list(map(int,input().split())) d.sort() print(d[0]*d[1]//2)
23
Project_CodeNet
2,020
AB,BC,CA = map(int, input().split()) print(AB*BC//2)
21
Project_CodeNet
2,019
AB, BC, CA = list(map(int,input().split())) print( int( AB * BC / 2) )
25
Project_CodeNet
2,019
a = list(map(int,input().split())) a = sorted(a) print(int(a[0]*a[1]/2))
26
Project_CodeNet
2,020
ab, bc, ca = map(int, input().split()) print(int(ab*bc*(1/2)))
23
Project_CodeNet
2,019
X = list(map(int, input().split())) X.sort() print(int(0.5*X[0]*X[1]))
27
Project_CodeNet
2,019
AB,BC,CA = map(int,input().split()) print(AB*BC//2)
20
Project_CodeNet
2,019
a,b,c=map(int, input().split()) ans=a*b/2 print(int(ans))
21
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) # = int(input()) # = input() # = list(map(int, input().split())) print(int(ab*bc/2))
40
Project_CodeNet
2,020
a = list(map(int, input().split())) a.sort() print(a[0] * a[1] // 2)
27
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print((a*b)//2)
20
Project_CodeNet
2,020
def main(): *L, = map(int, input().split()) L.sort() print(L[0] * L[1] // 2) if __name__ == '__main__': main()
45
Project_CodeNet
2,019
ab, bc, ca = input().split() print(int((int(ab)*int(bc))/2))
21
Project_CodeNet
2,020
AB,BC,CA = list(map(int,input().split())) print(AB * BC // 2)
22
Project_CodeNet
2,019
li = list(map(int,input().split())) A =li[0] B = li[1] print(int(A * B / 2))
30
Project_CodeNet
2,019
from sys import stdin def main(): N = list(map(int, input().split())) N.sort() print((N[1] * N[0]) // 2) input = lambda: stdin.readline().rstrip() main()
50
Project_CodeNet
2,019
AB, BC, CA = map(int, input().split()) print(int(0.5 * AB * BC))
24
Project_CodeNet
2,019
''' A - Right Triangle https://atcoder.jp/contests/abc116/tasks/abc116_a >>> main(3, 4, 5) 6 >>> main(5, 12, 13) 30 >>> main(45, 28, 53) 630 ''' def main(ab, bc, ca): print((ab * bc) // 2) if __name__ == '__main__': ab, bc, ca = map(int, input().split(' ')) main(ab, bc, ca)
115
Project_CodeNet
2,019
# -*- coding: utf-8 -*- ab,bc,ca = map(int, input().split()) print(bc*ab//2)
28
Project_CodeNet
2,020
a,b,c = map(int,input().split()) lis = [a,b,c] lis.remove(max(lis)) print(int(lis[0]*lis[1]/2))
36
Project_CodeNet
2,019
ab, bc, ca=map(int, input().split()) print(int(ab* bc/2))
21
Project_CodeNet
2,020
list = [int(i) for i in input().split()] list.sort() print(list[0]*list[1]//2)
28
Project_CodeNet
2,019
# Right Triangle import sys AB, BC, CA = map(int, input().split()) print((AB * BC) // 2)
30
Project_CodeNet
2,019
a, b, c = map(int,input().split()) print(int(min(a*b/2,b*c/2,c*a/2)))
28
Project_CodeNet
2,019
AB, BC, CA = map(int, input().split()) print(int(AB * BC / 2))
23
Project_CodeNet
2,019
# -*- coding:utf-8 -* n_list = list(map(int, input().split())) res = (n_list[0]*n_list[1])/2 print(int(res))
38
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) x, y, z = sorted((ab, bc, ca)) print(x * y // 2)
35
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print(a * b // 2)
21
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) print(ab * bc //2)
20
Project_CodeNet
2,020
import math a, b, c = map(int, input().split()) print(int((b**2 + c**2 - 2 * b * c * math.cos(math.atan(a / b)))**0.5 * b // 2))
52
Project_CodeNet
2,020
AB, BC, CA = map(int, input().split()) area = int((AB * BC) / 2) print(area)
28
Project_CodeNet
2,019
a, b, c = map(int, input().split()) output = a * b / 2 print(int(output))
26
Project_CodeNet
2,020
AB, BC, CA = map(int, input().split()) print(AB*BC//2)
21
Project_CodeNet
2,019
a,b,c = map(int,input().split()) s = int((a+b+c)/2) print(int((s*(s-a)*(s-b)*(s-c))**0.5))
39
Project_CodeNet
2,020
a,b,c = map(int,input().split()) print(int((a * b) / 2))
21
Project_CodeNet
2,019
l = list(map(int,input().split())) print(int(l[0] * l[1] / 2))
24
Project_CodeNet
2,019
AB,BC,CA = map(int,input().split()) S = AB * BC / 2 print(int(S))
25
Project_CodeNet
2,020
import sys def input(): return sys.stdin.readline().strip() def resolve(): a,b,c=map(int, input().split()) print(a*b//2) resolve()
37
Project_CodeNet
2,019
A,B,C=map(int,input().split()) l=[A,B,C] l.sort() print(int(l[0]*l[1]/2))
31
Project_CodeNet
2,019
list = list(map(int, input().split())) ab = list[0] bc = list[1] ac = list[2] print(int(0.5*ac*bc*ab/ac))
42
Project_CodeNet
2,020
x, y, z = map(int, input().split()) print(x * y // 2)
22
Project_CodeNet
2,020
# A - Right Triangle # https://atcoder.jp/contests/abc116/tasks/abc116_a ab, bc, ca = map(int, input().split()) result = int(ab * bc * 0.5) print(result)
52
Project_CodeNet
2,020
#116A # 1.値を正しく取得 a, b, c = (int(x) for x in input().split()) # 2.正しく処理 menseki = a * b / 2 print(int(menseki))
62
Project_CodeNet
2,019
#ABC116 A AB,BC,CA = list(map(int, input().split())) print(int(AB*BC/2))
28
Project_CodeNet
2,020
ab, bc, ca = map(int, input().split()) print(ab * bc // 2)
21
Project_CodeNet
2,020
a, b, c = map(int, input().split()) print(int(a * b / 2))
22
Project_CodeNet
2,019
AB, BC, CA = map(int, input().split()) print(int(AB * BC / 2))
23
Project_CodeNet
2,019
a, b, c = map(int, input().split()) print(a * b // 2)
21
Project_CodeNet
2,020
# abc116_a.py # https://atcoder.jp/contests/abc116/tasks/abc116_a # A - Right Triangle / # 実行時間制限: 2 sec / メモリ制限: 1024 MB # 配点 : 100点 # 問題文 # 直角三角形 ABCがあります。∠ABC=90°です。 # 三角形 ABCの三辺の長さである |AB|,|BC|,|CA| が与えられるので、直角三角形 ABCの面積を求めて下さい。 # ただし、三角形 ABCの面積は整数となることが保証されています。 # 制約 # 1≦|AB|,|BC|,|CA|≦100 # 入力はすべて整数である...
902
Project_CodeNet
2,019
a, b, c = map(int,input().split()) print((a * b) // 2)
22
Project_CodeNet
2,020
import sys a, b, c = map(int, sys.stdin.readline().rstrip().split()) print(a * b // 2)
28
Project_CodeNet
2,020
#!/usr/bin/env python3 a, b, c = map(int, input().split()) print(a*b//2)
26
Project_CodeNet
2,019
side = [int(x) for x in input().split()] side.sort() print(int(side[0]*side[1]/2))
29
Project_CodeNet
2,019
#coding:utf-8 len = list(map(int,input().split())) def return_min(x,y): if x > y: return y else: return x min = len[0] min_index = 0 if min > len[1]: min = len[1] min_index = 1 if min > len[2]: min = len[2] min_index = 2 if min_index == 0: res = min * return_min(len[1],len[2]) /2 elif min_ind...
166
Project_CodeNet
2,019
L = input().split() print(int(int(L[0]) * int(L[1]) / 2))
23
Project_CodeNet
2,019
AB, BC, CA = map(int, input().split()) print(int(BC * AB / 2))
23
Project_CodeNet
2,019
a = [int(x) for x in input().split()] print(int((a[0]*a[1])/2))
26
Project_CodeNet
2,019
l = sorted(list(map(int, input().split()))) print(l[0]*l[1]//2)
23
Project_CodeNet
2,019
i = list(map(int, input().split())) i.sort() ans = (i[0]*i[1])/2 print(int(ans))
30
Project_CodeNet
2,019
import math x,y,z=map(int,input().split()) S=round(x*y/2) print(S)
24
Project_CodeNet
2,020
a, b, c = map(int, input().split()) print(a * b // 2)
21
Project_CodeNet
2,019
ab, bc, ca = map(int, input().split()) print(int(ab * bc // 2))
22
Project_CodeNet
2,020
ab, bc, ca = map(int, input().split()) print(ab * bc // 2)
21