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(AB * BC // 2) | 22 |
Project_CodeNet | 2,019 | import math
ab, bc, ca = [float(item) for item in input().split()]
s = (ab + bc + ca) / 2.0
area = math.sqrt(s*(s-ab)*(s-bc)*(s-ca))
print(int(area)) | 55 |
Project_CodeNet | 2,019 | # coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
a = list(map(int, input().split()))
a = sorted(a)
print((a[0] * a[1]) // 2)
| 83 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
print(int((A*B)/2)) | 21 |
Project_CodeNet | 2,019 | ab, bc, _ = map(int, input().split())
print(int(0.5*ab*bc)) | 24 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
#X = A * B / 2
# 商の整数値（小数点以下を切り捨て）
X = A * B // 2
print(X)
| 55 |
Project_CodeNet | 2,020 | def main():
side_length = list(map(int, input().split(" ")))
even_side = 0
for i in range(3):
if side_length[i] % 2 == 0:
even_side = side_length.pop(i)
break
if even_side ** 2 + side_length[0] ** 2 == side_length[1] ** 2:
print(even_side * side_length[0] // 2)
... | 127 |
Project_CodeNet | 2,020 | import math
import collections
import sys
#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
a,b,c=MI()
ans=a*b//2
print(ans)... | 92 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,019 | import math
a, b, c = map(int, input().split())
s = (a + b + c) / 2
print(int(math.sqrt(s * (s - a) * (s - b) * (s - c)))) | 52 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
print(int(a*b*0.5)) | 20 |
Project_CodeNet | 2,020 | a= input().split()
b=int(a[0])
c=int(a[1])
i=b*c/2
print('%d'%i) | 30 |
Project_CodeNet | 2,019 | import math
import copy
def nCast(number):
if type(number)==str:
return int(number)
for idx in range(0,len(number)):
if type(number[idx])==str:
number[idx]=int(number[idx])
else:
nCast(number[idx])
return number
def inputArr(w):
l=list()
for ... | 151 |
Project_CodeNet | 2,019 | a, b, c = list(map(int, input().split()))
print((a * b) // 2)
| 24 |
Project_CodeNet | 2,020 | a, b, c = list(map(int, input().split()))
my_result = a * b / 2
print(int(my_result)) | 29 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split(" "))
print(int(a*b/2))
| 21 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,020 | # 直角三角形の面積を求める
AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2))
| 39 |
Project_CodeNet | 2,019 | t = sorted(list(map(int, (input().split()))))
print(t[0] * t[1] // 2) | 27 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
a, b, c = list(map(int, input().split()))
print(a * b // 2)
| 30 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.sort()
print(a[0]*a[1]//2)
| 25 |
Project_CodeNet | 2,020 | x, y, z = map(int, input().split())
print(x * y // 2) | 21 |
Project_CodeNet | 2,019 | inp = [int(i) for i in input().split()]
ru = inp[0] * inp[1] / 2
print(int(ru)) | 33 |
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())
hect = int(a*b*0.5)
print(hect) | 26 |
Project_CodeNet | 2,020 | a = list(map(int, input().split()))
M = max(a)
a.remove(M)
ans = 1 / 2
for aa in a:
ans *= aa
print(int(ans))
| 41 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
S = int(AB*BC*(1/2))
print(S) | 28 |
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())
print(int((ab*bc)/2))
| 22 |
Project_CodeNet | 2,019 | x=list(map(int,input().split()))
x.sort()
print(x[0]*x[1]//2)
| 23 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int,input().split())
ans = ab*bc//2
print(ans) | 23 |
Project_CodeNet | 2,019 | ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
x,y,z =rl()
print(x*y//2) | 30 |
Project_CodeNet | 2,019 | #ABC116A-RightTriangle.py
INPUT = input().split()
print(int(int(INPUT[0])*int(INPUT[1]) / 2))
| 31 |
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>=b and a>=c:
print(b*c//2)
elif b>=a and b>=c:
print(a*b//2)
else:
print(a*b//2) | 52 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
print(int((A * B) / 2))
| 24 |
Project_CodeNet | 2,020 | a = sorted(list(map(int,input().split())))
print(int(a[0]*a[1]*0.5)) | 24 |
Project_CodeNet | 2,019 | A, B, C = [int(i) for i in input().split()]
print(A*B//2) | 23 |
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)) | 21 |
Project_CodeNet | 2,019 | #coding:utf-8
a, b, c = map(int, input().split())
print((a * b)//2) | 27 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
S = int((ab * bc) /2)
print(S) | 27 |
Project_CodeNet | 2,020 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, s... | 112 |
Project_CodeNet | 2,020 |
AB, BC, CA = map(int, input().split())
i = (AB * BC) // 2
print(i)
| 28 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
A, B, C = map(int, input().split())
print(A * B // 2)
| 28 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int,input().split())
print(int(AB*BC/2))
| 21 |
Project_CodeNet | 2,019 | #-*- coding: utf-8 -*-
"""
"""
from collections import defaultdict
import sys
import math
def sol(a, b, c):
return int(a * b / 2)
do_submit = True
def input_parse(input_str):
lines = [x.strip() for x in input_str.split("\n") if x.strip()]
parsed_lines = [list(map(int, line.split())) for line in line... | 168 |
Project_CodeNet | 2,019 | #cording: utf-8
AB, BC, CA = map(int, input().split())
print(int(AB*BC/2))
| 29 |
Project_CodeNet | 2,020 | n=sorted(list(map(int,input().split())))
m=max(n)
print(int(n[0]*n[1]/2)) | 26 |
Project_CodeNet | 2,020 | a, b, c= map(int, input().split())
if a > b and a > c:
print(int(b*c/2))
elif b > a and b > c:
print(int(a*c/2))
else:
print(int(a*b/2)) | 57 |
Project_CodeNet | 2,020 | ary = input().split(" ")
print(int(int(ary[0]) * int(ary[1]) / 2)) | 26 |
Project_CodeNet | 2,020 | AB,BC,CA = map(int,input().split())
print(AB*BC//2) | 20 |
Project_CodeNet | 2,019 | AB,BC,CA= input().split()
AB = int(AB)
BC = int(BC)
CA = int(CA)
S = (AB * BC) / 2
print(int(S)) | 43 |
Project_CodeNet | 2,019 | x, y, z = map(int, input().split())
print(x * y // 2) | 21 |
Project_CodeNet | 2,019 | ab, bc, ca = (int(i) for i in input().split())
ans = (ab * bc) / 2
print(int(ans))
| 32 |
Project_CodeNet | 2,019 | I = [int(i) for i in input().split()]
I.sort()
ans = I[0] * I[1] // 2
print(ans) | 34 |
Project_CodeNet | 2,019 | a, b, _ = map(int, input().split())
print(int(a * b / 2))
| 22 |
Project_CodeNet | 2,020 | a,b,c = map(int, input().split())
import math
s = (a+b+c)/2
S = math.sqrt(s*(s-a)*(s-b)*(s-c))
print(int(S)) | 42 |
Project_CodeNet | 2,019 | x,y,z = input().split()
x,y,z = int(x), int(y), int(z)
print(int(x*y*0.5))
| 31 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
# Generated by 1.1.3 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()))
l.sort()
print((l[0]*l[1])//2)
return
if __name__ == '__main__... | 97 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(int(a[0]*a[1]*0.5))
| 25 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a*b // 2) | 21 |
Project_CodeNet | 2,020 | l = list(map(int,input().split()))
print(int(l[0]*l[1]/2)) | 21 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,019 | a,b,c=sorted(map(int,input().split()),reverse=False)
print(a*b//2) | 20 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(ab * bc // 2) | 21 |
Project_CodeNet | 2,019 | sides = [int(x) for x in input().strip().split()]
sides.sort()
print(sides[0] * sides[1] // 2) | 35 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgette... | 772 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(min([a*b, b*c, c*a]) // 2) | 29 |
Project_CodeNet | 2,019 | from __future__ import print_function
import numpy as np
import sys
import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy,functools
# from itertools import accumulate
# from collections import deque
import random
def eprint(*args, **kwargs):
print(*args, file=sys.stderr, **kwargs)
a,b,c = ... | 110 |
Project_CodeNet | 2,020 | n = sorted(map(int, input().split()))
print(round((n[0] * n[1]) / 2)) | 26 |
Project_CodeNet | 2,019 | X = list(map(int, input().split()))
X.sort()
print(int(X[0]*X[1]/2))
| 25 |
Project_CodeNet | 2,020 | def resolve():
ab, bc, ca = list(map(int, input().split()))
print(ab*bc//2)
if '__main__' == __name__:
resolve() | 40 |
Project_CodeNet | 2,020 | hen = list(map(int, input().split()))
naname = max(hen)
if naname == hen[0]: print(int(hen[1]*hen[2]/2))
elif naname == hen[1]: print(int(hen[0]*hen[2]/2))
else: print(int(hen[1]*hen[0]/2)) | 74 |
Project_CodeNet | 2,020 | s=sorted(map(int,input().split()))
print(int(s[0]*s[1]*0.5)) | 23 |
Project_CodeNet | 2,019 | 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((1/2)*a*b)) | 20 |
Project_CodeNet | 2,020 | X, Y, Z = map(int, input().split())
print(X*Y//2) | 20 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
res = int(a*b/2)
print(res) | 24 |
Project_CodeNet | 2,019 | import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
a,b,c = IL()
print(a*b//2) | 60 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,019 | N = list(map(int, input().split()))
N.sort()
print(N[0]*N[1]//2)
| 25 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
# input
l = list(map(int, input().split()))
# solve
l.sort()
ans = int(l[0] * l[1] / 2)
# output
print(ans)
| 49 |
Project_CodeNet | 2,019 | a=list(map(int, input().split()))
a.remove(max(a))
print(a[0]*a[1]//2)
| 26 |
Project_CodeNet | 2,019 | xs = list(map(int,input().split()))
xs.sort()
print(xs[0] * xs[1] // 2) | 26 |
Project_CodeNet | 2,020 | a,b,c = list(map(int, input().split()))
print((a * b) // 2)
| 22 |
Project_CodeNet | 2,019 | arr = [int(i) for i in input().split()]
s = max(arr)
arr.remove(s)
print(int(arr[0] * arr[1] / 2)) | 37 |
Project_CodeNet | 2,019 | A, B, C= list(map(int, input().split()))
print (A * B //2) | 22 |
Project_CodeNet | 2,019 | a,b,c = list(map(int, input().split()))
l = [a,c,b,c]
l.sort()
#print(l)
print(int(l[0]*l[1]/2)) | 38 |
Project_CodeNet | 2,020 | AB,BC,CA = map(int,input().split())
print((AB * BC) // 2) | 22 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
print(int(1 / 2 * a * b))
| 23 |
Project_CodeNet | 2,019 | E = list(map(int, input().split()))
print(int(E[0]*E[1]/2)) | 22 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
ans = ab * bc // 2
print(ans)
| 25 |
Project_CodeNet | 2,020 | a,b,c = map(int, input().split())
if max(a,b,c)==a:
print(b*c//2)
elif max(a,b,c)==b:
print(a*c//2)
else:
print(a*b//2) | 50 |
Project_CodeNet | 2,019 | ab, bc, ca = list(map(int, input().split()))
print(ab*bc//2) | 21 |
Project_CodeNet | 2,019 | from sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]
print(a*b//2) | 29 |
Project_CodeNet | 2,020 | AB,BC,CA = map(int, input().split())
print(int(AB*BC/2)) | 22 |
Project_CodeNet | 2,019 | print((lambda x:x[0]*x[1]//2)(list(map(int,input().split())))) | 23 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.