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 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | [
"variable_declaration.type.primitive.change"
] | 1,016,275 | 1,016,276 | u872959410 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,016,277 | 1,016,276 | u872959410 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, biao;
int a[2001];
int main() {
cin >> n >> t >> biao;
int minv = 1e9, mini;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
int v = abs((t - a[i] * 0.006) - biao);
if (v < minv) {
minv = v;
mini = i;
}
... | #include <bits/stdc++.h>
using namespace std;
int n, t, biao;
int a[2001];
int main() {
cin >> n >> t >> biao;
float minv = 10000;
int mini;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
float v = abs((t - a[i] * 0.006) - biao);
if (v < minv) {
minv = v;
mini... | [
"variable_declaration.type.primitive.change"
] | 1,016,278 | 1,016,279 | u452118336 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int i, minn = INT_MAX, id;
a *= 1000;
b *= 1000;
for (i = 1; i <= n; i++) {
int x;
cin >> x;
x *= 6;
if (abs(a - (b - x)) < minn) {
minn = abs(a - (b - x));
id = i;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int i, minn = INT_MAX, id;
a *= 1000;
b *= 1000;
for (i = 1; i <= n; i++) {
int x;
cin >> x;
x *= 6;
if (abs(b - (a - x)) < minn) {
minn = abs(b - (a - x));
id = i;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,280 | 1,016,281 | u482886118 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,016,282 | 1,016,283 | u906208439 | cpp |
p03220 | #include <bits/stdc++.h>
int main() {
int n, t, a;
std::cin >> n;
std::cin >> t >> a;
std::vector<int> h(n);
int hi = 0;
for (auto &ha : h) {
std::cin >> hi;
ha = t - hi * 0.006;
}
int result = 0;
int diff = std::abs(a - h[0]);
for (auto i = 1; i < n; ++i) {
int d = std::abs(a - h[i... | #include <bits/stdc++.h>
int main() {
int n, t, a;
std::cin >> n;
std::cin >> t >> a;
std::vector<double> h(n);
int hi = 0;
for (auto &ha : h) {
std::cin >> hi;
ha = t - hi * 0.006;
}
int result = 0;
double diff = std::abs(a - h[0]);
for (auto i = 1; i < n; ++i) {
double d = std::ab... | [
"variable_declaration.type.primitive.change"
] | 1,016,285 | 1,016,286 | u696729148 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1005;
int main() {
int h[maxn];
int n, t, a;
double b[maxn];
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
b[i] = t * 1.0 - h[i] * 0.006;
}
int ans = 1, minv;
minv = abs(b[1] - a * 1.0);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1005;
int main() {
int h[maxn];
int n, t, a;
double b[maxn];
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
b[i] = t * 1.0 - h[i] * 0.006;
}
int ans = 1;
double minv;
minv = abs(b[1] - ... | [
"variable_declaration.type.change"
] | 1,016,290 | 1,016,291 | u022441529 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T;
int A;
cin >> N;
cin >> T >> A;
int min = 100000000;
int height;
int tmp;
int index = -1;
for (int i = 0; i < N; i++) {
cin >> height;
tmp = abs(T - height * 0.006 - A);
if (tmp < min)... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T;
int A;
cin >> N;
cin >> T >> A;
float min = 100000000;
int height;
float tmp;
int index = -1;
for (int i = 0; i < N; i++) {
cin >> height;
tmp = abs(T - height * 0.006 - A);
if (tmp < ... | [
"variable_declaration.type.primitive.change"
] | 1,016,292 | 1,016,293 | u904833081 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t, a, h[1000], H, MIN = 0x3f3f3f;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> H;
H = t - H * 0.006;
h[i] = abs(H - ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
double t, a, h[1000], H, MIN = 0x3f3f3f;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> H;
H = t - H * 0.006;
h[i] =... | [
"variable_declaration.type.change"
] | 1,016,296 | 1,016,297 | u825110984 | cpp |
p03220 | #include <bits/stdc++.h>
int main(void) {
int n;
int t, a;
std::cin >> n >> t >> a;
std::vector<int> h(n);
std::vector<double> tem(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
double dis;
int count = 0;
for (int i = 0; i < n; i++) {
tem[i] = t - (h[i] * 0.006);
}
dis = abs(tem[0... | #include <bits/stdc++.h>
int main(void) {
int n;
int t, a;
std::cin >> n >> t >> a;
std::vector<int> h(n);
std::vector<double> tem(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
double dis;
int count = 0;
for (int i = 0; i < n; i++) {
tem[i] = t - (h[i] * 0.006);
}
dis = abs(tem[0... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,016,298 | 1,016,299 | u887066391 | cpp |
p03220 | #include <bits/stdc++.h>
int main(void) {
int n;
int t, a;
std::cin >> n >> t >> a;
std::vector<int> h(n);
std::vector<double> tem(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int dis;
int count = 0;
for (int i = 0; i < n; i++) {
tem[i] = t - (h[i] * 0.006);
}
dis = abs(tem[0] -... | #include <bits/stdc++.h>
int main(void) {
int n;
int t, a;
std::cin >> n >> t >> a;
std::vector<int> h(n);
std::vector<double> tem(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
double dis;
int count = 0;
for (int i = 0; i < n; i++) {
tem[i] = t - (h[i] * 0.006);
}
dis = abs(tem[0... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,016,300 | 1,016,299 | u887066391 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"assignment.change"
] | 1,016,301 | 1,016,302 | u610060877 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
int t = fabs(T - (H[0] * 0.006) - A);
for (int i = 1; i < N; i++) {
int a = fabs(T - (H[i] * 0.006) - ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
double t = fabs(T - (H[0] * 0.006) - A);
for (int i = 1; i < N; i++) {
double a = fabs(T - (H[i] * 0.0... | [
"variable_declaration.type.primitive.change"
] | 1,016,303 | 1,016,304 | u170650966 | cpp |
p03220 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H;
cin >> N >> T >> A >> H;
T = 1000 * (T - A); // Tを平行移動することで、計算を楽にする
int diff = abs(T - 6 * H),
ans = 1; // diffは平均気温との差、これが最も小さくなる地点を探すよ
for (int i = 2; i <= N; ++i) {
cin >> H;
if (diff > abs(T - 6 * H))... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H;
cin >> N >> T >> A >> H;
T = 1000 * (T - A); // Tを平行移動することで、計算を楽にする
int diff = abs(T - 6 * H),
ans = 1; // diffは平均気温との差、これが最も小さくなる地点を探すよ
for (int i = 2; i <= N; ++i) {
cin >> H;
if (diff > abs(T - 6 * H))... | [
"call.add",
"call.arguments.change"
] | 1,016,306 | 1,016,307 | u550314572 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define M 1003
int main() {
int N, T, A, H[N];
double ret[N], re[N];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
ret[i] = abs(T - H[i] * 0.006 - A);
re[i] = ret[i];
}
sort(re, re + N);
for (int i ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define M 1003
int main() {
int N, T, A, H[M];
double ret[M], re[M];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
ret[i] = abs(T - H[i] * 0.006 - A);
re[i] = ret[i];
}
sort(re, re + N);
for (int i ... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 1,016,308 | 1,016,309 | u972622077 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int N, T, A;
long mse = 100000;
int min_i;
long abs_mse;
int main... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int N, T, A;
double mse = 100000;
int min_i;
double abs_mse;
int ... | [
"variable_declaration.type.primitive.change"
] | 1,016,310 | 1,016,311 | u113497060 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int N, T, A;
int mse = 100000;
int min_i;
int abs_mse;
int main(v... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int N, T, A;
double mse = 100000;
int min_i;
double abs_mse;
int ... | [
"variable_declaration.type.primitive.change"
] | 1,016,313 | 1,016,311 | u113497060 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans, t, a, hei = 1000000;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
long long h;
cin >> h;
if (abs(a - (t - 0.006f * h)) < hei) {
hei = abs(a - (t - 0.006f * h));
ans = i + 1;
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans, t, a;
double hei = 1000000;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
long long h;
cin >> h;
if (abs(a - (t - 0.006f * h)) < hei) {
hei = abs(a - (t - 0.006f * h));
ans = i + 1;
}
}
cout ... | [
"variable_declaration.type.change"
] | 1,016,314 | 1,016,315 | u433780933 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5;
int n;
int t;
int a;
int h[1005];
int main() {
while (cin >> n >> t >> a) {
int ans = 1;
double gap = 0.0;
double min_gap = 0.0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
gap = abs(a - (t - 0.006)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5;
int n;
int t;
int a;
int h[1005];
int main() {
while (cin >> n >> t >> a) {
int ans = 1;
double gap = 0.0;
double min_gap = 0.0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
gap = abs(a - (t - 0.006 ... | [
"call.arguments.change"
] | 1,016,316 | 1,016,317 | u951242330 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int count = 0;
cin >> count;
int t, a = 0;
int h[count];
int ans, tmp = 0;
int cmp = 2147483640;
int i = 0;
cin >> t >> a;
for (i = 0; i < count; ++i) {
cin >> tmp;
h[i] = t - tmp * 0.006;
}
tmp = 0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int count = 0;
cin >> count;
int t, a = 0;
double h[count];
double ans, tmp = 0;
double cmp = 2147483640;
int i = 0;
cin >> t >> a;
for (i = 0; i < count; ++i) {
cin >> tmp;
h[i] = t - tmp * 0.006;
}
... | [
"variable_declaration.type.primitive.change"
] | 1,016,318 | 1,016,319 | u473234731 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 10000000;
int main() {
double n, t, a;
double h[1000], temp[1001];
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i] = abs(a - t + 0.006 * h[i]);
}
int ans =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 10000000;
int main() {
double n, t, a;
double h[1000], temp[1001];
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i] = abs(a - t + 0.006 * h[i]);
}
int ans =... | [
"variable_declaration.remove"
] | 1,016,320 | 1,016,321 | u387055019 | cpp |
p03220 | #include <stdio.h>
int main() {
int n, t, d, index, h;
double tmp, s;
int m = 1000000;
scanf("%d %d %d", &n, &t, &d);
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
tmp = t - h * 0.006 - d;
s = (tmp > 0) ? tmp : -tmp;
if (s < m)
m = s, index = i;
}
printf("%d", index);
return 0;
} | #include <stdio.h>
int main() {
int n, t, d, index, h;
double tmp, s, m = 1000000;
scanf("%d %d %d", &n, &t, &d);
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
tmp = t - h * 0.006 - d;
s = (tmp > 0) ? tmp : -tmp;
if (s < m)
m = s, index = i;
}
printf("%d", index);
return 0;
} | [] | 1,016,322 | 1,016,323 | u203028146 | cpp |
p03220 | #include <stdio.h>
int main() {
int n, t, d, index, h;
double tmp, s;
int m = 1000000;
scanf("%d %d %d", &n, &t, &d);
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
tmp = t - h * 0.006 - d;
s = (tmp < 0) ? -tmp : tmp;
if (s < m)
m = s, index = i;
}
printf("%d", index);
return 0;
} | #include <stdio.h>
int main() {
int n, t, d, index, h;
double tmp, s, m = 1000000;
scanf("%d %d %d", &n, &t, &d);
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
tmp = t - h * 0.006 - d;
s = (tmp > 0) ? tmp : -tmp;
if (s < m)
m = s, index = i;
}
printf("%d", index);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove",
"expression.operation.unary.add"
] | 1,016,325 | 1,016,323 | u203028146 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int t, h[1001], n, a;
double te[1001];
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
te[i] = t - 0.006 * h[i];
te[i] = abs(a - te[i]);
}
int mn = 1000001, mni;
for (int i = 1; i <= n; i++)
if (te[i] < ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int t, h[1001], n, a;
double te[1001];
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
te[i] = t - 0.006 * h[i];
te[i] = abs(a - te[i]);
}
double mn = 1000001, mni;
for (int i = 1; i <= n; i++)
if (te[i]... | [
"variable_declaration.type.primitive.change"
] | 1,016,326 | 1,016,327 | u671809974 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
std::vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
std::vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans[i] = T * 500 - H[i] * 3;
}
int y, z;
y = ab... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
std::vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
std::vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans[i] = T * 500 - H[i] * 3;
}
int y, z;
y = ab... | [
"assignment.add"
] | 1,016,329 | 1,016,330 | u266643907 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans, T, A, H, tem, d[10000];
d[0] = 10000;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
tem = T - H * 0.006;
d[i] = fabs(A - tem);
if (d[i - 1] < d[i]) {
d[i] = d[i - 1];
} else {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
double T, A, H, tem, d[10000];
d[0] = 10000;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
tem = T - H * 0.006;
d[i] = fabs(A - tem);
if (d[i - 1] < d[i]) {
d[i] = d[i - 1];
} else {
... | [
"variable_declaration.type.change"
] | 1,016,331 | 1,016,332 | u663970214 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
double T, A, H, tem, d[10000];
d[0] = 10000;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
tem = T - H * 0.006;
d[i] = fabs(A - tem);
if (d[i - 1] < d[i]) {
ans = i - 1;
d[i] = d[i - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
double T, A, H, tem, d[10000];
d[0] = 10000;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
tem = T - H * 0.006;
d[i] = fabs(A - tem);
if (d[i - 1] < d[i]) {
d[i] = d[i - 1];
} else {
... | [] | 1,016,333 | 1,016,332 | u663970214 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, a[1010];
double p;
int x, h;
while (cin >> N) {
memset(a, 0, sizeof(a));
cin >> T >> A;
p = (T - A) / 0.06;
h = 999999999;
x = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = 1; i <= N; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, a[1010];
double p;
int x, h;
while (cin >> N) {
memset(a, 0, sizeof(a));
cin >> T >> A;
p = (T - A) / 0.006;
h = 999999999;
x = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = 1; i <= N; i... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,016,334 | 1,016,335 | u997215583 | cpp |
p03220 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int i;
long int h[n + 1];
for (i = 1; i <= n; ++i)
cin >> h[i];
int cels[i];
for (i = 1; i <= n; ++i) {
cels[i] = t - h[i] * 0.00... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int i;
long int h[n + 1];
for (i = 1; i <= n; ++i)
cin >> h[i];
float cels[i];
for (i = 1; i <= n; ++i) {
cels[i] = t - h[i] * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,016,339 | 1,016,340 | u423624748 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
double n, t, a;
double h;
double p;
int count = 0;
double place = 10000.0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
p = a - (t - ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
double n, t, a;
double h;
double p;
int count = 0;
double place = 10000.0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
p = abs(a - (... | [
"call.add",
"call.arguments.change"
] | 1,016,346 | 1,016,347 | u320509353 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int aa = 10000;
int re = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int num = abs(A - T + H * 0.006);
if (num < aa) {
re = i + 1;
aa = num;
}
}
cout << re << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double aa = 10000;
int re = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double num = abs(A - T + H * 0.006);
if (num < aa) {
re = i + 1;
aa = num;
}
}
cout << re << endl;
ret... | [
"variable_declaration.type.primitive.change"
] | 1,016,352 | 1,016,353 | u602050973 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(a) cout << a << e... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(a) cout << a << e... | [
"variable_declaration.type.change"
] | 1,016,357 | 1,016,358 | u610734676 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(a) cout << a << e... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(a) cout << a << e... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,016,359 | 1,016,358 | u610734676 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n >> a >> b;
int i;
int c;
int k = 0, minn = 1e9;
for (i = 0; i < n; i++) {
cin >> c;
double d = a - c * 0.006;
// cout<<fabs(d-b)<<" "<<i<<endl;
if (fabs(d - b) < minn) {
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n >> a >> b;
int i;
int c;
int k = 0;
double minn = 1e9;
for (i = 0; i < n; i++) {
cin >> c;
double d = a - c * 0.006;
// cout<<fabs(d-b)<<" "<<i<<endl;
if (fabs(d - b) < minn... | [
"variable_declaration.type.change"
] | 1,016,360 | 1,016,361 | u737168568 | cpp |
p03220 | #include <bits/stdc++.h>
#include <random>
#include <unistd.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typed... | #include <bits/stdc++.h>
#include <random>
#include <unistd.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typed... | [
"variable_declaration.type.primitive.change"
] | 1,016,362 | 1,016,363 | u550995059 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll N, T, A;
vector<ll> H;
void input() {
cin >> N >> T >> A;
H.r... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll N, T, A;
vector<ll> H;
void input() {
cin >> N >> T >> A;
H.r... | [
"function.return_type.change",
"call.function.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.change"
] | 1,016,366 | 1,016,367 | u500092662 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
const int m = 1000;
int n, t, a, i, j = 1, h[m], min;
cin >> n >> t >> a;
for (i = 1; i <= n; i++) {
cin >> h[i];
h[i] = t - 0.006 * h[i];
}
for (i = 1; i <= n; i++) {
h[i] = abs(h[i] - a);
}
min = h[1];
for (i = 1; i <... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
const int m = 1000;
int n, t, a, i, j = 1;
float h[m], min;
cin >> n >> t >> a;
for (i = 1; i <= n; i++) {
cin >> h[i];
h[i] = t - 0.006 * h[i];
}
for (i = 1; i <= n; i++) {
h[i] = abs(h[i] - a);
}
min = h[1];
for (i ... | [
"variable_declaration.type.change"
] | 1,016,376 | 1,016,377 | u412518117 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
const int m = 1000;
int n, t, a, i, j = 1, h[m], min;
cin >> n >> t >> a;
for (i = 1; i <= n; i++) {
cin >> h[i];
h[i] = t - 0.06 * h[i];
}
for (i = 1; i <= n; i++) {
h[i] = abs(h[i] - a);
}
min = h[1];
for (i = 1; i < ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
const int m = 1000;
int n, t, a, i, j = 1;
float h[m], min;
cin >> n >> t >> a;
for (i = 1; i <= n; i++) {
cin >> h[i];
h[i] = t - 0.006 * h[i];
}
for (i = 1; i <= n; i++) {
h[i] = abs(h[i] - a);
}
min = h[1];
for (i ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,016,378 | 1,016,377 | u412518117 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, B, Ans = 1;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> Ht(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++) {
if (A - (T - H.at(i) * 0.006) >= 0)
Ht.at(i) = A - (T - H.at(i) * 0.006)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, Ans = 1;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> Ht(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++) {
if (A - (T - H.at(i) * 0.006) >= 0)
Ht.at(i) = A - (T - H.at(i) * 0.006);
... | [
"variable_declaration.remove"
] | 1,016,387 | 1,016,388 | u519604525 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, B, Ans = 1;
cin >> N >> T >> A;
vector<int> H(N);
vector<int> Ht(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++) {
if (A - (T - H.at(i) * 0.006) >= 0)
Ht.at(i) = A - (T - H.at(i) * 0.006);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, Ans = 1;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> Ht(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++) {
if (A - (T - H.at(i) * 0.006) >= 0)
Ht.at(i) = A - (T - H.at(i) * 0.006);
... | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 1,016,389 | 1,016,388 | u519604525 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h> // fabs(doubleの変数)とか
#include <stdio.h>
#include <stdlib.h>
#include <string>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef lo... | #include <algorithm>
#include <iostream>
#include <math.h> // fabs(doubleの変数)とか
#include <stdio.h>
#include <stdlib.h>
#include <string>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef lo... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,016,396 | 1,016,397 | u867763103 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
int resultIndex, min = 10 << 6;
for (int index = 0; index < N; index++) {
int H;
cin >> H;
if (abs((T... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
int resultIndex;
double min = 10 << 6;
for (int index = 0; index < N; index++) {
int H;
cin >> H;
i... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,016,400 | 1,016,401 | u777853124 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int x, m;
int s;
cin >> n;
cin >> t >> a;
m = 1;
cin >> x;
s = fabs(t - x * 0.006 - a);
for (int i = 2; i <= n; i++) {
cin >> x;
if (fabs(t - x * 0.006 - a) < s) {
s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int x, m;
double s;
cin >> n;
cin >> t >> a;
m = 1;
cin >> x;
s = fabs(t - x * 0.006 - a);
for (int i = 2; i <= n; i++) {
cin >> x;
if (fabs(t - x * 0.006 - a) < s) {
... | [
"variable_declaration.type.primitive.change"
] | 1,016,402 | 1,016,403 | u061597928 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
//-------------------------------------------------------
int main() {
float n, t, a;
float h[1001];
scanf("%f%f%f\n", &n, &t, &a);
float min = 100000;
int res = 0;
for (int i = 0; i < n; i++) {
scanf("%f\n", &h[i]);
float temp1, temp2;
temp1 = t -... | #include <bits/stdc++.h>
using namespace std;
//-------------------------------------------------------
int main() {
float n, t, a;
float h[1001];
scanf("%f%f%f\n", &n, &t, &a);
float min = 100000;
int res = 0;
for (int i = 0; i < n; i++) {
scanf("%f\n", &h[i]);
float temp1, temp2;
temp1 = t -... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,016,408 | 1,016,409 | u579754454 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
double b = 100000;
int res = 0;
for (int i = 0; i < N; i++) {
int c = abs(A - (... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
double b = 100000000;
int res = 0;
for (int i = 0; i < N; i++) {
double c = abs... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,410 | 1,016,411 | u250101177 | cpp |
p03220 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using namespace std;
using ll = long lon... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using namespace std;
using ll = long lon... | [
"call.arguments.change"
] | 1,016,412 | 1,016,413 | u585101972 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, T, A, num;
int arr[1005];
double map[1005];
double vis[1005];
cin >> N;
cin >> T >> A;
for (i = 1; i <= N; i++) {
cin >> arr[i];
}
for (j ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, T, A;
int arr[1005];
double map[1005];
double vis[1005];
double num;
cin >> N;
cin >> T >> A;
for (i = 1; i <= N; i++) {
cin >> arr[i];
}
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,016,414 | 1,016,415 | u086744592 | cpp |
p03220 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_std... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_std... | [
"variable_declaration.type.primitive.change"
] | 1,016,419 | 1,016,420 | u844133200 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, a;
double t;
double h[1010];
double cha[1010];
int id, minx = 99999999;
int main() {
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
cha[i] = abs(h[i] * 0.006 - a);
for (int i = 1; i <= n; i++)
if ... | #include <bits/stdc++.h>
using namespace std;
int n, a;
double t;
double h[1010];
double cha[1010];
int id;
double minx = 99999999;
int main() {
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
cha[i] = fabs(t - h[i] * 0.006 - a);
for (int i = 1; i <= n; ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change"
] | 1,016,421 | 1,016,422 | u571287320 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a, temp;
vector<int> h;
cin >> n >> t >> a;
for (int i = 0; i < n; ++i) {
cin >> temp;
h.push_back(temp);
}
int best, index = 0;
best = t - h[0] * 0.006;
for (int i = 1; i < h.size(); ++i) {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a, temp;
vector<int> h;
cin >> n >> t >> a;
for (int i = 0; i < n; ++i) {
cin >> temp;
h.push_back(temp);
}
double best;
int index = 0;
best = t - h[0] * 0.006;
for (int i = 1; i < h.size(); ... | [
"variable_declaration.type.primitive.change"
] | 1,016,423 | 1,016,424 | u752543719 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int min_diff = 1000;
int pos = -1;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (min_diff > fabs(T - h * 0.006 - A)) {
pos = i;
min_diff = fabs(T - h * 0.006... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double min_diff = 1000;
int pos = -1;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (min_diff > fabs(T - h * 0.006 - A)) {
pos = i;
min_diff = fabs(T - h * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,016,432 | 1,016,433 | u090436701 | cpp |
p03220 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
using namespace ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
using namespace ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,016,434 | 1,016,435 | u378945900 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double min = 1e9;
int ans;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (abs(a - t - h * 0.006) < min) {
min = abs(a - t - h * 0.006);
ans = i + 1;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double min = 1e9;
int ans;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (abs(a - (t - h * 0.006)) < min) {
min = abs(a - (t - h * 0.006));
ans = i + 1;
}
}
c... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,016,436 | 1,016,437 | u164007697 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, ans, h[1001];
double min = 1000.0;
double s = 0.0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
s = t - 0.006 * h[i];
if (min > abs(a - s)) {
min = abs(a - s);
ans = i;
}
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, ans, h[1001];
double min = 1000.0;
double s = 0.0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
s = t - 0.006 * h[i];
if (min > abs(a - s)) {
min = abs(a - s);
ans = i + 1;
}
}
cout << a... | [
"assignment.change"
] | 1,016,444 | 1,016,445 | u018434698 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long kion(int T, int x) { return T - x * 0.006; }
int main() {
int n, t, a;
long min = 6000;
int ans = 0;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
if (abs(k... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
float kion(int T, int x) { return T - x * 0.006; }
int main() {
int n, t, a;
float min = 6000;
int ans = 0;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
if (abs... | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 1,016,446 | 1,016,447 | u801807320 | cpp |
p03220 | #include <stdio.h>
float abs(float a);
int main(void) {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
int H[1000];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
int ans = 1;
float ga = abs(A - (T - H[0] * 0.06));
float gb;
for (i = 1; i < N; i++) {
gb = abs(A - (... | #include <stdio.h>
float abs(float a);
int main(void) {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
int H[1000];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
int ans = 1;
float ga = abs(A - (T - H[0] * 0.006));
float gb;
for (i = 1; i < N; i++) {
gb = abs(A - ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,016,455 | 1,016,456 | u516922881 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,016,461 | 1,016,462 | u666394517 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,016,463 | 1,016,464 | u122890215 | cpp |
p03220 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
double t;
cin >> n >> t >> a;
int best = 1;
double maxi = numeric_limits<double>::max();
for (int i = 0; i < n; i++) {
double b;
cin >> b;
double rep = t -... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
double t;
cin >> n >> t >> a;
int best = 1;
double maxi = numeric_limits<double>::max();
for (int i = 0; i < n; i++) {
double b;
cin >> b;
double rep = t -... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,465 | 1,016,466 | u457198113 | cpp |
p03220 | #include <cstdio>
double ABS(const double &a) {
if (a < 0)
return -a;
return a;
}
int main() {
int n, ans = 1;
double T, A, dis, nowH, nd;
scanf("%d", &n);
scanf("%lf%lf", &T, &A);
scanf("%lf", &nowH);
nowH = T - (nowH * 0.006);
dis = ABS(nowH - A);
for (int i = 2; i <= n; i++) {
scanf("%d",... | #include <cstdio>
double ABS(const double &a) {
if (a < 0)
return -a;
return a;
}
int main() {
int n, ans = 1;
double T, A, dis, nowH, nd;
scanf("%d", &n);
scanf("%lf%lf", &T, &A);
scanf("%lf", &nowH);
nowH = T - (nowH * 0.006);
dis = ABS(nowH - A);
for (int i = 2; i <= n; i++) {
scanf("%lf"... | [
"literal.string.change",
"call.arguments.change"
] | 1,016,467 | 1,016,468 | u125804208 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define db double
using namespace std;
int n, m, i, j, k, T, A, x, id;
db mi;
int main() {
scanf("%d", &n);
scanf("%d%d", &T, &A);
id = 0;
mi = 2147483647;
for (i = 1; i <= n; i++) {
scanf("%d", &x);
if (abs(A - 1.0 * x * 0.0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define db double
using namespace std;
int n, m, i, j, k, T, A, x, id;
db mi;
int main() {
scanf("%d", &n);
scanf("%d%d", &T, &A);
id = 0;
mi = 2147483647;
for (i = 1; i <= n; i++) {
scanf("%d", &x);
if (abs(T - 1.0 * x * 0.0... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,016,471 | 1,016,472 | u749044800 | cpp |
p03220 | #include <iostream>
#include <vector>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
cin >> h;
int j = 0;
int to = t - h * 0.006;
for (int i = 1; i < n; ++i) {
cin >>... | #include <iostream>
#include <vector>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
cin >> h;
int j = 0;
double to = t - h * 0.006;
for (int i = 1; i < n; ++i) {
cin... | [
"variable_declaration.type.primitive.change"
] | 1,016,480 | 1,016,481 | u148019779 | cpp |
p03220 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
long num = 0;
long M = 0;
long x = 0;
long a[2];
long b[2];
long c[10000];
long n;
int i, j;
for (i = 0; i < 1; i++) {
scanf("%ld", a + i);
}
for (i = 0; i < 2; i++) {
scanf("%ld", b + i);
}
for (i = 0; i < a[0]; i+... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
long num = 0;
long M = 0;
long x = 0;
long a[2];
long b[2];
long c[10000];
long n;
int i, j;
for (i = 0; i < 1; i++) {
scanf("%ld", a + i);
}
for (i = 0; i < 2; i++) {
scanf("%ld", b + i);
}
for (i = 0; i < a[0]; i+... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,016,482 | 1,016,483 | u924153316 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef unsigned long ul;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long> vl;
typedef vector<double> vd;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef unsigned long ul;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long> vl;
typedef vector<double> vd;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<... | [
"assignment.add"
] | 1,016,485 | 1,016,486 | u741895052 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, x;
double t, a, y = 10000000;
int main(void) {
cin >> n >> t >> a;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, x;
double t, a, y = 10000000;
int main(void) {
cin >> n >> t >> a;
for (int i = 0; i < n; i++... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,016,487 | 1,016,488 | u743900647 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, x;
double t, a, y = 10000000;
int main(void) {
cin >> n >> t >> a;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, x;
double t, a, y = 10000000;
int main(void) {
cin >> n >> t >> a;
for (int i = 0; i < n; i++... | [
"assignment.change"
] | 1,016,489 | 1,016,488 | u743900647 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
double h[1009];
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ret = 1;
double temp = abs(t - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (abs(t - (t - h[i] * 0.00... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
double h[1009];
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ret = 1;
double temp = abs(a - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (abs(a - (t - h[i] * 0.00... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,016,494 | 1,016,495 | u838954343 | cpp |
p03220 | #include <bits/stdc++.h>
#define pb push_back
#define nl puts("")
#define sp printf(" ")
#define phl printf("hello\n")
#define ff first
#define ss second
#define POPCOUNT __builtin_popcountll
#define RIGHTMOST __builtin_ctzll
#define LEFTMOST(x) (63 - __builtin_clzll((x)))
#define MP make_pair
#define FOR(i, x, y) for... | #include <bits/stdc++.h>
#define pb push_back
#define nl puts("")
#define sp printf(" ")
#define phl printf("hello\n")
#define ff first
#define ss second
#define POPCOUNT __builtin_popcountll
#define RIGHTMOST __builtin_ctzll
#define LEFTMOST(x) (63 - __builtin_clzll((x)))
#define MP make_pair
#define FOR(i, x, y) for... | [
"literal.number.change",
"assignment.value.change",
"assignment.add"
] | 1,016,496 | 1,016,497 | u271223091 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
double h[1100];
double t;
double n;
double mb;
int main() {
cin >> n >> t >> mb;
for (int i = 1; i <= n; i++)
cin >> h[i];
int daan;
int cz = 999999999;
for (int i = 1; i <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
double h[1100];
double t;
double n;
double mb;
int main() {
cin >> n >> t >> mb;
for (int i = 1; i <= n; i++)
cin >> h[i];
int daan;
double cz = 999999999;
for (int i = 1; ... | [
"variable_declaration.type.primitive.change"
] | 1,016,500 | 1,016,501 | u130052501 | cpp |
p03216 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | [] | 1,016,510 | 1,016,511 | u162364634 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
lin n;
string s;
lin q;
void solve(lin k) {
queue<lin> d;
queue<lin> m;
lin ad = 0;
lin res =... | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
lin n;
string s;
lin q;
void solve(lin k) {
queue<lin> d;
queue<lin> m;
lin ad = 0;
lin res =... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,016,532 | 1,016,533 | u762193256 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int maxm = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
// typedef __int128 II;
typedef long long LL;
typedef pair<int, int> pii;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n, q, k, a[10... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int maxm = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
// typedef __int128 II;
typedef long long LL;
typedef pair<int, int> pii;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n, q, k, a[10... | [
"assignment.change"
] | 1,016,538 | 1,016,539 | u535623178 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statis... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statis... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 1,016,573 | 1,016,574 | u750630712 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | [] | 1,016,575 | 1,016,576 | u434231045 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, maxd = 2020;
int x[maxn], y[maxn];
int cnt[maxd][maxd];
int p[3][maxd][maxd];
long long lim[3];
int main() {
int n, d;
cin >> n >> d;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
cnt[x[i] % d][y[i] % d... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, maxd = 2020;
int x[maxn], y[maxn];
int cnt[maxd][maxd];
int p[3][maxd][maxd];
long long lim[3];
int main() {
int n, d;
cin >> n >> d;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
cnt[x[i] % d][y[i] % d... | [
"assignment.change"
] | 1,016,579 | 1,016,580 | u251828455 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,583 | 1,016,584 | u762921614 | cpp |
p03217 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<int> X(N), Y(N);
vector<vector<int>> C(D, vector<int>(D));
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
++C[X[i] % D][Y[i] % D];
}
int maxnum = 0... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<int> X(N), Y(N);
vector<vector<int>> C(D, vector<int>(D));
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
++C[X[i] % D][Y[i] % D];
}
int maxnum = 0... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,585 | 1,016,586 | u837745858 | cpp |
p03217 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<int> X(N), Y(N);
vector<vector<int>> C(D, vector<int>(D));
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
++C[X[i] % D][Y[i] % D];
}
int maxnum = 0... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<int> X(N), Y(N);
vector<vector<int>> C(D, vector<int>(D));
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
++C[X[i] % D][Y[i] % D];
}
int maxnum = 0... | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,587 | 1,016,586 | u837745858 | cpp |
p03217 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
template <typename __T> inline void read(__T &x) {
x = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigi... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
template <typename __T> inline void read(__T &x) {
x = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigi... | [
"expression.operator.change"
] | 1,016,588 | 1,016,589 | u673766220 | cpp |
p03217 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
template <typename __T> inline void read(__T &x) {
x = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigi... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
template <typename __T> inline void read(__T &x) {
x = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigi... | [
"expression.operator.change"
] | 1,016,590 | 1,016,589 | u673766220 | cpp |
p03217 | #include <bits/stdc++.h>
#define N 1010
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char ch = getchar();
int fh = 1;
while (!isdigit(ch)) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x = x * fh;
}... | #include <bits/stdc++.h>
#define N 1010
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char ch = getchar();
int fh = 1;
while (!isdigit(ch)) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x = x * fh;
}... | [
"assignment.add"
] | 1,016,593 | 1,016,594 | u539443668 | cpp |
p03217 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | [
"identifier.change",
"function.return_value.change"
] | 1,016,595 | 1,016,596 | u294531924 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
const char nl = '\n';
/* -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- */
#include <bits/extc++.h>
namespace pbds = __gnu_pbds;
template <typename key, typename val = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
const char nl = '\n';
/* -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- */
#include <bits/extc++.h>
namespace pbds = __gnu_pbds;
template <typename key, typename val = ... | [] | 1,016,608 | 1,016,609 | u268245868 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
int h[N];
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
int h[N];
for (... | [
"call.add",
"call.arguments.change"
] | 1,016,612 | 1,016,613 | u063020782 | cpp |
p03220 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,616 | 1,016,617 | u783676040 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
double N, T, A;
cin >> N >> T >> A;
double MIN = INF;
int ans;
for (int i =... | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
double N, T, A;
cin >> N >> T >> A;
double MIN = INF;
int ans;
for (int i =... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,016,618 | 1,016,619 | u864171425 | cpp |
p03220 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<double, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
signed main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
P x[n];
r(i, n) {
double h;
cin >> h;
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<double, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
signed main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
P x[n];
r(i, n) {
double h;
cin >> h;
... | [
"expression.operation.binary.add"
] | 1,016,626 | 1,016,627 | u777468981 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,630 | 1,016,631 | u016572066 | cpp |
p03220 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll INF = 1000000000;
const ll LINF = 4000000000000000010;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double h[1010];
int ans = INF;
int r... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll INF = 1000000000;
const ll LINF = 4000000000000000010;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double h[1010];
double ans = INF;
in... | [
"variable_declaration.type.primitive.change"
] | 1,016,636 | 1,016,637 | u924339359 | cpp |
p03220 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | [
"variable_declaration.type.primitive.change"
] | 1,016,638 | 1,016,639 | u010004797 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N + 1);
vector<int> B(M);
vector<int> C(M);
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
A[B[i]].push_back(C[i]);
}
for (int i = 0; i < N; i++)
sort(A[i].begin(), A[i].end());
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N + 1);
vector<int> B(M);
vector<int> C(M);
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
A[B[i]].push_back(C[i]);
}
for (int i = 0; i <= N; i++)
sort(A[i].begin(), A[i].end());
f... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,016,640 | 1,016,641 | u991713078 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N);
vector<int> B(M);
vector<int> C(M);
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
A[B[i]].push_back(C[i]);
}
for (int i = 0; i < N; i++)
sort(A[i].begin(), A[i].end());
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N + 1);
vector<int> B(M);
vector<int> C(M);
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
A[B[i]].push_back(C[i]);
}
for (int i = 0; i <= N; i++)
sort(A[i].begin(), A[i].end());
f... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,016,642 | 1,016,641 | u991713078 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, M;
cin >> N >> M;
vector<P> Y(M);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
Y[i] = P(a, b);
}
int cnt = 1;
vector<int>... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, M;
cin >> N >> M;
vector<P> Y(M);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
Y[i] = P(a, b);
}
int cnt = 1;
vector<int>... | [
"assignment.change"
] | 1,016,643 | 1,016,644 | u503221936 | cpp |
p03221 |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | [
"expression.operation.binary.add"
] | 1,016,645 | 1,016,646 | u889915625 | cpp |
p03221 |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | [
"expression.operation.binary.add"
] | 1,016,647 | 1,016,648 | u889915625 | cpp |
p03221 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,016,649 | 1,016,650 | u434874161 | cpp |
p03221 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct City {
City(int64_t i, int64_t p, int64_t y, int64_t n)
: id(i), p(p), year(y), no(n) {}
int64_t id;
int64_t p;
int64_t year;
int64_t no;
};
string Output(int64_t n) {
string ... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct City {
City(int64_t i, int64_t p, int64_t y, int64_t n)
: id(i), p(p), year(y), no(n) {}
int64_t id;
int64_t p;
int64_t year;
int64_t no;
};
string Output(int64_t n) {
string ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,016,653 | 1,016,654 | u762603420 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
struct City {
int idx;
int pref;
int year;
string id;
};
int main() {
int N, M;
cin >> N >> M;
unordered_map<int, vector<City>> city_map;
for ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
struct City {
int idx;
int pref;
int year;
string id;
};
int main() {
int N, M;
cin >> N >> M;
unordered_map<int, vector<City>> city_map;
for ... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,655 | 1,016,656 | u762603420 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(n);
vector<vector<int>> c(100000, vector<int>());
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
v[i] = make_pair(p, y);
c[p].push_ba... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(m);
vector<vector<int>> c(100000, vector<int>());
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
v[i] = make_pair(p, y);
c[p].push_ba... | [] | 1,016,659 | 1,016,660 | u936558609 | cpp |
p03221 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int inum(int N, int W) { return N / W; }
int jnum(int N, int W) {
if ((N / W) % 2)
return N % W;
else
return W - (N % W) - 1;
}
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int inum(int N, int W) { return N / W; }
int jnum(int N, int W) {
if ((N / W) % 2)
return N % W;
else
return W - (N % W) - 1;
}
... | [] | 1,016,665 | 1,016,666 | u563170985 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.