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;
using ll=long long;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define all(a) (a).begin(), (a).end()
int main(){
cin.tie(nullptr);ios_base::sync_with_stdio(false);
int a,b,c;cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
| 113 |
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(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
} | 40 |
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 <stdio.h>
int main(){
int ab, bc ,ca;
scanf("%d %d %d",&ab ,&bc ,&ca);
int res = (ab * bc) / 2;
printf("%d\n",res);
return 0;
}
| 60 |
Project_CodeNet | 2,020 | #include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
int area = (a*b)/2;
printf("%d\n",area);
return 0;
}
| 53 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
} | 40 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
// 配列の最大値を取得
int max = *max_element(vec.begin(), vec.end());
// 配列の最大値のイテレータを取得
vector<int>::iterator maxIt = max_element(vec.begin(), vec.end());
// 配列の最大値までの距離を取得
int maxIndex = distance(vec.begin(), maxIt);
// 隣り合う重複要素... | 235 |
Project_CodeNet | 2,019 | /*
A - Right Triangle
https://atcoder.jp/contests/abc115/tasks/abc115_b
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab * bc / 2) << endl;
} | 88 |
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;
} | 37 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define printp(x... | 258 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> v(3);
cin>>v[0]>>v[1]>>v[2];
sort(v.begin(),v.end());
int ans=v[0]*v[1]/2;
cout<<ans<<endl;
return 0;
} | 72 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define ci cin
#define co cout
#define en endl
#define ln cout<< '\n'
#define rep(i... | 276 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca, s;
cin >> ab >> bc >> ca;
s = ab * bc / 2;
cout << s << endl;
return 0;
} | 49 |
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,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main(void){
int c, a, b;
cin >> c >> a >> b;
cout << c * a / 2 << endl;
return 0;
}
| 55 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
namespace mp = boost::multiprecision;
#define ll long long
#define cpp mp::cpp_int
#define dequeue deque
#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... | 304 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric> // min, max
#include <fstream> // ifstream
#include <iomanip> // setprecision
using namespace std;
typedef long long ll;
int main(void)
{
#ifdef FILE_DEBUG
ifstream inputFile("data/input.txt");
cin.rdbuf(inputFile... | 144 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int AB,BC,CA,menseki;
cin >> AB >> BC >> CA;
menseki = AB * BC / 2;
cout << menseki << endl;
} | 53 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
//#include <stdio.h>
//#include <stack>
//#include <queue>
#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
//#include <iomanip>
#include <stdlib.h>
#include <cctyp... | 515 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
string s;
cin >> a >> b;
cout << a * b / 2 << endl;
} | 48 |
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;
return 0;
} | 52 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) ... | 401 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <string>
typedef long long ll;
using namespace std;
int main()
{
ll square;
ll x,y,z;
while(~scanf("%lld%lld%lld",&x,&y,&z))
{
printf("%lld\n",(x*y)/2);
}
return 0;
}
| 81 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int AB, BC, CA;
scanf("%d %d %d", &AB, &BC, &CA);
if (AB > BC && AB > CA) printf("%d\n", BC * CA / 2);
else if (BC > AB && BC > CA) printf("%d\n", AB * CA / 2);
else printf("%d\n", AB * BC / 2);
return 0;
} | 105 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(int i = m; i < ... | 235 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 90 |
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;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
} | 67 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a[3] , ans = 0 , i ;
scanf("%d%d%d",&a[0],&a[1],&a[2]);
for(i = 0 ; i < 3 ; i++ )
{
for(int j = 0 ; j < i ; j++ )
{
if(a[i] < a[j] )
{
int c = a[i] ;
a[i] = a[j] ;
a[j] = c ;
}
}
}
ans = a[0] * a[1] ;
ans /= 2 ;
printf("%d\n",ans);
}
| 143 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include <stdio.h>
using namespace std;
int main() {
int a,b,c;
cin >>a >> b>> c;
cout << a*b/2 <<endl;
}
| 48 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define pb push_bac... | 236 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(i,e) for(ll i=0;i<e;i++ )
typedef pair<ll,ll> P;
const ll mod = 1e9+7;
const ll INF = INT32_MAX;
ll i;
int main(){
ll a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
| 95 |
Project_CodeNet | 2,020 | /*
飲んだ魔剤で家が建つ。
created at: 2020-03-28 20:28:21
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
... | 391 |
Project_CodeNet | 2,019 | #include <iostream>
#define REP(i, a, b) for ( int i = (a); i < (b); i++ )
#define REVREP(i, a, b) for ( int i = (a); i >= (b); i--)
#define DEBUG_INT(var) printf("the value of "#var" is %d\n", var)
#define PRINT_ARRAY(name, i) printf("the value of "#name"[%d] is %d\n", (i), name[(i)])
#define DEBUG_ARRAY(name, begin,... | 182 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main (){
double a,b,c;
cin>> a>> b>> c;
cout << (int)(a*b/2)<< endl;
return 0;
}
| 47 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b;
cout << a * b / 2;
}
| 37 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int ab,bc,ca;
cin>>ab>>bc>>ca;
int area = .5*(ab*bc);
cout<<area<<endl;
return 0;
}
| 55 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", a * b / 2);
return 0;
}
| 50 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << a * b / 2 << std::endl;
return 0;
} | 59 |
Project_CodeNet | 2,020 | //的場梨沙★担当
//結城晴★副担当
//日野茜★副担当
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#incl... | 249 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2;
return 0;
}
| 47 |
Project_CodeNet | 2,019 | /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a , a + 3);
int b = a[0];
int h = a[1];
int area = 0.5 * b * h;
cout << area << endl;
return 0;
}
| 108 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int,int>P;
int main(){
int a[3];rep(i,3)cin>>a[i];
sort(a,a+3);
cout<<a[0]*a[1]/2<<endl;
} | 72 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int AB, BC, CA;
cin >> AB >> BC >> CA;
int area;
area = AB * BC / 2;
cout << area << endl;
return 0;
} | 56 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int r = a;
if (b > r) {
r = b;
}
if (c > r) {
r = c;
}
int ans = 1;
if (a != r) {
ans *= a;
}
if (b != r) {
ans *= b;
}
if (c != r) {
ans... | 136 |
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;
}
| 53 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << a*b/2 << endl;
return 0;
} | 63 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long int
#define INFTY (1<<21)
using namespace std;
int main(void){
cin.sync_with_stdio(false);
int a,b;
cin>>a>>b;
cout<<(a*b/2)<<endl;
return 0;
} | 65 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
const ll MOD = 1e9+7;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
... | 1,010 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int AB,BC,CA;
cin >> AB >> BC >> CA;
cout << (AB * BC / 2) << endl;
} | 77 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdlib>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<iomanip>
#include<typeinfo>
#include<complex>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for(ll i = a;i < b; i++)
co... | 129 |
Project_CodeNet | 2,019 | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
in... | 119 |
Project_CodeNet | 2,020 | # include <bits/stdc++.h>
using namespace std;
int main () {
int a,b;
cin >> a >> b;
cout << a*b/2 << endl;
} | 39 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int x[3];
for (int i = 0; i < 3; i++) cin >> x[i];
sort(x, x+3);
cout << x[0]*x[1]/2 << endl;
}
| 68 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a*b)/2 << endl;
} | 37 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
//cout << a << b << c << endl;
int d;
if(c * c == (a * a) + (b * b)){
d = (a * b)/2;
}
cout << d << endl;
} | 86 |
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 <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
int main()
{
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
cout ... | 118 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int AB,BC,CA;
cin>>AB>>BC>>CA;
double result=(double)AB*(double)BC/2;
cout<<result<<endl;
return 0;
}
| 58 |
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;
} | 42 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int ans=1;
int A,B,C;
cin >>A>>B>>C;
ans=A*B;
//cout << ans <<endl;
cout << ans/2 <<endl;
return 0;
}
| 65 |
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;
} | 40 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
} | 41 |
Project_CodeNet | 2,019 | #include <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 | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#i... | 388 |
Project_CodeNet | 2,019 | # include <bits/stdc++.h>
using namespace std;
int main () {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
cout << a*b/2;
cout << endl;
} | 60 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int a,b,c;
int main(){
cin>>c>>a>>b;
cout<<a*c/2<<endl;
} | 95 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
template <class T>
T next()
{
T x;
cin >> x;
return (x);
}
int main()
{
auto ab = next<int>();
auto bc = next<int>();
auto ca = next<int>();
cout << ab * bc / 2 << endl;
} | 70 |
Project_CodeNet | 2,020 | using namespace std;
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define repa(i,a,b) for (int i=a; i<=b; i++)
#define repd(i,b,a) for (int i=b; i>=a; i--)
#defin... | 335 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | 55 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).... | 380 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
using namespace std;
int main(){
int a,b,c;
cin >> a>> b >> c;
int d=(a+b+c)/2;
double e=d*(d-a)*(d-b)*(d-c);
co... | 101 |
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;
}
| 48 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int ab,bc,ca;
scanf("%d %d %d",&ab,&bc,&ca);
printf("%d\n",ab*bc/2);
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(),a.rend())
#define Sort(a) sort(a.begin(),a.end())
#define Reverse(a) reverse(a.begin(),a.end())
#d... | 245 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std ;
int main () {
int x , y , z;
cin>> x >> y >> z;
cout << (x*y*.5) ;
return 0 ;
} | 41 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
using namespace std;
in... | 133 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int ab,bc,ac;
cin>>ab>>bc>>ac;
cout<<ab*bc/2;
return 0;
} | 39 |
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;
} | 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;
} | 40 |
Project_CodeNet | 2,019 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(int i=(r)-1;i>=(l);--i)
#define RREP(i,n) RFOR(i,0,n)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#defi... | 1,120 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 210 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h> //ABC 116_a
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
cout<<A*B/2;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
if (a > b)
{
swap(a, b);
}
if (b > c)
{
swap(b, c);
}
a = a*b/2;
cout << a << endl;
return 0;
} | 90 |
Project_CodeNet | 2,019 | // A - Right Triangle
#include <bits/stdc++.h>
using namespace std;
int main(){
int c,a,b; cin>>c>>a>>b;
cout<< c*a/2 <<endl;
} | 43 |
Project_CodeNet | 2,019 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define replet(c) for(char c='a';c<='z';c++)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#def... | 222 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int area = ab * bc / 2;
cout << area << endl;
return 0;
} | 47 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << (b * a) / 2 << endl;
} | 47 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
int mod = 1000000007;
#define ll long long
int main() {
int a,b,c;
cin>>a>>b>>c;
cout << a*b/2 << endl;
} | 70 |
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;
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;
} | 116 |
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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int a,b,c;
cin >> c >> a >> b;
cout << c*a*1/2 << endl;
}
| 73 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main() {
int a, b, c, l;
scanf("%d %d %d", &a, &b, &c);
l = (a * b) / 2;
printf("%d\n", l);
return 0;
} | 63 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) ce... | 225 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define MOD 1000000007... | 154 |
Project_CodeNet | 2,019 | #include <iostream>
int main() {
int AB, BC, CA;
std::cin >> AB >> BC >> CA;
std::cout << AB * BC / 2 << std::endl;
return 0;
}
| 49 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c * c == a * a + b * b)
cout << a * b... | 162 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define ANS cout << ans << endl
#define all(a) a.begin(),a.end()
#define SORT(a) sort(all(a))
#define REVE... | 422 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int ab,bc;
cin>>ab>>bc;
cout<<(ab*bc)/2<<endl;
}
| 40 |
Project_CodeNet | 2,019 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | 833 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.