Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <iostream>
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 AB,BC,CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
} | 47 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
/**** Type Define ****/
typedef long lo... | 1,364 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a>> b >> c;
cout << a*b/2<<endl;
} | 35 |
Project_CodeNet | 2,020 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | 1,487 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
cout << a * b /2 << endl;
} | 42 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<cstring>
#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,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;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se se... | 546 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define Rep(i,n) for(int i=0;i<(int)(n);++i)
#define int long long
using namespace std;
signed main()
{
int x=0,y=0,z=0,w,i,j;
cin>>x>>y>>z;
if(... | 174 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int f(int ab, int bc, int ca) {
if (ab > bc && ab > ca) {
return bc * ca / 2;
}
if (bc > ab && bc > ca) {
return ab * ca / 2;
}
return ab * bc / 2;
}
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int result = f(ab, bc, c... | 121 |
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;
} | 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <algorithm>
using namespace std;
template<typename T>
void show(T a){
for(auto i : a){ cout << i << " "; }
cout << endl;
}
int main(int argc, char *argv[]){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<int>... | 128 |
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;
cout<<(.5*b)*a;
return 0;
}
| 44 |
Project_CodeNet | 2,019 | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vec... | 960 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int A[3];
for (int i = 0; i < 3; i++) cin >> A[i];
sort(A, A + 3);
cout << A[0] * A[1] / 2 << endl;
return 0;
} | 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 183 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
long long fpb(long long x, long long y) {
return (y == 0) ? x : fpb(y, x % y);
}
long long kpk(long long x, long long y) {
return x * (y / fpb(x, y));
}
bool cmp(long long a,long long b)
{
return a>b;
}
int main()
{
ios::sync_with_st... | 140 |
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;
} | 48 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int a, b, c, x, y;
cin >> a >> b >> c;
x = a;
y = b;
if(c < a) x = c;
else if(c < b) x = c;
cout << x*y/2 << endl;
} | 83 |
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;
} | 44 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a, b, c, d, n = 0, ans = 0, ans2 = 0;
string s;
cin >> a>>b>>c;
ans = a*b/2;
cout << ans << endl;
} | 64 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define DB(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<ll> a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin(),a.end());
cout<<a[0]*a[1]/2;
return... | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b/2)<<endl;... | 111 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b*c/max(max(a,b),c)/2<<endl;
return 0;
} | 57 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
class kin{
public:
inline void open(FILE *,int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
inline kin &o... | 2,077 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * a[1] / 2<< endl;
return 0;
} | 87 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a[3]={};
cin>>a[0];cin>>a[1];cin>>a[2];
cout<<a[0]*a[1]/2;
return 0;
} | 55 |
Project_CodeNet | 2,019 | // "include" {{{
#include <deque>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
// }}}
using namespace std;
#... | 290 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<climits>
#include<cstdlib>
#include<map>
#include<math.h>
#include<utility>
#include<vector>
using namespace std ;
typedef long long ll;
// N K
// A_1, ..., A_N
int main(){
int AB, BC, CA ;
cin >> AB >> BC >> CA ;
int s = (AB+BC+CA)/... | 115 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
... | 1,690 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int A[3];
REP(i,3) cin>>A[i];
sort(A,A+3);... | 131 |
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(){
vector<int> e(3);
for(int i=0; i<3; i++){
cin >> e[i];
}
sort(e.begin(),e.end());
cout << e[0] * e[1] / 2 << endl;
return 0;
} | 75 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a[100];
cin>>a[0]>>a[1]>>a[2];
int ans;
sort(a,a+3);
ans = a[0]*a[1]/2;
cout<<ans;
} | 62 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
typedef long long ll;
using namespace std;
//素因数分解
void ... | 670 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v(3);
for (auto &x : v) cin >> x;
sort(v.begin(), v.end());
int ans = v[0] * v[1] / 2;
cout << ans << endl;
}
| 69 |
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;
} | 43 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
#define _GLIBCXX_DEBUG
#define rep(i, a) for(int i = 0; i < a; i++)
#define ALL(v) v.begin(), v.end()
int main(){
int c,a,b;
cin>>c>>a>>b;
cout<<(c*a)/2<<endl;
} | 88 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = (a*b) / 2;
cout << ans << endl;
return 0;
} | 54 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//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; }
/* attention
long longのシフト演算には気をつけよう
タ... | 190 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | 265 |
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;
} | 47 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
} | 52 |
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;
} | 42 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
vector<int> vec(3);
for(auto &x:vec){
cin>>x;
}
sort(vec.begin(),vec.end());
long long ans=vec[0]*vec[1]/2;
cout<<ans<<endl;
return 0;
}
| 80 |
Project_CodeNet | 2,020 | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 994 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
int ans;
if( AB >= BC && AB >= CA ){
ans = ( BC * CA ) / 2;
}else if( BC >= AB && BC >= CA ){
ans = ( AB * CA ) / 2;
}else if( CA >= AB && CA >= BC ){
ans = ( AB * BC ) /2;
}
cout << ans << ... | 120 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
//isPr... | 173 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... | 262 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
m... | 167 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int a, b, c;
int main(){
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 106 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2;
} | 33 |
Project_CodeNet | 2,019 | #include<iostream>
int main(){
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << bc * ab / 2 << std::endl;
return 0;
}
| 49 |
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 << endl;
return 0;
} | 56 |
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;
using ll = long long;
const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << ": " << x << endl;
#define popcnt __builtin_popcount
int main() {
in... | 135 |
Project_CodeNet | 2,019 | //{{{
#include<algorithm>
#include<cmath>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<sys/time.h>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
enum : int { M = (... | 304 |
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;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
vector<int> A(3) ;
rep(i,3) cin >> A.at(i) ;
sort(A.begin(),A.end());
cout << A.at(1)*A.at(0)/2 << endl;
}
| 89 |
Project_CodeNet | 2,019 | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
float AB,BC;
cin >>AB>>BC;
cout<<AB*BC/2;
}
| 59 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
using namespace std;
int main(void){
int AB,BC,CA;
cin>>AB>>BC>>CA;
cout<<(AB*BC)/2<<endl;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a*b/2;
} | 31 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <list>
#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int... | 1,293 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB,BC,CA;
cin>>AB>>BC>>CA;
cout << AB*BC/2<<endl;
}
| 44 |
Project_CodeNet | 2,020 | #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;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 100000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 100005;
const in... | 140 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int ab,bc,ca,square;
cin >>ab>>bc>>ca;
square = (ab*bc)/2;
cout << square;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep (i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); +... | 416 |
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>
using namespace std;
int main() {
int AB,BC,CA,area;
cin >> AB >> BC >> CA;
area = AB * BC / 2;//縦×横割る2
cout << area << endl;
return 0;
} | 66 |
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;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int b,c;
cin >> b >> c;
cout << (b*c)/2 << endl;
return 0;
} | 36 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
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);
} | 65 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sides(3, 0);
for (int i = 0; i < 3; i++) cin >> sides.at(i);
sort(sides.begin(), sides.end());
cout << sides.at(0) * sides.at(1) / 2 << endl;
return 0;
} | 86 |
Project_CodeNet | 2,019 | /*
chirag11032000
Chirag Thakur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair < int, int >;
using pll = pair < ll, ll >;
template < typename T > usi... | 490 |
Project_CodeNet | 2,020 | #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 <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int area = ((a * b * c) / (max(max(a, b),c))) / 2;
cout << area;
return 0;
} | 70 |
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 <... | 227 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s-1; i > 0; i--)
#define revrrep(i, s) for (int i ... | 201 |
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;
}
| 46 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long int
#define INF INT_MAX
#define mod
#define chutiyaap ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
bool sortbysec(const pair<ll,ll> &a,const pair<ll,ll> &b){return (a.second < b.second);}
ll gcd(... | 152 |
Project_CodeNet | 2,019 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_A main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)
const int MGN = 8;... | 306 |
Project_CodeNet | 2,019 | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1000000000
#define mod 1000... | 175 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
}
| 92 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functi... | 340 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
int main(void){
int a,b,c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", a*b/2);
}
| 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | 270 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b... | 137 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
double AB,BC,CA;
double ret;
cin >> AB>>BC>>CA;
ret=AB*BC/2;
cout << ret << endl;
}
| 53 |
Project_CodeNet | 2,019 | #include<iostream>
#include <string>
#include <cstdlib> //絶対値利用のため
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i,n) for(int i=0;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
//const int INF = INT_MAX / 2;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout ... | 118 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 493 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 30;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 80 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int a,b,c;cin>>a>>b>>c;
int x;
x = a*b/2;
if(x>b*c/2){x=b*c/2;}
if(x>a*c/2){x=a*c/2;}
cout<<x<<endl;
} | 90 |
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*c / 2 / max({a, b, c}));
} | 60 |
Project_CodeNet | 2,019 | $0*=$2*$3/$($1<$2?$2<$3?3:2:$1<$3?3:1)/2 | 30 |
Project_CodeNet | 2,019 | fun readInt () = TextIO.scanStream (Int.scan StringCvt.DEC) TextIO.stdIn
val SOME x = readInt ()
val SOME y = readInt ()
val SOME z = readInt ()
val a = x * y div 2
val () = print (Int.toString a ^ "\n")
| 66 |
Project_CodeNet | 2,019 | structure A = Array
structure C = Char
structure CV = CharVector
structure I = Int
structure L = List
structure LI = LargeInt
structure S = String
structure SC = StringCvt
structure T = TextIO
fun scan rdr strm = SOME (SC.splitl (not o C.isSpace) rdr (SC.skipWS rdr strm))
fun next () = valOf (T.scanStream scan ... | 165 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.