Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #!/usr/bin/env python3
ab, bc, ca = list(map(int, input().split()))
print(ab*bc//2)
| 28 |
Project_CodeNet | 2,019 |
def main():
n = [int(i) for i in input().split()]
a2, b2, c2 = [i**2 for i in n]
a, b, c = n
# print(a,b,c)
# print(a2,b2,c2)
ans = 0
if a2+b2 == c2:
ans = a * b
elif b2+c2 == a2:
ans = b * c
elif a2+c2 == b2:
ans == a * c
print(int(ans/2))
main()
| 129 |
Project_CodeNet | 2,019 | L = [int(x) for x in input().split()]
L.sort()
print(L[1] * L[0] // 2) | 30 |
Project_CodeNet | 2,019 | sides = list(map(int,input().split()))
sides.remove(max(sides))
print(sides[0]*sides[1]//2) | 31 |
Project_CodeNet | 2,019 | a,b,c = map(int,input().split())
Area = ( a*b ) // 2
print(Area) | 24 |
Project_CodeNet | 2,019 | abc = input().split()
print(int(int(abc[0])*int(abc[1])/2)) | 22 |
Project_CodeNet | 2,020 | L = list( map(int, input().split()) )
L.sort()
print( L[0] * L[1] // 2 ) | 30 |
Project_CodeNet | 2,019 | ab, bc, ac = map(int,input().split())
print(int((ab * bc)/2)) | 21 |
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(int(AB * BC / 2)) | 23 |
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(ab * bc // 2) | 21 |
Project_CodeNet | 2,019 | a,b,c=map(int,input().split())
print(str(int(0.5*a*b))) | 20 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print(a * b // 2)
| 21 |
Project_CodeNet | 2,019 | a,b,c =map(int,input().split())
p = int(a*b/2)
print("{}".format(p)) | 24 |
Project_CodeNet | 2,019 | a, b, c = sorted([int(i) for i in input().split()])
print(a * b // 2) | 26 |
Project_CodeNet | 2,019 | #!usr/bin/env python3
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def LIR(n): return [LI() for i in range(n)]
mod = 1000000007
#A
a,b,c = LI()
s = a+b+c
s /= 2
ans = (s*(s-a)*(s-b)*(s-c))**(1/2)
print(int(ans))
#B
#C
#D
#E
... | 163 |
Project_CodeNet | 2,019 | s = input().split(" ")
item = [int(i) for i in s]
item.sort()
print(int(item[0] * item[1] / 2))
| 36 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split(' '))
print (int(a * b / 2)) | 24 |
Project_CodeNet | 2,020 | a = list(map(int, input().split()))
a.sort()
print(a[0] * a[1] // 2) | 27 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
print(int(A*B/2))
| 20 |
Project_CodeNet | 2,019 | ##### 解けた #####
a,b,c=list(map(int,input().split(" ")))
print(a*b//2) | 24 |
Project_CodeNet | 2,019 | hen_list = list(map(int,input().split()))
hen_list.sort()
teihen = hen_list[0]
takasa = hen_list[1]
print(int(teihen * takasa / 2)) | 44 |
Project_CodeNet | 2,019 | a=list(map(int,input().split()))
a.sort()
print(a[0]*a[1]//2) | 23 |
Project_CodeNet | 2,019 | ab,bc,ca=map(int, input().split())
print(ab*bc//2) | 20 |
Project_CodeNet | 2,019 | c, a, b = map(int, input().split())
print(a * c // 2) | 21 |
Project_CodeNet | 2,019 | 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) | 20 |
Project_CodeNet | 2,019 | list1 = list(map(int,input().split()))
list1.sort()
print(int(list1[0]*list1[1]/2)) | 28 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
S = int(AB*BC*0.5)
print(S)
| 28 |
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())
S = int(AB * BC /2)
print(S) | 26 |
Project_CodeNet | 2,019 | a,b,c = map(int, input().split())
m = max(a,b,c)
if a==m:
print(b*c//2)
elif b==m:
print(a*c//2)
else:
print(a*b//2) | 51 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split()); print(round((a*b)/2))
| 21 |
Project_CodeNet | 2,020 | a,b,c = map(int,input().split())
ans = int( a*b*c/(max(a,b,c)*2) )
print(ans) | 29 |
Project_CodeNet | 2,019 | A = list(map(int, input().split()))
A.sort()
print(A[0] * A[1] // 2)
| 27 |
Project_CodeNet | 2,019 |
lst_1 = input().split()
for i in range(len(lst_1)):
lst_1[i] = int(lst_1[i])
lst_1.sort()
ans = int(lst_1[0] * lst_1[1] / 2)
print(ans) | 60 |
Project_CodeNet | 2,019 | def main():
ab, bc, ca = map(int, input().strip().split(" "))
area = int(ab*bc/2)
print("{:d}".format(area))
if __name__ == "__main__":
main()
| 50 |
Project_CodeNet | 2,020 | import math
AB,BC,CA = map(int, input().split())
s = (AB+BC+CA)/2
S = math.sqrt(s*(s-AB)*(s-BC)*(s-CA))
print(int(S)) | 49 |
Project_CodeNet | 2,020 | def main():
a, b, c = map(int, input().split())
print((a*b)//2)
main() | 27 |
Project_CodeNet | 2,019 | sides = list(map(int, input().split()))
print(sides[0] * sides[1] // 2)
| 26 |
Project_CodeNet | 2,019 | def test
a, b, c = gets.split(" ").map(&:to_i)
a * b / 2
end
puts test
| 30 |
Project_CodeNet | 2,019 | a = gets.split.map(&:to_i).sort
p a[0]*a[1]/2 | 21 |
Project_CodeNet | 2,019 | xs, *rem = ARGF.read.split("\n").map { |e| e.split }
ab, bc, ca = xs.map { |e| e.to_i }
puts (ab * bc) / 2
| 46 |
Project_CodeNet | 2,020 | ab, bc, ca = gets().chomp.split("\s").map{|x| x.to_i}
list = [ab, bc, ca].sort
puts list[0] * list[1] / 2
| 47 |
Project_CodeNet | 2,019 | a = gets.split.map(&:to_i).sort
puts a[0]*a[1]/2 | 21 |
Project_CodeNet | 2,019 | nums = gets.split.map(&:to_i)
puts nums[0] * nums[1] / 2
| 23 |
Project_CodeNet | 2,020 | ab, bc, _ca = gets.split(' ').map(&:to_i)
puts ab * bc / 2
| 24 |
Project_CodeNet | 2,019 | AB,BC,CA = gets.split.map(&:to_i)
puts (AB * BC)*1/2
| 23 |
Project_CodeNet | 2,019 | abc = gets.split.map(&:to_i).sort
p abc[0]*abc[1]/2 | 21 |
Project_CodeNet | 2,019 | # Your code here!
a,b,c = gets.split.map(&:to_i)
puts a*b/2 | 21 |
Project_CodeNet | 2,019 | L = gets.split.map(&:to_i)
puts L[0] * L[1] / 2
| 23 |
Project_CodeNet | 2,019 | a,b,c = gets.chomp.split.map(&:to_i)
puts a * b / 2
| 20 |
Project_CodeNet | 2,019 | edges = gets.split.map(&:to_i)
long_edge = edges.index(edges.max)
sum = 1
3.times do |i|
if i != long_edge
sum *= edges[i]
end
end
p sum/2 | 50 |
Project_CodeNet | 2,019 | i = gets.chomp.split.map(&:to_i)
puts (i[0] * i[1]) / 2 | 24 |
Project_CodeNet | 2,020 | a, b, c = gets.split(" ").map(&:to_i)
puts a*b/2 | 20 |
Project_CodeNet | 2,019 | ab, bc, ca = gets.chomp.split(" ").map { |e| e.to_i }
ans = ab * bc / 2
puts ans | 31 |
Project_CodeNet | 2,020 | input = gets.split("\s").map(&:to_i)
input.delete(input.max)
p input[0]*input[1]/2 | 27 |
Project_CodeNet | 2,019 | abc = gets.split(" ").map(&:to_i).sort
print abc[0] * abc[1] / 2 | 26 |
Project_CodeNet | 2,019 | AB, BC, CA = gets.split(' ').map(&:to_i)
puts (AB * BC) / 2
| 25 |
Project_CodeNet | 2,019 | AB, BC, CA = gets.split.map(&:to_i)
puts AB * BC / 2 | 20 |
Project_CodeNet | 2,019 | a,b,c = gets.chomp.split(' ').map(&:to_i)
puts a * b / 2 | 21 |
Project_CodeNet | 2,019 | abc = gets.split.map(&:to_i).sort
puts abc[0] * abc[1] / 2
| 25 |
Project_CodeNet | 2,020 | a,b,c = gets.split(" ").map(&:to_i)
puts a * b / 2 | 20 |
Project_CodeNet | 2,019 | a, b, c = gets.split.map(&:to_i)
if a > b && a > c
puts b * c / 2
elsif b > c && b > a
puts c * a / 2
else
puts a * b /2
end | 60 |
Project_CodeNet | 2,019 | ab, bc, ca = gets.split.map(&:to_i)
puts ab * bc / 2 | 20 |
Project_CodeNet | 2,019 | a, b, _ = gets.chomp.split(" ").map(&:to_i).sort
puts a * b / 2 | 25 |
Project_CodeNet | 2,019 | require 'complex'
a, b, c = gets.chomp.split.map(&:to_i)
s = (a + b + c) / 2
puts Math.sqrt((s * (s - a) * (s - b) * (s - c))).to_i | 56 |
Project_CodeNet | 2,020 | ab, bc, ca = gets.chomp.split.map(&:to_i)
ans = ab * bc / 2
puts ans | 25 |
Project_CodeNet | 2,020 | ab, bc, ca = gets.split.map &:to_i
p (bc * ab / 2) | 22 |
Project_CodeNet | 2,019 | a,b,c = gets.chomp.split(' ').map(&:to_i)
s = (a + b + c).to_f / 2
puts Math.sqrt(s * (s - a) * (s - b) * (s - c)).to_i | 53 |
Project_CodeNet | 2,020 | ab, bc, ca = gets.chomp.split(' ').map(&:to_i)
puts ab * bc / 2 | 23 |
Project_CodeNet | 2,019 | nums = gets.split(' ').to_a
puts nums[0].to_i * nums[1].to_i / 2
| 27 |
Project_CodeNet | 2,019 | line1, line2, line3 = gets.strip.split ' '
len1 = line1.to_i
len2 = line2.to_i
puts len1 * len2 / 2 | 39 |
Project_CodeNet | 2,019 | a, b, c = gets.split.map(&:to_i)
puts a * b / 2 | 20 |
Project_CodeNet | 2,019 | a, b = gets.split(' ')
print (a.to_i * b.to_i) / 2 | 21 |
Project_CodeNet | 2,019 | AB,BC,CA = gets.strip.split.map(&:to_i)
puts AB*BC/2 | 20 |
Project_CodeNet | 2,020 | a, b, c = gets.chomp.split.map(&:to_i)
puts a * b / 2 | 21 |
Project_CodeNet | 2,020 | def calTri(x,y)
puts x*y/2
end
a,b,c = gets.split.map(&:to_i)
if a**2 + b**2 == c**2 then
calTri(a,b)
elsif a**2 + c**2 == b**2 then
calTri(a,c)
elsif b**2 + c**2 == a**2 then
calTri(b,c)
end | 87 |
Project_CodeNet | 2,019 | input = STDIN.readline.split().map{|n|n.to_i}
puts(input[0] * input[1] / 2) | 29 |
Project_CodeNet | 2,019 | ab,bc,ca = gets.split.map(&:to_i)
puts "#{ab*bc/2}" | 21 |
Project_CodeNet | 2,019 | a, b, c = gets.chomp.split.map(&:to_i)
d, e = [a, b, c].sort[0, 2]
p d * e / 2
| 40 |
Project_CodeNet | 2,019 | a = gets.chomp.split(' ').map(&:to_i)
a.sort!
if a[0] ** 2 + a[1] ** 2 == a[2] ** 2
print (a[0] * a[1] / 2)
else
print"長さが間違っています"
end | 72 |
Project_CodeNet | 2,019 | ab, bc, ca = gets.split.map(&:to_i)
puts bc * ab / 2
| 21 |
Project_CodeNet | 2,019 | ab,bc,ca = gets.split.map(&:to_i)
p (ab*bc)/2 | 20 |
Project_CodeNet | 2,019 | a, b, c = STDIN.gets.chomp.split(" ").map{|x| x.to_i}.sort
puts a*b/2 | 29 |
Project_CodeNet | 2,019 | a,b,c=gets.chomp.split(' ').map(&:to_i)
puts a*b/2
| 20 |
Project_CodeNet | 2,019 | AB, BC, CA = gets.split.map(&:to_i)
S = (AB+BC+CA)/2
puts Math.sqrt(S*(S-AB)*(S-BC)*(S-CA)).to_i
| 44 |
Project_CodeNet | 2,019 | a=gets.strip.split.map(&:to_i)
puts a[0]*a[1]/2 | 20 |
Project_CodeNet | 2,019 | A, B, C = gets.chomp.split.map(&:to_i)
puts A * B / 2 | 21 |
Project_CodeNet | 2,019 | # util functions
# debug
$debugFlag = ( ARGV[0] != nil )
p "==== DEBUG MODE ====" if $debugFlag
def pd(str)
p str if $debugFlag
end
def printd(str)
print str if $debugFlag
end
# input
inputs = []
lc = 0
while l = $stdin.gets do
if false
inputs << l.chomp.split(" ").map(&:to_s)
else
inputs << l.chomp... | 213 |
Project_CodeNet | 2,019 | x = gets.split.map!{|i| i.to_i}
x.sort!
puts x[0] * x[1] / 2 | 29 |
Project_CodeNet | 2,019 | a,b,c = gets.chomp.split(" ").map(&:to_i)
puts(a*b/2) | 20 |
Project_CodeNet | 2,019 | input = gets.chomp.split(' ').map{ |v| v.to_i }
puts input[0] * input[1] / 2 | 29 |
Project_CodeNet | 2,019 | AB,BC,CA = gets.split.map(&:to_i)
puts(AB*BC/2) | 21 |
Project_CodeNet | 2,019 | v = gets.split.map(&:to_i)
p v[0] * v[1] / 2 | 22 |
Project_CodeNet | 2,019 | ab, bc, _ca = gets.chomp!.split.map!(&:to_i)
puts ab * bc / 2
| 25 |
Project_CodeNet | 2,019 | a = readline.chomp.split.map(&:to_i).sort
puts (a[0]*a[1]/2)
| 24 |
Project_CodeNet | 2,019 | A, B, C = gets.split.map(&:to_i)
puts A * B / 2 | 20 |
Project_CodeNet | 2,020 | line = gets.split(' ').map(&:to_i)
puts line[0] * line[1] / 2 | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.