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>
#include <algorithm>
using namespace std;
int main()
{
int a[3];
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+1+3);
cout<<a[1]*a[2]/2;
return 0;
}
| 69 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 2e9;
int main() {
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 79 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(void) {
int a, b, c,sum,s;
cin >> a >> b >> c;
s = (a + b + c) / 2;
sum = sqrt(s*(s - a)*(s - b)*(s - c));
printf("%d\n", sum);
return 0;
} | 79 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s = (a + b + c) / 2;
cout... | 131 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <math.h>
#include <algorithm>
using namespace std;
#define ll long long
const ll INF = 1e+18;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;;
}
| 83 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if(a >= b && a >= c){
printf("%d\n", b*c/2);
} else if(b >= a && b >= c){
printf("%d\n", a*c/2);
} else {
printf("%d\n", a*b/2);
}
return 0;
} | 103 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
#include <chrono>
#include <cstdlib>
using ll = long long;
using ... | 439 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
int result = 0;
cin >> AB >> BC >> CA;
result = (AB * BC) * 1/2;
cout << result << endl;
} | 58 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int MOD = 1000000007;
int main()
{
int a, b ,c = 0;
cin >> a >> b >> c;
int ans = a * b / 2;
cout << ans << "\n";
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
} | 95 |
Project_CodeNet | 2,019 | #include<iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
}
| 60 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
return 0;
} | 42 |
Project_CodeNet | 2,019 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 3,041 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(3);
for(int i=0;i<3;i++){
cin >> vec.at(i);
}
sort(vec.begin(),vec.end());
cout << vec.at(0)*vec.at(1)/2 << endl;
} | 64 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
} | 34 |
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;
}
| 50 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<time.h>
#include<set>
#include<map>
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>b;i--)
#define vint vector<i... | 172 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2;
} | 44 |
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;
} | 47 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<ab*bc/2<<endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << A*B/2<< endl;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC * 0.5 << endl;
return 0;
} | 56 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<iterator>
#include<complex>
#incl... | 316 |
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,020 | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mo... | 237 |
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 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long AB, BC, CA;
cin >> AB >> BC >> CA;
long long result = AB * BC / 2;
cout << result << endl;
return 0;
} | 60 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cctype>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdlib>
#include <iomanip>
#include <list>
#incl... | 1,982 |
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>
#include<string>
#include<vector>
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>
#pragma GCC optimize ("Ofast")
using namespace std;
#define int long long
#define sync ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define file freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define endl "\n"
#define ends " "
#define die(x) return cout << x << endl, ... | 624 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define ACC(c) (accumulate(ALL(c), 0LL))
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, ... | 202 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <numeric>
#include <cmath>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
#define A... | 256 |
Project_CodeNet | 2,019 | #include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b)... | 275 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
}
| 79 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cout << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++ i)
#define ALL(r) r.begin(), r.end()
#define DUP(x, y) (((x) + (y) - 1) / (y))
using ll = std::int64_t;
... | 248 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | 134 |
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;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int ab, bc, ca;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
return 0;
} | 64 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;
long long int lcm(long long int a,long long int b){
long long int n;
n=a*b/__gcd(a,b);
return n;
}
using ll =long long int;
#define ci(a) cin>>a
#define co(a) cout<<a<<endl
#define gcd(a,b) __gcd(a,b)
#define vec ... | 449 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
return 0;
}
| 45 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << A * B * 0.5 << endl;
} | 47 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) ... | 955 |
Project_CodeNet | 2,019 | #define REP(i, n) for(int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
}
| 69 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <math.h>
int main() {
int a,b,c;
double S, s;
scanf("%d %d %d",&a,&b,&c);
s = (a+b+c)/2;
printf("%d\n",(int)sqrt(s*(s-a)*(s-b)*(s-c)));
return 0;
}
| 71 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
printf("%d",(A*B)/2);
return 0;
} | 46 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s = a * b / 2;
cout << s << endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define max(a,b) (a<b?b:a)
#define abs(x) (x<0?(-x):x)
#define F(i,L,R) for (int i = L; i < R; i++)
#define FE(i,L,R) for (int i = L; i <= R; i++)
#define RF(i,L,R) for (int i = L; i > R; i--)
#define RFE(i,L,R) for (int i = L; i >= R; i--)
#define getI(a) scanf("%d", &a)
#d... | 314 |
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<iostream>
using namespace std;
int main(){
int a,b,c,d,e;
cin>>a>>b>>c;
d=(a>b)?a:b;
e=(a>b)?b:a;
d=(c>d)?d:c;
cout<<(e*d)/2;
return 0;
} | 61 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
return cout<<a*b/2,0;
}
| 42 |
Project_CodeNet | 2,019 | #include <iostream>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >>c;
cout << a*b/2 <<endl;
return 0;
} | 67 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 109 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int AB, BC, CA;
cin>>AB>>BC>>CA;
cout<<AB*BC/2<<'\n';
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
system("pause");
return 0;
} | 55 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void);
int main(void){
int a[3],n=0,m=0,i;
for(i=0;i<3;i++){
scanf("%d",&a[i]);
if(a[i]>m){
m=a[i];
n=i;
}
}
printf("%d",a[0]*a[1]*a[2]/(2*a[n]));
return(0);
} | 92 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A*B/2 << "\n";
} | 40 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <deque>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <set>
#define INF 1000000000000
using namespace std;
using ll = long long;
int main(){
ll a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << en... | 90 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) fo... | 587 |
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;
} | 40 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int ab, bc;
cin >> ab >> bc;
cout << ab * bc / 2 << endl;
}
| 37 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <utility>
#include <map>
#include <queue>
#include <stack>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari ==... | 194 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,s,d;
cin >> a >>s >> d;
cout << a*s/2 << endl;
return 0;
}
| 44 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int x;
vector<int> xs;
for(int i=0; i<3; i++){
cin >> x;
xs.push_back(x);
}
sort(xs.begin(), xs.end());
cout << xs[0] * xs[1] / 2 << endl;
return 0;
}
| 91 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 101 |
Project_CodeNet | 2,020 |
#include<algorithm> //sort,二分探索,など
#include<bitset> //固定長bit集合
#include<cmath> //pow,logなど
#include<complex> //複素数
#include<deque> //両端アクセスのキュー
#include<fstream> //ファイルストリーム（標準入力変更用）
#include<functional> //sortのgreater
#include<iomanip> //setprecision(浮動小数点の出力の誤差)
#inclu... | 824 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i... | 926 |
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;
}
| 46 |
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>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
#define all(i,n) (i),(i... | 271 |
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;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }
tem... | 179 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int Q = min({ A,B,C });
int W = (A + B + C) - Q - max({ A,B,C });
cout << Q * W / 2 << endl;
return 0;
} | 73 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
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>
#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 INF (2e9)
#define EPS (1e-7)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int i, l, ans;
vec... | 170 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::map;
using std::un... | 460 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | 265 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORR(i,a,b) for(int i... | 198 |
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;
} | 41 |
Project_CodeNet | 2,019 | #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;
}
| 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
}
| 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for(ll i = 0;i < n;i++)
template<class T, class U> void cmax(T& a, U b) { if (a<b) a = b; }
template<class T, class U> void cmin(T& a, U b) { if (a>b) a = b; }
int main() {
cin.tie(0); ios::sync_with_std... | 144 |
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 << endl;
return 0;
} | 69 |
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);
} | 45 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int AB , BC ,CA;
cin >>AB >>BC>>CA;
int w;
w=0.5*BC*AB ;
cout << w;
return 0;
}
| 50 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << #x << ":" << x << "\n"
#define dbv(vec) cerr << #vec << "... | 341 |
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;
}
| 66 |
Project_CodeNet | 2,019 | #include <cmath>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
int main(void)
{
int ab , bc, ca;
cin >> ab >> bc >> ca;
if(ab * ab + bc * bc == ca * ca)
cout << ab * bc / 2... | 162 |
Project_CodeNet | 2,020 | //int a = stoi(c); 文字列をintへ
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
//map<キー,値> p は辞書。p[キー] = 値
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文... | 645 |
Project_CodeNet | 2,019 | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 53 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int a,b,c;
cin>>a>>b>>c;
int aa=(a*b);
cout<<aa/2;
return 0;
} | 53 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;... | 286 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr<<#x<<": "<<x<<endl
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;... | 113 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
}
| 63 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
// 整数の入力
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
} | 72 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main()
{
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
cout << (int)(a * b / 2.0) << endl;
}
| 80 |
Project_CodeNet | 2,019 | //in progress
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fr(i,a,b) for(int i = (int)(a); i <= (int)(b); i++)
#define forn(i,n) for(int i =0; i < (int)(n); i++)
#define rfr(i,a,b) for(int i = (int)(a); i >= (int)(b); i--)
#define PI 3.14159265
int main()
{
ios_base::sync_with_stdio(... | 187 |
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,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll a, b; cin >> a >> b;
cout << a*b/2 << endl;
} | 87 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<ld,ld>
#define x first
#define y second
#define pb push_back
#define N 100000
#define LOGN 16
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
int main(){
ios::sync_with_stdio(0);... | 147 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.