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 || ... | #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 || ... | [
"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 "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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, be... | //{{{
#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, be... | [
"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 ... | #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;
c... | [
"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,... | #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,... | [
"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,... | #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,... | [
"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(... | #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(... | [
"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(... | #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(... | [
"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;
typed... | #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;
typed... | [
"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. << " " << ... | #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. << " " <... | [] | 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... | #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... | [
"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 << " " <<... | #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 << " " ... | [
"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 << " " <<... | #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 << " " ... | [
"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()
#defin... | #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()
#defin... | [
"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>
us... | #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>
us... | [
"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 <ve... | #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 <ve... | [
"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) ... | #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) ... | [
"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>
#in... | #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>
#in... | [
"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, i... | #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, i... | [
"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... | #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... | [
"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("%l... | #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;
}
pr... | [
"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("%l... | #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;
}
pr... | [
"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);
... | #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);
... | [
"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;... | #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;... | [
"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 <= ... | #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 <= ... | [
"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... | #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... | [
"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 ... | #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 ... | [] | 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 <... | #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
co... | [
"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 ... | #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
co... | [
"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;
}
r... | #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;
... | [
"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 =... | #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 == ... | [] | 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;
} el... | #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;
... | [
"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.. */
in... | #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.. */
in... | [
"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 name... | /******************************\
* 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 name... | [
"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;... | #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;
el... | [
"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;
re... | #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;
... | [
"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 {
... | #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 << end... | [
"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 <<... | #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 <<... | [
"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); ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(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 ... | #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 <<... | [
"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;
p... | /*
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;
... | [
"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... | #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... | [
"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... | #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... | [
"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 _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(... | [
"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:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"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) << " ";
... | #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) << " ";
... | [
"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... | #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... | [
"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... | #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... | [
"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) ... | // 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) ... | [
"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;
... | #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) {
othe... | [
"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 {... | #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) {
othe... | [
"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_... | #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; //面... | [
"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);
... | #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);... | [
"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);
c... | #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);... | [
"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 <... | #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);... | [
"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<c... | // 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<c... | [
"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... | #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... | [
"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;
#defin... | #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;
#defin... | [
"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++)
type... | /*
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++)
type... | [
"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 : cou... | #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 : c... | [
"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 :... | #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 : c... | [
"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 ... | #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 : c... | [
"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.