Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
int main() {
vector<int> l(3, 0);
cin >> l[0] >> l[1] >> l[2];
sort(l.begin(), l.end());
int S = l[0] * l[1] / 2;
cout << S << endl;
return 0;
}
| 92 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int ab, bc, ca;
cin >> ab >> bc >> ca;
float s = (ab + bc + ca) / 2;
int result = sqrt(s * (s - ab) * (s - bc) * (s - ca));
cout << result << endl;
} | 79 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main()
{
int x, y, z;
cin >> x >> y >> z;
cout << x * y / 2;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {int a,b;cin>>a>>b;cout<<a*b*0.5<<endl;} | 36 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<math.h>
int main()
{
long long int a,b,c,sum;
scanf("%lld%lld%lld",&a,&b,&c);
sum=(a*b)/2;
printf("%lld",sum);
return 0;
}
| 58 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | 357 |
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;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
}
| 48 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef ... | 510 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define temp template<typename T>
#define debug(... | 494 |
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 ans;
vector<int> line(3);
rep(i, 3) cin >> line.at(i);
sort(line.begin(), line.end());
ans = line.at(0) * line.at(1) / 2;
cout << ans << endl;
} | 93 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define N_MAX 100
int main() {
long ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
return 0;
}
| 56 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 42 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
int main() {
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
cout << (a[0] * a[1]) / 2 << endl;
return 0;
} | 113 |
Project_CodeNet | 2,019 | #include <string>
#include <iostream>
using namespace std;
int main(){
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2;
} | 40 |
Project_CodeNet | 2,019 | # include<iostream>
using namespace std;
int main (){
int a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2;
} | 33 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m, l;
cin >> n >> m >> l;
cout << n*m/2 << endl;
}
| 68 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[3],b[2],ans=0;
int d;
char s[100];
for(int i=0;i<3;i++)
cin>>a[i];
d=0;
for(int i=0;i<3;i++)
{
if(a[i]>a[d])
d=i;
}
int cnt=0;
for(int i=0;i<3;i++)
{
if(i!=d)
... | 150 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
using namespace std;
int main(){
int ab,bc,ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) /2 << endl;
} | 43 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int AB, BC, CA, ABC;
scanf("%d", &AB); scanf("%d", &BC); scanf("%d", &CA);
ABC = (AB * BC) / 2;
printf("%d", ABC);
return 0;
} | 62 |
Project_CodeNet | 2,019 | #include"bits/stdc++.h"
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF 1e+9
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
return 0;
} | 66 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
return 0;
} | 47 |
Project_CodeNet | 2,020 | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | 840 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int a,b,c;
cin>>a>>b>>c;
if(a>=b,a>=c){
cout<<b*c/2<<endl;
}
else if(b>=a,b>=c){
cout<<a*c/2<<endl;
}
else if(c>=a,c>=b){
cout<<a*b/2<<endl;
}
}
| 99 |
Project_CodeNet | 2,019 | #include <cstdio>
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", a * b / 2);
} | 45 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll a, b, c... | 186 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> s(3);
for (int i = 0; i < 3; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
cout << (s[0] * s[1]) / 2 << endl;
} | 76 |
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,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
using namespace std;
int main()
{
int ans, n,m,a;
cin >> n >> m >> a;
cout << n*m/2 << endl;
} | 65 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int l, m, n;
scanf("%d%d%d", &l, &m, &n);
printf("%d\n", (l * m) / 2);
return 0;
}
| 63 |
Project_CodeNet | 2,019 | #include<cstdio>
int main()
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d",(a*b)/2);
return 0;
}
| 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | 1,649 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define repd(i,a,b) for (int i=(a);i<(b);i++)
typedef long long ll;
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<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#... | 189 |
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;
}
| 40 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
}
| 53 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes... | 304 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| 63 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <map>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a * b) / 2 << std::endl;
return 0;
} | 73 |
Project_CodeNet | 2,019 | // Right Triangle
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <ios>
#include <iomanip>
#include <string>
#include <numeric>
using namespace std;
int main() {
int a, b ,c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 79 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<functional>
#include<cstring>
using namespace std;
int main(){
double a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2;
return 0;
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int c, a, b, p;
cin >> c >> a >> b;
if (a > b && a > c) p = b * c;
else if (b > c) p = c * a;
else p = a * b;
cout << p / 2 << '\n';
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;
return 0;
}
| 46 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 42 |
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;
} | 72 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c,a;
cin >> c >> a;
cout << c*a/2 << endl;
}
| 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", a * b / 2);
return 0;
}
| 59 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << "\n";
return 0;
}
| 61 |
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/2;
if(a*a + b*b == c*c)
cout<< S <<endl;
else
cout<<"error"<<endl;
} | 70 |
Project_CodeNet | 2,019 | #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;
} | 69 |
Project_CodeNet | 2,019 | // Nitish Chandra
// codeforces : msnitiz
#include <bits/stdc++.h>
using namespace std;
int main(){
int ab, bc, ca;
cin >> ab >> bc;
cout << (ab*bc)/2 << endl;
} | 59 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <stack> // s.top()
#include <bitset>
#include <queue> // s.front()
using namespace std;
typedef long long Int;
typedef pair<Int,Int> P;
#define print(x) cout<<(x)<<endl... | 142 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
}
| 53 |
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 | // AtCoder Beginner Contest 116 - Problem A: Right Triangle (https://atcoder.jp/contests/abc116/tasks/abc116_a)
#include <bits/stdc++.h>
using namespace std;
void solve(int B, int H)
{
auto ans = (B * H)/2;
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
int B, H, X;
cin >> B >... | 111 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 50 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << bc*ab/2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fast_io() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265
#define MOD 1000000007
#define PSET(x,y) fixed<<setprecision(y)<<x
#define ll long long
#define ld long double
#define lop(i,a,b) for(ll i=a;i<b;i++)
#define lopr(i,a,b) for(ll i=a;i>=b;i--)
#define m... | 219 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | 234 |
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;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) ... | 255 |
Project_CodeNet | 2,019 | #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <ctype.h>
#include <vector>
#include <numeric>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#def... | 307 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (... | 891 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=n-1; i>=m; i--)
#define all(x) (x).begin(),(x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#defi... | 689 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c*c == a*a + b*b){
int S = a*b/2;
cout << S << endl;
}
if(b*b == a*a + c*c){
int S = a*c/2;
cout << S << endl;
}
if(a*a == b*b + c*c){
int S = b*c/2;
cout << S << endl;
... | 122 |
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<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int AB,BC,CA;
cin >> AB >> BC >> CA;
int ans = AB*BC/2;
cout << ans << endl;
return 0;
}
| 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;
}
| 79 |
Project_CodeNet | 2,020 | //Moh_K_Imar .......
//29/08/2020 ... 5,30.
//Ya Rab....
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ld a,b,c;
cin>>a>>b>>c;
cout<<(0.5*b)*a<<endl;
return 0;
}
| 85 |
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;
} | 48 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 84 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 101
#define maxh 1001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const int dx[4] = {0, 1, -1, 0}, dy[4] = {1, 0, 0, -1};
typedef std::pair<int, int> P;
template<typename A, si... | 597 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector <int> A(3);
cin >>A[0]>>A[1]>>A[2];
sort(A.begin(),A.end());
int ans=A[0]*A[1]/2;
cout <<ans;
} | 72 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <bits/stdc++.h>
using n... | 238 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int ab,bc;
cin>>ab>>bc;
cout<<ab*bc/2.0<<endl;
} | 83 |
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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
#define MOD 1000000007
const long long mod = 1e9+7;
typedef vector... | 223 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int ab, bc, ca; cin >> ab >> bc >> ca;
cout << bc * ab / 2 << endl;
return 0;
} | 42 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include<algorithm>
#include <string>
#include <cmath>
#include<queue>
#define PI 3.141592653589793238
#define INF -1
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
printf("%d", a * b / 2);
return 0;
} | 79 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void)
{
int A, B, C, n;
scanf("%d %d %d", &A, &B, &C);
n = A * B / 2;
printf("%d", n);
return 0;
} | 61 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | 238 |
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;
return 0;
}
| 54 |
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;
}
| 45 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
vector<int> v(3);
for(auto &it:v)
cin >> it;
sort(v.begin(),v.end());
cout << 0.5*v[0]*v[1] << '\n';
return 0;
} | 92 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B;
cout << A*B/2 << endl;
} | 39 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> c >> a >> b;
cout << c*a/2 << "\n";
}
| 44 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int ab, bc;
cin >> ab >> bc;
cout << ab * bc / 2 << endl;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << (a*b/2) << endl;
return 0;
}
| 64 |
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 ans = sqrt(s * (s - a) * (s - b) * (s - c));
cout << ans << endl;
return 0;
} | 85 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
int S = AB*BC/2;
cout << S << endl;
} | 50 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define MAX 100000
int main(){
int x,y,z;
cin>>x>>y>>z;
cout<<x*y/2<<endl;
return 0;
}
| 50 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << '\n';
return 0;
} | 60 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, ... | 487 |
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;
return 0;
} | 81 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
... | 241 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 2,116 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf... | 144 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi= vector<int>;
using vvi= vector<vi>;
using vd= vector<double>;
using vvd= vector<vd>;
using vc= vector<char>;
using vb= vector<bool>;
#define rep(i,x,n) for(int i=x; i<n; i++)
#define all(x) x.begin(), x.end()
int main(){
int ab, bc ,ca;
... | 113 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
... | 821 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | 198 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int a,c,b;
cin >> c >> a >> b;
int ans = a*c/2;
cout... | 110 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.