Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | //途中で0があると積は0担ってしまうので一旦全て入力しきったあとでないと判断できない
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int M = max(a,b);
M = max(M, c);
int ans = a * b *c/(M*2);
cout << ans << endl;
} | 115 |
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<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
vector<int>v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(),v.end());
int area=v[0]*v[1];
cout<<area/2<<endl;
return 0;
}
| 85 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include"bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n) for(ll i=1,i##_len=(n);i<=i##_len;++i)
#define R... | 335 |
Project_CodeNet | 2,019 | #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
int m,n,o,i;
//string a;
//cin>>m;
cin>>m>>n>>o;
cout<<m*n/2;
return 0;
}
| 62 |
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,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const int MOD = 1e9+7,MAX = 1e5;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(a>b)swap(a,b);
if(b>c)swap(b,c);
cout<<a*b/2<<endl;
return 0;
} | 111 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ioFix ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
long long madd(long long x, long long y, long long modulo) {
return (x + y) % modulo;
}
long long mmult(long long x, long long y, long long modulo) {
return (x * y) % modulo;
}
long long mpow(long long base, long long exp... | 1,204 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int AB,BC,CA;
cin>>AB>>BC>>CA;
cout<<AB*BC/2<<endl;
} | 39 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int AB;
int BC;
int CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
} | 50 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b /2 <<endl;
} | 64 |
Project_CodeNet | 2,019 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <... | 876 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a * b /2;
cout << d << endl;
}
| 47 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, ... | 865 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
int a, b, c;
int main()
{
cin >> a >> b >> c;
cout << (b * a)/2 << endl;
return 0;
} | 82 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | 188 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> v { a, b, c };
sort(all(v)... | 134 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#define ull unsigned long long
#define ul unsigned long
#define ll long long
#define size_t unsigned long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c;
... | 103 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main()
{
int ab = 0, bc = 0, ca = 0;
cin >> ab >> bc >> ca;
cout << (double)(ab * bc / 2)... | 107 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int ... | 135 |
Project_CodeNet | 2,019 | #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>
int main(){
int a,b,c;
std::cin >> a >> b >> c;
std::cout << (a*b)/2;
return 0;
}
| 37 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*1.0*b/2;
} | 39 |
Project_CodeNet | 2,019 | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll... | 395 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod ... | 617 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define SORT(a) ... | 324 |
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;
}
| 43 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
float a,b,c;
cin >>a >>b >>c;
if (max (a,max(b,c))==c)
cout <<a*b/2;
else if (max (a,max(b,c))==b)
cout <<a*c/2;
else
cout<< b*c/2;
}
| 73 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >>c;
if(a>=b && a>=c)cout<<b*c*0.5<<endl;
else if(b>=a && b>=c)cout<<a*c*0.5<<endl;
else if(c>=a && c>=b)cout<<b*a*0.5<<endl;
}
| 97 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int int64_t
#define double long double
#define C const
#define INIT ios_base::sync_with_stdio(0);cin.tie(0);cout<<fixed<<setprecision(10)
using namespace std;C int MAX=numeric_limits<int>::max();C int MIN=numeric_limits<int>::min();C double EPS=1e-7;C int MOD=1e9+7;
// template
#define ... | 3,779 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) for (__typeo... | 438 |
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 fr(x,i,n) for(int x = i; x < n; ++x)
#define fb(x,i,n) for(int x = i; x >= n; --x)
#define pr pair<int,int>
#define ll long long int
const int mod=1e9+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a[3];
fr(i,... | 134 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 242 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int a[3];
int main()
{
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
return 0;
} | 60 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int S;
S = a*b/2;
cout << S << 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;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int d... | 212 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define FORE(i, a, b) for(int i=(a);i<=(b);++i)
#define rep(i, n) for(int i=0;i<(n);++i)
#define repe(i, n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define SP cout<<fixed<<setprecisio... | 232 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001; // const 書き換え禁止
const double PI = 3.14159265358979323846; //M_PI はライブラリ
int main(void){
int a,b,c;
cin >> a >> b >> c;
int ans = a *... | 132 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define REP(n) for(LL i = 0; i < (n); i++)
#define COUT(val) cout << (val) << endl
#define CIN(val) cin >> (val)
#define SORT(vec) sort(vec.begin(), vec.end())
#define SORT_GRE(vec) sort(vec.begin(), vec.end(), greater<LL>())
int main(){
int ... | 122 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
using namespace std;
int main(){
int t,x;
cin >> t >> x;
cout << (t * x) / 2 << endl;
} | 42 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a>b&&a>c)
cout << b*c/2 << endl;
if(b>a&&b>c)
cout << a*c/2 << endl;
if(c>b&&c>a)
cout << a*b/2 << endl;
}
| 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main() {
float a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
} | 44 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int a[3];
int main()
{
scanf("%d%d%d",&a[0],&a[1],&a[2]);
sort(a,a+3);
printf("%d\n",a[0]*a[1]/2);
} | 78 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 140 |
Project_CodeNet | 2,020 | /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {ci... | 519 |
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,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A , B;
cin >> A >> B;
cout << A*B/2 << endl;
}
| 39 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2;
} | 60 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M
using namespace std;
int main()
{
int a,b,c;
while (~scanf("%d %d %d", &a,&b,&c)) {
printf("%d\n", a*b/2);
}
return 0;
}
| 88 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a[120],t;
for(int i = 0;i<3;i++)
scanf("%d",&a[i]);
for(int i = 0;i<3;i++)
{
if(a[i]>a[i+1])
{
t=a[i] + a[i+1];
a[i]=t - a[i];
a[i+1]=t - a[i];
}
}
printf("%d",a[0]*a[1]/2);
return 0;
} | 115 |
Project_CodeNet | 2,019 |
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
//int A,B,C;
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(),a.end());//昇順ソート
cout << a[0] * a[1] /2 << endl;
return 0;... | 104 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
cout<<n*m/2<<endl;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT32_MAX;
const long long int Mod = 1000000007;
const long long int mod = 100000;//10^5
using ll = long long int; //long long int は64bit
using ci = const int; using vi = vector<int>; using Vi = vector<l... | 383 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int s;
s=a*b/2;
cout << s << endl;
} | 48 |
Project_CodeNet | 2,019 |
#include <cstdio>
int main(){
int c, a, b;
scanf("%d %d %d",&c, &a, &b);
printf("%d\n", c * a / 2);
return 0;
} | 52 |
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;
return 0;
}
| 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;
} | 48 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int a[3];
for(int i=0;i<3;i++)cin>>a[i];
sort(a,a+3);
double ans=(a[0]*a[1])/2;
cout<<ans;
} | 69 |
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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
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<<"\n";
return 0;
} | 97 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 63 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using f32 = float;
using f64 = double;
using i64 = int64_t;
using u64 = uint64_t;
#define SELECTER(_1, _2, _3, _4, _5, _6, _7, _8, SELECT, ...) SELECT
#define _FC1(func, type, _1) func(type, _1)
#define _FC2(func, type,... | 816 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int x=(a*b)/2;
cout<<x<<endl;
}
| 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); //cin.tie(NULL); cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
/* BIEN CUC BO BEGIN*/
int a, b, c;
/* BIEN CUC BO END*/
void solve(... | 116 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a,b,c;cin>>a>>b>>c;cout<<a*b/2<<endl;
} | 44 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a*a + b*b <=c*c){
cout << (a*b)/2 << endl;
}else{
cout << (a*c)/2 << endl;
}
return 0;
} | 70 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define INF 1000000007
int main(){
int a[3];
rep(i,3){
cin>>a[i];
}
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
return 0;
}
| 85 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int ab,bc,ca;
cin >>ab>>bc>>ca;
cout <<ab*bc/2;
return 0;
} | 42 |
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;
} | 41 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <math.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
int s=(a+b+c)/2;
int ans = sqrt(s*(s-a)*(s-b)*(s-c));
printf("%d\n",ans);
return 0;
} | 75 |
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;
}
| 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;
return 0;
} | 43 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 50 |
Project_CodeNet | 2,019 | #include <iostream>
#include<string.h>
using namespace std;
int main(void){
int a, b;
scanf("%d%d", &a, &b);
printf("%d", a*b/2);
}
| 46 |
Project_CodeNet | 2,019 | #include <cstdio>
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d",a*b/2);
} | 36 |
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;
} | 43 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
int main() {
int a[3];
int r;
std::cin >> a[0] >> a[1] >> a[2];
std::sort(a, a + 3);
r = a[0] * a[1] / 2;
std::cout << r << std::endl;
return 0;
}
| 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
std::vector<int> v = {a, b, c};
// 並べ替える
std::sort(v.begin(), v.end());
cout << v[0] * v[1] / 2 ;
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include<iostream>
#include <algorithm>
using namespace std;
int N_MAX = 2000;
typedef pair<int,int> P;
int main()
{
int a,b,c;
cin >> a >> b >> c;
int res=a*b*c/(max({a,b,c})*2);
cout << res << endl;
return 0;
} | 74 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int ab, bc;
cin >> ab >> bc;
cout << (ab * bc)/2 << endl;
return 0;
} | 42 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
int lbidx(vector<int> x, int y) {
auto itr = lower_bound(x.begin(), x.end(), y);
in... | 190 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#define lp(i,n) for(int i=0;i<n;i++)
#include<bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
lp(i, 3)
cin >> a[i];
sort(a.begin(), a.end());
cout << (a[0] * a[1]) / 2 << endl;
}
| 80 |
Project_CodeNet | 2,019 | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <tuple>
#include <functional>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,a,n) for(int i = a; i < n; i++)
#defi... | 172 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main() {
int AB,BC,CA;
cin >> AB >> BC >> CA;
int ans = AB * BC / 2;
cout << ans << endl;
} | 51 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
typedef long long ll;
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 58 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define repr(i,k,n) for(int i = (k); i < (n); i++)
#define rep(i,n) repr(i,0,n)
#define ALL(a) begin(a),end(a)
const int MOD = 1000000007;
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
int ctoi(const char c){
switch(c){
case '0': return 0;
... | 278 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
void a()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << endl;
}
int main()
{
a();
} | 48 |
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;
} | 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;
} | 37 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int AB, BC, CA;
int main(){
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
}
| 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define pp pop_back
#define in insert
#define ff first
#define ss second
#define e endl
#define MAXN 200005
#define debug cout<<"we are debuuging"<<endl;
#define MOD ... | 200 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
//三角形ABCはL ABC = 90度の直角三角形である。
int a,b,c;
int S;
cin >> a >> b >> c;
S = 0.5 * a * b;
cout << S << endl;
} | 82 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const int MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define ll long long
#define ar array
using namespace std;
using P = pair<int,int>;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int AB,BC,CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
return 0;
}
| 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << en... | 115 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b*c/(2*max(a,max(b,c)))<<endl;
}
| 46 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 249 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
double a,b,c;
cin>>a>>b>>c;
double ans=(a*b)/2;
cout<<ans;
}
| 51 |
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;
} | 49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.