Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,020 | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(i... | 261 |
Project_CodeNet | 2,020 | A, B, C = list(map(int,input().rstrip().split()))
print(min(A*B//2,B*C//2,C*A//2)) | 30 |
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()))
a = sorted(a)
print(a[0] * a[1] // 2) | 29 |
Project_CodeNet | 2,019 | a,b,c=map(int,input().split())
l=[a,b,c]
x=max(l)
ans=1
for i in range(3):
if l[i]!=x:
ans*=l[i]
print(ans//2) | 49 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(int(ab * bc * 0.5)) | 24 |
Project_CodeNet | 2,019 | X,Y,Z=map(int,input().split())
if (X>Y) and (X>Z):
print(int(Y*Z/2))
elif (Y>X) and (Y>Z):
print(int(X*Z/2))
else:
print(int(X*Y/2)) | 60 |
Project_CodeNet | 2,019 | import sys
from itertools import product
sys.setrecursionlimit(200000)
def input():
return sys.stdin.readline()[:-1]
def ii(t: type = int):
return t(input())
def il(t: type = int):
return list(map(t, input().split()))
def imi(N: int, t: type = int):
return [ii(t) for _ in range(N)]
def iml(N:... | 147 |
Project_CodeNet | 2,019 | a, b, x = map(int, input().split(" "))
print((a * b) // 2) | 24 |
Project_CodeNet | 2,019 | a, b, c = sorted(map(int, input().split()))
print(a*b//2) | 20 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,020 | a,b,c = map(int,input().split())
print(int(min(a*b,b*c,c*a)/2)) | 22 |
Project_CodeNet | 2,019 | a=input().split()
b=int(a[0])
c=int(a[1])
print(b*c//2) | 23 |
Project_CodeNet | 2,020 | x = sorted(list(map(int, input().split())))
print(x[0] * x[1] // 2) | 26 |
Project_CodeNet | 2,020 | A = map(int, input().split())
A = sorted(A)
print(int(A[0]*A[1]/2)) | 26 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split(" "))
print(a * b // 2) | 23 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
print (a * b // 2) | 20 |
Project_CodeNet | 2,019 | ab, bc, ac = map(int,input().split())
print(int((ab*bc)/2))
| 21 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
list=[a,b,c]
list.sort()
print(int(list[0]*list[1]/2)) | 31 |
Project_CodeNet | 2,019 | def main():
AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2))
if __name__ == "__main__":
main()
| 39 |
Project_CodeNet | 2,019 | print(*[int(y[0]*y[1]/2) for y in [[int(x) for x in input().split()]]]) | 30 |
Project_CodeNet | 2,019 | l = list(map(int, input().split()))
a=l[0]*l[1]/2
print(int(a))
| 25 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
if(a*a + b*b == c*c):
print(a*b//2)
elif(b*b + c*c == a*a):
print(b*c//2)
else:
print(c*a//2)
| 56 |
Project_CodeNet | 2,019 | import math
import sys
from operator import itemgetter
# N, K = map(int, input().split())
# h = list(map(int, input().split()))
# S = [input() for _ in range(H)]
# X = [[0 for j in range(100)] for i in range(200)]
### input
a, b, c = map(int, input().split())
print(a*b//2)
| 89 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int,input().rstrip().split())
print(ab*bc//2) | 21 |
Project_CodeNet | 2,019 | a,b,c=map(int,input().split())
if a > c and a > b : print(int(c*b/2))
if b > a and b > c : print(int(a*c/2))
if c > a and c > b : print(int(a*b/2)) | 58 |
Project_CodeNet | 2,020 | 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() | 73 |
Project_CodeNet | 2,019 | S = list(map(int, input().split()))
print(S[0]*S[1]//2) | 22 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(bc*ab/2))
| 21 |
Project_CodeNet | 2,019 | a=sorted(list(map(int,input().split())))
print(a[0]*a[1]//2)
| 22 |
Project_CodeNet | 2,019 | S =list(map(int, input().split()))
print(int(S[0]*S[1]/2)) | 22 |
Project_CodeNet | 2,019 | import sys
for line in sys.stdin:
nbs = line.split(' ')
print(int(nbs[0]) * int(nbs[1]) // 2) | 36 |
Project_CodeNet | 2,019 | li=list(map(int,input().split()))
s=sum(li)
t=min(li)
l=s-t-max(li)
print(t*l//2)
| 28 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
a, b, c = [int(i) for i in input().split()]
print(int(a*b/2)) | 33 |
Project_CodeNet | 2,020 | ab, bc, ca = (int(n) for n in input().split())
print(ab * bc // 2) | 25 |
Project_CodeNet | 2,020 | a,b,c = sorted(map(int,input().split()))
print(int(1/2*a*b)) | 20 |
Project_CodeNet | 2,019 | Tmp = []
Tmp = input().rstrip().split(' ')
nA = int(Tmp[0])
nB = int(Tmp[1])
nAns = nA * nB // 2
print(nAns)
| 47 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
ab, bc, ca = map(int, input().split())
print(ab * bc // 2)
| 30 |
Project_CodeNet | 2,019 | xyz = list(map(int, input().split()))
xyz.sort()
print(int(xyz[0]*xyz[1]/2)) | 26 |
Project_CodeNet | 2,019 | from functools import reduce
from operator import mul
def solve():
L = [int(i) for i in input().split()]
return reduce(mul, L) // (2 * max(L))
print(solve())
| 44 |
Project_CodeNet | 2,019 | AB,BC,CA=map(int,input().split())
print(int(AB*BC/2))
| 21 |
Project_CodeNet | 2,019 | sides = [int(x) for x in input().split()]
ans = 1
for side in sides:
ans *= side
print(ans//max(sides)//2) | 38 |
Project_CodeNet | 2,020 | AB, BC, CB = map(int, input().split())
print(AB*BC//2)
| 21 |
Project_CodeNet | 2,019 | # coding: utf-8
a, b, c = map(int, input().split())
M = max(a,b,c)
x = a*b*c//(M*2)
print(x)
| 40 |
Project_CodeNet | 2,019 | inl=list(map(int,input().split()))
inl.sort()
print(inl[0]*inl[1]//2)
| 27 |
Project_CodeNet | 2,019 | n= list(map(int, input().split()))
n.sort()
print(n[0]*n[1]//2)
| 25 |
Project_CodeNet | 2,020 | def main():
a, b, _ = map(int, input().split())
print(a*b//2)
main()
| 26 |
Project_CodeNet | 2,019 | ab, bc, cd = map(int, input().split())
print(int(ab*bc/2))
| 21 |
Project_CodeNet | 2,020 | 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)) | 62 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a * b) // 2) | 23 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
if (a**2)+(b**2)==(c**2):
s=a*b/2
elif (a**2)+(c**2)==(b**2):
s=a*c/2
elif (b**2)+(c**2)==(a**2):
s=b*c/2
print(int(s)) | 80 |
Project_CodeNet | 2,019 | AB, BC, CA = list(map(int, input().split()))
if AB ** 2 + BC ** 2 == CA ** 2:
print(int(AB * BC / 2))
elif BC ** 2 + CA ** 2 == AB ** 2:
print(int(BC * CA / 2))
else:
print(int(CA * AB / 2)) | 78 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int, input().split())
print(AB*BC//2) | 21 |
Project_CodeNet | 2,019 | def resolve():
a,b,c=map(int,input().split())
s=(a+b+c)//2
print(int((s*(s-a)*(s-b)*(s-c))**0.5))
resolve() | 42 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab * bc / 2)) | 22 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
ans = a * b /2
print(int(ans)) | 25 |
Project_CodeNet | 2,019 | a, b, c = list(map(int, input().split()))
print(int(a * b / 2)) | 23 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]//2)
| 23 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from fractions import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
######... | 701 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,019 | a = [int(i) for i in input().split()]
a = sorted(a)
ans = int(a[0] * a[1]/2)
print(ans) | 35 |
Project_CodeNet | 2,019 | l = list(map(int,input().split()))
l.sort()
ans = l[0]*l[1]//2
print(ans) | 28 |
Project_CodeNet | 2,019 | l = list(map(int, input().split()))
print(int(l[0]*l[1]/2)) | 22 |
Project_CodeNet | 2,019 | #116 A
a =[int(j) for j in input().split()]
a.remove(max(a))
print(int(0.5*a[0]*a[1])) | 35 |
Project_CodeNet | 2,020 | l = list(map(int,input().split()))
print(l[0]*l[1]//2) | 21 |
Project_CodeNet | 2,019 | AB, BC, CA = list(map(int, input().split()))
print(int((AB * BC) / 2)) | 25 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print((ab * bc) // 2)
| 23 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a*b // 2) | 20 |
Project_CodeNet | 2,019 | i = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる
print(int((i[0] * i[1]) / 2)) | 47 |
Project_CodeNet | 2,020 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
x, y, z = map(int, readline().split())
print(x * y // 2)
return
if __name__ == '__main__':
main()
| 90 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a = sorted(a)
print(a[0] * a[1] // 2)
| 29 |
Project_CodeNet | 2,019 | class RightTriangle:
def __init__(self,ab,bc,ca):
self.ab = ab
self.bc = bc
self.ca = ca
def calc_area(self):
return self.ab*self.bc/2
ab,bc,ca = map(int,raw_input().strip().split())
val = RightTriangle(ab,bc,ca)
print(val.calc_area())
| 79 |
Project_CodeNet | 2,020 | 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)) | 82 |
Project_CodeNet | 2,019 | c=list(map(int,input().split()))
print(c[0]*c[1]//2) | 20 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split()) # 横に2個
print(int(A*B/2)) | 29 |
Project_CodeNet | 2,019 | a, b, c = list(map(int, input().split()))
print(int(a * b / 2))
| 23 |
Project_CodeNet | 2,020 | a_b, b_c, c_a = map(int, input().split())
print((a_b*b_c)//2) | 25 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.sort()
print(int(a[0]*a[1]/2))
| 25 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a * b // 2)
| 21 |
Project_CodeNet | 2,019 | def main():
a, b, c = list(map(int, input().split()))
print(int((a*b) /2))
if __name__ == '__main__':
main()
| 39 |
Project_CodeNet | 2,019 | import sys
from fractions import gcd
import bisect
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]
num = na()
num.sort()
print(int(0.5 * (num[0] * num[1])... | 91 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int((ab * bc) / 2))
| 24 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,019 | # -*- coding:utf-8 -*-
def solve():
ab, bc, ca = list(map(int, input().split()))
print(int(ab*bc/2))
if __name__ == "__main__":
solve()
| 45 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
area = int((b * a)/2)
print(area) | 26 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,020 | a = list(map(int, input().split()))
a.sort()
print(a[0]*a[1]//2) | 25 |
Project_CodeNet | 2,020 | L = list(map(int, input().split()))
print(L[0] * L[1] // 2) | 24 |
Project_CodeNet | 2,019 | x = list(map(int, input().split(' ')))
print(int(x[0] * x[1] / 2)) | 27 |
Project_CodeNet | 2,019 | a, b, c = map(int, raw_input().split())
print (a * b ) / 2
| 24 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
ans = AB*BC/2
print(int(ans)) | 25 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int,input().split(' '))
print(ab * bc // 2) | 21 |
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((AB * BC) // 2) | 23 |
Project_CodeNet | 2,019 | e = list(map(int,input().split()))
e.sort()
print((e[0]*e[1])//2) | 25 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
ans = AB * BC / 2
print(int(ans)) | 26 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(b * a / 2)) | 22 |
Project_CodeNet | 2,019 | s = input().split()
ab = int(s[0])
bc = int(s[1])
ca = int(s[2])
ans = int((ab * bc)/2)
print(ans) | 40 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB*BC//2) | 21 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.