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 <cmath>
#include <iostream>
using namespace std;
double mini = 1000;
int n, t, a, ans;
int h[1009];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double v = t - h[i] * 0.006;
int s = abs(v - a);
if (s < mini) {
mini = s;
ans = i + 1;
}
}
cou... | #include <cmath>
#include <iostream>
using namespace std;
double mini = 1000;
int n, t, a, ans;
int h[1009];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double v = t - h[i] * 0.006;
double s = abs(v - a);
if (s < mini) {
mini = s;
ans = i + 1;
}
}
... | [
"variable_declaration.type.primitive.change"
] | 1,015,626 | 1,015,627 | u843139357 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
double mini = 1000;
int n, t, a, ans;
int h[1009];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
int v = t - h[i] * 0.006;
int s = abs(v - a);
if (s < mini) {
mini = s;
ans = i + 1;
}
}
cout <... | #include <cmath>
#include <iostream>
using namespace std;
double mini = 1000;
int n, t, a, ans;
int h[1009];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
double v = t - h[i] * 0.006;
double s = abs(v - a);
if (s < mini) {
mini = s;
ans = i + 1;
}
}
... | [
"variable_declaration.type.primitive.change"
] | 1,015,628 | 1,015,627 | u843139357 | cpp |
p03220 | #include <bits/stdc++.h>
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 = 1;
double min = 0;
double ave = 0;
for (int i = 0; i < H.size(); i++) {
min = a - (t - (H.at(i) * 0.006));
if (i == 0) {
... | #include <bits/stdc++.h>
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 = 1;
double min = 0;
double ave = 0;
for (int i = 0; i < H.size(); i++) {
min = a - (t - (H.at(i) * 0.006));
if (i == 0) {
... | [
"call.add",
"call.arguments.change"
] | 1,015,629 | 1,015,630 | u536015544 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N;
double T, A;
double tmp[1005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> T >> A;
double MIN = 1e10;
int ans;
for (int i = 0; i < N; i++) {
double h;
cin >> h;
doubl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N;
double T, A;
double tmp[1005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> T >> A;
double MIN = 1e10;
int ans;
for (int i = 0; i < N; i++) {
double h;
cin >> h;
doubl... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,631 | 1,015,632 | u140450365 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO co... | [
"variable_declaration.type.primitive.change"
] | 1,015,637 | 1,015,638 | u192442087 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, ans, min, dif;
cin >> N >> T >> A;
vector<int> H(N);
min = 100000;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
dif = abs((T - 0.006 * H.at(i)) - A);
if (dif < min) {
min = dif;
ans = i + 1;
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A, ans, min, dif;
cin >> N >> T >> A;
vector<double> H(N);
min = 100000;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
dif = abs((T - 0.006 * H.at(i)) - A);
if (dif < min) {
min = dif;
ans = i + 1;
}
}
co... | [
"variable_declaration.type.primitive.change"
] | 1,015,641 | 1,015,642 | u916256067 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0, diff = 100000000;
for (int i = 0; i < n; i++) {
int tmp = 1000 * t - h[i] * 6;
if (abs(1000 * a - tmp) < diff) {
diff = abs(1... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0, diff = 1000000000;
for (int i = 0; i < n; i++) {
int tmp = 1000 * t - h[i] * 6;
if (abs(1000 * a - tmp) < diff) {
diff = abs(... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,645 | 1,015,646 | u188117876 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0, diff = 100000000;
for (int i = 0; i < n; i++) {
int tmp = 1000 * t - h[i] * 6;
if (abs(1000 * t - tmp) < diff) {
diff = abs(1... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0, diff = 1000000000;
for (int i = 0; i < n; i++) {
int tmp = 1000 * t - h[i] * 6;
if (abs(1000 * a - tmp) < diff) {
diff = abs(... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,647 | 1,015,646 | u188117876 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int i;
for (i = 0; i < N; i++)
cin >> H[i];
double min = abs(A - (T - H[0] * 0.006));
int point;
for (i = 0; i < N; i++) {
if (min > abs(A - (T - H[i] * 0.006))) {
min = abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int i;
for (i = 0; i < N; i++)
cin >> H[i];
double min = abs(A - (T - H[0] * 0.006));
int point;
for (i = 0; i < N; i++) {
if (min >= abs(A - (T - H[i] * 0.006))) {
min = abs... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change",
"call.arguments.change"
] | 1,015,656 | 1,015,655 | u413492096 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> v(n);
for (int i = 0; i < n; i++) {
int in;
cin >> in;
v[i] = t - in * 0.006;
}
int ans = 0;
for (int i = 0; i < n; i++) {
int p = v[ans]... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> v(n);
for (int i = 0; i < n; i++) {
int in;
cin >> in;
v[i] = t - in * 0.006;
}
int ans = 0;
for (int i = 0; i < n; i++) {
double p = v[a... | [
"variable_declaration.type.primitive.change"
] | 1,015,659 | 1,015,660 | u471289663 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
int main() {
int N, T, A;
int tmp, ans_temp = 10000000, ans = 0;
vi H;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (ans_temp > abs(A - (T - tmp * 0.006))) {
ans_temp = abs(A... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
int main() {
int N, T, A;
double tmp, ans_temp = 10000000;
int ans = 0;
vi H;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (ans_temp > abs(A - (T - tmp * 0.006))) {
ans_tem... | [
"variable_declaration.type.primitive.change"
] | 1,015,662 | 1,015,663 | u503052349 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
int main() {
int N, T, A;
int tmp, ans_temp = 1000, ans = 0;
vi H;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (ans_temp > abs(A - (T - tmp * 0.006))) {
ans_temp = abs(A - (... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
int main() {
int N, T, A;
double tmp, ans_temp = 10000000;
int ans = 0;
vi H;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (ans_temp > abs(A - (T - tmp * 0.006))) {
ans_tem... | [
"variable_declaration.type.primitive.change"
] | 1,015,664 | 1,015,663 | u503052349 | cpp |
p03220 | #include <bits/stdc++.h>
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 mini = 10000, ans = 0;
for (int i = 0; i < N; i++) {
double t = T - H[i] * 0.006;
if (abs(A - t) < mini) {
mini = abs(A - t);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
double mini = 10000;
int ans = 0;
for (int i = 0; i < N; i++) {
double t = T - H[i] * 0.006;
if (abs(A - t) < mini) {
mini... | [
"variable_declaration.type.primitive.change"
] | 1,015,671 | 1,015,672 | u658901072 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int res = 0;
vector<double> at(N);
vector<double> atd(... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int res = 0;
vector<double> at(N);
vector<double> atd(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,675 | 1,015,676 | u240031669 | cpp |
p03220 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
int min = 1 << 30;
int tmp = 0;
for (int i = 1; i <= n; i++) {
cin >> h;
h = t * 100 - h * 6 - a * 1000;
if (h < 0)
h *= -1;
if (min > h) {
min = h;... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
int min = 1 << 30;
int tmp = 0;
for (int i = 1; i <= n; i++) {
cin >> h;
h = t * 1000 - h * 6 - a * 1000;
if (h < 0)
h *= -1;
if (min > h) {
min = h... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,015,677 | 1,015,678 | u017881341 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, min_i, T, A;
cin >> N >> T >> A;
int h;
double min = 100000000000., tmp_min;
for (int i = 1; i <= N; ++i) {
cin >> h;
tmp_min = abs(A - (T - (h * 0.006)));
if (min > tmp_min) {
min_i = i;
}
}
cout << min_... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, min_i, T, A;
cin >> N >> T >> A;
int h;
double min = 100000000000., tmp_min;
for (int i = 1; i <= N; ++i) {
cin >> h;
tmp_min = abs(A - (T - (h * 0.006)));
if (min > tmp_min) {
min = tmp_min;
min_i = i;
... | [
"assignment.add"
] | 1,015,679 | 1,015,680 | u744424208 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 1,015,681 | 1,015,682 | u103539599 | cpp |
p03220 | #include <bits/stdc++.h>
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];
}
double min = 1e9;
double ans = 0;
for (int i = 0; i < N; ++i) {
double d = A - (T - H[i] * 0.006);
if (d < min) {
min = d;
... | #include <bits/stdc++.h>
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];
}
double min = 1e9;
double ans = 0;
for (int i = 0; i < N; ++i) {
double d = abs(A - (T - H[i] * 0.006));
if (d < min) {
min = d;... | [
"call.add",
"call.arguments.change"
] | 1,015,683 | 1,015,684 | u212517806 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int minimum = 10000000;
int H, diff;
int ans;
for (int i = 0; i < N; ++i) {
cin >> H;
diff = abs(A - (T - (H * 0.006)));
if (diff < minimum) {
minimum = diff;
ans = i + 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
double minimum = 10000000.;
int H;
double diff;
int ans;
for (int i = 0; i < N; ++i) {
cin >> H;
diff = abs(A - (T - (H * 0.006)));
if (diff < minimum) {
minimum = diff;
ans = i + 1... | [
"variable_declaration.type.primitive.change"
] | 1,015,685 | 1,015,686 | u559765551 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int dif = 999999;
int ans = 0;
for... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double dif = 1e18;
int ans = 0;
fo... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,687 | 1,015,688 | u318785595 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int N, T, A;
int main(int argc, char const *argv[]) {
cin >> N >> T >> A;
std::vector<int> H(N);
std::vector<int> temparature(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int N;
double T, A;
int main(int argc, char const *argv[]) {
cin >> N >> T >> A;
std::vector<double> H(N);
std::vector<double> temparature(N);
for (int i = 0; i < N; i++) {
cin ... | [
"variable_declaration.type.primitive.change"
] | 1,015,689 | 1,015,690 | u280016524 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A;
double T;
cin >> N;
cin >> T >> A;
double H[1000];
double pans = 10000000;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (pans >= abs(T - H[i] * 0.006)) {
ans = i + 1;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A;
double T;
cin >> N;
cin >> T >> A;
double H[1000];
double pans = 10000000;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (pans >= abs(T - H[i] * 0.006 - A)) {
ans = i + 1;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,015,691 | 1,015,692 | u794707792 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
int x;
double *H;
double min = 999999999;
int index = -1;
cin >> N >> T >> A;
H = new double[N];
for (int i = 0; i < N; i++) {
cin >> x;
H[i] = T - x * 0.006;
}
for (int i = 0; i < N; i++) {
// cout <... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
int x;
double *H;
double min = 999999999;
int index = -1;
cin >> N >> T >> A;
H = new double[N];
for (int i = 0; i < N; i++) {
cin >> x;
H[i] = T - x * 0.006;
}
for (int i = 0; i < N; i++) {
// cout <... | [
"call.add",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,693 | 1,015,694 | u475318902 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
int h;
int ans = 1000000;
int j;
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 0.006 - a) <= ans) {
j = i;
ans = abs(t - h * 0.006 - a);
}
}
cout << j + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double n, t, a;
double h;
double ans = 1000000;
int j;
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 0.006 - a) <= ans) {
j = i;
ans = abs(t - h * 0.006 - a);
}
}
cout << j + 1 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 1,015,697 | 1,015,698 | u693953100 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
int h;
int ans = 1000000;
int j;
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 0.006 - a) < ans) {
j = i;
ans = abs(t - h * 0.006 - a);
}
}
cout << j + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double n, t, a;
double h;
double ans = 1000000;
int j;
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 0.006 - a) <= ans) {
j = i;
ans = abs(t - h * 0.006 - a);
}
}
cout << j + 1 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,699 | 1,015,698 | u693953100 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> h[i];
int min = 500000000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++)
cin >> h[i];
int min = 500000000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,015,702 | 1,015,703 | u572012241 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> h[i];
int min = 50000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
if... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++)
cin >> h[i];
int min = 500000000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,015,704 | 1,015,703 | u572012241 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> h[i];
int min = 50;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
if (m... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++)
cin >> h[i];
int min = 500000000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,015,705 | 1,015,703 | u572012241 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> h[i];
int min = 50;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
if (m... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N, T, A;
int h[1100];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++)
cin >> h[i];
int min = 500000000;
int index;
int t;
for (int i = 1; i <= N; i++) {
t = T * 1000 - h[i] * 6;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,015,706 | 1,015,703 | u572012241 | cpp |
p03220 | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (ll i = x; i <= y; ... | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (ll i = x; i <= y; ... | [
"variable_declaration.type.primitive.change"
] | 1,015,713 | 1,015,714 | u202370403 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int h[1005] = {}, tem[1005] = {};
int ans[2] = {100000, -1};
rep(i, N) {
cin >> h[i];
tem[i] = T - h[i] * 0.006;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int h[1005] = {};
double tem[1005] = {};
double ans[2] = {100000, -1};
rep(i, N) {
cin >> h[i];
tem[i] = T - h[i] * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,015,715 | 1,015,716 | u180262908 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
T = T * 1000;
A = A * 1000;
int min, answer, H;
vector<int> Hs, tempel;
min = 100001;
for (int i = 0; i < N; i++) {
cin >> H;
Hs.push_back(H);
}
for (int i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
T = T * 1000;
A = A * 1000;
int min, answer, H;
vector<int> Hs, tempel;
min = 100001;
for (int i = 0; i < N; i++) {
cin >> H;
Hs.push_back(H);
}
for (int i... | [
"expression.operation.binary.add"
] | 1,015,723 | 1,015,724 | u842388336 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
T = T * 1000;
A = A * 1000;
int min, answer, H;
vector<int> Hs, tempel;
min = 100001;
for (int i = 0; i < N; i++) {
cin >> H;
Hs.push_back(H);
}
for (int i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
T = T * 1000;
A = A * 1000;
int min, answer, H;
vector<int> Hs, tempel;
min = 100001;
for (int i = 0; i < N; i++) {
cin >> H;
Hs.push_back(H);
}
for (int i... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.add"
] | 1,015,725 | 1,015,724 | u842388336 | cpp |
p03220 | #include <bits/stdc++.h>
#define inf 10000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int A, T, N, i, ans;
double a, b = inf;
cin >> N >> T >> A;
int H[N];
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; ... | #include <bits/stdc++.h>
#define inf 10000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int A, T, N, i, ans;
double a, b = inf;
cin >> N >> T >> A;
int H[N];
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; ... | [
"call.arguments.change"
] | 1,015,732 | 1,015,733 | u654998183 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, index, i, temp;
double min, curr;
cin >> n >> t >> a;
cin >> temp;
index = 1;
min = abs(a - 0.006 * temp);
for (i = 2; i <= n; i++) {
cin >> temp;
curr = abs(a - 0.006 * temp);
if (curr < min) {
min = cur... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, index, i, temp;
float min, curr;
cin >> n >> t >> a;
cin >> temp;
index = 1;
min = abs(a - t + 0.006 * temp);
for (i = 2; i <= n; i++) {
cin >> temp;
curr = abs(a - t + 0.006 * temp);
if (curr < min) {
mi... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 1,015,736 | 1,015,737 | u467423063 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | [
"control_flow.branch.if.condition.change"
] | 1,015,740 | 1,015,741 | u196497077 | cpp |
p03220 | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | [
"expression.operation.binary.add"
] | 1,015,742 | 1,015,743 | u041282550 | cpp |
p03220 | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | [
"assignment.add"
] | 1,015,744 | 1,015,743 | u041282550 | cpp |
p03220 | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | #include <iostream>
using namespace std;
int N, T, A, M, Q, i, j, k, l;
int H[9999999];
int S[9999999];
int P[9999999];
int main() {
cin >> N >> T >> A;
for (i = 0; i < N; i++)
cin >> H[i];
for (j = 0; j < N; j++)
S[j] = 1000 * T - 6 * H[j];
for (k = 0; k < N; k++) {
if (S[k] > 1000 * A) {
P[... | [
"assignment.add"
] | 1,015,745 | 1,015,743 | u041282550 | cpp |
p03220 | #include <bits/stdc++.h>
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 diff = 1000;
int ans;
for (int i = 0; i < n; i++) {
if (abs(t - h.at(i) * 0.006 - a) < diff) {
diff = abs(t - h.at(i) * 0.006 -... | #include <bits/stdc++.h>
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);
}
double diff = 1000;
int ans;
for (int i = 0; i < n; i++) {
if (abs(t - h.at(i) * 0.006 - a) < diff) {
diff = abs(t - h.at(i) * 0.00... | [
"variable_declaration.type.primitive.change"
] | 1,015,746 | 1,015,747 | u578035814 | cpp |
p03220 | #include <cstdlib>
#include <iostream>
#include <stdio.h>
using namespace std;
int N, T, A;
int main() {
cin >> N >> T >> A;
int best = 99999999;
int ans = -1;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
int ave = T * 1000 - x * 6;
if (abs(A * 1000 - ave) < best) {
best = A * 1000 - av... | #include <cstdlib>
#include <iostream>
#include <stdio.h>
using namespace std;
int N, T, A;
int main() {
cin >> N >> T >> A;
int best = 99999999;
int ans = -1;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
int ave = T * 1000 - x * 6;
if (abs(A * 1000 - ave) < best) {
best = abs(A * 1000 ... | [
"call.add",
"call.arguments.change"
] | 1,015,750 | 1,015,751 | u090967649 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
int N;
int T, A;
int H[10001];
cin >> N >> T >> A;
FO... | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
int N;
int T, A;
int H[10001];
cin >> N >> T >> A;
FO... | [
"control_flow.branch.if.condition.change"
] | 1,015,754 | 1,015,755 | u964246645 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
int N;
int T, A;
int H[10001];
cin >> N >> T >> A;
FO... | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
int N;
int T, A;
int H[10001];
cin >> N >> T >> A;
FO... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,015,756 | 1,015,755 | u964246645 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
int h[n];
int ans = 0;
double tmp = 10000000;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int aa = t - h[i] * 0.006 * 1000;
int diff;
diff = abs(a - aa);
... | #include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
int h[n];
int ans = 0;
double tmp = 10000000;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int aa = t * 1000 - h[i] * 0.006 * 1000;
int diff;
diff = abs(a - ... | [
"assignment.change"
] | 1,015,757 | 1,015,758 | u324303263 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int height[N];
int temp[N];
int ans;
for (int i = 0; i < N; i++) {
cin >> height[i];
temp[i] = 1000 * T - 6 * height[i];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int height[N];
int temp[N];
int ans;
A *= 1000;
for (int i = 0; i < N; i++) {
cin >> height[i];
temp[i] = 1000 * T - 6 *... | [
"assignment.add"
] | 1,015,759 | 1,015,760 | u923238225 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int parece = 0;
int min_diff = 10000000;
t *= 1000;
for (int i = 0; i < n; i++) {
int temp = t - ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int parece = 0;
int min_diff = 10000000;
a *= 1000;
t *= 1000;
for (int i = 0; i < n; i++) {
in... | [
"assignment.add"
] | 1,015,764 | 1,015,765 | u964185015 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int H[N];
int ans = std::pow(10, 5);
int pos;
for (int i = 0; i < N; i++) {
std::cin >> H[i];
double tmp = std::abs(A - T + H[i] * 0.006);
if (ans > tmp) {
ans = tmp;
pos = i;
}
}
std::c... | #include <cmath>
#include <iostream>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int H[N];
double ans = std::pow(10, 5);
int pos;
for (int i = 0; i < N; i++) {
std::cin >> H[i];
double tmp = std::abs(A - T + H[i] * 0.006);
if (ans > tmp) {
ans = tmp;
pos = i;
}
}
std... | [
"variable_declaration.type.primitive.change"
] | 1,015,770 | 1,015,771 | u220071018 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int H[N];
int ans = std::pow(10, 5);
int pos;
for (int i = 0; i < N; i++) {
std::cin >> H[i];
int tmp = std::abs(A - T + H[i] * 0.006);
if (ans > tmp) {
ans = tmp;
pos = i;
}
}
std::cout... | #include <cmath>
#include <iostream>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int H[N];
double ans = std::pow(10, 5);
int pos;
for (int i = 0; i < N; i++) {
std::cin >> H[i];
double tmp = std::abs(A - T + H[i] * 0.006);
if (ans > tmp) {
ans = tmp;
pos = i;
}
}
std... | [
"variable_declaration.type.primitive.change"
] | 1,015,772 | 1,015,771 | u220071018 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, n;
cin >> n >> t >> a;
int ans = -1e9;
int p;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
int sum = (t * 1000 - h * 6) - a * 1000;
if (ans > abs(sum)) {
ans = abs(sum);
p = i;
}
}
cout << p;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, n;
cin >> n >> t >> a;
int ans = 1e10;
int p;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
int sum = (t * 1000 - h * 6) - a * 1000;
if (ans > abs(sum)) {
ans = abs(sum);
p = i;
}
}
cout << p;
retur... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,773 | 1,015,774 | u342192356 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, b;
int a[1010];
int main() {
cin >> n;
cin >> t;
cin >> b;
for (int i = 0; i < n; i++)
cin >> a[i];
int c = b;
double min = 10000;
int findID = -1;
for (int i = 0; i < n; i++) {
double tmp = t - a[i] * 0.006;
if (min > abs(c - tmp)... | #include <bits/stdc++.h>
using namespace std;
int n, t, b;
int a[1010];
int main() {
cin >> n;
cin >> t;
cin >> b;
for (int i = 1; i <= n; i++)
cin >> a[i];
int c = b;
double min = 10000;
int findID = -1;
for (int i = 1; i <= n; i++) {
double tmp = t - a[i] * 0.006;
if (min > abs(c - tm... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,015,775 | 1,015,776 | u736638764 | cpp |
p03220 | #include <iostream>
#include <vector>
int mean_temp(int T, int x) {
int temp_1000x = (T * 1000) - (x * 6);
return temp_1000x / 1000;
}
int abs_diff(int A, int H) {
if (A > H)
return A - H;
else
return H - A;
}
int main() {
int N, T, A, temp;
std::cin >> N >> T >> A;
int temp_ans = 0;
int rec... | #include <iostream>
#include <vector>
int mean_temp(int T, int x) {
int temp_1000x = (T * 1000) - (x * 6);
return temp_1000x;
}
int abs_diff(int A, int H) {
if (A > H)
return A - H;
else
return H - A;
}
int main() {
int N, T, A, temp;
std::cin >> N >> T >> A;
int temp_ans = 0;
int record = 1... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,015,779 | 1,015,780 | u076634068 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n], ans = 0;
rep(i, n) cin >> h[i];
for (int i = 1; i <= n - 1; i++) {
if (fabs(t - 0.06 * (double)h[ans] - a) > fabs(t - 0.06 * (double)h[i] - a))
a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n], ans = 0;
rep(i, n) cin >> h[i];
for (int i = 1; i <= n - 1; i++) {
if (fabs(t - 0.006 * (double)h[ans] - a) >
fabs(t - 0.006 * (double)h[i] - a... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,015,781 | 1,015,782 | u209857301 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, t, a, ans, min = 1000000000;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
int h, temp;
cin >> h;
temp = t * 1000 - h * 6;
if (min > abs(temp - a)) {
ans = i;
... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, t, a, ans, min = 1000000000;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
int h, temp;
cin >> h;
temp = t * 1000 - h * 6;
if (min > abs(temp - a * 1000)) {
ans ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,015,783 | 1,015,784 | u114445216 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
double min = fabs(a - t - h[0] * 0.006);
int index = 1;
for (int i = 1; i < n; i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
double min = fabs(a - t + h[0] * 0.006);
int index = 1;
for (int i = 1; i < n; i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,015,785 | 1,015,786 | u167161639 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int h[1000];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double min = fabs(a - (t - h[0] * 0.006));
int index = 1;
for (int i = 1; i < n; i++) {
if (min > fabs(a - (t - h[i] * 0.006... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int h[1000];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double min = fabs(a - (t - h[0] * 0.006));
int index = 1;
for (int i = 1; i < n; i++) {
if (min > fabs(a - (t - h[i] * 0.006... | [] | 1,015,787 | 1,015,788 | u167161639 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll>> P3;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll>> P3;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,791 | 1,015,792 | u271063202 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
#define ll \
getchar(); \
getchar(); ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
#define ll \
getchar(); \
getchar(); ... | [
"assignment.value.change",
"assignment.change"
] | 1,015,801 | 1,015,802 | u971256474 | cpp |
p03220 | #include <bits/stdc++.h>
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);
vector<double> tem(n);
for (int i = 0; i < n; ++i) {
tem.at(i) = t - h.at(i) * 0.006;
}
int chikasacopy = 1000;
int result = 0;
for (in... | #include <bits/stdc++.h>
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);
vector<double> tem(n);
for (int i = 0; i < n; ++i) {
tem.at(i) = t - h.at(i) * 0.006;
}
double chikasacopy = 1000;
int result = 0;
for ... | [
"variable_declaration.type.primitive.change"
] | 1,015,806 | 1,015,807 | u775776331 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, h[1010];
int ondo;
cin >> N;
cin >> T >> A;
int temp;
int ans = 100000;
for (int i = 0; i < N; i++) {
cin >> h[i];
ondo = T - 0.006 * h[i];
if (ans > abs(A - ondo)) {
ans = a... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
double N, T, A, h[1010];
double ondo;
cin >> N;
cin >> T >> A;
int temp;
double ans = 100000;
for (int i = 0; i < N; i++) {
cin >> h[i];
ondo = T - 0.006 * h[i];
if (ans > abs(A - ondo)) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,808 | 1,015,809 | u540498624 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double H[N];
double a = 10e5;
int h = 0;
int n;
for (int i = 0; i < N; i++) {
cin >> H[i];
h++;
if (a > abs(A - (T - H[i] * 0.006))) {
a = A - (T - H[i] * 0.006);
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double H[N];
double a = 10e5;
int h = 0;
int n;
for (int i = 0; i < N; i++) {
cin >> H[i];
h++;
if (a > abs(A - (T - H[i] * 0.006))) {
a = abs(A - (T - H[i] * 0.006... | [
"call.add",
"call.arguments.change"
] | 1,015,810 | 1,015,811 | u540300321 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int aa = 200000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
if (aa >= abs(a - (t - h * 0.006))) {
aa = abs(a - (t - h * 0.006));
ans = i;
}
}
cout << an... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double aa = 2000000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
if (aa >= abs(a - (t - h * 0.006))) {
aa = abs(a - (t - h * 0.006));
ans = i;
}
}
cout <... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,819 | 1,015,820 | u239023686 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int aa = 2000000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
if (aa >= abs(a - (t - h * 0.006))) {
aa = abs(a - (t - h * 0.006));
ans = i;
}
}
cout << a... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double aa = 2000000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
if (aa >= abs(a - (t - h * 0.006))) {
aa = abs(a - (t - h * 0.006));
ans = i;
}
}
cout <... | [
"variable_declaration.type.primitive.change"
] | 1,015,821 | 1,015,820 | u239023686 | cpp |
p03220 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rr... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rr... | [
"call.remove",
"call.arguments.change"
] | 1,015,824 | 1,015,825 | u495267515 | cpp |
p03220 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rr... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rr... | [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 1,015,826 | 1,015,825 | u495267515 | cpp |
p03220 | #include <stdio.h>
int main() {
int N, T, A;
double tmp[1000];
int H[1000];
scanf("%d %d %d", &N, &T, &A);
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (int i = 0; i < N; i++) {
tmp[i] = T - H[i] * 0.006;
}
int min = 987654321;
int cnt = -1;
for (int i = 0; i < N; i++) {
if... | #include <stdio.h>
int main() {
int N, T, A;
double tmp[1000];
int H[1000];
scanf("%d %d %d", &N, &T, &A);
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (int i = 0; i < N; i++) {
tmp[i] = T - H[i] * 0.006;
}
double min = 987654321;
int cnt = -1;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,829 | 1,015,830 | u069669067 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int h[1000];
int main(void) {
int N, T, A;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int x = 1000000;
int ans;
for (int i = 0; i < N; i++) {
if (x > abs(A - (T - h[i] * 0.006))) {
x = abs(A - (T - h[i] ... | #include <cmath>
#include <iostream>
using namespace std;
double h[1000];
int main(void) {
int N;
double T, A;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
double x = 1000000;
int ans;
for (int i = 0; i < N; i++) {
if (x > abs(A - (T - h[i] * 0.006))) {
x = abs... | [
"variable_declaration.type.primitive.change"
] | 1,015,831 | 1,015,832 | u391202061 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int res;
int min = INT_MAX;
for (int i = 0; i < N; i++) {
int dif = abs(A - (T - H[i] * 0.006));
if (dif < min) {
min = dif;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int res;
double min = DBL_MAX;
for (int i = 0; i < N; i++) {
double dif = abs(A - (T - H[i] * 0.006));
if (dif < min) {
min = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,015,846 | 1,015,847 | u185836561 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int res;
int min = 1000;
for (int i = 0; i < N; i++) {
int dif = abs(A - (T - H[i] * 0.006));
if (dif < min) {
min = dif;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int res;
double min = DBL_MAX;
for (int i = 0; i < N; i++) {
double dif = abs(A - (T - H[i] * 0.006));
if (dif < min) {
min = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,015,848 | 1,015,847 | u185836561 | cpp |
p03220 | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | [
"variable_declaration.type.primitive.change"
] | 1,015,851 | 1,015,852 | u687044304 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
const int INF = 1e5;
int main() {
int N;
int T, A;
std::cin >> N >> T >> A;
int ans = 1;
int min_diff = INF;
for (int i = 1; i <= N; i++) {
int H;
std::cin >> H;
double t = T - H * 0.006;
if (std::fabs(t - A) < min_d... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
const int INF = 1e5;
int main() {
double N;
double T, A;
std::cin >> N >> T >> A;
int ans = 1;
double min_diff = INF;
for (int i = 1; i <= N; i++) {
int H;
std::cin >> H;
double t = T - H * 0.006;
if (std::fabs(t - A... | [
"variable_declaration.type.primitive.change"
] | 1,015,855 | 1,015,856 | u415580658 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int h, index, sub = pow(10, 9);
for (int i = 0; i < N; i++) {
cin >> h;
double point = abs((double)T - h * 0.006 - A);
if (sub > point)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int h, index;
double sub = pow(10, 9);
for (int i = 0; i < N; i++) {
cin >> h;
double point = abs((double)T - h * 0.006 - A);
if (su... | [
"variable_declaration.type.change"
] | 1,015,857 | 1,015,858 | u979920726 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double Min = 100000000;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = 12 - h[i] * 0.006;
if (abs(h[i] - a) < Min) {
Min = abs(... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double Min = 100000000;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t - h[i] * 0.006;
if (abs(h[i] - a) < Min) {
Min = abs(h... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,015,865 | 1,015,866 | u208430248 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++)
H.at(i) = abs(A - (T - H.at(i) * 0.006));
/* test
for(int i=0; i<N;i++)
cout << H.at(i) << ' ';
*/
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++)
H.at(i) = abs(A - (T - H.at(i) * 0.006));
/* test
for(int i=0; i<N;i++)
cout << H.at(i) << ' ';
*/
d... | [
"variable_declaration.type.primitive.change"
] | 1,015,869 | 1,015,870 | u211254723 | cpp |
p03220 | #include <bits/stdc++.h>
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);
for (int i = 0; i < N; i++)
H.at(i) = abs(A - (T - H.at(i) * 0.006));
int min = H.at(0);
int min_i = 0;
for (int i = 0; i < N; i++) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < N; i++)
H.at(i) = abs(A - (T - H.at(i) * 0.006));
/* test
for(int i=0; i<N;i++)
cout << H.at(i) << ' ';
*/
d... | [
"variable_declaration.type.primitive.change"
] | 1,015,871 | 1,015,870 | u211254723 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | [
"variable_declaration.type.change"
] | 1,015,872 | 1,015,873 | u432688695 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
template <class T> bool contain(const std::string &s, const T &v) {
return s.find(v) != std::string::npos;
}
int main() {
int n, t, a;
int h[1005] = {};
int num = 1e9 + 1;
int ans = 0;
cin >> n >> t >> a;
fo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
template <class T> bool contain(const std::string &s, const T &v) {
return s.find(v) != std::string::npos;
}
int main() {
int n, t, a;
int h[1005] = {};
double num = 1e9 + 1;
int ans = 0;
cin >> n >> t >> a;
... | [
"variable_declaration.type.primitive.change"
] | 1,015,878 | 1,015,879 | u159695843 | cpp |
p03220 | // https://beta.atcoder.jp/contests/abc113/tasks/abc113_b
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T, A, X;
cin >> N >> T >> A;
int res = 0;
int INF = 1 << 30;
for (int i = 0; i < N; i++) {
cin >> X;
int a = (T * 1000 - X * 6) - A * 1000;
... | // https://beta.atcoder.jp/contests/abc113/tasks/abc113_b
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T, A, X;
cin >> N >> T >> A;
int res = 0;
int INF = 1 << 30;
for (int i = 1; i <= N; i++) {
cin >> X;
int a = (T * 1000 - X * 6) - A * 1000;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,015,880 | 1,015,881 | u252904081 | cpp |
p03220 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,015,882 | 1,015,883 | u013803727 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
double mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
doubl... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
double mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
doubl... | [
"variable_declaration.type.primitive.change"
] | 1,015,897 | 1,015,898 | u031448582 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
int mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double h... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
double mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
doubl... | [
"variable_declaration.type.primitive.change"
] | 1,015,899 | 1,015,898 | u031448582 | cpp |
p03220 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
int mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
double mi = 100000;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
doubl... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 1,015,900 | 1,015,898 | u031448582 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, t, a, h[1000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int v, minv = 1000;
for (int i = 0; i < n; i++) {
if (minv > fabs(t - h[i] * 0.006 - a)) {
minv = fabs(t - h[i] * 0.006 - a);
v = i +... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, t, a, h[1000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int v;
double minv = 1000;
for (int i = 0; i < n; i++) {
if (minv > fabs(t - h[i] * 0.006 - a)) {
minv = fabs(t - h[i] * 0.006 - a);
... | [
"variable_declaration.type.change"
] | 1,015,901 | 1,015,902 | u291873788 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int n = 0; n < N; n++)
cin >> H[n];
T -= A;
int dif, result = 0;
int min = 100000;
for (int n = 0; n < N; n++) {
dif = abs(T - 0.006 * H[n]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int n = 0; n < N; n++)
cin >> H[n];
T -= A;
float dif;
int result = 0;
float min = 100000;
for (int n = 0; n < N; n++) {
dif = abs(T - 0.006 ... | [
"variable_declaration.type.primitive.change"
] | 1,015,907 | 1,015,908 | u382251756 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int n = 0; n < N; n++)
cin >> H[n];
T -= A;
int dif, result = 0;
int min = 1000;
for (int n = 0; n < N; n++) {
dif = abs(T - 0.006 * H[n]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int n = 0; n < N; n++)
cin >> H[n];
T -= A;
float dif;
int result = 0;
float min = 100000;
for (int n = 0; n < N; n++) {
dif = abs(T - 0.006 ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,909 | 1,015,908 | u382251756 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
int min_diff = 10000000;
int id = -1;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int tempture = T - H * 0.006;
int diff = abs(A - tempture);
if (dif... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
double min_diff = 10000000;
int id = -1;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double tempture = T - H * 0.006;
double diff = abs(A - tempture);
... | [
"variable_declaration.type.primitive.change"
] | 1,015,916 | 1,015,917 | u935239805 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
vector<pair<double, int>> p;
for (int i = 0; i < N; i++) {
p.push_back(make_pair(T - 0.006 * H[i], i + 1));
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
vector<pair<double, int>> p;
for (int i = 0; i < N; i++) {
p.push_back(make_pair(T - 0.006 * H[i], i + 1));
}
... | [
"variable_declaration.type.primitive.change"
] | 1,015,918 | 1,015,919 | u672541593 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, H[1000], num = 1;
double f;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> H[i];
f = abs(a - (t - H[0] * 0.006));
for (int i = 1; i < n; i++) {
if (abs(a - (t - H[i] * 0.006)) < f) {
f = a - (t - H[i] * 0.0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, H[1000], num = 1;
double f;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> H[i];
f = abs(a - (t - H[0] * 0.006));
for (int i = 1; i < n; i++) {
if (abs(a - (t - H[i] * 0.006)) < f) {
f = abs(a - (t - H[i] *... | [
"call.add",
"call.arguments.change"
] | 1,015,920 | 1,015,921 | u115106582 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int max(int x, int y) {
if (x > y)
return x;
return y;
}
int min(int x, int y) {
if (x < y)
return x;
return y;
}
int main() {
int n, t, a, num = 0, zansa, place = 1;
double res = 100000, ave_t;
int h;
cin >> n >> t >> a;
for (int i ... | #include <cmath>
#include <iostream>
using namespace std;
int max(int x, int y) {
if (x > y)
return x;
return y;
}
int min(int x, int y) {
if (x < y)
return x;
return y;
}
int main() {
double n, t, a, num = 0, place = 1;
double res = 100000, zansa, ave_t;
int h;
cin >> n >> t >> a;
for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove",
"variable_declaration.add"
] | 1,015,922 | 1,015,923 | u427052796 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, T, A;
cin >> N;
cin >> T;
cin >> A;
int *H;
H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
float fDif = 10000;
int nNum = 0;
for (int i = 0; i < N; i++) {
float Tb = T - H[i] * 0.006f;
float... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, T, A;
cin >> N;
cin >> T;
cin >> A;
int *H;
H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
float fDif = 10000;
int nNum = 0;
for (int i = 0; i < N; i++) {
float Tb = T - H[i] * 0.006f;
float... | [
"assignment.add"
] | 1,015,930 | 1,015,931 | u288035794 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, answer = 1001, H, propT, temp;
cin >> N >> T >> A;
cin >> H;
propT = abs(A - (T - H * 0.006));
// cout << propT << endl;
answer = 1;
for (int i = 1; i < N; i++) {
cin >> H;
temp = abs(A - (T - H * 0.006));
if (propT ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, answer = 1001, H;
double temp, propT;
cin >> N >> T >> A;
cin >> H;
propT = abs(A - (T - H * 0.006));
// cout << propT << endl;
answer = 1;
for (int i = 1; i < N; i++) {
cin >> H;
temp = abs(A - (T - H * 0.006));
i... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,015,934 | 1,015,935 | u977360761 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>... | [
"variable_declaration.type.primitive.change"
] | 1,015,938 | 1,015,939 | u719885994 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>... | [
"variable_declaration.type.primitive.change"
] | 1,015,940 | 1,015,939 | u719885994 | cpp |
p03220 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,015,944 | 1,015,945 | u698760125 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <typename T> void scan(T &x) {
char ch;
bool f = 1;
x = 0;
ch = getcha... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <typename T> void scan(T &x) {
char ch;
bool f = 1;
x = 0;
ch = getcha... | [
"variable_declaration.type.change"
] | 1,015,946 | 1,015,947 | u129074242 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N, T, A;
cin >> N >> T >> A;
double dif = 100;
int ans;
for (int i = 1; i <= N; i++) {
double Hi;
cin >> Hi;
if (dif > abs((T - A) / 0.006, H... | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N, T, A;
cin >> N >> T >> A;
double dif = 100000;
int ans;
for (int i = 1; i <= N; i++) {
double Hi;
cin >> Hi;
if (dif > abs((T - A) / 0.006... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,950 | 1,015,951 | u422725381 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N, T, A;
cin >> N >> T >> A;
int dif = 100;
int ans;
for (int i = 1; i <= N; i++) {
int Hi;
cin >> Hi;
if (dif > abs((T - A) / 0.006, Hi)) {
... | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N, T, A;
cin >> N >> T >> A;
double dif = 100000;
int ans;
for (int i = 1; i <= N; i++) {
double Hi;
cin >> Hi;
if (dif > abs((T - A) / 0.006... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,952 | 1,015,951 | u422725381 | cpp |
p03220 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int i;
int index;
int n;
float t, a;
float min;
cin >> n >> t >> a;
float h[n];
for (i = 0; i < n; i++)
cin >> h[i];
min = fa... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int i;
int index;
int n;
float t, a;
float min;
cin >> n >> t >> a;
float h[n];
for (i = 0; i < n; i++)
cin >> h[i];
min = fa... | [
"assignment.change"
] | 1,015,954 | 1,015,955 | u202813867 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h;
cin >> n >> t >> a;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> h;
vec[i] = abs(a - t - h * 0.006);
}
vector<int> index(vec.size());
iota(index.begin(), index.end(), 0);
// for(int i=0;i<n;i++)cout<<ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h;
cin >> n >> t >> a;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> h;
vec[i] = abs(a - (t - h * 0.006));
}
vector<int> index(vec.size());
iota(index.begin(), index.end(), 0);
// for(int i=0;i<n;i++)cout... | [
"call.arguments.change"
] | 1,015,956 | 1,015,957 | u026421211 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h;
cin >> n >> t >> a;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> h;
vec[i] = abs(a - t - h * 0.0006);
}
vector<int> index(vec.size());
iota(index.begin(), index.end(), 0);
std::sort(index.begin(), index... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h;
cin >> n >> t >> a;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> h;
vec[i] = abs(a - (t - h * 0.006));
}
vector<int> index(vec.size());
iota(index.begin(), index.end(), 0);
// for(int i=0;i<n;i++)cout... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,015,958 | 1,015,957 | u026421211 | cpp |
p03220 | #include <bits/stdc++.h>
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];
}
double min_sub = abs((t - h[0] * 0.006));
int ans = 1;
for (int i = 0; i < n; i++) {
if (abs((t - h[i] * 0.006)) < min_sub) {
min_sub ... | #include <bits/stdc++.h>
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];
}
double min_sub = abs(a - (t - h[0] * 0.006));
int ans = 1;
for (int i = 0; i < n; i++) {
if (abs(a - (t - h[i] * 0.006)) < min_sub) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,015,959 | 1,015,960 | u451538287 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.