Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 92 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<stdio.h>
#include<iostream>
#include<numeric>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
... | 89 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <bitset>
#include <numeric>
#include <math.h>
#include <tuple>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
template<class T> inline bool chmin... | 191 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int ans=a*b;
ans=ans/2;
cout<<ans;
}
| 50 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int a,b,c;
int d;
scanf("%d %d %d", &a,&b,&c);
printf("%d",(a*b)/2);
}
| 53 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;using ull=unsigned ll;
using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;
using P=pair<int,int>;using PL=pair<ll,ll>;
const int INF=1<<30,MOD=1000000007;const ll LINF=1ll<<60;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) _repi(... | 535 |
Project_CodeNet | 2,019 | #include <iostream>
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<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<bitset>
#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
int main() {
int a, b, c;
c... | 103 |
Project_CodeNet | 2,019 | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout<<(a*b / 2);
return 0;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int ab,bc;
cin >> ab >> bc;
cout << ab * bc / 2;
} | 37 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
b += MOD;
a += b;
a %= MOD;
}... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { c... | 355 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <cstdio>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin>>A>>B>>C;
cout<<(A*B)/2<<endl;
return 0;
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
int pA, pB, pC;
pA = pow(A, 2); pB = pow(B, 2); pC = pow(C, 2);
if(pA + pB == pC)
{
cout << A * B / 2 << endl;
}
else if (pA + pC == pB)
{
cou... | 157 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a;
cin >> a;
int b;
cin >> b;
int c;
cin >> c;
cout << a*b/2 << endl;
}
| 51 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
unsigned int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc / 2) << endl;
}
| 45 |
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;
return 0;
} | 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab,bc,ca,s;
cin >> ab >> bc >> ca;
s = ab * bc / 2;
cout << s << endl;
}
| 52 |
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;
}
| 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(max(max(a,b),c) == a)
{
cout << b * c / 2;
}
else if(max(max(a,b),c) == b)
{
cout << c * a / 2;
}
else
{
cout << a * b / 2;
}
return 0;
} | 106 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << b * a / 2;
}
| 69 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c;
int ans;
cin >> a >> b >> c;
ans = (a*b)/2;
cout << ans << endl;
} | 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 392 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> c >> a >> b;
cout << c * a / 2 << endl;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
unsigned int a, b, c;
cin >> a >> b >> c;
cout << (a * b)/2 << endl;
return 0;
}
| 48 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int c, a, b;
cin >> c >> a >> b;
cout << c * a / 2 << endl;
return 0;
} | 43 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
int main(void) {
int a,b,c; cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 56 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const long long INF = 1LL<<60;
int a,b,c;
int main() {
cin >> a >> b >> c;... | 119 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> side(3);
for(int i = 0; i < 3; i++){
cin >> side.at(i);
}
sort(side.begin(), side.end());
cout << side.at(0) * side.at(1)/2<< endl;
return 0;
}
| 80 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <climits>
#include <bitset>
#include <array>
#include <deque>
#include <queue>
#include <map>
#d... | 137 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = { 0,0,1... | 218 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2.0 << endl;
} | 53 |
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;
}
| 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,N) for(int (i)=0;(i)<(N);++(i))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define MP make_pair
#define pb push_back
const int INF = 1e18;
const int MOD = INF+7;
using P = pair<int,int>;
signed main(){
int ... | 125 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c)
cout << b * c / 2 << endl;
else if (b > a && b... | 132 |
Project_CodeNet | 2,019 | /*
Converted by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define debug cerr << "--" << __LINE__ << "--" << "\n"
using namespace std;
const double EPS = 1e-8;
static int roundToInt(doub... | 1,950 |
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;
} | 46 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
/*
g++ -std=c++11 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG abc/abc116/a.cpp
*/
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define INF (1e16)
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);//おま... | 154 |
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;
} | 45 |
Project_CodeNet | 2,019 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <f... | 552 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca; cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 39 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>... | 284 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
using namespace std;
using QWORD = uint6... | 1,142 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i, start, end) for(int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define MAX 999999999
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
typedef long l... | 168 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a... | 454 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i,s,e) for(int i=(s); i<(e);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n)
#define repe(i,n) for(auto &&i:n)
#define all(v) (v).begin(),(v).end()
#define decimal fixed<<setprecision(20)
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
usin... | 230 |
Project_CodeNet | 2,019 | //
// Created by 伊東麻沙美 on 2019/10/22.
//
#include<iostream>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int main() {
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<(ab*bc)/2<<endl;
return 0;
}
| 77 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int c,a,b;
cin>>c>>a>>b;
cout<< c*a/2 <<endl;
}
| 46 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define str string
#define rep(x,y) for(int i=x;i<y;i++)
#define REP(x,y) for(int j=x;j<y;j++)
#define all(x) x.begin(),x.end()
int main(){
int A,B,C;
str S;
cin>>A>>B>>C;
cout<<A*B/2<<endl;
}
| 86 |
Project_CodeNet | 2,019 | #include<iostream>
#include <stdlib.h>
#include <algorithm>
#include <string>
typedef long long int ll;
using namespace std;
int main(){
int a,b,c;
cin>> a>>b>>c;
cout<<a*b/2<<endl;
}
| 52 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)... | 606 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int x, y, z;
cin>>x>>y>>z;
cout<<x*y/2<<endl;
} | 52 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(){
int a , b, c ;
scanf("%d%d%d", &a,&b,&c);
printf("%d", (a*b)/2);
}
| 38 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define each(it,v) for(auto it : v)
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
using namespace std;
main()
{
vi v... | 132 |
Project_CodeNet | 2,020 | #include <iostream>
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>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
int a, b, c;
cin >> a >> b >> c;
cout ... | 106 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexp... | 242 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 186 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> ABC(3);
for(int i = 0; i < 3; i++){
cin >> ABC[i];
}
sort(ABC.begin(),ABC.end());
cout << ABC[0] * ABC[1] / 2 << endl;
return 0;
}
| 83 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 219 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 51 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
/**
* Name: Chris M. Perez
* University: Interamerican University Metro Campus
*
**/
#define endl '\n'
#define MOD 10e9
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define gcd(x , y) __gcd(x , y)
#define all(x) (x).begin() , (x).end(... | 444 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 626 |
Project_CodeNet | 2,019 | #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>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
return 0;
}
| 42 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(){
int a,b,c,ans;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
ans = a * b / 2;
printf("%d\n",ans);
return 0;
}
| 71 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
#define Inf 1000000000LL
using namespace std;
signed main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<"\n";
}
| 53 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(it) it.begin(), it.end()
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPU(i, a, b, s) for(int i = a; i < b; i += s)
#define REPD(i, a, b, s) for(int i = a; i > b; i -= s)
#define endl "\n"
ll INF = 2e18;
ll MOD = 1e9 + 7;
int i, j... | 162 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 69 |
Project_CodeNet | 2,019 | #define __USE_MINGW_ANSI_STDIO 0
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <numeric>
#include <bitset>
#include <map>
#include <limits.h>
using namespace std;
/// 各桁の和
int sumdigit(int x){
int sum = 0;... | 220 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> c >> a >> b;
if(max(a,max(b,c))==a) cout << b*c/2 << endl;
if(max(a,max(b,c))==b) cout << c*a/2 << endl;
if(max(a,max(b,c))==c) cout << a*b/2 << endl;
return 0;
} | 91 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << endl;
return 0;
}
| 98 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int ab, bc, ca;
int main(void) {
cin >> ab >> bc >> ca;
printf("%d", ab*bc/2);
return 0;
} | 49 |
Project_CodeNet | 2,020 | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | 150 |
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;
} | 45 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
int main() {
int a = 0, b = 0, c = 0, d = 0;
std::cin >> a >> b >> c;
d = a * b / 2;
std::cout << d << std::endl;
} | 61 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
unsigned int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return 0;
} | 48 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | 418 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
double AB,BC,CA;
cin>>AB>>BC>>CA;
cout<<AB*BC/2;
} | 39 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <... | 115 |
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]/2<<endl;
return 0;
} | 65 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int a,b;
int main() {
cin >> a >> b;
cout << a*b/2 << endl;
return 0;
} | 36 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
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 <iostream>
#include <iomanip>
using namespace std;
int main(void){
double a, b, c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
return 0;
}
| 49 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 1,881 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<cmath>
#include<climits>
#include<iomanip>
#include<bitset>
#include<cstdlib>
#include<queue>
#include<utility> //pair
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
... | 153 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab = 0, bc = 0, ca = 0;
cin >> ab >> bc >> ca;
vector<int> vec;
vec.push_back(ab);
vec.push_back(bc);
vec.push_back(ca);
sort(vec.begin(), vec.end());
cout << (vec[0] * vec[1]) / 2 << endl;
} | 93 |
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;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
// cout << a * b / 2 << endl;
double s = (a + b + c) / 2.;
double S = sqrt(s * (s - a) * (s - b) * (s - c));
cout << (int)S << endl;
ret... | 120 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b==c*c)cout<<a*b/2<<endl;
else if(b*b+c*c==a*a)cout<<b*c/2<<endl;
else cout<<c*a/2<<endl;
return 0;
} | 75 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
int main(void){
std::vector<int> len(3);
for(int i=0;i<3;i++){
std::cin>> len.at(i);
}
std::cout<< len.at(0)*len.at(1)/2 <<std::endl;
return 0;
} | 68 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 39 |
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;
cout << a * b / 2 << endl;
return 0;
}
| 50 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int ab,bc,ca,ans;
cin>>ab>>bc>>ca;
ans=ab*bc/2;
cout<<ans<<'\n';
return 0;
}
| 56 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
} | 60 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int AB,BC;
cin >> AB >> BC;
cout << AB * BC / 2 << endl;
} | 40 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.