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(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2;
return 0;
} | 43 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int intpow(int x,int y){
double a=x,b=y;
return pow(a,b);
}//(x,y) xをy乗する
int intfabs(int x){
double a=x;
return fabs(a);
}//(x) の絶対値
int in(){
int a;
cin >> a;
return a;
}//int型関数の受け取り
void forin(int* x,int y){
for (int i=0;i<y;i++){
cin >> x[i];
}... | 162 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,x,y) for(int i=x;i<y;i++)
#define rel(i,x,y) for(int i=x-1;i>=y;i--)
#define all(x) x.begin(),x.end()
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a,b,c;cin >> a >> b >> c;
cout << a * b /2 << endl;
} | 99 |
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,020 | #include <iostream>
#include <string>
#include <iomanip>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main()
{
double a, b, c;
cin >> a >> b >> c;
cout << a*b/2 <<endl;
return 0;
} | 65 |
Project_CodeNet | 2,019 | //#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | 293 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORe(i, k, n) for(int i = (k); i <= (n); i++)
#define FORr(i, k, n) for(int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(... | 248 |
Project_CodeNet | 2,019 | #include <assert.h>
#include <limits.h>
#include <math.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll =... | 236 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
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(a) (a).begin(),(a).end()
#define PI 3.141592653589793238
#define INF 10... | 147 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a*b) / 2 << endl;
return 0;
return 0;
} | 60 |
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;
}
| 52 |
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;
return 0;
}
| 48 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int a,b,c;
cin>>a>>b>>c;
cout<<a*b/2<<endl;
}
signed main(){
//while(1)
solve();
} | 58 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a*a+b*b == c*c) cout << a*b/2 << endl;
if(b*b+c*c == a*a) cout << b*c/2 << endl;
if(a*a+c*c == b*b) cout << a*c/2 << endl;
} | 86 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
cout << a*b/2 << endl;
} | 37 |
Project_CodeNet | 2,019 | #include <stdio.h>
#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;
} | 56 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1e18
int a,b,c;
signed main(){
cin>>a>>b>>c;
cout<<a*b/2<<endl;
return 0;
}
| 66 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <math.h>
using namespace std;
const long long INF = 1LL << 60; // どういう意味だろうか
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... | 158 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <tuple>
#include <stdbool.h>
#include <bitset>
#include <string>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using namespace std;
int main(void) {
int ab, bc, c... | 154 |
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,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 311 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b ;
cin >> a >> b;
cout << a*b/2;
}
| 37 |
Project_CodeNet | 2,020 | #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 <iostream>
using namespace std;
int main(void){
int a, b, c;
cin >> a >> b >> c;
int sum ;
sum = a*b/2;
cout << sum ;
} | 48 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
//#define <- プログラムの文字列を置換する
//typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a * b / 2 <... | 133 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 217 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include <string.h>
using ll = long long;
#define rep(i, n) fo... | 502 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c; cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 51 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define ORREP(i,n) for(int i=(n);i>=1;--i)
#define ZREP(i,n) for(int i=1;i<(n);++i)... | 304 |
Project_CodeNet | 2,019 | #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 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > r... | 397 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
int a[3];
scanf("%d %d %d",&a[0],&a[1],&a[2]);
sort(a,a+3);
int ans=a[0]*a[1]/2;
printf("%d\n",ans);
} | 73 |
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;
} | 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
using namespace std;
typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
int main() {... | 137 |
Project_CodeNet | 2,019 | typedef long long ll;
#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>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#define CON 1000000000000
#define SIX 1000000
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << a... | 106 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include <queue>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a*b / 2 << endl;
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a[3], ans = 1;;
cin >> a[0] >> a[1] >> a[2];
for (int i = 0; i < 3; i++) {
if (!((a[i] >= a[0]) && (a[i] >= a[1]) && (a[i] >= a[2]))) {
ans *= a[i];
}
}
cout << ans / 2 << endl;
return(0);
}
| 111 |
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;
} | 52 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;int main(){int a,b;cin>>a>>b;cout<<a*b/2;} | 30 |
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,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
vector <int> a(3);
cin>>a[0];
cin>>a[1];
cin>>a[2];
sort(a.begin(),a.end());
cout<<(a[0]*a[1])/2;
return 0;
}
| 98 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
int main() {
vi as(3);
for (int i = 0; i < 3; i++) {
cin >> as[i];
}
sort(as.begin(), as.end());
cout << as[0] * as[1] / 2 << endl;
} | 97 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 321 |
Project_CodeNet | 2,019 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int a, b,c;
cin >> a >> b >>c;
if(c ==sqrt(a*a+b*b)) cout << a*b/2<< endl;
else if(b ==sqrt(a*a+c*c)) cout << a*c/2<< endl;
else if(a ==sqrt(b*b+c*c)) cout << b*c/2<< endl;
}
| 95 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
int a,b,c,ans;
if(scanf("%d %d %d", &a,&b,&c) == EOF)
{
return 0;
}
ans = (a*b)/2;
printf("%d\n",ans);
return 0;
} | 73 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <tuple>
#include <utility>
#include <set>
using namespace std;
using LLI = long long int;
int main(int argc, char *argv[])
{
vector<int> v(3);
for (int i=0; i<3; i++) {
cin >> v[i];
}
sort(v.begin(), v.end()... | 118 |
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;
} | 50 |
Project_CodeNet | 2,019 | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | 444 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x*y/2 << endl;
return 0;
} | 44 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int x, y, z,sum;
cin >> x >> y >> z;
sum = x * y / 2;
cout << sum << "\n";
return 0;
} | 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <queue>
#include <time.h>
using namespace std;
#define INT_MAX 2147483647
typedef long long ll;
ll gcd(ll m, ll n); //最大公倍数
ll lcm(ll m, ll n); //最小公倍数
int mai... | 267 |
Project_CodeNet | 2,019 | #include <iostream>
#include <queue>
using namespace std;
int main(){
int temp;
priority_queue<int, vector<int>, greater<int>> que;
for(int i = 0; i < 3; i++){
cin >> temp;
que.push(temp);
}
int ans = 1;
for(int i = 0; i < 2; i++){
temp = que.top();
que.pop... | 114 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| 39 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <utility>
#include <map>
#include <set>
#include <algorithm>
#include<cmath>
#define rep(i, a, b) for (int i=a; i <b; i++)
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef vector< in... | 133 |
Project_CodeNet | 2,019 | #include <algorithm> // max
#include <iostream>
#include <math.h>
using namespace std;
int main(void){
int l, i=0, a[10];
while(cin>>l){
a[i] = l;
i++;
}
int x;
int y;
double z;
x=a[0];
y=a[0];
for(int i = 0; i <= 3; ++i){
if(x>a[i])x=a[i];
}
for(int i = 0; i <= 3; ++i){
if(y<a[i])x=a[i];
}
... | 141 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
int main()
{
... | 162 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int N = 1e5 + 50;
const int mod = 1e9 + 7;
const int inf = 1e17;
int dx[] = {0, 1, -1, 0, -1, 1, 1, -1};
int dy[] = {1, 0, 0, -1, -1, 1, -1, 1};
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
... | 190 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
const ll mo = 1e10 +7;
const int M = 100+50;
const ll mod = 998244353;
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d\n",a*b/2);
return 0;
} | 93 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
typedef long long ll;
ll a, b, c;
int main(void){
// Your code here!
cin >> a >> b >> c;
ll m = max(a, max(b, c));
if (a == m) cout << b * c / 2 << endl;
if (b == m) cout << c * a / 2 << endl;
if (c == m) cout << a * b / 2 << endl;
}
| 106 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
}
| 63 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| 54 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a*a+b*b==c*c){
printf("%d\n",a*b/2);
}
else{
printf("0\n");
}
return 0;
}
| 76 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b * c / max({a, b, c}) / 2 << endl;
return 0;
}
| 62 |
Project_CodeNet | 2,020 | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 348 |
Project_CodeNet | 2,019 | /*
██ ██ ██ ██████
██████ ██ ██
████████ ██████ ████████ ████████
████ ██████████████ ████
██ ██████ ██ ██████ ██
██████████ ██████ ████████ ██████████
████████ ███... | 582 |
Project_CodeNet | 2,019 | #include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b... | 693 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 196 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
signed main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | 69 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | 55 |
Project_CodeNet | 2,019 | #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;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << x*y/2 << endl;
}
| 37 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
return 0;
} | 46 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
cout << X * Y / 2 << endl;
}
| 42 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main()
{
int a,b,c;
int area;
cin>>a>>b>>c;
area = .5*a*b;
cout<<area;
return 0;
}
| 49 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <map>
#define ll long long
using namespace std;
int main(){
// cout<<123<<endl;
int a,b;
cin>>a>>b;
cout<<a*b/2<<endl;
return 0;
}
| 72 |
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;
}
| 42 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
int main ()
{
int x ,y ,z;
cin >> x >> y;
cout << x*y/2 << endl;
return 0;
}
| 55 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = a * b / 2;
cout << ans << endl;
return 0;
} | 61 |
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"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_lim... | 579 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y, z;
cin >> x >> y >> z;
cout << x * y / 2 << endl;
} | 58 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin>>a>>b>>c;
vector<int> res;
res.push_back(a);
res.push_back(b);
res.push_back(c);
sort(res.begin(), res.end());
int ans=(res[0]*res[1])/2;
cout<<ans<<endl;
} | 85 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<... | 618 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X*Y/2;
} | 39 |
Project_CodeNet | 2,020 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する... | 485 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = ... | 208 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templ... | 263 |
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;
}
| 45 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB*BC/2 << endl;
return 0;
} | 57 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
int a,b,c;
main()
{
cin>>a>>b>>c;
cout<<a*b*c/2/max({a,b,c})<<endl;
} | 45 |
Project_CodeNet | 2,019 | //https://atcoder.jp/contests/abc116/tasks/abc116_a
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
... | 470 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repf(i, f, l) for(int i = f; i < (int)l; ++i)
#define repit(it, t) for(__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++)
#define endl "\n"
#define pb emplace_back
#define lb lower_bound
#define int long... | 367 |
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<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int AB,BC,CD;
cin >> AB>> BC>> CD;
cout <<AB*BC/2<<endl;
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
double AB,BC,CA;
cin>>AB>>BC>>CA;
cout<<AB*BC*0.5;
}
| 39 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int AB = 0, BC = 0, CA = 0;
int ans = 0;
//入力
cin >> AB >> BC >> CA;
//処理
ans = AB * BC / 2;
//出力
cout << ans << endl;
return 0;
}
| 85 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void) {
int A,B,C;cin>>A>>B>>C;
cout << A * B / 2 << endl;
return 0;
} | 45 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.