problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
bool flg = 0;
if (W / 2 == x && H / 2 == y)
flg = 1;
if (flg)
cout << W * H / 2 << " " << 1 << endl;
else
cout << W * H / 2 << " " << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
bool flg = 0;
if (W / 2 == x && H / 2 == y)
flg = 1;
if (flg)
cout << W * H / 2 << " " << 1 << endl;
else
cout << W * H / 2 << " " << 0 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 815,735 | 815,736 | u294721290 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << W * H / 2.0 << " ";
if (W / 2.0 == x && H / 2.0 == y)
cout << 1 << endl;
else if (W / 2.0 == x || H / 2.0 == y || x == 0 || y == 0 || x == W || y == H)
cout << 0 << endl;
else
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << W * H / 2.0 << " ";
if (W / 2.0 == x && H / 2.0 == y)
cout << 1 << endl;
else if (W / 2.0 == x || H / 2.0 == y || x == 0 || y == 0 || x == W || y == H)
cout << 0 << endl;
else
cout << 0 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 815,737 | 815,738 | u331197998 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int malt = 0;
if (W == 2 * x && H == 2 * y)
malt = 1;
double area = (W * H) / 2;
cout << area << " " << malt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int malt = 0;
if (W == 2 * x && H == 2 * y)
malt = 1;
double area = (W * H) / 2;
cout << area << " " << malt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 815,744 | 815,745 | u249218227 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int malt = 0;
if (W == 2 * x && H == 2 * y)
malt = 1;
double area = (W * H) / 2;
cout << area << malt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int malt = 0;
if (W == 2 * x && H == 2 * y)
malt = 1;
double area = (W * H) / 2;
cout << area << " " << malt << endl;
} | [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 815,746 | 815,745 | u249218227 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::cout << std::fixed << std::setprecision(6);
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W / 2 * H;
cout << ans << " ";
if (W / 2 == x && H / 2 == y)
cout << 2;
else
cout << 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
std::cout << std::fixed << std::setprecision(6);
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W / 2 * H;
cout << ans << " ";
if (W / 2 == x && H / 2 == y)
cout << 1;
else
cout << 0;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 815,747 | 815,748 | u627214330 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
int32_t main() {
IOS;
int w, h, x, y, count = 0;
cin >> w >> h >> x >> y;
double area = double(w * h) / double(2);
if (x * x == w && y * y == h)
count = 1;
printf("%.6f %lld", area, count);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
int32_t main() {
IOS;
int w, h, x, y, count = 0;
cin >> w >> h >> x >> y;
double area = double(w * h) / double(2);
if ((x + x == w) && (y + y == h))
count = 1;
printf("%.6f %lld", area, count);
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 815,749 | 815,750 | u608243275 | cpp |
p03001 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
double n, m, x, y;
cin >> m >> n >> x >> y;
printf("%lf", m * n / 2.000);
if (x + x == m && y + y == n)
cout << 1;
else
cout << " " << 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
double n, m, x, y;
cin >> m >> n >> x >> y;
printf("%lf", m * n / 2.000);
if (x + x == m && y + y == n)
cout << " " << 1;
else
cout << " " << 0;
} | [
"io.output.change"
] | 815,751 | 815,752 | u765809314 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using lint = long long;
using uli = unsigned long long;
uli gcd(uli a, uli b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
uli lcm(uli a, uli b) { return a / gcd(a, b) * b; }
const uli mod = 1000000007;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
uli _PowMod(uli x, uli y, uli _mod) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % _mod;
} else if (y % 2 == 0) {
auto tmp = _PowMod(x, y / 2, _mod);
return tmp * tmp % _mod;
} else {
auto tmp = _PowMod(x, y / 2, _mod);
return (tmp * tmp % _mod) * x % _mod;
}
}
uli PowMod(uli x, uli y) { return _PowMod(x, y, mod); }
uli getModInv(uli N) { return PowMod(N, mod - 2); }
lint nCrMod(lint start, lint n, lint r) {
if (n < r) {
return 0;
}
lint a = start;
for (size_t i = n; i >= n - r + 1; i--) {
a *= i;
a %= mod;
}
for (size_t i = 1; i <= r; i++) {
a *= getModInv(i);
a %= mod;
}
return a;
}
lint nHrMod(lint start, lint n, lint r) { return nCrMod(start, n + r - 1, r); }
lint _nCrMod(lint start, lint n, lint r) {
if (n <= 0) {
return 0;
}
return nCrMod(start, n, r);
}
struct uf {
vector<lint> p;
uf(lint n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
lint rt(lint n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(lint n, lint m) { p[rt(n)] = p[rt(m)]; }
bool eq(lint n, lint m) { return rt(n) == rt(m); }
};
bool lineCol(lint a1x, lint a1y, lint a2x, lint a2y, lint b1x, lint b1y,
lint b2x, lint b2y) {
auto ta = (b1x - b2x) * (a1y - b1y) + (b1y - b2y) * (b1x - a1x);
auto tb = (b1x - b2x) * (a2y - b1y) + (b1y - b2y) * (b1x - a2x);
auto tc = (a1x - a2x) * (b1y - a1y) + (a1y - a2y) * (a1x - b1x);
auto td = (a1x - a2x) * (b2y - a1y) + (a1y - a2y) * (a1x - b2x);
return tc * td < 0 && ta * tb < 0;
}
lint powInt(lint a, lint b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
lint tmp = powInt(a, b / 2);
return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}
lint _sMod(string n, lint mod) {
lint k = (n[0] - '0') % mod;
for (size_t i = 1; i < n.length(); i++) {
k *= 10;
k += (n[i] - '0');
k %= mod;
}
return k;
}
#define vec(name, n) vector<lint> name(n)
#define vec_(name, n, init) vector<lint> name(n, init)
#define vecs(name, n) vector<string> name(n)
#define vect(t, name, n) vector<t> name(n)
#define vec2(name, n, m) vector<vector<lint>> name(n, vector<lint>(m))
#define vec2_(name, n, m, init) \
vector<vector<lint>> name(n, vector<lint>(m, init))
#define rep(i, n) for (lint i = 0; i < n; i++)
#define repi(i, n, z) for (lint i = z; i < n; i++)
#define mmax(a, b) max((lint)a, (lint)b)
#define mmin(a, b) min((lint)a, (lint)b)
template <typename T> void vsort(vector<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void vsortr(vector<T> &v) { sort(v.rbegin(), v.rend()); }
lint div2(lint p, lint q) { return (p + q - 1) / q; }
struct xy {
lint x, y;
xy() : x(0), y(0) {}
xy(lint _x, lint _y) : x(_x), y(_y) {}
};
template <class It, class T> bool exist(It begin, It end, const T &val) {
return find(begin, end, val) != end;
}
template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
return find_if(begin, end, pred) != end;
}
lint n_dig(lint n) {
lint ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
template <class T, class T2> T2 ler(T val1, T val2, T2 l, T2 e, T2 r) {
if (val1 < val2)
return r;
if (val1 > val2)
return l;
return e;
}
const lint alpn = 'z' - 'a' + 1;
template <class T> T sgn(T val) {
if (val == T(0))
return T(0);
if (val < 0)
return T(-1);
if (val > 0)
return T(1);
}
template <class T> bool between(T val, T l, T r) {
return (val >= l) && (val <= r);
}
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
template <class It> vector<lint> carr(It begin, It end) {
vec(c, 0);
c.push_back(1);
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(0);
before = *it;
}
c.back()++;
}
return c;
}
template <class T> struct nval {
lint n;
T val;
nval() : n(0){};
nval(lint _n, T _val) : n(_n), val(_val){};
};
template <class It> auto carr2(It begin, It end) {
using T = nval<remove_reference_t<decltype(*begin)>>;
vect(T, c, 0);
c.push_back(T(1, *begin));
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(T(0, *it));
before = *it;
}
c.back().n++;
}
return c;
}
lint sumdig(lint n) {
lint ans = 0;
while (n > 0) {
ans += n % 10;
n /= 10;
}
return ans;
}
lint getdig(lint n, lint d) { return (n / powInt(10, d)) % 10; }
template <typename It, typename T>
void sort2(It begin, It end, T It::value_type::*p) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p](val_t a, val_t b) { return a.*p < b.*p; });
}
template <typename It, typename T, typename T2>
void sort3(It begin, It end, T It::value_type::*p, T2 It::value_type::*p2) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p, p2](val_t a, val_t b) {
if (a.*p != b.*p) {
return a.*p < b.*p;
} else {
return a.*p2 > b.*p2;
}
});
}
int main() {
lint w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << ' ' << (x * 2 == w && y * 2 == h ? 1 : 0) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using lint = long long;
using uli = unsigned long long;
uli gcd(uli a, uli b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
uli lcm(uli a, uli b) { return a / gcd(a, b) * b; }
const uli mod = 1000000007;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
uli _PowMod(uli x, uli y, uli _mod) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % _mod;
} else if (y % 2 == 0) {
auto tmp = _PowMod(x, y / 2, _mod);
return tmp * tmp % _mod;
} else {
auto tmp = _PowMod(x, y / 2, _mod);
return (tmp * tmp % _mod) * x % _mod;
}
}
uli PowMod(uli x, uli y) { return _PowMod(x, y, mod); }
uli getModInv(uli N) { return PowMod(N, mod - 2); }
lint nCrMod(lint start, lint n, lint r) {
if (n < r) {
return 0;
}
lint a = start;
for (size_t i = n; i >= n - r + 1; i--) {
a *= i;
a %= mod;
}
for (size_t i = 1; i <= r; i++) {
a *= getModInv(i);
a %= mod;
}
return a;
}
lint nHrMod(lint start, lint n, lint r) { return nCrMod(start, n + r - 1, r); }
lint _nCrMod(lint start, lint n, lint r) {
if (n <= 0) {
return 0;
}
return nCrMod(start, n, r);
}
struct uf {
vector<lint> p;
uf(lint n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
lint rt(lint n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(lint n, lint m) { p[rt(n)] = p[rt(m)]; }
bool eq(lint n, lint m) { return rt(n) == rt(m); }
};
bool lineCol(lint a1x, lint a1y, lint a2x, lint a2y, lint b1x, lint b1y,
lint b2x, lint b2y) {
auto ta = (b1x - b2x) * (a1y - b1y) + (b1y - b2y) * (b1x - a1x);
auto tb = (b1x - b2x) * (a2y - b1y) + (b1y - b2y) * (b1x - a2x);
auto tc = (a1x - a2x) * (b1y - a1y) + (a1y - a2y) * (a1x - b1x);
auto td = (a1x - a2x) * (b2y - a1y) + (a1y - a2y) * (a1x - b2x);
return tc * td < 0 && ta * tb < 0;
}
lint powInt(lint a, lint b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
lint tmp = powInt(a, b / 2);
return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}
lint _sMod(string n, lint mod) {
lint k = (n[0] - '0') % mod;
for (size_t i = 1; i < n.length(); i++) {
k *= 10;
k += (n[i] - '0');
k %= mod;
}
return k;
}
#define vec(name, n) vector<lint> name(n)
#define vec_(name, n, init) vector<lint> name(n, init)
#define vecs(name, n) vector<string> name(n)
#define vect(t, name, n) vector<t> name(n)
#define vec2(name, n, m) vector<vector<lint>> name(n, vector<lint>(m))
#define vec2_(name, n, m, init) \
vector<vector<lint>> name(n, vector<lint>(m, init))
#define rep(i, n) for (lint i = 0; i < n; i++)
#define repi(i, n, z) for (lint i = z; i < n; i++)
#define mmax(a, b) max((lint)a, (lint)b)
#define mmin(a, b) min((lint)a, (lint)b)
template <typename T> void vsort(vector<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void vsortr(vector<T> &v) { sort(v.rbegin(), v.rend()); }
lint div2(lint p, lint q) { return (p + q - 1) / q; }
struct xy {
lint x, y;
xy() : x(0), y(0) {}
xy(lint _x, lint _y) : x(_x), y(_y) {}
};
template <class It, class T> bool exist(It begin, It end, const T &val) {
return find(begin, end, val) != end;
}
template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
return find_if(begin, end, pred) != end;
}
lint n_dig(lint n) {
lint ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
template <class T, class T2> T2 ler(T val1, T val2, T2 l, T2 e, T2 r) {
if (val1 < val2)
return r;
if (val1 > val2)
return l;
return e;
}
const lint alpn = 'z' - 'a' + 1;
template <class T> T sgn(T val) {
if (val == T(0))
return T(0);
if (val < 0)
return T(-1);
if (val > 0)
return T(1);
}
template <class T> bool between(T val, T l, T r) {
return (val >= l) && (val <= r);
}
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
template <class It> vector<lint> carr(It begin, It end) {
vec(c, 0);
c.push_back(1);
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(0);
before = *it;
}
c.back()++;
}
return c;
}
template <class T> struct nval {
lint n;
T val;
nval() : n(0){};
nval(lint _n, T _val) : n(_n), val(_val){};
};
template <class It> auto carr2(It begin, It end) {
using T = nval<remove_reference_t<decltype(*begin)>>;
vect(T, c, 0);
c.push_back(T(1, *begin));
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(T(0, *it));
before = *it;
}
c.back().n++;
}
return c;
}
lint sumdig(lint n) {
lint ans = 0;
while (n > 0) {
ans += n % 10;
n /= 10;
}
return ans;
}
lint getdig(lint n, lint d) { return (n / powInt(10, d)) % 10; }
template <typename It, typename T>
void sort2(It begin, It end, T It::value_type::*p) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p](val_t a, val_t b) { return a.*p < b.*p; });
}
template <typename It, typename T, typename T2>
void sort3(It begin, It end, T It::value_type::*p, T2 It::value_type::*p2) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p, p2](val_t a, val_t b) {
if (a.*p != b.*p) {
return a.*p < b.*p;
} else {
return a.*p2 > b.*p2;
}
});
}
int main() {
lint w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2 << ' ' << (x * 2 == w && y * 2 == h ? 1 : 0)
<< endl;
return 0;
}
| [
"type_conversion.add"
] | 815,768 | 815,769 | u275797573 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define fi first
#define se second
#define pb push_back
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vi>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void fastik() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
// ifstream &cin
void solve() {}
int main() {
fastik();
// ifstream cin("input.txt");
/*ll t = 1;
cin >> t;
while(t--){
solve();
}*/
cout << setprecision(16) << fixed;
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans = 0;
if (x + x == w && y + y == h)
ans = 1;
double s = w * h / 2;
cout << s << " " << ans;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define fi first
#define se second
#define pb push_back
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vi>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void fastik() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
// ifstream &cin
void solve() {}
int main() {
fastik();
// ifstream cin("input.txt");
/*ll t = 1;
cin >> t;
while(t--){
solve();
}*/
cout << setprecision(16) << fixed;
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans = 0;
if (x + x == w && y + y == h)
ans = 1;
double s = double(w) * double(h) / 2;
cout << s << " " << ans;
} | [
"call.add",
"call.arguments.change"
] | 815,777 | 815,778 | u629521741 | cpp |
p03001 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (int i = (int)(end - 1), i##_end = (int)(begin); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
#define each(x, a) for (auto &x : a)
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ll = long long;
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (int i = 0; i < (int)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
#ifdef LOCAL
inline void dump(void) { cerr << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cerr << head << " ";
dump(tail...);
}
#define debug(...) \
do { \
cerr << "[L." << __LINE__ << "]\t" << #__VA_ARGS__ << "="; \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
class in {
int n;
public:
in() { n = -1; }
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
vector<T> ret(n);
for (int i = 0; i < n; ++i)
cin >> ret[i];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
int out() {
cout << '\n';
return 0;
}
template <class T> int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
template <std::uint_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(const u64 x = 0) noexcept : a(x % Mod) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::uint_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll w = in();
ll h = in();
ll x = in();
ll y = in();
double s = w * h / 2;
printf("%.6f %d\n", s, (x * 2 == w && y * 2 == h));
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (int i = (int)(end - 1), i##_end = (int)(begin); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
#define each(x, a) for (auto &x : a)
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ll = long long;
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (int i = 0; i < (int)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
#ifdef LOCAL
inline void dump(void) { cerr << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cerr << head << " ";
dump(tail...);
}
#define debug(...) \
do { \
cerr << "[L." << __LINE__ << "]\t" << #__VA_ARGS__ << "="; \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
class in {
int n;
public:
in() { n = -1; }
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
vector<T> ret(n);
for (int i = 0; i < n; ++i)
cin >> ret[i];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
int out() {
cout << '\n';
return 0;
}
template <class T> int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
template <std::uint_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(const u64 x = 0) noexcept : a(x % Mod) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::uint_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll w = in();
ll h = in();
ll x = in();
ll y = in();
double s = w * h / 2.0;
printf("%.6f %d\n", s, (x * 2 == w && y * 2 == h));
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 815,781 | 815,782 | u899220667 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (x * 2 == w && y * 2 == h) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2. << " " << (x * 2 == w && y * 2 == h) << endl;
}
| [] | 815,789 | 815,790 | u870965055 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2;
cout << s << " " << ((w == x * 2 && h == y * 2) ? 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2;
cout << s << " " << ((w == x * 2 && h == y * 2) ? 1 : 0) << endl;
} | [
"variable_declaration.type.change"
] | 815,797 | 815,798 | u852839243 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long count = 0;
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (W == x * 2 and H == y * 2)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long count = 0;
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << double(W) * double(H) / 2 << " ";
if (W == x * 2 and H == y * 2)
cout << 1;
else
cout << 0;
} | [
"call.add",
"call.arguments.change"
] | 815,811 | 815,812 | u573537453 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(15) << (w * h) / 2 << " ";
if ((w * .5 - x) < 1 && (h * .5 - y) < 1)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(15) << (w * h) / 2 << " ";
if (abs(w * .5 - x) < 0.1 && abs(h * .5 - y) < 0.1)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"call.add",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 815,825 | 815,826 | u305141544 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
ans = W * H / 2;
if (2 * x == W && 2 * y == H) {
printf("%lf %d\n", ans, 1);
} else {
printf("%lf %d\n", ans, 0);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
ans = double(W) * double(H) / 2;
if (2 * x == W && 2 * y == H) {
printf("%lf %d\n", ans, 1);
} else {
printf("%lf %d\n", ans, 0);
}
} | [
"call.add",
"call.arguments.change"
] | 815,845 | 815,846 | u304862095 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
// container output function
template <typename T> inline void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// array output function
template <typename T> inline void OutaN(T x[], const size_t &n) {
size_t i, len = n - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// iterator output function
template <typename T> inline void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
inline double rad2deg(const double &rad) { return rad * (180.0 / PI); }
inline double deg2rad(const double °) { return deg * (PI / 180.0); }
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
std::cout.precision(18);
long w, h, x, y;
cin >> w >> h >> x >> y;
char ch = x + x == w && y + y == h ? '1' : '0';
Outln(" ", double(x * h) / 2.0, ch);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
// container output function
template <typename T> inline void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// array output function
template <typename T> inline void OutaN(T x[], const size_t &n) {
size_t i, len = n - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// iterator output function
template <typename T> inline void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
inline double rad2deg(const double &rad) { return rad * (180.0 / PI); }
inline double deg2rad(const double °) { return deg * (PI / 180.0); }
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
std::cout.precision(18);
long w, h, x, y;
cin >> w >> h >> x >> y;
char ch = x + x == w && y + y == h ? '1' : '0';
Outln(" ", double(w * h) / 2.0, ch);
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 815,853 | 815,854 | u518883877 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
// container output function
template <typename T> inline void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// array output function
template <typename T> inline void OutaN(T x[], const size_t &n) {
size_t i, len = n - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// iterator output function
template <typename T> inline void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
inline double rad2deg(const double &rad) { return rad * (180.0 / PI); }
inline double deg2rad(const double °) { return deg * (PI / 180.0); }
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 1
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
std::cout.precision(18);
long w, h, x, y;
cin >> w >> h >> x >> y;
char ch = x + x == w && y + y == h ? '1' : '0';
Outln(" ", double(x * h) / 2.0, ch);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
// container output function
template <typename T> inline void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// array output function
template <typename T> inline void OutaN(T x[], const size_t &n) {
size_t i, len = n - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
// iterator output function
template <typename T> inline void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
inline double rad2deg(const double &rad) { return rad * (180.0 / PI); }
inline double deg2rad(const double °) { return deg * (PI / 180.0); }
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
std::cout.precision(18);
long w, h, x, y;
cin >> w >> h >> x >> y;
char ch = x + x == w && y + y == h ? '1' : '0';
Outln(" ", double(w * h) / 2.0, ch);
return 0;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 815,855 | 815,854 | u518883877 | cpp |
p03001 | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
ll area = H * W;
cout << fixed << setprecision(10) << area / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
print(1);
} else {
print(0);
}
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
double area = H * W;
cout << fixed << setprecision(10) << area / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
print(1);
} else {
print(0);
}
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.change"
] | 815,864 | 815,863 | u929199273 | cpp |
p03001 | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int area = H * W;
cout << fixed << setprecision(10) << area / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
print(1);
} else {
print(0);
}
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
double area = H * W;
cout << fixed << setprecision(10) << area / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
print(1);
} else {
print(0);
}
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 815,865 | 815,863 | u929199273 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typedef pair<float, float> floatpair;
typedef vector<int> intvector;
typedef vector<bool> boolvector;
typedef vector<string> strvector;
typedef vector<LL> LLvector;
typedef vector<double> doublevector;
typedef vector<float> floatvector;
#define wait(sec) usleep((sec)*1000000)
#define ED return 0;
#define TEST cout << "OK" << endl;
#define UP(a, b) ((a + (b - 1)) / b)
#define SORT(vec) sort(vec.begin(), vec.end());
#define DOUBLECHANGE(count) cout << setprecision(count);
#define REV(vec) reverse(vec.begin(), vec.end());
#define ipow(x, y) LL(pow(x, y))
#define INF 999999999
#define BIG(c) (c) - 0x20
#define SMALL(c) (c) + 0x20
const long long mod = 1000000007;
int main() {
// random_device rnd;
// mt19937 mt(rnd());
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << (W * H) / 2.0 << " " << ((W / 2 == x) && (H / 2 == y) ? 1 : 0)
<< endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typedef pair<float, float> floatpair;
typedef vector<int> intvector;
typedef vector<bool> boolvector;
typedef vector<string> strvector;
typedef vector<LL> LLvector;
typedef vector<double> doublevector;
typedef vector<float> floatvector;
#define wait(sec) usleep((sec)*1000000)
#define ED return 0;
#define TEST cout << "OK" << endl;
#define UP(a, b) ((a + (b - 1)) / b)
#define SORT(vec) sort(vec.begin(), vec.end());
#define DOUBLECHANGE(count) cout << setprecision(count);
#define REV(vec) reverse(vec.begin(), vec.end());
#define ipow(x, y) LL(pow(x, y))
#define INF 999999999
#define BIG(c) (c) - 0x20
#define SMALL(c) (c) + 0x20
const long long mod = 1000000007;
int main() {
// random_device rnd;
// mt19937 mt(rnd());
cin.tie(0);
ios::sync_with_stdio(false);
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << (W * H) / 2.0 << " " << ((W / 2.0 == x) && (H / 2.0 == y) ? 1 : 0)
<< endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 815,866 | 815,867 | u550995059 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cout << fixed << setprecision(10);
ll W, H, x, y;
cin >> W >> H >> x >> y;
ll size = W * H;
ll two_way = ((W / 2 == x) && (H / 2 == y)) ? 1 : 0;
cout << size / 2. << " " << two_way << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cout << fixed << setprecision(10);
ll W, H, x, y;
cin >> W >> H >> x >> y;
ll size = W * H;
ll two_way = ((W / 2. == x) && (H / 2. == y)) ? 1 : 0;
cout << size / 2. << " " << two_way << endl;
return 0;
}
| [] | 815,873 | 815,874 | u526974618 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h;
cin >> w >> h;
double x, y;
cin >> x >> y;
cout << h * w / 2 << endl;
if (x * 2 == w && y * 2 == h) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h;
cin >> w >> h;
double x, y;
cin >> x >> y;
cout << h * w / 2 << " ";
if (x * 2 == w && y * 2 == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"io.output.change",
"literal.number.change"
] | 815,882 | 815,881 | u834415466 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int num = 0;
if (x * 2 == w && y * 2 == h) {
num = 1;
}
cout << ans << " " << num << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int num = 0;
if (x * 2 == w && y * 2 == h) {
num = 1;
}
cout << ans << " " << num << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 815,885 | 815,886 | u033627628 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
int s = 0;
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2) {
s = 1;
}
cout << (long long)w * h / 2 << " " << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
int s = 0;
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2) {
s = 1;
}
cout << (long long)w * h / 2.0 << " " << s << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 815,897 | 815,898 | u882039496 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int w, h, x, y;
cin >> w >> h >> x >> y;
double res1 = w * h / 2;
int res2;
if (w == x * 2 && h == y * 2)
res2 = 1;
else
res2 = 0;
printf("%.6f %d\n", res1, res2);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int w, h, x, y;
cin >> w >> h >> x >> y;
double res1 = (double)w * h / 2;
int res2;
if (w == x * 2 && h == y * 2)
res2 = 1;
else
res2 = 0;
printf("%.10f %d\n", res1, res2);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,899 | 815,900 | u879870653 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
long double ans = a * b / 2;
if (x == a / 2 && y == b / 2)
cout << setprecision(20) << ans << " " << 1 << endl;
else
cout << setprecision(20) << ans << " " << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b, x, y;
cin >> a >> b >> x >> y;
long double ans = a * b / 2;
if (x == a / 2 && y == b / 2)
cout << setprecision(20) << ans << " " << 1 << endl;
else
cout << setprecision(20) << ans << " " << 0 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 815,909 | 815,910 | u665871498 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
ld ans = 0;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
ld ans = 0;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
cout << w * h / 2.0 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 815,913 | 815,914 | u980909653 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
ll ans = 0;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
ld ans = 0;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
cout << w * h / 2.0 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
return 0;
} | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 815,915 | 815,914 | u980909653 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define pb push_back
#define ff first
#define ss second
#define fr(i, j, k) for (int i = j; i < k; i++)
#define rf(i, j, k) for (int i = j; i >= k; i--)
#define int long long
#define ld long double
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mp make_pair
#define inf INT_MAX
#define read_file() \
; \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int mod = 2019;
const ld pi = acos(-1);
const int Maxn = 105;
template <class T> ostream &operator<<(ostream &out, vector<T> &A) {
for (auto x : A)
out << x << " ";
return out;
}
template <class T> ostream &operator<<(ostream &out, set<T> &A) {
for (auto x : A)
out << x << " ";
return out;
}
template <class T1, class T2> T1 powr(T1 a, T2 b) {
T1 res = 1;
fr(i, 1, b + 1) res = res * a;
return res;
}
int32_t main() {
IOS;
int w, h, x, y;
cin >> w >> h >> x >> y;
double area = (w * h) / 2;
cout << area << " ";
if (x == (double)w / 2 and y == (double)h / 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define pb push_back
#define ff first
#define ss second
#define fr(i, j, k) for (int i = j; i < k; i++)
#define rf(i, j, k) for (int i = j; i >= k; i--)
#define int long long
#define ld long double
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mp make_pair
#define inf INT_MAX
#define read_file() \
; \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int mod = 2019;
const ld pi = acos(-1);
const int Maxn = 105;
template <class T> ostream &operator<<(ostream &out, vector<T> &A) {
for (auto x : A)
out << x << " ";
return out;
}
template <class T> ostream &operator<<(ostream &out, set<T> &A) {
for (auto x : A)
out << x << " ";
return out;
}
template <class T1, class T2> T1 powr(T1 a, T2 b) {
T1 res = 1;
fr(i, 1, b + 1) res = res * a;
return res;
}
int32_t main() {
IOS;
int w, h, x, y;
cin >> w >> h >> x >> y;
double area = (double)(w * h) / 2;
cout << area << " ";
if (x == (double)w / 2 and y == (double)h / 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| [
"type_conversion.add"
] | 815,918 | 815,919 | u559021558 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = (double)(w * h / 2);
int i;
if (x * 2 == w && y * 2 == h)
i = 1;
else
i = 0;
cout << ans << " " << i;
} | #include <iostream>
using namespace std;
int main() {
long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)(w * h) / 2;
int i;
if (x * 2 == w && y * 2 == h)
i = 1;
else
i = 0;
cout << ans << " " << i;
} | [
"variable_declaration.type.primitive.change"
] | 815,929 | 815,925 | u523698212 | cpp |
p03001 | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
long long int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
bool a = 2 * x == W;
bool b = 2 * y == H;
if (a & b)
cout << 1 << endl;
else
cout << 0 << endl;
} | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
long long int W, H, x, y;
cin >> W >> H >> x >> y;
cout << double(W * H) / 2 << " ";
bool a = 2 * x == W;
bool b = 2 * y == H;
if (a & b)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"call.add",
"call.arguments.change"
] | 815,932 | 815,933 | u756217855 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int multiCheck = 1;
if (x == w / 2 && y == h / 2) {
multiCheck = 0;
}
cout << (double)(w * h) / 2 << " " << multiCheck;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int multiCheck = 0;
if (x == w / 2 && y == h / 2) {
multiCheck = 1;
}
cout << (double)(w * h) / 2 << " " << multiCheck;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 815,943 | 815,944 | u621271566 | cpp |
p03001 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll; // 10^18
typedef unsigned long ul;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
//#define and &&
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (int i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (int i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (int i = m; i < n; i++) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
template <typename T, typename U> vector<U> INV(T n) {
vector<U> v(n);
REP(i, n) cin >> v[i];
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
template <typename T> ll bs(vector<ll> &v, T key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
template <typename T, typename U> U gcd(T a, T b) {
if (a < b)
swap(a, b);
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 素数判定
template <typename T> bool is_prime(T n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
template <typename T> vector<ll> prime_factorization(T n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
//
void dinamic_programming(void) {}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll a, b, x, y;
cin >> a >> b >> x >> y;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
// 文字列取得
// string s;
// cin >> s;
//
// 実装部分
//
double ans = (a * b) / 2.0;
int aaa = 0;
if (x == a / 2 && y == b / 2)
aaa = 1;
//
// 実装部分おわり
//
// 解答出力
// MSG(ans);
printf("%lf %d", ans, aaa);
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll; // 10^18
typedef unsigned long ul;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
//#define and &&
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (int i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (int i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (int i = m; i < n; i++) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
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;
}
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
template <typename T, typename U> vector<U> INV(T n) {
vector<U> v(n);
REP(i, n) cin >> v[i];
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
template <typename T> ll bs(vector<ll> &v, T key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
template <typename T, typename U> U gcd(T a, T b) {
if (a < b)
swap(a, b);
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 素数判定
template <typename T> bool is_prime(T n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
template <typename T> vector<ll> prime_factorization(T n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
//
void dinamic_programming(void) {}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
long double a, b, x, y;
cin >> a >> b >> x >> y;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
// 文字列取得
// string s;
// cin >> s;
//
// 実装部分
//
long double ans = (a * b) / 2.0;
int aaa = 0;
if (x == a / 2 && y == b / 2)
aaa = 1;
//
// 実装部分おわり
//
// 解答出力
// MSG(ans);
printf("%llf %d", ans, aaa);
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,947 | 815,948 | u337845373 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int jud = 0;
double s = (double)w * h / 2;
if (x == w / 2 && y == h / 2)
jud = 1;
cout << (double)s << " " << jud << "\n";
} | #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
bool jud = 0;
double s = (double)w * h / 2;
if (x == w / 2 && y == h / 2)
jud = 1;
cout << (double)s << " " << jud << "\n";
} | [
"variable_declaration.type.primitive.change"
] | 815,953 | 815,954 | u568501780 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, w, h;
cin >> W >> H >> w >> h;
cout << W * H / 2 << " ";
if (w * 2 == W && h * 2 == H) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double W, H, w, h;
cin >> W >> H >> w >> h;
cout << W * H / 2 << " ";
if (w * 2 == W && h * 2 == H) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 815,957 | 815,958 | u927572682 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H;
int x, y;
cin >> W >> H >> x >> y;
int ans = W * H / 2;
cout << ans << " " << (x * 2 == W && y * 2 == H ? 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H;
int x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
cout << ans << " " << (x * 2 == W && y * 2 == H ? 1 : 0) << endl;
} | [
"variable_declaration.type.primitive.change"
] | 815,960 | 815,961 | u267265758 | cpp |
p03001 | #include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
bool b = (w / 2 == x) && (h / 2 == y);
cout << w * h / 2.0 << ' ' << b;
//(w == x || h == y || b ? 1 : 0);
}
| #include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
bool b = (w / 2.0 == x) && (h / 2.0 == y);
cout << w * h / 2.0 << ' ' << b;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 815,966 | 815,967 | u505466816 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double H, W, x, y;
cin >> W >> H >> x >> y;
cout << x * y / 2 << " ";
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double H, W, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
return 0;
} else {
cout << 0 << endl;
}
} | [
"identifier.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 815,971 | 815,972 | u690326065 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long w, h, x, y, p;
long double s;
cin >> w >> h >> x >> y;
s = w * h * 0.5;
if ((x * 2 == w) || (y * 2 == h))
p = 1;
else
p = 0;
cout << setprecision(10) << fixed << s << " " << p << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long w, h, x, y, p;
long double s;
cin >> w >> h >> x >> y;
s = w * h * 0.5;
if ((x * 2 == w) && (y * 2 == h))
p = 1;
else
p = 0;
cout << setprecision(12) << fixed << s << " " << p << "\n";
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 815,973 | 815,974 | u696290869 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) \
SORT(c); \
REVERSE(c)
#define ALL(x) (x).begin(), (x).end()
#define INF 1e9
const long long MOD = 1000000007;
typedef long long ll;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
if (x == W / 2 && y == H / 2)
ans = 1;
cout << W * H / 2 << " " << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) \
SORT(c); \
REVERSE(c)
#define ALL(x) (x).begin(), (x).end()
#define INF 1e9
const long long MOD = 1000000007;
typedef long long ll;
int main() {
double W, H;
ll x, y;
cin >> W >> H >> x >> y;
int ans = 0;
if (x == W / 2 && y == H / 2)
ans = 1;
cout << W * H / 2 << " " << ans << endl;
} | [
"variable_declaration.type.change"
] | 815,980 | 815,981 | u615258936 | cpp |
p03001 | #include <algorithm>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define IN(n) (cin >> n)
#define OUT(n) (cout << n << "\n")
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
using ll = long long;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
void Main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
long double ans = W * H / 2.0;
if (x == W / 2 && y == H / 2)
cout << ans << " 1" << endl;
else
cout << ans << " 0" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(15);
std::cout << std::fixed << std::setprecision(6);
Main();
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define IN(n) (cin >> n)
#define OUT(n) (cout << n << "\n")
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
using ll = long long;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
void Main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
long double ans = W * H / 2.0;
if (x == W / 2.0 && y == H / 2.0)
cout << ans << " 1" << endl;
else
cout << ans << " 0" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(15);
std::cout << std::fixed << std::setprecision(6);
Main();
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,988 | 815,989 | u431929942 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
cout << w * h / 2 << " " << 1 << endl;
return 0;
} else if (w / 2 == x || h / 2 == y) {
cout << w * h / 2 << " " << 0 << endl;
return 0;
} else
cout << w * h / 2 << " " << 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
cout << w * h / 2 << " " << 1 << endl;
return 0;
} else if (w / 2 == x || h / 2 == y) {
cout << w * h / 2 << " " << 0 << endl;
return 0;
} else
cout << w * h / 2 << " " << 0 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 816,000 | 816,001 | u902149880 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define countof(a) (sizeof(a) / sizeof((a)[0]))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) begin(a), end(a)
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " " << ((x * 2 == W && y * 2 == H / 2) ? 1 : 0)
<< endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define countof(a) (sizeof(a) / sizeof((a)[0]))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) begin(a), end(a)
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " " << ((x * 2 == W && y * 2 == H) ? 1 : 0) << endl;
}
| [
"expression.operation.binary.remove"
] | 816,008 | 816,009 | u167988719 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = w * h / 2;
int flag = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (x * 2 == w || y * 2 == h) {
flag = 1;
} else {
flag = 0;
}
} else {
flag = 0;
}
printf("%lf %d\n", ans, flag);
}
| #include <iostream>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = (double)w * h / 2;
int flag = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (x * 2 == w && y * 2 == h) {
flag = 1;
} else {
flag = 0;
}
} else {
flag = 0;
}
printf("%lf %d\n", ans, flag);
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 816,019 | 816,020 | u632679464 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = w * h / 2;
int flag = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (x * 2 == w && y * 2 == h) {
flag = 1;
} else {
flag = 0;
}
} else {
flag = 0;
}
printf("%lf %d\n", ans, flag);
}
| #include <iostream>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = (double)w * h / 2;
int flag = 0;
if (w % 2 == 0 && h % 2 == 0) {
if (x * 2 == w && y * 2 == h) {
flag = 1;
} else {
flag = 0;
}
} else {
flag = 0;
}
printf("%lf %d\n", ans, flag);
}
| [
"type_conversion.add"
] | 816,021 | 816,020 | u632679464 | cpp |
p03001 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
double S = (W) * (H) / 2;
if (W == 2 * x && H == 2 * y)
ans = 1;
cout << fixed << setprecision(10) << S << " " << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
double S = (double)(W)*H / 2;
if (W == 2 * x && H == 2 * y)
ans = 1;
cout << fixed << setprecision(10) << S << " " << ans << endl;
}
| [
"type_conversion.add"
] | 816,023 | 816,024 | u355371431 | cpp |
p03001 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
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;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void fprint() { std::cout << '\n'; }
template <class H, class... T> void fprint(H &&head, T &&...args) {
std::cout << std::fixed << std::setprecision(10) << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
fprint(std::forward<T>(args)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int ok = (2 * x == H && 2 * y == W) ? 1 : 0;
fprint(ans, ok);
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
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;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void fprint() { std::cout << '\n'; }
template <class H, class... T> void fprint(H &&head, T &&...args) {
std::cout << std::fixed << std::setprecision(10) << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
fprint(std::forward<T>(args)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double)W * H / 2;
int ok = (2 * x == W && 2 * y == H) ? 1 : 0;
fprint(ans, ok);
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 816,027 | 816,028 | u324303263 | cpp |
p03001 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
#define INF32 1'050'000'000
#define INF64 4'000'000'000'000'000'000
using ll = long long;
using namespace std;
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;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
std::cout << setprecision(9) << (double)W * H / 2 << ' ';
if (2 * x == W && 2 * y == H) {
std::cout << 0 << '\n';
} else {
std::cout << 1 << '\n';
}
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
#define INF32 1'050'000'000
#define INF64 4'000'000'000'000'000'000
using ll = long long;
using namespace std;
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;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
std::cout << setprecision(10) << (double)W * H / 2 << ' ';
if (2 * x == W && 2 * y == H) {
std::cout << 1 << '\n';
} else {
std::cout << 0 << '\n';
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 816,029 | 816,030 | u324303263 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b / 2 << ' ' << (a == 2 * c && b == 2 * d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b / 2.0 << ' ' << (a == 2 * c && b == 2 * d) << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 816,033 | 816,034 | u993619636 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b / c << ' ' << (a == 2 * c && b == 2 * d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b / 2.0 << ' ' << (a == 2 * c && b == 2 * d) << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 816,035 | 816,034 | u993619636 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV;
#define INF (int)(1e9 + 1)
#define MAXX (int)1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.begin(), a.end(), greater<int>()
#define PRALL(a) a.begin(), a.end(), greater<pair<int, int>>()
#define ROT(a) a.begin(), a.begin() + 1, a.end()
#define RROT(a) a.begin(), a.end() - 1, a.end()
#define PB push_back
#define MP make_pair
#define PI acos(-1.0)
// printf("myco\n");//for debug
/*--------------------------------------------*/
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2.0;
bool ans = false;
if (x == w / 2 && y == h / 2)
ans = true;
printf("%.10f %d", s, ans);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV;
#define INF (int)(1e9 + 1)
#define MAXX (int)1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.begin(), a.end(), greater<int>()
#define PRALL(a) a.begin(), a.end(), greater<pair<int, int>>()
#define ROT(a) a.begin(), a.begin() + 1, a.end()
#define RROT(a) a.begin(), a.end() - 1, a.end()
#define PB push_back
#define MP make_pair
#define PI acos(-1.0)
// printf("myco\n");//for debug
/*--------------------------------------------*/
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2.0;
bool ans = false;
if (x == w / 2.0 && y == h / 2.0)
ans = true;
printf("%.10f %d", s, ans);
}
| [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 816,040 | 816,039 | u745562814 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
bool can = 0;
if (x == (W / 2) && y == (H / 2)) {
bool can = 1;
}
cout << (double)(W * H) / 2 << " " << can << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
bool can = 0;
if (x == (W / 2) && y == (H / 2)) {
can = 1;
}
cout << (double)(W * H) / 2 << " " << can << endl;
}
| [] | 816,041 | 816,042 | u841131859 | cpp |
p03001 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w == 2 * x && h == 2 * y)
cout << 1;
else
cout << 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w == 2 * x && h == 2 * y)
cout << 1;
else
cout << 0;
}
| [
"variable_declaration.type.change"
] | 816,043 | 816,044 | u552847961 | cpp |
p03001 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w == 2 * x && h == 2 * y)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w == 2 * x && h == 2 * y)
cout << 1;
else
cout << 0;
}
| [
"variable_declaration.type.primitive.change"
] | 816,045 | 816,044 | u552847961 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, a, b, c;
cin >> w >> h >> a >> c;
printf("%.9lf ", (w * h) / 2);
if (a * 2 == w && b * 2 == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, a, b, c;
cin >> w >> h >> a >> c;
printf("%.9lf ", (w * h) / 2);
if (a * 2 == w && c * 2 == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 816,048 | 816,049 | u464110417 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, a, b, c;
cin >> w >> h >> a >> c;
printf("%.9lf ", (w * h) / 2);
if (x * 2 == w && y * 2 == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, a, b, c;
cin >> w >> h >> a >> c;
printf("%.9lf ", (w * h) / 2);
if (a * 2 == w && c * 2 == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 816,050 | 816,049 | u464110417 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
double cal;
cal = w * h / 2.0;
cout << cal << " ";
if (x == w / 2 && y == h / 2) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
double w, h, x, y;
cin >> w >> h >> x >> y;
double cal;
cal = w * h / 2.0;
cout << cal << " ";
if (x == w / 2.0 && y == h / 2.0) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 816,056 | 816,057 | u905170328 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y, ans;
cin >> w >> h >> x >> y;
cout << double(w * h / 2) << ' ' << (2 * x == w && 2 * y == h) ? 1 : 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y, ans;
cin >> w >> h >> x >> y;
cout << double(w) * double(h) / 2.0 << ' ' << (2 * x == w && 2 * y == h) ? 1
: 0;
} | [
"expression.operation.binary.remove"
] | 816,058 | 816,059 | u451256159 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H;
cin >> W >> H;
int x, y;
cin >> x >> y;
int64_t S = W * H;
double harf = S / 2;
cout << fixed << setprecision(10);
cout << harf << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H;
cin >> W >> H;
int x, y;
cin >> x >> y;
double S = W * H;
double harf = S / 2;
cout << fixed << setprecision(15);
cout << harf << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 816,064 | 816,065 | u206868454 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, x, y;
cin >> h >> w >> x >> y;
long long ans = h * w / 2.0;
cout << ans;
if (2 * x == h && 2 * y == w) {
cout << ' ' << 1;
} else {
cout << ' ' << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double h, w, x, y;
cin >> h >> w >> x >> y;
auto ans = h * w / 2.0;
cout << ans;
if (2 * x == h && 2 * y == w) {
cout << ' ' << 1;
} else {
cout << ' ' << 0;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 816,068 | 816,069 | u885523920 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = !(x == w / 2.0 && y == h / 2.0);
printf("%.10lf %d", w * h / 2, ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = x == w / 2.0 && y == h / 2.0;
printf("%.10lf %d", w * h / 2, ans);
return 0;
} | [] | 816,073 | 816,074 | u026620445 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
int z;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
z = 1;
}
cout << w * h / 2 << " " << z;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
int z = 0;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
z = 1;
}
cout << w * h / 2 << " " << z;
return 0;
} | [
"variable_declaration.value.change"
] | 816,075 | 816,076 | u670391281 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2.0 << " ";
if (x == w / 2 && y == h / 2) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2.0 << " ";
if (x == w / 2.0 && y == h / 2.0) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 816,077 | 816,078 | u448407332 | cpp |
p03001 | #include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int acs(const void *a, const void *b) {
return *(int *)a - *(int *)b;
} /* 1,2,3,4.. */
int des(const void *a, const void *b) {
return *(int *)b - *(int *)a;
} /* 8,7,6,5.. */
int cmp_char(const void *a, const void *b) {
return *(char *)a - *(char *)b;
} /* a,b,c,d.. */
int cmp_str(const void *a, const void *b) {
return strcmp(*(const char **)a, *(const char **)b);
} /* aaa,aab.. */
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int w, h, x, y;
scanf("%d %d %d %d", &w, &h, &x, &y);
printf("%lf %d\n", (double)w * (double)h / 2.0, 2 * x == w && 2 * h == y);
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int acs(const void *a, const void *b) {
return *(int *)a - *(int *)b;
} /* 1,2,3,4.. */
int des(const void *a, const void *b) {
return *(int *)b - *(int *)a;
} /* 8,7,6,5.. */
int cmp_char(const void *a, const void *b) {
return *(char *)a - *(char *)b;
} /* a,b,c,d.. */
int cmp_str(const void *a, const void *b) {
return strcmp(*(const char **)a, *(const char **)b);
} /* aaa,aab.. */
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int w, h, x, y;
scanf("%d %d %d %d", &w, &h, &x, &y);
printf("%lf %d\n", (double)w * (double)h / 2.0, 2 * x == w && 2 * y == h);
return 0;
}
| [
"expression.operation.binary.remove"
] | 816,088 | 816,089 | u391667116 | cpp |
p03001 | /******************************\
* Everyone has a different way of thinking, so God Created us
Hope You Respect My Way..,Thank You ): *
* *
* Created by : Mo_Murad *
\******************************/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pi 3.1415926536
#define forn(i, a, b) for (int i = a; i < b; i++)
#define LL long long
#define ULL unsigned long long
#define MP make_pair
#define SZ(c) int(c.size())
#define ff first
#define ss second
#define INF INT32_MAX
#define _INF INT32_MIN
#define PQ priority_queue
#define MM multimap
#define PB push_back
#define vii vector<int>
#define ipair pair<int, int>
#define lpair pair<LL, LL>
#define MAXN 100004
#define El3zba \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define modd 1000000007
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define endl '\n'
// std::transform(s1.begin(), s1.end(), s1.begin(),::tolower);
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
LL MMIN(LL a, LL b) {
if (a <= b)
return a;
else
return b;
}
LL MMAX(LL a, LL b) {
if (a >= b)
return a;
else
return b;
}
float Euclidean(LL x1, LL x2, LL y1, LL y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
LL gcd(LL a, LL b) {
LL c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
int LCM(int a, int b) { return (a * b) / gcd(a, b); }
void PrimeFactor(LL n) {
while (n % 2 == 0) {
printf("%d ", 2);
n /= 2;
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
printf("%d ", i);
n /= i;
}
}
if (n > 2)
printf("%d ", n);
}
bool is_square(LL x) {
LL l = 0, r = x;
while (l <= r) {
LL mid = l + (r - l) / 2;
if (mid * mid == x)
return true;
if (mid * mid > x)
r = mid - 1;
else
l = mid + 1;
}
return false;
}
bool is_Prime(int x) {
if (x == 2)
return 1;
else if (x % 2 == 0 || x < 2)
return 0;
for (int i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
void dijjkstra(int src, int n) {
list<ipair> adj[1000005];
vector<bool> visited(1000005, false);
vector<int> dis(1000005, 1e9);
PQ<ipair, vector<ipair>, greater<ipair>> pq;
pq.push(MP(0, 1));
dis[src] = 0;
while (!pq.empty()) {
int u = pq.top().ss;
visited[u] = true;
pq.pop();
list<ipair>::iterator i;
for (i = adj[u].begin(); i != adj[u].end(); i++) {
int v = i->ff;
int we = i->ss;
if (!visited[v] && dis[v] > dis[u] + we) {
dis[v] = dis[u] + we;
pq.push(MP(dis[v], v));
}
}
}
}
int main() {
El3zba;
/*** بسم الله الرحمن الرحيم ***/
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
bool ok = 0;
double xx = w / 2.0;
double yy = h / 2.0;
double ar = (w * h) / 2.0;
if (xx == yy)
cout << ar << " " << 1 << endl;
else
cout << ar << " " << 0 << endl;
return 0;
} | /******************************\
* Everyone has a different way of thinking, so God Created us
Hope You Respect My Way..,Thank You ): *
* *
* Created by : Mo_Murad *
\******************************/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pi 3.1415926536
#define forn(i, a, b) for (int i = a; i < b; i++)
#define LL long long
#define ULL unsigned long long
#define MP make_pair
#define SZ(c) int(c.size())
#define ff first
#define ss second
#define INF INT32_MAX
#define _INF INT32_MIN
#define PQ priority_queue
#define MM multimap
#define PB push_back
#define vii vector<int>
#define ipair pair<int, int>
#define lpair pair<LL, LL>
#define MAXN 100004
#define El3zba \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define modd 1000000007
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define endl '\n'
// std::transform(s1.begin(), s1.end(), s1.begin(),::tolower);
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
LL MMIN(LL a, LL b) {
if (a <= b)
return a;
else
return b;
}
LL MMAX(LL a, LL b) {
if (a >= b)
return a;
else
return b;
}
float Euclidean(LL x1, LL x2, LL y1, LL y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
LL gcd(LL a, LL b) {
LL c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
int LCM(int a, int b) { return (a * b) / gcd(a, b); }
void PrimeFactor(LL n) {
while (n % 2 == 0) {
printf("%d ", 2);
n /= 2;
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
printf("%d ", i);
n /= i;
}
}
if (n > 2)
printf("%d ", n);
}
bool is_square(LL x) {
LL l = 0, r = x;
while (l <= r) {
LL mid = l + (r - l) / 2;
if (mid * mid == x)
return true;
if (mid * mid > x)
r = mid - 1;
else
l = mid + 1;
}
return false;
}
bool is_Prime(int x) {
if (x == 2)
return 1;
else if (x % 2 == 0 || x < 2)
return 0;
for (int i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
void dijjkstra(int src, int n) {
list<ipair> adj[1000005];
vector<bool> visited(1000005, false);
vector<int> dis(1000005, 1e9);
PQ<ipair, vector<ipair>, greater<ipair>> pq;
pq.push(MP(0, 1));
dis[src] = 0;
while (!pq.empty()) {
int u = pq.top().ss;
visited[u] = true;
pq.pop();
list<ipair>::iterator i;
for (i = adj[u].begin(); i != adj[u].end(); i++) {
int v = i->ff;
int we = i->ss;
if (!visited[v] && dis[v] > dis[u] + we) {
dis[v] = dis[u] + we;
pq.push(MP(dis[v], v));
}
}
}
}
int main() {
El3zba;
/*** بسم الله الرحمن الرحيم ***/
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
bool ok = 0;
double xx = w / 2.0;
double yy = h / 2.0;
double ar = (w * h) / 2.0;
if (x == xx && y == yy)
cout << ar << " " << 1 << endl;
else
cout << ar << " " << 0 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 816,090 | 816,091 | u720420025 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10);
cout << W * H / 2 << " ";
if (x * 2 == W && y * 2 == H)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10);
cout << (double)W * H / 2 << " ";
if (x * 2 == W && y * 2 == H)
cout << 1;
else
cout << 0;
} | [
"type_conversion.add"
] | 816,102 | 816,103 | u009870106 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 816,106 | 816,107 | u272916418 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
double area = (W * H) / 2.0;
bool flag;
if ((x == W / 2) && (y == H / 2)) {
flag = true;
} else {
flag = false;
}
cout << fixed << setprecision(6);
cout << area << " " << flag << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
double area = (W * H) / 2.0;
bool flag;
if ((x == W / 2.0) && (y == H / 2.0)) {
flag = true;
} else {
flag = false;
}
cout << fixed << setprecision(6);
cout << area << " " << flag << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 816,108 | 816,109 | u030246664 | cpp |
p03001 | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
if (x == (double)w / 2 && y == (double)h / 2) {
cout << ans << " " << 1 << endl;
} else {
cout << ans << " " << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * (double)h / 2;
if (x == (double)w / 2 && y == (double)h / 2) {
cout << ans << " " << 1 << endl;
} else {
cout << ans << " " << 0 << endl;
}
return 0;
}
| [
"type_conversion.add"
] | 816,117 | 816,118 | u374190629 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
long long W, H;
int x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " ";
if (x == 0 || y == 0 || x == W || y == H || x == W / 2.0 || y == H / 2.0) {
if ((x == W / 2.0) && (y == H / 2.0)) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} else {
cout << 1 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
long long W, H;
int x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " ";
if (x == 0 || y == 0 || x == W || y == H || x == W / 2.0 || y == H / 2.0) {
if ((x == W / 2.0) && (y == H / 2.0)) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} else {
cout << 0 << endl;
}
} | [
"literal.number.change",
"io.output.change"
] | 816,124 | 816,125 | u398221039 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define N 100001
using namespace std;
int main() {
IOS;
cout.precision(30);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << (w * h) / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << "1";
else
cout << "0";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define N 100001
using namespace std;
int main() {
IOS;
cout.precision(30);
long double w, h, x, y;
cin >> w >> h >> x >> y;
cout << (w * h) / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << "1";
else
cout << "0";
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 816,128 | 816,129 | u266346465 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vvi = vector<vector<int>>;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
cout << x * y * 2 << " ";
if (a == x * 2 && b == y * 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vvi = vector<vector<int>>;
int main() {
double a, b, x, y;
cin >> a >> b >> x >> y;
cout << a * b / 2 << " ";
if (a == x * 2 && b == y * 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| [
"variable_declaration.type.primitive.change",
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 816,130 | 816,131 | u422633119 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (w == 2 * x && h == 2 * y) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
cout << double(w * h) / 2 << " " << (w == 2 * x && h == 2 * y) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 816,144 | 816,145 | u596200441 | cpp |
p03001 | /*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll W, H, X, Y;
int main() {
scanf("%lld %lld %lld %lld", &W, &H, &X, &Y);
double ans1 = (W * H) / 2;
ll ans2 = (X * 2 == W && Y * 2 == H) ? 1 : 0;
printf("%0.12lf %lld\n", ans1, ans2);
return 0;
}
/*
Powered by Buggy Plugin
*/
| /*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll W, H, X, Y;
int main() {
scanf("%lld %lld %lld %lld", &W, &H, &X, &Y);
double ans1 = (W * H) / 2.0;
ll ans2 = (X * 2 == W && Y * 2 == H) ? 1 : 0;
printf("%0.12lf %lld\n", ans1, ans2);
return 0;
}
/*
Powered by Buggy Plugin
*/
| [
"literal.number.change",
"expression.operation.binary.change"
] | 816,162 | 816,163 | u428267713 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = 1.0 * w * h / 2;
bool cond1 = w % 2 == 0 && x == w / 2;
bool cond2 = h % 2 == 0 && y == h / 2;
if (cond1 && cond2) {
cout << std::setprecision(10) << s << " " << 0 << endl;
} else {
cout << std::setprecision(10) << s << " " << 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = 1.0 * w * h / 2;
bool cond1 = w % 2 == 0 && x == w / 2;
bool cond2 = h % 2 == 0 && y == h / 2;
if (cond1 && cond2) {
cout << std::setprecision(10) << s << " " << 1 << endl;
} else {
cout << std::setprecision(10) << s << " " << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 816,169 | 816,170 | u592686932 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = 1.0 * w * h / 2;
bool cond1 = w % 2 == 0 && x == w / 2;
bool cond2 = h % 2 == 0 && y == h / 2;
if (cond1 xor cond2) {
cout << std::setprecision(10) << s << " " << 0 << endl;
} else {
cout << std::setprecision(10) << s << " " << 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double s = 1.0 * w * h / 2;
bool cond1 = w % 2 == 0 && x == w / 2;
bool cond2 = h % 2 == 0 && y == h / 2;
if (cond1 && cond2) {
cout << std::setprecision(10) << s << " " << 1 << endl;
} else {
cout << std::setprecision(10) << s << " " << 0 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 816,171 | 816,170 | u592686932 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10%d\n", ans, num);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 816,172 | 816,173 | u006721330 | cpp |
p03001 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define in insert
#define sz(v) v.size()
#define mina(a, b) (a) = min((a), (b));
#define maxa(a, b) (a) = max((a), (b));
const int INF = 1e9 + 5;
void solve() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
int b = 0;
if (x == W / 2 && y == H / 2)
b = 1;
double ans = W * H / 2;
cout << setprecision(6) << fixed << ans;
cout << " " << b;
}
int main() {
int T = 1;
// cin>>T;
for (int i = 0; i < T; i++)
solve();
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define in insert
#define sz(v) v.size()
#define mina(a, b) (a) = min((a), (b));
#define maxa(a, b) (a) = max((a), (b));
const int INF = 1e9 + 5;
void solve() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int b = 0;
if (x == W / 2 && y == H / 2)
b = 1;
double ans = W * H / 2;
cout << setprecision(6) << fixed << ans;
cout << " " << b;
}
int main() {
int T = 1;
// cin>>T;
for (int i = 0; i < T; i++)
solve();
} | [
"variable_declaration.type.change"
] | 816,189 | 816,190 | u562206657 | cpp |
p03001 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ull Pow(ull a, ull b) {
if (b == 0)
return 1;
ull c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
ll countDivisibles(ll A, ll B, ll M) {
// Add 1 explicitly as A is divisible by M
if (A % M == 0)
return (B / M) - (A / M) + 1;
// A is not divisible by M
return (B / M) - (A / M);
}
int main() {
IOS;
cout.precision(30);
long double w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 || y == h / 2)
cout << (w * h) / 2 << " " << 1 << endl;
else
cout << (w * h) / 2 << " " << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ull Pow(ull a, ull b) {
if (b == 0)
return 1;
ull c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
ll countDivisibles(ll A, ll B, ll M) {
// Add 1 explicitly as A is divisible by M
if (A % M == 0)
return (B / M) - (A / M) + 1;
// A is not divisible by M
return (B / M) - (A / M);
}
int main() {
IOS;
cout.precision(30);
long double w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2)
cout << (w * h) / 2 << " " << 1 << endl;
else
cout << (w * h) / 2 << " " << 0 << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 816,203 | 816,204 | u752814744 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll W, H, x, y;
cin >> W >> H >> x >> y;
ll area = W * H;
cout << fixed << setprecision(6) << (double)(area / 2) << " ";
if (x == W / 2 && y == H / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll W, H, x, y;
cin >> W >> H >> x >> y;
ll area = W * H;
cout << fixed << setprecision(6) << (double)(area / 2.0) << " ";
if (x == W / 2.0 && y == H / 2.0) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 816,215 | 816,216 | u413207096 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define sf(n) scanf("%d", &n)
#define pd(n) printf("%.12lf", n)
#define pf(n) printf("%d", n)
#define p() printf("\n")
#define ps() printf(" ")
#define ll long long
#define ull unsigned long long
#define MAX 1e9
#define mod 1000 * 1000 * 1000 + 7
#define ex 1e18
#define dbl 2e09
#define qu(q) queue<int> q
#define pqu(q) priority_queue<int> q
#define len(s) s.length()
#define sz(x) int(x.size())
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define clr(x) x.clear()
#define LOG(x) std::cout << x << std::endl;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int a[100005], b[100005];
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
printf("%.6f", ans);
cout << " ";
if (w / 2 == x and h / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sf(n) scanf("%d", &n)
#define pd(n) printf("%.12lf", n)
#define pf(n) printf("%d", n)
#define p() printf("\n")
#define ps() printf(" ")
#define ll long long
#define ull unsigned long long
#define MAX 1e9
#define mod 1000 * 1000 * 1000 + 7
#define ex 1e18
#define dbl 2e09
#define qu(q) queue<int> q
#define pqu(q) priority_queue<int> q
#define len(s) s.length()
#define sz(x) int(x.size())
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define clr(x) x.clear()
#define LOG(x) std::cout << x << std::endl;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int a[100005], b[100005];
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
printf("%.6f", ans);
cout << " ";
if (w / 2 == x and h / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 816,217 | 816,218 | u681568668 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define sf(n) scanf("%d", &n)
#define pd(n) printf("%.12lf", n)
#define pf(n) printf("%d", n)
#define p() printf("\n")
#define ps() printf(" ")
#define ll long long
#define ull unsigned long long
#define MAX 1e9
#define mod 1000 * 1000 * 1000 + 7
#define ex 1e18
#define dbl 2e09
#define qu(q) queue<int> q
#define pqu(q) priority_queue<int> q
#define len(s) s.length()
#define sz(x) int(x.size())
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define clr(x) x.clear()
#define LOG(x) std::cout << x << std::endl;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int a[100005], b[100005];
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
printf("%.10f", ans);
cout << " ";
if (w / 2 == x and h / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sf(n) scanf("%d", &n)
#define pd(n) printf("%.12lf", n)
#define pf(n) printf("%d", n)
#define p() printf("\n")
#define ps() printf(" ")
#define ll long long
#define ull unsigned long long
#define MAX 1e9
#define mod 1000 * 1000 * 1000 + 7
#define ex 1e18
#define dbl 2e09
#define qu(q) queue<int> q
#define pqu(q) priority_queue<int> q
#define len(s) s.length()
#define sz(x) int(x.size())
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define clr(x) x.clear()
#define LOG(x) std::cout << x << std::endl;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int a[100005], b[100005];
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
printf("%.6f", ans);
cout << " ";
if (w / 2 == x and h / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 816,219 | 816,218 | u681568668 | cpp |
p03001 | // templates
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define sort_key(struct_name, key_name) \
[](const struct_name &x, const struct_name &y) { \
return x.key_name < y.key_name; \
}
#define pb(x) push_back(x)
typedef long long ll;
using namespace std;
// main
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
int judge;
if (W / 2 == x && H / 2 == y)
judge = 1;
else
judge = 0;
cout << W * H / 2 << " " << judge << endl;
}
| // templates
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define sort_key(struct_name, key_name) \
[](const struct_name &x, const struct_name &y) { \
return x.key_name < y.key_name; \
}
#define pb(x) push_back(x)
typedef long long ll;
using namespace std;
// main
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int judge;
if (W / 2 == x && H / 2 == y)
judge = 1;
else
judge = 0;
cout << W * H / 2 << " " << judge << endl;
}
| [
"variable_declaration.type.change"
] | 816,229 | 816,228 | u970738863 | cpp |
p03001 | #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 w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2) {
cout << "1" << endl;
} else {
cout << "0" << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 816,234 | 816,235 | u775556337 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int W, H, x, y, ans, other;
cin >> W >> H >> x >> y;
ans = 1.0 * W * H / 2;
if (x + x == W && y + y == H) {
other = 1;
} else {
other = 0;
}
cout << ans << " " << other << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int W, H, x, y, other;
cin >> W >> H >> x >> y;
long double ans = 1.0 * W * H / 2;
if (x + x == W && y + y == H) {
other = 1;
} else {
other = 0;
}
cout << ans << " " << other << endl;
return 0;
} | [
"variable_declaration.remove"
] | 816,238 | 816,239 | u992432716 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int W, H, x, y, ans, other;
cin >> W >> H >> x >> y;
ans = 1.0 * W * H / 2;
if (x + x == W && y + y == H) {
other = 1;
} else {
other = 0;
}
cout << ans << " " << other << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int W, H, x, y, other;
cin >> W >> H >> x >> y;
long double ans = 1.0 * W * H / 2;
if (x + x == W && y + y == H) {
other = 1;
} else {
other = 0;
}
cout << ans << " " << other << endl;
return 0;
} | [
"variable_declaration.remove"
] | 816,240 | 816,239 | u992432716 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll h_dash = h / 2;
ll w_dash = w / 2;
int flag = 0; //複数あるかどうかのflag
float S; //面積S
if (h_dash == y && w_dash == x)
flag = 1;
S = h * w / 2;
cout << S << " " << flag << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double h_dash = h / 2;
double w_dash = w / 2;
int flag = 0; //複数あるかどうかのflag
double S; //面積S
if (h_dash == y && w_dash == x)
flag = 1;
S = (h * w) / 2;
cout << S << " " << flag << endl;
} | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 816,243 | 816,242 | u397070717 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
long double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(16);
cout << ans << " " << X << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
long double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(16);
cout << ans << " " << X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 816,244 | 816,245 | u510383220 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
long double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(6);
cout << ans << " " << X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
long double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(16);
cout << ans << " " << X << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 816,246 | 816,245 | u510383220 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(6);
cout << ans << " " << X << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int X = 0;
long double ans = w * h / 2;
if (x == w / 2 && y == h / 2)
X = 1;
cout << fixed << setprecision(16);
cout << ans << " " << X << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 816,247 | 816,245 | u510383220 | cpp |
p03001 | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (w == x * 2 and h == y * 2) << endl;
return 0;
}
| // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << double(w * h) / 2 << " " << (w == x * 2 and h == y * 2) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 816,251 | 816,252 | u884379688 | cpp |
p03001 | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INTXT \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf());
#define INF 1e9
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007LL;
signed main() {
IOS ll w, h, x, y;
cin >> w >> h >> x >> y;
int z = (int)(2 * x == w) * (int)(2 * y == h);
cout << w * h / 2 << " " << z << endl;
}
| #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INTXT \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf());
#define INF 1e9
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007LL;
signed main() {
IOS ll w, h, x, y;
cin >> w >> h >> x >> y;
int z = (int)(2 * x == w) * (int)(2 * y == h);
cout << (double)(w * h) / 2 << " " << z << endl;
}
| [
"type_conversion.add"
] | 816,253 | 816,254 | u653807637 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
bool flg;
cin >> w >> h >> x >> y;
flg = (x == 0.5 * w) && (h == 0.5 * h);
cout << 0.5 * w * h << " " << flg << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
bool flg;
cin >> w >> h >> x >> y;
flg = (x == 0.5 * w) && (y == 0.5 * h);
cout << 0.5 * w * h << " " << flg << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 816,255 | 816,256 | u632628124 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
bool flg;
cin >> w >> h >> x >> y;
flg = (x == 0.5 * w) && (h == 0.5 * h);
cout << 0.5 * w * h << flg << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
bool flg;
cin >> w >> h >> x >> y;
flg = (x == 0.5 * w) && (y == 0.5 * h);
cout << 0.5 * w * h << " " << flg << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 816,257 | 816,256 | u632628124 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
int main() {
// 入力
double W, H, x, y;
cin >> W >> H >> x >> y;
// 解法
double ans = W * H / 2;
ll ans2 = 0;
if (W == x * 2 & H == y * 2)
ans = 1;
// 出力
cout << ans << " " << ans2 << endl;
}
| #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
int main() {
// 入力
double W, H, x, y;
cin >> W >> H >> x >> y;
// 解法
double ans = W * H / 2;
ll ans2 = 0;
if (W == x * 2 & H == y * 2)
ans2 = 1;
// 出力
cout << ans << " " << ans2 << endl;
}
| [
"assignment.variable.change",
"identifier.change"
] | 816,258 | 816,259 | u757738907 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << (W * H) / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
cout << 1;
} else {
cout << 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << double(W) * double(H) / 2 << " ";
if ((2 * x == W) && (2 * y == H)) {
cout << 1;
} else {
cout << 0;
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 816,262 | 816,263 | u098923136 | cpp |
p03001 | /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double N = (double)W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << N << ' ' << '1' << endl;
} else {
cout << N << ' ' << '0' << endl;
}
}
| /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double N = W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << N << ' ' << '1' << endl;
} else {
cout << N << ' ' << '0' << endl;
}
}
| [
"variable_declaration.type.primitive.change"
] | 816,279 | 816,280 | u955534952 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(10) << ((w * h) / 2) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(10) << ((w * h) / 2.0) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 816,285 | 816,286 | u987915219 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(6) << float((w * h) / 2) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(10) << ((w * h) / 2.0) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 816,287 | 816,286 | u987915219 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(6) << double((w * h) / 2) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long int w, h, x, y;
bool flag = false;
cin >> w >> h >> x >> y;
if ((x * 2 == w) and (y * 2 == h)) {
flag = true;
}
cout << fixed << setprecision(10) << ((w * h) / 2.0) << " ";
flag ? cout << 1 << endl : cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 816,288 | 816,286 | u987915219 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.