Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * a[1] / 2;
}
| 65 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a*a+b*b==c*c) printf("%d",a*b/2);
else if(a*a+c*c==b*b) printf("%d",a*c/2);
else printf("%d",b*c/2);
return 0;
}
| 90 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iomanip>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int ans = ab * bc / 2;
cout << ans << endl;
} | 60 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... | 316 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
ll a[3];
lol(i,3)cin>>a[i];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
return 0;
}
| 96 |
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,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 | #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 main()
{
int x,y,z;
int ans=0;
cin >> x >> y >> z;
ans=(x*y)/2;
cout << ans << endl;
return(0);
}
| 53 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = min(a*b, min(b*c,c*a)) / 2;
cout << ans << "\n";
} | 60 |
Project_CodeNet | 2,019 | /** Author: Nicklaus **/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
#define PI 3.14159265358979324
int main(){
int a, b, c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
} | 75 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll x,y,z;
cin >> x >> y >> z;
cout << (x * y) / 2 << endl;
}
| 76 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int ab,bc;cin >> ab >> bc;
cout << ab*bc/2;
return 0;
} | 39 |
Project_CodeNet | 2,019 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#in... | 1,002 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int x, y, a;
cin >> x >> y >> a;
cout << x * y / 2 << endl;
} | 43 |
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 <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x = scanInt();
#define sll(x) LL x = scanL... | 573 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;cin>>A>>B;
cout<<A*B/2<<endl;
}
| 41 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2;
} | 37 |
Project_CodeNet | 2,019 | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#i... | 251 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC;
cin >> AB >> BC;
cout << AB * BC / 2 << endl;
} | 41 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inclu... | 766 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 74 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
printf("%d",a*b/2);
return 0;
} | 45 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
#define PB push_back
#define MP make_pairA
#define REP(i,n) for(int i=0;i<(n);i++)
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 87 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
int area;
cin>>a>>b>>c;
area = .5*a*b;
cout<<area;
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<algorithm>
using namespace std;
void calc(int x, int y){
int ans;
ans = x * y / 2;
printf("%d", ans);
}
int main(void){
//int a = 10 ; int b = 8; int c = 4;
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int data[3] = {a,b,c};
sort(data, data+3);
calc(data[0],... | 127 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
#include <iomanip>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 60 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
con... | 191 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
int main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return 0;
} | 85 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 529 |
Project_CodeNet | 2,019 | //In the name of ALLAH the most merciful the most beneficial
#include<cstdio>
#include<cstring>
#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<fstream>
#define sc(x) scanf("%d",&x)
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORd(i,a,b) for(int i=a;i>b;i--)
#define ff fir... | 259 |
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;
} | 43 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
int ans = AB * BC / 2;
cout << ans << endl;
return 0;
} | 51 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | 268 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int a[100];
int main(){
for (int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
cout << a[0]*a[1]/2;
return 0;
} | 67 |
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;
} | 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <sstream>
#include <set>
#include <tuple>
#include <algorithm>
#include <memory>
#include <numeric>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
ll a, b, c;
cin >> a >> b >> c;
ll s;
i... | 156 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
} | 43 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
int ans = (AB * BC) / 2;
cout << ans << endl;
} | 70 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <istream>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int a,b,c;
cin >... | 95 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a * b... | 131 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define downque(que) priority_queue<ll> que;
#define upque(que) priority_queue<ll, vector<int>, ... | 224 |
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>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
int main(){
ll ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<ab*bc/2<<endl;
return 0;
} | 57 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <array>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define RREP(i,n) for(int i=(n);i>0;--i)
#define CI cin>>
#define CO cout<<
#define EN <<endl
#define all(x) (x).begin(),(x).end()
using names... | 234 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
/*
死のマウス
. あり許せん！
∧＿＿∧
|| （＃｀Д´ ） ||
|| ( | | | |||
从| | | |从从
￣) ⊂ノ￣￣!_つ￣て
フヘ( ヽヘ(＼
*/ | 148 |
Project_CodeNet | 2,019 | #include <iostream>
int main(){
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << ab*bc/2 << std::endl;
return 0;
}
| 47 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a); (i)<=(b); (i)++)
#define REP(i,N) FOR((i), 0, (N)-1)
int gcd(int a, int b){if(a>b) swap(a,b); return a==0 ? b : gcd(b%a,a);}
int main(){
int A,B,C;
cin >> A >> B >> C;
cout ... | 125 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int a,... | 139 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_po... | 1,025 |
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,019 | #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;
using ll = long long;
#define INF 1e9
int main(void){
int a,b,c;
cin>>a>>b>>c;
int ans;
if (a>=b&&a>=c){
ans=b*c;
}
if (b>=a&&b>=c) ans=a*c;
if (c>=a&&c>=b) ans=a*b;
cout<<ans/2<<endl;
return 0;
} | 109 |
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;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << x*y/2 << endl;
return 0;
} | 75 |
Project_CodeNet | 2,019 | /* ABC116 */
/* A */
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int arr[3];
for (int i=0; i<3; ++i)
cin >> arr[i];
sort(arr, arr+3);
int S;
S = (arr[0] * arr[1]) /2;
cout << S << endl;
} | 86 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int a1,a2,a3;
cin>>a1>>a2>>a3;
int x=min(min(a1,a2),a3);
int y=max(max(a1,a2),a3);
int z=a1+a2+a3-x-y;
int area=x*z/2;
cout<<area;
} | 77 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typedef int64_t ll;
const ll INF = 1000000000000000000;
#define for... | 187 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
cout << 0.5*a*b << endl;
return 0;
} | 53 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int a[3];
int main()
{
for(int i=1;i<=3;i++)cin>>a[i];
sort(a+1,a+4);
cout<<a[1]*a[2]/2<<endl;
return 0;
} | 61 |
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,019 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a);i < (b);++i)
typedef long long ll;
int main(){
int a,b,c; cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 64 |
Project_CodeNet | 2,019 | #include <map>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
int main()
{
int AB, BC, CA;
scanf("%d%d%d", &AB, &BC, &CA);
printf("%d", AB * BC / 2);
} | 62 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
} | 66 |
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;
}
| 45 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
} | 60 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 72 |
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;
} | 39 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int A, B ,C;
cin >> A >> B >> C;
int ans = A * B / 2;
cout << ans << endl;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a*b/2<< endl;
} | 37 |
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;
} | 39 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n[4];
int main(){
for(int i= 0; i < 3; i++){
scanf("%d", &n[i]);
}
sort(n, n + 3);
cout << (n[0] * n[1]) / 2 << endl;
return 0;
}
| 79 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C; cin >> A >> B >> C;
cout << min({ A*B, B*C, C*A }) / 2 << endl;
} | 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;
} | 39 |
Project_CodeNet | 2,019 | //hinagata.cpp
/*includes*/
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <numeric>
#include <iomanip>
#include <limits>
/*namespace*/
using namespace std;
using ll= long long;
/*define macro*/
#define REP(i,n) for(int i=0;i<... | 165 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
int main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2;
return 0;
}
| 73 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
double A,B,C;
cin>>A>>B>>C;
cout<<A*B/2<<endl;
} | 42 |
Project_CodeNet | 2,019 | #include <cstdlib>
#include <iterator>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
#include <functional>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB; int BC; int CA;
cin >> AB >> BC >> CA;
cout << BC * AB / 2 << endl;
}
| 44 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b * 0.5 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
| 36 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
using int64 = long long;
#define repeat(i, n) for (auto i = declty... | 140 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 589 |
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;
}
| 37 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | 703 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#define ios std::ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define PI acos(-1.0) //3.14159265358
#define EPS 1e-9 //epsilon, 10^-9, checking for equality
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()... | 573 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << (a * b) / 2 << endl;
} | 37 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep2(i, x, n) for(int i=x;i<n;++i)
#define INF 1<<29;
int main()
{
... | 127 |
Project_CodeNet | 2,020 | /*ver 5*/
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <tuple>
#include <map>
#include <list>
#include <set>
using namespace std;
void init() {cin.tie(0);ios::sync_with_s... | 2,279 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y,Z;
cin >>X>>Y>>Z;
cout <<X*Y/2;
}
| 41 |
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;
} | 43 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a * b * 1/2 << endl;
}
| 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
/* define const */
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
/* end defineing */
signed main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
}
| 106 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __... | 777 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 93 |
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;
}
| 44 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a,b,c;
cin >> a >>b>>c;
cout << a*b /2 << endl;
} | 39 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi= vector<vi>;
using vs = vector<string>;
using pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define red(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(a) begin(a),end(a)
#define pb(a) push_bac... | 228 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int x, y, z;
int main() {
cin >> x >> y >> z;
cout << x * y / 2 << endl;
return 0;
} | 49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.