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 <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, k, n, m;
double x, y, s, z, d;
scanf("%d%lf%lf", &n, &x, &y);
s = 1000000000;
for (i = 1; i <= n; i++) {
scanf("%lf", &z);
d = x - z * 1000;
if (fabs(d - y) < s) {
s = fa... | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, k, n, m;
double x, y, s, z, d;
scanf("%d%lf%lf", &n, &x, &y);
s = 1000000000;
for (i = 1; i <= n; i++) {
scanf("%lf", &z);
d = x - z * 0.006;
if (fabs(d - y) < s) {
s = f... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,265 | 1,020,266 | u189237887 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, index;
double res = 0;
cin >> t >> a;
index = 0;
res = 1e9;
vector<int> vec(n, 0);
vector<double> ans(n, 0);
for (int i = 0; i < n; ++i)
cin >> vec[i];
for (int i = 0; i < n; ++i) {
ans[i] = (double)(t - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, index;
double res = 0;
cin >> t >> a;
index = 0;
res = 1e9;
vector<int> vec(n, 0);
vector<double> ans(n, 0);
for (int i = 0; i < n; ++i)
cin >> vec[i];
for (int i = 0; i < n; ++i) {
ans[i] = (double)(t - ... | [] | 1,020,267 | 1,020,268 | u088000503 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<pair<int, int>> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int temp = abs((t - x * 0.006) - a);
v[i] = {temp, i + 1};
}
sort(v.begin(), v.end(... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<pair<double, int>> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
double temp = abs((t - x * 0.006) - a);
v[i] = {temp, i + 1};
}
sort(v.beg... | [
"variable_declaration.type.primitive.change"
] | 1,020,275 | 1,020,276 | u629333789 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t, a;
int anss, maxs;
int sa[1000];
cin >> n;
cin >> t >> a;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
sa[i] = abs((t - h * 0.006) - a);
if (i == 0) {
anss = 1;
maxs = sa[i];
} else {
if (maxs > ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
double t, a;
double anss, maxs;
double sa[1000];
cin >> n;
cin >> t >> a;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
sa[i] = abs((t - h * 0.006) - a);
if (i == 0) {
anss = 1;
maxs = sa[i];
} else {
... | [
"variable_declaration.type.primitive.change"
] | 1,020,284 | 1,020,285 | u922602011 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
//入力
int N = 0;
int T = 0, A = 0;
vector<int> H;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int push;
cin >> push;
H.push_back(push);
}
//各地点の気温の計... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
//入力
int N = 0;
int T = 0, A = 0;
vector<int> H;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int push;
cin >> push;
H.push_back(push);
}
//各地点の気温の計... | [
"variable_declaration.type.primitive.change"
] | 1,020,292 | 1,020,293 | u396312740 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
//入力
int N = 0;
int T = 0, A = 0;
vector<int> H;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int push;
cin >> push;
H.push_back(push);
}
//各地点の気温の計... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
//入力
int N = 0;
int T = 0, A = 0;
vector<int> H;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int push;
cin >> push;
H.push_back(push);
}
//各地点の気温の計... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,020,294 | 1,020,293 | u396312740 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
float cal_h(int x) {}
int main() {
int n, t, a, h, index;
float result_old, result_new;
cin >> n >> t >> a;
result_old = 100000.000;
for (int i = 0; i < n; i++) {
cin >> h;
result_new = abs(t - (h * 0.006)... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
float cal_h(int x) {}
int main() {
int n, t, a, h, index;
float result_old, result_new;
cin >> n >> t >> a;
result_old = 100000.000;
for (int i = 0; i < n; i++) {
cin >> h;
result_new = abs(t - (h * 0.006)... | [
"assignment.change"
] | 1,020,295 | 1,020,296 | u693085374 | cpp |
p03220 | #include <bits/stdc++.h>
#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 = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | #include <bits/stdc++.h>
#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 = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | [
"variable_declaration.type.primitive.change"
] | 1,020,309 | 1,020,310 | u493750228 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, p;
int ans = 999999;
double a, b, x;
cin >> t;
cin >> a >> b;
for (int i = 1; i <= t; i++) {
cin >> x;
if (abs(a - x * 0.006 - b) <= ans) {
ans = abs(a - x * 0.006 - b);
p = i;
}
}
cout << p << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, p;
double ans = 999999;
double a, b, x;
cin >> t;
cin >> a >> b;
for (int i = 1; i <= t; i++) {
cin >> x;
if (abs(a - x * 0.006 - b) <= ans) {
ans = abs(a - x * 0.006 - b);
p = i;
}
}
cout << p << endl;
return 0;... | [
"variable_declaration.type.primitive.change"
] | 1,020,315 | 1,020,316 | u336976506 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef vector<int> ivec;
typedef vector<string> svec;
int N, ans;
double T, A, tmp = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> T >> A;
ivec H(N, 0), t(N, 0);
for (int i = 0; i < N; i++) {
cin >> H[i];
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef vector<int> ivec;
typedef vector<string> svec;
int N, ans;
double T, A, tmp = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> T >> A;
vector<double> H(N, 0), t(N, 0);
for (int i = 0; i < N; i++) {
cin >> H... | [
"variable_declaration.type.change"
] | 1,020,324 | 1,020,325 | u522548464 | cpp |
p03220 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, T, A;
scanf("%d %d %d", &n, &T, &A);
T *= 1000;
A *= 1000;
int res, ret = 1 << 29;
for (int i = 0; i < n; i++) {
int h;
scanf("%d", &h);
if (abs(T - 6 * h - A) < ret) {
ret = abs(A - T - 6 * h);
res = i... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, T, A;
scanf("%d %d %d", &n, &T, &A);
T *= 1000;
A *= 1000;
int res, ret = 1 << 29;
for (int i = 0; i < n; i++) {
int h;
scanf("%d", &h);
if (abs(T - 6 * h - A) < ret) {
ret = abs(T - 6 * h - A);
res = i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,020,326 | 1,020,327 | u092916776 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<int, double>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - abs(t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<double, int>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | [
"call.arguments.change"
] | 1,020,330 | 1,020,331 | u319491032 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<int, double>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<double, int>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | [] | 1,020,332 | 1,020,331 | u319491032 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<int, double>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - abs(t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<double, int>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | [
"call.arguments.change"
] | 1,020,330 | 1,020,333 | u319491032 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<int, double>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<pair<double, int>> temp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
temp[i].first = abs(a - (t - h[i] * 0.006));
temp[i].second = i + 1;
}
sort(temp.begin(), temp.end());
... | [] | 1,020,332 | 1,020,333 | u319491032 | cpp |
p03220 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,020,339 | 1,020,340 | u629650917 | cpp |
p03220 | #include <iostream>
#include <math.h>
int main(void) {
int n, t, a, h, r;
double m, j;
scanf("%d%d%d", &n, &t, &a);
scanf("%d", &h);
m = fabs((double)t - (double)h * 0.006);
r = 1;
for (int i = 0; i < n - 1; i++) {
scanf("%d", &h);
j = fabs((double)t - (double)h * 0.006);
if (m > j)
m =... | #include <iostream>
#include <math.h>
int main(void) {
int n, t, a, h, r;
double m, j;
scanf("%d%d%d", &n, &t, &a);
scanf("%d", &h);
m = fabs((double)t - (double)h * 0.006 - a);
r = 1;
for (int i = 0; i < n - 1; i++) {
scanf("%d", &h);
j = fabs((double)t - (double)h * 0.006 - a);
if (m > j)
... | [
"assignment.change"
] | 1,020,341 | 1,020,342 | u787420015 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
float min_e = -1, x;
int temp, index;
for (int i = 0; i < n; ++i) {
cin >> temp;
x = (float)temp * 0.006;
if (min_e == -1) {
index = i;
min_e = temp - x;
} else if (abs(a - (temp - x)) <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
float min_e = -1, x;
int temp, index;
for (int i = 0; i < n; ++i) {
cin >> temp;
x = (float)temp * 0.006;
if (min_e == -1) {
index = i;
min_e = t - x;
} else if (abs(a - (t - x)) < abs(a... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,020,355 | 1,020,356 | u740533055 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, s, ans, cnt;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
s = T - A;
ans = 300;
for (int i = 0; i < N; i++) {
if (ans > abs(s - H[i] * 0.006)) {
ans = abs(s - H[i] * 0.006);
cnt ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, s, cnt;
double ans;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
s = T - A;
ans = 300;
for (int i = 0; i < N; i++) {
if (ans > abs(s - H[i] * 0.006)) {
ans = abs(s - H[i] * 0.006);
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,020,357 | 1,020,358 | u232457205 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t, a;
int ans;
cin >> n;
vector<int> x(n, 0);
pair<int, int> temp[n];
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> x[i];
temp[i].first = abs((t - x[i] * 0.006) - a);
temp[i].second = i + 1;
}
sort(temp, temp ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t, a;
int ans;
cin >> n;
vector<int> x(n, 0);
pair<double, int> temp[n];
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> x[i];
temp[i].first = abs((t - x[i] * 0.006) - a);
temp[i].second = i + 1;
}
sort(temp, te... | [
"variable_declaration.type.primitive.change"
] | 1,020,359 | 1,020,360 | u484962958 | cpp |
p03220 | #include <algorithm>
#include <chrono>
#include <iostream>
#include <math.h>
#include <string>
#include <typeinfo>
#include <vector>
//絶対値の取得
#include <cstdlib>
using namespace ::std;
int main() {
//試行回数Nを取得
int n;
cin >> n;
//補正温度Tと目標温度Aを取得
int t, a;
cin >> t >> a;
// N回分ループして、H1からHnまでを取得する
int h,... | #include <algorithm>
#include <chrono>
#include <iostream>
#include <math.h>
#include <string>
#include <typeinfo>
#include <vector>
//絶対値の取得
#include <cmath>
using namespace ::std;
int main() {
//試行回数Nを取得
int n;
cin >> n;
//補正温度Tと目標温度Aを取得
int t, a;
cin >> t >> a;
// N回分ループして、H1からHnまでを取得する
int h, i... | [
"variable_declaration.type.primitive.change"
] | 1,020,366 | 1,020,367 | u358787963 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using n... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using n... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 1,020,368 | 1,020,369 | u719183609 | cpp |
p03220 | #include <iostream>
using namespace std;
double n, t, a;
double h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
int ans = 1 << 29, t;
for (int i = 0; i < n; i++) {
if (h[i] < ans)... | #include <iostream>
using namespace std;
double n, t, a;
double h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
double ans = 100000, t;
for (int i = 0; i < n; i++) {
if (h[i] < an... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,020,370 | 1,020,371 | u819123139 | cpp |
p03220 | #include <iostream>
using namespace std;
int n, t, a;
int h[1050];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
long long ans = 1000000000000000, t;
for (int i = 0; i < n; i++) {
if (h[... | #include <iostream>
using namespace std;
double n, t, a;
double h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
double ans = 100000, t;
for (int i = 0; i < n; i++) {
if (h[i] < an... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.narrow.change",
"variable_declaration.value.change"
] | 1,020,372 | 1,020,371 | u819123139 | cpp |
p03220 | #include <iostream>
using namespace std;
int n, t, a;
long long h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
long long ans = 1000000000000000, t;
for (int i = 0; i < n; i++) {
... | #include <iostream>
using namespace std;
double n, t, a;
double h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
double ans = 100000, t;
for (int i = 0; i < n; i++) {
if (h[i] < an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,373 | 1,020,371 | u819123139 | cpp |
p03220 | #include <iostream>
using namespace std;
int n, t, a;
int h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
int ans = 1000000, t;
for (int i = 0; i < n; i++) {
if (h[i] < ans) {
... | #include <iostream>
using namespace std;
double n, t, a;
double h[1010];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - (h[i] * 0.006);
h[i] -= a;
if (h[i] < 0)
h[i] *= -1;
}
double ans = 100000, t;
for (int i = 0; i < n; i++) {
if (h[i] < an... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,374 | 1,020,371 | u819123139 | cpp |
p03220 | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int N = 0;
int T = 0;
int A = 0;
std::vector<int> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
double current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double min_temp_sub ... | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int N = 0;
int T = 0;
int A = 0;
std::vector<int> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
double current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double min_temp_sub ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,020,379 | 1,020,380 | u725109307 | cpp |
p03220 | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int N = 0;
int T = 0;
int A = 0;
std::vector<int> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
double current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double min_temp_sub ... | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int N = 0;
int T = 0;
int A = 0;
std::vector<int> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
double current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double min_temp_sub ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,020,379 | 1,020,381 | u725109307 | cpp |
p03220 | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int N = 0;
int T = 0;
int A = 0;
std::vector<int> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
int current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double min_temp_sub = I... | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
double N = 0;
double T = 0;
double A = 0;
std::vector<double> heights;
std::cin >> N;
std::cin >> T;
std::cin >> A;
double current_h;
for (int i = 0; i < N; i++) {
std::cin >> current_h;
heights.push_back(current_h);
}
double m... | [
"variable_declaration.type.primitive.change"
] | 1,020,382 | 1,020,383 | u725109307 | cpp |
p03220 | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
float t, a, h, b;
int n, ans = 1;
scanf("%d", &n);
scanf("%f %f", &t, &a);
scanf("%f", &h);
b = t - 0.006 * h;
for (int i = 2; i <= n; i++) {
scanf("%f", &h);
if (fabs(a - b) > fabs(a - t - 0.006 * h)) {
ans = i;
b = ... | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
float t, a, h, b;
int n, ans = 1;
scanf("%d", &n);
scanf("%f %f", &t, &a);
scanf("%f", &h);
b = t - 0.006 * h;
for (int i = 2; i <= n; i++) {
scanf("%f", &h);
if (fabs(a - b) > fabs(a - (t - 0.006 * h))) {
ans = i;
b ... | [
"control_flow.branch.if.condition.change"
] | 1,020,384 | 1,020,385 | u855429581 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, n, d;
int Min = 999999999;
int book = 1;
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i <= n; i++) {
scanf("%d", &d);
int temp = x - d * 0.006;
temp = abs(y - temp);
if (temp < Min) {
Min = temp;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, n, d;
double Min = 999999999;
int book = 1;
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i <= n; i++) {
scanf("%d", &d);
double temp = x - d * 0.006;
temp = fabs(y - temp);
if (temp < Min) {
Min =... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,020,387 | 1,020,388 | u566185387 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // number of point
int t; // base of temperature
double a; // target of temperature
cin >> n;
cin >> t >> a;
vector<long> pink;
// long data[n]; //elevations
long red;
for (int i... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // number of point
int t; // base of temperature
double a; // target of temperature
cin >> n;
cin >> t >> a;
vector<long> pink;
// long data[n]; //elevations
long red;
for (int i... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,020,392 | 1,020,393 | u951141003 | cpp |
p03220 | #include <cstdio>
using namespace std;
#define R register
int n;
int t, a;
inline int Abs(R double x) { return x > 0 ? x : -x; }
inline void read(R int &x) {
x = 0;
R char ch = getchar();
R bool f = false;
for (; ch < 48 || ch > 57; ch = getchar())
f |= (ch == '-');
for (; ch > 47 && ch < 58; ch = getchar... | #include <cstdio>
using namespace std;
#define R register
int n;
int t, a;
inline double Abs(R double x) { return x > 0 ? x : -x; }
inline void read(R int &x) {
x = 0;
R char ch = getchar();
R bool f = false;
for (; ch < 48 || ch > 57; ch = getchar())
f |= (ch == '-');
for (; ch > 47 && ch < 58; ch = getc... | [
"function.return_type.change",
"variable_declaration.name.change",
"variable_declaration.add"
] | 1,020,400 | 1,020,401 | u658727305 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
const int maxn = 100005;
int n, a, t;
int h[maxn];
int main() {
int pos, ans = 10000000;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
if (abs(t * ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
const int maxn = 100005;
int n, a, t;
int h[maxn];
int main() {
int pos;
double ans = 10000000.0;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,406 | 1,020,407 | u018791246 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define pb push_back
#define INF 999999999
#define MOD 1000000007
#define sp ' '
// typedef
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define pb push_back
#define INF 999999999
#define MOD 1000000007
#define sp ' '
// typedef
typedef long long ll;
... | [
"variable_declaration.type.primitive.change"
] | 1,020,417 | 1,020,418 | u306142032 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a, h;
int main() {
cin >> n >> t >> a;
int min = 10000000;
int ans;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(a - t + h * 0.006) < min) {
min = abs(a - t + h * 0.006);
ans = i + 1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, t, a, h;
int main() {
cin >> n >> t >> a;
double min = 10000000;
int ans;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(a - t + h * 0.006) < min) {
min = abs(a - t + h * 0.006);
ans = i + 1;
}
}
cout << ans << endl;
return 0;... | [
"variable_declaration.type.primitive.change"
] | 1,020,419 | 1,020,420 | u774622463 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N, T, A;
int H[1010];
cin >> N >> T >> A;
double ans = 1e18;
for (int i = 0; i < N; ++i) {
cin >> H[i];
ans = min(ans, A - (T - H[i] * 0.006));
}
for (int i = 0; i < N; ++i) {
if (ans == A - ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N, T, A;
int H[1010];
cin >> N >> T >> A;
double ans = 1e18;
for (int i = 0; i < N; ++i) {
cin >> H[i];
ans = min(ans, abs(A - (T - H[i] * 0.006)));
}
for (int i = 0; i < N; ++i) {
if (ans ==... | [
"call.add",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,020,423 | 1,020,424 | u043125923 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int val = 1e9;
int ans;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
int x = t - h * 0.006;
if (abs(a - x) < val) {
val = abs(a - x);
ans = i;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
double val = 1e9;
int ans;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
double x = t - h * 0.006;
if (fabs(a - x) < val) {
val = fabs(a - x);
ans = i;
}
}
cout << a... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,020,425 | 1,020,426 | u275726913 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,427 | 1,020,428 | u711985352 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,020,429 | 1,020,430 | u943004959 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, ... | [
"variable_declaration.type.primitive.change"
] | 1,020,431 | 1,020,432 | u943004959 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | [
"literal.number.change",
"call.arguments.change"
] | 1,020,436 | 1,020,437 | u259396003 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, s, mn = 1000000009;
int ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
x = (t - (x * 0.006));
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, s, mn = 1000000009;
int ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
double x;
cin >> x;
x = (t - (x * 0.006));
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}... | [
"variable_declaration.type.primitive.change"
] | 1,020,442 | 1,020,443 | u624773401 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, s, mn = 1000000009, ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
x = (t - round(x * 0.006));
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, s, mn = 1000000009;
int ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
double x;
cin >> x;
x = (t - (x * 0.006));
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}... | [
"variable_declaration.type.primitive.change"
] | 1,020,444 | 1,020,443 | u624773401 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, s, mn = 1000000009, ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
x = t - (x * 0.006);
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, s, mn = 1000000009;
int ans;
cin >> n >> t >> s;
for (int i = 1; i <= n; i++) {
double x;
cin >> x;
x = (t - (x * 0.006));
x = abs(x - s);
if (x < mn) {
mn = x;
ans = i;
}
}
cout << ans;
return 0;
}... | [
"variable_declaration.type.primitive.change"
] | 1,020,445 | 1,020,443 | u624773401 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
double pre[1005];
int main() {
int T;
int t, xx;
scanf("%d", &T);
scanf("%d%d", &t, &xx);
for (int i = 0; i < T; i++) {
scanf("%lf", &pre[i]);
pre[i] = t - (pre[i] * 0.006);
}
int flag = 0;
int ans = 0x3f3f3f3f;
for (int i = 0; i < T; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
double pre[1005];
int main() {
int T;
int t, xx;
scanf("%d", &T);
scanf("%d%d", &t, &xx);
for (int i = 0; i < T; i++) {
scanf("%lf", &pre[i]);
pre[i] = t - (pre[i] * 0.006);
}
int flag = 0;
double ans = 0x3f3f3f3f * 1.0;
for (int i = 0; i < T; i++... | [
"variable_declaration.type.primitive.change"
] | 1,020,446 | 1,020,447 | u587292349 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#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.at(i);
}
int ans = 0, d = 100000;
for (int i ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#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.at(i);
}
int ans = 0;
double d = 100000000;
... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,020,448 | 1,020,449 | u618649215 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int temp[n];
double res = 0, res_tmp, res_min = 1000000;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
double temp[n];
double res = 0, res_tmp, res_min = 1000000;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<end... | [
"variable_declaration.type.primitive.change"
] | 1,020,450 | 1,020,451 | u876784108 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int temp[n];
int res = 0, res_tmp, res_min = 1000000;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
double temp[n];
double res = 0, res_tmp, res_min = 1000000;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<end... | [
"variable_declaration.type.primitive.change"
] | 1,020,452 | 1,020,451 | u876784108 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int temp[n];
int res = 0, res_tmp = 1000000, res_min;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
double temp[n];
double res = 0, res_tmp, res_min = 1000000;
for (int i = 0; i < n; i++) {
temp[i] = t - (h[i] * 0.006);
// cout<<temp[i]<<end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,020,453 | 1,020,451 | u876784108 | cpp |
p03220 | #include <bits/stdc++.h>
#include <map>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int n, t, a;
cin >> n >> t >> a;
int arr[n];
for (int i = 0; i < n; i++) {
double p;
cin >> p;
p = t - (p * 0.006);
// cout<<p<<endl;
arr[i] = p... | #include <bits/stdc++.h>
#include <map>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int n, t, a;
cin >> n >> t >> a;
double arr[n];
for (int i = 0; i < n; i++) {
double p;
cin >> p;
p = t - (p * 0.006);
// cout<<p<<endl;
arr[i] ... | [
"variable_declaration.type.primitive.change"
] | 1,020,456 | 1,020,457 | u217859995 | cpp |
p03220 | #include <bits/stdc++.h>
#include <map>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int n, t, a;
cin >> n >> t >> a;
int arr[n];
for (int i = 0; i < n; i++) {
int p;
cin >> p;
p = t - (p * 0.006);
// cout<<p<<endl;
arr[i] = p;
... | #include <bits/stdc++.h>
#include <map>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int n, t, a;
cin >> n >> t >> a;
double arr[n];
for (int i = 0; i < n; i++) {
double p;
cin >> p;
p = t - (p * 0.006);
// cout<<p<<endl;
arr[i] ... | [
"variable_declaration.type.primitive.change"
] | 1,020,458 | 1,020,457 | u217859995 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,020,459 | 1,020,460 | u373958718 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,461 | 1,020,460 | u373958718 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,462 | 1,020,460 | u373958718 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int h[1010];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
double min = 100000;
for (int i = 0; i < N; ++i) {
double x = abs(double... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int h[1010];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
double min = 100000;
for (int i = 0; i < N; ++i) {
double x = abs(A - (T... | [
"call.arguments.change",
"assignment.change"
] | 1,020,463 | 1,020,464 | u102131583 | cpp |
p03220 | #include <stdio.h>
int main() {
const int INT_MAX = 2147483647;
int n, ansnum = 1;
double t, a, ans = INT_MAX;
double h[1000];
scanf("%d%d%d", &n, &t, &a);
for (int i = 0; i <= n - 1; i++) {
scanf("%lf", &h[i]);
h[i] = t - h[i] * 0.006 - a;
if (h[i] < 0) {
h[i] = -h[i];
}
if (h[i] ... | #include <stdio.h>
int main() {
const int INT_MAX = 2147483647;
int n, ansnum = 1;
double t, a, ans = INT_MAX;
double h[1000];
scanf("%d%lf%lf", &n, &t, &a);
for (int i = 0; i <= n - 1; i++) {
scanf("%lf", &h[i]);
h[i] = t - h[i] * 0.006 - a;
if (h[i] < 0) {
h[i] = -h[i];
}
if (h[i... | [
"literal.string.change",
"call.arguments.change"
] | 1,020,471 | 1,020,472 | u381714561 | cpp |
p03220 | #include <stdio.h>
int main() {
const int INT_MAX = 2147483647;
int n, ansnum = 1;
double t, a, ans = INT_MAX;
double h[1000];
scanf("%d%d%d", &n, &t, &a);
for (int i = 0; i <= n - 1; i++) {
scanf("%lf", &h[i]);
h[i] = t - h[i] * 6 - a;
if (h[i] < 0) {
h[i] = -h[i];
}
if (h[i] < an... | #include <stdio.h>
int main() {
const int INT_MAX = 2147483647;
int n, ansnum = 1;
double t, a, ans = INT_MAX;
double h[1000];
scanf("%d%lf%lf", &n, &t, &a);
for (int i = 0; i <= n - 1; i++) {
scanf("%lf", &h[i]);
h[i] = t - h[i] * 0.006 - a;
if (h[i] < 0) {
h[i] = -h[i];
}
if (h[i... | [
"literal.string.change",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,473 | 1,020,472 | u381714561 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
double A;
int bestp = -1;
int bestt = 4000000;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
// cin >> Hs[i];
int s;
cin >> s;
if (bestt >... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
double A;
int bestp = -1;
double bestt = 4000000;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
// cin >> Hs[i];
int s;
cin >> s;
if (best... | [
"variable_declaration.type.primitive.change"
] | 1,020,476 | 1,020,477 | u791411211 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
double A;
int bestp = -1;
int bestt = 40000;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
// cin >> Hs[i];
int s;
cin >> s;
if (bestt >= ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
double A;
int bestp = -1;
double bestt = 4000000;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
// cin >> Hs[i];
int s;
cin >> s;
if (best... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,020,478 | 1,020,477 | u791411211 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e+8
int main() {
int n, a;
double t, h, dst = INF;
int ans = -1;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h;
if (dst < abs(a - (t - h * 0.006))) {
ans = i;
dst = abs(a - (t - h * 0.006));
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e+8
int main() {
int n, a;
double t, h, dst = INF;
int ans = -1;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h;
if (dst > abs(a - (t - h * 0.006))) {
ans = i;
dst = abs(a - (t - h * 0.006));
}
}
cout << ans <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,479 | 1,020,480 | u798086274 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,481 | 1,020,482 | u300752229 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll ans = 200000000;
ll h;
ll index = 0;
for (ll i = 0; i < n; i++) {
cin >> h;
int temp = 1000 * t - 6 * h;
if (ans > abs(1000 * a - temp)) {
index = i;
ans = abs(a - te... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll ans = 200000000;
ll h;
ll index = 0;
for (ll i = 0; i < n; i++) {
cin >> h;
int temp = 1000 * t - 6 * h;
if (ans > abs(1000 * a - temp)) {
index = i;
ans = abs(1000 *... | [
"assignment.change"
] | 1,020,483 | 1,020,484 | u906651641 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll ans = 200000000;
ll h;
ll index = 0;
for (ll i = 0; i < n; i++) {
cin >> h;
int temp = 1000 * t - 6 * h;
if (ans > abs(a - temp)) {
index = i;
ans = abs(a - temp);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll ans = 200000000;
ll h;
ll index = 0;
for (ll i = 0; i < n; i++) {
cin >> h;
int temp = 1000 * t - 6 * h;
if (ans > abs(1000 * a - temp)) {
index = i;
ans = abs(1000 *... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,020,485 | 1,020,484 | u906651641 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,020,486 | 1,020,487 | u789417951 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,020,488 | 1,020,487 | u789417951 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int arr[n], ind = 0, minm = 1e9 + 7;
a *= 1000;
for (int i = 0; i < n; i++) {
cin >> arr[i];
int curr = 1000 * t - 6 * arr[i];
if (abs(curr - a) < minm) {
minm = arr[i];
ind = i;
}
// ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int arr[n], ind = 0, minm = 1e9 + 7;
a *= 1000;
for (int i = 0; i < n; i++) {
cin >> arr[i];
int curr = 1000 * t - 6 * arr[i];
if (abs(curr - a) < minm) {
minm = abs(curr - a);
ind = i;
}
... | [
"call.arguments.add"
] | 1,020,489 | 1,020,490 | u788544244 | cpp |
p03220 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
int main(void) {
double N, T, A, ans = 0, tmp1, tmp2;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
int main(void) {
double N, T, A, ans = 0, tmp1, tmp2;
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,491 | 1,020,492 | u833064541 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int top = 1000000;
int flag = 0;
double h[1002];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double th = t - h[i] * 0.006;
double sa = abs(a - th);
if (top > (sa)) {
top =... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
double top = 1000000;
int flag = 0;
double h[1002];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double th = t - h[i] * 0.006;
double sa = abs(a - th);
if (top > (sa)) {
to... | [
"variable_declaration.type.primitive.change"
] | 1,020,493 | 1,020,494 | u388485543 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int top = 1000000;
int flag = 0;
double h[1002];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double th = t - h[i] * 0.006;
double sa = abs(a - th);
if (top > (sa)) {
top =... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
double top = 1000000;
int flag = 0;
double h[1002];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double th = t - h[i] * 0.006;
double sa = abs(a - th);
if (top > (sa)) {
to... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change"
] | 1,020,495 | 1,020,494 | u388485543 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t, a;
cin >> n;
cin >> t >> a;
vector<int> d(n);
int htmp;
for (int i = 0; i < n; i++) {
cin >> htmp;
htmp = t - htmp * 0.006;
d.at(i) = abs(a - htmp);
}
int palace = distance(d.begin(), min_element(d.begin(), d.end()))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
vector<double> d(n);
double htmp;
for (int i = 0; i < n; i++) {
cin >> htmp;
htmp = t - htmp * 0.006;
d.at(i) = abs(a - htmp);
}
int palace = distance(d.begin(), min_element(d.begin(), ... | [
"variable_declaration.type.primitive.change"
] | 1,020,496 | 1,020,497 | u377901725 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double y = 100000;
int index = -1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i] = t - x * 0.006;
if (abs(h[i] - a) < y) {
y = abs(h[i] - 1);
index = i;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double y = 100000;
int index = -1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i] = t - x * 0.006;
if (abs(h[i] - a) < y) {
y = abs(h[i] - a);
index = i;
}
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,020,498 | 1,020,499 | u434662823 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, t, a;
std::cin >> n;
std::cin >> t >> a;
std::vector<long long> h(n);
std::vector<double> r;
for (int i = 0; i < n; i++) {
std::cin ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, t, a;
std::cin >> n;
std::cin >> t >> a;
std::vector<long long> h(n);
std::vector<double> r;
for (int i = 0; i < n; i++) {
std::cin ... | [] | 1,020,503 | 1,020,504 | u295961023 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - (t - z * 0.006);
if (fabs(z) <= fabs(y)) {
ans = i +... | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) <= fabs(y)) {
ans = i + 1... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,505 | 1,020,506 | u483156389 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) <= fabs(y)) {
ans = i + 1... | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) <= fabs(y)) {
ans = i + 1... | [] | 1,020,507 | 1,020,506 | u483156389 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) < fabs(y)) {
ans = i + 1;... | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) <= fabs(y)) {
ans = i + 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,508 | 1,020,506 | u483156389 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = t - z * 0.006;
if (fabs(z) < fabs(y)) {
ans = i + 1;
... | #include <iostream>
#include <math.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int N;
int ans = 0;
float t, a;
cin >> N >> t >> a;
float y = 999999;
for (int i = 0; i < N; i++) {
float z = 0;
cin >> z;
z = a - t + z * 0.006;
if (fabs(z) <= fabs(y)) {
ans = i + 1... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,510 | 1,020,506 | u483156389 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n, t, a, i, j;
double k, b;
cin >> n;
cin >> t >> a;
long h[n];
for (i = 0; i < n; i++)
cin >> h[i];
b = 114514.0;
for (i = 0; i < n; i++) {
k = abs((double)(a - t) + 0.006 * (double)(h[i]));
if (k < b) {
b = ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n, t, a, i, j;
double k, b;
cin >> n;
cin >> t >> a;
long h[n];
for (i = 0; i < n; i++)
cin >> h[i];
b = 114514.0;
j = 0;
for (i = 0; i < n; i++) {
k = abs((double)(a - t) + 0.006 * (double)(h[i]));
if (k < b) {
... | [
"assignment.add"
] | 1,020,518 | 1,020,519 | u809278162 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H;
double h;
for (int i = 0; i < N; i++) {
cin >> h;
H.push_back(T - h * 0.006);
}
double ret = abs(H[0] - A), temp = 0;
int index = 0;
for (int ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H;
double h;
for (int i = 0; i < N; i++) {
cin >> h;
H.push_back(T - h * 0.006);
}
double ret = abs(H[0] - A), temp = 0;
int index = 0;
for (int ... | [] | 1,020,521 | 1,020,522 | u585586208 | cpp |
p03228 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i == 0)
a = a / 2, b += a;
else
... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0)
a = a / 2, b += a;
e... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,020,530 | 1,020,531 | u921940646 | cpp |
p03228 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | [
"expression.operation.binary.remove"
] | 1,020,534 | 1,020,535 | u468700753 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= k; i++) {
if (i % 2 == 1) {
if (a % 2 == 0) {
a = a / 2;
b += a;
} else {
a = (a - 1) / 2;
b += a;
}
} else {
if (b % 2 == 0) {
b = ... | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= k; i++) {
if (i % 2 == 1) {
if (a % 2 == 0) {
a = a / 2;
b += a;
} else {
a = (a - 1) / 2;
b += a;
}
} else {
if (b % 2 == 0) {
b = ... | [
"io.output.change"
] | 1,020,538 | 1,020,539 | u451538287 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int A, B, K;
signed main() {
cin >> A >> B >> K;
bool a = true;
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int A, B, K;
signed main() {
cin >> A >> B >> K;
bool a = true;
f... | [
"assignment.add"
] | 1,020,540 | 1,020,541 | u450832845 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"expression.operation.binary.add"
] | 1,020,542 | 1,020,543 | u452725238 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= k; i++) {
if (i % 2) {
if (a % 2)
a--;
else
b += a / 2, a /= 2;
} else {
if (b % 2)
b--;
else
a += b / 2, b /= 2;
}
}
cout << a <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= k; i++) {
if (i % 2) {
if (a % 2)
a--;
b += a / 2, a /= 2;
} else {
if (b % 2)
b--;
a += b / 2, b /= 2;
}
}
cout << a << " " << b << endl;
retu... | [
"control_flow.branch.else.remove"
] | 1,020,544 | 1,020,545 | u006686215 | cpp |
p03228 | #include <stdio.h>
#include <string.h>
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
for (int i = 1; i <= k; i++) {
if (i == 1 || i % 2 != 0) {
if (a % 2 == 0) {
b += a / 2;
a = a / 2;
} else {
b += (a - 1) / 2;
a = (a - 1) / 2;
}
} else {
... | #include <stdio.h>
#include <string.h>
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
for (int i = 1; i <= k; i++) {
if (i == 1 || i % 2 != 0) {
if (a % 2 == 0) {
b += a / 2;
a = a / 2;
} else {
b += (a - 1) / 2;
a = (a - 1) / 2;
}
} else {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,020,560 | 1,020,561 | u011738321 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
for (int i = 1; i <= z; i++) {
if (i % 2 != 0) {
if (x % 2 != 0) {
x = x - 1;
} else
x = x;
x = x / 2;
y = y + x;
} else {
if (y % 2 != 0)
y = y - 1;
else
... | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
for (int i = 1; i <= z; i++) {
if (i % 2 != 0) {
if (x % 2 != 0) {
x = x - 1;
} else
x = x;
x = x / 2;
y = y + x;
} else {
if (y % 2 != 0)
y = y - 1;
else
... | [
"io.output.change"
] | 1,020,562 | 1,020,563 | u191117799 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long read() {
long long x, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
x = c ^ '0';
c = getchar();
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + (c ^ '0')... | #include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long read() {
long long x, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
x = c ^ '0';
c = getchar();
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + (c ^ '0')... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,564 | 1,020,565 | u001883555 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 0) {
A /= 2;
B += A;
} else {
A--;
A /= 2;
B += A;
}
} else {
if (B % 2 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 0) {
A /= 2;
B += A;
} else {
A--;
A /= 2;
B += A;
}
} else {
if (B % 2 == 0) {
... | [
"io.output.change"
] | 1,020,568 | 1,020,569 | u735953714 | cpp |
p03228 | #include <iostream>
using namespace std;
main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 1; i <= k; i++) {
if (i % 2 == 1) {
if (a % 2 == 1)
a -= 1;
a /= 2;
b += a;
} else {
if (b % 2 == 0)
b -= 1;
b /= 2;
a += b;
}
}
cout << a << " " << b... | #include <iostream>
using namespace std;
main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 1; i <= k; i++) {
if (i % 2 == 1) {
if (a % 2 == 1)
a -= 1;
a /= 2;
b += a;
} else {
if (b % 2 == 1)
b -= 1;
b /= 2;
a += b;
}
}
cout << a << " " << b... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,572 | 1,020,573 | u160321725 | cpp |
p03228 | #include <iostream>
using namespace std;
main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 1; i <= k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1)
a -= 1;
a /= 2;
b += a;
} else {
if (b % 2 == 1)
b -= 1;
b /= 2;
a += b;
}
}
cout << a << " " << b... | #include <iostream>
using namespace std;
main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 1; i <= k; i++) {
if (i % 2 == 1) {
if (a % 2 == 1)
a -= 1;
a /= 2;
b += a;
} else {
if (b % 2 == 1)
b -= 1;
b /= 2;
a += b;
}
}
cout << a << " " << b... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,574 | 1,020,573 | u160321725 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K;) {
if (i % 2 == 0) {
if (A % 2 == 1) {
A -= 1;
} else if (A % 2 == 0) {
A /= 2;
B += A;
i++;
}
} else {
if (B % 2 == 1) {
B -= 1;
... | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K;) {
if (i % 2 == 0) {
if (A % 2 == 1) {
A -= 1;
} else if (A % 2 == 0) {
A /= 2;
B += A;
i++;
}
} else {
if (B % 2 == 1) {
B -= 1;
... | [
"io.output.change"
] | 1,020,575 | 1,020,576 | u240031669 | cpp |
p03228 | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,020,579 | 1,020,580 | u753615145 | cpp |
p03228 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int A, B, K;
// iが偶数なら高橋のターン
cin >> A;
cin >> B;
cin >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) { //奇数なら
if (A % 2 == 1) {
A -= 1;
}
} else if (i % 2 == 1) {
if (B % 2 == 1) {
... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int A, B, K;
// iが偶数なら高橋のターン
cin >> A;
cin >> B;
cin >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) { //奇数なら
if (A % 2 == 1) {
A -= 1;
}
} else if (i % 2 == 1) {
if (B % 2 == 1) {
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,020,591 | 1,020,592 | u133142920 | cpp |
p03228 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int A, B, K;
// iが偶数なら高橋のターン
cin >> A;
cin >> B;
cin >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) { //奇数なら
if (A % 2 == 1) {
A -= 1;
} else if (i % 2 == 1) {
if (B % 2 == 1) {
... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int A, B, K;
// iが偶数なら高橋のターン
cin >> A;
cin >> B;
cin >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) { //奇数なら
if (A % 2 == 1) {
A -= 1;
}
} else if (i % 2 == 1) {
if (B % 2 == 1) {
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,020,593 | 1,020,592 | u133142920 | cpp |
p03228 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1) {
a--;
}
a /= 2;
b += a / 2;
} else {
if (b % 2 == 1) {
b--;
}
b /= 2;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1) {
a--;
}
a /= 2;
b += a;
} else {
if (b % 2 == 1) {
b--;
}
b /= 2;
a +=... | [
"expression.operation.binary.remove"
] | 1,020,594 | 1,020,595 | u018434698 | cpp |
p03228 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 0) {
b = b + a / 2;
a = a / 2;
} else {
b = b + (a - 1) / 2;
... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 0) {
b = b + a / 2;
a = a / 2;
} else {
b = b + (a - 1) / 2;
... | [
"literal.string.change",
"io.output.change"
] | 1,020,596 | 1,020,597 | u763420281 | cpp |
p03228 | #include <iostream>
int main() {
int a, b, k, n, m;
std::cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1) {
a--;
}
a = a / 2;
b = b + a;
// std::cout << a << b << std::endl;
} else {
if (b % 2 == 1) {
b--;
}
... | #include <iostream>
int main() {
int a, b, k, n, m;
std::cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1) {
a--;
}
a = a / 2;
b = b + a;
// std::cout << a << b << std::endl;
} else {
if (b % 2 == 1) {
b--;
}
... | [
"expression.operation.binary.add"
] | 1,020,606 | 1,020,607 | u210398438 | cpp |
p03228 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
long A, B, K;
scanf("%ld%ld%ld", &A, &B, &K);
long AK, BK;
long ansA, ansB;
AK = int(K / 2) + 1;
BK = int(K / 2);
for (int i = 0; i < BK; i++) {
if (A % 2 != 0)
A = A - 1;
A /= 2;
B += A;
if (B % 2 != 0)
B... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
long A, B, K;
scanf("%ld%ld%ld", &A, &B, &K);
long AK, BK;
long ansA, ansB;
AK = int(K / 2) + 1;
BK = int(K / 2);
for (int i = 0; i < BK; i++) {
if (A % 2 != 0)
A = A - 1;
A /= 2;
B += A;
if (B % 2 != 0)
B... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,020,616 | 1,020,617 | u912533549 | cpp |
p03226 | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 300000 + 10;
const int MOD = 998244353;
const int LOG = 20;
const int INF = 1000000010;
const ... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 300000 + 10;
const int MOD = 998244353;
const int LOG = 20;
const int INF = 1000000010;
const ... | [
"call.add",
"call.arguments.change"
] | 1,020,637 | 1,020,638 | u349705898 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.