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>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, in... | 587 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
int main() {
int ab, bc; cin >> ab >> bc;
cout << ab * bc / 2 << endl;
return 0;
}
| 63 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <string>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <vector>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i_, __start, __end) for(ll i_=(ll)__start; i_<(ll)__end; i_++)
#define print(_a) cout << _a <<... | 175 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = a*b/2;
cout << ans << endl;
return 0;
}
| 75 |
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 a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
}
| 67 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c;cin >> a >> b >> c;
cout << (a*b)/2 << endl;
} | 37 |
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;
} | 42 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(),a.end());
cout << a.at(0)*a.at(1)/2 << endl;
} | 68 |
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 <iostream>
#include <math.h>
using namespace std;
int main()
{
float a, b, c;
cin >> a >> b >> c;
float s = (a + b + c) / 2;
cout << sqrt(s*(s-a)*(s-b)*(s-c)) << endl;
return 0;
}
| 73 |
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() {
cin.tie(0);
ios::sync_with_stdio(false);
int ab, bc, ca;
cin >> ab >> bc >> ca;
int ans = 1;
int maximum = max(ab, max(bc, ca));
if (ab != maximum) {
ans *= ab;
}
if (bc != maximum) ... | 150 |
Project_CodeNet | 2,020 | // J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b, c;
cin >> a >> b >> c;... | 185 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
ll mod=1e9+7;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 59 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
// start
vector<int> x(3);
cin >> x.at(0);
cin >> x.at(1);
cin >> x.at(2);
sort(all(x));
c... | 137 |
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;
#define N 3005
#define REP(i, n) for(int i=0; i<n; i++)
int ab,bc;
int main(){
scanf("%d%d",&ab,&bc);
printf("%d",ab*bc/2);
} | 65 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
int a, b, c;
int ans ;
cin >> a >> b >> c;
ans = a * b * c / (max(a, max(b, c)) * 2);
cout << ans << endl;
} | 68 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a ,b,c,ans;
cin >> a >> b >> c;
cout << a*b/2 << endl;
}
| 44 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define CIN>>x scanf("%lld",&x);
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll... | 251 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int N, M;
int mod = 1e9 + 7;
int main() {
cin >> N >> M;
cout << N * M / 2 << endl;
} | 60 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 37 |
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);
cout << (a[0] * a[1])/2 << endl;
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
int main() {
std::vector<int> v(3);
for (int& x : v) {
std::cin >> x;
}
std::sort(v.begin(), v.end());
std::cout << v[0]*v[1]/2 << std::endl;
return 0;
} | 73 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
}
| 74 |
Project_CodeNet | 2,019 | /// Containers Start
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include... | 617 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab,bc,ca;
cin >> ab >> bc >> ca;
int maxl = max(ab,max(bc,ca));
if(maxl == ab){
cout << bc*ca/2;
} else if(maxl == bc){
cout << ab*ca/2;
} else {
cout << ab*bc/2;
}
} | 94 |
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;
} | 49 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 2,004 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _... | 272 |
Project_CodeNet | 2,019 | #include <iostream>
void problem_A() {
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << (ab * bc) / 2;
}
int main() {
problem_A();
return 0;
} | 53 |
Project_CodeNet | 2,019 | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <functional>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | 901 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", a*b/2);
return 0;
}
| 52 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int i=(m);(i)<(n);(i)++)
typedef long long ll;
int main(){
int a[3];
rep... | 133 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc / 2 << endl;
return 0;
} | 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 << endl;
} | 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;
}
| 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,020 | #include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // in... | 270 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define PI 3.14159265359
int main(){
int A,B,C; cin>>A>>B>>C;
cout<<A*B/2;
return 0;
}
| 51 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b, c, S;
cin >> a;
cin >> b;
cin >> c;
cout << a * b / 2;
return 0;
} | 53 |
Project_CodeNet | 2,019 | // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include ... | 435 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
ll A,B,C;
cin>>A>>B>>C;
cout<<(A*B)/2<<endl;
return 0;
} | 91 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define kyopro ios::sync_with_stdio(false);cin.tie(NULL)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for(ll i{s}; i < N; i++)
#define rem(i, N, s) for(ll i{N}; i > s; i--)
using namespace std;using ll = long long int;using ld = long double;using P... | 702 |
Project_CodeNet | 2,019 | #include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios:... | 132 |
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;
}
| 42 |
Project_CodeNet | 2,020 | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 247 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
/*
#include <math.h>
int standerd = int(pow(10.0,9.0)) + 7;
*/
string ans_Yes = "Yes";
string ans_No = "No";
string ans_yes = "yes";
string ans_no = "no";
int main(){
int A;
cin >> A;
int B;
cin >> B;
int C;
... | 118 |
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;
} | 42 |
Project_CodeNet | 2,019 | #include <stdio.h>
using namespace std;
int a, b, c;
int main()
{
scanf("%d %d %d", &a, &b, &c);
int ans = a * b / 2;
printf("%d", ans);
} | 54 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <functional>
#include <ccomplex>
#include <unordered_map>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
#define MAX 1000000000
int main(){
int A, B... | 104 |
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 "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 593 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<bitset>
#include<bits/stdc++.h>
#define ld long double
#define ll long long int
#define ull uns... | 296 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 197 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int AB, BC, CA;
cin >> AB>>BC>>CA;
cout << AB * BC *0.5<<endl;
return 0;
} | 48 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
ll a,b,c;
cin >> a >> b >> c;
vector<ll> L = {a,b,c};
ll s;
if(a>b){
if(b>c)
s = b * c;
else{
if(a>c) s = b * c;
else s = a * b;
}
}else{
if(a>c) s = a * c;
else{
... | 154 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <limits.h>
//#include <conio.h>
using namespace std;
#define Rep(i,n) for(int i = 0; i < n; ++i )
#define For(i,s,e) for(int i = s; i < e; ++i )
#define ll long long
long a,b,c;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> c;
cout << in... | 109 |
Project_CodeNet | 2,019 | #include<cmath>
#include<iostream>
#include<algorithm>
#include <string>
#include <stdexcept>
using namespace std;
int main(){
int a,b,c,d,e;
char g[20]; string h,i;
cin >> a>>b>>c;
cout <<a*b/2;
} | 62 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 386 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main()
{
... | 96 |
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;
}
| 41 |
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 <bits/stdc++.h>
int main() {
std::int_fast64_t ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << ab * bc / 2 << std::endl;
return 0;
} | 57 |
Project_CodeNet | 2,019 |
#include <set>
#include <string>
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <limits>
#include <map>
#include <numeric>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
... | 563 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
//#include <bits/stdc++.h>
#define rep(i,n) Rep(i,0,n)
#define Rep(i,... | 284 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define r... | 277 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a[3],i,k;
for(i=0;i<3;i++)
{
cin>>a[i];
}
sort(a,a+3);
k=a[0]*a[1]/2;
cout<<k<<endl;
} | 70 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, c;
int main(){
cin >> a >> b >> c;
cout << a * b / 2;
} | 46 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <sstream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 65 |
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;
}
| 36 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template<class T> istream& operator >> (istream& s, vector<T>& v)
{ for (T& x: v) { s >> x; } return s;}
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
int m... | 144 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std ;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<0.5*a*b<<endl;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b, c;
std::cin >> a >> b >> c;
vector<int> v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(), v.end());
std::cout << v.at(0)*v.at(1)/2 << '\n';
}
| 95 |
Project_CodeNet | 2,019 | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
int main(){
long long ab,bc,ca;
scanf("%lld",&ab);
scanf("%lld",&bc);
scanf("%lld",&ca);
printf("%lld\n",ab*bc/2);
}
| 58 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
printf("%d\n", a * b / 2);
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, value;
cin >> a >> b;
value = a * b / 2;
cout << value << endl;
return 0;
} | 55 |
Project_CodeNet | 2,019 | /* -*- coding: utf-8 -*-
*
* a.cc: A: Right Triangle
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include... | 158 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
int main () {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
} | 60 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <limits>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <map>
#include <set>
#include <cst... | 1,150 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> p_int;
typedef pair<ll,ll> p_ll;
typedef tuple<ll,ll,ll> t3_ll;
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
int prime[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
const ll inf = 1000000007;
int main... | 179 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0)
#define so sizeof
#define pb push_back
#define vl vector<ll>
#define forn(i,a,b) for(ll i=1;i<=b;++i)
#define forr(i,a,b) for(ll i=0;i<b;++i)
#define vll vector<pair<ll,ll> >
#define r0... | 213 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
int main(){
int A,B,C;
cin>>A>>B>>C;
cout<<A*B*C/(max(A,max(B,... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
vector <ll> arr(3);
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr.begin(),arr.en... | 126 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 1000000001
#define ll long long
using namespace std;
using pll = pair<ll, ll>;
int main()
{
ll a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 67 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i= (a); i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() { int ab, bc, ca;
cin >> ab ... | 135 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> P;
#define inf 1ll<<60
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define fn fill_n
#define int llong
signed main(){
int ab, bc, ca;
cin >> ab >> bc >> ca;
... | 99 |
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;
} | 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << a*b/2;
} | 36 |
Project_CodeNet | 2,019 | #include <cstdio>
using namespace std; //This makes the code much more cleaner
int main()
{
int x, y, z;
int mult;
scanf("%d %d %d",&x,&y,&z);
mult = x * y/2;
printf("%d",mult);
return 0;
} | 66 |
Project_CodeNet | 2,019 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E17;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_b... | 249 |
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;
} | 37 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0; i<(n); i++)
#define P pair<int, int>
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
//----------------------------------------------------
const int INF = 1001001... | 118 |
Project_CodeNet | 2,019 | // need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <array>
// stream
//#inc... | 164 |
Project_CodeNet | 2,019 | #include<iostream>
#include<sstream>
#include<vector>
#include<iterator>
using namespace std;
int main(void)
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return 0;
}
| 54 |
Project_CodeNet | 2,019 | /*
く__,.ヘヽ. / ,ー､ 〉
＼ ', !-─‐-i / /´
／｀ｰ' L/／｀ヽ､
/ ／, /| , , ',
ｲ / /-‐/ ｉ L_ ﾊ ヽ! i
ﾚ ﾍ 7ｲ｀ﾄ ﾚ'ｧ-ﾄ､!ハ| |
!,/7 '0' ´0iソ| |
|.从" _ ,,,, / |./ |
ﾚ'| i＞.､,,__ _,.イ / .i |
ﾚ'| | / k_７_/ﾚ'ヽ, ﾊ. |
| |/i 〈|/ i ,.ﾍ | i |
.|/ / ｉ： ﾍ! ＼ |... | 771 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 128 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int AB;
int BC;
int CA;
cin >> AB >> BC >> CA;
cout << (AB * BC)/2 ;
} | 44 |
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 <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> c >> a >> b;
cout << a * c / 2 << endl;
} | 44 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.