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 == x * 2 && h == y * 2) ? 1 : 0;
printf("%.6f %d\n", ans, num);
return 0;
}
| #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 == x * 2 && h == y * 2) ? 1 : 0;
printf("%.6f %d\n", ans, num);
return 0;
}
| [
"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 == x * 2 && h == y * 2) ? 1 : 0;
printf("%.10f %d\n", ans, num);
return 0;
}
| #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 == x * 2 && h == y * 2) ? 1 : 0;
printf("%.6f %d\n", ans, num);
return 0;
}
| [
"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;
double ans = a / 2;
cout << ans << " " << 1 << endl;
} else {
ll a = w * h;
double ans = a / 2;
cout << ans << " " << 0 << endl;
}
return 0;
} | #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;
double ans = a / 2;
cout << ans << " " << 1 << endl;
} else {
double a = w * h;
double ans = a / 2;
cout << ans << " " << 0 << endl;
}
return 0;
} | [
"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 == w && 2 * y == h)
ans2 = 1;
cout << setprecision(15) << ans1 << ans2 << endl;
return 0;
}
| #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 == w && 2 * y == h)
ans2 = 1;
cout << setprecision(15) << ans1 << " " << ans2 << endl;
return 0;
}
| [
"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;
#define NO cout << "NO" << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define pai 3.14159265358979323846
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// setprecision(n)
/* map<string,int> */
/* 大文字を小文字に変換 tolower*/
/* 小文字を大文字に変換 toupper*/
/* 辞書順 next_permutation(a.begin(),a.end()) */
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << setprecision(20) << (w * h) / 2 << ' ' << 1 << endl;
} else {
cout << setprecision(20) << (w * h) / 2 << ' ' << 0 << 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;
#define NO cout << "NO" << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define pai 3.14159265358979323846
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// setprecision(n)
/* map<string,int> */
/* 大文字を小文字に変換 tolower*/
/* 小文字を大文字に変換 toupper*/
/* 辞書順 next_permutation(a.begin(),a.end()) */
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
if (2 * x == w && 2 * y == h) {
cout << setprecision(20) << (double)(w * h) / 2 << ' ' << 1 << endl;
} else {
cout << setprecision(20) << (double)(w * h) / 2 << ' ' << 0 << 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) {
flg = 1;
}
int ans = (double)h * w / 2;
cout << fixed << setprecision(10) << ans << " " << flg << endl;
return 0;
} | #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) {
flg = 1;
}
double ans = (double)h * w / 2;
cout << fixed << setprecision(10) << ans << " " << flg << endl;
return 0;
}
| [
"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 pair<int, int> P;
// typedef pair<ll, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = LONG_LONG_MAX / 100;
// const ll INF = (1ll << 31) - 1;
// const ll INF = 1e15;
const ll MINF = LONG_LONG_MIN;
// const int INF = INT_MAX / 10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
// typedef pair<int, int> P;
// typedef pair<double, double> P;
#define ret() return 0;
bool contain(set<char> &s, char a) { return s.find(a) != s.end(); }
// ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
const int mod = 1000000007;
// const ll mod = 1e10;
typedef priority_queue<long long, vector<long long>, greater<long long>> PQ_ASK;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
bool b = x == (w / 2) && y == (h / 2);
printf("%.20f %d\n", double(w) * h / 2, b ? 1 : 0);
}
| #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 pair<int, int> P;
// typedef pair<ll, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = LONG_LONG_MAX / 100;
// const ll INF = (1ll << 31) - 1;
// const ll INF = 1e15;
const ll MINF = LONG_LONG_MIN;
// const int INF = INT_MAX / 10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
// typedef pair<int, int> P;
// typedef pair<double, double> P;
#define ret() return 0;
bool contain(set<char> &s, char a) { return s.find(a) != s.end(); }
// ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
const int mod = 1000000007;
// const ll mod = 1e10;
typedef priority_queue<long long, vector<long long>, greater<long long>> PQ_ASK;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
bool b = x == (w / 2) && y == (h / 2);
printf("%.20f %d\n", w * h / 2, b ? 1 : 0);
}
| [
"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;
using namespace std;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
ll ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | #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;
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | [
"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;
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
ll ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | #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;
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | [
"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;
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
ll ans = w * h * 0.5;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | #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;
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | [
"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;
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int ans = w * h * 0.5;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | #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;
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * 0.5 * h;
char way = '0';
if (x == 0.5 * w && y == 0.5 * h)
way = '1';
cout << fixed << setprecision(10);
cout << ans << ' ' << way << endl;
return 0;
} | [
"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 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 ww, hh, xx, yy;
cin >> ww >> hh >> xx >> yy;
cout << (long double)(ww * hh) / 2.0;
if (2 * xx == ww && 2 * yy == hh) {
puts("1");
} else {
puts("0");
}
return 0;
} | #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 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 ww, hh, xx, yy;
cin >> ww >> hh >> xx >> yy;
cout << (long double)(ww * hh) / 2.0;
if (2 * xx == ww && 2 * yy == hh) {
puts(" 1");
} else {
puts(" 0");
}
return 0;
} | [
"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() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n, i##_len = (n); i >= 0; i--)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
double ans = (a * b) / 2;
bool flag = false;
if (2 * x == a && 2 * y == b)
flag = true;
cout << fixed << setprecision(9) << ans << ' ';
if (flag)
cout << 1;
else
cout << 0;
}
| #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() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n, i##_len = (n); i >= 0; i--)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
double ans = (double(a) * double(b)) / 2;
bool flag = false;
if (2 * x == a && 2 * y == b)
flag = true;
cout << fixed << setprecision(9) << ans << ' ';
if (flag)
cout << 1;
else
cout << 0;
}
| [
"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 T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << setprecision(10) << w * h / 2 << " ";
if (x * 2 == w && y * 2 == h)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #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 T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
// 中心を通る直線で半分にするのが小さい方の面積の最大値
// x, yが中心と同じなら複数
// それ以外は中心と(x, y)を通る直線だけ
cout << setprecision(10) << w * h / 2.0 << " ";
if (x * 2 == w && y * 2 == h)
cout << 1 << endl;
else
cout << 0 << endl;
}
| [
"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 << fixed << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | #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 << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"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 << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | #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 << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"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 << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | #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 << setprecision(10);
cout << ans << " ";
if (W / 2 == x and H / 2 == y)
cout << 1 << endl;
else
cout << 0 << endl;
} | [
"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) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
// ABC130 C - Rectangle Cutting
// 2020.06.19
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
bool flag;
if (x * 2 == W && y * 2 == H) {
flag = true;
} else {
flag = false;
}
cout << fixed << setprecision(10) << ans << " ";
cout << flag << endl;
} | #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) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
// ABC130 C - Rectangle Cutting
// 2020.06.19
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
bool flag;
if (x * 2 == W && y * 2 == H) {
flag = true;
} else {
flag = false;
}
cout << fixed << setprecision(10) << ans << " ";
cout << flag << endl;
} | [
"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, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS 0.000000001
ll W, H, x, y;
void solve() {
cin >> W >> H >> x >> y;
// 小さい方の面積が最大となるのは(x,
// y)と長方形の中点を通りちょうど２分される場合。
// その場合の面積はちょうど長方形の半分。
// (x, y)と等しい場合は無限の直線が解にある。
cout << fixed << double(W) * double(H) * 0.5 << " "
<< (x * x == W and y * y == H) << endl;
}
int main() {
cout.precision(15);
solve();
return 0;
}
| /*
* 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, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS 0.000000001
ll W, H, x, y;
void solve() {
cin >> W >> H >> x >> y;
// 小さい方の面積が最大となるのは(x,
// y)と長方形の中点を通りちょうど２分される場合。
// その場合の面積はちょうど長方形の半分。
// (x, y)と等しい場合は無限の直線が解にある。
cout << fixed << double(W) * double(H) * 0.5 << " "
<< (x * 2 == W and y * 2 == H) << endl;
}
int main() {
cout.precision(15);
solve();
return 0;
}
| [
"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, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS 0.000000001
ll W, H, x, y;
void solve() {
cin >> W >> H >> x >> y;
// 小さい方の面積が最大となるのは(x,
// y)と長方形の中点を通りちょうど２分される場合。
// その場合の面積はちょうど長方形の半分。
// (x, y)と等しい場合は無限の直線が解にある。
cout << double(W) * double(H) * 0.5 << " " << (x * x == W and y * y == H)
<< endl;
}
int main() {
cout.precision(15);
solve();
return 0;
}
| /*
* 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, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS 0.000000001
ll W, H, x, y;
void solve() {
cin >> W >> H >> x >> y;
// 小さい方の面積が最大となるのは(x,
// y)と長方形の中点を通りちょうど２分される場合。
// その場合の面積はちょうど長方形の半分。
// (x, y)と等しい場合は無限の直線が解にある。
cout << fixed << double(W) * double(H) * 0.5 << " "
<< (x * 2 == W and y * 2 == H) << endl;
}
int main() {
cout.precision(15);
solve();
return 0;
}
| [
"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 * 2 || h == y * 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#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 == x * 2 && h == y * 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"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};
const int dy[4] = {0, 1, 0, -1};
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define m0(x) memset((x), 0, sizeof((x)))
#define m1(x) memset((x), -1, sizeof((x)))
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define RALL(x) (x).rbegin(), (x).rend() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
#define all(x) (x).begin(), (x).end()
//略記
#define pb emplace_back // vectorヘの挿入
#define mp make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define BITCOUNT __builtin_popcount
#define BITCOUNT_LL(x) __builtin_popcountll(x)
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; \
c##p = next_permutation(all(c))) //順列 123 132 213 231 312 321
#define BIT(n) (1LL << (n))
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ": " << (A) << std::endl;
#else
#define PRINT(A)
#endif
//入力高速化
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
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;
}
signed main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H;
ans /= 2;
cout << ans << " ";
if (x * 2 == W && y * 2 == H) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | #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};
const int dy[4] = {0, 1, 0, -1};
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define m0(x) memset((x), 0, sizeof((x)))
#define m1(x) memset((x), -1, sizeof((x)))
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define RALL(x) (x).rbegin(), (x).rend() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
#define all(x) (x).begin(), (x).end()
//略記
#define pb emplace_back // vectorヘの挿入
#define mp make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define BITCOUNT __builtin_popcount
#define BITCOUNT_LL(x) __builtin_popcountll(x)
#define perm(c) \
sort(all(c)); \
for (bool c##p = 1; c##p; \
c##p = next_permutation(all(c))) //順列 123 132 213 231 312 321
#define BIT(n) (1LL << (n))
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ": " << (A) << std::endl;
#else
#define PRINT(A)
#endif
//入力高速化
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
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;
}
signed main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H;
ans /= 2;
cout << ans << " ";
if (x * 2 == W && y * 2 == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"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("%llf %d\n", (double)W * (double)H / 2, (x + x == W) && (y + y == H));
return (0);
} | #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("%lf %d\n", (double)W * (double)H / 2, (x + x == W) && (y + y == H));
return (0);
} | [
"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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
cout << w * h / 2 << " " << 1 << endl;
} else {
cout << w * h / 2 << " " << 0 << endl;
}
return 0;
} | #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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
if (w / 2 == x && h / 2 == y) {
cout << w * h / 2 << " " << 1 << endl;
} else {
cout << w * h / 2 << " " << 0 << endl;
}
return 0;
} | [
"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;
if (res)
cout << fixed << setprecision(10) << ans << " " << res << endl;
else
cout << fixed << setprecision(10) << ans << " " << res << endl;
return 0;
} | #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 = 1;
if (res)
cout << fixed << setprecision(10) << ans << " " << res << endl;
else
cout << fixed << setprecision(10) << ans << " " << res << endl;
return 0;
} | [
"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) << "\n";
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* print new lines
*/ | #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) << "\n";
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* print new lines
*/ | [
"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 << " " << ans << endl;
}
| #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) << kotae << " " << ans << endl;
} | [
"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 << " " << ans << endl;
} | #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) << kotae << " " << ans << endl;
} | [
"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 0;
} | #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, condition);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
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, condition);
return 0;
} | [
"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 << setprecision(120) << ans;
cout << " " << mode << endl;
return 0;
}
| #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;
}
cout << setprecision(120) << ans;
cout << " " << mode << endl;
return 0;
} | [
"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>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LL long long
#define pii pair<int, int>
#define pLL pair<LL, LL>
#define mp make_pair
#define mt make_tuple
#define pq priority_queue<LL>
#define pqg priority_queue<LL, vector<LL>, greater<LL>>
#define pb push_back
#define vecLL vector<LL>
#define vecpii vector<pii>
#define vecpLL vector<pLL>
#define vecbL vector<bool>
#define endl "\n"
#define REP(e, v) for (auto e : v)
#define rep(i, a, n) for (LL i = a; i < n; i++)
#define Arep(i, a, n) for (i = a; i < n; i++)
#define INF LLONG_MAX / 2
#define DINF DBL_MAX / 2
using namespace std;
/*↓マイライブラリ↓*/
// clock_t start = clock();
//
// clock_t end = clock();
//
// const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
// 1000.0; printf("time %lf[ms]\n", time);
LL linp() {
LL x;
scanf("%lld", &x);
return x;
}
LL mod(LL i) {
LL mi = i % 1000000007;
if (mi < 0)
mi += 1000000007;
return mi;
}
LL digit(LL x, LL n) {
LL count = 1;
while (x >= n) {
x = x / n;
count++;
}
return count;
}
LL gcd(LL i, LL j) {
if (j != 0)
return gcd(j, i % j);
else
return i;
}
pLL extgcd(LL a, LL b) { // ax+by = 1の解
pLL ans;
if (b != 0) {
pLL next = extgcd(b, a % b);
ans.first = next.second;
ans.second = next.first - (a / b) * next.second;
} else {
ans = pLL(1, 0);
}
return ans;
}
LL division(LL a, LL b, LL m) { return mod(mod(a) * mod(extgcd(b, m).first)); }
LL numperm_mod(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res = mod(res * mod(i));
}
return mod(res);
}
LL numperm(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res *= i;
}
return res;
}
LL pow_mod(LL x, LL y) {
x = mod(x);
if (y == 1) {
return mod(x);
}
LL res = mod(pow_mod(mod(x * x), y / 2));
if (y % 2 == 0) {
return res;
} else {
return mod(x * res);
}
}
LL pow(LL x, LL y) {
if (y == 1) {
return x;
}
if (y % 2 == 0) {
return pow(x * x, y / 2);
} else {
return x * pow(x * x, y / 2);
}
}
bool isPrime(LL X) {
rep(i, 2, (LL)(sqrt(X) + 1)) {
if (X % i == 0) {
return false;
}
}
return true;
}
vecLL Eratosthenes(LL n) { //素数のベクトルを返す
bool isPrime[n];
fill(isPrime, isPrime + n, true);
isPrime[0] = isPrime[1] = false;
rep(i, 2, sqrt(n) + 1) {
if (isPrime[i]) {
for (LL j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
vecLL P;
rep(i, 2, n + 1) {
if (isPrime[i]) {
P.push_back(i);
}
}
return P;
}
struct edge { //枝
LL to, cost;
double dcost; //コストが整数でない場合に使う
};
struct vertex { //頂点(枝付き)
LL key;
double dkey; //キーが整数でない場合に使う
vector<edge> edges; //頂点から伸びる枝
};
class Graph {
public:
LL V; //頂点数
vertex *vertices; //グラフ
Graph(LL v) { //頂点数を指定してグラフの初期化
V = v; //頂点数
vertices = new vertex[V]; //頂点集合
rep(i, 0, V) {
vertices[i].key = -1; //キー初期値は-1
vertices[i].dkey = -1; //キー初期値は-1
}
}
void setDE(LL i, LL j, LL cos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.cost = cos;
vertices[i].edges.push_back(e);
return;
}
void setDE(LL i, LL j, double dcos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.dcost = dcos;
vertices[i].edges.push_back(e);
return;
}
void setUDE(LL i, LL j, LL cos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.cost = ej.cost = cos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setUDE(LL i, LL j, double dcos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.dcost = ej.dcost = dcos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setKey(LL i, LL newKey) { //キー変更
vertices[i].key = newKey;
}
void setKey(LL i, double newKey) { //キー変更
vertices[i].key = newKey;
}
edge getEdge(LL i, LL j) {
rep(a, 0, vertices[i].edges.size()) {
if (vertices[i].edges[a].to == j) {
return vertices[i].edges[a];
}
}
return (edge){j, INF, DINF}; //なければ,コストINFの枝を返す
}
void bellman_ford(LL s, LL b[]) {
fill(b, b + V, INF);
b[s] = 0;
while (true) {
bool update = false;
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
edge e = vertices[i].edges[j];
if (b[e.to] > b[i] + e.cost) {
b[e.to] = b[i] + e.cost;
update = true;
}
}
}
if (!update)
break;
}
return;
}
void dijkstra(LL s,
LL d[]) { //ダイクストラ(始点を入力とし、各点への最小距離を返す)
priority_queue<pLL, vector<pLL>, greater<pLL>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(pLL(0, s));
while (!que.empty()) {
pLL p = que.top();
que.pop();
LL v = p.second;
if (d[v] < p.first)
continue;
rep(i, 0, vertices[v].edges.size()) {
edge e = vertices[v].edges[i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pLL(d[e.to], e.to));
}
}
}
return;
}
void warshall_floyd(LL **w) {
rep(i, 0, V) {
rep(j, 0, V) { w[i][j] = INF; }
}
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
w[i][vertices[i].edges[j].to] = vertices[i].edges[j].cost;
}
}
rep(i, 0, V) { w[i][i] = 0; }
rep(i, 0, V) {
rep(j, 0, V) {
rep(k, 0, V) { w[i][j] = min(w[i][j], w[i][k] + w[k][j]); }
}
}
}
};
class UF {
public:
LL N;
LL *par;
LL *rank;
UF(LL n) {
N = n;
par = new LL[N];
rank = new LL[N];
rep(i, 0, N) {
par[i] = i;
rank[i] = i;
}
return;
}
LL root(LL x) {
if (x == par[x])
return x;
else
return par[x] = root(par[x]);
}
bool same(LL x, LL y) { return (root(x) == root(y)); }
void Union(LL x, LL y) {
LL rtx = root(x);
LL rty = root(y);
if (rank[rtx] < rank[rty]) {
par[rtx] = rty;
} else {
par[rty] = rtx;
if (rank[rtx] == rank[rty]) {
rank[rtx]++;
}
}
}
};
class ST {};
/*↑マイライブラリ↑*/
LL solveA() {
LL X, A;
cin >> X >> A;
if (X < A)
cout << 0;
else
cout << 10;
return 0;
}
LL solveB() {
LL N, X;
cin >> N >> X;
LL count = 0;
LL dist = 0;
count++;
rep(i, 0, N) {
dist += linp();
if (dist > X) {
cout << count;
return 0;
}
count++;
}
cout << count;
return 0;
}
LL solveC() {
LL W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.11f ", (double)W * H / 2);
if (x == W / 2 && y == H / 2)
cout << 1;
else
cout << 0;
return 0;
}
LL solveD() { return 0; }
LL solveE() { return 0; }
signed main() {
// solveA();
// solveB();
solveC();
// solveD();
// solveE();
return 0;
}
| #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>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LL long long
#define pii pair<int, int>
#define pLL pair<LL, LL>
#define mp make_pair
#define mt make_tuple
#define pq priority_queue<LL>
#define pqg priority_queue<LL, vector<LL>, greater<LL>>
#define pb push_back
#define vecLL vector<LL>
#define vecpii vector<pii>
#define vecpLL vector<pLL>
#define vecbL vector<bool>
#define endl "\n"
#define REP(e, v) for (auto e : v)
#define rep(i, a, n) for (LL i = a; i < n; i++)
#define Arep(i, a, n) for (i = a; i < n; i++)
#define INF LLONG_MAX / 2
#define DINF DBL_MAX / 2
using namespace std;
/*↓マイライブラリ↓*/
// clock_t start = clock();
//
// clock_t end = clock();
//
// const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
// 1000.0; printf("time %lf[ms]\n", time);
LL linp() {
LL x;
scanf("%lld", &x);
return x;
}
LL mod(LL i) {
LL mi = i % 1000000007;
if (mi < 0)
mi += 1000000007;
return mi;
}
LL digit(LL x, LL n) {
LL count = 1;
while (x >= n) {
x = x / n;
count++;
}
return count;
}
LL gcd(LL i, LL j) {
if (j != 0)
return gcd(j, i % j);
else
return i;
}
pLL extgcd(LL a, LL b) { // ax+by = 1の解
pLL ans;
if (b != 0) {
pLL next = extgcd(b, a % b);
ans.first = next.second;
ans.second = next.first - (a / b) * next.second;
} else {
ans = pLL(1, 0);
}
return ans;
}
LL division(LL a, LL b, LL m) { return mod(mod(a) * mod(extgcd(b, m).first)); }
LL numperm_mod(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res = mod(res * mod(i));
}
return mod(res);
}
LL numperm(LL x, LL y) {
LL res = 1;
for (LL i = x; i >= y; i--) {
res *= i;
}
return res;
}
LL pow_mod(LL x, LL y) {
x = mod(x);
if (y == 1) {
return mod(x);
}
LL res = mod(pow_mod(mod(x * x), y / 2));
if (y % 2 == 0) {
return res;
} else {
return mod(x * res);
}
}
LL pow(LL x, LL y) {
if (y == 1) {
return x;
}
if (y % 2 == 0) {
return pow(x * x, y / 2);
} else {
return x * pow(x * x, y / 2);
}
}
bool isPrime(LL X) {
rep(i, 2, (LL)(sqrt(X) + 1)) {
if (X % i == 0) {
return false;
}
}
return true;
}
vecLL Eratosthenes(LL n) { //素数のベクトルを返す
bool isPrime[n];
fill(isPrime, isPrime + n, true);
isPrime[0] = isPrime[1] = false;
rep(i, 2, sqrt(n) + 1) {
if (isPrime[i]) {
for (LL j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
vecLL P;
rep(i, 2, n + 1) {
if (isPrime[i]) {
P.push_back(i);
}
}
return P;
}
struct edge { //枝
LL to, cost;
double dcost; //コストが整数でない場合に使う
};
struct vertex { //頂点(枝付き)
LL key;
double dkey; //キーが整数でない場合に使う
vector<edge> edges; //頂点から伸びる枝
};
class Graph {
public:
LL V; //頂点数
vertex *vertices; //グラフ
Graph(LL v) { //頂点数を指定してグラフの初期化
V = v; //頂点数
vertices = new vertex[V]; //頂点集合
rep(i, 0, V) {
vertices[i].key = -1; //キー初期値は-1
vertices[i].dkey = -1; //キー初期値は-1
}
}
void setDE(LL i, LL j, LL cos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.cost = cos;
vertices[i].edges.push_back(e);
return;
}
void setDE(LL i, LL j, double dcos) { // i→jにコストcosの有向枝を加える
edge e;
e.to = j;
e.dcost = dcos;
vertices[i].edges.push_back(e);
return;
}
void setUDE(LL i, LL j, LL cos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.cost = ej.cost = cos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setUDE(LL i, LL j, double dcos) { //(i,j)にコストcosの無向枝を加える
edge ei, ej;
ei.to = j;
ej.to = i;
ei.dcost = ej.dcost = dcos;
vertices[i].edges.push_back(ei);
vertices[j].edges.push_back(ej);
return;
}
void setKey(LL i, LL newKey) { //キー変更
vertices[i].key = newKey;
}
void setKey(LL i, double newKey) { //キー変更
vertices[i].key = newKey;
}
edge getEdge(LL i, LL j) {
rep(a, 0, vertices[i].edges.size()) {
if (vertices[i].edges[a].to == j) {
return vertices[i].edges[a];
}
}
return (edge){j, INF, DINF}; //なければ,コストINFの枝を返す
}
void bellman_ford(LL s, LL b[]) {
fill(b, b + V, INF);
b[s] = 0;
while (true) {
bool update = false;
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
edge e = vertices[i].edges[j];
if (b[e.to] > b[i] + e.cost) {
b[e.to] = b[i] + e.cost;
update = true;
}
}
}
if (!update)
break;
}
return;
}
void dijkstra(LL s,
LL d[]) { //ダイクストラ(始点を入力とし、各点への最小距離を返す)
priority_queue<pLL, vector<pLL>, greater<pLL>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(pLL(0, s));
while (!que.empty()) {
pLL p = que.top();
que.pop();
LL v = p.second;
if (d[v] < p.first)
continue;
rep(i, 0, vertices[v].edges.size()) {
edge e = vertices[v].edges[i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pLL(d[e.to], e.to));
}
}
}
return;
}
void warshall_floyd(LL **w) {
rep(i, 0, V) {
rep(j, 0, V) { w[i][j] = INF; }
}
rep(i, 0, V) {
rep(j, 0, vertices[i].edges.size()) {
w[i][vertices[i].edges[j].to] = vertices[i].edges[j].cost;
}
}
rep(i, 0, V) { w[i][i] = 0; }
rep(i, 0, V) {
rep(j, 0, V) {
rep(k, 0, V) { w[i][j] = min(w[i][j], w[i][k] + w[k][j]); }
}
}
}
};
class UF {
public:
LL N;
LL *par;
LL *rank;
UF(LL n) {
N = n;
par = new LL[N];
rank = new LL[N];
rep(i, 0, N) {
par[i] = i;
rank[i] = i;
}
return;
}
LL root(LL x) {
if (x == par[x])
return x;
else
return par[x] = root(par[x]);
}
bool same(LL x, LL y) { return (root(x) == root(y)); }
void Union(LL x, LL y) {
LL rtx = root(x);
LL rty = root(y);
if (rank[rtx] < rank[rty]) {
par[rtx] = rty;
} else {
par[rty] = rtx;
if (rank[rtx] == rank[rty]) {
rank[rtx]++;
}
}
}
};
class ST {};
/*↑マイライブラリ↑*/
LL solveA() {
LL X, A;
cin >> X >> A;
if (X < A)
cout << 0;
else
cout << 10;
return 0;
}
LL solveB() {
LL N, X;
cin >> N >> X;
LL count = 0;
LL dist = 0;
count++;
rep(i, 0, N) {
dist += linp();
if (dist > X) {
cout << count;
return 0;
}
count++;
}
cout << count;
return 0;
}
LL solveC() {
LL W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.11f ", (double)W * H / 2);
if (x == (double)W / 2 && y == (double)H / 2)
cout << 1;
else
cout << 0;
return 0;
}
LL solveD() { return 0; }
LL solveE() { return 0; }
signed main() {
// solveA();
// solveB();
solveC();
// solveD();
// solveE();
return 0;
}
| [
"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 <vector>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
if (W / 2 == x && H / 2 == y) {
printf("%.10f 1\n", ((double)W * (double)H) / 2.0);
} else {
printf("%.10f 0\n", ((double)W * (double)H) / 2.0);
}
return 0;
}
| #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 <vector>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double W, H, x, y;
cin >> W >> H >> x >> y;
if (W / 2 == x && H / 2 == y) {
printf("%.10f 1\n", ((double)W * (double)H) / 2.0);
} else {
printf("%.10f 0\n", ((double)W * (double)H) / 2.0);
}
return 0;
}
| [
"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 %d\n", double(x) * double(y), pat);
} | #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 %d\n", double(W) * double(H) / 2, pat);
} | [
"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_with_stdio(false);
std::cout << std::fixed << std::setprecision(15); //"for float-base problem"
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2.0 && y == H / 2.0) {
cout << (W * H / 2.0) << " " << 0 << endl;
} else {
cout << (W * H / 2.0) << " " << 1 << endl;
}
return 0;
} | #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_with_stdio(false);
std::cout << std::fixed << std::setprecision(15); //"for float-base problem"
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x == W / 2.0 && y == H / 2.0) {
cout << (W * H / 2.0) << " " << 1 << endl;
} else {
cout << (W * H / 2.0) << " " << 0 << endl;
}
return 0;
} | [
"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 <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(X, Y, Z) for (ll(X) = (Y); (X) < (Z); (X)++)
#define REV(X, Y, Z) for (ll(X) = (Y); (X) > (Z); (X)--)
using namespace std;
using ll = long long;
using dll = deque<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using usll = unordered_set<ll>;
using umll = unordered_map<ll, ll>;
using sll = stack<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
constexpr ll kMax = 1e12 + 1;
constexpr ll kMod = 1e9 + 7;
constexpr long double kPI = 3.14159265358979323846;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
ll V, H, X, Y;
cin >> V >> H >> X >> Y;
cout << V * H / 2 << " " << ((X * 2 == V && Y * 2 == H) ? 1 : 0) << endl;
return 0;
}
| #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 <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(X, Y, Z) for (ll(X) = (Y); (X) < (Z); (X)++)
#define REV(X, Y, Z) for (ll(X) = (Y); (X) > (Z); (X)--)
using namespace std;
using ll = long long;
using dll = deque<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using usll = unordered_set<ll>;
using umll = unordered_map<ll, ll>;
using sll = stack<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
constexpr ll kMax = 1e12 + 1;
constexpr ll kMod = 1e9 + 7;
constexpr long double kPI = 3.14159265358979323846;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
double V, H, X, Y;
cin >> V >> H >> X >> Y;
cout << V * H / 2 << " " << ((X * 2 == V && Y * 2 == H) ? 1 : 0) << endl;
return 0;
}
| [
"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
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
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;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll h, w, x, y;
cin >> h >> w >> x >> y;
printf("%.9f ", double(h) * double(w) / 2.0);
if (x + x == 2 * w && y + y == 2 * h)
puts("1");
else
puts("0");
return 0;
} | #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
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
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;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll h, w, x, y;
cin >> w >> h >> x >> y;
printf("%.9f ", double(h) * double(w) / 2.0);
if (x + x == w && y + y == h)
puts("1");
else
puts("0");
return 0;
} | [
"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 <deque>
#define pi 3.141592653589793238
#include <chrono>
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define f0 get<0>
#define f1 get<1>
#define f2 get<2>
using namespace std;
ll n;
ll ncr(ll n, ll r) {
ll i, ans = 1, k = 0;
if (r == 0)
return 1;
else if (n < r)
return 0;
for (i = n; i >= n - r + 1; i--) {
ans *= i;
ans /= n - i + 1;
}
return ans;
}
void max_heapify(int a[100], int i) {
int l, r, largest = i;
l = 2 * i + 1;
r = 2 * i + 2;
if (l < n && a[l] > a[i])
largest = l;
if (r < n && a[r] > a[l])
largest = r;
if (largest != i) {
int k;
k = a[i];
a[i] = a[largest];
a[largest] = k;
max_heapify(a, largest);
}
}
int power(ll x, ll y, ll p) {
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool square(ll n) {
double x;
x = sqrt(n);
if (x == floor(x))
return true;
else
return false;
}
bool prime(ll n) {
ll i;
for (i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll modi(ll a, ll m) { return power(a, m - 2, m); }
void kmp(string s, ll p[]) {
int n = (int)s.length();
p[0] = 0;
for (int i = 1; i < n; i++) {
int j = p[i - 1];
while (j > 0 && s[i] != s[j])
j = p[j - 1];
if (s[i] == s[j])
j++;
p[i] = j;
}
}
void zfunc(string s, ll z[]) {
ll n = (ll)s.length();
z[0] = 0;
for (ll i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
}
struct pair_hash {
size_t operator()(const pair<int, int> &p) const noexcept {
return hash<ll>()((((ll)p.first) << 32) | ((ll)p.second));
}
};
bool palin(string s) {
ll i, n;
n = s.length();
for (i = 0; i <= n / 2; i++) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll sum(ll n) {
ll i;
i = n;
ll sum = 0;
while (i > 0) {
sum += i % 10;
i = i / 10;
}
return sum;
}
ll nCr(ll n, ll r, ll p, ll fac[]) {
if (r == 0)
return 1;
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modi(fac[r], p) % p * modi(fac[n - r], p) % p) % p;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod(string num, ll a) {
ll res = 0;
for (ll i = 0; i < num.length(); i++)
res = (res * 10 + (ll)num[i] - '0') % a;
return res;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
ll parent[1000], sizer[1000];
ll findset(ll a) {
if (a == parent[a]) {
return a;
}
parent[a] = findset(parent[a]);
return parent[a];
}
void unionset(ll a, ll b) {
a = findset(a);
b = findset(b);
if (sizer[a] < sizer[b]) {
swap(a, b);
}
sizer[b] += sizer[a];
parent[b] = a;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
struct fenwick {
vector<ll> bit;
ll n;
fenwick(ll n, vector<ll> v) {
this->n = n;
bit.assign(n, 0);
for (ll it = 0; it < n; it++) {
add(it, v[it]);
}
}
ll sum(ll idx) {
if (idx < 0)
return 0;
ll ret = 0;
for (; idx >= 0; idx = (idx & (idx + 1)) - 1) {
ret += bit[idx];
}
return ret;
}
void add(ll idx, ll x) {
for (; idx < n; idx = idx | (idx + 1)) {
bit[idx] += x;
bit[idx] = max(0LL, bit[idx]);
}
}
};
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
fast;
ll T = 1, i, j;
// cin >> T;
while (T--) {
double w, h, x, y;
cin >> w >> h >> y;
cout << (w * h) / 2;
if (x == (w) / 2 && y == (h) / 2) {
cout << " 1";
} else {
cout << " 0";
}
}
return 0;
}
| #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 <deque>
#define pi 3.141592653589793238
#include <chrono>
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define f0 get<0>
#define f1 get<1>
#define f2 get<2>
using namespace std;
ll n;
ll ncr(ll n, ll r) {
ll i, ans = 1, k = 0;
if (r == 0)
return 1;
else if (n < r)
return 0;
for (i = n; i >= n - r + 1; i--) {
ans *= i;
ans /= n - i + 1;
}
return ans;
}
void max_heapify(int a[100], int i) {
int l, r, largest = i;
l = 2 * i + 1;
r = 2 * i + 2;
if (l < n && a[l] > a[i])
largest = l;
if (r < n && a[r] > a[l])
largest = r;
if (largest != i) {
int k;
k = a[i];
a[i] = a[largest];
a[largest] = k;
max_heapify(a, largest);
}
}
int power(ll x, ll y, ll p) {
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool square(ll n) {
double x;
x = sqrt(n);
if (x == floor(x))
return true;
else
return false;
}
bool prime(ll n) {
ll i;
for (i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll modi(ll a, ll m) { return power(a, m - 2, m); }
void kmp(string s, ll p[]) {
int n = (int)s.length();
p[0] = 0;
for (int i = 1; i < n; i++) {
int j = p[i - 1];
while (j > 0 && s[i] != s[j])
j = p[j - 1];
if (s[i] == s[j])
j++;
p[i] = j;
}
}
void zfunc(string s, ll z[]) {
ll n = (ll)s.length();
z[0] = 0;
for (ll i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
}
struct pair_hash {
size_t operator()(const pair<int, int> &p) const noexcept {
return hash<ll>()((((ll)p.first) << 32) | ((ll)p.second));
}
};
bool palin(string s) {
ll i, n;
n = s.length();
for (i = 0; i <= n / 2; i++) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll sum(ll n) {
ll i;
i = n;
ll sum = 0;
while (i > 0) {
sum += i % 10;
i = i / 10;
}
return sum;
}
ll nCr(ll n, ll r, ll p, ll fac[]) {
if (r == 0)
return 1;
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modi(fac[r], p) % p * modi(fac[n - r], p) % p) % p;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod(string num, ll a) {
ll res = 0;
for (ll i = 0; i < num.length(); i++)
res = (res * 10 + (ll)num[i] - '0') % a;
return res;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
ll parent[1000], sizer[1000];
ll findset(ll a) {
if (a == parent[a]) {
return a;
}
parent[a] = findset(parent[a]);
return parent[a];
}
void unionset(ll a, ll b) {
a = findset(a);
b = findset(b);
if (sizer[a] < sizer[b]) {
swap(a, b);
}
sizer[b] += sizer[a];
parent[b] = a;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
struct fenwick {
vector<ll> bit;
ll n;
fenwick(ll n, vector<ll> v) {
this->n = n;
bit.assign(n, 0);
for (ll it = 0; it < n; it++) {
add(it, v[it]);
}
}
ll sum(ll idx) {
if (idx < 0)
return 0;
ll ret = 0;
for (; idx >= 0; idx = (idx & (idx + 1)) - 1) {
ret += bit[idx];
}
return ret;
}
void add(ll idx, ll x) {
for (; idx < n; idx = idx | (idx + 1)) {
bit[idx] += x;
bit[idx] = max(0LL, bit[idx]);
}
}
};
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
fast;
ll T = 1, i, j;
// cin >> T;
while (T--) {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << (w * h) / 2;
if (x == (w) / 2 && y == (h) / 2) {
cout << " 1";
} else {
cout << " 0";
}
}
return 0;
}
| [
"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>
#define vll vector<long long>
#define vvi vector<vector<int>>
#define si set<ll>
#define sll set<long long>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define vec vector
#define cend cout << endl;
#define sc second
#define fr first
#define retz return 0;
#define ll_MAX (ll)(1e9 * 1e9)
#define ll_MIN (ll)(-1e9 * 1e9)
#define lb lower_bound
#define ub upper_bound
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define ps(arr, n) \
for (int i = 1; i < n; i++) \
arr[i] += arr[i - 1];
#define inp(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i];
#define out(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i];
#define inp1(arr, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cin >> arr[i][j];
#define out1(arr, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cin >> arr[i][j];
#define loop(q) for (auto it : q)
#define loop1(q) for (auto &it : q)
#define db1 cout << "*" << endl
#define db2 cout << "YES" << endl
using namespace std;
using namespace __gnu_pbds;
#define oset(X) \
tree<X, null_type, less<X>, rb_tree_tag, tree_order_statistics_node_update>
#define roset(X) \
tree<X, null_type, greater<X>, rb_tree_tag, tree_order_statistics_node_update>
#define okey order_of_key // lower_bound_set
#define ofind find_by_order
#define cyes cout << "Yes" << endl;
#define cno cout << "No" << endl;
#define mod (long long)1000000007
#define mod2 (long long)998244353
#define INT_MAX1 900000000
#define MAXN 2000000
#define INF INT_MAX
void solve() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << setprecision(23);
cout << ((double)w * h) / 2 << " ";
if (2 * x == w or 2 * y == h)
cout << 1 << endl;
else
cout << 0 << endl;
}
signed main() {
speed;
int t = 1;
// cin >> t;
while (t--)
solve();
} | #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>
#define vll vector<long long>
#define vvi vector<vector<int>>
#define si set<ll>
#define sll set<long long>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define vec vector
#define cend cout << endl;
#define sc second
#define fr first
#define retz return 0;
#define ll_MAX (ll)(1e9 * 1e9)
#define ll_MIN (ll)(-1e9 * 1e9)
#define lb lower_bound
#define ub upper_bound
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define ps(arr, n) \
for (int i = 1; i < n; i++) \
arr[i] += arr[i - 1];
#define inp(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i];
#define out(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i];
#define inp1(arr, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cin >> arr[i][j];
#define out1(arr, n, m) \
for (int i = 0; i < n; i++) \
for (int j = 0; j < m; j++) \
cin >> arr[i][j];
#define loop(q) for (auto it : q)
#define loop1(q) for (auto &it : q)
#define db1 cout << "*" << endl
#define db2 cout << "YES" << endl
using namespace std;
using namespace __gnu_pbds;
#define oset(X) \
tree<X, null_type, less<X>, rb_tree_tag, tree_order_statistics_node_update>
#define roset(X) \
tree<X, null_type, greater<X>, rb_tree_tag, tree_order_statistics_node_update>
#define okey order_of_key // lower_bound_set
#define ofind find_by_order
#define cyes cout << "Yes" << endl;
#define cno cout << "No" << endl;
#define mod (long long)1000000007
#define mod2 (long long)998244353
#define INT_MAX1 900000000
#define MAXN 2000000
#define INF INT_MAX
void solve() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << setprecision(23);
cout << ((double)w * h) / 2 << " ";
if (2 * x == w and 2 * y == h)
cout << 1 << endl;
else
cout << 0 << endl;
}
signed main() {
speed;
int t = 1;
// cin >> t;
while (t--)
solve();
} | [
"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> P;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = w * h / 2;
int ans2 = 0;
if (x * 2 == w && y * 2 == h) {
ans2 = 1;
}
printf("%.12lf %d\n", ans1, ans2);
return 0;
} | #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> P;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * (double)h / 2;
int ans2 = 0;
if (x * 2 == w && y * 2 == h) {
ans2 = 1;
}
printf("%.12lf %d\n", ans1, ans2);
return 0;
} | [
"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 << endl;
}
} | #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 << endl;
}
} | [
"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())
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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
typedef pair<int, int> P;
int main(void) {
// Your code here!
int W, H, x, y;
cin >> W >> H >> x >> y;
long double ans = H * W / 2;
int ans2 = (x + x == W && y + y == H ? 1 : 0);
cout << setprecision(9) << ans;
cout << " " << ans2;
}
| #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())
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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
typedef pair<int, int> P;
int main(void) {
// Your code here!
double W, H, x, y;
cin >> W >> H >> x >> y;
long double ans = H * W / 2;
int ans2 = (x + x == W && y + y == H ? 1 : 0);
cout << setprecision(9) << ans;
cout << " " << ans2;
}
| [
"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())
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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
typedef pair<int, int> P;
int main(void) {
// Your code here!
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = H * W / 2;
int ans2 = (x + x == W && y + y == H) ? 1 : 0;
cout << setprecision(9) << ans;
cout << " " << ans2;
}
| #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())
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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
//---------------------------------------------------------------------------------------------------
typedef pair<int, int> P;
int main(void) {
// Your code here!
double W, H, x, y;
cin >> W >> H >> x >> y;
long double ans = H * W / 2;
int ans2 = (x + x == W && y + y == H ? 1 : 0);
cout << setprecision(9) << ans;
cout << " " << ans2;
}
| [
"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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int main(void) {
// Your code here!
int w, h, x, y;
cin >> w >> h >> x >> y;
double area = w * h / 2;
int ans = (x + x == w && y + y == h ? 1 : 0);
cout << area << " " << ans << endl;
}
| #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;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int main(void) {
// Your code here!
double w, h, x, y;
cin >> w >> h >> x >> y;
double area = w * h / 2;
int ans = (x + x == w && y + y == h ? 1 : 0);
cout << area << " " << ans << endl;
}
| [
"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;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//エラトステネスの篩
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*ライブラリ最大公約数*/
//ユーグリッドの互除法
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*素因数分解*/
//自作ライブラリ
// iを常に素数にしておかないとうまくできない&&計算量ヤバイ
//エストラネスの篩で素数を振るっておく必要性がありそう
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint用の定数 (10の9乗 + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (w / 2 == x && h / 2 == y) {
ans = 1;
}
long double ans2 = w / 2 * h;
printf("%.10f ", ans2);
cout << ans << endl;
return 0;
} | #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;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//エラトステネスの篩
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*ライブラリ最大公約数*/
//ユーグリッドの互除法
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*素因数分解*/
//自作ライブラリ
// iを常に素数にしておかないとうまくできない&&計算量ヤバイ
//エストラネスの篩で素数を振るっておく必要性がありそう
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint用の定数 (10の9乗 + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (w / 2 == x && h / 2 == y) {
ans = 1;
}
long double ans2 = w / 2 * h;
printf("%.10LF ", ans2);
cout << ans << endl;
return 0;
} | [
"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;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//エラトステネスの篩
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*ライブラリ最大公約数*/
//ユーグリッドの互除法
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*素因数分解*/
//自作ライブラリ
// iを常に素数にしておかないとうまくできない&&計算量ヤバイ
//エストラネスの篩で素数を振るっておく必要性がありそう
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint用の定数 (10の9乗 + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (w / 2 == x && h / 2 == y) {
ans = 1;
}
long double ans2 = w / 2 * h;
printf("%.10f ", ans2);
cout << ans;
return 0;
} | #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;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//エラトステネスの篩
vector<int> estora(vector<int> num) {
int sel = 0;
while (sel < num.size()) {
int d = num[sel];
for (int i = 0; i < num.size(); i++) {
if (num[i] % d == 0 && num[i] != d && d != 1) {
num.erase(num.begin() + i);
i--;
}
}
sel++;
}
return num;
}
/*ライブラリ最大公約数*/
//ユーグリッドの互除法
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*素因数分解*/
//自作ライブラリ
// iを常に素数にしておかないとうまくできない&&計算量ヤバイ
//エストラネスの篩で素数を振るっておく必要性がありそう
vector<ll> fac(ll n, vector<ll> num) {
ll kazu = n;
for (int i = 2; i <= n; i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
num[n]++;
return num;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return num;
}
const int INF = 1001001001;
// mint用の定数 (10の9乗 + 7)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
int ans = 0;
if (w / 2 == x && h / 2 == y) {
ans = 1;
}
long double ans2 = w / 2 * h;
printf("%.10LF ", ans2);
cout << ans << endl;
return 0;
} | [
"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;
printf("%lf 0", ans);
return 0;
} | #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("%lf 0", ans);
return 0;
} | [
"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("%f 0", ans);
return 0;
} | #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("%lf 0", ans);
return 0;
} | [
"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 insert
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<ll>>;
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = INF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
rep(i, V) { d[i] = INF; }
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
class UnionFind {
public:
ll par[100005];
ll depth[100005];
ll nGroup[100005];
UnionFind(ll n) { init(n); }
void init(ll n) {
for (ll i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if (depth[x] == depth[y])
depth[x]++;
}
}
};
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<ll> depth;
vector<ll> subtree_size;
void dfs(const Graph &G, ll v, ll p, ll d) {
depth[v] = d;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1);
}
// 帰りがけ時に、部分木サイズを求める
subtree_size[v] = INF; // 自分自身
vl q;
for (auto c : G[v]) {
if (c == p)
continue;
q.pb(subtree_size[c]); // 子のサイズを加える
}
ll qq = q.size();
// cout << v << " " << qq << endl;
if (qq == 0)
subtree_size[v] = 0;
else {
sort(all(q));
// rep(i,qq)cout << q[i];
// cout << endl;
ll caa = 0;
rep(i, qq) { caa = max(qq + q[i] - i, caa); }
subtree_size[v] = caa;
}
}
ll dp[100005][2];
int main() {
ll h, w, x, y;
cin >> h >> w >> x >> y;
double ca = (h * w) / 2;
ll f = 0;
if (h == 2 * y && w == 2 * x)
f++;
cout << ca << " " << f << endl;
} | #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 insert
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<ll>>;
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = INF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
rep(i, V) { d[i] = INF; }
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
class UnionFind {
public:
ll par[100005];
ll depth[100005];
ll nGroup[100005];
UnionFind(ll n) { init(n); }
void init(ll n) {
for (ll i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if (depth[x] == depth[y])
depth[x]++;
}
}
};
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<ll> depth;
vector<ll> subtree_size;
void dfs(const Graph &G, ll v, ll p, ll d) {
depth[v] = d;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1);
}
// 帰りがけ時に、部分木サイズを求める
subtree_size[v] = INF; // 自分自身
vl q;
for (auto c : G[v]) {
if (c == p)
continue;
q.pb(subtree_size[c]); // 子のサイズを加える
}
ll qq = q.size();
// cout << v << " " << qq << endl;
if (qq == 0)
subtree_size[v] = 0;
else {
sort(all(q));
// rep(i,qq)cout << q[i];
// cout << endl;
ll caa = 0;
rep(i, qq) { caa = max(qq + q[i] - i, caa); }
subtree_size[v] = caa;
}
}
ll dp[100005][2];
int main() {
double h, w, x, y;
cin >> h >> w >> x >> y;
double ca = (h * w) / 2;
ll f = 0;
if (h == 2 * x && w == 2 * y)
f++;
cout << ca << " " << f << endl;
}
| [
"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) for (int i = n; i >= x; i--)
#define sz(a) int(a.size())
#define rson mid + 1, r, p << 1 | 1
#define pii pair<int, int>
#define lson l, mid, p << 1
#define ll long long
#define pb push_back
#define mp make_pair
#define se second
#define fi first
using namespace std;
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int inf = 1e9;
int n, m, x, y;
int main() {
// ios::sync_with_stdio(false);
// freopen("in","r",stdin);
scanf("%d%d%d%d", &n, &m, &x, &y);
printf("%lf %d\n,", 1.0 * n * m / 2.0, x + x == n && y + y == m);
return 0;
} | #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) for (int i = n; i >= x; i--)
#define sz(a) int(a.size())
#define rson mid + 1, r, p << 1 | 1
#define pii pair<int, int>
#define lson l, mid, p << 1
#define ll long long
#define pb push_back
#define mp make_pair
#define se second
#define fi first
using namespace std;
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int inf = 1e9;
int n, m, x, y;
int main() {
// ios::sync_with_stdio(false);
// freopen("in","r",stdin);
scanf("%d%d%d%d", &n, &m, &x, &y);
printf("%.2f %d\n", 1.0 * n * m / 2.0, x + x == n && y + y == m);
return 0;
} | [
"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) for (int i = n; i >= x; i--)
#define sz(a) int(a.size())
#define rson mid + 1, r, p << 1 | 1
#define pii pair<int, int>
#define lson l, mid, p << 1
#define ll long long
#define pb push_back
#define mp make_pair
#define se second
#define fi first
using namespace std;
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int inf = 1e9;
int n, m, x, y;
int main() {
// ios::sync_with_stdio(false);
// freopen("in","r",stdin);
scanf("%d%d%d%d", &n, &m, &x, &y);
printf("%lf %d\n,", double(n) * double(m) / 2, x + x == n && y + y == m);
return 0;
} | #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) for (int i = n; i >= x; i--)
#define sz(a) int(a.size())
#define rson mid + 1, r, p << 1 | 1
#define pii pair<int, int>
#define lson l, mid, p << 1
#define ll long long
#define pb push_back
#define mp make_pair
#define se second
#define fi first
using namespace std;
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int inf = 1e9;
int n, m, x, y;
int main() {
// ios::sync_with_stdio(false);
// freopen("in","r",stdin);
scanf("%d%d%d%d", &n, &m, &x, &y);
printf("%.2f %d\n", double(n) * double(m) / 2, x + x == n && y + y == m);
return 0;
} | [
"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 <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double max = (W * H) / 2;
int judge = 0;
if (x + x == W && y + y == H) {
judge = 1;
}
cout << fixed << setprecision(6) << max << " ";
cout << judge << endl;
}
| #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 <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double max = double(W) * double(H) / 2;
int judge = 0;
if (x + x == W && y + y == H) {
judge = 1;
}
cout << fixed << setprecision(6) << max << " ";
cout << judge << endl;
}
| [
"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>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout << "YES"
#define NN cout << "NO"
#define EE cout << "\n"
#define ee cout << "\n"
#define ne cout << "-1"
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define mkt make_tuple
#define sall(v) sort(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vc vector<char>
#define vll vector<pair<ll, ll>>
#define mps map<string, ll>
#define mpc map<char, ll>
#define mpl map<ll, ll>
#define pr pair<ll, ll>
#define tpl tuple<ll, ll, ll>
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll containsDigit(ll number, ll digit) {
while (number != 0) {
int curr_digit = number % 10;
if (curr_digit == digit)
return 1;
number /= 10;
}
return 0;
}
ll soltn(ll x, ll n) {
if (x >= 0)
return x % n;
else
return n + x % n;
}
ll bin_srch(ll L[], ll N, ll item) {
ll flag = -2;
int l = 0, u = N - 1, m;
while (l <= u) {
m = (l + u) / 2;
if (item == L[m]) {
flag = m - 1;
break;
} else if (item > L[m])
l = m - 1;
else
u = m + 1;
}
return flag;
}
ll pd(ll x, ll y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
ll coda(ll n, ll d) {
ll count = 0;
while (n != 0) {
if (n % 10 == d)
count++;
n /= 10;
}
return count;
}
ll minDissame(ll a[], ll n) {
map<ll, ll> hmap;
ll minDistance = INT_MAX;
ll previousIndex = 0, currentIndex = 0;
for (ll i = 0; i < n; i++) {
if (hmap.find(a[i]) != hmap.end()) {
currentIndex = i;
previousIndex = hmap[a[i]];
minDistance = min((currentIndex - previousIndex), minDistance);
}
hmap[a[i]] = i;
}
return (minDistance == INT_MAX ? -1 : minDistance);
}
ll minDistanytwo(ll arr[], ll n, ll x, ll y) {
ll p = -1, min_dist = INT_MAX;
for (ll i = 0; i < n; i++) {
if (arr[i] == x || arr[i] == y) {
if (p != -1 && arr[i] != arr[p])
min_dist = min(min_dist, i - p);
p = i;
}
}
if (min_dist == INT_MAX)
return -1;
return min_dist;
}
ll mdls(ll x) { return max(x, -x); }
ll pow1(ll n, ll p) {
if (p == 0)
return 1;
ll x = pow1(n, p / 2);
x = (x * x) % MOD;
if (p % 2 == 0)
return x;
else
return (x * n) % MOD;
}
string fumn(string s) {
string p;
for (ll i = 0; i < s.length(); i++)
if (isalpha(s[i]))
p += toupper(s[i]);
return p;
}
ll turns(string S, string SS) {
ll i, cc = 0, l = S.length();
fo(i, l) {
if (S[i] != SS[i])
cc++;
}
return cc / 2;
}
ld polygonArea(ld X[], ld Y[], ll n) {
double area = 0.0;
ll j = n - 1;
for (ll i = 0; i < n; i++) {
area += (X[j] + X[i]) * (Y[j] - Y[i]);
j = i;
}
return abs(area / 2.0);
}
ll isSubstr(string s1, string s2) {
ll M = s1.length();
ll N = s2.length();
for (ll i = 0; i <= N - M; i++) {
ll j;
for (j = 0; j < M; j++)
if (s2[i + j] != s1[j])
break;
if (j == M)
return i;
}
return -1;
}
// s2>s1;if(not) rtrn -1;
ll hhh2(unsigned ll n) {
if (n < 1)
return 0;
ll res = 1;
ll u = 0;
for (ll i = 0; i < 8 * sizeof(unsigned ll); i++) {
ll curr = 1 << i;
if (curr > n)
break;
u++;
res = curr;
}
return u;
}
ld ldgcd(ld a, ld b) { return a < 0.0001 ? b : ldgcd(fmod(b, a), a); }
void onesol(ll a, ll b, ll &x, ll &y, ll &g) {
if (!b) {
g = a;
x = 1;
y = 0;
} else {
onesol(b, a % b, y, x, g);
y -= a / b * x;
}
}
ll fac[1000000], inv[1000000], finv[1000000];
void C_init() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 1000000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COMB(ll a, ll b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ld n, m, j, k, l, i;
cin >> n >> m >> i >> j;
cout << fixed << setprecision(6) << (n * m) / 2;
if (2 * i == n || 2 * j == m)
cout << " " << 1;
else
cout << " " << 0;
}
return 0;
}
| /* / \ (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>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout << "YES"
#define NN cout << "NO"
#define EE cout << "\n"
#define ee cout << "\n"
#define ne cout << "-1"
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define mkt make_tuple
#define sall(v) sort(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vc vector<char>
#define vll vector<pair<ll, ll>>
#define mps map<string, ll>
#define mpc map<char, ll>
#define mpl map<ll, ll>
#define pr pair<ll, ll>
#define tpl tuple<ll, ll, ll>
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll containsDigit(ll number, ll digit) {
while (number != 0) {
int curr_digit = number % 10;
if (curr_digit == digit)
return 1;
number /= 10;
}
return 0;
}
ll soltn(ll x, ll n) {
if (x >= 0)
return x % n;
else
return n + x % n;
}
ll bin_srch(ll L[], ll N, ll item) {
ll flag = -2;
int l = 0, u = N - 1, m;
while (l <= u) {
m = (l + u) / 2;
if (item == L[m]) {
flag = m - 1;
break;
} else if (item > L[m])
l = m - 1;
else
u = m + 1;
}
return flag;
}
ll pd(ll x, ll y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
ll coda(ll n, ll d) {
ll count = 0;
while (n != 0) {
if (n % 10 == d)
count++;
n /= 10;
}
return count;
}
ll minDissame(ll a[], ll n) {
map<ll, ll> hmap;
ll minDistance = INT_MAX;
ll previousIndex = 0, currentIndex = 0;
for (ll i = 0; i < n; i++) {
if (hmap.find(a[i]) != hmap.end()) {
currentIndex = i;
previousIndex = hmap[a[i]];
minDistance = min((currentIndex - previousIndex), minDistance);
}
hmap[a[i]] = i;
}
return (minDistance == INT_MAX ? -1 : minDistance);
}
ll minDistanytwo(ll arr[], ll n, ll x, ll y) {
ll p = -1, min_dist = INT_MAX;
for (ll i = 0; i < n; i++) {
if (arr[i] == x || arr[i] == y) {
if (p != -1 && arr[i] != arr[p])
min_dist = min(min_dist, i - p);
p = i;
}
}
if (min_dist == INT_MAX)
return -1;
return min_dist;
}
ll mdls(ll x) { return max(x, -x); }
ll pow1(ll n, ll p) {
if (p == 0)
return 1;
ll x = pow1(n, p / 2);
x = (x * x) % MOD;
if (p % 2 == 0)
return x;
else
return (x * n) % MOD;
}
string fumn(string s) {
string p;
for (ll i = 0; i < s.length(); i++)
if (isalpha(s[i]))
p += toupper(s[i]);
return p;
}
ll turns(string S, string SS) {
ll i, cc = 0, l = S.length();
fo(i, l) {
if (S[i] != SS[i])
cc++;
}
return cc / 2;
}
ld polygonArea(ld X[], ld Y[], ll n) {
double area = 0.0;
ll j = n - 1;
for (ll i = 0; i < n; i++) {
area += (X[j] + X[i]) * (Y[j] - Y[i]);
j = i;
}
return abs(area / 2.0);
}
ll isSubstr(string s1, string s2) {
ll M = s1.length();
ll N = s2.length();
for (ll i = 0; i <= N - M; i++) {
ll j;
for (j = 0; j < M; j++)
if (s2[i + j] != s1[j])
break;
if (j == M)
return i;
}
return -1;
}
// s2>s1;if(not) rtrn -1;
ll hhh2(unsigned ll n) {
if (n < 1)
return 0;
ll res = 1;
ll u = 0;
for (ll i = 0; i < 8 * sizeof(unsigned ll); i++) {
ll curr = 1 << i;
if (curr > n)
break;
u++;
res = curr;
}
return u;
}
ld ldgcd(ld a, ld b) { return a < 0.0001 ? b : ldgcd(fmod(b, a), a); }
void onesol(ll a, ll b, ll &x, ll &y, ll &g) {
if (!b) {
g = a;
x = 1;
y = 0;
} else {
onesol(b, a % b, y, x, g);
y -= a / b * x;
}
}
ll fac[1000000], inv[1000000], finv[1000000];
void C_init() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 1000000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COMB(ll a, ll b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ld n, m, j, k, l, i;
cin >> n >> m >> i >> j;
cout << fixed << setprecision(6) << (n * m) / 2;
if (2 * i == n && 2 * j == m)
cout << " " << 1;
else
cout << " " << 0;
}
return 0;
}
| [
"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 >> x >> y;
double cx = w / 2;
double cy = h / 2;
bool f = false;
if (cx == x && cy == y)
f = true;
cout << std::setprecision(10) << double(h) * double(w) / 2;
cout << " ";
f ? cout << 1 : cout << 0;
return 0;
}
| #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 >> x >> y;
double cx = w / 2;
double cy = h / 2;
bool f = false;
if (cx == x && cy == y)
f = true;
cout << std::setprecision(10) << double(w) * double(h) / 2;
cout << " ";
f ? cout << 1 : cout << 0;
return 0;
}
| [
"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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = (float)W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << !is_center << endl;
return 0;
}
| #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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = (float)W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << is_center << endl;
return 0;
}
| [
"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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << !is_center << endl;
return 0;
}
| #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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = (float)W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << is_center << endl;
return 0;
}
| [
"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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << is_center << endl;
return 0;
}
| #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 REACH(i, a, b) for (int i = (b); i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(a, x, b) ((a) <= (x) && (x) < (b))
const int MOD = 1e9 + 7;
const int INF = 1 << 29;
const double EPS = 1e-10;
using ll = long long;
using P = pair<int, int>;
template <class T = int> using V = vector<T>;
template <class T> bool inline chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool inline chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T = int> T inline input() {
T x;
cin >> x;
return (x);
}
template <class T> void inline print(T &x) { cout << x << '\n'; }
#define debug(x) cerr << #x << ": " << x << endl;
const int dxs[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dys[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
float s = (float)W * H / 2;
bool is_center = W == 2 * x && H == 2 * y;
cout << s << ' ' << is_center << endl;
return 0;
}
| [
"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", s, ans);
return 0;
} | #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("%lf %d\n", s, ans);
return 0;
} | [
"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, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
ll w, h, x, y;
string str;
cin >> w >> h >> x >> y;
cout << (long double)w * h / 2 << " ";
if (x + x == a && y + y == b)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| // 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, n) REP(i, 0, n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
ll w, h, x, y;
string str;
cin >> w >> h >> x >> y;
cout << (long double)w * h / 2 << " ";
if (x + x == w && y + y == h)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"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 1000000007
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(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
ll rect = w * h;
long double ans = rect / 2.0;
int res;
if (x == w / 2 && y == h / 2)
res = 1;
else
res = 0;
printf("%.10Lf %d\n", ans, res);
} | #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 1000000007
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(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
ll rect = w * h;
long double ans = rect / 2.0;
int res;
if (x == w / 2.0 && y == h / 2.0)
res = 1;
else
res = 0;
printf("%.10Lf %d\n", ans, res);
} | [
"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 >> x >> y;
if (x == W / 2 && y == H / 2) {
printf("%f 1\n", (double)W * H / 2, 0);
} else {
printf("%f 0\n", (double)W * H / 2, 0);
}
}
| #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 >> x >> y;
if (x == (double)W / 2 && y == (double)H / 2) {
printf("%f 1\n", (double)W * H / 2, 0);
} else {
printf("%f 0\n", (double)W * H / 2, 0);
}
}
| [
"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 <cstdint>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <chrono>
#include <forward_list>
#include <initializer_list>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#if __cplusplus >= 201402L
#include <shared_mutex>
#endif
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9 + 7;
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
ll gcd(ll x, ll y) {
x = x % y;
return x == 0 ? y : gcd(y, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
cout << fixed << setprecision(10) << ans << " ";
if (2 * x == w && 2 * y == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #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 <cstdint>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <chrono>
#include <forward_list>
#include <initializer_list>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#if __cplusplus >= 201402L
#include <shared_mutex>
#endif
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9 + 7;
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
ll gcd(ll x, ll y) {
x = x % y;
return x == 0 ? y : gcd(y, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
cout << fixed << setprecision(10) << ans << " ";
if (2 * x == w && 2 * y == h) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"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 main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double size_ = W / 2 * H;
cout << std::fixed << std::setprecision(15) << size_ << " ";
if (x * 2 == W || 2 * y == H) {
cout << "1";
} else {
cout << "0";
}
cout << endl;
return 0;
} | #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 main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double size_ = W / 2 * H;
cout << std::fixed << std::setprecision(15) << size_ << " ";
if (x * 2 == W && 2 * y == H) {
cout << "1";
} else {
cout << "0";
}
cout << endl;
return 0;
} | [
"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 >> x >> y;
double ans = W * H / 2;
bool b = ((x == W - x) && (y == H - y));
printf("%lf %d\n", ans, b);
}
| #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 >> x >> y;
double ans = (double)(W * H) / 2;
bool b = ((x == W - x) && (y == H - y));
printf("%lf %d\n", ans, b);
}
| [
"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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.lf %d\n", w * h / 2.0, x * 2 == w && y * 2 == h);
}
| #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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10lf %d\n", w * h / 2.0, x * 2 == w && y * 2 == h);
// cout << w * h / 2.0 << " " << (x * 2 == w && y * 2 == h) << endl;
}
| [
"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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.lf %d\n", (ll)w * h / 2.0, x * 2 == w && y * 2 == h);
}
| #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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10lf %d\n", w * h / 2.0, x * 2 == w && y * 2 == h);
// cout << w * h / 2.0 << " " << (x * 2 == w && y * 2 == h) << endl;
}
| [
"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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.lf %d\n", w * h / 2.0, x * 2 == w && y * 2 == h);
}
| #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)
#define eb emplace_back
#define eps 1e-10
#define F first
#define S second
int main() { // cast caution
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10lf %d\n", w * h / 2.0, x * 2 == w && y * 2 == h);
// cout << w * h / 2.0 << " " << (x * 2 == w && y * 2 == h) << endl;
}
| [
"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 eps 1e-10
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 1 << endl;
} else if (x == w / 2 || y == h / 2) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 0 << endl;
} else {
cout << fixed << setprecision(11) << (double)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 < 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 eps 1e-10
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (x == (double)w / 2 && y == (double)h / 2) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 1 << endl;
} else if (x == w / 2 || y == h / 2) {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 0 << endl;
} else {
cout << fixed << setprecision(11) << (double)w * h / 2 << " " << 0 << endl;
}
}
| [
"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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
int ans;
if (w / 2 == x && h / 2 == y)
ans = 1;
else
ans = 0;
cout << fixed << setprecision(12) << h * w / 2.0 << " " << ans << "\n";
return 0;
}
| #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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
int ans;
if (w / 2.0 == x && h / 2.0 == y)
ans = 1;
else
ans = 0;
cout << fixed << setprecision(12) << h * w / 2.0 << " " << ans << "\n";
return 0;
}
| [
"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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
int ans;
if (w / 2 == x && h / 2 == y)
ans = 1;
else
ans = 0;
cout << fixed << setprecision(10) << h * w / 2.0 << " " << ans << "\n";
return 0;
}
| #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(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll w, h, x, y;
int main() {
cin >> w >> h >> x >> y;
int ans;
if (w / 2.0 == x && h / 2.0 == y)
ans = 1;
else
ans = 0;
cout << fixed << setprecision(12) << h * w / 2.0 << " " << ans << "\n";
return 0;
}
| [
"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, x, y;
cin >> w >> h >> x >> y;
ll area = w * h;
int count = 0;
if (w % 2 == 0 && x == w / 2)
count++;
if (h % 2 == 0 && y == h / 2)
count++;
if (count == 1) {
printf("%lld %d", area / 2, 0);
return 0;
}
if (count == 2) {
printf("%lld %d", area / 2, 1);
return 0;
}
printf("%lld %d", area / 2.0, 0);
} | #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, x, y;
cin >> w >> h >> x >> y;
ll area = w * h;
int count = 0;
if (w % 2 == 0 && x == w / 2)
count++;
if (h % 2 == 0 && y == h / 2)
count++;
if (count == 1) {
printf("%lld %d", area / 2, 0);
return 0;
}
if (count == 2) {
printf("%lld %d", area / 2, 1);
return 0;
}
printf("%.12f %d\n", area / 2.0, 0);
} | [
"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, x, y;
cin >> w >> h >> x >> y;
ll area = w * h;
int count = 0;
if (w % 2 == 0 && x == w / 2)
count++;
if (h % 2 == 0 && y == h / 2)
count++;
if (count == 1) {
printf("%lld %d", area / 2, 0);
return 0;
}
if (count == 2) {
printf("%lld %d", area / 2, 1);
return 0;
}
printf("%lld %d", area / 2, 0);
} | #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, x, y;
cin >> w >> h >> x >> y;
ll area = w * h;
int count = 0;
if (w % 2 == 0 && x == w / 2)
count++;
if (h % 2 == 0 && y == h / 2)
count++;
if (count == 1) {
printf("%lld %d", area / 2, 0);
return 0;
}
if (count == 2) {
printf("%lld %d", area / 2, 1);
return 0;
}
printf("%.12f %d\n", area / 2.0, 0);
} | [
"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;
return 0;
}
| [
"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(ll x, ll y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int ans2 = 0;
if (w / 2 == x && h / 2 == y)
ans2 = 1;
printf("%lf %d\n", ans, ans2);
}
/*
*/
| #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(ll x, ll y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int ans2 = 0;
if (w / 2 == x && h / 2 == y)
ans2 = 1;
printf("%lf %d\n", ans, ans2);
}
/*
*/
| [
"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(ll x, ll y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int ans2 = 0;
if (w / 2 == x && h / 2 == y)
ans2 = 1;
printf("%lf %d\n", ans, ans2);
}
/*
*/
| #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(ll x, ll y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int ans2 = 0;
if (w / 2 == x && h / 2 == y)
ans2 = 1;
printf("%lf %d\n", ans, ans2);
}
/*
*/
| [
"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 = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = 1.0 * w * h / 2.0;
int canMalti = 0;
if (w / 2 == x && h / 2 == y)
canMalti = 1;
cout << fixed << setprecision(10) << ans << " " << canMalti << endl;
return 0;
} | #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 = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = 1.0 * w * h / 2.0;
int canMalti = 0;
if (w / 2.0 == x && h / 2.0 == y)
canMalti = 1;
cout << fixed << setprecision(10) << ans << " " << canMalti << endl;
return 0;
} | [
"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 long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
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;
}
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int MAX_N = 1e5;
int divup(int x, int y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
typedef pair<int, int> P;
signed main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(20.20);
cout << w * h / 2 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
} | #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 long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
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;
}
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int MAX_N = 1e5;
int divup(int x, int y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
typedef pair<int, int> P;
signed main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(20.20);
cout << w * h / 2.0 << " " << (2 * x == w && 2 * y == h ? 1 : 0) << endl;
} | [
"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, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
bool isInteger(double x) { return floor(x) == x; }
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.16f %d\n", w * h / 2.0, (w / 2 == x || h / 2 == y));
return 0;
} | #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, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
bool isInteger(double x) { return floor(x) == x; }
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.16f %d\n", w * h / 2.0, (w / 2 == x && h / 2 == y));
return 0;
} | [
"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;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.10lf ", (W * H) / 2.0);
if (x == ceil(W / 2.0) && y == ceil(H / 2.0)) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #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;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.10lf ", (W * H) / 2.0);
if (x == W / 2.0 && y == H / 2.0) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"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;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.10lf ", (W * H) / 2.0);
if (x == W / 2 && y == H / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (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;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
printf("%.10lf ", (W * H) / 2.0);
if (x == W / 2.0 && y == H / 2.0) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int num = (w == 2 * x && h == 2 * y);
printf("%10lf %d\n", ans, num);
} | #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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int num = (w == 2 * x && h == 2 * y);
printf("%10lf %d\n", ans, num);
} | [
"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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int num = (w == 2 * x && h == 2 * y);
printf("%10lf %d\n", ans, num);
} | #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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int num = (w == 2 * x && h == 2 * y);
printf("%10lf %d\n", ans, num);
} | [
"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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2;
int num = (w == 2 * x && h == 2 * y);
printf("%10f %d\n", ans, num);
} | #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;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w * h / 2.0;
int num = (w == 2 * x && h == 2 * y);
printf("%10lf %d\n", ans, num);
} | [
"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 / 2);
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #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)w * (double)h / 2);
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [
"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.