problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#define mst(a, b) memset(a, b, sizeof(a))
#define repi(a, b) for (i... | #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 <utility>
#define mst(a, b) memset(a, b, sizeof(a))
#define repi(a, b) for (i... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 816,915 | 816,916 | u401146093 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int ishalf = (x * 2 == w & y * 2 == h) ? 1 : 0;
double ret = w * h / 2;
cout << ret << " " << ishalf << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int ishalf = (x * 2 == w && y * 2 == h) ? 1 : 0;
double ret = w * h / 2.0;
cout << ret << " " << ishalf << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change"
] | 816,925 | 816,924 | u343441882 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int a;
if (2 * x == w && 2 * y == h)
a = 1;
else
a = 0;
cout << ((double)(w * h)) / 2.0 << " " << 0 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int a;
if (2 * x == w && 2 * y == h)
a = 1;
else
a = 0;
cout << ((double)(w) * (double(h))) / 2.0 << " " << a << endl;
return 0;
}
| [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 816,928 | 816,929 | u054798759 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int a;
if (2 * x == w && 2 * y == h)
a = 1;
else
a = 0;
cout << ((double)(w * h)) / 2.0 << " " << 1 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
int a;
if (2 * x == w && 2 * y == h)
a = 1;
else
a = 0;
cout << ((double)(w) * (double(h))) / 2.0 << " " << a << endl;
return 0;
}
| [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 816,930 | 816,929 | u054798759 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y;
cin >> W >> H >> x >> y;
if (W / 2.0 == x && H / 2.0 == y) {
printf("%f", W * H / 2.0);
printf(" 0\n");
} else {
printf("%f", W * H / 2.0);
printf(" 1\n");
... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double W, H, x, y;
cin >> W >> H >> x >> y;
if (W / 2.0 == x && H / 2.0 == y) {
printf("%f", W * H / 2.0);
printf(" 1\r");
} else {
printf("%f", W * H / 2.0);
printf(" 0\r")... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 816,934 | 816,935 | u065375429 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
double half = (W * H) / 2;
double half_x = W / 2;
double half_y = H / 2;
bool flag = false;
if (x == half_x && y == half_y)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
double W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
double half = (W * H) / 2;
double half_x = W / 2;
double half_y = H / 2;
bool flag = false;
if (x == half_x && y == half_y)... | [
"variable_declaration.type.change"
] | 816,938 | 816,939 | u747087681 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
double half = (W * H) / 2;
double half_x = W / 2;
double half_y = H / 2;
bool flag = false;
if (x == half_x && y == half_y)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
double W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
double half = (W * H) / 2.00000;
double half_x = W / 2;
double half_y = H / 2;
bool flag = false;
if (x == half_x && y == h... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 816,938 | 816,940 | u747087681 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#def... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#def... | [
"variable_declaration.type.change"
] | 816,941 | 816,942 | u526854325 | cpp |
p03001 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#def... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#def... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change"
] | 816,943 | 816,942 | u526854325 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h;
int x, y, c;
cin >> w >> h >> x >> y;
double area = (w * h) / 2.00000;
if (x == w / 2 & y == h / 2) {
c = 1;
} else {
c = 0;
}
cout << area << " " << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h;
int x, y, c;
cin >> w >> h >> x >> y;
double area = (w * h) / 2.00000;
if (x == w / 2 & y == h / 2) {
c = 1;
} else {
c = 0;
}
cout << area << " " << c << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 816,944 | 816,945 | u072080927 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll w, h, x, y, ret = 0;
long double ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> w >> h >> x >> y;
if (w == x * 2 && h == y * 2)
ret = 1;
ans = w * h / 2;
cout << fixed << setprecision(6) << ans << ' ' << r... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll w, h, x, y, ret = 0;
long double ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> w >> h >> x >> y;
if (w == x * 2 && h == y * 2)
ret = 1;
ans = double(w * h) / 2.0;
cout << fixed << setprecision(6) << ans <... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 816,950 | 816,951 | u870610226 | cpp |
p03001 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | [
"io.output.change"
] | 816,958 | 816,959 | u060896757 | cpp |
p03001 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | [
"variable_declaration.type.change"
] | 816,960 | 816,959 | u060896757 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
typedef pair<int, int> P;
int main(void) {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.9f ", double(w * h / 2));
if (w == 2 * x and h == 2 * y) {
co... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
typedef pair<int, int> P;
int main(void) {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10f ", double(w * h / 2.0));
if (w == 2 * x and h == 2 * y) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.change",
"expression.operation.binary.change"
] | 816,961 | 816,962 | u030848580 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
typedef pair<int, int> P;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.9f ", double(w * h / 2));
if (w == 2 * x and h == 2 * y) {
c... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
typedef pair<int, int> P;
int main(void) {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.10f ", double(w * h / 2.0));
if (w == 2 * x and h == 2 * y) {
... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.change",
"expression.operation.binary.change"
] | 816,963 | 816,962 | u030848580 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int out = 0;
double S;
S = (double)((W * H) / 2);
if ((W % 2) == 0) {
if ((H % 2) == 0) {
if ((W / 2) == x) {
if ((H / 2) == y) {
out = 1;
}
}
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int out = 0;
double S;
S = ((double)(W)*H) / 2;
if ((W % 2) == 0) {
if ((H % 2) == 0) {
if ((W / 2) == x) {
if ((H / 2) == y) {
out = 1;
}
}
}... | [] | 816,966 | 816,967 | u431602218 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int out = 0;
double S;
S = (W * H) / 2;
if ((W % 2) == 0) {
if ((H % 2) == 0) {
if ((W / 2) == x) {
if ((H / 2) == y) {
out = 1;
}
}
}
}
c... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int out = 0;
double S;
S = ((double)(W)*H) / 2;
if ((W % 2) == 0) {
if ((H % 2) == 0) {
if ((W / 2) == x) {
if ((H / 2) == y) {
out = 1;
}
}
}... | [
"type_conversion.add"
] | 816,968 | 816,967 | u431602218 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double S = W * H / 2;
if (x == W / 2 && y == H / 2)
cout << S << " " << 1 << endl;
else
cout << S << " " << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double S = (W * H) / 2;
if (x == W / 2 && y == H / 2)
cout << S << " " << 1 << endl;
else
cout << S << " " << 0 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 816,969 | 816,970 | u717501752 | cpp |
p03001 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | [
"variable_declaration.type.change"
] | 816,973 | 816,974 | u702496216 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const ll dx[] = {1, ... | [
"call.remove",
"call.arguments.change"
] | 816,975 | 816,976 | u666721654 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 200;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 0x3f3f3f;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double sum = w * h / 2;
printf("%.6lf ", sum);
if (w % 2 == 0 && h % 2 == 0) {
if (x == ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 200;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 0x3f3f3f;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double sum = 1.0 * w * h / 2;
printf("%.6lf ", sum);
if (w % 2 == 0 && h % 2 == 0) {
if ... | [
"assignment.change"
] | 816,991 | 816,989 | u624688258 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 200;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 0x3f3f3f;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double sum = w * h / 2;
printf("%.6lf ", sum);
if (w % 2 == 0 && h % 2 == 0) {
if (x == ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 200;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 0x3f3f3f;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double sum = w / 2.0 * h;
printf("%.6lf ", sum);
if (w % 2 == 0 && h % 2 == 0) {
if (x =... | [
"expression.operation.binary.remove"
] | 816,991 | 816,993 | u624688258 | cpp |
p03001 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
static void C_task();
int main() {
C_task();
fflush(stdout);
return 0;... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
static void C_task();
int main() {
C_task();
fflush(stdout);
return 0;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,009 | 817,010 | u887675488 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 && y == H / 2)
cout << 0;
else
cout << 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 && y == H / 2)
cout << 1;
else
cout << 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 817,026 | 817,027 | u314816992 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 && y == H / 2)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 && y == H / 2)
cout << 1;
else
cout << 0;
} | [
"variable_declaration.type.primitive.change"
] | 817,028 | 817,027 | u314816992 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 || y == H / 2)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << W * H / 2 << " ";
if (x == W / 2 && y == H / 2)
cout << 1;
else
cout << 0;
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,029 | 817,027 | u314816992 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
cout << (double)(a * b) / 2 << " " << ((a / 2 == c) && (b / 2 == d));
}
| #include <bits/stdc++.h>
using namespace std;
long double a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
cout << (a * b) / 2 << " " << ((a / 2 == c) && (b / 2 == d));
}
| [
"variable_declaration.type.narrow.change",
"variable_declaration.type.widen.change"
] | 817,041 | 817,042 | u998677610 | cpp |
p03001 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
cout << (a * b) / 2 << " " << ((a / 2 == c) && (b / 2 == d));
}
| #include <bits/stdc++.h>
using namespace std;
long double a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
cout << (a * b) / 2 << " " << ((a / 2 == c) && (b / 2 == d));
}
| [
"variable_declaration.type.narrow.change",
"variable_declaration.type.widen.change"
] | 817,043 | 817,042 | u998677610 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
double s;
cin >> W >> H >> x >> y;
s = W * H / 2;
cout << s << " ";
if (x == W / 2 && y == H / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
double s;
// float s;
cin >> W >> H >> x >> y;
s = (W * H) / 2;
cout << s << " ";
if (x == W / 2 && y == H / 2) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 817,044 | 817,045 | u031598803 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
LL W, H, x, y;
double ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} else {
... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
double W, H, x, y;
double ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} else... | [
"variable_declaration.type.change"
] | 817,051 | 817,052 | u568682546 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
LL W, H, x, y;
double ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = float(W * H / 2);
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} e... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
double W, H, x, y;
double ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} else... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 817,053 | 817,052 | u568682546 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
LL W, H, x, y;
float ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = float(W * H / 2);
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} el... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
LL N, M, K, r, t, a[100000], aa[100000];
double W, H, x, y;
double ans;
string s, f;
int main() {
cin >> W >> H >> x >> y;
ans = W * H / 2;
if (x == W / 2 && y == H / 2) {
cout << fixed << setprecision(10) << ans << " " << 1 << endl;
} else... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 817,054 | 817,052 | u568682546 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
float ans;
int a = 0;
if (x * 2 == W && y * 2 == H)
a = 1;
ans = W * H / 2;
cout << ans << ' ' << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans;
int a = 0;
if (x * 2 == W && y * 2 == H)
a = 1;
ans = W * H / 2;
cout << ans << ' ' << a << endl;
} | [
"variable_declaration.type.primitive.change"
] | 817,057 | 817,056 | u288905450 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
double s;
cin >> W >> H >> x >> y;
s = (double)W * (double)H / 2.0;
if (W % 2 == 0 && H % 2 == 0) {
if (W / 2 == x && H / 2 == y) {
cout << s << 1 << endl;
} else {
cout << s << " " << 0 << endl;
}
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
double s;
cin >> W >> H >> x >> y;
s = (double)W * (double)H / 2.0;
if (W % 2 == 0 && H % 2 == 0) {
if (W / 2 == x && H / 2 == y) {
cout << s << " " << 1 << endl;
} else {
cout << s << " " << 0 << endl;
}
}... | [
"io.output.change"
] | 817,058 | 817,059 | u507414360 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W = 0, H = 0, x = 0, y = 0;
cin >> W >> H >> x >> y;
cout << W / 2 * H << " ";
if (x <= W / 2 && y <= H / 2) {
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} else {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long W = 0, H = 0, x = 0, y = 0;
cin >> W >> H >> x >> y;
cout << W / 2.0 * H << " ";
if (x <= W / 2 && y <= H / 2) {
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} else {
cout ... | [
"literal.number.change",
"io.output.change"
] | 817,062 | 817,063 | u883817875 | cpp |
p03001 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <t... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <t... | [
"io.output.change"
] | 817,073 | 817,074 | u313288017 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
while (cin >> w >> h >> x >> y) {
printf("%f ", w * h / 2.0);
if (x == w / 2 && y == h / 2)
puts("1");
else
puts("0");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
while (cin >> w >> h >> x >> y) {
printf("%lf ", w * h / 2.0);
if (x == w / 2 && y == h / 2)
puts("1");
else
puts("0");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,077 | 817,078 | u485837651 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
long W, H, x, y;
cin >> W >> H >> x >> y;
long double Area = W * H / 2.0;
cout << std::setprecision(20) << Area << " ";
vector<int> center(2);
center.at(0) = W / 2.0;
center.at(1) = H / 2.0;
if (x == center.at(0) && y == cent... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
long W, H, x, y;
cin >> W >> H >> x >> y;
long double Area = W * H / 2.0;
cout << fixed;
cout << std::setprecision(20) << Area << " ";
vector<double> center(2);
center.at(0) = W / 2.0;
center.at(1) = H / 2.0;
if (x == cente... | [
"variable_declaration.type.primitive.change"
] | 817,079 | 817,080 | u075250977 | cpp |
p03001 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
if (W % 2 == 0 && H % 2 == 0 && W / 2 == x && H... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
if (W % 2 == 0 && H % 2 == 0 && W / 2 == x && H... | [
"literal.number.change",
"io.output.change"
] | 817,083 | 817,084 | u703669948 | cpp |
p03001 | #include <bits/stdc++.h>
#define LL long long
#define P 1000000007
#define M 1000005
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%lf ", 1.0 * w * h / 2);
if (x * 2 == w || 2 * y == h)
puts("1");
else
puts("0");
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define P 1000000007
#define M 1000005
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%lf ", 1.0 * w * h / 2);
if (x * 2 == w && 2 * y == h)
puts("1");
else
puts("0");
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,090 | 817,091 | u837479063 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H ... | [
"variable_declaration.type.change"
] | 817,094 | 817,095 | u174434198 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H ... | [
"variable_declaration.type.primitive.change"
] | 817,096 | 817,095 | u174434198 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, s, d, f;
cin >> a >> s >> d >> f;
double asd = a * s / 2;
cout << fixed << setprecision(6) << asd;
if (d == a / 2 && f == s / 2)
cout << 1;
else
cout << 0;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, s, d, f;
cin >> a >> s >> d >> f;
double asd = a * s / 2;
cout << fixed << setprecision(6) << asd << ' ';
if (d == a / 2 && f == s / 2)
cout << 1;
else
cout << 0;
return 0;
}
| [
"io.output.change"
] | 817,099 | 817,100 | u487510898 | cpp |
p03001 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int W, H, x, y, chec = 0;
cin >> W >> H >> x >> y;
if (W == 2 * x && H == 2 * y) {
chec = 1;
}
printf("%.10lf", (double)(W * H / 2));
cout << " " << chec << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int W, H, x, y, chec = 0;
cin >> W >> H >> x >> y;
if (W == 2 * x && H == 2 * y) {
chec = 1;
}
printf("%.9lf", (double)W * H / 2);
cout << " " << chec << endl;
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,101 | 817,102 | u149526875 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll INF = LLONG_MAX;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
long double... | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll INF = LLONG_MAX;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll w, h, x, y;
cin >> w >> h >> x >> y;
long double... | [
"control_flow.branch.if.condition.change"
] | 817,114 | 817,115 | u019356802 | cpp |
p03001 | #include <bits/stdc++.h>
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<int>()) // descend
// sort(a, a+N) // ascend
using ll = long long;
using namespace std;
int main() {
double w, h, x, y;
cin >... | #include <bits/stdc++.h>
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<int>()) // descend
// sort(a, a+N) // ascend
using ll = long long;
using namespace std;
int main() {
double w, h, x, y;
cin >... | [
"literal.number.change",
"assignment.value.change"
] | 817,123 | 817,124 | u499009346 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int m = 0;
if (x == w / 2 && y == h / 2) {
m = 1;
}
cout << w * h / 2 << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
int m = 0;
if (x == w / 2 && y == h / 2) {
m = 1;
}
cout << w * h / 2 << ' ' << m << endl;
} | [
"io.output.change"
] | 817,129 | 817,130 | u277253335 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(10) << (double)a * b / 2 << ' ';
if (c == a / 2 && d == b / 2) {
cout << 1;
} else {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(10) << (double)a * b / 2 << ' ';
if (c == a / 2 && d == b / 2) {
cout << 1;
} else {
cout << 0;
}
} | [
"variable_declaration.type.primitive.change"
] | 817,131 | 817,132 | u845851868 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(7) << (double)a * b / 2 << ' ';
if (c == a / 2 && d == b / 2) {
cout << 1;
} else {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(10) << (double)a * b / 2 << ' ';
if (c == a / 2 && d == b / 2) {
cout << 1;
} else {
cout << 0;
}
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 817,133 | 817,132 | u845851868 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y, t;
double s;
while (cin >> w >> h >> x >> y) {
s = w * h / 2;
if (w == x * 2 && h == y * 2)
t = 1;
else
t = 0;
printf("%.6lf ", s);
cout << t << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y, t;
double s;
while (cin >> w >> h >> x >> y) {
s = w * h / 2;
if (w == x * 2 && h == y * 2)
t = 1;
else
t = 0;
printf("%.6lf ", s);
cout << t << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 817,138 | 817,139 | u852978989 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
long long W, H, x, y;
int main() {
cin >> W >> H >> x >> y;
double s = W * H / 2.0;
cout << setprecision(20) << s << ' ';
double gx = W / 2, gy = H / 2;
if (x == gx && y == gy)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
using namespace std;
long long W, H, x, y;
int main() {
cin >> W >> H >> x >> y;
double s = W * H / 2.0;
cout << setprecision(20) << s << ' ';
double gx = W / 2.0, gy = H / 2.0;
if (x == gx && y == gy)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 817,146 | 817,147 | u102334466 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
float wd, hd, answer;
wd = w;
hd = h;
answer = wd * hd / 2.0;
cout << setprecision(9) << answer;
if (x == w / 2.0 || y == h / 2.0)
cout << " 1" << endl;
else
cout << " 0" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double wd, hd, answer;
wd = w;
hd = h;
answer = wd * hd / 2.0;
cout << setprecision(9) << answer;
if (x == w / 2.0 && y == h / 2.0)
cout << " 1" << endl;
else
cout << " 0" << endl;
}
| [
"variable_declaration.type.primitive.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,152 | 817,151 | u986947674 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | [
"type_conversion.add"
] | 817,170 | 817,171 | u337775536 | cpp |
p03001 | // by adiforluls
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define ... | // by adiforluls
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define ... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 817,211 | 817,209 | u701389155 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double res = W * H / 2;
int tmp = 0;
if (W == x * 2 && H == y * 2)
tmp = 1;
printf("%.6f %d", res, tmp);
return 0;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double res = (double)W * H / 2;
int tmp = 0;
if (W == x * 2 && H == y * 2)
tmp = 1;
printf("%.6f %d\n", res, tmp);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 817,217 | 817,218 | u326401041 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
double w, h, x, y;
void solve() {
bool onlyOne = (w == 2 * x ^ h == 2 * y);
cout << setprecision(10) << (w * h / 2.0) << " " << (onlyOne ? "0" : "1")
<< endl;
}
int main() {
cin >> w >> h >> x >> y;
solve();
}
| // review
#include <iomanip>
#include <iostream>
using namespace std;
double w, h, x, y;
void solve() {
bool multiple = (w == 2 * x && h == 2 * y);
cout << setprecision(10) << (w * h / 2.0) << " " << (multiple ? "1" : "0")
<< endl;
}
int main() {
cin >> w >> h >> x >> y;
solve();
}
| [
"variable_declaration.name.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 817,225 | 817,226 | u550178285 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << (W * H) / 2 << " " << (2 * x == W && 2 * y == H ? 1 : 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
long long W, H, x, y;
cin >> W >> H >> x >> y;
cout << (double(W) * double(H)) / 2 << " "
<< (2 * x == W && 2 * y == H ? 1 : 0) << endl;
} | [
"call.add",
"call.arguments.change"
] | 817,227 | 817,228 | u940000534 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double)(W * H / 2);
int flag = 0;
if (x * 2 == W && y * 2 == H)
flag = 1;
printf("%.10f %d\n", ans, flag);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double)W * H / 2;
int flag = 0;
if (x * 2 == W && y * 2 == H)
flag = 1;
printf("%.10f %d\n", ans, flag);
return 0;
}
| [] | 817,233 | 817,234 | u067128860 | cpp |
p03001 | #include <stdio.h>
typedef long long int ll;
ll min(ll x, ll y) {
if (x > y) {
return y;
} else {
return x;
}
}
int main(void) {
ll w, h, x, y;
scanf("%lld%lld%lld%lld", &w, &h, &x, &y);
ll menseki = w * h;
printf("%lld %lld\n", menseki / 2, 2 * x == w && 2 * y == h);
return 0;
} | #include <stdio.h>
typedef long long int ll;
ll min(ll x, ll y) {
if (x > y) {
return y;
} else {
return x;
}
}
int main(void) {
ll w, h, x, y;
scanf("%lld%lld%lld%lld", &w, &h, &x, &y);
ll menseki = w * h;
printf("%lf %lld\n", (double)menseki / 2, 2 * x == w && 2 * y == h);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,243 | 817,244 | u497418592 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double s = w * h / 2;
if (x + x == w && y + y == h) {
cout << s << ' ' << '1' << endl;
} else {
cout << s << ' ' << '0' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
double s = double(w) * double(h) / 2;
if (x + x == w && y + y == h) {
cout << s << ' ' << '1' << endl;
} else {
cout << s << ' ' << '0' << endl;
}
} | [
"call.add",
"call.arguments.change"
] | 817,245 | 817,246 | u256868077 | cpp |
p03001 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int main(void) {
LL w, h, x, y;
cin >> w >> h >> x >> y;... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int main(void) {
LL w, h, x, y;
cin >> w >> h >> x >> y;... | [
"variable_declaration.type.change",
"expression.operation.binary.change"
] | 817,247 | 817,248 | u783825935 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int check = 0;
if (W == x * 2 && H == y * 2)
check = 1;
double ans;
ans = W * H / 2;
printf("%0.6f %d\n", ans, check);
} | #include <iostream>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
int check = 0;
if (W == x * 2 && H == y * 2)
check = 1;
double ans;
//キャスト演算子を使用
ans = (double)W * H / 2;
printf("%0.6f %d\n", ans, check);
} | [
"type_conversion.add"
] | 817,254 | 817,255 | u159117146 | cpp |
p03001 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,274 | 817,275 | u199371251 | cpp |
p03001 | /*---------------------------------
@Author: Dicer
@DateTime: 2019-06-17 09:17:14
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * ... | /*---------------------------------
@Author: Dicer
@DateTime: 2019-06-17 09:17:14
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * ... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 817,280 | 817,279 | u613520453 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"literal.number.change",
"io.output.change"
] | 817,283 | 817,284 | u658899890 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"expression.operation.binary.remove"
] | 817,285 | 817,284 | u658899890 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,286 | 817,284 | u658899890 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"expression.operation.binary.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,286 | 817,288 | u658899890 | cpp |
p03001 | #include "bits/stdc++.h"
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
printf("%lf %d\n", double(w) * double(h), x + x == w && y + y == h);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int 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;
} | [
"expression.operation.binary.add"
] | 817,290 | 817,291 | u297292406 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int x, y, a, b;
int main() {
scanf("%d%d%d%d", &x, &y, &a, &b);
printf("%.9f ", double(a) * double(b) / 2.0);
if (2 * a == x && 2 * b == y)
printf("1\n");
else
printf("0\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int x, y, a, b;
int main() {
scanf("%d%d%d%d", &x, &y, &a, &b);
printf("%.9f ", double(x) * double(y) / 2.0);
if (2 * a == x && 2 * b == y)
printf("1\n");
else
printf("0\n");
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 817,299 | 817,300 | u433665020 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
templa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using v = vector<T>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
templa... | [
"misc.opposites",
"io.output.change"
] | 817,309 | 817,310 | u136378781 | cpp |
p03001 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <string>
using ll = long long;
using namespace std;
int main() {
ll W;
cin >> W;
ll H;
cin >> H;
ll x;
cin >> x;
ll y;
cin >> y;
double ans;
ans = (W * H) / 2;
cout << ans << " ";
if (x ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <string>
using ll = long long;
using namespace std;
int main() {
ll W;
cin >> W;
ll H;
cin >> H;
ll x;
cin >> x;
ll y;
cin >> y;
double ans;
ans = (W * H);
ans = ans / 2;
cout << ans << ... | [
"assignment.change"
] | 817,318 | 817,319 | u311671153 | cpp |
p03001 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <string>
using ll = long long;
using namespace std;
int main() {
ll W;
cin >> W;
ll H;
cin >> H;
ll x;
cin >> x;
ll y;
cin >> y;
double ans;
ans = W * H / 2;
cout << ans << " ";
if (x + ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <string>
using ll = long long;
using namespace std;
int main() {
ll W;
cin >> W;
ll H;
cin >> H;
ll x;
cin >> x;
ll y;
cin >> y;
double ans;
ans = (W * H);
ans = ans / 2;
cout << ans << ... | [
"assignment.add",
"assignment.change"
] | 817,320 | 817,319 | u311671153 | cpp |
p03001 | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = w * h / 2;
if (x == w / 2 && y == h / 2)
isNotOnly = 1;
else
isNotOnly = 0;
print... | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
double w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = w * h / 2;
if (x == w / 2 && y == h / 2)
isNotOnly = 1;
else
isNotOnly = 0;
printf("... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 817,321 | 817,322 | u201827503 | cpp |
p03001 | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int w, h, x, y, isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = w * h / 2;
if (x == w / 2 && y == h / 2)
isNotOnly = 1;
else
isNotOnly = 0;
printf("%lf %d\n",... | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
double w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = w * h / 2;
if (x == w / 2 && y == h / 2)
isNotOnly = 1;
else
isNotOnly = 0;
printf("... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,323 | 817,322 | u201827503 | cpp |
p03001 | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = double(w) * double(h) / 2;
if (x == double(w) * 2 && y == double(h) * 2)
isNotOnly = 1;
... | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = double(w) * double(h) / 2;
if (x == double(w) / 2 && y == double(h) / 2)
isNotOnly = 1;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 817,324 | 817,325 | u201827503 | cpp |
p03001 | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = w * h / 2;
if (w == x * 2 && h == y * 2)
isNotOnly = 1;
else
isNotOnly = 0;
print... | #include <bits/stdc++.h>
#define USE_MATH_DEFINES
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long w, h, x, y;
int isNotOnly;
double ans;
cin >> w >> h >> x >> y;
ans = double(w) * double(h) / 2;
if (w == x * 2 && h == y * 2)
isNotOnly = 1;
else
isNotOn... | [
"call.add",
"call.arguments.change"
] | 817,326 | 817,327 | u201827503 | cpp |
p03001 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [
"variable_declaration.type.primitive.change"
] | 817,332 | 817,333 | u366125700 | cpp |
p03001 | ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namesp... | ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namesp... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 817,334 | 817,335 | u802094864 | cpp |
p03001 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target
// ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native"... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target
// ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native"... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 817,342 | 817,341 | u497408083 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int,... | [
"type_conversion.add"
] | 817,349 | 817,350 | u652150585 | cpp |
p03001 | // https://atcoder.jp/contests/
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (n); (i) >= (m)... | // https://atcoder.jp/contests/
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (n); (i) >= (m)... | [
"type_conversion.add"
] | 817,361 | 817,362 | u414220724 | cpp |
p03001 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
long long w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2)
cout << setprecision(10) << w * h / 2 << " " << 1 << endl;
else
cout << setprecision(10) << w * h / 2 << " " << 0 << endl;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> y;
if (x == w / 2 && y == h / 2)
cout << setprecision(10) << w * h / 2 << " " << 1 << endl;
else
cout << setprecision(10) << w * h / 2 << " " << 0 << endl;
} | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.widen.change"
] | 817,368 | 817,369 | u675125216 | cpp |
p03001 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << double(w) * double(h) / 2.0 << ((x * 2 == w) && (y * 2 == h)) << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << double(w) * double(h) / 2.0 << " " << ((x * 2 == w) && (y * 2 == h))
<< endl;
} | [
"io.output.change"
] | 817,370 | 817,371 | u804453976 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 2e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (w * h)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 2e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double... | [
"type_conversion.add"
] | 817,379 | 817,380 | u214304095 | cpp |
p03001 | /*input
2 3 1 2
*/
#include <bits/stdc++.h>
using namespace std;
// ALL DEFFINES HERE
#define ll long long int
#define ii pair<int, int>
#define mp make_pair
#define N 100005
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define pb push_back
#define vi vector<int>
#def... | /*input
2 3 1 2
*/
#include <bits/stdc++.h>
using namespace std;
// ALL DEFFINES HERE
#define ll long long int
#define ii pair<int, int>
#define mp make_pair
#define N 100005
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define pb push_back
#define vi vector<int>
#def... | [
"variable_declaration.type.primitive.change"
] | 817,381 | 817,382 | u956910277 | cpp |
p03001 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 817,388 | 817,389 | u628047647 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | [
"variable_declaration.type.widen.change"
] | 817,392 | 817,393 | u195054737 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,394 | 817,393 | u195054737 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,395 | 817,393 | u195054737 | cpp |
p03001 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout <<... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout <<... | [
"variable_declaration.type.primitive.change"
] | 817,398 | 817,399 | u901615543 | cpp |
p03001 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout <<... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout <<... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 817,400 | 817,399 | u901615543 | cpp |
p03001 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 817,401 | 817,402 | u888735570 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
float w, h, x, y;
cin >> w >> h >> x >> y;
if (w == x + x && h / 2.0 == y + y) {
cout << w * h / 2.0 << " " << 1;
return 0;
} else {
cout << w * h / 2.0 << " " << 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long w, h, x, y;
cin >> w >> h >> x >> y;
if (w == x + x && h == y + y) {
cout << w * h / 2.0 << " " << 1;
return 0;
} else {
cout << w * h / 2.0 << " " << 0;
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 817,415 | 817,414 | u653206280 | cpp |
p03001 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = 1.000000;
ans *= W * H / 2;
printf("%f", ans);
if (W / 2 == x && H / 2 == y) {
puts(" 1");
} else {
puts(" 2");
}
} | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = 1.000000;
ans *= W * H / 2;
printf("%f ", ans);
if (W / 2 == x && H / 2 == y) {
puts("1");
} else {
puts("0");
}
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 817,422 | 817,423 | u685922019 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2 << ' ';
if (x == (double)w / 2 || y == (double)h / 2)
cout << 1;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * h / 2 << ' ';
if (x == (double)w / 2 && y == (double)h / 2)
cout << 1;
else
cout << 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 817,426 | 817,427 | u408650734 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
bool is_even(int w, int h, int x, int y) {
return ((w - x == w) && (h - y == h));
}
int main(int argc, char **argv) {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (is_even(w, h,... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
bool is_even(int w, int h, int x, int y) {
return ((w - x == x) && (h - y == y));
}
int main(int argc, char **argv) {
int w, h, x, y;
cin >> w >> h >> x >> y;
if (is_even(w, h,... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 817,434 | 817,435 | u603356062 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << h * w / 2;
if (x == w / 2 && y == h / 2)
ans = 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << h * w / 2;
if (x == w / 2 && y == h / 2)
ans = 1;
cout << " " << ans << endl;
} | [
"io.output.change"
] | 817,440 | 817,441 | u370447425 | cpp |
p03001 | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | [
"call.add",
"call.arguments.add"
] | 817,444 | 817,445 | u993640894 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | #include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | [
"literal.number.change",
"expression.operation.binary.change"
] | 817,448 | 817,449 | u668711082 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.