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 ab, bc ,ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << '\n';
return 0;
}
| 51 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | 464 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
return 0;
} | 62 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
cout << c*a/2 << endl;
}
| 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | 748 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
int main()
{
int A,B,C;
std::cin >> A >> B >> C;
if(A>B && A>C){
std::cout << B*C/2 << std::endl;
}
if(B>A && B>C){
std::cout << A*C/2 << std::endl;
}
if(C>A && C>B){
std::cout << A*B/2 << s... | 115 |
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,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<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,z;
cin>>x>>y>>z;
cout<<(x*y)/2<<endl;
}
| 40 |
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 <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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <io... | 271 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline ... | 159 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int x,y,z;
cin >> x >> y >> z;
cout << (x*y/2) << endl;
return 0;
}
| 46 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
return 0;
} | 43 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
int a, b, c;
cin >> a >> b;
cout << a * b / 2 << endl;
return 0;
}
| 51 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | 158 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int MIN=9999;
string S;
void solve(int n,int m,int now){
if(m == 3){
MIN = min(MIN,abs(753-now));
return;
}
if(n == S.size())
return;
solve(n+1,m+1,10*now+(S[n]-'0'));
}
int main(){
int A,B,C;
cin >> A >> B >> C;
cout << ((A*B)/2) << end... | 118 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rept(i,a,b) for(int i=a; i<b; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> vi;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout ... | 105 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
| 39 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d\n",a*b/2);
return 0;
}
| 43 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,A,B;
string S;
string alpha = "abcdefg... | 137 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
//for簡易表記(引数ミス防止)
#define FOR(LoopVariable,numberOFbegin,numberOFend) for... | 262 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <map>
#include <time.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, ... | 177 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
signed 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;
}
| 70 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 81 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <map>
#include <utility>
#include <list>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
#define LL long long
int main() {
int s, t, u;
cin >> s >> t >> u;
cout << s * t / 2 << endl;
return 0;
}
| 84 |
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,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;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> sides(3);
for (int i = 0; i < 3; i++) cin >> sides[i];
sort(begin(sides), end(sides));
cout << sides[0] * sides[1] / 2 << endl;
return 0;
} | 83 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std... | 125 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(),(v).end()
using namespace std ;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main()
{
int a, b, c ;
cin >> a >> b >> c ;
cout <<a*b/2<<endl ;
return 0 ;
}
/* 吾輩はやれ... | 251 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
#include<math.h>
int main (){
double a, b, c, d;
cin >> a >> b >> c;
d = (a * b *(sqrt(1-((a*a + b*b - c*c)/(2*a*b))*((a*a + b*b - c*c)/(2*a*b)))))/2;
cout << d << endl;
return 0;
} | 90 |
Project_CodeNet | 2,019 | //20190615
#include <iostream>
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;
// templates -------------------------------------
#define ULL unsigned long long
#define LL long long
#define LLD long long double
#define REP(i, n) for(LL i = 0; i < n; i++)
#define INV_REP(i, n) for(LL i = n; 0 <= i; i--)
LL sumOfDigits(LL n)
{
LL sum = 0;
while(0... | 490 |
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;
} | 47 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sides(3);
for (int i = 0; i < 3; i++) {
cin >> sides.at(i);
}
sort(sides.begin(), sides.end());
cout << sides.at(0) * sides.at(1) / 2 << endl;
} | 79 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<stdlib.h>
int main()
{
int a,b,c,x;
scanf("%d %d %d",&a,&b,&c);
x=(a*b)/2;
printf("%d\n",x);
return 0;
} | 51 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cctype>
#define len length()
#define sz size()
#define rng(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(... | 275 |
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,019 | #include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(20);
int a, b, c; cin >> a >> b >> c;
cout << (a * b) / 2 << "\n";
}
| 100 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int area = ab * bc / 2;
cout << area << endl;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <functional>
typedef long long ll;
using namespace std;
//#define int long long
//素数判定
inline bool IsPrime(int p) {
if (p == 1) return false;
for (int i = 2; i <= sqrt(p); i++) {
if (p%i == 0) retu... | 571 |
Project_CodeNet | 2,019 | #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;
} | 70 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main(){
int N, K, L;
cin >> N >> K >> L;
cout << (N*K)/2 << endl;
return 0;
} | 46 |
Project_CodeNet | 2,020 | //C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | 427 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
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... | 230 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin>>A>>B>>C;
int D=max(A,max(B,C));
cout<<A*B*C/(2*D)<<endl;
}
| 52 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include <sstream>
#include<map>
#include<cmath>
#include<queue>
#include <functional>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
vector<int> vNum(3, 0);
rep(i, 3)
{
cin >> vNum[i];
}
... | 120 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int side[4];
int main()
{
int i;
for(i=0;i<3;i++)
scanf("%d",&side[i]);
sort(side,side+3);
printf("%d",side[0]*side[1]/2);
return 0;
} | 66 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define FOR(i, n) for(int i = 0; i < (n); i ++)
#define CIN(type, val) type val; cin >> val;
#define COUT(val) cout << (val) << "\n";
using namespace std;
int main(void){
CIN(int, a);
CIN(int, b);
COUT(a*b/2);
} | 96 |
Project_CodeNet | 2,019 | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for(int i = int(a)-1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template<clas... | 377 |
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,020 | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).b... | 186 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
float a,b,c;
cin >> a >> b >> c;
cout << (0.5 * a * 2*b)*0.5;
} | 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
using namespace std;
int main (int argc, char const *argv[])
{
int A,B,C;
cin>>A>>B>>C;
cout<<A*B/2<<endl;
return 0;
} | 63 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,S,areaTriangle;
cin>>A>>B>>C;
S=(A+B+C)/2;
areaTriangle=sqrt(S*(S-A)*(S-B)*(S-C));
cout<<areaTriangle;
}
| 65 |
Project_CodeNet | 2,020 | #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;
}
| 50 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int ans;
ans = a*b/2;
cout << ans << endl;
return 0;
}
| 51 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 45 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int a,b,c,s,ans=0;
cin>>a>>b>>c;
s=(a+b+c)/2;
ans=sqrt(s*(s-a)*(s-b)*(s-c));
cout<<ans;
return 0;
}
| 75 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int a,b,c;
cin>>a>>b>>c;
cout<<a*b*c/(2*max({a,b,c}))<<endl;
} | 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... | 323 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<string.h>
#include <iomanip>
#include <sstream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
}
| 74 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector... | 284 |
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,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d, e;
d = min(a, min(b, c));
e = max(a, max(b, c));
if(d == a){
if(e == b) e = c;
else e = b;
}
else if(d == b){
if(e == a) e = c;
else e = a;
}
else{
... | 143 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 36 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2;
return 0;
} | 48 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#defi... | 1,225 |
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;
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++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define for1(i, m, n) for(int i = m;i < n;i++)
#define ll long long
#define endl '\n'
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;... | 183 |
Project_CodeNet | 2,019 | #ifdef _WIN32
#define DEBUG 1
#endif
#define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#include <iostream>
#include <string.h>
#include <fstream>
#include <math.h>
using namespace std;
#ifdef DEBUG
#include "include.h"
#else
inline signed wait(){return 0;}
inline void dout... | 2,128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a, b, c;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> a >> b >> c;
cout << a * b / 2;
}
| 61 |
Project_CodeNet | 2,019 | #include <iostream>
#include <math.h>
using namespace std;
int main () {
int a, b, c;
cin >> a >> b >> c;
double s = 0.5 * (a + b + c);
cout << pow(s * (s - a) * (s - b) * (s - c), 0.5);
} | 80 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int a,b,c;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >>a >> b >> c;
if(a > b){
swap(a,b);
}
if(a > c){
swap (a,c);
}
if(b > c){
swap(b,c);
}
cout << a * b /2 << end... | 119 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin >> a >> b >> c;
d = a * b /2;
cout << d << endl;
return(0);
}
| 50 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 36 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int x, y, z;
cin >> x >> y >> z;
cout << x*y/2 << endl;
return 0;
}
| 44 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >>a>>b>>c;
cout << sqrt((a+b+c)*(a-b+c)*(b-c+a)*(c-a+b)/16) << endl;
} | 53 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iostream>
#include <climits>
#include <algorithm>
typedef long long int ll;
using namespace std;
#define INF 1LL << 60;
#include <string>
#include <typeinfo>
#include <bitset>
int main(){
int A,B,C;
cin >> A >> B >> C;
int S;
S = (A*B)/2;
cout << S << endl;
} | 93 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
if(c>a&&c>b) cout<<a*b/2;
if(b>a&&b>c) cout<<a*c/2;
if(a>b&&a>c) cout<<b*c/2;
return 0;
} | 74 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
vector<int> s={a,b,c};
sort(s.begin(),s.end());
cout << s.at(0)*s.at(1)/2 << endl;
}
| 66 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<numeric>
#include<iomanip>
#include<deque>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 79 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (ll i=0; i<(n); ++i)
#define rep1(i,n) for (ll i=1; i<=(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
const ll mod = 998244353;
const double e = 0.000000001;
int main(){
int a,b,c; cin >> a >... | 127 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | 158 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
cout << x * y / 2;
} | 33 |
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 AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (double)(AB * BC) / 2 << endl;
return 0;
} | 78 |
Project_CodeNet | 2,019 | #include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::co... | 335 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
ci... | 104 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include <cmath>
using namespace std;
int main(void){
int c,a,b;
cin>>c>>a>>b;
cout<<a*c/2<<endl;
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | 375 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
} | 53 |
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 | //Right Triangle
#include <bits/stdc++.h>
using namespace std;
int main(){
int c,a,b;
cin>>c>>a>>b;
cout<<a*c/2<<endl;
return 0;
} | 49 |
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;
} | 53 |
Project_CodeNet | 2,020 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) SOR... | 592 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
// created [2020/02/02] 00:32:40
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll =... | 1,690 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
using namespace std;
int main () {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc / 2;
}
| 63 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.