Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int max = a;
if (max < b)max = b;
if (max < c)max = c;
printf("%d\n", a*b*c / max / 2);
return 0;
} | 83 |
Project_CodeNet | 2,020 | #include<stdio.h>
int main() {
int ab, bc, ca;
scanf("%d %d %d", &ab, &bc, &ca);
int are = ab * bc / 2;
printf("%d", are);
} | 53 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%d",a*b/2);
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int ab, bc, ca;
scanf("%d", &ab);
scanf("%d", &bc);
scanf("%d", &ca);
printf("%d", (ab*bc)/2);
return 0;
} | 53 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void){
int AB,BC,CA;
scanf("%d %d %d",&AB,&BC,&CA);
printf("%d\n",(AB*BC)/2);
return 0;
}
| 51 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void){
int ab,bc,ca;
scanf("%d %d %d",&ab,&bc,&ca);
printf("%d\n",ab*bc/2);
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main()
{
int AB, BC, CA;
scanf ("%d %d %d", &AB, &BC, &CA);
printf("%d", AB*BC/2 );
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int a, b, c;
int sqr;
scanf("%d", &a);
scanf("%d", &b);
sqr = 0.5 * a * b;
printf("%d", sqr);
return 0;
} | 61 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void){
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a * b / 2);
}
| 39 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(){
int box[3];
int num,a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d\n",a*b/2);
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main() {
int a, b, c, sq;
scanf("%d %d %d%*c", &a, &b, &c);
sq = (a * b) / 2;
printf("%d\n", sq);
return 0;
} | 67 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
int sum;
sum=a*b/2;
printf("%d\n",sum);
return 0;
}
| 52 |
Project_CodeNet | 2,019 | #include<stdio.h>
int nextInt();
int A, B;
int main(){
A=nextInt();
B=nextInt();
printf("%d\n", A*B/2);
return 0;
}
int nextInt(){
int f=0; char c=getchar();
while((c<'0')||('9'<c)){c=getchar();}
while((c>='0')&&(c<='9')){f=f*10+(c-'0'); c=getchar();}
return f;
}
| 100 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b,c,s=0;
scanf("%d %d %d",&a,&b,&c);
s=a*b/2;
printf("%d",s);
return 0;
}
| 48 |
Project_CodeNet | 2,020 | #include<stdio.h>
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",a*b/2);
return 0;
}
| 43 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a,b,c,d;
scanf("%d %d",&a,&b,&c);
d=(1*a*b)/2;
printf("%d\n",d);
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void){
int a,b,c;
scanf("%d %d %d" ,&a,&b,&c);
printf("%d",a*b/2);
return 0;
}
| 48 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d\n",a*b/2);
return 0;
} | 45 |
Project_CodeNet | 2,019 | a=io.read("n")
b=io.read("n")
print(a*b//2) | 20 |
Project_CodeNet | 2,019 | local _i={}
for i=1,1 do
local a=io.read()
_i[i]={}
for s in string.gmatch(a,"%S+")do
_i[i][#_i[i]+1]=s
end
end
local a={tonumber(_i[1][1]),tonumber(_i[1][2]),tonumber(_i[1][3])}
table.sort(a)
print(a[1]*a[2]*.5) | 104 |
Project_CodeNet | 2,019 | local a = io.read("n")
local b = io.read("n")
print(a*b//2) | 22 |
Project_CodeNet | 2,019 | a,b,c=io.read("*n","*n","*n")
print(a*b//2) | 21 |
Project_CodeNet | 2,019 | local a=io.read("n")
local b=io.read("n")
print(a*b//2) | 22 |
Project_CodeNet | 2,019 | @l=split(/\s/, <>);
print $l[0]*$l[1]/2; | 22 |
Project_CodeNet | 2,019 | my $line = <STDIN>;
my ($A, $B) = split(' ', $line);
print int($A * $B / 2); | 33 |
Project_CodeNet | 2,019 | my @ls = +<<get.words;
say @ls[0] * @ls[1] div 2; | 25 |
Project_CodeNet | 2,019 | @in = split / /, <STDIN>;
print $in[0] * $in[1] / 2 . "\n"; | 30 |
Project_CodeNet | 2,019 | use v5.18;
use warnings;
use List::Util;
use Data::Dumper;
sub read_line { chomp(my $s = <>); $s }
sub splited_read_line { split / /, read_line }
sub unique { my %u; $u{$_} = $_ for @_; values %u; }
my ($a, $b, $c) = splited_read_line;
say $a * $b / 2;
| 96 |
Project_CodeNet | 2,019 | use v5.18.2;
my ($AB, $BC, $CA) = sort { $a <=> $b } split(' ', <STDIN>);
my $S = $AB * $BC / 2;
say $S;
| 52 |
Project_CodeNet | 2,019 | ($a,$b,$c)=split/ /,<>;
print $a*$b/2; | 20 |
Project_CodeNet | 2,019 | @a=glob<>;
$s=1;$m=0;
foreach (@a){
$s*=$_;
$m=$_ if($m<$_);
}
print$s/$m/2; | 41 |
Project_CodeNet | 2,019 | @s = split(/ /, <>);
printf ($s[0] * $s[1] / 2) . "\n";
| 28 |
Project_CodeNet | 2,019 | $s=1;$s*=$_,$m+=$-=$_-$m for glob<>;print$s/$m/2 | 25 |
Project_CodeNet | 2,019 | #!/usr/bin/perl -w
chomp($hoge=<>);
my($a,$b,$c)=split(/ /,$hoge);
$menseki=($a*$b)/2;
print $menseki; | 47 |
Project_CodeNet | 2,019 | use warnings;
use Data::Dumper;
sub GetInputData{
my @array_data;
my $line = <STDIN>;
chomp($line);
while($line ne ""){
push(@array_data,$line);
$line = <STDIN>;
chomp($line);
}
ret... | 255 |
Project_CodeNet | 2,019 | import std.stdio;
import std.algorithm;
import std.array;
import std.conv;
import std.datetime;
import std.numeric;
import std.math;
import std.string;
string my_readln() { return chomp(readln()); }
void main()
{
auto tokens = my_readln().split();
auto A = tokens[0].to!uint;
auto B = tokens[1].to!uint;
auto C = t... | 108 |
Project_CodeNet | 2,019 | import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
auto tmp = readln.split.to!(int[]);
writeln(tmp[0] * tmp[1] / 2);
}
| 58 |
Project_CodeNet | 2,020 | void main()
{
long a, b, c;
rdVals(a, b, c);
writeln((a * b) >> 1);
}
enum long mod = 10^^9 + 7;
enum long inf = 1L << 60;
T rdElem(T = long)()
if (!is(T == struct))
{
return readln.chomp.to!T;
}
alias rdStr = rdElem!string;
alias rdDchar = rdElem!(dchar[]);
T rdElem(T)()
if (is(T == struct))
{
... | 430 |
Project_CodeNet | 2,019 | import std.stdio,std.conv,std.string,std.algorithm,std.array,std.math;
void main(){
auto s=readln().chomp().split().map!(to!int);
int a=s[0],b=s[1],c=s[2],ans=0;
if(a>b && a>c)
ans=b*c/2;
else if(b>a && b>c)
ans=c*a/2;
else
ans=a*b/2;
writeln(int(ans));
} | 104 |
Project_CodeNet | 2,019 | import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | 123 |
Project_CodeNet | 2,019 | import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
import std.ascii;
void main()
{
int ab, bc, ca;
readf("%s %s %s\n", &ab, &bc, &ca);
writeln(ab*... | 94 |
Project_CodeNet | 2,019 | //dlang template---{{{
import std.stdio;
import std.conv;
import std.string;
import std.array;
import std.algorithm;
import std.typecons;
import std.math;
import std.range;
// MIT-License https://github.com/kurokoji/nephele
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : ... | 507 |
Project_CodeNet | 2,019 | import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
void main() {
auto data = split(readln());
( to!int(data[0]) * to!int(data[1]) / 2 ).writeln();
} | 53 |
Project_CodeNet | 2,019 | import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
auto a = readln.split.to!(int[]);
a.sort();
... | 262 |
Project_CodeNet | 2,019 | import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto abc = readln.split.to!(int[]);
auto AB = abc[0];
auto BC = abc[1];
writeln(AB * BC / 2);
} | 70 |
Project_CodeNet | 2,019 | void main() {
auto ip = readAs!(int[]), A = ip[0], B = ip[1], C = ip[2];
ip.sort();
writeln((ip[0] * ip[1]) / 2);
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
im... | 337 |
Project_CodeNet | 2,019 | import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | 266 |
Project_CodeNet | 2,019 | import std.stdio, std.range, std.conv, std.string;
import std.algorithm.comparison, std.algorithm.iteration, std.algorithm.mutation, std.algorithm.searching, std.algorithm.setops, std.algorithm.sorting;
void main()
{
long[] input = readln().split.to!(long[]);
long A = input[0];
long B = input[1];
write... | 86 |
Project_CodeNet | 2,019 | import std.stdio;
import std.algorithm;
import std.math;
import std.conv;
import std.string;
int readInt(){
return readln.chomp.to!int;
}
int[] readInts(){
return readln.chomp.split.to!(int[]);
}
void main(){
auto len = readInts().sort();
int ret = len[0] * len[1] / 2;
writeln(ret);
} | 88 |
Project_CodeNet | 2,019 | import std.algorithm;
import std.bigint;
import std.bitmanip;
import std.concurrency;
import std.container;
import std.conv;
import std.functional;
import std.format;
import std.math;
import std.meta;
import std.numeric;
import std.random;
import std.range;
import std.stdio;
import std.string;
import std.traits;
import... | 107 |
Project_CodeNet | 2,019 | import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}
void main()
{
int[] a; readA... | 128 |
Project_CodeNet | 2,019 | import std.stdio;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.ascii;
import std.format;
void main()
{
auto abbcca = readln.split.to!(in... | 107 |
Project_CodeNet | 2,020 | void main(){
int[] hen = _scanln();
(hen[0]*hen[1]/2).writeln();
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] _scanln(T = int)(){
T[] ln;
foreach(string elm; readln().chomp().split()){
ln ... | 136 |
Project_CodeNet | 2,019 | unittest
{
assert( [ "3 4 5" ].parse.expand.solve == 6 );
assert( [ "5 12 13" ].parse.expand.solve == 30 );
assert( [ "45 28 53" ].parse.expand.solve == 630 );
}
import std.conv;
import std.range;
import std.stdio;
import std.typecons;
void main()
{
stdin.byLineCopy.parse.expand.solve.writeln;
}
auto parse( Ra... | 164 |
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( int(AB*BC/2)) | 22 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
#----------
AB,BC,CA = list(map(int, input().rstrip().split()))
#----------
print( "{}".format(int((AB*BC)/2)) ) | 42 |
Project_CodeNet | 2,019 | i = list(map(int, input().split(" ")))
s = int(i[0] * i[1] / 2)
print(s) | 31 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
print(AB*BC//2) | 22 |
Project_CodeNet | 2,019 | *L, = map(int, input().split())
L.sort()
print(L[0]*L[1]//2) | 25 |
Project_CodeNet | 2,019 | a, b, c = sorted(map(int,input().split()))
print((a*b)//2) | 20 |
Project_CodeNet | 2,019 | def MI(): return map(int, input().split())
def II(): return int(input())
def IS(): return input()
def LI(): return list(map(int, input().split()))
a, b, c = MI()
print((a*b)//2)
| 52 |
Project_CodeNet | 2,019 | a, b, c = map(int, input().split())
menseki = int(a * b / 2)
print(menseki)
| 30 |
Project_CodeNet | 2,019 | ab, bc, ca = map(int, input().split())
print(int(ab*bc/2)) | 21 |
Project_CodeNet | 2,019 | li = list(map(int, input().split()))
li.sort()
print(int(li[0] * li[1] / 2)) | 28 |
Project_CodeNet | 2,019 | AB, BC, CA = map(int, input().split())
S = (AB*BC) // 2
print(S) | 27 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
A, B, C = inpl()
print(A*B//2) | 36 |
Project_CodeNet | 2,019 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest 116：A - Right Triangle
def main():
A, B, C = [int(i) for i in raw_input().strip().split(' ')]
print A*B/2
if __name__ == '__main__':
main()
| 71 |
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(int(ab*bc*(0.5))) | 22 |
Project_CodeNet | 2,020 | L = sorted(list(map(int,input().split())))
print((L[0]*L[1])//2)
| 23 |
Project_CodeNet | 2,020 | from math import sqrt
a, b, c = map(int, input().split())
s = (a + b + c) / 2
ans = sqrt(s * (s - a) * (s - b) * (s - c))
print(int(ans)) | 57 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int,input().split())
print(int((ab * bc) / 2)) | 23 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b*c)//(max(a,b,c)*2))
| 27 |
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())
print(a * b // 2) | 21 |
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(A*B//2) | 20 |
Project_CodeNet | 2,019 | import math
sa = list(map(int,input().split(' ')))
#print((sa[0]*sa[1])//2)
s = (sa[0]+sa[1]+sa[2])//2
ans = int(math.sqrt(s*(s-sa[0])*(s-sa[1])*(s-sa[2])))
print(ans) | 75 |
Project_CodeNet | 2,019 | ab,bc,ca = map(int, input().split())
s = (ab * bc) / 2
print(int(s)) | 28 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int, input().split())
ans = AB * BC // 2
print(ans) | 25 |
Project_CodeNet | 2,019 | a,b,c = map(int,input().split())
ans = a * b // 2
print(ans) | 22 |
Project_CodeNet | 2,019 | X = sorted(list(map(int, input().split())))
print(X[0]*X[1]//2) | 23 |
Project_CodeNet | 2,019 |
v = sorted([int(x) for x in input().split()])
print( int(0.5 * v[0] * v[1]))
| 33 |
Project_CodeNet | 2,019 | n = list(map(int,input().split()))
print(int(0.5*n[0]*n[1])) | 23 |
Project_CodeNet | 2,019 | x, y, z = input().split()
print(int(int(x) * int(y) / 2)) | 23 |
Project_CodeNet | 2,019 | A, B, C = map(int, input().split())
print(int((A*B)/2)) | 21 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
ab, bc, _ = map(int, input().split())
print(int(ab * bc / 2))
| 30 |
Project_CodeNet | 2,019 | a = [int(i) for i in input().split()]
s = a[0] * a[1] / 2
print(int(s)) | 33 |
Project_CodeNet | 2,019 | # coding: utf-8
length = list(map(int, input().split()))
length.sort()
area = length[0] * length[1] / 2
print(int(area)) | 39 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a*b)//2) | 20 |
Project_CodeNet | 2,020 | 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) | 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(a * b / 2)) | 23 |
Project_CodeNet | 2,020 | AB, BC, CA = map(int,input().split())
answer = AB * BC / 2
print(int(answer)) | 25 |
Project_CodeNet | 2,019 | a, b, c = sorted(map(int, input().split()))
print(a*b//2) | 20 |
Project_CodeNet | 2,020 | a, b, c = map(int, input().split())
print((a * b)//2) | 21 |
Project_CodeNet | 2,019 | t = list(map(int, input().split()))
t.sort()
print(int(t[0] * t[1] / 2)) | 28 |
Project_CodeNet | 2,020 | A,B,C=map(int,input().split())
l=[A,B,C]
l.sort()
print(int((l[0]*l[1])/2)) | 32 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.