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>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
//typedef pair<ll, ll> P;
//const double INF = 1e10;
const ll INF = 10e10;
const ll MINF = -10e10;
//const int INF = INT_MAX;
#define ... | 175 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
#define mp make_pair... | 162 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define vvec(m,n) vector<vector<int>> (int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main(){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
} | 105 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int ab; //辺AB
int bc; //辺BC
int ca; //辺cb
int s; // 面積
cin >> ab >> bc >> ca; //各辺の値の入力
s = ((ab * bc) / 2); //面積を求める
cout << s << '\n'; //面積を表示
} | 108 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
#include<numeric>
#include<vector>
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 <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
cout << a[0] * a[1] * 0.5 << endl;
return 0... | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2.0 << endl;
return 0;
} | 83 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c;
d = b * a / 2;
cout << d << endl;
}
| 59 |
Project_CodeNet | 2,019 | #include<iostream>
main(){int a,b;std::cin>>a>>b;std::cout<<a*b/2;} | 26 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(... | 330 |
Project_CodeNet | 2,020 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,... | 1,504 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int a,b,c ;
cin>>a>>b>>c ;
priority_queue<int,vector<int>,greater<int>> q ;
q.push(a) ;
q.push(b) ;
q.push(c) ;
int prod=1 ;
for(int i=0;i<2;i++){
... | 156 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int a, b, c;
scanf("%d %d %d", &c, &a, &b);
int m = max(a, max(... | 117 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
}
| 37 |
Project_CodeNet | 2,020 | #include<iostream>
int main(){
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << (bc * ab) / 2 << std::endl;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll mod(ll a) {
if (a > 0) return a % MOD;
if (a % MOD == 0) return 0;
ll x = -a / MOD +... | 270 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int a[5];
for(int i=0;i<3;i++)
cin>>a[i];
sort(a,a+3);
int ans=(a[0]*a[1])/2;
cout<<ans;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include <iostream>
# include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int a,b,c;
cin >> a >> b >> c;
int ans = a*b/2;
cout << ans << endl;
}
| 58 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<utility>
#include<stack>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#define yOUT PRI... | 166 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<set>
#include<string>
#include<cstring>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | 52 |
Project_CodeNet | 2,020 | #include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
cin>>a>>b>>c;
if(a>b && a>c){
a=(c*b)/2;
cout<<a;
}
if(b>a && b>c){
b=(a*c)/2;
cout<<b;
}
if(c>a && c>b){
c=(a*b)/2;
cout<<c;
... | 111 |
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;
#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;
typedef long long i64;
typedef pair<int, int> pi;
template <class T> using vt = vector<T>;
template <c... | 247 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int b[100000];
signed main(){
int a,b,c,d;
cin>>a>>b>>c;
cout<<a*b/2<<"\n";
return(0);
} | 54 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define dup(x,y) (((x)+(y)-1)/(y)) // dup * y >= x なる最小のdup.
using namespace std;
typed... | 138 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 128 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int a[4];
int main() {
scanf("%d%d%d", &a[1], &a[2], &a[3]);
sort(a + 1, a + 3 + 1);
printf("%d\n", a[1] * a[2] / 2);
}
| 82 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 75 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
void Main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2;
}
int main(void)
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
//std::cout << std::fixed << std::setprecision(10);
#ifdef DEBUG_BUILD
while (true)
{
... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#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++)
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b / 2) << endl;
return 0;
} | 104 |
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 <iostream>
#include <cmath>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int O, s, U, P;
O = a+b+c;
s = O/2;
U = s*(s-a)*(s-b)*(s-c);
P = sqrt(U);
cout << P;
} | 75 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
// GNU C Compiler
//template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
//using pa... | 364 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn for(int i=0;i<n;i++)
int main()
{
int a,b,c;
cin>>a>>b>>c;
int p=(a+b+c)/2;
cout<<sqrt(p*(p-a)*(p-b)*(p-c));
return 0;
} | 80 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void){
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
} | 40 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
int main(){
int a1,a2,a3;
... | 105 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int a, b, c;
int main(){
scanf("%d %d %d", &a, &b, &c);
int area = a*b/2;
printf("%d", area);
return 0;
}
| 56 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define FOR(i, start, end) for(int i = (start); i < (end); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typ... | 230 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int ab,bc,ca;cin>>ab>>bc>>ca;
cout<<ab*bc/2<<endl;
return 0;
} | 95 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <cstdint>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
#include <functional>
#include <cassert>
using namespace std;
type... | 324 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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;
if(a*a+c*c==b*b)
cout<<a*c/2<<endl;
if(b*b+c*c==a*a)
cout<<b*c/2<<endl;
return 0;
} | 89 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#def... | 203 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <math.h>
#include <queue>
#include <stack>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
int m=max({a,b,c});
int ans=(a*b*c)/m/2;
cout<<ans;
return 0;
} | 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <cassert>
#include <deque>
using namespace std;
#define int64_t long long
constexpr int64_t MOD=1e9+7;
int main() ... | 115 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<numeric>
#include<list>
#include<stack>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
typedef signed short Hitoketa;
class MYCP {
public:
... | 1,952 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&... | 904 |
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;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 48 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main (){
int t,x;
cin >> t >> x;
cout <<t*x/2 <<endl;
}
| 37 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int data[3];
for(int i=0;i<3;i++){
cin >> data[i];
}
sort(data,data+3);
cout << data[0] * data[1] /2 <<endl;
} | 63 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll ab,bc,ca;cin>>ab>>bc>>ca;
const ll ans=ab*bc/2;
prin... | 117 |
Project_CodeNet | 2,019 | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | 96 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x ... | 216 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll inf = 1LL << 55;
ll mod = 1000000007;
using namespace std;
int main(){
FAST;
//freopen("in.in", "r", stdin);
int ab, bc, ac; cin >> ab >> bc >> ac;
... | 116 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >>A>>B;
cout<< A*B*0.5;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a,b,c;
int main(){
scanf("%d %d %d",&a,&b,&c);
printf("%d",a*b/2);
}
| 50 |
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;
int maxn = max(a, max(b, c));
int ans = 1;
if(a != maxn)ans *= a;
if(b != maxn)ans *= b;
if(c != maxn)ans *= c;
cout << ans/2 << endl;
return 0;
} | 96 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define PDD pair<double, double>
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9)
#define INFLL... | 415 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v(3);
for(int i=0;i<3;i++){
cin >> v.at(i);
}
sort(v.begin(),v.end());
cout << v.at(0)*v.at(1)/2 << endl;
return 0;
}
| 73 |
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;
} | 41 |
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<map>
#include<numeric>
#include<set>
#include<string>
#include<utility>
#include<vector>
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define rep(i, a, n) for(int i=a; i<n; i++)
#define per(i, a, n) for(int i=n-1... | 183 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#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 all(s) s.begin(), s.end()
using namespace std;
typedef long long i... | 246 |
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;
} | 41 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 437 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int c, a, b, ans;
cin >> c >> a >> b;
ans = c * a / 2;
cout << ans << endl;
}
| 48 |
Project_CodeNet | 2,019 | #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++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int a, b, c;
cin >> a >> b >> c;
cout <<... | 125 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(b*b+c*c==a*a)
cout<<b*c/2;
if(a*a+c*c==b*b)
cout<<a*c/2;
if(b*b+a*a==c*c)
cout<<a*b/2;
return 0;
}
| 77 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void) {
int ab, bc;
cin >> ab >> bc;
cout << ab * bc / 2 << endl;
return 0;
}
| 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii v... | 305 |
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,019 | #include<iostream>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
//min(a,b)...a,bの小さいほう
//max(a,b)... 大きいほう
int a;
int b;
int c;
int d;
int e;
std::cin >> a >> b >> c;
cout << a * b / 2 << "\n";
std::cin >> e;
} | 92 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(c>a&&c>b) cout << (a*b/2) << endl;
if(b>a&&b>c) cout << (a*c/2) << endl;
if(a>b&&a>c) cout << (c*b/2) << endl;
return 0;
}
| 84 |
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++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | 229 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for(int i=0; i<sz(v); ++i)
#define lp(i, n) for(int i=0; i<(int)(n); ++i)
#define lpi(i, j, n) for(int i=(j); i<(int)(n); ++i)
#define lpd(i, j, n... | 221 |
Project_CodeNet | 2,019 | /**
* File : a.cpp
* Author : recurze
* Date : 23:55 20.01.2019
* Last Modified Date: 23:55 20.01.2019
*/
#include <cstdio>
void readInput();
void solve();
void printAns();
int main() {
int t = 1;
//(void)scanf("%d", &t);
for (int tc = 1; tc <= t; ++tc) {
... | 236 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (... | 537 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
int a, b, c, n;
string s;
int main()
{
cin>>a>>b>>c;
cout<<... | 103 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <numeric>
#include <cmath>
#include<algorithm>
using namespace std;
//ユーティリティ
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rep(i,n) for(int i=0; i<n; i++)
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all... | 1,189 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> A(3, 0); cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
printf("%d\n", (A[0] * A[1]) / 2);
} | 77 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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 long long INF = 1LL << 60;
typ... | 477 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
}
| 77 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int a[3];
int main(){
for (int i = 0; i < 3; ++i) cin >> a[i];
sort(a, a+3);
cout << a[0]*a[1]/2;
} | 61 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define INF LLONG_MAX/3
#define eps LDBL_EPSILON
#define moder 100000
#define pie 3.141592653589793238462643383279
#define P std::pair<int,int>
#define prique priority_queue
using namespace std;
signed main(){
int... | 123 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int AB, BC, CA;
std::cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
} | 46 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a*b/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;
} | 52 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int c, a, b;
cin >> c >> a >> b;
int s = (c + a + b) / 2.0;
cout << pow(s * (s - a) * (s - b) * (s - c), 0.5) << endl;
} | 82 |
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,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 | /*
Templatka c++ Kacper Fis //
*/
#include <bits/stdc++.h>
using namespace std;
... | 544 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, ... | 387 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <vector>
#include <cmath>
#include <tuple>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc / 2) << "\n";... | 90 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
vector<int> vec(3);
for (int i = 0; i < 3; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << (vec[0] * vec[1]) / 2 << '\n';
return 0;
} | 92 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
z = x * y / 2;
cout << z << endl;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <vector>
#include <list>
#include <map>
#include <set>//2分探索木
#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 <cstdlib>
#i... | 2,026 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int a,b;
cin >> a >> b;
cout << a * b / 2 << endl;
return 0;
} | 95 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2;
} | 35 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <climits> // FOO_MAX, FOO_MIN
#include <cmath>
#include <cstdlib> // abs(int)
#include <numeric>
#include <iomanip>
#include <map>
using namespace std;
#define roundup(n,d) ( ((n) + ((d)-1)) / (d) )
#define assign_max(into, compare... | 242 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.