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, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print((ab * bc) // 2) | 23 |
Project_CodeNet | 2,019 | a = list(map(int,input().split()))
a.sort()
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) | 24 |
Project_CodeNet | 2,019 | import os, sys, re, math
L,M,N = list(map(int,input().split(' ')))
print(L*M//2)
| 28 |
Project_CodeNet | 2,019 | A, B, C = [int(x) for x in input().split()]
print(int((A*B)/2)) | 25 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
print(a * b//2)
| 20 |
Project_CodeNet | 2,019 | ls=[int(s) for s in input().split()]
ls.sort()
print((ls[0]*ls[1])//2) | 28 |
Project_CodeNet | 2,019 | a, b, c = [int(_) for _ in input().split()]
print(a * b // 2)
| 24 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split(" "))
print(AB * BC // 2) | 23 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
from math import gcd
except Exception:
from fractions import gcd
readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]
... | 114 |
Project_CodeNet | 2,019 | a = [int(i) for i in input().split() ]
a.sort()
print(int((a[0] * a[1]) /2)) | 32 |
Project_CodeNet | 2,019 | def solve():
AB, BC, CA = map(int, input().split())
print(BC * AB // 2)
if __name__ == '__main__':
solve()
| 38 |
Project_CodeNet | 2,019 | inp = [int(x) for x in input().split(" ")]
print(int(inp[0]*inp[1]/2)) | 27 |
Project_CodeNet | 2,019 | ab,bc,ca=map(int,input().split())
print(int(ab*bc/2)) | 20 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a * b // 2) | 21 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b)//2)
| 20 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
S = A * B // 2
print(S) | 25 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(ab * bc // 2) | 21 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(AB * BC // 2) | 22 |
Project_CodeNet | 2,019 | num = input().split()
print(int(num[0])*int(num[1])//2) | 20 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(BC * AB // 2) | 22 |
Project_CodeNet | 2,019 | import math
a,b,c = map(int, input().split())
s = (a + b + c) / 2
ans = math.sqrt(s * (s - a) * (s - b) * (s - c))
print(int(ans)) | 54 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
print(int(AB*BC/2)) | 22 |
Project_CodeNet | 2,019 | c, a, b = map(int, input().split())
print(c * a // 2)
| 21 |
Project_CodeNet | 2,019 | l=list(map(int,input().split()))
l.sort()
print(l[0]*l[1]//2)
| 23 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int,input().split())
print(int(ab * bc / 2)) | 21 |
Project_CodeNet | 2,019 | from sys import stdin
def main():
ab, bc, ca = [int(x) for x in stdin.readline().rstrip().split()]
print(ab * bc // 2)
if __name__ == "__main__":
main()
| 49 |
Project_CodeNet | 2,020 |
def solve():
AB, BC, CA = map(int, input().split())
print(AB*BC//2)
if __name__ == "__main__":
solve()
| 38 |
Project_CodeNet | 2,020 | tmp = list(map(int,input().split()))
tmp.sort()
print(tmp[0]*tmp[1]//2) | 24 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a * b // 2) | 21 |
Project_CodeNet | 2,019 | ab, bc, _ = map(int, input().split())
print(ab * bc // 2)
| 21 |
Project_CodeNet | 2,020 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisect_left,b... | 145 |
Project_CodeNet | 2,019 | x,y,z=list(map(int,input().split()))
print(int(x*y/2))
| 20 |
Project_CodeNet | 2,020 | a,b,c = map(int, input().split())
print(int(a * b / 2)) | 20 |
Project_CodeNet | 2,019 | a, b, c = map(int, raw_input().split())
print (a*b/2) | 21 |
Project_CodeNet | 2,020 | ab,bc,ca = map(int,input().split())
print((ab * bc) // 2) | 22 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
MOD = 10**9
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
a, b, c = map(int, input().split())
print(a*b//2)
| 97 |
Project_CodeNet | 2,020 | import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
def main():
x, y, z = MII()
print(x*y//2)
if __name__ == '__main__':
main()
| 64 |
Project_CodeNet | 2,019 | #coding: utf-8
a, b, c = map(int, input().split())
print(int(a*b/2)) | 27 |
Project_CodeNet | 2,019 | # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
A = LI()
A.sort()
print(A[... | 97 |
Project_CodeNet | 2,020 | Input = input().split()
AB = Input[0]
AB = int(AB)
BC = Input[1]
BC = int(BC)
Answer = AB * BC / 2
Answer = int(Answer)
print(Answer) | 49 |
Project_CodeNet | 2,019 | a=sorted([int(i) for i in input().split()])
print(a[0]*a[1]//2) | 26 |
Project_CodeNet | 2,019 | data = list(map(int,input().split()))
print(int(data[0]*data[1]/2))
| 21 |
Project_CodeNet | 2,019 | abc=[int(x) for x in input().split()]
abc.sort()
print(abc[0]*abc[1]//2) | 28 |
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(" ")))
print(l[0]*l[1]//2) | 24 |
Project_CodeNet | 2,020 | def main():
# n = int(input())
a, b, c = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
print(a*b//2)
if __name__ == '__main__':
main()
| 60 |
Project_CodeNet | 2,019 | AB, BC, CA = list(map(int, input().split()))
print((AB * BC)//2) | 22 |
Project_CodeNet | 2,019 | # coding: utf-8
# Your code here!
AB, BC, CA = map(int, input().split())
# print(AB)
# print(BC)
# print(CA)
print(int(BC * AB / 2)) | 50 |
Project_CodeNet | 2,019 | li = list(map(int,input().split()))
print (li[0] * li[1] // 2) | 24 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int,input().split())
print(int((AB*BC)/2)) | 21 |
Project_CodeNet | 2,020 | S_list = list(map(int,input().split()))
print(int(S_list[0] * S_list[1] / 2))
| 27 |
Project_CodeNet | 2,019 | #ABC116_a Right Triangle
import heapq
a,b,c = [int(i) for i in input().split()]
tri=[a,b,c]
r= int(heapq.nsmallest(2,tri)[0]*heapq.nsmallest(2,tri)[1]/2)
print(r) | 63 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split(' '))
print(a*b//2) | 20 |
Project_CodeNet | 2,019 | l = list(map(int, input().split()))
ans = l[0] * l[1] / 2
print(int(ans)) | 29 |
Project_CodeNet | 2,019 | L = list(map(int, input().split()))
L.remove(L[L.index(max(L))])
S = 1
for i in range(2):
S *= L[i]
print(S//2)
| 43 |
Project_CodeNet | 2,019 | x = [int(i) for i in input().split()]
x.sort()
print(x[0]*x[1]//2) | 28 |
Project_CodeNet | 2,020 | 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(int(((n[0]) *(n[1])/2))) | 26 |
Project_CodeNet | 2,019 | l = list(map(int,input().split()))
l.sort()
print(int(l[0]*l[1]/2)) | 24 |
Project_CodeNet | 2,019 | a, b ,c = list(map(int, input().split()))
print(int(a * b / 2)) | 23 |
Project_CodeNet | 2,019 |
nums = [int(num) for num in input().split()]
print(int(nums[0]*nums[1]*0.5)) | 28 |
Project_CodeNet | 2,019 | a,b,c=map(int,input().split())
print(a*b*c//(2*max(a,b,c))) | 22 |
Project_CodeNet | 2,020 | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
if __name__ == '__main__':
a = [int(i) for i in input().split()]
print(a[0]*a[1]//2) | 70 |
Project_CodeNet | 2,020 | ab, bc, ac = map(int,input().split(" "))
print((ab*bc)//2) | 21 |
Project_CodeNet | 2,019 | l = sorted(list(map(int,input().split())))
print(l[0]*l[1]//2)
| 22 |
Project_CodeNet | 2,019 | a, b, c = sorted(map(int, input().split(" ")))
print(int(a * b / 2))
| 25 |
Project_CodeNet | 2,019 | # coding: utf-8
ab, bc, ca = map(int, input().split())
s = ab * bc / 2
print(int(s))
| 33 |
Project_CodeNet | 2,019 | A = list(map(int, input().split()))
print((A[0]*A[1])//2) | 23 |
Project_CodeNet | 2,020 | c, a, b = map(int, input().split())
print(c * a // 2)
| 21 |
Project_CodeNet | 2,019 | ls = map(int, input().split())
ls = sorted(ls)
print(int(ls[0] * ls[1] / 2)) | 29 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
sum_ = a * b / 2
print(int(sum_)) | 28 |
Project_CodeNet | 2,020 | ab, bc, ca = map(int, input().split())
print(ab * bc // 2) | 21 |
Project_CodeNet | 2,020 | # ABC116A
ab, bc, ca = map(int, input().split())
print(ab * bc // 2)
| 26 |
Project_CodeNet | 2,020 | import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
def main():
x, y, z = map(int, input().split())
print(x * y //... | 80 |
Project_CodeNet | 2,020 | X, Y, Z = map(int, input().split())
print(X*Y//2) | 20 |
Project_CodeNet | 2,019 | a = list(map(int, input().split()))
print(a[0] * a[1] // 2)
| 24 |
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(ab * bc // 2) | 21 |
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,020 | a,b,c=map(int,input().split())
ans=int(a*b/2)
print(ans) | 20 |
Project_CodeNet | 2,020 | c, a, b = map(int, input().split())
S = c * a // 2
print(S) | 25 |
Project_CodeNet | 2,019 | """ AtCoder """
import sys
input = sys.stdin.readline
x, y, z = map(int, input().split())
print(int(x*y/2))
| 33 |
Project_CodeNet | 2,020 | えーびー,びーしー,_ = map(int,input().split())
めんせき =えーびー*びーしー//2
print(めんせき) | 45 |
Project_CodeNet | 2,020 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, c = map(int, readline().split())
print(a*b//2)
| 45 |
Project_CodeNet | 2,019 | AB,BC,CA = map(int,input().split())
print(int(AB*BC*(1/2))) | 23 |
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,019 | l = list(map(int,input().split()))
print(l[0]*l[1]//2) | 21 |
Project_CodeNet | 2,019 | a = list(map(int,input().split()))
print(a[0]*a[1]//2) | 21 |
Project_CodeNet | 2,019 | import heapq
inputs = list(map(int, input().split()))
a, b = heapq.nsmallest(2, inputs)
print(a * b // 2)
| 34 |
Project_CodeNet | 2,020 | 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(AB*BC//2) | 20 |
Project_CodeNet | 2,019 | lines = list(map(int, input().split()))
lines.sort()
print((lines[0] * lines[1]) // 2) | 29 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
print(a[0]*a[1]//2) | 20 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int,input().split())
print(int(AB * BC / 2)) | 22 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
A, B, C = map(int, input().split())
print(A * B // 2) | 30 |
Project_CodeNet | 2,019 | x = input()
box= x.split(" ")
add = int(box[0]) * int(box[1])/ 2
print(int(add)) | 30 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.