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;
double s = 1.0;
if (W / 2 != x || H / 2 != y) {
cout << W * H * s / 2 << " " << 0 << endl;
}
else {
cout << W * H * s / 2 << " " << 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double s = 1.0;
if (W * s / 2 != x || H * s / 2 != y) {
cout << W * H * s / 2 << " " << 0 << endl;
}
else {
cout << W * H * s / 2 << " " << 1 << endl;
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 815,090 | 815,091 | u187013893 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define SORT(v, n) sort(v, v + n)
#define rep(i, n) FOR(i, 0, n)
#define EPS (1e-7)
#de... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 815,098 | 815,099 | u097408484 | cpp |
p03001 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
double ha... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double)W * H / 2;
d... | [
"type_conversion.add"
] | 815,100 | 815,101 | u289578952 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int a = 0;
if (w / 2 == x && h / 2 == y)
a = 1;
cout << ans << " " << a << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int a = 0;
if (w / 2 == x && h / 2 == y)
a = 1;
cout << ans << " " << a << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 815,105 | 815,106 | u754114382 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
if (W % 2 == 0 && x == W / 2 && H % 2 == 0 && y == H / 2) {
ll ans = H * W / 2;
cout << ans << ' ' << 1 << endl;
} else {
float ans;
ans = H * W / 2;
cout << ans << ' ' <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
if (W % 2 == 0 && x == W / 2 && H % 2 == 0 && y == H / 2) {
ll ans = H * W / 2;
cout << ans << ' ' << 1 << endl;
} else {
float ans;
ans = (float)H * W / 2;
cout << ans <... | [
"type_conversion.add"
] | 815,120 | 815,121 | u639032323 | cpp |
p03001 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"io.output.change"
] | 815,122 | 815,123 | u526639495 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << (double)(A * B) / 2 << (A / 2 == C && B / 2 == D ? 1 : 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double A, B, C, D;
cin >> A >> B >> C >> D;
cout << (double)(A * B) / 2 << ' ' << (A / 2 == C && B / 2 == D ? 1 : 0)
<< endl;
}
| [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 815,145 | 815,146 | u620626180 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w || 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 0 << endl;
return 0;
}
cout << fixed << setprecision(11) << (double)w * h / 2 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 1 << endl;
return 0;
}
cout << fixed << setprecision(11) << (double)w * h / 2 << ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 815,156 | 815,157 | u221391729 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * (double)h / 2 << " " << 0
<< endl;
return 0;
}
cout << fixed << setprecision(11) << (dou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * (double)h / 2 << " " << 1
<< endl;
return 0;
}
cout << fixed << setprecision(11) << (dou... | [
"literal.number.change",
"io.output.change"
] | 815,158 | 815,159 | u221391729 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w || 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * (double)h / 2 << " " << 0
<< endl;
return 0;
}
cout << fixed << setprecision(11) << (dou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << fixed << setprecision(11) << (double)w * (double)h / 2 << " " << 1
<< endl;
return 0;
}
cout << fixed << setprecision(11) << (dou... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 815,160 | 815,159 | u221391729 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | [
"variable_declaration.type.change"
] | 815,161 | 815,162 | u308463793 | 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() {
int W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2 && y == H / 2)
cout << W * H / 2 << " " << 1 << endl;
else
cout << W * H / 2 << " " << 0 << endl;
} | #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() {
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2 && y == H / 2)
cout << W * H / 2 << " " << 1 << endl;
else
cout << W * H / 2 << " " << 0 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 815,165 | 815,166 | u650236619 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
#define repBack(i, n) for (int i = n; i >= 0; i--)
#define dup(x, y) (((x) + (y)-1) / (y))
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
#define repBack(i, n) for (int i = n; i >= 0; i--)
#define dup(x, y) (((x) + (y)-1) / (y))
i... | [
"call.arguments.change"
] | 815,173 | 815,174 | u911917041 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | [
"literal.number.change",
"io.output.change"
] | 815,181 | 815,182 | u999788719 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | [
"literal.number.change",
"io.output.change"
] | 815,183 | 815,182 | u999788719 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | [
"expression.operation.binary.add"
] | 815,184 | 815,182 | u999788719 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
printf("%lf %d", double(a) * double(y) / 2, x + x == a && y + y == b);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
printf("%lf %d", double(a) * double(b) / 2, x + x == a && y + y == b);
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 815,194 | 815,195 | u798562499 | cpp |
p03001 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se se... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se se... | [
"variable_declaration.type.change",
"call.remove"
] | 815,196 | 815,197 | u604329931 | cpp |
p03001 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | [
"literal.string.change",
"io.output.change"
] | 815,203 | 815,204 | u879674287 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * y / 2;
int num = (w == x * 2 && h == y * 2) ? 1 : 0;
cout << ans << " " << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
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;
cout << ans << " " << num << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 815,205 | 815,206 | u999989620 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
const doubl... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
const doubl... | [
"literal.number.change",
"expression.operation.binary.change"
] | 815,217 | 815,218 | u081029414 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
const doubl... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
const doubl... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 815,219 | 815,218 | u081029414 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll W, H, x, y;
cin >> W >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll W, H, x, y;
cin >> W >>... | [
"identifier.change",
"expression.operation.binary.change"
] | 815,220 | 815,221 | u340980616 | cpp |
p03001 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.primitive.change"
] | 815,225 | 815,226 | u914047482 | cpp |
p03001 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.primitive.change"
] | 815,227 | 815,226 | u914047482 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,228 | 815,229 | u170054586 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long int;
template ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long int;
template ... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 815,233 | 815,234 | u131340563 | cpp |
p03001 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 815,261 | 815,262 | u870074807 | cpp |
p03001 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.change"
] | 815,263 | 815,262 | u870074807 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using ch = char;
using db = double;
using bl = bool;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vch = vector<char>;
using pll = pair... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using ch = char;
using db = double;
using bl = bool;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vch = vector<char>;
using pll = pair... | [
"io.output.change"
] | 815,268 | 815,269 | u729173935 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
printf("%.12f", a * b / 2);
if (2 * x == a && 2 * y == b) {
cout << " " << 1 << endl;
} else {
cout << " " << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, x, y;
cin >> a >> b >> x >> y;
printf("%.12f", a * b / 2);
if (2 * x == a && 2 * y == b) {
cout << " " << 1 << endl;
} else {
cout << " " << 0 << endl;
}
}
| [
"variable_declaration.type.primitive.change"
] | 815,270 | 815,271 | u488207046 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"variable_declaration.type.primitive.change"
] | 815,280 | 815,281 | u498141549 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int w, h;
cin >> w >> h;
{
cout << fixed << setprecision(6);
double sq = w * h / 2;
cout << sq;
cout << " ";
}
int y, x;
cin >> x >> y;
if (x == w / 2 && y == h / 2) {
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
double w, h;
cin >> w >> h;
{
cout << fixed << setprecision(6);
double sq = w * h / 2;
cout << sq;
cout << " ";
}
int y, x;
cin >> x >> y;
if (x == w / 2 && y == h / 2) {
c... | [
"variable_declaration.type.primitive.change"
] | 815,286 | 815,287 | u264405855 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int w, h;
cin >> w >> h;
{
cout << fixed << setprecision(20);
double sq = w * h / 2;
cout << sq;
cout << " ";
}
int y, x;
cin >> x >> y;
if (x == w / 2 && y == h / 2) {
cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
double w, h;
cin >> w >> h;
{
cout << fixed << setprecision(6);
double sq = w * h / 2;
cout << sq;
cout << " ";
}
int y, x;
cin >> x >> y;
if (x == w / 2 && y == h / 2) {
c... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 815,288 | 815,287 | u264405855 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w * h / 2) << " "
<< ((w % 2 == 0 and w / 2 == x) and (h % 2 == 0 and h / 2 == y) ? 1 : 0)
<< "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w * h / 2.0) << " "
<< ((w % 2 == 0 and w / 2 == x) and (h % 2 == 0 and h / 2 == y) ? 1 : 0)
<< "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 815,304 | 815,303 | u672611103 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w * h / 2) << " "
<< ((w % 2 == 0 and w / 2 == x) and (h % 2 == 0 and h / 2 == y) ? 1 : 0)
<< "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << (long double)(w * h / 2.0) << " "
<< ((w % 2 == 0 and w / 2 == x) and (h % 2 == 0 and h / 2 == y) ? 1 : 0)
<< "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 815,304 | 815,305 | u672611103 | cpp |
p03001 | // url:
// problem name:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | // url:
// problem name:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return ... | [
"type_conversion.add"
] | 815,306 | 815,307 | u446371873 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int w, h, x, y;
float area;
cin >> w >> h >> x >> y;
int ans = 0;
if (x == w / 2 && y == h / 2)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (x == w / 2 && y == h / 2)
ans = 1... | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 815,327 | 815,328 | u058958514 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typ... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typ... | [
"variable_declaration.type.primitive.change"
] | 815,335 | 815,336 | u495881622 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double tot = w * h / 2;
cout << tot << " ";
if (x * 2 == w && y * 2 == h)
cout << 1;
else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double tot = w * h;
tot /= 2;
cout << tot << " ";
if (x * 2 == w && y * 2 == h)
cout << 1;
else
cout << 0;
return 0;
} | [
"expression.operation.binary.change",
"assignment.change"
] | 815,344 | 815,345 | u859436937 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
long double W, H;
long double x, y;
cin >> W >> H >> x >> y;
W / 2 == ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
long double W, H;
long double x, y;
cin >> W >> H >> x >> y;
W / 2 == ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 815,346 | 815,347 | u272628953 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define rep2(i, j, n) for (int j = i; j < n; j++)
#define rep3(i, j, n) for (int j = i; j <= n; j++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define sp(n) cout << fixed << setprec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define rep2(i, j, n) for (int j = i; j < n; j++)
#define rep3(i, j, n) for (int j = i; j <= n; j++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define sp(n) cout << fixed << setprec... | [
"type_conversion.add"
] | 815,348 | 815,349 | u222866518 | 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() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double f = (double)w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 && y != h / 2)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double f = (double)w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 || y != h / 2)
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 815,350 | 815,351 | u726957641 | 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() {
int w, h, x, y;
cin >> w >> h >> x >> y;
ll f = w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 || y != h / 2)
cnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double f = (double)w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 || y != h / 2)
... | [
"variable_declaration.type.change"
] | 815,352 | 815,351 | u726957641 | 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() {
int w, h, x, y;
cin >> w >> h >> x >> y;
ll f = w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 && y != h / 2)
cnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double f = (double)w * h / 2;
int cnt = 1;
if (w % 2 != 0 || h % 2 != 0) {
cnt = 0;
} else {
if (x != w / 2 || y != h / 2)
... | [
"variable_declaration.type.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 815,353 | 815,351 | u726957641 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | [
"variable_declaration.type.primitive.change"
] | 815,354 | 815,355 | u132364782 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>... | [
"literal.number.change",
"io.output.change"
] | 815,368 | 815,369 | u513211419 | cpp |
p03001 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#includ... | [
"type_conversion.add"
] | 815,372 | 815,373 | u455067221 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define prec fixed << setprecision(10)
#define mod 1000000007
#define set(x) __builtin_popcount(x)
#define ffs(x) __builtin_ffs(x)
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << prec << w * h / 2;
if (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define prec fixed << setprecision(15)
#define mod 1000000007
#define set(x) __builtin_popcount(x)
#define ffs(x) __builtin_ffs(x)
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << prec << (double)w * h / 2... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 815,381 | 815,382 | u232462132 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define prec fixed << setprecision(10)
#define mod 1000000007
#define set(x) __builtin_popcount(x)
#define ffs(x) __builtin_ffs(x)
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << prec << w * h / 2;
if ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define prec fixed << setprecision(15)
#define mod 1000000007
#define set(x) __builtin_popcount(x)
#define ffs(x) __builtin_ffs(x)
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << prec << (double)w * h / 2... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change"
] | 815,383 | 815,382 | u232462132 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(12) << w * h / 2 << " "
<< (w == x * 2 && h == y * 2 ? 1 : 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(12) << w * h / 2 << " "
<< (w == x * 2 && h == y * 2 ? 1 : 0) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 815,387 | 815,388 | u587366956 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(12) << w * h / 2 << " "
<< (w == x * 2 && h == y * 2 ? 1 : 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(12) << w * h / 2.0 << " "
<< (w == x * 2 && h == y * 2 ? 1 : 0) << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 815,387 | 815,389 | u587366956 | cpp |
p03001 | #pragma region include
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#pragma endregion
using namespace std;
#pragma region 定数
#define INF_VAL (2147483647 - 1)
#define I... | #pragma region include
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#pragma endregion
using namespace std;
#pragma region 定数
#define INF_VAL (2147483647 - 1)
#define I... | [
"control_flow.branch.if.condition.change"
] | 815,415 | 815,416 | u550949279 | cpp |
p03001 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 815,434 | 815,435 | u104057163 | cpp |
p03001 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | [
"variable_declaration.type.widen.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 815,436 | 815,435 | u104057163 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nul... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nul... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,446 | 815,447 | u189873906 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | [
"type_conversion.add"
] | 815,452 | 815,453 | u655777757 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(6) << (w * h) / (2 * 1.0) << " ";
if (x + x == w && y + y == h)
cout << 0 << endl;
else
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(6) << (w * h) / (2 * 1.0) << " ";
if (x + x == w && y + y == h)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 815,458 | 815,459 | u980161833 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
//長方形の中心にあると二つ存在。それ以外なら1つ
//面積は必ず等しくできる
cout << ((long long)H * W) / 2.0;
//長方形の中心にある
if (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;
//長方形の中心にあると二つ存在。それ以外なら1つ
//面積は必ず等しくできる
cout << ((long long)H * W) / 2.0;
//長方形の中心にある
if (x == W / 2.0 && y == H / 2.0)
cout << ' ' << 1 << endl;
else
cout << ' ' << 0 << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,460 | 815,461 | u604023588 | cpp |
p03001 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << (ld)W * H / 2 << "... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << (ld)W * H / 2 << "... | [
"control_flow.branch.if.condition.change"
] | 815,462 | 815,463 | u986754154 | cpp |
p03001 | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
int main() {
intmax_t W, H, x, y;
scanf("%jd %jd %jd %jd", &W, &H, &x, &y);
double S = W * H / 2.0;... | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
int main() {
intmax_t W, H, x, y;
scanf("%jd %jd %jd %jd", &W, &H, &x, &y);
double S = W * H / 2.0;... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,489 | 815,490 | u352499693 | cpp |
p03001 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
long long S = 0.50 * W * H;
bool deg = (2 * x == W) && (2 * y == H);
cout << S << " " << deg << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
double S = 0.50 * W * H;
bool deg = (2 * x == W) && (2 * y == H);
cout << S << " " << deg << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 815,495 | 815,496 | u774438048 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"variable_declaration.type.primitive.change"
] | 815,511 | 815,512 | u989306199 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | [
"variable_declaration.type.change",
"variable_declaration.remove",
"variable_declaration.add"
] | 815,515 | 815,516 | u842917248 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(6) << 1. * w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << 1;
else
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(6) << 1. * w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
cout << 1;
else
... | [
"variable_declaration.type.primitive.change"
] | 815,522 | 815,523 | u915689660 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h)
cout << w * (h / 2.0) << " " << 1 << endl;
else
cout << w * (h / 2.0) << " " << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h)
cout << w * (h / 2.0) << " " << 1 << endl;
else
cout << w * (h / 2.0) << " " << 0 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"io.output.change"
] | 815,526 | 815,527 | u459105164 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
printf("%7.5f", w * h / 2);
if (w / 2 == x && h / 2 == y)
cout << " " << 1;
else
cout << " " << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
printf("%7.5f", w * h / 2);
if (w / 2 == x && h / 2 == y)
cout << " " << 1;
else
cout << " " << 0;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 815,543 | 815,544 | u469639111 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll 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>
using namespace std;
typedef long long ll;
int main() {
/*ll S; cin >> S;
ll h = 1;
ll w = S;
if(S > 1000000000){
for(ll i = 5000000000; i > 0; i--){
//cout << i << endl;
if(S % i == 0) {h = i; w = S/i; break;}
}
}
cout << 0 << " " << 0 << " " << w <... | [
"variable_declaration.type.change"
] | 815,545 | 815,546 | u521973174 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << double(w) * double(h) / 2 << " " << '1' << endl;
} else {
... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << double(w) * double(h) / 2 << " " << '1' << endl;
} else {
... | [
"literal.string.change",
"io.output.change"
] | 815,547 | 815,548 | u745267317 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | [
"call.add",
"call.arguments.change"
] | 815,549 | 815,550 | u823722490 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
double half = (W * H) / 2;
bool can = false;
if (W % 2 == 0 && H % 2 == 0) {
if (x == W / 2 && y == H / 2)
can = true;
}
cout << fixed << setprecision(12);
if (can)
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
double half = (double)W * H / 2;
bool can = false;
if (W % 2 == 0 && H % 2 == 0) {
if (x == W / 2 && y == H / 2)
can = true;
}
cout << fixed << setprecision(12);
if (can)
... | [
"type_conversion.add"
] | 815,551 | 815,552 | u241312295 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h;
int x, y;
cin >> w >> h >> x >> y;
double maxSize = (w / 2) * h;
bool multipleWaysPossible = (((x == w / 2) || (y == h / 2)) ? true : false);
cout << fixed << setprecision(9);
cout << maxSize << " " << (multipleWaysPossible ? 1 : 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h;
int x, y;
cin >> w >> h >> x >> y;
double maxSize = (w / 2) * h;
bool multipleWaysPossible = (((x == w / 2) && (y == h / 2)) ? true : false);
cout << fixed << setprecision(9);
cout << maxSize << " " << (multipleWaysPossible ? 1 : 0... | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 815,560 | 815,561 | u584797714 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 815,564 | 815,565 | u016119075 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2.0 << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 815,566 | 815,565 | u016119075 | cpp |
p03001 | #include <iostream>
#include <vector>
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);
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int num = (W == x * 2 && H == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,570 | 815,571 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
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);
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int num = (W == x * 2 && H == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
}
| [
"variable_declaration.type.primitive.change",
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,572 | 815,571 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
ans = W * H / 2;
int num = (W == x * 2 || H == y * 2) ? 1 : 0;
printf("%.10f%d\n", ans, num);
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int num = (W == x * 2 && H == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
}
| [
"variable_declaration.remove",
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,573 | 815,571 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
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);
}
| #include <iostream>
#include <vector>
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);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,570 | 815,575 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
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);
}
| #include <iostream>
#include <vector>
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);
}
| [
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,572 | 815,575 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
ans = (double)W * H / 2;
int num = (W == x * 2 || H == y * 2) ? 1 : 0;
printf("%.10f%d\n", ans, num);
}
| #include <iostream>
#include <vector>
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);
}
| [
"variable_declaration.remove",
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,576 | 815,575 | u147556624 | cpp |
p03001 | #include <iostream>
#include <vector>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
ans = (double)W * H / 2;
int num = (W == x * 2 || H == y * 2) ? 1 : 0;
printf("%.10f%d\n", ans, num);
}
| #include <iostream>
#include <vector>
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);
}
| [
"variable_declaration.type.primitive.change",
"misc.opposites",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,577 | 815,575 | u147556624 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,580 | 815,581 | u917282863 | cpp |
p03001 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y)
cout ... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y)
co... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"io.output.change"
] | 815,584 | 815,585 | u796123030 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
#define ll long long int
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double area = (double)(w * h) / 2;
ll flag = 0;
if (x == w / 2 && y == h / 2)
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
#define ll long long int
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double area = (double)(w * h) / 2;
ll flag = 0;
if (x == w / 2 && y == h / 2)... | [
"variable_declaration.type.change"
] | 815,586 | 815,587 | u345207975 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
#define ll long long int
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double area = (w * h) / 2;
ll flag = 0;
if (x == w / 2 && y == h / 2)
flag = ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
#define ll long long int
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double area = (double)(w * h) / 2;
ll flag = 0;
if (x == w / 2 && y == h / 2)... | [
"variable_declaration.type.change"
] | 815,588 | 815,587 | u345207975 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, answer;
cin >> w >> h >> x >> y;
answer = h * w * 0.5;
if (x == w * 0.5 || y == h * 0.5) {
cout << answer << " 1" << endl;
} else {
cout << answer << " 0" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, answer;
cin >> w >> h >> x >> y;
answer = (h * w) * 0.5;
if (x == w * 0.5 && y == h * 0.5) {
cout << answer << " 1" << endl;
} else {
cout << answer << " 0" << endl;
}
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 815,600 | 815,601 | u931071094 | cpp |
p03001 | #include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
using namespace std;
int main() {
long long w, h, x, y, r;
int poss = 0;
cin >> w >> h >> x >> y;
if ((x == w / 2) && (y == h / 2)) {
poss += 1;
}
cout << fixed << setprecision(10) << double((w * h) / 2.0) << " " << poss;
}
| #include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
using namespace std;
int main() {
double w, h, x, y;
int poss = 0;
cin >> w >> h >> x >> y;
if ((x == w / 2) && (y == h / 2)) {
poss = 1;
}
cout << fixed << setprecision(10) << double((w * h) / 2.0) << " " << poss;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"variable_declaration.remove",
"assignment.value.change"
] | 815,616 | 815,617 | u554529201 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll m = 0;
if (w == 2 * x && h == 2 * y) {
m = 1;
}
cout << fixed << setprecision(15) << (double)(w * h / 2) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll m = 0;
if (w == 2 * x && h == 2 * y) {
m = 1;
}
cout << fixed << setprecision(10) << (double)(w * h) / 2.0... | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 815,636 | 815,635 | u701556979 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll m = 0;
if (w == 2 * x && h == 2 * y) {
m = 1;
}
cout << fixed << setprecision(10) << (double)(w * h / 2) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll m = 0;
if (w == 2 * x && h == 2 * y) {
m = 1;
}
cout << fixed << setprecision(10) << (double)(w * h) / 2.0... | [
"expression.operation.binary.remove"
] | 815,637 | 815,635 | u701556979 | cpp |
p03001 |
// C - Rectangle Cutting
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
float A = W * H / 2.0;
int multi;
if (x == W / 2 && y == H /... |
// C - Rectangle Cutting
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
float A = W * H / 2.0;
int multi;
if (x == W / 2.0 && y =... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,642 | 815,641 | u790272146 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
int64_t b = (double)W * (double)H / 2;
if ((double)W / 2 == x || (double)H / 2 == y) {
ans++;
}
cout << fixed << setprecision(10);
cout << b << " " << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int ans = 0;
double b = (double)W * (double)H / 2;
if ((double)W / 2 == x && (double)H / 2 == y) {
ans++;
}
cout << fixed << setprecision(10);
cout << b << " " << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 815,663 | 815,662 | u387371565 | cpp |
p03001 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int ptn = 0;
if (W == x * 2 && H == y * 2)
ptn = 1;
printf("%10f %d\n", ans, ptn);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double)W * (double)H / 2;
int ptn = 0;
if (W == x * 2 && H == y * 2)
ptn = 1;
printf("%10f %d\n", ans, ptn);
return 0;
} | [
"type_conversion.add"
] | 815,666 | 815,667 | u807028974 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, a, b;
cin >> x >> y >> a >> b;
double q = x * y / 2;
if (x == a * 2 && y == b * 2) {
cout << q << " " << 1;
} else {
cout << q << " " << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, a, b;
cin >> x >> y >> a >> b;
double q = (double)x * y / 2;
if (x == a * 2 && y == b * 2) {
cout << q << " " << 1;
} else {
cout << q << " " << 0;
}
} | [
"type_conversion.add"
] | 815,676 | 815,677 | u167245594 | 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 << " " << (W == x * 2 && H == y * 2 ? 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << (double)W * H / 2 << " " << (W == x * 2 && H == y * 2 ? 1 : 0)
<< endl;
} | [
"type_conversion.add"
] | 815,690 | 815,691 | u816742421 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
int main() {
double w, h;
int x, y;
cin >> w >> h >> x >> y;
char mode;
if (x == w / 2 && y == h / 2) {
mode = '0';
} else {
mode = '1';
}
double area = w * h / 2;
cout << fixed << setprecision(9) << area << " " << mode << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
double w, h;
int x, y;
cin >> w >> h >> x >> y;
char mode;
if (x == w / 2 && y == h / 2) {
mode = '1';
} else {
mode = '0';
}
double area = w * h / 2;
cout << fixed << setprecision(9) << area << " " << mode << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 815,694 | 815,695 | u418785081 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fix... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fix... | [
"type_conversion.add"
] | 815,702 | 815,703 | u682686221 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double W, H, x, y;
int center;
cin >> W >> H >> x >> y;
;
if (x == W / 2 && y == H / 2)
center = 0;
else
center = 1;
cout << fixed << std::setprecision(6) << (W * H) / 2 << ' ' <<... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double W, H, x, y;
int center;
cin >> W >> H >> x >> y;
;
if (x == W / 2 && y == H / 2)
center = 1;
else
center = 0;
cout << fixed << std::setprecision(6) << (W * H) / 2 << ' ' <<... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 815,704 | 815,705 | u913852240 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 815,721 | 815,722 | u999904282 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double area = (w * h) / 2;
printf("%.12f ", area);
if (x * 2 == w && y * 2 == h)
cout << 1 << " ";
else
cout << 0 << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double area = double(w) * double(h) / 2;
printf("%.12f ", area);
if (x * 2 == w && y * 2 == h)
cout << 1 << " ";
else
cout << 0 << " ";
return 0;
} | [
"call.add",
"call.arguments.change"
] | 815,723 | 815,724 | u866310595 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double area = (w * h) / 2;
printf("%.9f ", area);
if (x * 2 == w && y * 2 == h)
cout << 1 << " ";
else
cout << 0 << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double area = double(w) * double(h) / 2;
printf("%.12f ", area);
if (x * 2 == w && y * 2 == h)
cout << 1 << " ";
else
cout << 0 << " ";
return 0;
} | [
"call.add",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 815,725 | 815,724 | u866310595 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.