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;
int main(){
int A,B,C;
cin>>A>>B>>C;
int k=max(A,max(B,C));
if(k==A){
cout << B*C/2<<endl;
}else if(k==B){
cout << A*C/2<<endl;
}else if(k==C){
cout << A*B/2<<endl;
}
} | 93 |
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,020 | #include<iostream>
#include <algorithm>
#include<string>
#include <numeric>
#include<math.h>
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
return 0;
}
| 66 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | 334 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
if (AB < CA && BC < CA) cout << AB * BC / 2 << endl;
else if (BC < AB && CA < AB) cout << BC * CA / 2 << endl;
else cout << CA * AB / 2 << endl;
} | 97 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int ab,bc;cin>>ab>>bc;
cout<<ab*bc/2;
}
| 38 |
Project_CodeNet | 2,019 | #include <stdio.h>
int
main(int atgc, char *argv[])
{
int c, a, b;
scanf("%d%d%d", &c, &a, &b);
printf("%d", c * a / 2);
return 0;
}
| 59 |
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;
} | 44 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <string>
using namespace std;
int main(void){
int a, b, c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 78 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
double 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 < (int)(n); i++)
using ll = long long;
int main() {
int A,B,C;
cin >> A>>B>>C;
cout << A*B/2 << endl;
}
| 70 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c; cin >> a >> b >> c;
cout << (long long)(sqrt(pow(a * a + b * b + c * c, 2) - 2 * (pow(a, 4) + pow(b, 4) + pow(c, 4))) + 1e-9) / 4 << endl;
return 0;
}
| 100 |
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 <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
cin>>a;
cin>>b;
cin>>c;
cout<<a*b/2<<endl;
return 0;
}
| 58 |
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,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 43 |
Project_CodeNet | 2,019 | #include<algorithm>
#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 | // Undone
#include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
#define MOD 1000000007
using namespace std;
signed main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
}
| 74 |
Project_CodeNet | 2,019 | #include <iostream>
#include <map>
#include <set>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int A,B,C;
cin >> A >> B >> C;
cout << A*B/2<< endl;
return 0;
} | 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << '\n';
return 0;
}
| 65 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void) {
int ab, bc, ca;
scanf("%d %d %d", &ab, &bc, &ca);
printf("%d\n", (ab*bc) / 2);
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
// typedef long l;
typedef pair<int,int> P;
const ll INF=100000000000000001;
const double PI=3.141592653589;
int main(){
int a,b,c; cin>>a>>b>>c;
if(a>max(b,c)){
cout<<b*c/2<<endl;
}els... | 145 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include <iostream>
#include<string.h>
#include<algorithm>
#define ll long long
#define hengheng main ()
using namespace std;
int hengheng
{
ll a[10];
ll b,c; ll t;
while(scanf("%lld%lld%lld",&a[1],&a[2],&a[3])!=EOF)
{
sort(a+1,a+4);
printf("%lld\n",a[... | 121 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,c,b;
cin >> a >> b >> c;
cout << 0.5*a*b << endl;
return 0;
} | 46 |
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)/2;
cout<<area<<endl;
}
| 50 |
Project_CodeNet | 2,019 | #include<cstdio>
using namespace std;
int main()
{
int ab, bc, ca;
scanf("%d %d %d", &ab, &bc, &ca);
printf("%d\n", ab*bc / 2);
return 0;
}
| 53 |
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;
}
| 46 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;cin>>a>>b>>c;
cout<<a*b/2;
return 0;
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main ()
{
int a,r,m;
cin>>a>>r>>m;
if (m>=r && m>=a)
cout<<(a*r)/2;
return 0;
}
| 52 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define forOneToN(i, n) for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n) for(int i = 0; i < n; i++)
#define forNToOne(i, n) for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n) for(int i = n-1; i >= 0; i--)
#define makepair make_pair
#define pu... | 1,010 |
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;
} | 50 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int p=a*b*c;
int h=max({a,b,c});
cout<<p/(2*h)<<endl;
} | 57 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | 252 |
Project_CodeNet | 2,019 | //#include "bits/stdc++.h"
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <complex>
#include ... | 657 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int a,b,c;
... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
int A,B,C;
cin>>A>>B>>C;
int x=0;
//処理
x=A*B/2;
//出力
cout<<x<<endl;
}
| 70 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
return 0;
}
| 47 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
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>
using ll = long long;
using namespace std;
ll a,b,c;
ll MAX = 0;
ll ret;
void input(){
cin >> a >> b >> c;
}
void solve(){
if(a>=b && a>=c){
MAX = a;
}else if(b>=a && b>=c){
MAX = b;
}else if(c>=a && c>=b){
MAX = c;
}
ret = a * b * c / (MAX * 2);
}
... | 135 |
Project_CodeNet | 2,020 | #include <stdio.h>
int a, b, c, x;
int main() {
scanf("%d%d%d", &a, &b, &c);
if (a < c && b < c)x = a * b;
if (a < b && c < b)x = a * c;
if (b < a && c < a)x = b * c;
printf("%d\n", x / 2);
} | 89 |
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;
}
| 48 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
int a, b, c;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> c;
cout << a* b / 2;
return 0;
}
| 89 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
using namespace std;
typedef long long LL;
int main()
{
int a[10]={0};
for(int i=0;i<3;i++)
cin>>a[i];
sort(a,a+3);
printf("%d",a[0... | 96 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define... | 425 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <algorithm>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << ((AB * BC) / 2) << endl;
return 0;
} | 75 |
Project_CodeNet | 2,019 | #include<stdio.h>
#define min(x,y) ((x)<(y)?(x):(y))
int a,b,c,d,e;
main()
{
scanf("%d%d%d",&a,&b,&c);
if(a<=b&&a<=c)d=a;
if(b<=a&&b<=c)d=b;
if(c<=a&&c<=b)d=c;
if(d==a)e=min(b,c);
if(d==b)e=min(a,c);
if(d==c)e=min(a,b);
printf("%d",d*e/2);
}/**/ | 114 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<bitset>
#include <sstream>
#include<queue>
#include<set>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef pair<int,ll>P;
const ll mod = 1e9+7;
const ... | 131 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC * CA / max(AB, max(BC, CA)) / 2 << endl;
} | 59 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int tri[3];
cin >> tri[0] >> tri[1] >> tri[2];
sort(tri,tri + 3);
cout << 0.5*tri[0]*tri[1] << endl;
} | 63 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int maxi = max(a, max(b, c));
int ans;
if (maxi == a) {
ans = b * c / 2;
}
else if (max... | 132 |
Project_CodeNet | 2,019 | #include <iostream>
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>
using namespace std;
int main()
{
int a , b, c;
cin >> a >> b >> c ;
cout << a * b / 2 << endl;
} | 43 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
templ... | 221 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B,C;
cin >> A >> B >> C;
cout << (B*2*A)/2/2 << endl;
}
| 49 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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;
} | 74 |
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<math.h>
using namespace std;
int main()
{
long long a,b,c;
while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
{
if(a>b&&b>c)
printf("%lld\n",(b*c)/2);
if(b>a&&b>c)
printf("%lld\n",(a*c)/2);
if(c>a&&c>b)
printf("%lld\n",(a*b)/2);
}
return 0;
} | 108 |
Project_CodeNet | 2,019 | #include<iostream>
#include<math.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
return 0;
} | 48 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main ()
{
int a , b , c , base , h;
cin >> a >> b >> c;
cout<<(a*b)/2<<endl;
return 0;
}
| 51 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 391 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<"\n";
}
| 39 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int a, b, c, mn, mx;
int main()
{
cin >> a >> b >> c;
mn = min(min(a, b), c);
mx = max(max(a, b), c);
cout << mn * (a + b + c - mn - mx) / 2;
return 0;
}
| 81 |
Project_CodeNet | 2,020 | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 207 |
Project_CodeNet | 2,019 | #include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
#include <iomanip>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <numeric>... | 672 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define INF 1e9
int main(int argc, char const *argv[])
{
ll a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
cout << (a1 * a2) /2 << endl;
}
| 54 |
Project_CodeNet | 2,019 | #include <iostream>
int main(){
int a,b,c;
std::cin >> a >> b >> c;
std::cout << a*b/2;
return 0;
}
| 40 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int c,a,b; cin >> c >> a >> b;
... | 130 |
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;
return 0;
} | 54 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
vector<int> v(3,0);
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
cout << (v[0] * v[1]) / 2 << endl;
return 0;
}
| 108 |
Project_CodeNet | 2,019 | #include<iostream>
int main(){
long long AB,BC,CA;
std::cin>>AB>>BC>>CA;
std::cout<< AB * BC / 2;
return 0;
}
| 45 |
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;
}
| 71 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#ifdef _DEBUG_
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
#else
#define dump(val)
#endif
using namespace std;
typedef long long int ll;
template<... | 203 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int A[3];
for (int i = 0; i < 3; ++i) scanf("%d", A + i);
sort(A, A + 3);
printf("%d\n", A[0]*A[1] >> 1);
return 0;
} | 73 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long int
#define nl '\n'
using namespace std;
int main(void){
ll t,n,m,mx=0,cnt=0;
cin>>t>>n>>m;
cout<<.5*t*n<<nl;
}
| 61 |
Project_CodeNet | 2,019 | #ifdef OJ_MISC_OFFLINE
#include "prolog.h"
#else
#define LOG
#define PRINT
#define LCERR
#include <iostream>
auto optimize_cpp_stdio = []() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::setvbuf(stdout, nullptr, _IOFBF, BUFSIZ);
return 0;
}();
#endif
#incl... | 241 |
Project_CodeNet | 2,019 | #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 VRSORT(v) sort(v.rbegin(), v.... | 295 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
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;
} | 61 |
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 <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long l... | 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;
} | 38 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string>
#include <stdexcept>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A * B / 2 << endl;
} | 58 |
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/2 << endl;
}
else if (B>A && B>C){
cout << A*C/2 << endl;
}
else if (C>B && C>A){
cout << B*A/2 << endl;
}
}
| 99 |
Project_CodeNet | 2,019 | #include<iostream>
#include<bits/stdc++.h>
#include<string>
using namespace std;
int main()
{
int a,b,c ;
cin >> a >> b >> c ;
cout << a*b/2 << endl;
}
| 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 << endl;
} | 40 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
cout<<(h*w/2)<<endl;
return 0;
} | 38 |
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;
}
return 0;
} | 101 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | 360 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
return 0;
}
| 44 |
Project_CodeNet | 2,020 | // A.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <... | 337 |
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<string>
#include<array>
#include<cmath>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 63 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
if(a*a+b*b==c*c) printf("%d\n",a*b/2);
else if(a*a+c*c==b*b) ... | 122 |
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;
}
| 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int AB,BC,AC,i;
cin>>AB>>BC>>AC;
i=AB*BC/2;
cout<<i;
} | 48 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int area = a*b*c;
area/=max(a,max(b,c));
cout<<area/2;
return 0;
} | 52 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007 //10^9+7:合同式の法
using namespace std;
typedef long long ll;
//マクロ
#define REP(i,n) fo... | 196 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << endl;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
void input()
{
cin >> a >> b >> c;
}
void solve()
{
if (a * a + b * b == c * c)
{
cout << a * b / 2 << endl;
}
else if (a * a + c * c == b * b)
{
... | 154 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.