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>
#define rep(i,n) for(int i=0;i < (n);++i)
typedef long long ll;
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int ans;
if(a*a == b*b+c*c) ans = b*c/2;
else if(b*b == a*a+c*c) ans = a*c/2;
else ans = a*b/2;
cout << ans << endl;
return 0;
}
| 115 |
Project_CodeNet | 2,019 | //------------------------------------------
//include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
... | 2,482 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | 261 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int a, b;
cin >> a >> b;
cout << a*b/2 << endl;
return 0;
}
| 50 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <memory>
#include <numeric>
#include <vector>
// constexpr std::int64_t INF = 1ull << 50;
constexpr int INF = 1 << 20;
auto main() -> int {
int AB, BC, CA;... | 114 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a*b)/2 << '\n';
}
| 39 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int ab, bc, ca;
int main() {
cin >> ab >> bc >> ca;
int ans = ab * bc / 2;
cout << ans << endl;
}
| 78 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 197 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a>c)swap(a,c);
if (b>c)swap(b,c);
cout<<a*b/2<<endl;
} | 59 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
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 << "\n";
return 0;
} | 84 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<ll,ll>
#define PP pair<P,P>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
cout << (... | 117 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i = 0... | 124 |
Project_CodeNet | 2,019 | #include <iostream>
#include<string>
#include<math.h>
#include<vector>
#include<algorithm>
#include<array>
#include<functional>
#include<iomanip>
#include<ios>
using namespace std;
#define FOR(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef int value_type; /* ソートするキーの型 */
value_type med3(value_type x, value_type y, value_t... | 582 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
if (c > a && c > b) {
cout << (a * b / 2);
} else if (b > a && b > c) {
cout << (a * c / 2);
} else {
cout << (b * c / 2);
}
return 0;
}
| 114 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a*b*0.5 << endl;
} | 46 |
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>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 469 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>L(3);
for(int i=0;i<3;i++){
cin>>L.at(i);
}
sort(L.begin(),L.end());
cout<<L.at(0)*L.at(1)/2<<endl;
} | 66 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W,h;
cin >>H>>W>>h;
cout<<H*W*0.5<<endl;
}
| 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*C/max(max(A,B),C)/2<<endl;
}
| 44 |
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;
} | 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return 0;
} | 50 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << "\n";
}
| 41 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
using namespace std;
int inputValue(){
int a;... | 253 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
}
| 54 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
const long long INF = 1LL << 60;
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) {
... | 148 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a*b/2;
} | 31 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repe(i,n) for (int i = 0; i <= (n); ++i)
#define repe1(i,n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
#define eb(k,v) emplace_back(k,v)
using namespace std;
template<class T>bool chmax(T ... | 343 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, a, n) for(ll i=a; i<n; i++)
#define RREP(i, a, n) for(ll i=n-1; i>=a; i--)
typedef long long ll;
const ll mod =1e9+7;
const ll inf =1e18;
using namespace std;
ll a, b, c;
int main() {
cin>>a>>b>>c;
if(a*a+b*b==c*c){
cout<<a*b/2<<endl;
}
else if(a*a==c*c+... | 160 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << a * b / 2 << std::endl;
return 0;
}
| 52 |
Project_CodeNet | 2,019 | #include<cstdio>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", a*b/2);
return 0;
}
| 49 |
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;
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 a, b;
cin >> a >> b;
cout << a*b/2;
return 0;
}
| 38 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << (a*b)/2 << endl;
} | 35 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
template<typename T>
void print(T x) {
cout << x << endl;
}
int main(void) {
vector<int> vc(3);
cin >> vc[0] >> vc[1] >> vc[2];
sort(vc.begin(), vc.end());
cout << vc[0] * vc[1] / 2;
}
| 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;
}
| 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C; cin >> A >> B >> C;
int ans=A*B/2;
cout << ans;
} | 42 |
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 ld = long double;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T>... | 236 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(... | 221 |
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 a,b;
cin>>a>>b;
cout<<a*b/2<<endl;
return 0;
} | 38 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << "\n";
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 78 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> c >> a >> b;
cout << a * c / 2 << endl;
} | 40 |
Project_CodeNet | 2,019 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | 2,465 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void) {
int a;
int b;
int c;
int n=0;
cin >> a;
cin >> b;
cin >> c;
n = ((a*b) / 2);
cout << n;
return 0;
}
| 58 |
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 <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (int)ab*bc/2 << endl;
}
| 44 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a[3];
rep(i, 3){
cin >> a[i];
}
sort(a, a + 3);
cout << a[0] * a[1] / 2 << endl;
... | 133 |
Project_CodeNet | 2,019 | #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 <stdio.h>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <math.h>
#include <map>
using namespace std;
int a, b, c;
int main()
{
cin >> a >> b >> c;
cout << a * b / 2;
return 0;
}
| 78 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main()
{
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << (a * b / 2) << endl;
} | 82 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
int main()
{
int A,B,C;
cin>>A>>B>>C;
cout<<A*B/2<<endl;
}
| 114 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void){
int ab,bc,ca,area;
cin >> ab >> bc >> ca;
area = ab * bc / 2;
cout << area;
return 0;
} | 52 |
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;
}
| 41 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int a,b,c;
cin >> a >> b >> c;
int ans = a*b/2;
cout << ans <<endl;
return 0;
}
| 104 |
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;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | 56 |
Project_CodeNet | 2,019 | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define endl '\n'
#define elif else if
#define lli long long int
#define ld long double
#define vec vector
#define forn(a) for(lli a=0; a<n; a++)
#define all(x) x.begin(), x.end()
#define presicion(x... | 156 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;int main(){int a,b,c;cin>>a>>b;cout<<a*b/2;} | 31 |
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>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 65 |
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<bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b>>c;
cout<<(a*b)*.5<<endl;
return 0;
}
| 47 |
Project_CodeNet | 2,019 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;//角Bが90度
int ans =a*b/2;
cout<<ans<<endl;
}
| 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
//create arrays outside of main()
int a[5];
int main(){
int a,b,c;
cin >> a >> b >>c;
cout << 0.5*a*b;
return 0;
} | 57 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int AB,BC,CA;
cin >> AB >> BC >> CA;
cout << (AB * BC * 0.5f) << endl;
return 0;
}
| 52 |
Project_CodeNet | 2,019 | #include<iostream>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define EACH(x,a) for(auto& (x):(a))
#define ALL(obj) (obj).begin(),(obj).end()
#define Yes(n) cout<<((n)?"Yes":"No")<<endl;
using namespace std;
using ll=long long;
const int INF=1e9;
const ll LINF=1e18;
int gcd(int a,int b){ret... | 155 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string>
#include <iostream>
#include <iomanip>
#include <map>
#include <algorithm>
#include <vector>
#include <math.h>
#define MOD 1000000007
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << (a*b)/2 << endl;
return 0;
}
| 82 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
| 46 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typena... | 436 |
Project_CodeNet | 2,019 | #include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++... | 288 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> t(3);
for (int i = 0; i < 3; i++) cin >> t[i];
sort(t.begin(), t.end());
cout << t[0] * t[1] / 2 << endl;
return 0;
} | 81 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int a,b,c,area;
cin>>a>>b>>c;
area=.5*a*b;
cout<<area<<endl;
}
| 52 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(void)
{
ll a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2;
return 0;
}
| 37 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int x, y, z;
cin >> x >> y >> z;
int total = x * y / 2;
cout << total << endl;
}
| 54 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void)
{
int ab, bc, ca;
int s1, s2, s3;
scanf("%d %d %d", &ab, &bc, &ca);
s1 = ab * bc / 2;
s2 = ab * ca / 2;
s3 = bc * ca / 2;
int min = s1;
if (s2 < min) min = s2;
if (s3 < min) min = s3;
printf("%d\n", min);
return 0;
} | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main()
{
vector<int> l(3);
rep(i, 3) cin >> l[i];
cout << l[0] * l[1]/2 << endl;
}
| 77 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n[3];
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n[0] >> n[1] >> n[2];
sort(n, n + 3);
cout << (n[0] * n[1]) / 2 << "\n";
return 0;
}
| 89 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
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 <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <limits.h>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
#include <random>
#include <fstream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pi 3.14159265358979323846
using namespace ... | 166 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a,b,c;cin>>a>>b>>c;
cout<<a*b/2<<endl;
return 0;
}
| 70 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream> //入出力
#include <stdio.h>
#include <map>
#include <string>
#include <math.h>
#include <vector>
#include <cstdlib>
#include <queue>
#include <stack>
#include <list>
#include <iomanip> //小数点以下を表示させる(setprecision())
//#include <bits/stdc++.h>
using namespace std;
typedef long long l... | 242 |
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;
cout << (int)(sqrt(s * (s - 2 * a) * (s - 2 * b) * (s - 2 * c)) / 4);
return 0;
} | 87 |
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,020 | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
cout << a * b / 2;
} | 38 |
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;
} | 67 |
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;
return 0;
}
| 71 |
Project_CodeNet | 2,020 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
#include <string>
#include <string_view>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>... | 719 |
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;
} | 43 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
ll c... | 157 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int X, Y;
cin >> X >> Y;
int ans = (X * Y) / 2;
cout << ans << endl;
} | 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << bc * ab / 2 << endl;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) for (long long i = (long long)(a); i < (long long)(b); i++)
#define drep(i, n) for (long long i = n - 1; i > 0; i--)
#define pb push_back... | 1,465 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ITR(x,c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector<ll>
#defi... | 217 |
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;
} | 46 |
Project_CodeNet | 2,019 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>... | 5,153 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int AB;
int BC;
int CA;
cin >> AB;
cin >> BC;
cin >> CA;
cout << AB*BC/2;
return 0;
}
| 50 |
Project_CodeNet | 2,019 | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int a, b, c;
float s, t;
int u;
cin >> a >> b >> c;
s = (a + b + c)/2;
t = s * (s-a) * (s-b) * (s-c);
u = sqrt(t);
cout << u;
return 0;
}
| 83 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.