Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define Coming ios_base :: sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define mod 1000000007
int main()
{
Coming
int a,b,c;
cin >> a>> b >>c;
int s = (a+b+c) / 2;
int ans = sqrt(s*(... | 117 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/abc116/tasks/abc116_a
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
... | 115 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
return 0;
}
| 49 |
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;
int main()
{
int a,b,c;
cin >> a >> b >> c;
int ans=a*b/2;
cout << ans << endl;
}
| 45 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
//cin.sync_with_stdio(false);
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define FOR_EQ(i,a,b) for(int i = (a); i <= (b); ++i)
#define FOR_RE(i,a,b) for(int i = (a); i > (b); --i)
#define rep(i,n) FOR(i,0,n)
#define rep_eq(i,n) FOR_EQ(i,0,n)
#de... | 546 |
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 argc, char* argv[])
{
int ab,bc,ca;
cin>>ab>>bc>>ca;
cout<<ab*bc/2<<endl;
return 0;
} | 48 |
Project_CodeNet | 2,020 | #include <iostream>
#include<string.h>
#include<algorithm>
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;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 44 |
Project_CodeNet | 2,019 | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <numeric>
#include <iomanip>
#... | 572 |
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 << endl;
return 0;
}
| 51 |
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 <bits/stdc++.h>
using namespace std;
int main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << endl;
} | 48 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <cmath>
#include <tuple>
#include <bitset>
#include <utility>
#define push emplace_back
#define each(i, x) for (auto i=0; i < x; i++)
using ull = un... | 257 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define 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;
} | 89 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
return 0;
}
| 98 |
Project_CodeNet | 2,019 | #include <cstdio>
int main() {
int a,b;
scanf("%d %d", &a, &b);
printf("%d\n",a*b/2);
return 0;
} | 43 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 2019;
int main(){
ll A, B, _; cin >> A >> B >> _;
cout << (A*B)/2 << endl;
}
| 55 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
double a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 49 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> tri(3);
for(int i = 0;i< 3;i++){
int a;
cin >> a;
tri.at(i) = a;
}
sort(tri.begin(), tri.end());
cout << (tri.at(0)*tri.at(1))/2 << endl;
} | 81 |
Project_CodeNet | 2,019 | #include<algorithm>
#include<cstdio>
#include<cmath>
int main() {
int s,a,b,c;
scanf("%d%d%d",&a,&b,&c);
s=(a+b+c)/2;
printf("%d",(int)(sqrt(s*(s-a)*(s-b)*(s-c))));
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t,a,b,c;
t = 1;
while(t--) {
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
}
return 0;
}
| 78 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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,020 | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a*... | 129 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
// DEEP
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long lon... | 641 |
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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(void){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 54 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <math.h>
#include <array>
#include <list>
#include <set>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef tuple<ll,int,int> tup;
ty... | 170 |
Project_CodeNet | 2,019 | //#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007LL
#define INF (1LL<<60LL)
typedef long long ll;
using namespace std;
int main() {
vector<ll> v(3);
rep(i, 3) cin >> v[i];
sort(all(v));
cout << v[0]... | 121 |
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;
cout << a*b/2 << endl;
} | 40 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 577 |
Project_CodeNet | 2,019 | #include <vector>
#include <iostream>
#include <algorithm>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef un... | 187 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
}
| 42 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int s[3];
for (int i=0; i<3; i++) cin >> s[i];
sort(s,s+3);
int S = s[0]*s[1]/2;
cout << S << endl;
} | 68 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define EPS (1e-20)
#define MOD (int)(1e9+7)
#define yn(f) ((f)?"Yes":"No")
#define YN(f) (... | 158 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
usi... | 144 |
Project_CodeNet | 2,020 | #include <stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d", a*b/2);
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
cout << a*b/2 << endl;
return 0;
} | 48 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int side[3] = {0};
rep (i, 3){
cin >> side[i];
} // end rep
sort(side, side+3);
in... | 133 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
int AB,BC,CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <queue>
#include <stack>
#include <string.h>
#include <list>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define rall(a) (... | 270 |
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 ;
} | 48 |
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;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = min(a * b, min(a * c, b * c)) / 2;
cout << ans << endl;
} | 100 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int A, B, _; cin >> A >> B >> _;
cout << A * B / 2 << endl;
}
| 41 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int ab, bc, ca;
int main(){
cin>> ab >> bc >> ca;
cout<< ab*bc/2;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n = 3;
vector<int> arr(n);
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
sort(arr.begin(), arr.end());
cout << (arr[1] * arr[0]) / 2 << endl;
} | 82 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int AB;
int BC;
int CA;
cin >> AB;
cin >> BC;
cin >> CA;
cout << AB * BC * 0.5 << endl;
}
| 63 |
Project_CodeNet | 2,020 | long long A,B,C,D,E,F, I,J,K, M,N,O,Q,R,S,T,U,V, X,Y,Z;
//long long A,B,C,D,E,F, H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z;
double dA,dB,dC,dD,dE,dF, dI,dJ,dK, dM,dN,dO,dP,dQ,dR,dS,dT,dU,dV, dX,dY,dZ;
#include <string>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <iostream>
#inclu... | 3,442 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(... | 163 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll MAXN = 1e5+200;
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))<<endl;
return 0;
}
| 87 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
int max = a>b?a:b;
max=max>c?max:c;
int area = a*b*c/(2*max);
printf("%d",area);
} | 72 |
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;
} | 51 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
double s = (a+b+c)/2;
double v = sqrt(s*(s-a)*(s-b)*(s-c));
cout << v << endl;
return 0;
} | 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
double A, B, C;
cin >> A >> B >> C;
cout << (A * B) / 2 << endl;
return 0;
}
| 48 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 38 |
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,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| 72 |
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;
} | 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;
} | 38 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void)
{
int a, b, c;
int ans;
cin >> a >> b >> c;
if (a > b && a > c) ans = b * c / 2;
else if (b > a && b > c) ans = a * c / 2;
else ans = a * b / 2;
cout << ans << endl;
return 0;
} | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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){a = b;return true;}... | 156 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1LL << 32;
const ll INF = 1e18+7;
signed main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 72 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | 45 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
int main(void)
{
int a , b , c;
cin >> a >> b >> c;
... | 130 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
typedef long long ll;
const ll LL_MAX (1LL<<60);
#define rep(i,s,e) for(ll i=(s); i<(e); i++)
using namespace std;
int ... | 156 |
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;
} | 42 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#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<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main(){
ll a,b; cin >> a >> b; cout << a*b/2 << endl;
} | 98 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main()
{
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
}
| 46 |
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 <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::multiprecision;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define all(v) v.begin(),v.end()
... | 1,378 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n) int(n);cin >> (n)
#define LCIN(n) LL(n);cin >> (n)
#define SCIN(n) string(n);cin >> (n)
#define YES(n) cout<<((n... | 502 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
using namespace std;
using ll = long long;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", a * b / 2);
} | 60 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
typedef long long ll;
int main() {
int a,b,c;cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
}
| 97 |
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;
} | 38 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void){
int a, b, c;
cin >> a >> b >> c;
int res = a * b / 2;
cout << res << endl;
return 0;
} | 71 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using vs=vector<string>;
#de... | 637 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 254 |
Project_CodeNet | 2,020 | /**
* created: 23.05.2020 12:58:10
**/
#include <bits/stdc++.h>
#define int long long
#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;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
vector<int> l(3);
... | 161 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <map>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 68 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;++i)
#include<string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; };
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; };
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * b / 2;
cout << ans << endl;
} | 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << x*y/2 << endl;
}
| 46 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 <<endl;
} | 38 |
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;
} | 43 |
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>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <iomanip>
using namespace std;
#define int long long
#define pie 3.141592653589793238462643383279
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x%y);
}
int lcm(int x, int y) {
return x / gcd(x, y)*y;
... | 157 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB,BC,CA;
cin >> AB >> BC >> CA;
cout << AB * BC * 0.5 << endl;
}
| 48 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#d... | 276 |
Project_CodeNet | 2,020 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 482 |
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",a*b/2);
return 0;
} | 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD =1e9+7;
using ll=long long;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 82 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int x,y,z;
cin >> x >> y >> z;
cout << (x*y)/2 << endl;
return 0;
} | 51 |
Project_CodeNet | 2,019 | #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>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 148 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1LL << 60;
int main()
{
int a,b,c,ans;
cin >> a >> b >> c;
ans = a*b/2;
cout << ans << endl;
return 0;
}
| 91 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... | 154 |
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;
}
| 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define endl '\n';
typedef long long ll;
using namespace std;
const string YES = "";
const string NO = "";
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| 87 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.