problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
int min;
int ans;
min = 100000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs(T - H[i] * 0... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
double min;
int ans;
min = 1000000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs((T - H[i... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"call.arguments.change"
] | 1,015,244 | 1,015,242 | u166632863 | 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 mn = (1 << 21);
int res = 0;
for (int i = 0; i < n; i++) {
int tmp = abs(a - (t - h[i] * 0.006));
if (mn > tmp) {
mn = tmp;
... | #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 mn = (1 << 21);
int res = 0;
for (int i = 0; i < n; i++) {
double tmp = abs(a - (t - h[i] * 0.006));
if (mn > tmp) {
mn = tmp;
... | [
"variable_declaration.type.primitive.change"
] | 1,015,251 | 1,015,252 | u881599732 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int diff = 1e9;
int ans;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int tmp = abs(a - (t - h * 0.006));
if (diff > tmp) {
diff = tmp;
ans = i;
}
}... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double diff = 1e9;
double ans;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
double tmp = abs(a - (t - h * 0.006));
if (diff >= tmp) {
diff = tmp;
ans =... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,253 | 1,015,254 | u698571659 | cpp |
p03220 | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)), t.end())
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 1000000007, mod9 = 1000000009;
template <class T> inline... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)), t.end())
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 1000000007, mod9 = 1000000009;
template <class T> inline... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,255 | 1,015,256 | u192903163 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vecA(N);
vector<int> vecB(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
vecB[i] = A - T + (H * 0.006);
if ((A - T + (H * 0.006)) >= 0)
vecA[i] = A - T + (H * 0.006);
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> vecA(N);
vector<double> vecB(N);
for (int i = 0; i < N; i++) {
double H;
cin >> H;
vecB[i] = A - T + (H * 0.006);
if ((A - T + (H * 0.006)) >= 0)
vecA[i] = A - T + (H * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,015,260 | 1,015,261 | u371149954 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
// input Height
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int min = 1000000;
int finder = -1;
// calculate |T-A|
for (int i = 0; i < N; i++) {
double t = T - H[i] * 0.006... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
// input Height
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double min = 1000000;
int finder = -1;
// calculate |T-A|
for (int i = 0; i < N; i++) {
double t = T - H[i] * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,015,262 | 1,015,263 | u368623616 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
double min_abs = 100000;
int index = 0;
for (int i = 0; i < n; i++) {
double temp = (double)t - (double)h[i] * 0.006;
temp = abs(abs((... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
double min_abs = 100000;
int index = 0;
for (int i = 0; i < n; i++) {
double temp = (double)t - (double)h[i] * 0.006;
temp = abs((doub... | [
"call.remove",
"call.arguments.change"
] | 1,015,264 | 1,015,265 | u341846697 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, t, a, ans;
cin >> n >> t >> a;
double close = INT_MAX;
REP(i, n) {
long long h;
cin >> h;
h = t - h * 0.006;
double tmp = abs(a -... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, t, a, ans;
cin >> n >> t >> a;
double close = INT_MAX;
REP(i, n) {
long long h;
double kion;
cin >> h;
kion = t - h * 0.006;
... | [
"variable_declaration.add",
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,266 | 1,015,267 | u582817680 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (auto &&w : h) {
cin >> w;
}
int ans = 1;
int x = abs((100 * (a - t) + h[0] * 6)), y;
for (int i = 0; i < n; i++) {
y = abs(100 * (a - t) + h[i] * 6);
if (y < x) {
ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (auto &&w : h) {
cin >> w;
}
int ans = 1;
int x = abs((1000 * (a - t) + h[0] * 6)), y;
for (int i = 0; i < n; i++) {
y = abs(1000 * (a - t) + h[i] * 6);
if (y < x) {
ans... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,015,268 | 1,015,269 | u731175398 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
vec.at(i) = 1000 * T - vec.at(i) * 6;
}
for (int i = 0; i < N; i++) {
if (vec.at(i) >= A) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
A *= 1000;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
vec.at(i) = 1000 * T - vec.at(i) * 6;
}
for (int i = 0; i < N; i++) {
if (vec.at(i) ... | [
"assignment.add"
] | 1,015,270 | 1,015,271 | u633284019 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
/* define const */
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
/* end defineing */
signed main() {
int n, t, a;
double h[1000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
double t... | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
/* define const */
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
/* end defineing */
signed main() {
int n, t, a;
double h[1000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
double t... | [
"variable_declaration.type.primitive.change"
] | 1,015,274 | 1,015,275 | u218759384 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_st... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_st... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,015,276 | 1,015,277 | u168578024 | 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);
H.at(i) = T - H.at(i) * 0.006;
}
vector<vector<double>> NN(N, vector<double>(2));
for (int i = 0; i < N; i++) {
NN.at(i).at(0) = max(A, H... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
double A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
H.at(i) = T - H.at(i) * 0.006;
}
vector<vector<double>> NN(N, vector<double>(2));
for (int i = 0; i < N; i++) {
NN.at(i).at(0... | [
"variable_declaration.type.primitive.change"
] | 1,015,278 | 1,015,279 | u028061225 | cpp |
p03220 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n, t, a, j;
int i;
vector<double> v, w;
cin >> n >> t >> a;
for (i = 0; i < n; i++) {
cin >> j;
if ((t - j * 0.006) >= a) {
v.push_back((t - j * 0.006) - a);
w.push_bac... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n, t, a, j;
int i;
vector<double> v, w;
cin >> n >> t >> a;
for (i = 0; i < n; i++) {
cin >> j;
if ((t - j * 0.006) >= a) {
v.push_back((t - j * 0.006) - a);
w.push_bac... | [
"expression.operation.binary.remove"
] | 1,015,280 | 1,015,281 | u060467857 | cpp |
p03220 | #include <iostream>
#include <vector>
using namespace std;
double calc(double t, double h, double a) {
double tem = t - h * 0.006;
if (tem >= a)
return tem - a;
else
return a - tem;
}
int main(void) {
int N, T, A;
cin >> N >> T >> A;
vector<double> height(1000, 0);
for (int i = 0; i < N; i++) ... | #include <iostream>
#include <vector>
using namespace std;
double calc(double t, double h, double a) {
double tem = t - h * 0.006;
if (tem >= a)
return tem - a;
else
return a - tem;
}
int main(void) {
int N, T, A;
cin >> N >> T >> A;
vector<double> height(1000, 0);
for (int i = 0; i < N; i++) ... | [] | 1,015,284 | 1,015,285 | u407416173 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <limits>
int main(int argc, char const *argv[]) {
double n, t, a;
std::cin >> n >> t >> a;
auto diff = std::numeric_limits<double>::max();
auto result = 0;
for (int i = 0; i < n; ++i) {
double h;
std::cin >> h;
double tmp = t - h * 0.006;
auto ab... | #include <cmath>
#include <iostream>
#include <limits>
int main(int argc, char const *argv[]) {
double n, t, a;
std::cin >> n >> t >> a;
double diff = std::numeric_limits<double>::max();
auto result = 0;
for (int i = 0; i < n; ++i) {
double h;
std::cin >> h;
double tmp = t - h * 0.006;
doub... | [] | 1,015,286 | 1,015,287 | u197999770 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <limits>
int main(int argc, char const *argv[]) {
double n, t, a;
std::cin >> n >> t >> a;
auto diff = std::numeric_limits<int>::max();
auto result = 0;
for (int i = 0; i < n; ++i) {
double h;
std::cin >> h;
double tmp = t - h * 0.006;
auto abs_v... | #include <cmath>
#include <iostream>
#include <limits>
int main(int argc, char const *argv[]) {
double n, t, a;
std::cin >> n >> t >> a;
double diff = std::numeric_limits<double>::max();
auto result = 0;
for (int i = 0; i < n; ++i) {
double h;
std::cin >> h;
double tmp = t - h * 0.006;
doub... | [
"variable_declaration.type.primitive.change"
] | 1,015,288 | 1,015,287 | u197999770 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, e;
cin >> a >> b >> c;
vector<double> d(a);
double ans;
ans = 1000000;
for (int i = 0; i < a; i++) {
cin >> d[i];
d[i] = b - d[i] * 0.006;
if (ans > abs(c - d[i])) {
e = i;
ans = min(ans, abs(c - d[i]));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, e;
cin >> a >> b >> c;
vector<double> d(a);
double ans;
ans = 1000000;
for (int i = 0; i < a; i++) {
cin >> d[i];
d[i] = b - d[i] * 0.006;
if (ans > abs(c - d[i])) {
e = i + 1;
ans = min(ans, abs(c - d[i]));
... | [
"assignment.change"
] | 1,015,295 | 1,015,296 | u902787159 | cpp |
p03220 | #include <cmath>
#include <iostream>
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];
double ave_T[1100];
for (int i = 0; i < N; i++) {
ave_T[i] = (T - H[i]) * 0.006;
}
double min = 11000;
int ind = 1;
for (int i = 0; i... | #include <cmath>
#include <iostream>
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];
double ave_T[1100];
for (int i = 0; i < N; i++) {
ave_T[i] = T - H[i] * 0.006;
}
double min = 11000;
int ind = 1;
for (int i = 0; i <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,297 | 1,015,298 | u481535882 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int ans;
int min = 10000000;
double com;
int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
com = t - (h[i] * 0.006);
if (abs(com - a) < min) {
ans = i;
min = abs(com -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int ans;
double min = 10000000;
double com;
double h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
com = t - (h[i] * 0.006);
if (abs(com - a) < min) {
ans = i;
min = ... | [
"variable_declaration.type.primitive.change"
] | 1,015,299 | 1,015,300 | u941284252 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int min = 100000, c, ans;
for (int i = 0; i < N; i++) {
if ((A * 1000 - T * 1000 + H[i] * 6) > 0)
c = A * 1000 - T * 1000 + H[i] * 6;
else
c =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int min = 100000000, c, ans;
for (int i = 0; i < N; i++) {
if ((A * 1000 - T * 1000 + H[i] * 6) > 0)
c = A * 1000 - T * 1000 + H[i] * 6;
else
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,307 | 1,015,308 | u368279380 | 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(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
double dif = 114514;
for (int i = 0; i < N; i++) {
if (abs(T - 0.006 * H[i] - A) < d... | #include <cmath>
#include <iostream>
#include <vector>
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];
}
int ans = 0;
double dif = 11451419;
for (int i = 0; i < N; i++) {
if (abs(T - 0.006 * H[i] - A) <... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 1,015,313 | 1,015,314 | u254766083 | cpp |
p03220 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,317 | 1,015,318 | u811004127 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long... | [
"variable_declaration.type.primitive.change"
] | 1,015,319 | 1,015,320 | u030992242 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 999999999;
int ans1;
for (int i = 0; i < N; i++) {
if (ans > abs((T * 1000 - H[i] * 6) - A * 1000)) {
ans =... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 999999999;
int ans1;
for (int i = 0; i < N; i++) {
if (ans > abs((T * 1000 - H[i] * 6) - A * 1000)) {
ans =... | [
"assignment.change"
] | 1,015,323 | 1,015,324 | u535810324 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
h.push_back(temp);
}
int ans = 0;
int abs_min = 999999;
for (int i = 0; i < n; i++) {
if (abs(a... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
h.push_back(temp);
}
int ans = 0;
float abs_min = 999999;
for (int i = 0; i < n; i++) {
if (abs... | [
"variable_declaration.type.primitive.change",
"assignment.change",
"expression.operation.binary.remove",
"control_flow.branch.if.add"
] | 1,015,325 | 1,015,326 | u507749492 | cpp |
p03220 | #include <cstdlib>
#include <iostream>
using namespace std;
using std::swap;
int main() {
int n, t, a, h, p;
int m = 10000;
cin >> n;
cin >> t >> a;
a *= 1000;
for (int i = 0; i < n; ++i) {
cin >> h;
h = (t - h * 0.006) * 1000;
if (m > abs(a - h)) {
m = abs(a - h);
p = i + 1;
}
... | #include <cstdlib>
#include <iostream>
using namespace std;
using std::swap;
int main() {
int n, t, a, h, p;
int m = 1000000000;
cin >> n;
cin >> t >> a;
a *= 1000;
for (int i = 0; i < n; ++i) {
cin >> h;
h = (t - h * 0.006) * 1000;
if (m > abs(a - h)) {
m = abs(a - h);
p = i + 1;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,331 | 1,015,332 | u196471026 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, a, diff, ans;
cin >> N >> t >> a;
vector<int> s(N);
vector<int> kion(N);
vector<float> dif(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
kion[i] = t - s[i] * 0.006;
dif[i] = abs(a - kion[i]);
}
diff = dif[0];
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, a, ans;
float diff;
cin >> N >> t >> a;
vector<int> s(N);
vector<float> kion(N);
vector<float> dif(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
kion[i] = t - s[i] * 0.006;
dif[i] = abs(a - kion[i]);
}
diff = dif[0];
... | [
"variable_declaration.remove",
"variable_declaration.add",
"variable_declaration.type.primitive.change"
] | 1,015,335 | 1,015,336 | u812498271 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, a, diff, ans;
cin >> N >> t >> a;
vector<int> s(N);
vector<float> kion(N);
vector<float> dif(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
kion[i] = t - s[i] * 0.006;
dif[i] = abs(a - kion[i]);
}
diff = dif[0];
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, a, ans;
float diff;
cin >> N >> t >> a;
vector<int> s(N);
vector<float> kion(N);
vector<float> dif(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
kion[i] = t - s[i] * 0.006;
dif[i] = abs(a - kion[i]);
}
diff = dif[0];
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,015,337 | 1,015,336 | u812498271 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, T, A, tmp, m = 1e9, idx;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (m > (1000 * A - (1000 * T - tmp * 6))) {
m = 10... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, T, A, tmp, m = 1e9, idx;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (m > abs(1000 * A - (1000 * T - tmp * 6))) {
m =... | [
"call.add",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,338 | 1,015,339 | u831873811 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int n, t, a;
float h[1010];
float m = 100000000;
int main() {
int tmp;
int ans;
float dif;
cin >> n;
cin >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> tmp;
dif = fabs((t - 0.006 * tmp) - t);
if (m > dif) {
m = dif;
an... | #include <cmath>
#include <iostream>
using namespace std;
int n, t, a;
float h[1010];
float m = 100000000;
int main() {
int tmp;
int ans;
float dif;
cin >> n;
cin >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> tmp;
dif = fabs((t - 0.006 * tmp) - a);
if (m > dif) {
m = dif;
an... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,347 | 1,015,348 | u192273224 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int n, t, a;
float h[1010];
float m = 100000;
int main() {
int tmp;
int ans;
float dif;
cin >> n;
cin >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> tmp;
dif = fabs((t - 0.006 * tmp) - t);
if (m > dif) {
m = dif;
ans =... | #include <cmath>
#include <iostream>
using namespace std;
int n, t, a;
float h[1010];
float m = 100000000;
int main() {
int tmp;
int ans;
float dif;
cin >> n;
cin >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> tmp;
dif = fabs((t - 0.006 * tmp) - a);
if (m > dif) {
m = dif;
an... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,349 | 1,015,348 | u192273224 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
double T;
double A;
cin >> N >> T >> A;
vector<int> H(N);
REP(i, N) cin >> H[i];
int ans = -1;
int mnd = 10000000;
for (in... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
double T;
double A;
cin >> N >> T >> A;
vector<int> H(N);
REP(i, N) cin >> H[i];
int ans = -1;
double mnd = 10000000;
for ... | [
"variable_declaration.type.primitive.change"
] | 1,015,350 | 1,015,351 | u520129469 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int solve(int64_t n, int64_t t, std::vector<int64_t> hs) {
int ret;
int64_t diff = INT64_MAX;
for (int i = 0; i < n; ++i) {
int64_t const average = hs[i] * 6;
if (average < diff) {
diff = average;
ret = i + 1;
}
}
return ret;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
int solve(int64_t n, int64_t t, std::vector<int64_t> hs) {
int ret;
int64_t diff = INT64_MAX;
for (int i = 0; i < n; ++i) {
int64_t const average = abs(t - hs[i] * 6);
if (average < diff) {
diff = average;
ret = i + 1;
}
}
return ret;
}
... | [
"call.add",
"call.arguments.change"
] | 1,015,352 | 1,015,353 | u478530879 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
int min = d.at(0), res = 1;
for (int i = 1; i < N; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
double min = d.at(0);
int res = 1;
for (int i = 1... | [
"variable_declaration.type.primitive.change"
] | 1,015,364 | 1,015,365 | u652009496 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
int min = d.at(0), res = 1;
for (int i = 0; i < N; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
double min = d.at(0);
int res = 1;
for (int i = 1... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,015,367 | 1,015,365 | u652009496 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
int min = d.at(0), res = 1;
for (int i = 0; i < N -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> t(N);
vector<double> d(N);
for (int i = 0; i < N; i++) {
int H;
cin >> H;
t.at(i) = T - 0.006 * H;
d.at(i) = abs(A - t.at(i));
}
double min = d.at(0);
int res = 1;
for (int i = 1... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,015,368 | 1,015,365 | u652009496 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float T, A;
cin >> N;
cin >> T >> A;
float m = 1000;
int ans = 0;
float h;
for (int i = 0; i < N; i++) {
cin >> h;
if ((A - T + h * 0.0006) < m) {
m = A - T + h * 0.0006;
ans = i + 1;
}
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float T, A;
cin >> N;
cin >> T >> A;
float m = 1000;
int ans = 0;
float h;
for (int i = 0; i < N; i++) {
cin >> h;
if (abs(A - T + h * 0.006) < m) {
m = abs(A - T + h * 0.006);
ans = i + 1;
}
}
cout << ans ... | [
"call.add",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,015,377 | 1,015,378 | u346812984 | cpp |
p03220 | #include <algorithm>
#include <iostream>
using namespace std;
int f(int x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
int N, T, A, ans = 0;
double cnt = 987654321;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
if (f(T - A - a * 6 / 1000) < cnt) {
cn... | #include <algorithm>
#include <iostream>
using namespace std;
double f(double x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
double N, T, A, ans = 0, cnt = 987654321;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
double a;
cin >> a;
if (f(T - A - a * 6 / 1000) < cnt) {
... | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 1,015,379 | 1,015,380 | u372428887 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a = 0;
cin >> n;
cin >> t >> a;
double min = 9999;
double x = 0;
int res = 1;
for (int i = 0; i < n; i++) {
double h = 0;
cin >> h;
x = fabs(a - (t - h * 0.006));
if (x < min) {
min = x;
res = i;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a = 0;
cin >> n;
cin >> t >> a;
double min = 9999;
double x = 0;
int res = 1;
for (int i = 0; i < n; i++) {
double h = 0;
cin >> h;
x = fabs(a - (t - h * 0.006));
if (x < min) {
min = x;
res = i + 1;
}
... | [
"assignment.change"
] | 1,015,396 | 1,015,397 | u416964274 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a = 0;
cin >> n;
cin >> t >> a;
double min = 9999;
double x = 0;
int res = 1;
for (int i = 0; i < n; i++) {
double h = 0;
cin >> h;
x = abs(a - (t - h * 0.006));
if (x < min) {
min = x;
res = i;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a = 0;
cin >> n;
cin >> t >> a;
double min = 9999;
double x = 0;
int res = 1;
for (int i = 0; i < n; i++) {
double h = 0;
cin >> h;
x = fabs(a - (t - h * 0.006));
if (x < min) {
min = x;
res = i + 1;
}
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change"
] | 1,015,398 | 1,015,397 | u416964274 | cpp |
p03220 | // A.cpp
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
double Absv(double value) {
if (value >= 0)
return value;
else
return -value;
}
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i+... | // A.cpp
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
double Absv(double value) {
if (value >= 0)
return value;
else
return -value;
}
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i+... | [
"call.arguments.change"
] | 1,015,399 | 1,015,400 | u837654535 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t;
double a;
cin >> n >> t >> a;
int h[n];
double tem, mini = 111;
int ans;
for (int i = 0; i < n; i++) {
cin >> h[i];
tem = t - 0.006 * h[i];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t;
double a;
cin >> n >> t >> a;
int h[n];
double tem, mini = 10000;
int ans;
for (int i = 0; i < n; i++) {
cin >> h[i];
tem = t - 0.006 * h[i];... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,401 | 1,015,402 | u033620890 | cpp |
p03220 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t;
double a;
cin >> n >> t >> a;
int h[n];
double tem, mini = 111;
int ans;
for (int i = 0; i < n; i++) {
cin >> h[i];
tem = t - 0.006 * h[i];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t;
double a;
cin >> n >> t >> a;
int h[n];
double tem, mini = 10000;
int ans;
for (int i = 0; i < n; i++) {
cin >> h[i];
tem = t - 0.006 * h[i];... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,403 | 1,015,402 | u033620890 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
int H[N];
double C[N], Abs[N];
for (int i(0); i < N; i++) {
cin >> H[i];
C[i] = T - H[i] * 0.006;
if (C[i] > A)
Abs[i] = C[i] - A;
else
Abs[i] = A - C[i];
}
int min(Abs[0]);
int t(0);
... | #include <iostream>
using namespace std;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
int H[N];
double C[N], Abs[N];
for (int i(0); i < N; i++) {
cin >> H[i];
C[i] = T - H[i] * 0.006;
if (C[i] > A)
Abs[i] = C[i] - A;
else
Abs[i] = A - C[i];
}
double min(Abs[0]);
int t(0)... | [
"variable_declaration.type.primitive.change"
] | 1,015,404 | 1,015,405 | u144692457 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define INF 1e18
signed main() {
int n, t, a;
cin >> n >> t >> a;
int deg = INF;
int ans = 1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define INF 1e18
signed main() {
double n, t, a;
cin >> n >> t >> a;
double deg = INF;
int ans = 1;
for (int i = 0; i < n; i++) {
double h;
cin >... | [
"variable_declaration.type.primitive.change"
] | 1,015,406 | 1,015,407 | u032189172 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
int c = 6000;
vector<ll> h(n, 0);
for (int i = 0; i < n; i+... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, t, a;
cin >> n >> t >> a;
int c = 1000;
vector<ll> h(n, 0);
for (int i = 0; i < n; i+... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,015,408 | 1,015,409 | u656679572 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int N;
int T, A;
int H[2000];
int AT[2000];
int ans = 1000000;
int num;
int main() {
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
AT[i] = T - H[i] * 0.006;
}
for (int i = 0; i < N; i++) {
if (ans > abs(AT[i] - A)) {
ans ... | #include <bits/stdc++.h>
using namespace std;
int N;
double T, A;
double H[2000];
double AT[2000];
double ans = 1000000;
int num;
int main() {
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
AT[i] = T - H[i] * 0.006;
}
for (int i = 0; i < N; i++) {
if (ans > abs(AT[i] - A)) ... | [
"variable_declaration.type.primitive.change"
] | 1,015,416 | 1,015,417 | u281168735 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(0);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | [
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,428 | 1,015,427 | u339937125 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,015,429 | 1,015,427 | u339937125 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(0);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int k, l = 1;
if (A * 1000 < T * 1000 - height[0] * 6) {
k = T * 1000 - height[0] * 6 - A * 1000;
} else {
k = A * 1000 - T * 1... | [
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.co... | 1,015,430 | 1,015,427 | u339937125 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [
"variable_declaration.type.change",
"call.add"
] | 1,015,439 | 1,015,440 | u366676780 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main() {
int n;
int t, a;
int h[1002];
cin >> n;
cin >> t >> a;
rep(i, n) { cin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main() {
int n;
int t, a;
int h[1002];
cin >> n;
cin >> t >> a;
rep(i, n) { cin... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,441 | 1,015,442 | u783922005 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main() {
int n;
int t, a;
int h[1001];
cin >> n;
cin >> t >> a;
rep(i, n) { cin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main() {
int n;
int t, a;
int h[1002];
cin >> n;
cin >> t >> a;
rep(i, n) { cin... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 1,015,443 | 1,015,442 | u783922005 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
int T, A;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int k = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - v.at(0) * 0.006)) > abs(A - (T - v... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
int T, A;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
int k = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - v.at(k) * 0.006)) > abs(A - (T - v... | [
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 1,015,446 | 1,015,447 | u888888584 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
double ab(double x, double y) {
if (x > y)
return x - y;
else
return y - x;
}
int main() {
int n, t, a, ans;
cin >> n >> t >> a;
vector<int> hi(n);
for (int i = 0; i < n; i++)
cin >> hi[i];
double oo = 100000;
for (int i = 0; i < n; i++) {
d... | #include <bits/stdc++.h>
using namespace std;
double ab(double x, double y) {
if (x > y)
return x - y;
else
return y - x;
}
int main() {
int n, t, a, ans;
cin >> n >> t >> a;
vector<int> hi(n);
for (int i = 0; i < n; i++)
cin >> hi[i];
double oo = 100000;
for (int i = 0; i < n; i++) {
d... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,015,450 | 1,015,451 | u057079894 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int H[1000];
int res = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
for (int i = 0; i < N; ++i) {
if (abs(A - (T - H[res] * 0.006)) > abs(A - (T - H[i] * 0.006)))
res = i;
}
cout <<... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int H[1000];
int res = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
for (int i = 0; i < N; ++i) {
if (abs(A - (T - H[res] * 0.006)) > abs(A - (T - H[i] * 0.006)))
res = i;
}
cout <<... | [
"expression.operation.binary.add"
] | 1,015,452 | 1,015,453 | u175701055 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
long h;
int main() {
scanf("%d", &n);
scanf("%d%d", &t, &a);
int close = 1e5;
int tmp = 0;
int cidx = 0;
for (int i = 0; i < n; i++) {
scanf("%ld", &h);
tmp = t - h * 0.006;
if (abs(tmp - a) < close) {
cidx = i;
close = abs... | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
long h;
int main() {
scanf("%d", &n);
scanf("%d%d", &t, &a);
double close = 1e5;
double tmp = 0;
int cidx = 0;
for (int i = 0; i < n; i++) {
scanf("%ld", &h);
tmp = t - h * 0.006;
if (abs(tmp - a) < close) {
cidx = i;
close... | [
"variable_declaration.type.primitive.change"
] | 1,015,454 | 1,015,455 | u570486288 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a, h;
int main() {
scanf("%d", &n);
scanf("%d%d", &t, &a);
int close = 1e5;
int tmp = 0;
int cidx = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &h);
tmp = t - h * 0.006;
if (abs(tmp - a) < close) {
cidx = i;
close = abs(tmp -... | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
long h;
int main() {
scanf("%d", &n);
scanf("%d%d", &t, &a);
double close = 1e5;
double tmp = 0;
int cidx = 0;
for (int i = 0; i < n; i++) {
scanf("%ld", &h);
tmp = t - h * 0.006;
if (abs(tmp - a) < close) {
cidx = i;
close... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 1,015,456 | 1,015,455 | u570486288 | cpp |
p03220 | #include <bits/stdc++.h>
typedef long long int LL;
using namespace std;
#define INF (1e9)
#define LINF (1LL << 60)
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, k, n) for (int i = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define F ... | #include <bits/stdc++.h>
typedef long long int LL;
using namespace std;
#define INF (1e9)
#define LINF (1LL << 60)
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, k, n) for (int i = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define F ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,015,459 | 1,015,460 | u655503310 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 99999999999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
ll diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 9999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
float diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h - a... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change"
] | 1,015,466 | 1,015,467 | u608499300 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 999999999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
ll diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h -... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 9999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
float diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h - a... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change"
] | 1,015,468 | 1,015,467 | u608499300 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 999999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
ll diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h - a)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 9999999
using namespace std;
int main() {
ll n, t, a;
cin >> n >> t >> a;
ll h, ans;
float diff = INF;
REP(i, n) {
cin >> h;
if (abs(t - 0.006 * h - a) < diff) {
diff = abs(t - 0.006 * h - a... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change"
] | 1,015,469 | 1,015,467 | u608499300 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
signed long long N;
double T, A;
cin >> N >> T >> A;
int num = -1;
double d_min = 10e15;
for (int i = 0; i < N; i++) {
signed long long H;
cin >> H;
double tmp = T - H * 0.006;
double d = abs(A - tmp);
if (d < d_min) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
signed long long N;
double T, A;
cin >> N >> T >> A;
int num = -1;
double d_min = 10e15;
for (int i = 0; i < N; i++) {
signed long long H;
cin >> H;
double tmp = T - H * 0.006;
double d = abs(A - tmp);
if (d < d_min) {
... | [
"expression.operation.binary.add"
] | 1,015,478 | 1,015,479 | u794246018 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 1000000.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - (0.006 * H[i]);
gap = abs(A - av... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 1000000.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - (0.006 * H[i]);
gap = abs(A - av... | [
"assignment.change"
] | 1,015,480 | 1,015,481 | u685126230 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - 0.006 * H[i];
gap = abs(A - ave);
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 1000000.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - (0.006 * H[i]);
gap = abs(A - av... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,482 | 1,015,481 | u685126230 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - 0.006 * H[i];
gap = abs(A - ave);
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, T;
int H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 1000000.0;
int place = 0;
for (int i = 0; i < N; i++) {
double gap, ave;
ave = T - (0.006 * H[i]);
gap = abs(A - av... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,015,483 | 1,015,481 | u685126230 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
int h[1000];
int tem_delta[1000];
int tem_delta2[1000];
int main() {
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
tem_delta[i] = abs(t - 0.006 * h[i] - a);
tem_delta2[i] = tem_del... | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
long int h[1000];
double tem_delta[1000];
double tem_delta2[1000];
int main() {
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
tem_delta[i] = abs(t - 0.006 * h[i] - a);
tem_delta2[i... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 1,015,490 | 1,015,491 | u450869728 | cpp |
p03220 | #include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
double a, t;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
double a, t;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < ... | [
"assignment.change"
] | 1,015,492 | 1,015,493 | u393187783 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
float i, n, t, a, m = 1000000, p, l;
cin >> n >> t >> a;
for (i = 0; i < n; i++) {
cin >> l;
if (m > abs(a - ((t - l) * 0.006))) {
m = abs(a - ((t - l) * 0.006));
p = i + 1;
}
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float i, n, t, a, m = 1000000, p, l;
cin >> n >> t >> a;
for (i = 0; i < n; i++) {
cin >> l;
if (m > abs(a - (t - l * 0.006))) {
m = abs(a - (t - l * 0.006));
p = i + 1;
}
}
cout << p << endl;
} | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,494 | 1,015,495 | u452655263 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int min = 20000;
int t;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (abs(A - (T - x * 0.006)) < min) {
t = i + 1;
min = abs(A - (T - x * 0.006));
}
// cout << abs... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double min = 20000;
int t;
for (int i = 0; i < N; i++) {
double x;
cin >> x;
if (abs(A - (T - x * 0.006)) < min) {
t = i + 1;
min = abs(A - (T - x * 0.006));
}
// co... | [
"variable_declaration.type.primitive.change"
] | 1,015,498 | 1,015,499 | u104741254 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long T, A;
cin >> N >> T >> A;
long m = 10000;
long M;
int count;
long H;
for (int i = 1; i <= N; i++) {
cin >> H;
M = abs(T - H * 0.006 - A);
if (M < m) {
count = i;
m = M;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
double m = 1000000;
double M;
int count;
double H;
for (int i = 1; i <= N; i++) {
cin >> H;
M = abs(T - H * 0.006 - A);
if (M < m) {
count = i;
m = M;
}
}
cout << count << e... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,504 | 1,015,505 | u892438699 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int hoge = 100000;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
int temper = T * 1000 - H.at(i) * 6;
H.at(i) = abs(temper - A * 1000);
hoge = min(hoge, H.at(i));
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int hoge = 10000000;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
int temper = T * 1000 - H.at(i) * 6;
H.at(i) = abs(temper - A * 1000);
hoge = min(hoge, H.at(i));
}
for (int i =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,519 | 1,015,520 | u376859266 | cpp |
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
int main() {
int N;
double T, A, H[1001];
cin >> N >> T >> A;
cinf(N... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
int main() {
int N;
double T, A, H[1010];
cin >> N >> T >> A;
cinf(N... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 1,015,521 | 1,015,522 | u928536113 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A, h, x, ans = 1;
cin >> N >> T >> A >> h; // h地点での気温はT-0.006h
for (int i = 2; i < N + 1; i++) {
cin >> x;
if (abs(T - 0.006 * h - A) > abs(T - 0.006 * x - A)) {
ans = i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A, h, x, ans = 1;
cin >> N >> T >> A >> h; // h地点での気温はT-0.006h
for (int i = 2; i < N + 1; i++) {
cin >> x;
if (abs(T - 0.006 * h - A) > abs(T - 0.006 * x - A)) {
ans = i;
h = x;
}
}
cout << ans << endl;
} | [
"assignment.add"
] | 1,015,525 | 1,015,526 | u317711717 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
int diff = N_MAX;
cin >>... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
double diff = N_MAX;
cin... | [
"variable_declaration.type.primitive.change"
] | 1,015,527 | 1,015,528 | u221174888 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
int diff = N_MAX;
cin >>... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
double diff = N_MAX;
cin... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,015,529 | 1,015,528 | u221174888 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
double diff = N_MAX;
cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
typedef long long ll;
typedef long long int lli;
int main() {
int N, T, A, ans;
double diff = N_MAX;
cin... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,015,530 | 1,015,528 | u221174888 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)... | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,015,537 | 1,015,538 | u509680664 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
double temp(int a, int t, int x) {
return max(a - t + x * 0.006, -a + t - x * 0.006);
}
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
int min_temp = pow(10, 10);
int ans = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
double temp(int a, int t, int x) {
return max(a - t + x * 0.006, -a + t - x * 0.006);
}
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
double min_temp = pow(10, 10);
int ans = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,543 | 1,015,544 | u189404681 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
double temp(int a, int t, int x) {
return max(a - t + x * 0.006, -a + t - x * 0.006);
}
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
int min_temp = pow(10, 10);
int ans = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
double temp(int a, int t, int x) {
return max(a - t + x * 0.006, -a + t - x * 0.006);
}
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
double min_temp = pow(10, 10);
int ans = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,545 | 1,015,544 | u189404681 | 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 - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define ll long long
#define GREATER greater<int>()
using namespace std;
string pop_back(string... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define ll long long
#define GREATER greater<int>()
using namespace std;
string pop_back(string... | [
"call.add",
"call.arguments.change"
] | 1,015,553 | 1,015,554 | u069035678 | cpp |
p03220 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, t, a, i, minp;
double ans, h[1000], tmp[1000];
scanf("%d %d %d", &n, &t, &a);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (i = 0; i < n; i++) {
tmp[i] = t - h[i] * 0.006;
}
ans = 1000.0;
for (i = 0; i < n; i++) {
if (... | #include <math.h>
#include <stdio.h>
int main(void) {
int n, t, a, i, minp;
double ans, h[1000], tmp[1000];
scanf("%d %d %d", &n, &t, &a);
for (i = 0; i < n; i++) {
scanf("%lf", &h[i]);
}
for (i = 0; i < n; i++) {
tmp[i] = t - h[i] * 0.006;
}
ans = 1000.0;
for (i = 0; i < n; i++) {
if (a... | [
"literal.string.change",
"call.arguments.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,015,557 | 1,015,556 | u777773603 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 1,015,560 | 1,015,561 | u255001744 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,015,562 | 1,015,561 | u255001744 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
double zet(double x) {
if (x > 0) {
return x;
} else {
return -x;
}
}
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 min_gap = 1000000;
int m;
for (int i = 0; i < N; i+... | #include <bits/stdc++.h>
using namespace std;
double zet(double x) {
if (x > 0) {
return x;
} else {
return -x;
}
}
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 min_gap = 1000000;
int m;
for (int i = 0; i < N;... | [
"variable_declaration.type.primitive.change"
] | 1,015,566 | 1,015,567 | u525974535 | cpp |
p03220 | #include <cstdio>
int N, T, A, X;
int main() {
scanf("%d%d%d", &N, &T, &A);
int res = 0;
int cc = 10000;
for (int i = 1; i <= N; ++i) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
printf("%d\n", res);
} | #include <cstdio>
int N, T, A, X;
int main() {
scanf("%d%d%d", &N, &T, &A);
int res = 0;
int cc = 1000000;
for (int i = 1; i <= N; ++i) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
printf("%d\n", res);
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,570 | 1,015,571 | u420421811 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int temp[n + 1];
int min = 99999;
int index = -1;
for (int i = 0; i < n; i++) {
cin >> temp[i];
int temprature = t - temp[i] * 0.006;
int diff = abs(temprature - a);
if (diff < min) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int temp[n + 1];
float min = 99999;
int index = -1;
for (int i = 0; i < n; i++) {
cin >> temp[i];
float temprature = t - temp[i] * 0.006;
float diff = abs(temprature - a);
if (diff < min)... | [
"variable_declaration.type.primitive.change"
] | 1,015,572 | 1,015,573 | u387480576 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n;
double a[1001];
double T, A;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n;
double a[1001];
double T, A;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,015,577 | 1,015,578 | u064087840 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n;
double a[1001];
double T, A;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int n;
double a[1001];
double T, A;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,015,579 | 1,015,578 | u064087840 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int n, t, a, h, ans, tmp = 100000;
cin >> n >> t >> a;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int n, t, a, h, ans;
double tmp = 100000;
cin >> n >> t >> a;
for (int i = 0; i... | [
"variable_declaration.type.change"
] | 1,015,582 | 1,015,581 | u369212307 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h(1001);
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h.at(i);
double tmp = 100000, det;
int flag, deg;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
vector<int> h(1001);
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h.at(i);
double tmp = 100000, det, deg;
int flag;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,015,589 | 1,015,590 | u620242073 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long t, a;
cin >> n >> t >> a;
t * 1000;
int ans = -1;
a *= 1000;
int h;
long long tmp = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> h;
long long tt = abs(a - (t - h * 6));
if (tmp > tt) {
tmp = tt;
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long t, a;
cin >> n >> t >> a;
t = t * 1000;
int ans = -1;
a *= 1000;
int h;
long long tmp = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> h;
long long tt = abs(a - (t - h * 6));
if (tmp > tt) {
tmp = tt;
... | [
"assignment.change"
] | 1,015,600 | 1,015,601 | u221119670 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
double a;
cin >> t >> a;
int ans;
long long ansn = 0;
int h[1010];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans = 0;
ansn = abs(a - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (ansn > abs(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
double a;
cin >> t >> a;
int ans;
double ansn = 0;
int h[1010];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans = 0;
ansn = abs(a - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (ansn > abs(a - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,015,602 | 1,015,603 | u221119670 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
double a;
cin >> t >> a;
int ans;
long long ansn = 0;
int h[1010];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans = 0;
ansn = abs(a - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (ansn > abs(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
double a;
cin >> t >> a;
int ans;
double ansn = 0;
int h[1010];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans = 0;
ansn = abs(a - (t - h[0] * 0.006));
for (int i = 1; i < n; i++) {
if (ansn > abs(a - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"call.arguments.change"
] | 1,015,604 | 1,015,603 | u221119670 | cpp |
p03220 | #include <cmath>
#include <iostream>
#define max(X, Y) ((X) > (Y) ? (X) : (Y))
#define min(X, Y) ((X) < (Y) ? (X) : (Y))
#define abs(X) ((X) < 0 ? -1 * (X) : (X))
using namespace std;
typedef long long ll;
int main() {
ll n;
ll t, a;
ll ans = 0;
ll i;
ll h;
ll m = 1ll << 60ll;
cin >> n;
cin >> t >> ... | #include <cmath>
#include <iostream>
#define max(X, Y) ((X) > (Y) ? (X) : (Y))
#define min(X, Y) ((X) < (Y) ? (X) : (Y))
#define abs(X) ((X) < 0 ? -1 * (X) : (X))
using namespace std;
typedef long long ll;
int main() {
ll n;
ll t, a;
ll ans = 0;
ll i;
ll h;
ll m = 1ll << 60ll;
cin >> n;
cin >> t >> ... | [] | 1,015,606 | 1,015,607 | u683588090 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
int min = 100000;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int d = abs((T - (H * 0.006)) - A);
if (min > d) {
min = d;
ans = i + 1;
}
}
cout << ans <<... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
double min = 100000;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double d = abs((T - (H * 0.006)) - A);
if (min > d) {
min = d;
ans = i + 1;
}
}
cout << ... | [
"variable_declaration.type.primitive.change"
] | 1,015,610 | 1,015,609 | u901615543 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> sites(N, 0);
for (int i = 0; i < N; i++)
cin >> sites.at(i);
int smallestDiff = A + 1000;
int answer = 0;
for (int i = 0; i < N; i++) {
if (T - 0.006 * sites.at(i) >= A) {
if (T - 0.0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> sites(N, 0);
for (int i = 0; i < N; i++)
cin >> sites.at(i);
double smallestDiff = A + 1000;
int answer = 0;
for (int i = 0; i < N; i++) {
if (T - 0.006 * sites.at(i) >= A) {
if (T - ... | [
"variable_declaration.type.primitive.change"
] | 1,015,613 | 1,015,614 | u598501138 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int n, t;
int a;
int h[1010];
int main() {
cin >> n >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double res = INF;
int index = -1;
for (int i = 0; i < n; i++) {
double p = t - h[i] *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int n, t;
int a;
int h[1010];
int main() {
cin >> n >> t;
cin >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double res = INF;
int index = -1;
for (int i = 0; i < n; i++) {
double p = t - h[i] *... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,622 | 1,015,623 | u187153832 | 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<int> t(N);
int ans;
float mint = 1000;
for (int i = 0; i < N; i++) {
t.at(i) = abs(A - (T - h.at(i) * 0.006));
if (mint > ... | #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<float> t(N);
int ans;
float mint = 1000;
for (int i = 0; i < N; i++) {
t.at(i) = abs(A - (T - h.at(i) * 0.006));
if (mint ... | [
"variable_declaration.type.primitive.change"
] | 1,015,624 | 1,015,625 | u620735210 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.