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 <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define eps 1e-9
using namespace std;
const int MAXN = 1e5 + 3;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int arr... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define eps 1e-9
using namespace std;
const int MAXN = 1e5 + 3;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int arr... | [
"variable_declaration.type.primitive.change"
] | 817,455 | 817,456 | u050253575 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define eps 1e-9
using namespace std;
const int MAXN = 1e5 + 3;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int arr... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define eps 1e-9
using namespace std;
const int MAXN = 1e5 + 3;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int arr... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 817,457 | 817,456 | u050253575 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = (double)w * h / 2.0;
printf("%.9f", ans);
if (x == (w / 2) && y == (h / 2))
c... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
ans = (double)w * h / 2.0;
printf("%.9f", ans);
if (x == (w / 2.0) && y == (h / 2.0))
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 817,468 | 817,469 | u902428263 | cpp |
p03001 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
int i, j, k;
struct edge {
int to;
int cost;
};
typedef long long ll;
using namespace std;
using P =... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
int i, j, k;
struct edge {
int to;
int cost;
};
typedef long long ll;
using namespace std;
using P =... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 817,476 | 817,477 | u753265117 | cpp |
p03001 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long w, h, x, y;
double answer;
cin >> w >> h >> x >> y;
answer = w * h / 2;
if ((double(w) / 2 == double(x)) && (double(h) / 2 == double(y))) {
cout << setprecision(10) << answer << " " << ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long w, h, x, y;
double answer;
cin >> w >> h >> x >> y;
answer = double(w * h) / 2;
if ((double(w) / 2 == double(x)) && (double(h) / 2 == double(y))) {
cout << setprecision(10) << answer <<... | [
"call.add",
"call.arguments.change"
] | 817,480 | 817,481 | u509936198 | cpp |
p03001 | /*
digu_J - Digvijay Janartha
NIT Hamirpur - INDIA
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_no... | /*
digu_J - Digvijay Janartha
NIT Hamirpur - INDIA
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_no... | [
"call.add",
"call.arguments.change"
] | 817,482 | 817,483 | u887604715 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << setprecision(20) << fixed;
ll W, H, X, Y;
cin >> W >> H >> X >> Y;
long double area = (W * H) / 2;
int ans = (2 * X == W && 2 * Y == H);
cout << area << ' ' <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << setprecision(20) << fixed;
ll W, H, X, Y;
cin >> W >> H >> X >> Y;
long double area = (W * H) / 2.0;
int ans = (2 * X == W && 2 * Y == H);
cout << area << ' ' ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,486 | 817,487 | u242534780 | cpp |
p03001 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
/* see https://github.com/pllk/cphb/ */
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
/* see https://github.com/pllk/cphb/ */
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,493 | 817,494 | u014617387 | cpp |
p03001 | #include <cstdio>
using ll = long long;
int main() {
ll w, h, x, y;
scanf("%lld%lld%lld%lld", &w, &h, &x, &y);
printf("%lld %d\n", w * h / 2, ((x * 2 == w) && (y * 2 == h)) ? 1 : 0);
return 0;
} | #include <cstdio>
using ll = long long;
int main() {
ll w, h, x, y;
scanf("%lld%lld%lld%lld", &w, &h, &x, &y);
printf("%.10lf %d\n", (double)w * h / 2,
((x * 2 == w) && (y * 2 == h)) ? 1 : 0);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,497 | 817,498 | u350561621 | cpp |
p03001 | #include <bits/stdc++.h>
#define ALL(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0, __##i##_length = (n); i < __##i##_length; i++)
#define rep_reverse(i, n) for (ll i = (n)-1; 0 <= i; i--)
#define FOR(i, from, to) \
for (ll i = (from), __##i##_end = (... | #include <bits/stdc++.h>
#define ALL(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0, __##i##_length = (n); i < __##i##_length; i++)
#define rep_reverse(i, n) for (ll i = (n)-1; 0 <= i; i--)
#define FOR(i, from, to) \
for (ll i = (from), __##i##_end = (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 817,506 | 817,507 | u040599127 | cpp |
p03001 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | [
"variable_declaration.type.change"
] | 817,510 | 817,511 | u088893297 | cpp |
p03001 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | [
"variable_declaration.type.change"
] | 817,512 | 817,511 | u088893297 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprec... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprec... | [
"literal.number.change",
"io.output.change"
] | 817,515 | 817,516 | u524343822 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::n... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::n... | [
"variable_declaration.type.widen.change"
] | 817,519 | 817,520 | u068362919 | cpp |
p03001 | #include <iostream>
using namespace std;
int main(void) {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
double ans2 = 0;
double ans1 = 0;
ans1 = W * H / 2;
if (W / 2 == x || H / 2 == y) {
ans2 = 1;
}
cout << ans1 << " " << ans2 << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
double ans2 = 0;
double ans1 = 0;
ans1 = W * H / 2;
if (W / 2 == x && H / 2 == y) {
ans2 = 1;
}
cout << ans1 << " " << ans2 << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,529 | 817,530 | u945452839 | cpp |
p03001 | #include <iostream>
using namespace std;
int main(void) {
double W, H;
long long x, y;
cin >> W >> H >> x >> y;
double ans2 = 0;
float ans1 = 0;
ans1 = W * H / 2;
if (W / 2 == x || H / 2 == y) {
ans2 = 1;
}
cout << ans1 << " " << ans2 << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
double ans2 = 0;
double ans1 = 0;
ans1 = W * H / 2;
if (W / 2 == x && H / 2 == y) {
ans2 = 1;
}
cout << ans1 << " " << ans2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,531 | 817,530 | u945452839 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | [
"variable_declaration.type.change"
] | 817,534 | 817,535 | u816800341 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
if (x == W / 2 && y == H / 2)
cout << ans << " " << 1;
else
cout << ans << " " << 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
if (x == W / 2 && y == H / 2)
cout << ans << " " << 1;
else
cout << ans << " " << 0;
} | [
"variable_declaration.type.primitive.change"
] | 817,542 | 817,543 | u582357587 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | [
"literal.number.change",
"io.output.change"
] | 817,546 | 817,545 | u764234894 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | [
"io.output.change"
] | 817,547 | 817,545 | u764234894 | cpp |
p03001 | #include "bits/stdc++.h"
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t W, H, x, y;
std::cin >> W >> H >> x >> y;
long double ans = W * H / 2;
bool exist = W == x * 2 && H == y * 2;
std::cout << std::fixed << std::setprecision(10) << ans << " " << exist
<< std:... | #include "bits/stdc++.h"
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t W, H, x, y;
std::cin >> W >> H >> x >> y;
long double ans = W * H / 2.0l;
bool exist = W == x * 2 && H == y * 2;
std::cout << std::fixed << std::setprecision(10) << ans << " " << exist
<< s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,550 | 817,551 | u264304509 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
cout << fixed << setprecision(12);
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans;
ans = w * h / 2;
cout << ans << " ";
if (x == w / 2 && y == h / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll double
int main() {
cout << fixed << setprecision(12);
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans;
ans = w * h / 2;
cout << ans << " ";
if (x == w / 2 && y == h / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"preprocessor.define.value.change"
] | 817,559 | 817,560 | u794565416 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
cout << fixed << setprecision(10);
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans;
ans = w * h / 2;
cout << ans << " ";
if (x == w / 2 && y == h / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll double
int main() {
cout << fixed << setprecision(12);
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans;
ans = w * h / 2;
cout << ans << " ";
if (x == w / 2 && y == h / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"preprocessor.define.value.change",
"literal.number.change",
"io.output.change"
] | 817,561 | 817,560 | u794565416 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
float res1 = W * H / 2;
cout << res1 << " " << re... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
double res1 = W * H / 2;
cout << res1 << " " ... | [
"variable_declaration.type.primitive.change"
] | 817,584 | 817,583 | u134857688 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
double res1 = W * H / 2;
cout << res1 << " " << r... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
double res1 = W * H / 2;
cout << res1 << " " ... | [
"variable_declaration.type.primitive.change"
] | 817,585 | 817,583 | u134857688 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
int res1 = W * H / 2;
cout << res1 << " " << res2... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int res2 = 0;
if (W / 2 == x && H / 2 == y) {
res2 = 1;
}
double res1 = W * H / 2;
cout << res1 << " " ... | [
"variable_declaration.type.primitive.change"
] | 817,586 | 817,583 | u134857688 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int a;
a = (w * h) / 2;
int b = 0;
if (x == w / 2 && y == h / 2) {
b = 1;
}
cout << a << " " << b << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double a;
a = (w * h) / 2;
int b = 0;
if (x == w / 2 && y == h / 2) {
b = 1;
}
cout << a << " " << b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 817,605 | 817,606 | u656568465 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
double W, H, x, y;
int main() {
cin >> W >> H ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
double W, H, x, y;
int main() {
cin >> W >> H ... | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 817,607 | 817,608 | u379710681 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int p;
if (x == W / 2 && y == H / 2)
p = 1;
else
p = 0;
cout << W * H / 2 << " " << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
int p;
if ((x == W / 2) && (y == H / 2))
p = 1;
else
p = 0;
cout << W * H / 2 << " " << p << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 817,648 | 817,649 | u013203292 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
ll c = 1;
if (w % 2 == 0) {
if (x == (w / 2)) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
ll c = 0;
if (w % 2 == 0) {
if (x == (w / 2)) {
c... | [
"literal.number.change",
"variable_declaration.value.change"
] | 817,655 | 817,656 | u482090956 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
ll c = 1;
if (w % 2 == 0) {
if (x == (w / 2)) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
ll c = 0;
if (w % 2 == 0) {
if (x == (w / 2)) {
c... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 817,657 | 817,656 | u482090956 | cpp |
p03001 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 817,664 | 817,665 | u135248164 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | [
"expression.operation.binary.remove"
] | 817,685 | 817,686 | u117734686 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"expression.operation.binary.change"
] | 817,687 | 817,686 | u117734686 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF INT_MAX >> 1 //要climits#includ
typedef long long ll;
usi... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,685 | 817,688 | u117734686 | cpp |
p03001 | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, m, x, y;
while (cin >> n >> m >> x >> y) {
ld ans = 0;
ans = n * m;
ans /= 2.0;
cout << fixed << setprecision(12) << ans << " ";
... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, m, x, y;
while (cin >> n >> m >> x >> y) {
ld ans = 0;
ans = n * m;
ans /= 2.0;
cout << fixed << setprecision(12) << ans << " ";
... | [
"literal.number.change",
"io.output.change"
] | 817,694 | 817,695 | u535523790 | cpp |
p03001 | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n, m, x, y;
while (cin >> n >> m >> x >> y) {
double ans = 0;
ans = n * m;
ans /= 2.0;
cout << fixed << setprecision(12) << ans << " ";... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, m, x, y;
while (cin >> n >> m >> x >> y) {
ld ans = 0;
ans = n * m;
ans /= 2.0;
cout << fixed << setprecision(12) << ans << " ";
... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 817,696 | 817,695 | u535523790 | cpp |
p03001 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << ' ' << ((W / 2 == x && H / 2 == y) ? 1 : 0) << endl;
return 0;
}
| #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
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;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 817,701 | 817,702 | u843070415 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
float ans;
ans = (w * h) / 2;
cout << (float)ans << " ";
if (((w % 2) == 0) && ((h % 2) == 0) && (x == (w / 2)) && (y == (h / 2))) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
float ans;
ans = ((float)w * (float)h) / 2;
cout << (float)ans << " ";
if (((w % 2) == 0) && ((h % 2) == 0) && (x == (w / 2)) && (y == (h / 2))) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
re... | [
"type_conversion.add"
] | 817,714 | 817,715 | u296155726 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double res;
int res_b;
res = w * h / 2;
if (x * 2 == w && y * 2 == h) {
res_b = 1;
} else {
res_b = 0;
}
cout << res << " " << res_b;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double res;
int res_b;
res = (double)w * (double)h / 2;
if (x * 2 == w && y * 2 == h) {
res_b = 1;
} else {
res_b = 0;
}
cout << res << " " << res_b;
} | [
"type_conversion.add"
] | 817,724 | 817,725 | u301870186 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> s... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> s... | [
"literal.number.change",
"call.arguments.change",
"io.output.change"
] | 817,738 | 817,739 | u343930666 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int n, m, x, y;
int main() {
cin >> n >> m >> x >> y;
if (x == n / 2 && y == m / 2)
printf("%.12f 1", n * m / 2.0);
else
printf("%.12f 0", n * m / 2.0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double n, m, x, y;
int main() {
cin >> n >> m >> x >> y;
if (x == n / 2 && y == m / 2)
printf("%.12f 1", n * m / 2.0);
else
printf("%.12f 0", n * m / 2.0);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 817,753 | 817,754 | u051670389 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int n, m, x, y;
int main() {
cin >> n >> m >> x >> y;
if (x == n / 2 && y == m / 2)
printf("%.6f 1", n * m / 2.0);
else
printf("%.6f 0", n * m / 2.0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double n, m, x, y;
int main() {
cin >> n >> m >> x >> y;
if (x == n / 2 && y == m / 2)
printf("%.12f 1", n * m / 2.0);
else
printf("%.12f 0", n * m / 2.0);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,755 | 817,754 | u051670389 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int W, H;
int x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.f << " ";
if (W / 2 == x && H / 2 == y) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int W, H;
int x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.f << " ";
if (W / 2.0 == x && H / 2.0 == y) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 817,756 | 817,757 | u412989489 | cpp |
p03001 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | [
"literal.number.change",
"expression.operation.binary.change",
"io.output.change"
] | 817,783 | 817,784 | u174404613 | cpp |
p03001 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"io.output.change"
] | 817,785 | 817,784 | u174404613 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include ... | [
"literal.number.change",
"io.output.change"
] | 817,788 | 817,789 | u065923107 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double cx, cy;
cx = W / 2;
cy = H / 2;
double M = (H * W) / 2;
int ans = 0;
if (cx == x && cy == y) {
ans = 1;
}
cout <... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
double cx, cy;
cx = W / 2;
cy = H / 2;
double M = (H * W) / 2;
int ans = 0;
if (cx == x && cy == y) {
ans = 1;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 817,798 | 817,799 | u120564432 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
long long cx, cy;
cx = W / 2;
cy = H / 2;
double M = (H * W) / 2;
int ans = 0;
if (cx == x && cy == y) {
ans = 1;
}
cou... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
double cx, cy;
cx = W / 2;
cy = H / 2;
double M = (H * W) / 2;
int ans = 0;
if (cx == x && cy == y) {
ans = 1;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 817,800 | 817,799 | u120564432 | cpp |
p03001 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,803 | 817,804 | u153390822 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long 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";
}
} | #include <bits/stdc++.h>
using namespace std;
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";
} else {
cout << " 0";
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 817,813 | 817,812 | u431475157 | cpp |
p03001 | #include <iostream>
using namespace std;
int main(void) {
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;
}
| #include <iostream>
using namespace std;
int main(void) {
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;
}
| [
"io.output.change"
] | 817,820 | 817,821 | u361872898 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double square = W * H / 2;
int check = 0;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double square = W * H / 2.0;
int check = 0... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,824 | 817,825 | u588399226 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
long long square = W * H / 2;
int check = ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double square = W * H / 2.0;
int check = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"expression.operation.binary.change"
] | 817,826 | 817,825 | u588399226 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
long long square = W * H / 2;
int check = 0;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static int INT_INF = 2147483647;
const static int MOD_NUM = 1000000007;
static string S[2005] = {""};
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double square = W * H / 2.0;
int check = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"expression.operation.binary.change"
] | 817,827 | 817,825 | u588399226 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,834 | 817,835 | u617380180 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
double max_s;
int way = 0;
max_s = (double)(w) * (double)(h) / 2.0;
if ((2 * x == w) || (2 * y == h)) {
way = 1;
}
cout << fixed << setprecision(15) << max_s << " " << way << en... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
double max_s;
int way = 0;
max_s = (double)(w) * (double)(h) / 2.0;
if ((2 * x == w) && (2 * y == h)) {
way = 1;
}
cout << fixed << setprecision(10) << max_s << " " << way << en... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 817,838 | 817,837 | u478018523 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
double max_s;
int way = 0;
max_s = (double)(w) * (double)(h) / 2.0;
if ((2 * x == w) || (2 * y == h)) {
way = 1;
}
cout << setprecision(20) << max_s << " " << way << endl;
re... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int64_t w, h, x, y;
cin >> w >> h >> x >> y;
double max_s;
int way = 0;
max_s = (double)(w) * (double)(h) / 2.0;
if ((2 * x == w) && (2 * y == h)) {
way = 1;
}
cout << fixed << setprecision(10) << max_s << " " << way << en... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"io.output.change",
"literal.number.change"
] | 817,839 | 817,837 | u478018523 | cpp |
p03001 | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod =... | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod =... | [
"variable_declaration.type.change"
] | 817,840 | 817,841 | u087436629 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll W, H, x, y, mul;
double ans;
int main() {
scanf("%lld %lld %lld %lld", &W, &H, &x, &y);
double ans = (W * H) / 2;
if (W == x * 2 && H == y * 2) {
mul = 1;
}
printf("%.6lf %d\n", ans, mul);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll W, H, x, y, mul;
double ans;
int main() {
scanf("%lld %lld %lld %lld", &W, &H, &x, &y);
double ans = (double)(W * H) / 2;
if (W == x * 2 && H == y * 2) {
mul = 1;
}
printf("%.6lf %d\n", ans, mul);
} | [
"type_conversion.add"
] | 817,862 | 817,863 | u548877759 | cpp |
p03001 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 817,868 | 817,869 | u977365687 | cpp |
p03001 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"variable_declaration.type.primitive.change"
] | 817,883 | 817,884 | u050698451 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w * h) / 2 << ' ';
if (x * 2 == w && y * w == h) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w * h) / 2 << ' ';
if (x * 2 == w && y * 2 == h) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 817,889 | 817,890 | u678631835 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (w * h) / 2;
if (x * 2 == w && y * 2 == h) {
printf("%.6lf 1", ans);
} else {
printf("%.6lf 0", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = ((double)w * (double)h) / 2;
if (x * 2 == w && y * 2 == h) {
printf("%.6lf 1", ans);
} else {
printf("%.6lf 0", ans);
}
return 0;
}
| [
"type_conversion.add"
] | 817,897 | 817,898 | u973152737 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y, sc, A;
cin >> W >> H >> x >> y;
sc = W * H / 2;
if (x == W / 2 && y == H / 2) {
A = 1;
} else {
A = 0;
}
cout << sc << " " << A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y, A, sc;
cin >> W >> H >> x >> y;
sc = W * H / 2;
if (x == W / 2 && y == H / 2) {
A = 1;
} else {
A = 0;
}
cout << sc << " " << A << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove",
"variable_declaration.add"
] | 817,899 | 817,900 | u158628538 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | [
"variable_declaration.type.change"
] | 817,901 | 817,902 | u155088988 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 817,903 | 817,902 | u155088988 | cpp |
p03001 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << setprecision(10) << W * H / 2.0 << " ";
if (W % 2 == 0 && H % 2 == 0 && W / 2 == x && H % 2 == y)
cout << '1' << endl;
else
cout << '0' << endl;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << setprecision(10) << W * H / 2.0 << " ";
if (W % 2 == 0 && H % 2 == 0 && W / 2 == x && H / 2 == y)
cout << '1' << endl;
else
cout << '0' << endl;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 817,920 | 817,921 | u991846372 | cpp |
p03001 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int w, h, x, y;
cin >> w >> h >> x >> y;
int f = 0;
if (x == w / 2 && y == h / 2)
f = 1;
cout << (w * h) / 2 << f;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
double w, h, x, y;
cin >> w >> h >> x >> y;
int f = 0;
if (x == w / 2 && y == h / 2)
f = 1;
cout << (w * h) / 2 << " " << f;
}
| [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 817,924 | 817,925 | u675509234 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
void file(bool opt) {
if (opt && fopen("in.txt", "r")) {
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
}
}
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int flag = 0;
if (x * 2 == w && y * 2 ... | #include <bits/stdc++.h>
using namespace std;
void file(bool opt) {
if (opt && fopen("in.txt", "r")) {
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
}
}
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = 1.0 * w / 2 * h;
int flag = 0;
if (x * 2 == w && ... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"identifier.change"
] | 817,929 | 817,930 | u066917439 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double ans;
if (x2 == x1 / 2 && y2 == y1 / 2) {
ans = x1 * y1 / 2;
cout << fixed << setprecision(6) << ans << ' ' << 1;
return 0;
} else {
ans = x1 * y1 / 2;
cout << fixed << setprec... | #include <bits/stdc++.h>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double ans;
if (x2 == x1 / 2 && y2 == y1 / 2) {
ans = x1 * y1 / 2;
cout << fixed << setprecision(6) << ans << ' ' << 1;
return 0;
} else {
ans = x1 * y1 / 2;
cout << fixed << setp... | [
"variable_declaration.type.primitive.change"
] | 817,940 | 817,941 | u429536817 | cpp |
p03001 | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 100005;
double w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
double s = w * h / 2;
int flag;
if (x == w / 2 || y == h / 2)
flag = 1;
else
flag = 0;
cout << s << " " << flag << endl;
//... | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 100005;
double w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
double s = w * h / 2;
int flag;
if (x == w / 2 && y == h / 2)
flag = 1;
else
flag = 0;
cout << s << " " << flag << endl;
//... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,942 | 817,943 | u058946652 | cpp |
p03001 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 817,946 | 817,947 | u159208574 | cpp |
p03001 | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << setprecision(10) << (W * ... | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << setprecision(10) << (W * ... | [
"expression.operation.binary.add"
] | 817,983 | 817,984 | u766009355 | cpp |
p03001 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int, int>
#define pb push_back
#define eb emplace_back
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
int MOD = 1000000007;
int MOD2 = 998... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int, int>
#define pb push_back
#define eb emplace_back
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
int MOD = 1000000007;
int MOD2 = 998... | [
"control_flow.branch.if.condition.change"
] | 817,997 | 817,998 | u928041186 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INTEG = pow(10, 9) + 7;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << W * H / 2 << setprecision(10) << " ";
if (2 * x == W && 2 * y == H) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INTEG = pow(10, 9) + 7;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << W * H / 2 << setprecision(10) << " ";
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"literal.number.change",
"io.output.change"
] | 818,003 | 818,004 | u826764011 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll W, H, x, y;
cin >> W >> H >> x >> y;
doub... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll W, H, x, y;
cin >> W >> H >> x >> y;
doub... | [
"literal.number.change",
"expression.operation.binary.change"
] | 818,005 | 818,006 | u892438699 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << 1LL * w * h / 2 << ' ' << (x * 2 == w && y * 2 == h) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << 0.5 * w * h << ' ' << (x * 2 == w && y * 2 == h) << endl;
} | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 818,021 | 818,022 | u410358766 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (LL INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (LL INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
LL W, H, x, y;
cin >> W >> H >> x >> y;
LL area = W * H / 2.0;
bool centerX ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (LL INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (LL INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
LL W, H, x, y;
cin >> W >> H >> x >> y;
double area = W * H / 2.0;
bool cent... | [
"variable_declaration.type.change"
] | 818,027 | 818,028 | u658243311 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | [
"type_conversion.add"
] | 818,037 | 818,038 | u976162616 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w / 2 == x && h / 2 == y) {
cout << 1 << en... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (w / 2 == x && h / 2 == y) {
cout << 1 <<... | [
"variable_declaration.type.primitive.change"
] | 818,048 | 818,049 | u516922881 | cpp |
p03001 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 818,054 | 818,055 | u407614884 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(boo... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(boo... | [
"literal.number.change",
"io.output.change"
] | 818,060 | 818,061 | u233393801 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int A = 1;
int B = (w % 2 == 0 && w / 2 == x);
int C = (h % 2 == 0 && h / 2 == y);
if (B && C)
A = 0;
printf("%.10f %d\n", (double)h * w / 2, A);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int A = 0;
int B = (w % 2 == 0 && w / 2 == x);
int C = (h % 2 == 0 && h / 2 == y);
if (B && C)
A = 1;
printf("%.10f %d\n", (double)h * w / 2, A);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 818,068 | 818,069 | u680625190 | cpp |
p03001 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | [
"type_conversion.add"
] | 818,070 | 818,071 | u862095327 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long... | [
"type_conversion.add"
] | 818,087 | 818,088 | u903311413 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
// #define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
// #define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define ... | [
"literal.number.change",
"io.output.change"
] | 818,091 | 818,092 | u567672339 | cpp |
p03001 | //
// Created by keane on 19-6-16.
//
#include <bits/stdc++.h>
using namespace std;
double w, h, x, y;
int main(void) {
scanf("%lf%lf%lf%lf", &w, &h, &x, &y);
double a = w * h / 2;
int d = 0;
if (x == w / 2 && y == h / 2) {
d = 1;
}
printf("%.6lf%d\n", a, d);
return 0;
} | //
// Created by keane on 19-6-16.
//
#include <bits/stdc++.h>
using namespace std;
double w, h, x, y;
int main(void) {
scanf("%lf%lf%lf%lf", &w, &h, &x, &y);
double a = w * h / 2;
int d = 0;
if (x == w / 2 && y == h / 2) {
d = 1;
}
printf("%.6lf %d\n", a, d);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 818,097 | 818,098 | u978172081 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int lli;
const lli mod = 1e9 + 7;
int main() {
lli h, w, x, y;
cin >> h >> w >> x >> y;
cout << h * w / 2 << " ";
if (2 * x == h and 2 * y == w) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
ret... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int lli;
const lli mod = 1e9 + 7;
int main() {
lli h, w, x, y;
cin >> h >> w >> x >> y;
cout << (long double)h * w / 2 << " ";
if (2 * x == h and 2 * y == w) {
cout << 1 << endl;
} else {
cout << 0 << en... | [
"type_conversion.add"
] | 818,103 | 818,104 | u489536233 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | [
"type_conversion.add"
] | 818,107 | 818,108 | u228295160 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long 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>
using namespace std;
int main() {
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.narrow.change",
"variable_declaration.type.widen.change"
] | 818,115 | 818,116 | u024867942 | cpp |
p03001 | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdo... | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdo... | [
"expression.operation.binary.remove"
] | 818,119 | 818,120 | u548859367 | cpp |
p03001 | #ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#... | #ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#... | [
"call.arguments.change",
"call.add"
] | 818,121 | 818,122 | u584355711 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x... | [
"control_flow.branch.if.condition.change"
] | 818,135 | 818,136 | u771524928 | cpp |
p03001 | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | [
"literal.number.change",
"io.output.change"
] | 818,137 | 818,138 | u379822620 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 23;
const int S = 1e5 + 23;
const int mod = 1e9 + 7;
int n, m;
int ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 23;
const int S = 1e5 + 23;
const int mod = 1e9 + 7;
int n, m;
int ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 818,145 | 818,146 | u953463534 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 23;
const int S = 1e5 + 23;
const int mod = 1e9 + 7;
int n, m;
int ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e3 + 23;
const int S = 1e5 + 23;
const int mod = 1e9 + 7;
int n, m;
int ... | [
"assignment.change"
] | 818,147 | 818,146 | u953463534 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 818,186 | 818,187 | u530107518 | cpp |
p03003 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int ... | [
"assignment.value.change"
] | 818,206 | 818,207 | u222030240 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, m;
cin >> n >> m;
vector<int> s(n), t(m)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n, m;
cin >> n >> m;
vector<int> s(n), t(m)... | [
"expression.operation.binary.add"
] | 818,208 | 818,209 | u604231488 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.