Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
a, b, c = na()
print(a * b // 2) | 76 |
Project_CodeNet | 2,019 | a = [int(num) for num in input().split()]
a.sort(reverse=False)
print(int(a[0]*a[1]/2)) | 30 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split()) # 複数数値入力
print(int(a*b/2))
| 32 |
Project_CodeNet | 2,019 | A,B,C=map(int,input().split())
print(A*B*C//(2*max(A,B,C))) | 22 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,019 | #n,m = map(int,input().split())
xlist = list(map(int,input().split()))
S = xlist[0]*xlist[1]/2
print(int(S))
| 38 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int,input().split())
print('{0:.0f}'.format((ab*bc)/2))
| 27 |
Project_CodeNet | 2,020 | A, B, C = sorted(map(int, input().split()))
print(int(A*B/2)) | 21 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
"""
Created on Sun Jan 20 20:51:22 2019
@author: Owner
"""
import collections
import scipy.misc
import sys
import numpy as np
import math
from operator import itemgetter
import itertools
import copy
#素因数を並べる
def prime_decomposition(n):
i = 2
table = []
while i * i <= n:
while n % i ... | 433 |
Project_CodeNet | 2,019 | # coding: utf-8
# Your code here!
a,b,c = map(int,input().split(" "))
print(round(a*b/2))
| 30 |
Project_CodeNet | 2,020 | x, y, z = map(int, input().split())
ans = y * x // 2
print(ans)
| 25 |
Project_CodeNet | 2,020 | AB,BC,CA=map(int,input().split())
print((AB*BC)//2) | 20 |
Project_CodeNet | 2,019 | AB, BC, CD = map(int, input().split())
print(int(AB*BC*0.5)) | 24 |
Project_CodeNet | 2,019 | x, y, z = map(int, input().split())
print(x * y // 2)
| 21 |
Project_CodeNet | 2,019 | ABClist=input().split()
AB=int(ABClist[0])
BC=int(ABClist[1])
ans=int(AB*BC/2)
print(ans) | 34 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print((a * b) // 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 = map(int, input().split())
area = int(ab * bc / 2)
print(area)
| 26 |
Project_CodeNet | 2,019 | def main():
ab, bc, _ = get_params()
print(area(ab, bc))
def get_params():
return [int(s) for s in input().split()]
def area(ab, bc):
return ab * bc // 2
if __name__ == "__main__":
main()
| 64 |
Project_CodeNet | 2,020 | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
a,b,c = map(int, input().split())
print(a*b//2)
| 90 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(int(a[0]*a[1]/2))
| 23 |
Project_CodeNet | 2,020 | A = list(map(int, input().split()))
B = sorted(A)
print(int(B[0] * B[1] / 2)) | 30 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
aa=min(a,b)
bb=min(c,max(a,b))
print((aa*bb)//2)
| 30 |
Project_CodeNet | 2,019 | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in inspect.currentframe().f_back.f_locals.items()
}
print(', '.join(
name... | 961 |
Project_CodeNet | 2,020 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
A, B, C = mapint()
print(A*B//2) | 50 |
Project_CodeNet | 2,019 | AB,BC,CA=map(int,input().split())
print(int(AB*BC/2)) | 21 |
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 | triangle = [int(i) for i in input().split()]
triangle.sort()
area = triangle[0] * triangle[1] / 2
print(int(area))
| 35 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2)
| 22 |
Project_CodeNet | 2,020 | a,b,c=map(int, input().split())
print('{:.0f}'.format(a*b/2)) | 23 |
Project_CodeNet | 2,020 | s=list(map(int,input().split()))
s.remove(max(s))
print(int(s[0]*s[1]/2)) | 25 |
Project_CodeNet | 2,019 | a, b, c = [int(_) for _ in input().split()]
print(a * b // 2) | 24 |
Project_CodeNet | 2,019 | def main():
AB,BC,CA = map(int, input().split())
print(round((AB*BC)/2))
if __name__ == "__main__":
main() | 38 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab * bc / 2)) | 22 |
Project_CodeNet | 2,019 | ab, bc, ca = list(map(int, input().split()))
print(int(ab * bc / 2)) | 24 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
print(min(a*b,a*c,b*c)//2) | 21 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB * BC / 2)) | 23 |
Project_CodeNet | 2,019 | c, a, b = map(int, input().split())
ans = a * c // 2
print(ans) | 25 |
Project_CodeNet | 2,019 | il=list(map(int, input().split()))
il.sort()
x=il[0] * il[1] // 2
print(x) | 30 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
s = int((a * b) / 2)
print(s) | 28 |
Project_CodeNet | 2,019 | a, b, _ = map(int, input().split())
print(int(a * b / 2)) | 22 |
Project_CodeNet | 2,020 | l=list(map(int, input().split()))
l.sort()
print(l[0]*l[1]//2)
| 24 |
Project_CodeNet | 2,019 | a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(int(a * b / 2)) | 32 |
Project_CodeNet | 2,019 | A,B,C=map(int,input().split())
ans=int(A*B/2)
print(ans) | 20 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
ab, bc, ca = map(int, input().split(' '))
print(int(ab*bc/2)) | 31 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,019 | n = list(map(int, input().split()))
print(int(n[0]*n[1]/2)) | 22 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
print(A * B // 2) | 21 |
Project_CodeNet | 2,020 | # coding: utf-8
a, b, c = map(int,input().split())
print(a*b//2) | 25 |
Project_CodeNet | 2,019 | li = list(map(int,input().split()))
print(int(li[0]*li[1]/2))
| 21 |
Project_CodeNet | 2,019 | a,b,c=(int(x) for x in input().split())
print(int((a*b)/2)) | 22 |
Project_CodeNet | 2,019 | a,b,c=(int(x) for x in input().split())
s=a*b//2
print(s) | 23 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
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 | ab,bc,ca=map(int,input().split())
print(ab * bc // 2) | 20 |
Project_CodeNet | 2,019 | n,a,b=map(int,input().split())
x=[]
x.append(n)
x.append(a)
x.append(b)
x.sort()
print(int(x[0]*x[1]/2)) | 39 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b*0.5)) | 22 |
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)) | 21 |
Project_CodeNet | 2,019 | a, b, c = sorted(list(map(int, input().split())))
print(a * b // 2)
| 23 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a * b / 2))
| 22 |
Project_CodeNet | 2,019 | lens = list(map(int, input().split()))
lens.remove(max(lens))
print(lens[0] * lens[1] // 2)
| 33 |
Project_CodeNet | 2,019 | def run(a):
return a[0] * a[1] // 2
def main():
a = list(map(int, input().split()))
print(run(a))
if __name__ == '__main__':
main()
| 49 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.sort()
print(a[0] * a[1] // 2) | 27 |
Project_CodeNet | 2,020 | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())
sys.setrecursionlimit(10 ** 9)
def main():
X, Y, _ = MAP()
print(X*Y//2)
if __name__ == '__main__':
main() | 66 |
Project_CodeNet | 2,019 | a,b,c = list(map(int, input().split()))
if a == max(a, b, c):
print(b*c//2)
if b == max(a, b, c):
print(c*a//2)
if c == max(a, b, c):
print(a*b//2)
| 60 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b/2))
| 21 |
Project_CodeNet | 2,019 |
Xs = list(map(int, input().split()))
Xs.sort()
print(Xs[0] * Xs[1] // 2) | 32 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int((a * b) / 2))
| 24 |
Project_CodeNet | 2,019 | A, B, C = [int(x) for x in input().split()]
print(int(A*B/2)) | 24 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(min(min(a * b, a * c), c * b)/ 2)) | 32 |
Project_CodeNet | 2,020 | a,b,c=map(int,input().split())
L=[a,b,c]
L=sorted(L)
print(L[0]*L[1]//2) | 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())
edge = [a, b, c]
edge.sort()
ans = int(edge[0]*edge[1]/2)
print(ans) | 41 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB*BC//2) | 21 |
Project_CodeNet | 2,019 | l = list(map(int, input().split()))
l.remove(max(l))
print(int(l[0] * l[1] / 2)) | 30 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
ans = int(a*b*0.5)
print(ans) | 26 |
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(AB*BC/2))
| 22 |
Project_CodeNet | 2,019 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
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.... | 252 |
Project_CodeNet | 2,019 | A,B,C = [int(x) for x in input().split()]
ans = [(A*B)//2,(A*C)//2,(B*C)//2]
print(min(ans)) | 37 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(ab * bc // 2) | 21 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2)
| 22 |
Project_CodeNet | 2,019 | # coding: utf-8
# Your code here!
a,b,c = map(int,input().split())
print("{}".format(int(a*b/2))) | 32 |
Project_CodeNet | 2,020 | AB,BC,CA= map(int, input().split())
print(int(AB*BC/2)) | 22 |
Project_CodeNet | 2,020 | X, Y, Z = [int(i) for i in input().split()]
print(int(0.5 * X * Y)) | 28 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
s = (a+b+c)/2
S = s*(s-a)*(s-b)*(s-c)
print(int(S**0.5)) | 43 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.remove(max(a))
print(int(a[0]*a[1]*0.5))
| 29 |
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(int((a*b)/2)) | 20 |
Project_CodeNet | 2,019 | a = list(map(int,input().split()))
aa = 1
for i in range(3):
aa *= a[i]
print(aa//max(a)//2)
| 36 |
Project_CodeNet | 2,019 | ab, bc, ca = input().split()
print(int(int(ab) * int(bc) / 2)) | 23 |
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(int(AB * BC / 2)) | 22 |
Project_CodeNet | 2,019 | arr = sorted(list(map(int,input().split())))
print(int(arr[0]*arr[1]/2)) | 22 |
Project_CodeNet | 2,019 | c, a, b = map(int, input().split())
ans = int(c * a / 2)
print(ans) | 26 |
Project_CodeNet | 2,020 | # ABC116
# A Right Triangle
L = list(map(int, input().split()))
L = sorted(L)
print(int(L[0]*L[1]/2))
| 36 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int,input().split())
print(int(AB*BC/2)) | 21 |
Project_CodeNet | 2,019 | AB, BC, CA=(int(x) for x in input().split())
print(int(AB * BC / 2)) | 26 |
Project_CodeNet | 2,020 | def Right_Triangle(ab, bc, ca):
return int(ab*bc/2)
def main():
ab, bc, ca = map(int, input().split())
print(Right_Triangle(ab, bc, ca))
if __name__ == '__main__':
main() | 59 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.