Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 57 |
Project_CodeNet | 2,019 | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
}
| 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < n; i ++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
int main() {
vector<double> edges(3);
rep(i, 3) cin >> edges[i];
sort(edges.begin(), edges.end());
cout << edges[0] * edges[1] / 2 << endl;
}
| 109 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 50 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
using namespa... | 578 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(void)
{
int ab,bc,ca; cin>>ab>>bc>>ca;
cout<<(ab*bc)/2<<endl;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,start,end) for(int i=(start);i<=(end);i++)
#define all(n) begin(n),end(n)
#define DEBUG
... | 123 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace::std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b*0.5;
} | 40 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B>>C;
cout << A*B /2<<endl;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <cstdio>
int main() {
int c, a, b;
scanf("%d %d %d", &c, &a, &b);
printf("%d\n", c*a/2);
} | 46 |
Project_CodeNet | 2,019 | #pragma GCC optimize("Ofast")
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define endl '\n'
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
int a,b,c;
int main()
{
cin>>a>>b>>c;
c... | 101 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", a*b/2);
return 0;
}
| 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
cout<<a*b/2<<endl;
} | 38 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c;
cin>>a>>b>>c;
if(a*b>a*c&&b*c>a*c)cout... | 156 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
using namespace std;
int a,b,c;
int main(){
cin >> a >> b >> c;
if(a>=b && a>=c) cout << b*c/2 << endl;... | 144 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << (x * y) / 2 << endl;
}
| 54 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >>a>>b>>c;
cout << (a*b/2);
return 0;
} | 42 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,are;
cin>>a>>b>>c;
are=.5*a*b;
cout<<are<<endl;
return 0;
}
| 51 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> c >> a >> b;
cout << a * c / 2 << endl;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = 100100100;
using namespace std;
int main()
{
int ab, bc, ca;
int res=0;
cin >> ab >> bc >> ca;;
cout << ab*bc/2 << endl;
} | 73 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int ab , bc , ac ;
cin >> ab >> bc >> ac ;
cout << 0.5 * ab * bc ;
return 0;
}
| 44 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main() {
int a,b,c;
cin>>a>>b>>c;
double s = (a+b+c)/2;
int ans = sqrt(s*(s-a)*(s-b)*(s-c));
cout<<ans<<endl;
r... | 122 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
} | 40 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca; // abc=90
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
} | 48 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b;
cout << a * b / 2 << endl;
} | 38 |
Project_CodeNet | 2,019 | #include <cstring>
#include <cstring>
#include <vector>
#include <queue>
#include <iostream>
#include <string>
#include <cmath>
#include <set>
#include <cstring>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
const int INF = 1e9;
typedef long long ll;
int main()
{
int arr[... | 122 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l[3];
cin >> l[0] >> l[1] >> l[2];
sort(l, l + 3);
cout << ((l[0] * l[1]) >> 1) << endl;
return 0;
}
| 73 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a[3];
rep(i, 3) cin >> a[i];
sort(a, a+3);
cout << a[0]*a[1]/2 <<endl;
} | 120 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main () {
int AB , BC;
cin >> AB >> BC;
cout << AB * BC / 2;
} | 43 |
Project_CodeNet | 2,019 | #include<cstdio>
int main(void)
{
int a, b, c;
while(scanf("%d%d%d", &a, &b, &c)==3)
{
printf("%d\n", a*b/2);
}
return 0;
}
| 55 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
int area=(a[0]*a[1])/2;
cout<<area<<endl;
} | 67 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (LL INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (LL INDEX = 0; INDEX < (COUNT); ++INDEX)
int main()
{
int a, b, c;
cin >> a >> b >> c;
double s = (a + b + c) * 0.5;
double r = sqrt(s *... | 146 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define CIN2(a,b) long long a,b;cin >> a >> b;
#define CIN3(a,b,c) long long a,b,c;cin >> a >> b >> c;
#define rep(i,n) for(int i=0,i##_len=(n); i<i##_len; ++i)
int main(){
CIN3(a,b,c)
cout << (a*b)/2 << endl;
} | 100 |
Project_CodeNet | 2,019 | #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;
using namespace std;
int dx[4]={1,0,-... | 149 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for(int i=0; i<3; i++) cin >> a[i];
sort(a, a+3);
cout << a[0]*a[1]/2 << endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include <iostream>
int main() {
int A,B,C;
std::cin >> A >> B >> C;
std::cout << (A*B)/2 << std::endl;
return 0;
}
| 46 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int c,a;
cin>>c>>a;
cout<<c*a/2<<endl;
return 0;
} | 42 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int AB,BC,CA;
cin >> AB >> BC >> CA;
int S;
S = (AB*BC)/2;
cout << S;
return 0;
} | 53 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 221 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a * b /2 << endl;
}
| 55 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A * B / 2 << endl;
return 0;
} | 43 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c ;
if (max(a, max(b, c)) == a) {
cout << b * c / (double)2 << endl;
}
if (max(a, max(b, c)) == b) {
cout << a * c / (double)2 << endl;
}
if (max(a, max(b, c)) == c) {
cout << a * b / (double)2 << endl;
}
} | 119 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >>c;
cout << a*b/2 << endl;
} | 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,a,b) for(signed i=a;i<(b);++i)
#define erep(i,a,b) for(signed i=a;i<=(b);++i)
#define per(i,a,b) for(signed i=(a);i>(b);--i)
#define eper(i,a,b) for(signed i=(a);i>=b;--i)
#define fore(i, x, a) for(auto &&x:a)
#define ITR(i,b,e) for(aut... | 650 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC / 2 << endl;
return 0;
} | 45 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
} | 45 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void) {
int AB ,BC,AC;
scanf("%d%d%d", &AB, &BC, &AC);
printf("%d",AB*BC/2);
return 0;
}
| 47 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iterator>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
// Your code here!
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << (ab*bc)/2 << endl;
}
| 60 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
} | 43 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
int A,B,C;
cin >> A >> B >> C;
cout << A*B/2 << endl;
}
| 48 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int>data(3);
for (int i = 0; i < 3; i++){
cin >> data[i];
}
sort(data.begin(), data.end());
int ans = data[0] * data[1] / 2;
cout << ans << endl;
} | 76 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
struct Benri {
Benri() {
std::cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
}
} benri;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | 277 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
double ans = ab * bc / 2.0;
cout << ans << endl;
return 0;
}
| 93 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS ios_base::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define endl "\n"
#define all(c) c.begin(),c.end()
template<typename T>void prin... | 222 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a,b,c,sum,t;
while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
{
t=(a+b+c)/2;
sum=sqrt(t*(t-a)*(t-b)*(t-c));
printf("%lld\n",sum);
}
return 0;
}
| 88 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
I... | 167 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main(){
int AB,BC,CA,menseki;
cin >> AB >> BC >> CA;
menseki = AB * BC / 2;
cout << menseki << endl;
return 0;
} | 61 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
cout<<A*B/2<<endl;
} | 38 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d",&a,&b,&c);
printf("%d", a*b/2);
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
float a,b,c;
cin >>a>>b>>c;
cout << (a*b)/2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
vector <int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(),v.end());
cout << (v[0]*v[1])/2 << '\n';
return 0;
} | 82 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
return 0;
} | 41 |
Project_CodeNet | 2,019 | /*input
45 28 53
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
#pragm... | 430 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
using namespace std;
using ll = long long;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
int main(){
cin.tie(0);
ios::sync_with_stdio(f... | 150 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int a,b,c;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b>>c;
cout<<(a*b)/2;
return 0;
} | 52 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
}
| 38 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
//#define int long long
#define rep(i,start,end) for(i=start;i<end;i++)
#define Q 1000000007
#define F first
#define S second
#define pb push_back
#define fast_io ios_base::sync_with_stdio(false)
using namespace std;
int main() {
fast_io;
... | 146 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | 45 |
Project_CodeNet | 2,019 | //#include"pch.h"
#include<stdio.h>
#include<stdlib.h>
#include<cmath>
#include<math.h>
#include<algorithm>
int main() {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
printf("%d", A*B / 2);
return(0);
} | 69 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
main(){
int A[3];
for(int ii=0;ii<3;ii++){
cin >> A[ii];
}
sort(A,A+3);
cout << A[0]*A[1]/2 << endl;
}
| 62 |
Project_CodeNet | 2,020 | /**********************************************
* author : deepak nayan
* file : e:/Solutions/atcoder/abc116_a.cpp
* time : Fri May 1 14:31:27 2020
* quest : A - Right Triangle
*********************************************/
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <c... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin>> ab >> bc >> ca;
cout << ab*bc/2 << endl;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << a * b / 2;
} | 38 |
Project_CodeNet | 2,019 |
#include<iostream>
int main() {
int a, b, x;
std::cin >> a >> b >> x;
std::cout << (a*b / 2) << "\n";
return 0;
} | 45 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include<iostream>
int main(){
int l[3];
std::cin>>l[0];
std::cin>>l[1];
std::cin>>l[2];
std::cout<<(l[0]*l[1])/2<<std::endl;
} | 59 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int e[3]; rep(i, 3) cin >> e[i];
sort(e, e+3);
... | 129 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >>a>>b>>c;
int dai=max({a,b,c});
int shou=min({a,b,c});
int naka=a+b+c-dai-shou;
int kotae=(shou*naka)/2;
cout<<kotae<<endl;
return 0;
} | 88 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
cout << A*B/2 << endl;
return 0;
} | 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = ... | 517 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int x, y, z;
cin >> x >> y >> z;
cout << x * y / 2;
return 0;
} | 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int AB, BC, CA;
scanf("%d %d %d", &AB, &BC, &CA);
if(AB*BC/2)
{
printf("%d", AB*BC/2);
}
return 0;
}
| 71 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 43 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int d;
int main()
{
cin >> a >> b >> c;
d = max(a, max(b, c));
cout << a * b * c / 2 / d << endl;
} | 62 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c ;
int d=max(a,max(b,c));
if(d==a){
cout << b*c/2 << endl;
}
if(d==b){
cout << a*c/2 << endl;
}
if(d==c){
cout << a*b/2 << endl;
}
}
| 93 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d;
d = min({a*b/2, a*c/2, b*c/2});
cout << d << endl;
} | 67 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << (ab*bc)/2 << endl;
}
| 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
int main(){
int a,b,c;
std::cin>>a>>b>>c;
int ans=a*b*c/std::max({a,b,c})/2;
std::cout<<ans<<std::endl;
return 0;
}
| 62 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | 435 |
Project_CodeNet | 2,020 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.14159265358979323846264338327950288419716939937... | 1,691 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
}
| 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
typedef long long LL;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 83 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
void solve(int A, int B, int C) { printf("%d\n", A * B / 2); }
int main() {
int A, B, C;
cin >> A >> B >> C;
solve(A, B, C);
return 0;
} | 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
int a, b, c;
cin >> a >> b >> c;
cout << (a*b)/2 << endl;
}
| 45 |
Project_CodeNet | 2,019 | #pragma warning(disable:4996)
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i<n; i++)
#define ALL(a) begin(a), end(a)
#define TPL template
#define TNM typename
using ll = long long;
using ull = unsigned long long;
TPL<TNM T> using vec = vector<T>;
TPL<TNM T> using vec2 = vec<vec<T>>;... | 1,109 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <limits>
#include <numeric>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi... | 105 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int s = a*b/2;
cout << s << endl;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int INF = 1<<30;
int main(){
int a, b, c;cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
} | 56 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
#define BEGIN ios_base::sync_with_stdio(0);cin.tie(0)
#define END return EXIT_SUCCESS
#define FOR(I,A,B) for((I)=(A);(I)<(B);(I)++)
#define REP(I,N) FOR(I,0,N)
#define UP(I,A,B) for(... | 363 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.