Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b,c;
int m;
cin>>a>>b>>c;
m=(a*b)/2;
cout<<m<<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;
cout<<(a*b)/2<<endl;
} | 41 |
Project_CodeNet | 2,020 | //Radhe Radhe
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,j,a,b,c;
cin>>a>>b>>c;
cout<<(a*b)/2<<endl;
return 0;
}
| 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b,c; cin >> a >> b >> c;
int ans = a*b/2;
cout << ans << endl;
return 0;
}
| 101 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <list>
#include <set>
using namespace std;
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
int one[64];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C... | 104 |
Project_CodeNet | 2,019 | #include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <... | 350 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
/*input*/
int ab, bc, ca; cin >> ab >> bc >> ca;
/*output*/
cout << ab*bc/2 << endl;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
int main()
{
int ab, bc, ca, max;
std::cin >> ab >> bc >> ca;
max = std::max(std::max(ab, bc), ca);
if(max == ab){
std::cout << bc * ca / 2;
return 0;
}
else if(max == bc){
std::cout << ab * ca / 2 ;
return 0;
}
... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h> // imports every library in c++
using namespace std; // ; is essential | says that you are USING the libraries
// PRACTICE //
int AB, BC, CA;
int main() {
cin >> AB;
cin >> BC;
cin >> CA;
if (AB >= BC and AB >= CA) {
cout << BC * CA / 2;
} else if (BC >= AB and B... | 143 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
for(int i = 1; i <= 3; i++) cin >> a[i];
sort(a + 1, a + 4);
int ans = a[1] * a[2] / 2.0;
cout << ans << endl;
} | 75 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(void){
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(){
ios::sync_with_stdio(false);
cin.tie(0);
double a,b,c; cin >> a >> b >> c;
double s = (a+b+c)/2.0;
cout << sqrt(s*(s-a)*(s-b)*(s-c));
return 0;
} | 76 |
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;
}
}
| 54 |
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 <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <queue>
using namespace std;
struct BoolName : numpunct<c... | 400 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> L(3);
cin >> L.at(0) >> L.at(1) >> L.at(2);
sort(L.begin(), L.end());
cout << L.at(0)*L.at(1) / 2;
} | 72 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define RREP(i,s,n) for(lli i=s;i>=0;i--)
#define MOD 1000000007
#define NUM 2520
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#defin... | 139 |
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;
cout << s << endl;
}
| 46 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
}
| 34 |
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;
} | 49 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
double AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 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;
int x=max(a,max(b,c));
cout << a*b*c/x/2 << endl;
} | 51 |
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());
cout << a[0] * a[1] / 2 << endl;
return 0;
} | 77 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template<class T> bool INRANGE(T x,T a,T b) { return a<=x&&x<=b; }
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 (... | 306 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main(void)
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc) / 2 << endl;
return 0;
} | 96 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a*b/2<<endl;
} | 33 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int a[3];
int main(){
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
}
| 60 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (int i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,v) for (int i = 0; i < v.size(); i++)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v)... | 219 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
int main(int argc, char *argv[])
{
int a,b,c;
cin>>a>>b>>c;
int ans=a*b*c/(2*max(a,max(b,c)));
cout<<ans<<endl;
return 0;
} | 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;
}
| 43 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <ios>
#include <iomanip>
#include <stack>
#include <queue>
#include <algorithm>
#define REP(i, n) for(int i = 0;i < n;i++)
using namespace std;
const int INF = 100000000;
int main(){
vector<int> e = vector<int>(3);
REP(i,3){
cin >> e[i];
}
... | 122 |
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;
return 0;
}
| 44 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
cout << (c*a)/2 <<endl;
return 0;
} | 49 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int p=(a+b+c)/2;
int s=sqrt(p*(p-a)*(p-b)*(p-c));
cout<<s<<endl;
} | 58 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
void solveA(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
}
void solveB(){
int n,t,ci,ti;
cin >> n >> t;
int ans = 2000;
for(int i=0;i<n;i++){
cin >> ci >> ti;
if (ci<=ans && ti<=t) ans = ci;
}
if (ans==2000) cout << "TLE" << endl;
... | 149 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int area=a*b/2;
cout<<area<<endl;
}
| 46 |
Project_CodeNet | 2,019 | #include <iostream>
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<algorithm>
#include<string>
#include<functional>
using namespace std;
int main() {
int n = 0, m = 0, k = 0;
cin >> n >> m >> k;
cout << n*m / 2 << endl;
system("PAUSE");
} | 61 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<numeric>
#include<map>
#include<unordered_map>
#include<queue>
#include<deque>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();... | 133 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 1,070 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
int main()
{
std::vector<int> a(3);
std::cin >> a[0] >> a[1] >> a[2];
std::sort(a.begin(), a.end());
std::cout << a[0] * a[1] / 2 << std::endl;
return 0;
}
| 79 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
const int mod=1e9+7;
using LL=long long;
using std::cout;using std::endl;using std::cin;
using std::vector;using std::string;using std::set;using std::multiset;
using std::pair;using std::map;
using std::min;using... | 325 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <limits>
#include <sstream>
#include <fstream>
#include <climits>
#include <map>
#include <numeric>
#include <functional>
#include <utility>
using namespace std;
#define rep(i, n) for (int i = 0; ... | 130 |
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/2;
cout << s << endl;
} | 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rt return
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for... | 506 |
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>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 605 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<list>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#inclu... | 228 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<string>
#include<math.h>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<map>
#include<numeric>
#include<stack>
#include<queue>
#include<functional>
#include<cassert>
#include<set>
#define rep(a,b) for(int a=0;a<b;++a)
#define REP(a,b,c,d) for(int a=b;a<c;a+=... | 184 |
Project_CodeNet | 2,019 | #include <iostream>
int A, B, C;
int main() {
char str[100];
/* printf(">>"); */
fgets(str,100,stdin);
sscanf(str,"%d %d %d",&A,&B,&C);
printf("%d",A*B/2);
return 0;
}
| 68 |
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;
} | 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC;
cin >> AB >> BC;
cout << (AB * BC / 2) << endl;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <tuple>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a * b / 2) <<"\n";
}
| 84 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<vector>
using namespace std;
int i,j,k,h,w,a,b,c,d,x,y,z,ret;
int main(void){
cin>>a>>b>>c;
cout<<a*b*c/max({a,b,c})/2;
return 0;
} | 71 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int c,a,b;cin>>c>>a>>b;
cout<<c*a/2<<endl;
}
| 35 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std ;
int main(){
int a,b,c ;
cin >> a >> b >> c ;
cout << a*b*c/max(a,max(b,c))/2 << endl ;
} | 45 |
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 <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << a*b / 2 << endl;
//system("pause");
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
// #include <boost/dynamic_bitset.hpp>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <chrono>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set... | 769 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
signed main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
return(0);
}
| 46 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int ab, bc, ca; cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
return 0;
}
| 48 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << (a*b)/2 << endl;
}
| 76 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){... | 514 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
vector<long long> factors;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define _ <<'\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL... | 495 |
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;
}
| 49 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
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;
} | 101 |
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>
#include <stdio.h>
#include <cmath>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
//
// Created by karayuu on 2019-01-20.
//
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
} | 109 |
Project_CodeNet | 2,019 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 985 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tup... | 142 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#define numarr 12
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
ans = a * b / 2;
cout << ans << endl;
} | 72 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int m... | 213 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
int main()
{
double a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
return 0;
} | 57 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
#define rep(i, n) for(long long int (i) = 0; (i) < (int) (n); (i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define defin... | 211 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
// Failed to predict input format
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * a[1] / 2 << endl;
cerr << "Hello" << endl;
return 0;
} | 89 |
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 | /*
* a.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functio... | 131 |
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;
} | 43 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A,P;
cin >> A >> P;
cout << A*P/2 << endl;
}
| 39 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main(){
int AB , BC , CA , S;
cin >> AB >> BC >> CA;
S = AB * BC / 2;
cout << S <<endl;
} | 51 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab*bc/2 << endl;
return 0;
} | 77 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int a, b, c;
cin >> a >> b >> c;
cout... | 97 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int v[3] = {};
cin >> v[0];
cin >> v[1];
cin >> v[2];
sort(v, v + 2);
int ans = v[0] * v[1] / 2;
cout << ans << endl;
return 0;
}
| 104 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(){
vector<int> p;
for(int i = 0; i < 3; i++)
{
int tmp;
cin >> tmp;
p.push_back(tmp);
}
sort(p.begin(), p.end());
cout << p[0]*p[1]/2 << endl;
} | 88 |
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;
int main(){
int a,b,c; cin>>a>>b>>c;
cout << a*b/2 << endl;
} | 61 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
int main()
{
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a * b / 2);
return 0;
} | 44 |
Project_CodeNet | 2,020 | /*
▓█████▄ ▄████▄ ▓██ ██▓ ██▓███ ██░ ██ ▓█████ ██▀███
▒██▀ ██▌▒██▀ ▀█ ▒██ ██▒▓██░ ██▒▓██░ ██▒▓█ ▀ ▓██ ▒ ██▒
░██ █▌▒▓█ ▄ ▒██ ██░▓██░ ██▓▒▒██▀▀██░▒███ ▓██ ░▄█ ▒
░▓█▄ ▌▒▓▓▄ ▄██▒ ░ ▐██▓░▒██▄█▓▒ ▒░▓█ ░██ ▒▓█ ▄ ▒██▀▀█▄
░▒████▓ ▒ ▓███▀ ░ ░ ██▒▓░▒██▒ ░ ░░▓█▒░██▓░▒████▒░██▓ ▒██▒
▒▒▓ ▒ ░ ░▒ ▒ ... | 856 |
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<iostream>
#include<vector>
#include<algorithm>
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;
} | 68 |
Project_CodeNet | 2,019 | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using... | 626 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <vector>
/*@@@@@@@@@@@@@@@@@@@@O:8:O@... | 2,002 |
Project_CodeNet | 2,019 | // abc116_a
// #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int A,B,C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
return 0;
} | 56 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void)
{
long long int a,b,c,i,j,k,n;
cin >> a >> b >>c;
cout << a*b/2;
return 0;
} | 48 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize("Ofast")
usi... | 490 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c)
{
cout << (b*c) / 2 << endl;
}
else if(b > c && b > a)
{
cout << (a*c) / 2 << endl;
}
else
{
cout << (a*b) / 2 << endl;
}
} | 101 |
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;
} | 44 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template<typename T>
using Vec = vector<T>;
template<typename T, typename T2>
using P = pair<T, T2>;
template<typename... Args>
using Tup = tuple<Args...>;
template<typename T>
using qp = priority_queue<T, Vec<T>, greater<T> >;
templat... | 217 |
Project_CodeNet | 2,020 | #include "./bits/stdc++.h"
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a*b*0.5 <<endl;
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 34 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main(){
int a,b,c;
cin >>a>>b>>c;
cout<<a*b/2<<endl;
return 0;
} | 52 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.