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;
#define ll long long
#define ld long double
#define pi 3.14159265359
int main(){
int A, B, C; cin >> A >> B >> C;
cout << A * B / 2 << endl;
} | 63 |
Project_CodeNet | 2,020 | #include"bits/stdc++.h"
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
cout << a * c / 2 << endl;
return 0;
} | 46 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#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;
return 0;
}
| 95 |
Project_CodeNet | 2,020 | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree... | 315 |
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;
} | 50 |
Project_CodeNet | 2,019 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rr... | 1,231 |
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;
} | 40 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<0.5*a*b;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<map>
#include<queue>
#include<set>
#include<bitset>
#include<stdio.h>
#include<deque>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main()
{
int a, b, c;
cin >> a >> ... | 106 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define REP(i, n) for (int i=0; i<n; i++)
#define REPD(i, n) for (int i=n-1; i>=0; i--)
#define print(x) cout << x <... | 178 |
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<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
const int INF=10000000... | 132 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A(3);
for(int i=0; i<3; i++) cin >> A[i];
sort(A.begin(), A.end());
cout << A[0]*A[1]/2 << endl;
} | 64 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int a, b, c;
cin >> a >> b >> c;
vector<int> arr({a, b, c});
sort(arr.begin(), arr.end());
cout << ((arr[0] * arr[1]) / 2) << endl;
return 0;
}
| 83 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
return 0;
}
| 67 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << '\n'
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(x) ((int)... | 242 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <sstream>
#include <fstream>
#define all... | 236 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).... | 477 |
Project_CodeNet | 2,019 | #include <iostream>
int main()
{
int ab, bc, ca;
scanf("%d %d %d", &ab, &bc, &ca);
int s = ab*bc/2;
printf("%d", s);
return 0;
}
| 53 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | 44 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | 92 |
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 <iostream>
using namespace std;
int AB, BC, CA;
int main() {
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
const int get_area_triangle(const int& base, const int& height)
{
return (base * height) / 2;
}
int main()
{
int height, base;
std::cin >> height >> base;
std::cout << get_area_triangle(base, height) << std::endl;
return 0;
} | 74 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(signed i=0;i<n;++i)
#define int long long
#define str string
#define debg(a) cout<<#a<<":"<<a<<endl;
#define print(a) cout<<a<<endl;
#define end cout<<endl;
#define elif else if
int a,b,c,i,j,k,n,m,x,y,z;
str s,t;
vector<signed> v;
signed main(){
... | 129 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
in... | 124 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(),a.end());
cout << a[0] * a[1] / 2 << endl;
} | 67 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using ... | 785 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
signed main(){
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a * b / 2);
return 0;
} | 47 |
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 <stdio.h>
#include <iostream>
using namespace std;
int main(void){
int ab;
int bc;
int ca;
int ans;
cin >> ab;
cin >> bc;
cin >> ca;
ans = ab * bc/2;
cout << ans;
return 0;
} | 69 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <cstdio>
using namespace std;
/**
* main
*/
int main () {
int c, a;
scanf("%d %d", &c, &a);
printf("%d\n", c * a / 2);
}
| 64 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main (){
int a, b, c;
cin >> a >> b >> c;
int d = a*b;
cout << d/2;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int a,b;
cin>>a>>b;
cout<<a*b/2<<endl;
}
| 41 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[4];
int main(){
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,020 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int a[3];
for(int i=0;i<2;i++){
cin>>a[i];
}
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
return 0;
} | 76 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<algorithm>
#include<string>
#include<vector>
#include<tuple>
using namespace std;
int main(){
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
}
| 55 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
// Int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
double a, b, c;
cin >> a >> b >> c;
dump(a * b / 2);
return 0;
} | 95 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC * 0.5 << endl;
}
| 47 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0),ios::sync_with_stdio(false);
int a,b,c; cin>>a>>b>>c;
cout<<min({a,b,c})*((a+b+c)-min({a,b,c})-max({a,b,c}))/2<<"\n"s;
} | 72 |
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;
} | 36 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | 149 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
int ans=a*b/2;
cout<<ans<<endl;
} | 40 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
int dx[4]={1,0,-1,0},dy[4]={0,-1,0,1};
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
return 0;
} | 92 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << '\n';
return 0;
}
| 61 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
int32_t main() {
int a, b, c; cin >> a >> b >> c;
if(a > b && a > c) cout << b*c/2;
else if(b > a && b > c) cout << a*c/2;
else cout << a*b/2;
cout << endl;
return 0;
}
| 112 |
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;
} | 42 |
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;
} | 41 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#inc... | 467 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(),(x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
... | 118 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
float x,y,z;
cin>>x>>y>>z;
if(x<=z&&y<=z)
cout<<(x/2)*y;
else if(x<=y&&z<=y)
cout<<(x/2)*z;
else if(y<=x&&z<=x)
cout<<(y/2)*z;
return 0;
}
| 86 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3];
cin>>a[0]>>a[1]>>a[3];
cout<<(a[0]*a[1])/2;
} | 48 |
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;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//*/
using namespace std;
static const int _ = []() {
ios::sync_with_stdio(false);
cin.sync_with_stdio(false);
cout.sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
#define ll long long
#define u... | 561 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod=1e9+7;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.... | 151 |
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.0 << endl;
}
| 43 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int A,B,C;
cin>>A>>B>>C;
cout << A*B/2 << endl;
}
| 94 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b*c)/(max({a,b,c})*2)<<endl;
}
| 48 |
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<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int maxi = max(a, b);
maxi = max(maxi, c);
if(maxi == c)
cout << a * b / 2;
else if(maxi == b)
cout << a * c / 2;
else
cout << b * c / 2;
} | 91 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
typedef pair<int, int> P;
void solve()
{
vector<int> a(3);
for (int i = 0; i < 3; ++i)
{
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[0] * a[1] / 2 << endl;
}
... | 114 |
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 | /* Aa^~ kokoro ga pyompyon suru n jaa^~
// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```?Wfpppbpbbpbbpbbbkbkk
// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` ` dppbbkkkkkkkkkkqkqkk
// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` `` ````(Wpbkkkkkkkkqkkkkkqk
// mmmmmqqqqpr` `` `` ``````... | 2,632 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> L(3);
for (int i = 0; i < 3; i++) cin >> L[i];
sort(L.begin(), L.end());
cout << L[0] * L[1] / 2 << endl;;
return 0;
}
| 76 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
int main(){
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<ab*bc/2;
return 0;
} | 56 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 97 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << (a*b)/2 << endl;
return 0;
}
| 63 |
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;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include <cstdio>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", a * b / 2);
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(),x.end()
int main()
{
int a, b; cin >> a >> b;
cout << a * b / 2 ... | 102 |
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;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 81 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <stdio.h>
int main(){
int A, B, C;
std::cin >> A >> B >> C;
int D;
D = A*B/2;
std::cout << D << std::endl;
return 0;
}
| 66 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//#define int long long
template<typename T> inline bool chmax(T& a,T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T& a,T b) { if (a > b) { a = b; return true; } return false; }
signed main() {
in... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define fort(i,n) for (int i = 1; i <= n; ++i)
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz size()
#define er erase
#define fr first
#define sc second
#define rc(x) return cout << x, 0
using nam... | 137 |
Project_CodeNet | 2,019 | // ABC 118 B
#include<bits/stdc++.h>
using namespace std;
//container util
//------------------------------------------
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),... | 397 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(10);}} fast;
/* define */
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_... | 655 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define step(i, s, n, d) for(int i=s; i<n; i+=d)
#define FOR(i,s,n) step(i,s,n,1)
#define rep(i,n) FOR(i,0,n)
#define ll long long
typedef pair<int, int> P;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << (a*b)/2 << endl;
}
| 101 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 245 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#define rep(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define rrep(i,a,n) for(int (i)=(a);(i)>=(n);(i)--)
#define INF 100000000
typedef long long ll;
using namespace std;
double euclid_distance(doub... | 518 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b ;
cin >> a >> b ;
cout << (a*b)/2 << endl;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
typedef vector<ll> vll;
int main() {
vector<int> nums(3);
for (int i = 0; i < 3; ++i) {
cin >> nums[i];
}
sort(nums.begin(), nums.end());
cout << nums[0] * nums[1] / 2 << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int l, m, n;
cin >> l >> m >> n;
cout << l * m / 2 << endl;
} | 41 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 67 |
Project_CodeNet | 2,019 | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | 201 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uint... | 539 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int a, b;
cin >> a >> b;
co(a*b/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;
return 0;
} | 42 |
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;
} | 42 |
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;
cout << ab * bc / 2 << endl;
} | 69 |
Project_CodeNet | 2,019 | ////////////////////////////////////////
/// tu3 pro-con template ///
////////////////////////////////////////
#include "bits/stdc++.h"
using namespace std;
// -- loop macros -- //
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int ... | 1,660 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << a * b / 2;
return 0;
} | 44 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 390 |
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;
} | 44 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 89 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int side1,side2,side3;cin >> side1 >> side2 >> side3;
cout << (side1*side2)/2 << endl;
return 0;
}
| 56 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout<<setprecision(x);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX*0.99
#define print(s) cout<<(s)<<endl
#define lint long long
#define yes "Yes"
#... | 179 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC * 1/2 << endl;
return 0;
}
| 52 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int a,b;
signed main()
{
return cin>>a>>b,cout<<a*b/2<<"\n",0;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s = (a + b + c) / 2;
cout << sqrt(s * (s - a) * (s - b) * (s - c)) << endl;
return 0;
} | 79 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.