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>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * y / 2;
int num = (w =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w =... | [
"identifier.change",
"expression.operation.binary.change"
] | 814,525 | 814,528 | u280728543 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * y / 2;
int num = (w =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int num = (w =... | [
"identifier.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,527 | 814,528 | u280728543 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
using ll = long long int;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << (W * H) / 2.0 << " "
<< (x == (W / 2.0) || y == (H / 2.0) ? 1 : 0) << endl;
} | #include <iomanip>
#include <iostream>
using namespace std;
using ll = long long int;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10) << (W * H) / 2.0 << " "
<< (x == (W / 2.0) && y == (H / 2.0) ? 1 : 0) << endl;
} | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 814,549 | 814,550 | u789199225 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2) {
ll a = w * h;
doub... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2) {
double a = w * h;
... | [
"variable_declaration.type.change"
] | 814,555 | 814,556 | u782144261 | cpp |
p03001 | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * h / 2;
int ans2 = 0;
if (2 * x... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * h / 2;
int ans2 = 0;
if (2 * x... | [
"io.output.change"
] | 814,557 | 814,558 | u547099897 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int multi = 0;
if (x * 2 == w && y * 2 == h) {
multi = 1;
}
printf("%.10f %d\n", ans, multi);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int multi = 0;
if (x * 2 == w && y * 2 == h) {
multi = 1;
}
printf("%.2f0000000000 %d\n", ans, multi);
}
| [
"literal.number.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,569 | 814,570 | u619273584 | cpp |
p03001 | #include <algorithm>
#include <iomanip> // std::setprecision()
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define YES cout << "YES" << endl;
#... | #include <algorithm>
#include <iomanip> // std::setprecision()
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define YES cout << "YES" << endl;
#... | [
"type_conversion.add"
] | 814,575 | 814,576 | u607564800 | cpp |
p03001 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
int flg = 0;
if (x * 2 == w && y * 2 == h) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
int flg = 0;
if (x * 2 == w && y * 2 == h) {
... | [
"variable_declaration.type.primitive.change"
] | 814,586 | 814,587 | u849151695 | cpp |
p03001 | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
typedef... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
typedef... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 814,588 | 814,589 | u564182781 | cpp |
p03001 | #include <cstdio>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10f %d\n", w * h / 2.0, x == w / 2 && y == h / 2 ? 1 : 0);
} | #include <cstdio>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10f %d\n", w * h / 2.0, (x == w / 2.0 && y == h / 2.0) ? 1 : 0);
} | [
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 814,594 | 814,595 | u936558609 | cpp |
p03001 | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | [
"variable_declaration.type.change"
] | 814,614 | 814,615 | u651197500 | cpp |
p03001 | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.change"
] | 814,616 | 814,615 | u651197500 | cpp |
p03001 | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 814,617 | 814,615 | u651197500 | cpp |
p03001 | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#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 i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
typedef long long ll;
usi... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 814,618 | 814,615 | u651197500 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define int64... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define int64... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,619 | 814,620 | u834987206 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | [
"call.add",
"call.arguments.change"
] | 814,621 | 814,622 | u832995587 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REP2(i, x, n) for (int i = x; i <= n; i++)
#define OP(x) cout << x << endl;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REP2(i, x, n) for (int i = x; i <= n; i++)
#define OP(x) cout << x << endl;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename... | [
"literal.number.change",
"io.output.change"
] | 814,628 | 814,629 | u651235280 | cpp |
p03001 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
long long W = 0, H = 0, x = 0, y = 0;
long double ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixe... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
double W = 0, H = 0, x = 0, y = 0, ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixed << setprecisi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 814,634 | 814,635 | u805392425 | cpp |
p03001 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
long long W = 0, H = 0, x = 0, y = 0;
double ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixed << ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
double W = 0, H = 0, x = 0, y = 0, ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixed << setprecisi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 814,636 | 814,635 | u805392425 | cpp |
p03001 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int W = 0, H = 0, x = 0, y = 0;
double ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixed << setpre... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
double W = 0, H = 0, x = 0, y = 0, ans = 0;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
cout << fixed << setprecisi... | [
"variable_declaration.type.primitive.change"
] | 814,637 | 814,635 | u805392425 | cpp |
p03001 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b... | [
"variable_declaration.type.primitive.change"
] | 814,638 | 814,639 | u318042557 | cpp |
p03001 | /*
* atcoder/abc130/c.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a... | /*
* atcoder/abc130/c.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 814,640 | 814,641 | u823862638 | cpp |
p03001 | /*
* atcoder/abc130/c.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a... | /*
* atcoder/abc130/c.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a... | [
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 814,642 | 814,641 | u823862638 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w) * (double)(h) / 2 << ' ';
if (w == x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)(w) * (double)(h) / 2.0 << ' ';
if (w ==... | [
"literal.number.change",
"io.output.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 814,643 | 814,644 | u184929210 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | [
"literal.number.change",
"io.output.change"
] | 814,645 | 814,646 | u322110493 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double area = W * H / 2;
printf("%f ", area);
if (x * 2 == W && y * 2 == H)
cout << 1;
else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double area = W * H / 2;
printf("%f ", area);
if (x * 2 == W && y * 2 == H)
cout << 1;
else
cout << 0;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 814,650 | 814,651 | u581172017 | cpp |
p03001 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
std::cout << std::fixed << std::setprecision(10);
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
std::cout << std::fixed << std::setprecision(10);
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,652 | 814,653 | u027946359 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
int flag = 0;
cin >> W >> H >> x >> y;
if (2 / x == W && 2 / y == H) {
flag = 1;
}
cout << (double)W * H / 2 << " " << flag << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H, x, y;
int flag = 0;
cin >> W >> H >> x >> y;
if (2 * x == W && 2 * y == H) {
flag = 1;
}
cout << (long double)W * H / 2 << " " << flag << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 814,654 | 814,655 | u319965179 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | [
"variable_declaration.type.primitive.change"
] | 814,657 | 814,658 | u007099475 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int res = 0;
if (w % 2 != 0 || h % 2 != 0)
res = 0;
else if (x == w / 2 && y == h / 2)
res = 1;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
int res = 0;
if (w % 2 != 0 || h % 2 != 0)
res = 0;
else if (x == w / 2 && y == h / 2)
res =... | [
"type_conversion.add"
] | 814,685 | 814,686 | u442855610 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << setprecision(10) << double(w) * double(h) / 2 << " "
<< 2 * (x == w && 2 * y == w) << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << setprecision(10) << double(w) * double(h) / 2 << " "
<< (2 * x == w && 2 * y == h) << ... | [
"identifier.change",
"io.output.change"
] | 814,689 | 814,690 | u393879608 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
long double kotae = w * h / 2;
ll ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << kotae <... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
double kotae = w * h / 2;
ll ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << kot... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change"
] | 814,693 | 814,694 | u553123421 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double kotae = w * h / 2;
ll ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << kotae << " "... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
double kotae = w * h / 2;
ll ans = 0;
if (2 * x == w && 2 * y == h) {
ans = 1;
}
cout << fixed << setprecision(10) << kot... | [
"variable_declaration.type.widen.change"
] | 814,695 | 814,694 | u553123421 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(20) << double(W * H / 2) << ' ';
cout << int(2 * x == W && 2 * y == H) << endl;
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(20) << W * H / 2 << ' ';
cout << int(2 * x == W && 2 * y == H) << endl;
return 0;
... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 814,698 | 814,699 | u433685759 | 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;
double menseki = (double)w * (double)h / 2;
int condition = 0;
if (x == w / 2 && y == h / 2)
condition = 1;
printf("%6f %d", menseki... | #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;
double menseki = (double)w * h / 2;
int condition = 0;
if (x == w / 2 && y == h / 2)
condition = 1;
printf("%6f %d", menseki, con... | [
"variable_declaration.type.primitive.change"
] | 814,713 | 814,714 | u965095643 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
int mode = 0;
long double ans = (W * H) / 2;
if (W % 2 == 0 && H % 2 == 0 && x == W / 2 && y == H / 2) {
mode = 1;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
int mode = 0;
long double ans = (W * H) / 2.0;
if (W % 2 == 0 && H % 2 == 0 && x == W / 2 && y == H / 2) {
mode = 1;
}
cou... | [
"literal.number.change",
"expression.operation.binary.change"
] | 814,725 | 814,726 | u083494782 | cpp |
p03001 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <float.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#incl... | [
"control_flow.branch.if.condition.change"
] | 814,730 | 814,731 | u152577008 | cpp |
p03001 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [
"variable_declaration.type.primitive.change"
] | 814,732 | 814,733 | u137332130 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int W, H, x, y;
int main() {
cin >> W >> H >> x >> y;
int pat = 0;
double a, b;
a = W / 2.0;
b = H / 2.0;
if (a == x && b == y)
pat = 1;
// cout << pat << endl;
printf("%.10f ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int W, H, x, y;
int main() {
cin >> W >> H >> x >> y;
int pat = 0;
double a, b;
a = W / 2.0;
b = H / 2.0;
if (a == x && b == y)
pat = 1;
// cout << pat << endl;
printf("%.10f ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 814,736 | 814,737 | u455366471 | cpp |
p03001 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
//#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
//#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync... | [
"literal.number.change",
"io.output.change"
] | 814,740 | 814,741 | u847969825 | cpp |
p03001 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tu... | [
"variable_declaration.type.change"
] | 814,745 | 814,746 | u840713046 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"expression.operation.binary.remove"
] | 814,763 | 814,762 | u406237526 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"expression.operation.binary.add"
] | 814,779 | 814,780 | u734397606 | cpp |
p03001 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int long long
#define pb push_back
#define ins insert
#define rs resize
#define br break;
#define cont continue;
#define vi vector<int>
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int long long
#define pb push_back
#define ins insert
#define rs resize
#define br break;
#define cont continue;
#define vi vector<int>
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,798 | 814,799 | u970664746 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | [
"type_conversion.add"
] | 814,806 | 814,807 | u265187423 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double H, W, h, w;
cin >> H, W, h, w;
cout << fixed << setprecision(10) << H * W / 2.0 << " " << fixed
<< setprecision(0) << (H / 2 == h && W / 2 == w ? 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double H, W, h, w;
cin >> H >> W >> h >> w;
cout << fixed << setprecision(10) << H * W / 2.0 << " " << fixed
<< setprecision(0) << (H / 2 == h && W / 2 == w ? 1 : 0) << endl;
} | [] | 814,823 | 814,824 | u991713078 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H;
long long x, y;
cin >> W >> H >> x >> y;
if (x + x == W && y + y == H) {
cout << fixed << setprecision(9);
cout << W * H / 2 << " " << 1 << endl;
} else {
cout << fixed << setprecision(9);
cout << W * H / 2 << " " << 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H;
double x, y;
cin >> W >> H >> x >> y;
if (x + x == W && y + y == H) {
cout << fixed << setprecision(1);
cout << W * H / 2 << " " << 1 << endl;
} else {
cout << fixed << setprecision(1);
cout << W * H / 2 << " " << 0 << en... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"io.output.change"
] | 814,837 | 814,838 | u371149954 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
type... | [
"variable_declaration.type.primitive.change"
] | 814,842 | 814,843 | u852862907 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
type... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 814,844 | 814,843 | u852862907 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"variable_declaration.type.primitive.change"
] | 814,845 | 814,846 | u852862907 | cpp |
p03001 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,847 | 814,848 | u616794313 | cpp |
p03001 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 814,849 | 814,848 | u616794313 | cpp |
p03001 | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
if (x == w / 2 && y == h / 2) {
double menseki = w * h / 2;
printf("%lf 1", menseki);
return 0;
}
ans = w * h / 2;
print... | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
if (x == w / 2 && y == h / 2) {
double menseki = w * h / 2;
printf("%lf 1", menseki);
return 0;
}
ans = w * h / 2;
printf("... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 814,850 | 814,851 | u616794313 | cpp |
p03001 | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
if (x == w / 2 && y == h / 2) {
double menseki = w * h / 2;
printf("%f 1", menseki);
return 0;
}
ans = w * h / 2;
printf... | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans;
if (x == w / 2 && y == h / 2) {
double menseki = w * h / 2;
printf("%lf 1", menseki);
return 0;
}
ans = w * h / 2;
printf("... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,852 | 814,851 | u616794313 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,855 | 814,854 | u722640678 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 814,864 | 814,865 | u384161413 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 814,866 | 814,867 | u384161413 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tup... | [
"call.add",
"call.arguments.change"
] | 814,876 | 814,877 | u944804272 | cpp |
p03001 | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 814,880 | 814,881 | u441744624 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
int w, h, x, y;
cin >> w >> h >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
double w, h, x, y;
cin >> w >> h ... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"io.output.change"
] | 814,884 | 814,885 | u738164318 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | [
"expression.operation.unary.logical.remove"
] | 814,890 | 814,891 | u616360029 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | [
"expression.operation.unary.logical.remove"
] | 814,892 | 814,891 | u616360029 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | [
"type_conversion.add"
] | 814,893 | 814,891 | u616360029 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.12f %d", double(w) * double(x) / 2, x * 2 == w && y * 2 == h);
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.12f %d", double(w) * double(h) / 2, x * 2 == w && y * 2 == h);
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 814,896 | 814,897 | u359856428 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2;
int ans;
if (w == 2 * x && h == 2 * y)
ans = 1;
else
ans = 0;
printf("%lf %d\n"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
double w, h;
int x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2;
int ans;
if (w == 2 * x && h == 2 * y)
ans = 1;
else
ans = 0;
printf("... | [
"variable_declaration.type.primitive.change"
] | 814,905 | 814,906 | u681323954 | cpp |
p03001 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 814,913 | 814,914 | u683769494 | cpp |
p03001 | #include <bits/stdc++.h>
/* #define int long long */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define MOD 10000... | #include <bits/stdc++.h>
/* #define int long long */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define MOD 10000... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 814,915 | 814,916 | u510749912 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, x, y, p;
double ans;
cin >> a >> b >> x >> y;
ans = a * b / 2;
if ((a / 2 == x) && (b / 2 == y))
p = 1;
else
p = 0;
cout << fixed << setprecision(10);
cout << ans << ' ' << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p;
double a, b, x, y;
double ans;
cin >> a >> b >> x >> y;
ans = a * b / 2;
if ((a / 2 == x) && (b / 2 == y))
p = 1;
else
p = 0;
cout << fixed << setprecision(10);
cout << ans << ' ' << p << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.add",
"variable_declaration.remove"
] | 814,917 | 814,918 | u141511165 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
ll W, H, x, y;
cin >> W >> H >>... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
ll W, H, x, y;
cin >> W >> H >>... | [
"control_flow.branch.if.condition.change"
] | 814,925 | 814,926 | u475843109 | cpp |
p03001 | #include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <cfenv>
#include <cinttypes>
#include <cstdi... | #include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <cfenv>
#include <cinttypes>
#include <cstdi... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 814,929 | 814,928 | u154148649 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2 && y == H / 2) {
cout << double(W * H) / 2.0 << " " << 1 << endl;
} else {
cout << double(W * H) / 2.0 << " " << 0 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2 && y == H / 2) {
cout << double(W * H) / 2.0 << " " << 1 << endl;
} else {
cout << double(W * H) / 2.0 << " " << 0 << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 814,932 | 814,933 | u942850310 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 814,942 | 814,943 | u651314218 | cpp |
p03001 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
LL W, H, x, y;
std::cin >> W >> H... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
LL W, H, x, y;
std::cin >> W >> H... | [
"type_conversion.add"
] | 814,948 | 814,949 | u116523315 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,960 | 814,961 | u277556971 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,962 | 814,961 | u277556971 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)(1e9 + 7)
#define mod (ll)(1e9 + 7)
#defi... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 814,963 | 814,961 | u277556971 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
#define e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
#define e... | [
"control_flow.branch.if.condition.change"
] | 814,968 | 814,969 | u277556971 | cpp |
p03001 | #include <bits/stdc++.h>
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 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(10);
cout << double(W) * double(H) / 2 << " ";
if (x * 2 == W && y * 2 == H)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"call.arguments.change",
"call.add"
] | 814,972 | 814,973 | u735528230 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, j, n) for (int i = (j); i < (n); i++)
#define per(i, n, j) for (int i = (n); i >= (j); i--)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(... | #include <bits/stdc++.h>
#define rep(i, j, n) for (int i = (j); i < (n); i++)
#define per(i, n, j) for (int i = (n); i >= (j); i--)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 814,974 | 814,975 | u437739548 | cpp |
p03001 | #include <bits/stdc++.h>
#define rep(i, j, n) for (int i = (j); i < (n); i++)
#define per(i, n, j) for (int i = (n); i >= (j); i--)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(... | #include <bits/stdc++.h>
#define rep(i, j, n) for (int i = (j); i < (n); i++)
#define per(i, n, j) for (int i = (n); i >= (j); i--)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 814,976 | 814,975 | u437739548 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long W, H, x, y;
cin >> W >> H >> x >> y;
double area = W * H / 2;
int way;
if (x == W - x && y == H - y) {
way = 1;
} else {
way = 0;
}
cout << fixed << setprecision(10) << area;
;
cout << " " << way << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long W, H, x, y;
cin >> W >> H >> x >> y;
double area = W * H / 2.0;
int way;
if (x == W - x && y == H - y) {
way = 1;
} else {
way = 0;
}
cout << fixed << setprecision(10) << area;
;
cout << " " << way << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 814,991 | 814,992 | u538283043 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T> using Grid = vector<vector<T>>;
int main() {
ll w, h,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T> using Grid = vector<vector<T>>;
int main() {
ll w, h,... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 814,993 | 814,994 | u857147058 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T> using Grid = vector<vector<T>>;
int main() {
ll w, h,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T> using Grid = vector<vector<T>>;
int main() {
ll w, h,... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"literal.number.change",
"expression.operation.binary.change"
] | 814,995 | 814,994 | u857147058 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int cnt = 0;
if (w == x + x || h == y + y)
cnt = 1;
double ans;
ans = w * h / 2;
cout << setprecision(15) << ans << ' ';
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int cnt = 0;
if (w == x + x && h == y + y)
cnt = 1;
double ans;
ans = w * h / 2;
cout << setprecision(15) << ans << ' ';
cout << cnt << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 815,015 | 815,016 | u050087249 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H, X, Y;
cin >> W >> H >> X >> Y;
if (X == W / 2 && Y == H / 2) {
long double S = X * Y * 2;
cout << fixed << S << " " << 1 << endl;
} else {
long double S = (W / 2) * H;
cout << fixed << S << " " << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double W, H, X, Y;
cin >> W >> H >> X >> Y;
if (X == W / 2 && Y == H / 2) {
long double S = X * Y * 2;
cout << fixed << S << " " << 1 << endl;
} else {
long double S = (W / 2) * H;
cout << fixed << S << " " << 0 << endl;
}
} | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.widen.change"
] | 815,023 | 815,024 | u740002394 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W, H, X, Y;
cin >> W >> H >> X >> Y;
if (X == W / 2 && Y == H / 2) {
long double S = X * Y * 2;
cout << S << " " << 1 << endl;
} else {
long double S = (W / 2) * H;
cout << fixed << S << " " << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double W, H, X, Y;
cin >> W >> H >> X >> Y;
if (X == W / 2 && Y == H / 2) {
long double S = X * Y * 2;
cout << fixed << S << " " << 1 << endl;
} else {
long double S = (W / 2) * H;
cout << fixed << S << " " << 0 << endl;
}
} | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.widen.change",
"io.output.change"
] | 815,025 | 815,024 | u740002394 | cpp |
p03001 | #include <stdio.h>
int main() {
long long w, h, x, y;
double s;
int t;
while (~scanf("%lld%lld%lld%lld", &w, &h, &x, &y)) {
t = 0;
s = (double)w * (double)h / 2;
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2)
t = 1;
printf("%.6llf %d\n", s, t);
}
return 0;
} | #include <stdio.h>
int main() {
long long w, h, x, y;
double s;
int t;
while (~scanf("%lld%lld%lld%lld", &w, &h, &x, &y)) {
t = 0;
s = (double)w * (double)h / 2;
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2)
t = 1;
printf("%.6lf %d\n", s, t);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,030 | 815,031 | u018679195 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
long double res = W * H / 2;
cout << fixed << setprecision(6) << res << " ";
if (2 * x == W && 2 * y == H)
cout << "1" << endl;
else
cout << "0" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
long double res = (long double)W * H / 2;
cout << fixed << setprecision(6) << res << " ";
if (2 * x == W && 2 * y == H)
cout << "1" << endl;
else
cout << "0" << endl;
retu... | [
"type_conversion.add"
] | 815,038 | 815,039 | u315542000 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int answ = 0;
if ((w % 2 == 0 && h % 2 == 0) && (w / 2 == x && h / 2 == y))
answ = 1;
cout << setprecision(10) << ans << " " << answ << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int answ = 0;
if ((w % 2 == 0 && h % 2 == 0) && (w / 2 == x && h / 2 == y))
answ = 1;
cout << setprecision(10) << ans << " " << answ << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 815,048 | 815,049 | u105533331 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm(l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm(l... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 815,052 | 815,053 | u363936720 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm(l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm(l... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 815,054 | 815,053 | u363936720 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,055 | 815,056 | u530107518 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | [
"literal.number.change",
"io.output.change"
] | 815,057 | 815,058 | u342075214 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const double PI = acos(-1);
const int mod = 1e9 + 7;
const long long INF = (1LL << 60);
ll gcd(ll a, ll b) { return b ? gcd(b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const double PI = acos(-1);
const int mod = 1e9 + 7;
const long long INF = (1LL << 60);
ll gcd(ll a, ll b) { return b ? gcd(b... | [
"misc.opposites",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 815,061 | 815,062 | u167755809 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 815,072 | 815,073 | u314642288 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 815,074 | 815,073 | u314642288 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 815,078 | 815,079 | u981759938 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | [
"literal.number.change",
"expression.operation.binary.change"
] | 815,080 | 815,079 | u981759938 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;... | [
"literal.number.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 815,081 | 815,079 | u981759938 | cpp |
p03001 | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return abs(x - y) / gcd(x, y); }
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10lf ", w * h / ... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return abs(x - y) / gcd(x, y); }
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10lf ", (double)... | [
"type_conversion.add"
] | 815,088 | 815,089 | u692704469 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.