Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | a, b, _ = map(int, input().split())
print(a * b // 2)
| 21 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.sort()
print(int(a[0] * a[1] / 2)) | 28 |
Project_CodeNet | 2,019 | source = input().split()
AB, BC, CA = int(source[0]), int(source[1]), int(source[2])
print(int(AB * BC / 2)) | 37 |
Project_CodeNet | 2,020 | l=list(map(int,input().split()))
l.sort()
print(int(l[0]*l[1]/2)) | 23 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
result = int(AB * BC / 2)
print(result)
| 27 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split());
print(int((bc*ab)/2)) | 22 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
a, b, c = map(int, input().split())
print(int(a * b / 2)) | 29 |
Project_CodeNet | 2,019 | ab , bc, ca = map(int, input().split())
print((ab * bc) //2) | 22 |
Project_CodeNet | 2,019 | ab,bc,ca=map(int,input().split())
ans=int(ab*bc/2)
print(ans) | 23 |
Project_CodeNet | 2,020 | a,b,c = map(int,input().split(' '))
x = a*b//2
print(x) | 21 |
Project_CodeNet | 2,019 | edge = map(int, raw_input().split())
edge.sort()
print edge[0]*edge[1]/2 | 23 |
Project_CodeNet | 2,020 | a,b,c = map(int,input().split())
S = a*b/2
print(int(S)) | 21 |
Project_CodeNet | 2,019 | # import sys
#
# a = sys.argv[0]
# b = sys.argv[1]
# c = sys.argv[2]
d = input().split()
a = d[0]
b = d[1]
print(int(int(a)*int(b)/2))
| 58 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab*bc/2)) | 21 |
Project_CodeNet | 2,019 | def test():
a,b,c = map(int,input().split())
print(int((1/2)*a*b))
if __name__ == "__main__":
test()
| 36 |
Project_CodeNet | 2,019 | L=list(map(int,input().split()))
L.sort()
print(int(L[0]*L[1]/2))
| 23 |
Project_CodeNet | 2,019 | AB,BC,CA=map(int,input().split())
print(AB*BC//2) | 20 |
Project_CodeNet | 2,019 | A = sorted([int(i) for i in input().split()])
ans = A[0] * A[1] //2
print(ans)
| 31 |
Project_CodeNet | 2,019 | ab, bc, ac = map(int,input().split())
print(int(ab * bc * ac / max(ab,bc,ac) / 2 )) | 31 |
Project_CodeNet | 2,019 | a,b,x = map(int, input().split(' '))
s = int(a*b/2)
print(str(s)) | 24 |
Project_CodeNet | 2,020 | a, b, c = (int(x) for x in input().split())
print(int((a * b) / 2)) | 28 |
Project_CodeNet | 2,020 | 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)) | 49 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,019 | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
import heapq
import itertools
import operator
def get_int():
return int(input())
def get_str():
return input().stri... | 135 |
Project_CodeNet | 2,019 | ABC = list(sorted(map(int,input().split())))
print(ABC[0]*ABC[1]//2) | 24 |
Project_CodeNet | 2,020 | abc = sorted(list(map(int, input().split())))
a, b = abc[0], abc[1]
print(a*b//2) | 29 |
Project_CodeNet | 2,019 | c,a,b = map(int,input().split())
print(int(1/2 * c * a)) | 21 |
Project_CodeNet | 2,020 | def main():
AB, BC, CA = list(map(int, input().split()))
print(int(AB * BC / 2))
main() | 33 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a * b // 2) | 21 |
Project_CodeNet | 2,020 | ab,bc,ca=map(int,input().split())
s=ab*bc//2
print(s) | 23 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
S=a*b//2
print(S)
| 20 |
Project_CodeNet | 2,019 | ab, bc, _ = map(int, input().split())
print(int(ab*bc/2)) | 21 |
Project_CodeNet | 2,019 | A,B,C = map(int,input().split(" "))
list = [A,B,C]
sorted(list)
print(int(list[0] * list[1] / 2)) | 36 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,020 | def inp():return map(int,input().split())
a,b,c=inp()
print(a*b//2) | 22 |
Project_CodeNet | 2,019 | list1 = [int(a) for a in input().split()]
list1_0 = list1[0] #AB
list1_1 = list1[1] #BC
list1_2 = list1[2] #CA
if (list1_0 * list1_1 // 2) > 1:
print(list1_0 * list1_1 // 2)
else:
print(list1) | 94 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
# 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():
L = list(map(int,input().split()))
s = sum(L)/2
S = (s*(s-L[0])*(s-L[1])*(s-L[2])) ** 0.5
print(i... | 117 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
def main():
a, b, c = map(int, input().split())
edges = [a,b,c]
edges.sort()
print(edges[0] * edges[1] // 2)
pass
if __name__ == '__main__':
main()
| 65 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int, input().split())
print(int(ab*bc/2))
| 21 |
Project_CodeNet | 2,019 | a = [int(i) for i in input().split()]
a.sort()
print(a[0] * a[1] // 2) | 30 |
Project_CodeNet | 2,020 | dis = list(map(int, input().split()))
dis.sort()
print(dis[0] * dis[1] // 2) | 28 |
Project_CodeNet | 2,019 | 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 * c // 2)
else:
print(a * b // 2)
| 60 |
Project_CodeNet | 2,019 | #Right Triangle
a, b, c = map(int, input().split())
if max(a, b, c) == a:
print(b*c//2)
if max(a, b, c) == b:
print(a*c//2)
if max(a, b, c) == c:
print(b*a//2) | 71 |
Project_CodeNet | 2,019 | A, B, C = list(map(int, input().split()))
if A > B and A > C:
print(str(B*C//2))
elif B > A and B > C:
print(str(A*C//2))
else:
print(str(A*B//2)) | 58 |
Project_CodeNet | 2,020 | AB, BC, CA = [int(i) for i in input().split()]
S = (AB * BC) // 2
print(S) | 31 |
Project_CodeNet | 2,019 | a = list(int(i) for i in input().split())
print(a[0]*a[1]//2)
| 25 |
Project_CodeNet | 2,019 | a, b, c = (int(i) for i in input().split())
print(a*b//2) | 23 |
Project_CodeNet | 2,019 | import sys
"""テンプレ"""
# 高速
input = sys.stdin.readline
# 1行を空白でリストにする(int)
def intline():
return list(map(int, input().split()))
# 上のstrヴァージョン
def strline():
return list(map(str, input().split()))
# 1列に並んだ数
def intlines(n):
return [int(input() for _ in range(n))]
# 上の文字列ヴァージョン
def lines(n):
retu... | 831 |
Project_CodeNet | 2,019 | AB, BC, _ = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,020 | # A - Right Triangle
ab, bc, ca = map(int, input().split())
print(ab*bc//2) | 26 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
lis = list(map(int, input().split()))
print(lis[0]*lis[1]//2) | 31 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,019 | def main():
ab, bc, ca = map(int, input().split())
print(ab * bc // 2)
if __name__ == "__main__":
main()
| 37 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split(" "))
r = int(a*b/2)
print(r)
| 24 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int,input().split(" "))
print(int((AB*BC)/2)) | 23 |
Project_CodeNet | 2,020 | import math
x = input().split()
a = int(x[0])
b = int(x[1])
print(math.floor(a * b / 2)) | 33 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split(' '))
print(int(a*b/2))
| 21 |
Project_CodeNet | 2,019 | import sys
import math as mp
a,b,c = map(int, input().split())
p=int((a+b+c)/2)
print(int(mp.sqrt(p*(p-a)*(p-b)*(p-c)))) | 43 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
ab, bc, ca = map(int,input().split())
ans = ab * bc * ca // max(ab, bc, ca)
print(ans // 2)
| 42 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a * b // 2) | 21 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(ab*bc//2) | 20 |
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())
print(int(a*b/2)) | 20 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(int(a*b*0.5)) | 22 |
Project_CodeNet | 2,019 | a, b, c = list(map(int, input().split(" ")))
print(a*b//2) | 22 |
Project_CodeNet | 2,019 | def main():
AB, BC, CA = map(int, input().split())
return AB * BC // 2
if __name__ == '__main__':
print(main()) | 38 |
Project_CodeNet | 2,019 | AB, BC, _ = map(int, input().split())
print(AB*BC//2) | 21 |
Project_CodeNet | 2,019 | def inpl(): return [int(i) for i in input().split()]
c, a, b = inpl()
print(int(a*c/2)) | 32 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b/2)) | 20 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
print(a * b // 2) | 20 |
Project_CodeNet | 2,019 | a,b,c = map(int,input().split())
print(a*b*c//max(a,b,c)//2) | 22 |
Project_CodeNet | 2,019 | L=list(map(int,input().split()))
L.sort()
ans=L[0]*L[1]/2
print(int(ans)) | 26 |
Project_CodeNet | 2,020 | a,b,c = map(int, raw_input().split(' '))
print (a*b) >> 1 | 21 |
Project_CodeNet | 2,020 | l=list(map(int,input().split()))
l.sort()
print(l[0]*l[1]//2) | 23 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]//2) | 23 |
Project_CodeNet | 2,019 | def main():
a, b, c = map(int, input().split())
print(a*b//2)
if __name__ == '__main__':
main() | 33 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab * bc / 2))
| 22 |
Project_CodeNet | 2,019 | AB,BC,CA=map(int,input().split())
S=1/2*AB*BC
print(int(S)) | 26 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(ab*bc//2) | 20 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
s = (a + b + c) / 2
print(int((s * (s - a) * (s - b) * (s - c)) ** 0.5)) | 54 |
Project_CodeNet | 2,020 | s = list(map(int,input().split()))
S = sorted(s)
print(int(S[0]*S[1]*(1/2))) | 28 |
Project_CodeNet | 2,019 | s = list(map(int, input().split()))
max_a = max(s)
ans = 1
for a in s:
if a != max_a:
ans *= a
print(ans // 2)
| 44 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... | 394 |
Project_CodeNet | 2,019 | # ABC116A - Right Triangle
a, b, c = list(map(int, input().split()))
print(int(a * b / 2)) | 31 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
if a==max(a,b,c):
print(b*c//2)
elif b==max(a,b,c):
print(a*c//2)
else:
print(a*b//2) | 50 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a * b // 2) | 21 |
Project_CodeNet | 2,019 | a, b, _ = map(int, input().split())
print(int(a*b/2))
| 20 |
Project_CodeNet | 2,019 | x,y,z=[int(i) for i in input().split()]
print(int(x*y/2)) | 21 |
Project_CodeNet | 2,020 | '''
問題：
直角三角形 ABC があります。∠ABC=90° です。
三角形 ABC の三辺の長さである
|AB|,|BC|,|CA| が与えられるので、
直角三角形 ABC の面積を求めて下さい。
ただし、三角形 ABC の面積は整数となることが保証されています。
'''
'''
制約：
1 ≦ |AB|,|BC|,|CA| ≦ 100
入力はすべて整数である。
三角形 ABC の面積は整数である。
'''
# 標準入力から AB, BC, CA の値を取得する
ab, bc, ca = map(int, input().split())
print(in... | 222 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,019 | #!/usr/bin/python
def main():
a, b, c = [int(x) for x in input().split()]
print(a * b // 2)
if __name__ == "__main__":
main() | 46 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
import sys
INF = float("inf")
def main():
AB, BC, CA = map(int, input().split())
print(AB*BC//2)
pass
if __name__ == '__main__':
main()
| 56 |
Project_CodeNet | 2,019 | a,b,c = input().split(" ")
a,b,c = int(a),int(b),int(c)
area = int(a*b*c/(max(a,b,c)*2))
print(area) | 39 |
Project_CodeNet | 2,020 | AB,BC,CA=map(int,input().split())
print(AB*BC//2) | 20 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int,input().split())
print(AB*BC//2) | 20 |
Project_CodeNet | 2,019 | a,b,c = map(int,input().split(' '))
S = (a*b)//2
print(S) | 22 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2)
| 22 |
Project_CodeNet | 2,019 | a, b, c = [int(_) for _ in input().split()]
print(int((a * b) / 2)) | 27 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.