Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | tri = list(map(int, input().split(' ')))
print(tri[0] * tri[1] // 2) | 27 |
Project_CodeNet | 2,020 | a,b,c = map(int,input().split())
ans = a*b//2
print(ans) | 20 |
Project_CodeNet | 2,020 | import sys
import math
import itertools
ab,bc,ca=list(map(int,input().split()))
print(int((ab*bc)/2)) | 30 |
Project_CodeNet | 2,020 | A, B, _ = sorted(map(int, input().split()))
print(A * B // 2) | 22 |
Project_CodeNet | 2,019 | a, b, c = [int(c) for c in input().split()]
print(a * b // 2)
| 25 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a * b // 2)
| 21 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b/2)) | 20 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(min(AB*BC, BC*CA, CA*AB) // 2) | 32 |
Project_CodeNet | 2,019 | a,b,c=[int(x) for x in input().split()]
print(a*b//2) | 20 |
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)) | 60 |
Project_CodeNet | 2,019 | a, b, c = [int(i) for i in input().split()]
print(int(a * b / 2)) | 26 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(int(AB*BC/2)) | 22 |
Project_CodeNet | 2,020 | t = list(map(int,input().split()))
t.sort()
print(t[0]*t[1]//2) | 24 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB*BC//2) | 21 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
abc = list(map(int, input().split()))
abc.sort()
print(int(abc[0]*abc[1]/2))
| 34 |
Project_CodeNet | 2,019 | import numpy as np
sides = list(map(int, input().split()))
sides = np.array(sides)
answer_sides = []
for i in range(len(sides)):
if sides[i] != sides.max():
answer_sides.append(sides[i])
print(int(answer_sides[0] * answer_sides[1] / 2)) | 74 |
Project_CodeNet | 2,019 | a = [int(i) for i in input().split()]
menseki = int(a[0]*a[1]/2)
print(menseki) | 33 |
Project_CodeNet | 2,020 | a, b, c = map(lambda x: int(x), input().split())
print(int((a*b)/2)) | 25 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
ab, bc, ca = map(int, input().split())
print(int(0.5*ab*bc)) | 32 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a * b // 2) | 22 |
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 | # -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product
from... | 233 |
Project_CodeNet | 2,019 | A,B,C = map(int,input().split())
ans = A*B//2
print(ans)
| 20 |
Project_CodeNet | 2,020 | AB,BC,CA = map(int,input().split())
print(int(AB*BC/2)) | 21 |
Project_CodeNet | 2,019 | l=list(map(int,input().split()))
l.sort()
print((l[0]*l[1])//2) | 24 |
Project_CodeNet | 2,019 | from statistics import mean, median,variance,stdev
import sys
import math
import fractions
def j(q):
if q==1: print("YES")
else:print("NO")
exit(0)
def ct(x,y):
if (x>y):print("")
elif (x<y): print("")
else: print("")
def ip():
return int(input())
#x = ip() ... | 250 |
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())
print(a * b // 2)
| 21 |
Project_CodeNet | 2,019 | AB, BC, CA = tuple(map(int, input().split()))
print(AB * BC // 2) | 23 |
Project_CodeNet | 2,019 | input_line = list(map(int,input().split(' ')))
print(int((input_line[0]*input_line[1])/2)) | 27 |
Project_CodeNet | 2,019 | AB, BC, CA = map( int, input().split() )
print( int(AB*BC/2) ) | 26 |
Project_CodeNet | 2,019 | edges = list(map(int , input().split()))
edges.sort()
print(edges[0] * edges[1] // 2)
| 27 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int,input().split())
print(AB*BC//2) | 20 |
Project_CodeNet | 2,020 | c,a,b = map(int, input().split())
print(int(a*c*0.5)) | 20 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(round(AB * BC / 2))
| 23 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
A,B,C = map(int,input().split())
print(A*B//2)
| 25 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
a.remove(max(a))
print(int(a[0] * a[1] * 1/2))
| 32 |
Project_CodeNet | 2,019 | l =[int(i) for i in input().split()]
print(l[0]*l[1]//2) | 24 |
Project_CodeNet | 2,020 | # coding: utf-8
# https://atcoder.jp/contests/abc116
# 11:45-
def main():
a, b, c = map(int, input().split())
return a * b // 2
print(main())
| 56 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,020 | x = list(map(int, input().split()))
print(x[0]*x[1]//2) | 22 |
Project_CodeNet | 2,019 | A = [int(i) for i in input().split()]
print(A[1]*A[0]//2) | 25 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab*bc/2)) | 21 |
Project_CodeNet | 2,019 | R= list(map(int,input().split()))
R.sort()
print(R[0] * R[1] // 2)
| 26 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
area = (ab * bc) // 2
print(area)
| 27 |
Project_CodeNet | 2,019 | #n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))
a,b,c = map(int,input().split())
print((a*b)//2) | 44 |
Project_CodeNet | 2,020 | a=list(map(int,input().split()));print(a[0]*a[1]//2) | 20 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
a, b, c = map(int, input().split())
print(a*b//2) | 26 |
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())
print(int(a*b/2)) | 20 |
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) | 54 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(int(ab*bc/2)) | 21 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int, input().split())
print(bc * ab // 2) | 21 |
Project_CodeNet | 2,020 | a, b, c = list(map(int, input().split()))
print(a * b // 2) | 22 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int, input().split())
print(int(ab * bc * 1/2))
| 24 |
Project_CodeNet | 2,019 | abcList = list(map(int, input().split()))
abcList.sort()
ans = int((abcList[0] * abcList[1]) / 2)
print(ans) | 37 |
Project_CodeNet | 2,019 | a = sorted(list(int(i) for i in input().split()))
print(a[0]*a[1]//2) | 26 |
Project_CodeNet | 2,020 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inp... | 120 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
a, b, c = map(int, raw_input().split())
ans = (a * b) / 2
print ans | 35 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b/2)) | 20 |
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(ab * bc // 2)
s = (ab + bc + ca) / 2
import math
print(int(math.sqrt(s * (s - ab) * (s - bc) * (s - ca))))
| 61 |
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())
print((a * b) // 2) | 23 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
lengths = list(sorted(map(int, input().split())))
print(lengths[0] * lengths[1] // 2)
| 79 |
Project_CodeNet | 2,019 | AB, BC, CA = (int(i) for i in input().split())
print(int(AB*BC*CA /(2*(max(AB,BC,CA))))) | 37 |
Project_CodeNet | 2,019 | h, w, _ = [int(i) for i in input().split()]
ans = h * w // 2
print(ans)
| 29 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print((AB * BC) // 2)
| 23 |
Project_CodeNet | 2,019 | AB, BC, CA = [int(i) for i in input().split()]
print(AB * BC // 2)
| 26 |
Project_CodeNet | 2,019 | l=list(map(int,input().split()))
print(int(l[0]*l[1]/2)) | 20 |
Project_CodeNet | 2,019 | l = input().split()
A = int(l[0])
B = int(l[1])
C = int(l[2])
ans = (A * B)/2
print(int(ans))
| 40 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int((AB*BC)/2)) | 22 |
Project_CodeNet | 2,019 | l = list(map(int, input().split()))
print((l[0]*l[1])//2) | 23 |
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))
| 30 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(ab*bc//2) | 20 |
Project_CodeNet | 2,019 | import math
a, b, c = map(int, input().split())
s = (a+b+c) / 2
summ = s * (s-a) * (s-b) * (s-c)
print(int(math.sqrt(summ))) | 53 |
Project_CodeNet | 2,019 | a, b, c = [int(i) for i in input().split()]
print(a * b // 2) | 25 |
Project_CodeNet | 2,020 | AB,BC,CA=map(int,input().split())
print(int(BC*AB/2))
| 21 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]//2) | 23 |
Project_CodeNet | 2,019 | c,a,b = [int(i) for i in input().split()]
print(int(a*c/2)) | 23 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
area = (AB * BC) // 2
print(area)
| 27 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
ab, bc, ca = map(int, input().split())
res = (ab * bc) // 2
print(res)
if __name__ == '__main__':
resolve()
| 76 |
Project_CodeNet | 2,019 | List=[int(x) for x in input().split()]
Max=max(List)
List.remove(Max)
print(int(List[0]*List[1]/2)) | 32 |
Project_CodeNet | 2,019 | s = input().split()
s = [int(i) for i in s]
print(int(s[0]*s[1]/2)) | 29 |
Project_CodeNet | 2,019 | ab,bc,ca=map(int,input().split())
print(int(ab*bc*0.5)) | 22 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
x = list(map(int, input().split()))
x.sort()
print(int(x[0]*x[1]/2)) | 34 |
Project_CodeNet | 2,019 | T = list(map(int, input().split()))
T.sort()
print(T[0] * T[1] // 2)
| 27 |
Project_CodeNet | 2,019 | a,b,c=map(int,input().split())
z=a*b/2
print(int(z)) | 20 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
def main():
return int(AB*BC/2)
if __name__ == '__main__':
print(main())
| 38 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int,input().split())
print(int(ab*bc/2)) | 20 |
Project_CodeNet | 2,019 | a, b, c = map(int,input().split())
print("%d"%(a*b/2))
| 21 |
Project_CodeNet | 2,019 | s=sorted(list(map(int, input().split())))
print(s[0]*s[1]//2)
| 23 |
Project_CodeNet | 2,019 | import sys
wk_line =input().split()
print(int((int(wk_line[0])*int(wk_line[1])/2)))
| 29 |
Project_CodeNet | 2,019 | a_b, b_c, c_a = map(int, input().split())
if (a_b**2 + b_c**2) == c_a**2:
print(int(a_b * b_c /2))
else:
print('直角三角形ではない') | 59 |
Project_CodeNet | 2,019 | c,a,b = map(int, input().split())
print(int(0.5 * c * a)) | 22 |
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())
if a > b and a > c:print(b * c // 2)
if b > a and b > c:print(a * c // 2)
if c > a and c > b:print(a * b // 2) | 62 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(int(a*b/2)) | 20 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.