Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int A, B, C;
cin >> A >> B >> C;
cout << (A * B) / 2 << endl;
}
| 54 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int AB = 0;
int BC = 0;
int CA = 0;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
return 0;
}
| 60 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int ab, bc, ca;
cin >> ab >> bc >> ca;
int area;
if( ab >= bc && ab >= ca ){
area = bc * ca / 2;
}else if( bc >= ab && bc >= ca ){
area = ab * ca / 2;
}else{
area = ab * bc / 2;
}
cout << area;
return 0;
}
| 103 |
Project_CodeNet | 2,019 | #include <iostream>
#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;
} | 54 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
return 0;
} | 50 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans= a * b /2;
cout << ans << endl;
} | 47 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | 879 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main(){
int x,y,z;
cin >> x >> y >> z;
cout << (x*y)/2 << endl;
}
| 42 |
Project_CodeNet | 2,019 | #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 fi first
#define se second
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class T> using reversed_pr... | 402 |
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;
} | 49 |
Project_CodeNet | 2,019 | #include <iostream>
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
int ans = A * B;
if (A > B && A > C) ans = B * C;
else if (B > A && B > C) ans = A * C;
std::cout << (ans/2) << std::endl;
return 0;
} | 91 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin>>a>>b;
cout<<a*b/2<<endl;
}
| 36 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N = 0,H = 0,b = 0,a = 0,res = 0;
cin >> N >> H >> b;
res = min(N,min(H,b));
if(res == N){
a = min(H,b);
}else if(H == res){
a = min(N,b);
}else{
a = min(N,H);
}
res = a*res/2;
cout << res << endl;
}
| 113 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main (){
int a,b,c;
double s;
cin>>a>>b>>c;
s=(a+b+c)/2.0;
double ret;
ret=sqrt(s*(s-a)*(s-b)*(s-c));
cout<<ret;
return 0;
}
| 76 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
// Failed to predict input format
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 58 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<numeric>
using namespace std;
typedef long long LL;
LL gcd(LL a, LL b) {
LL r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
LL lcm(LL a, LL b) {
return ... | 138 |
Project_CodeNet | 2,020 | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
... | 1,377 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void solve(){
int ab, bc, ca; cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return;
}
int main(){
solve();
return 0;
}
| 67 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
int maxv;
maxv=max(max(a,b),c);
int ans;
if(maxv==a) ans=b*c/2;
if(maxv==b) ans=c*a/2;
if(maxv==c) ans=a*b/2;
printf("%d\n",ans);
return 0;
} | 109 |
Project_CodeNet | 2,019 | //116A
#include <bits/stdc++.h>
using namespace std;
int main(void){
int AB, BC, CA=0;
cin >> AB >> BC >> CA;
cout << AB*BC/2;
} | 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;
}
| 47 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? ... | 163 |
Project_CodeNet | 2,019 | #include<iostream>
#include <math.h>
using namespace std;
int main(){
double a,b,c,y,s;
cin >> a;
cin >> b;
cin >> c;
s = (a+b+c)/2;
y = sqrt(s*(s-a)*(s-b)*(s-c));
cout << y << endl;
} | 72 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 40 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cstring>
using namespace std;
long long int mod = 1e9 + 7;
template <class T... | 146 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
tem... | 213 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
cout << x*y/2 << endl;
return 0;
} | 42 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
int a[3];
signed main(){
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
int ans=a[0]*a[1]/2;
cout<<ans<<endl;
return 0;
}
| 74 |
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;
} | 54 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int x,y,z;
cin >> x >> y >> z;
int ans = x*y/2;
co... | 120 |
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;
} | 44 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << min(min(a, b), c)*(sqrt(max(max(a, b), c)*max(max(a, b), c) - min(min(a, b), c)*min(min(a, b), c)))/2;
}
| 80 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) ... | 547 |
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;
}
| 48 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
//system("chcp 65001");
int A,B,C;
cin >> A >> B >> C;
cout << B * A / 2;
//cout << N;
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;
} | 40 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(3);
REP(i, 3) cin >> A[i];
sort(A.begin(), A.end());
cout << A[0] * A[1] / 2 << endl;
return 0;
} | 106 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;cin>>a>>b;cout<<a*b/2<<endl;} | 30 |
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,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;
} | 69 |
Project_CodeNet | 2,019 | #include <iostream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <array>
#include <algorithm>
#include <numeric>
#include <limits>
#include <string>
#include <regex>
#include <cstdio>
#include <cstring>
#include <cmath>
#define INF 2000000000
#define REP(i,b,n) for(int i = (b); i < n;... | 243 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
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 << endl;
}
| 72 |
Project_CodeNet | 2,020 | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#i... | 1,168 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<decltype(var)>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var !... | 339 |
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 / 2;
cout << S << endl;
} | 48 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); i++)
#define REP(...) _overload3(__VA_ARGS__, repi, _rep,)(__VA_ARGS__)
typedef long long int ll;
typedef unsigned long long int ull;
cons... | 290 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> x(3); cin>>x[0]>>x[1]>>x[2];
sort(x.begin(),x.end());
cout<<x[0]*x[1]/2<<endl;
} | 66 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define make_unique(a) (a.erase(unique(a.begin(),a.end()),a.end()))
#define allof(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define exists(s, e) (s.find(e)!=s.end())
#define INF 0x3f3f3f3f
#define endl '\n'
#define mp make_pair
#define... | 417 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <utility>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std... | 207 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
double a,b,c;
cin >>a>>b >>c;
cout <<a*b/2<<endl;
}
| 34 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
//関数
const long INF=1000000000000000;
int main(void){
vector<long> A(3);
for(int i=0;i<3;i++) cin>>A.at(i);
sort(A.begin(),A.end());
cout<<A.at(0)*A.at(1)/2<<endl;
} | 82 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << bc * ab / 2 << endl;
return 0;
}
| 55 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,y,z;
cin >> x >> y >> z;
cout << x*y/2 << endl;
} | 43 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << end... | 262 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 591 |
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;
}
| 42 |
Project_CodeNet | 2,020 | #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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int h, w, x; cin >> h ... | 145 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
int main()
{
cool;
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<((ab*bc)/2)<<endl;
return 0;
} | 70 |
Project_CodeNet | 2,019 | //https://atcoder.jp/contests/abc116/tasks/abc116_a
#include<bits/stdc++.h>
#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 fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); i... | 398 |
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 if (a*a+c*c==b*b)
{
cout << a*c/2 << endl;
}
else
{
cout << b*c/2 << endl;
}
} | 97 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int area = 0;
area = ab * bc / 2;
cout << area;
} | 55 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
... | 207 |
Project_CodeNet | 2,019 | #include<cstdio>
using namespace std;
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",a*b/2);
} | 41 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(max(max(a,b),c)==a){
cout << b*c/2 << endl;
}
if(max(max(a,b),c)==b){
cout << a*c/2 << endl;
}
if(max(max(a,b),c)==c){
cout << b*a/2 << endl;
}
}
| 98 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c; cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 64 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
... | 165 |
Project_CodeNet | 2,019 | # include <bits/stdc++.h>
using namespace std;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
# define MOD 1000000007
int main()
{
fastio();
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<((ab*bc)/2)<<endl;
return 0;
}
| 88 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, max, ans;
cin >> a >> b >> c;
max = a;
if (a < b & c < b){
max = b;
}
if(b < c & a < c){
max = c;
}
ans = a * b * c / max / 2;
cout << ans << endl;
} | 97 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 67 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main()
{
vector<int> sides(3);
for (int i = 0; i < 3; ++i) cin >> sides[i];
sort(sides.begin(), sides.end());
cout << sides[0] * sides... | 98 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <map>
#include <utility>
#include <numeric>
#include <typeinfo>
#include <queue>
using namespace std;
#define MOD 1000000007
int main(){
i... | 104 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main(){
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
cout << a * b / 2 << endl;
}
| 59 |
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,020 | //#define NDEBUG
#include "bits/stdc++.h"
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <random>
#ifdef _MSC_VER
#include <ppl.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/ration... | 1,934 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void)
{
... | 132 |
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;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 100 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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;
return 0;
} | 74 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int AB, BC, CA;
int S;
cin >> AB >> BC >> CA;
if (AB*AB + BC*BC == CA*CA)
{
S = 0.5*(AB*BC);
}
cout << S;
return 0;
}
| 74 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#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(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_IN... | 163 |
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;
}
| 42 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b){ if(a < b) { a=b; return 1; }return 0... | 173 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d",a*b/2);
return 0;
} | 47 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
} | 48 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int AB, BC, CA;
int main() {
cin >> AB >> BC >> CA;
co... | 116 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 69 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,s;
cin>>a>>b>>c;
s=(a+b+c)/2;
int ar=sqrt(s*(s-a)*(s-b)*(s-c));
cout<<ar<<endl;
}
| 63 |
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;
}
| 44 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(void){
int ab,bc,ca = 0;
cin >> ab >> bc >> ca;
cout << (ab*bc)/2;
} | 42 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__... | 835 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(void){
int c,a,b; cin>>c>>a>>b;
cout<<(a*c)/2<<endl;
}
| 51 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
double a,b,c,p,s;
while(cin>>a>>b>>c)
{
p=(a+b+c)/2;
s=(p*(p-a)*(p-b)*(p-c));
s=sqrt(s);
cout<<s<<endl;
}
return 0;
} | 80 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2;
return 0;
} | 40 |
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;
}
| 42 |
Project_CodeNet | 2,019 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 183 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // repマクロ
#define leng(n) (int)(log10(n)+1) // 桁数
using namespace std;
signed main() {
int A, B;
cin >> A >> B;
cout << A * B / 2 << endl;
} | 98 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i=0;i<n;i++)
#define why(n,x) int n;while(cin >>n,n!=x)
#define iFOR(i,x,n)for(int i=x;i<n;i++)
#define unless(flg) if ( !(flg) )
#define read cin<<
#define echo cout<<
#define fin <<'\n'
#define __ <<" "<<
... | 669 |
Project_CodeNet | 2,019 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod=1e9+7;
int main(){
int A,B,C;
cin>>A>>B>>C;
cout << A*B/2 << endl;
return 0;
}
| 63 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >>c;
cout << a*b/2 << endl;
} | 35 |
Project_CodeNet | 2,019 | #include<iostream>
#include<math.h>
#include<string>
#include<algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2;
} | 69 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.