problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
#define pff(a, b) printf("%d %d\n", a, b);
typedef lo... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
#define pff(a, b) printf("%d %d\n", a, b);
typedef lo... | [
"call.add",
"call.arguments.change"
] | 1,012,981 | 1,012,982 | u770486670 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 100000000... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 100000000... | [
"variable_declaration.type.primitive.change"
] | 1,012,983 | 1,012,984 | u912678856 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
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];
double min = 100000, min_index = 0;
for (int i = 0; i < n; i++) {
double ans = abs((t - h[i] * 0.006) - a);
if (min > ans) {
min ... | #include <bits/stdc++.h>
using namespace std;
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];
double min = 100000;
int min_index = 0;
for (int i = 0; i < n; i++) {
double ans = abs((t - h[i] * 0.006) - a);
if (min > ans) {
... | [
"assignment.value.change"
] | 1,012,985 | 1,012,986 | u023127434 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > abs(A - tmp)) {
dT = abs(A - tmp);
ans = i + 1;
}
}
std::cout <<... | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000.0, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > std::abs(A - tmp)) {
dT = std::abs(A - tmp);
ans = i + 1;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,991 | 1,012,992 | u301302814 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > abs(A - tmp)) {
dT = abs(A - tmp);
ans = i + 1;
}
}
std::cout <<... | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > std::abs(A - tmp)) {
dT = std::abs(A - tmp);
ans = i + 1;
}
}
st... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,993 | 1,012,994 | u944396627 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > abs(A - tmp)) {
dT = abs(A - tmp);
ans = i + 1;
}
}
std::cout <<... | #include <cmath>
#include <iostream>
int main(void) {
int N, ans = 0;
double dT = 1000, T, A;
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
double h, tmp;
std::cin >> h;
tmp = T - 0.006 * h;
if (dT > fabs(A - tmp)) {
dT = fabs(A - tmp);
ans = i + 1;
}
}
std::cout ... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,012,993 | 1,012,995 | u944396627 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
static const int INF = 1e9 + 7;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
static const int INF = 1e9 + 7;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ... | [
"assignment.change"
] | 1,013,001 | 1,013,002 | u274615057 | cpp |
p03220 | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, t, a;
double minavr = 100;
map<double, int> avr;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tmp = abs(t - h * 0.006 - a);
avr[tmp] = i + 1;
minavr = min(minavr, tmp);
}
cout << ... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, t, a;
double minavr = 1000;
map<double, int> avr;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tmp = abs(t - h * 0.006 - a);
avr[tmp] = i + 1;
minavr = min(minavr, tmp);
}
cout <<... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,003 | 1,013,004 | u553321223 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int min_idx = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = abs((t - h[i] * 0.006) - a);
if (h[min_idx] > h[i]) {
min_idx = i;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
int min_idx = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = abs((t - h[i] * 0.006) - a);
if (h[min_idx] > h[i]) {
min_idx = i;
}
}
... | [
"variable_declaration.type.primitive.change"
] | 1,013,005 | 1,013,006 | u209805379 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int min_diff = 10000000;
int ans = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int diff = abs(A - T + H * 0.006);
if (min(min_diff, diff) == diff) {
min_diff = diff;
ans = i +... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int min_diff = 10000000;
int ans = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int diff = 1000 * abs(A - T + H * 0.006);
if (min(min_diff, diff) == diff) {
min_diff = diff;
an... | [
"assignment.change"
] | 1,013,015 | 1,013,016 | u317560202 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
#define len(x) ((int)(x).size())
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rr... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
#define len(x) ((int)(x).size())
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rr... | [
"assignment.value.change",
"variable_declaration.type.change"
] | 1,013,017 | 1,013,018 | u043589043 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, i, index = 1, diff;
cin >> n >> t >> a;
cin >> h;
diff = abs((t - h * 0.006) - a);
for (i = 1; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) < diff) {
diff = abs((t - h * 0.006) - a);
index = i + 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, i, index = 1;
double diff;
cin >> n >> t >> a;
cin >> h;
diff = abs((t - h * 0.006) - a);
for (i = 1; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) < diff) {
diff = abs((t - h * 0.006) - a);
index = i + 1... | [
"variable_declaration.type.change"
] | 1,013,021 | 1,013,022 | u056848279 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, i, index = -1, diff;
cin >> n >> t >> a;
cin >> h;
diff = abs((t - h * 0.006) - a);
for (i = 1; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) < diff) {
diff = abs((t - h * 0.006) - a);
index = i + 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, i, index = 1;
double diff;
cin >> n >> t >> a;
cin >> h;
diff = abs((t - h * 0.006) - a);
for (i = 1; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) < diff) {
diff = abs((t - h * 0.006) - a);
index = i + 1... | [
"expression.operation.unary.arithmetic.remove"
] | 1,013,023 | 1,013,022 | u056848279 | 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 minIndex = -1;
int diff = pow(10, 9);
for (int i = 0; i < N; i++) {
auto j = T - H.at(i) * 0.006;
auto k = abs(A - j);
if (... | #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 minIndex = -1;
double diff = pow(10, 9);
for (int i = 0; i < N; i++) {
auto j = T - H.at(i) * 0.006;
auto k = abs(A - j);
i... | [
"variable_declaration.type.primitive.change"
] | 1,013,028 | 1,013,029 | u134156483 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<double> temp(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
temp.at(i) = t - h.at(i) * 0.006;
}
int min = abs(temp.at(0) - a), ans = 1;
for (int i = 1; i < n; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<double> temp(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
temp.at(i) = t - h.at(i) * 0.006;
}
double min = abs(temp.at(0) - a);
int ans = 1;
for (int i = 1; i < n; i++) {... | [
"variable_declaration.type.primitive.change"
] | 1,013,030 | 1,013,031 | u127370080 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | [
"call.function.change"
] | 1,013,032 | 1,013,033 | u645961531 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | [
"variable_declaration.type.change",
"call.function.change"
] | 1,013,034 | 1,013,033 | u645961531 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,013,035 | 1,013,036 | u608329742 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
std::vector<int> H(N);
for (auto &r : H) {
int t{0};
std::cin >> t;
r = std::abs(A - (T - (t * 0.006)));
}
int an... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
std::vector<double> H(N);
for (auto &r : H) {
int t{0};
std::cin >> t;
r = std::abs(A - (T - (t * 0.006)));
}
int... | [
"variable_declaration.type.primitive.change"
] | 1,013,042 | 1,013,043 | u917678406 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
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 near = 0;
int tmp;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int N;
double T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int near = 0;
double ... | [
"variable_declaration.type.primitive.change"
] | 1,013,044 | 1,013,045 | u127228093 | cpp |
p03220 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N, T, A;
cin >> N >> T >> A;
int d = INF, h = -1;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int n = T - H * 0.006... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N, T, A;
cin >> N >> T >> A;
double d = INF, h = -1;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double n = (double... | [
"variable_declaration.type.primitive.change"
] | 1,013,046 | 1,013,047 | u295279251 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, x) for (int i = 0; i < x; i++)
#define put(ans) cout << ans << endl;
int main() {
double n, t, a;
cin >> n >> t >> a;
int ans, min(100000);
rep(i, n) {
double h;
cin >> h;
h = t - (h * 0.006);
if (min > abs(a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, x) for (int i = 0; i < x; i++)
#define put(ans) cout << ans << endl;
int main() {
int n, t, a;
cin >> n >> t >> a;
double ans, min(100000);
rep(i, n) {
double h;
cin >> h;
h = t - (h * 0.006);
if (min > abs(a ... | [
"variable_declaration.type.primitive.change"
] | 1,013,048 | 1,013,049 | u662871912 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int res = 0;
int manko = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> h;
int K = 1000 * t - 1000 * h * 6 - 1000 * a;
if (K < 0)
K = -K;
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int res = 0;
int manko = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> h;
int K = 1000 * t - h * 6 - 1000 * a;
if (K < 0)
K = -K;
if (manko >... | [
"expression.operation.binary.remove"
] | 1,013,054 | 1,013,055 | u025469035 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int res = 0;
int manko = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> h;
int K = 1000 * t - 1000 * h * 6;
if (K < 0)
K = -K;
if (manko > K) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int res = 0;
int manko = 1e9;
for (int i = 1; i <= n; ++i) {
cin >> h;
int K = 1000 * t - h * 6 - 1000 * a;
if (K < 0)
K = -K;
if (manko >... | [
"expression.operation.binary.remove"
] | 1,013,056 | 1,013,055 | u025469035 | cpp |
p03220 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int Max = 10000000;
int main... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int Max = 10000000;
int main... | [
"variable_declaration.type.primitive.change"
] | 1,013,057 | 1,013,058 | u510989601 | cpp |
p03220 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
vector<int> H;
cin >> N;
cin >> T;
cin >> A;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 0;
float t = abs(A - T + H[0] * 0.006);
for (int i = 0; i < N; ++i) {
i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
vector<int> H;
cin >> N;
cin >> T;
cin >> A;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 0;
float t = abs(A - T + H[0] * 0.006);
for (int i = 0; i < N; ++i) {
i... | [
"call.add",
"call.arguments.change"
] | 1,013,066 | 1,013,067 | u818542539 | cpp |
p03220 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
vector<int> H;
cin >> N;
cin >> T;
cin >> A;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 0;
int t = abs(A - T + H[0] * 0.006);
for (int i = 0; i < N; ++i) {
if ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
vector<int> H;
cin >> N;
cin >> T;
cin >> A;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 0;
float t = abs(A - T + H[0] * 0.006);
for (int i = 0; i < N; ++i) {
i... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,013,068 | 1,013,067 | u818542539 | cpp |
p03220 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) min_element(all(x))
using namespace std;
int main(void)
{
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) min_element(all(x))
using namespace std;
int main(void)
{
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,069 | 1,013,070 | u110044127 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, string>;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> A(n);
rep(i, n) {
int h;
cin >> h;
A.at(i) = abs(a - (t - h * 0.006));
}
int ans;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, string>;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> A(n);
rep(i, n) {
int h;
cin >> h;
A.at(i) = abs(a - (t - h * 0.006));
}
int ans;
... | [
"variable_declaration.type.primitive.change"
] | 1,013,079 | 1,013,080 | u425086757 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n, t, a;
cin >> n;
cin >> t >> a;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> ar... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n, t, a;
cin >> n;
cin >> t >> a;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> ar... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,084 | 1,013,085 | u924587805 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n, t, a;
cin >> n;
cin >> t >> a;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> ar... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <climits>
using namespace std;
int main()
{
int n, t, a;
cin >> n;
cin >> t >> a;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> ar... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,013,086 | 1,013,085 | u924587805 | cpp |
p03220 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | [
"variable_declaration.type.change"
] | 1,013,087 | 1,013,088 | u924935170 | cpp |
p03220 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
double t, a;
cin >> t >> a;
double ss = 1000000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
double h;
cin >> h;
double k = t - h * 0.006;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double n;
cin >> n;
double t, a;
cin >> t >> a;
double ss = 1000000000;
int ans = 0;
for (int i = 1; i <= n; i++) {
double h;
cin >> h;
double k = t - h * 0.006;
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,089 | 1,013,090 | u047572420 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
vector<dou... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, T, A;
cin >> N >> T >> A;
vector<dou... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,091 | 1,013,092 | u115454768 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
long double min_wk = 100;
int point;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
long double temp = abs(t - h * 0.006 - a);
if (temp < min_wk) {
min_wk = temp;
point = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
long double min_wk = 10000000000;
int point;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
long double temp = abs(t - h * 0.006 - a);
if (temp < min_wk) {
min_wk = temp;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,095 | 1,013,096 | u729703601 | cpp |
p03220 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,013,097 | 1,013,098 | u742595961 | cpp |
p03220 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = ... | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,013,099 | 1,013,098 | u742595961 | cpp |
p03220 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
double t, a;
cin >> n >> t >> a;
vector<int> v(n);
rep(i, n) cin >> v[i];
int id... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
double t, a;
cin >> n >> t >> a;
vector<int> v(n);
rep(i, n) cin >> v[i];
int id... | [
"call.arguments.change"
] | 1,013,100 | 1,013,101 | u657208344 | 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 dtemp;
int mini = abs((T - H.at(0) * 0.006) - A);
int mini_i = 0;
for (int i = 1; i < N; i++) {
dtemp = 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 dtemp;
double mini = abs((T - H.at(0) * 0.006) - A);
int mini_i = 0;
for (int i = 1; i < N; i++) {
dtemp = abs((T - H.at(i) * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,013,104 | 1,013,105 | u180824420 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
/*
float abs(float x) {
if(x < 0) return -1*x;
else{return x;}
}*/
int main() {
int N, T, A;
cin >> N >> T >> A;
int H;
int ind = 0;
double min = 10000000;
for (int i = 0; i < N; ++i) {
cin >> H;
double temp = abs(float(T) - float(H) * 0.006);
... | #include <bits/stdc++.h>
using namespace std;
/*
float abs(float x) {
if(x < 0) return -1*x;
else{return x;}
}*/
int main() {
int N, T, A;
cin >> N >> T >> A;
int H;
int ind = 0;
double min = 10000000;
for (int i = 0; i < N; ++i) {
cin >> H;
double temp = (float(T) - float(H) * 0.006);
... | [] | 1,013,106 | 1,013,107 | u979271657 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, x;
cin >> t >> x;
vector<double> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
double ans = 1e9;
int index = 0;
for (int i = 0; i < n; ++i) {
double p = abs(x - t - v[i] * 0.006);
if (p < ans) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, x;
cin >> t >> x;
vector<double> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
double ans = 1e9;
int index = 0;
for (int i = 0; i < n; ++i) {
double p = abs(x - t + v[i] * 0.006);
// cout << p << ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,108 | 1,013,109 | u403668916 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, A;
cin >> n >> t >> A;
int a[n];
int mx = 1e9, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
int x = t - a[i] * 0.006;
if (abs(A - x) < mx) {
mx = abs(A - x);
ans = i + 1;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, A;
cin >> n >> t >> A;
double a[n];
double mx = 1e9, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
double x = t - a[i] * 0.006;
if (abs(A - x) < mx) {
mx = abs(A - x);
ans = i + 1;
}
}
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 1,013,116 | 1,013,117 | u002627851 | 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 = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
if (min > abs(A - (T - H[i] * 0.006))) {
min = abs(A - (T - H[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[i];
double min = 1000;
int ans = 0;
for (int i = 0; i < N; i++) {
if (min > abs(A - (T - H[i] * 0.006))) {
min = abs(A - (T - H[i] * 0.006));
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,121 | 1,013,122 | u667694979 | 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() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int ans = -1, mh = 1001001001;
rep(i, n) cin >> h.at(i);
rep(i, n) {
ll d = (ll)1000 * a - (1000 * t - 6 * h.at(i));
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int ans = -1, mh = 1001001001;
rep(i, n) cin >> h.at(i);
rep(i, n) {
int d = abs(1000 * a - (1000 * t - 6 * h.at(i)));
... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 1,013,125 | 1,013,126 | u171336585 | 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() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int ans = -1, mh = 1001001001;
rep(i, n) cin >> h.at(i);
rep(i, n) {
int d = 1000 * a - (1000 * t - 6 * h.at(i));
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int ans = -1, mh = 1001001001;
rep(i, n) cin >> h.at(i);
rep(i, n) {
int d = abs(1000 * a - (1000 * t - 6 * h.at(i)));
... | [
"call.add",
"call.arguments.change"
] | 1,013,127 | 1,013,126 | u171336585 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,013,128 | 1,013,129 | u011716617 | cpp |
p03220 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int min = 114514;
int ans = 1;
for (int i = 0; i < N; i++) {
float sa = A - T + 0.006 * h[i];
if (sa < 0)
sa = 0 -... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
float min = 114514;
int ans = 1;
for (int i = 0; i < N; i++) {
float sa = A - T + 0.006 * h[i];
if (sa < 0)
sa = 0... | [
"variable_declaration.type.primitive.change"
] | 1,013,130 | 1,013,131 | u279652141 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
double ret;
cin >> N >> T >> A;
int ans;
int t = 1000;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (t > abs(A - (T - x * 0.006))) {
t = abs(A - (T - x * 0.006));
ans = i + 1;
}
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans;
double t = 1000;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (t > abs(A - (T - x * 0.006))) {
t = abs(A - (T - x * 0.006));
ans = i + 1;
}
}
cout << ans << endl;
}
| [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 1,013,132 | 1,013,133 | u364617376 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int gp;
double t = 120;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (abs(A - (T - x * 0.006)) < t) {
t = abs(A - (T - x * 0.006));
gp = i + 1;
}
}
cout << gp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int gp;
double t = 1000;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (abs(A - (T - x * 0.006)) < t) {
t = abs(A - (T - x * 0.006));
gp = i + 1;
}
}
cout << gp << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,134 | 1,013,135 | u934462215 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | [
"expression.operation.binary.remove"
] | 1,013,136 | 1,013,137 | u296160120 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,013,138 | 1,013,137 | u296160120 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,013,139 | 1,013,137 | u296160120 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int key = 0;
int res = 0;
int ans = 100100;
vector<P> p(n);
rep(i, n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int key = 0;
int res = 0;
int ans = 100100100;
vector<P> p(n);
rep(i... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove",
"assignment.change"
] | 1,013,146 | 1,013,147 | u139255323 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [
"variable_declaration.type.primitive.change"
] | 1,013,148 | 1,013,149 | u531461815 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,013,150 | 1,013,149 | u531461815 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, t;
cin >> n >> t >> a;
vector<int> h(n);
int cc = 1 << 30;
int res = 0;
for (int i = 0; i < n; i++) {
int d;
cin >> h[i];
d = (t * 1000 - h[i] * 6) - (a * 1000);
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, t;
cin >> n >> t >> a;
vector<int> h(n);
int cc = 1 << 30;
int res = 0;
for (int i = 0; i < n; i++) {
int d;
cin >> h[i];
d = (t * 1000 - h[i] * 6) - a * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i ... | [
"assignment.change"
] | 1,013,155 | 1,013,156 | u351148423 | cpp |
p03220 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"call.arguments.change"
] | 1,013,158 | 1,013,159 | u882039496 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
double nearest = 200;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs(A - (T - H * 0.006)) < nearest) {
ans = i;
nearest = abs(A - (T - H * 0.006));
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
double nearest = 300000;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs(A - (T - H * 0.006)) < nearest) {
ans = i;
nearest = abs(A - (T - H * 0.006));
}
}... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,164 | 1,013,165 | u016119075 | cpp |
p03220 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | [
"variable_declaration.type.primitive.change"
] | 1,013,166 | 1,013,167 | u616794313 | 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);
}
vector<int> tem(N);
for (int i = 0; i < N; i++) {
tem.at(i) = 1000 * T - 6 * vec.at(i);
}
int num = 0;
int hi = tem.at(0);
f... | #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);
}
vector<int> tem(N);
for (int i = 0; i < N; i++) {
tem.at(i) = 1000 * T - 6 * vec.at(i);
}
int num = 0;
double hi = tem.at(0);
... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,013,168 | 1,013,169 | u642497480 | 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);
}
vector<int> tem(N);
for (int i = 0; i < N; i++) {
tem.at(i) = 1000 * T - 6 * vec.at(i);
}
int num = 0;
int hi = tem.at(0);
f... | #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);
}
vector<int> tem(N);
for (int i = 0; i < N; i++) {
tem.at(i) = 1000 * T - 6 * vec.at(i);
}
int num = 0;
int hi = tem.at(0);
f... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,013,168 | 1,013,170 | u642497480 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 1,013,171 | 1,013,172 | u976940619 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, T, A, res;
double Tc, Min = 10000000;
cin >> N >> T >> A;
long H[N];
for (long i = 0; i < N; i++) {
cin >> H[i];
Tc = T * 1000 - H[i] * 6;
if (abs(Tc - A * 1000) < Min) {
Min = abs(Tc - A);
res = i + 1;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, T, A, res, Tc, Min = 1000000000;
cin >> N >> T >> A;
long H[N];
for (long i = 0; i < N; i++) {
cin >> H[i];
Tc = T * 1000 - H[i] * 6;
if (abs(Tc - A * 1000) < Min) {
Min = abs(Tc - A * 1000);
res = i + 1;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,013,173 | 1,013,174 | u410888565 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
T *= 1000, A *= 1000;
int k = 0, l = 0;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (k > abs(A - (T - H * 6))) {
k = abs(A - (T - H * 6));
l = i;
}
}
cout << l + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
T *= 1000, A *= 1000;
int k = 100000000, l = 0;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (k > abs(A - (T - H * 6))) {
k = abs(A - (T - H * 6));
l = i;
}
}
cout << l << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,013,175 | 1,013,176 | u306482197 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
T *= 1000, A *= 1000;
int k = 0, l = 0;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (k > abs(A - (T - H * 6))) {
k = abs(A - (T - H * 6));
l = i;
}
}
cout << l << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
T *= 1000, A *= 1000;
int k = 100000000, l = 0;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (k > abs(A - (T - H * 6))) {
k = abs(A - (T - H * 6));
l = i;
}
}
cout << l << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,177 | 1,013,176 | u306482197 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int B[N];
for (int i = 0; i < N; i++)
cin >> B[i];
double min_diff = 10000000;
int a;
double x[N], diff[N];
for (int i = 0; i < N; i++) {
x[i] = T - B[i] * 0.006;
diff[i] = abs(x[i] - A);
if (dif... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int B[N];
for (int i = 0; i < N; i++)
cin >> B[i];
double min_diff = 10000000;
int a;
double x[N], diff[N];
for (int i = 0; i < N; i++) {
x[i] = T - B[i] * 0.006;
diff[i] = abs(x[i] - A);
if (dif... | [
"assignment.value.change",
"identifier.change"
] | 1,013,180 | 1,013,181 | u624830211 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int B[N];
for (int i = 0; i < N; i++)
cin >> B[i];
double min_diff = 10000000;
int a;
double x[N], diff[N];
for (int i = 0; i < N; i++) {
x[i] = T - B[i] * 0.006;
diff[i] = abs(x[i] - A);
if (x[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int B[N];
for (int i = 0; i < N; i++)
cin >> B[i];
double min_diff = 10000000;
int a;
double x[N], diff[N];
for (int i = 0; i < N; i++) {
x[i] = T - B[i] * 0.006;
diff[i] = abs(x[i] - A);
if (dif... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,013,182 | 1,013,181 | u624830211 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n, t, a;
cin >> n >> t >> a;
double min_diff = 100000;
int ans = 0;
for (size_t i = 0; i < n; i++) {
int h;
cin... | #include <bits/stdc++.h>
using namespace std;
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n, t, a;
cin >> n >> t >> a;
double min_diff = 100000;
int ans = 0;
for (size_t i = 0; i < n; i++) {
int h;
cin... | [
"call.add",
"call.arguments.change"
] | 1,013,185 | 1,013,186 | u319279308 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
int ans;
double tmin = 1e9;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
double cal = a - (t - h * 0.006);
if (tmin > cal) {
ans = i + 1;
tmin = cal;
}
}
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
int ans;
double tmin = 1e9;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
double cal = abs(a - (t - h * 0.006));
if (tmin > cal) {
ans = i + 1;
tmin = cal;
}
}
... | [
"call.add",
"call.arguments.change"
] | 1,013,191 | 1,013,192 | u524568016 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<double> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<double> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change"
] | 1,013,193 | 1,013,194 | u985985629 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<int> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<double> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change"
] | 1,013,195 | 1,013,194 | u985985629 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<int> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
std::vector<double> heights;
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change"
] | 1,013,196 | 1,013,194 | u985985629 | 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 = 0;
for (i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
int select = 0;
int tmp;
int sub;
for (i = 0; i < n; i++) {
tmp = t - h[i] * 0.006;
sub = a - tmp;
if ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int i = 0;
for (i = 0; i < n; i++) {
cin >> h[i];
}
double ans = 0;
int select = 0;
double tmp;
double sub;
for (i = 0; i < n; i++) {
tmp = t - h[i] * 0.006;
sub = a - tmp... | [
"variable_declaration.type.primitive.change"
] | 1,013,197 | 1,013,198 | u128001441 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
double h[n];
for (double &i : h) {
int tmp;
cin >> tmp;
i = t - tmp * 0.006;
}
int min = abs(h[0] - a), ans(1);
for (int i = 1; i < n; ++i) {
if (abs(h[i] - a) < min) {
min = abs(h[i] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
double a;
cin >> n;
cin >> t >> a;
double h[n];
for (double &i : h) {
int tmp;
cin >> tmp;
i = t - tmp * 0.006;
}
double min = abs(h[0] - a), ans(1);
for (int i = 1; i < n; ++i) {
if (abs(h[i] - a) < min) {
min ... | [
"variable_declaration.type.primitive.change"
] | 1,013,204 | 1,013,205 | u336661848 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t, a, temp = 1000, ans;
cin >> n >> t >> a;
rep(i, n) {
int j;
cin >> j;
double x = t - j * 0.006;
if (temp > abs(a - x)) {
temp = abs(a - x);
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t, a, ans;
double temp = 1000;
cin >> n >> t >> a;
rep(i, n) {
int j;
cin >> j;
double x = t - j * 0.006;
if (temp > abs(a - x)) {
temp = abs(a - x)... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,013,217 | 1,013,218 | u974896275 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b)
a = b;
return true;
return false;
}
void solve(long long N, long long T, long long A, std::vector<long long> H) {
int ans... | #include <cmath>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b)
a = b;
return true;
return false;
}
void solve(long long N, long long T, long long A, std::vector<long long> H) {
int ans... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,221 | 1,013,222 | u596385287 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 1999999999, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 1000 * 6));
if (saiteki > g... | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 1000000000, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 6));
if (saiteki > genzaiti... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,013,223 | 1,013,224 | u124083982 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 10000000000, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 1000 * 6));
if (saiteki > ... | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 1000000000, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 6));
if (saiteki > genzaiti... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,013,225 | 1,013,224 | u124083982 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 1000000000, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 1000 * 6));
if (saiteki > g... | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1100], genzaiti, saiteki = 1000000000, bangou = 0;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
genzaiti = abs(A * 1000 - (T * 1000 - H[i] * 6));
if (saiteki > genzaiti... | [
"expression.operation.binary.remove"
] | 1,013,226 | 1,013,224 | u124083982 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
int T, A;
cin >> T ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
int T, A;
cin >> T ... | [
"variable_declaration.type.primitive.change"
] | 1,013,227 | 1,013,228 | u233957192 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
int T, A;
cin >> T ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
int T, A;
cin >> T ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,229 | 1,013,228 | u233957192 | cpp |
p03220 | #include <bits/stdc++.h>
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.at(i);
H.at(i) = std::pow(T - H.at(i) * 0.006 - A, 2.0);
// H.at(i) = T - H.at(i) * 0.006 - A;
}
int minIndex = std::min_element(H... | #include <bits/stdc++.h>
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.at(i);
H.at(i) = std::pow((T - H.at(i) * 0.006) - A, 2.0);
}
int minIndex = std::min_element(H.begin(), H.end()) - H.begin();
... | [
"variable_declaration.type.primitive.change",
"call.arguments.change"
] | 1,013,230 | 1,013,231 | u390997234 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> h(N);
int min = 10000000000;
int res;
for (int i = 1; i < N; i++) {
cin >> h.at(i);
int d = abs((T * 1000 - h.at(i) * 6) - A * 1000);
if (d < min) {
min = d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> h(N + 1);
int min = 10000000000;
int res;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
int d = abs((T * 1000 - h.at(i) * 6) - A * 1000);
if (d < min) {
mi... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,013,233 | 1,013,234 | u917066681 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int min = 10000000;
int best;
for (int i = 0; i < N; i++) {
cin >> H[i];
int Ti = T - H[i] * 0.006;
if (Ti - A >= 0 && Ti - A < min) {
min = Ti - A;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
double min = 10000000;
int best;
for (int i = 0; i < N; i++) {
cin >> H[i];
double Ti = T - H[i] * 0.006;
if (Ti - A >= 0 && Ti - A < min) {
min = Ti - ... | [
"variable_declaration.type.primitive.change"
] | 1,013,240 | 1,013,241 | u256587538 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int min = 10000000;
int best;
for (int i = 0; i < N; i++) {
cin >> H[i];
int Ti = T - H[i] * 0.006;
if (Ti - A > 0 && Ti - A < min) {
min = Ti - A;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
double min = 10000000;
int best;
for (int i = 0; i < N; i++) {
cin >> H[i];
double Ti = T - H[i] * 0.006;
if (Ti - A >= 0 && Ti - A < min) {
min = Ti - ... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,013,242 | 1,013,241 | u256587538 | cpp |
p03220 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,013,246 | 1,013,247 | u396266329 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int min = 10000000;
int answer = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
int g = data.at(i);
double h = (abs(A - (T - 0.006 * g)));
if (min > h) {
min = h;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double min = 10000000;
int answer = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
int g = data.at(i);
double h = (abs(A - (T - 0.006 * g)));
if (min > h) {
min = h;
... | [
"variable_declaration.type.primitive.change"
] | 1,013,252 | 1,013,253 | u983563612 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int min = 10000000;
int answer = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
int g = data.at(i);
double h = (A - (T - 0.006 * g));
if (min > h) {
min = h;
answ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double min = 10000000;
int answer = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
int g = data.at(i);
double h = (abs(A - (T - 0.006 * g)));
if (min > h) {
min = h;
... | [
"variable_declaration.type.primitive.change",
"call.add"
] | 1,013,254 | 1,013,253 | u983563612 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | [
"variable_declaration.type.primitive.change"
] | 1,013,255 | 1,013,256 | u001534842 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, place;
cin >> n >> t >> a;
int min = 100000000;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (abs(t - h.at(i) * 0.006 - a) < min) {
min = abs(t - h.at(i) * 0.006 - a);
place = i;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, place;
cin >> n >> t >> a;
double min = 10000000.0;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (abs(t - h.at(i) * 0.006 - a) < min) {
min = abs(t - h.at(i) * 0.006 - a);
place = i;
}
}
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,257 | 1,013,258 | u227076210 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, n, t, a, tmp, place;
long min = 1000000;
cin >> n;
cin >> t >> a;
for (i = 0; i < n; i++) {
cin >> tmp;
if (abs(t - tmp * 0.006 - a) < min) {
min = abs(t - tmp * 0.006 - a);
place = i;
}
}
cout << plac... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, n, t, a, tmp, place;
float min = 1000000.0;
cin >> n;
cin >> t >> a;
for (i = 0; i < n; i++) {
cin >> tmp;
if (abs(t - tmp * 0.006 - a) < min) {
min = abs(t - tmp * 0.006 - a);
place = i;
}
}
cout << p... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,259 | 1,013,260 | u406767170 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<double> h(n);
rep(i, n) {
cin >> h[i];
h[i] = abs(a - h[i] * 6 / 1000.0);
}
int p = 0;
rep(i, n) {
if (h[p] > h[i])
p = i;
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<double> h(n);
rep(i, n) {
cin >> h[i];
h[i] = abs(a - t + h[i] * 6 / 1000.0);
}
int p = 0;
rep(i, n) {
if (h[p] > h[i])
p = i;... | [
"assignment.change"
] | 1,013,265 | 1,013,266 | u252211543 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i... | [
"variable_declaration.type.primitive.change"
] | 1,013,267 | 1,013,268 | u455067221 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int min_diff = 1LL << 60;
int min_index = -1;
rep(i, n) {
cin >> h[i];
double diff = abs(a - (t - 0.006 * h[i]));
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
double min_diff = 1LL << 60;
int min_index = -1;
rep(i, n) {
cin >> h[i];
double diff = abs(a - (t - 0.006 * h[i]));
... | [
"variable_declaration.type.primitive.change"
] | 1,013,269 | 1,013,270 | u455067221 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,271 | 1,013,272 | u274175583 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> kion(n);
for (int i = 0; i < n; i++) {
int h;
cin >> h;
kion.at(i) = t - (double)(3 * h) / (double)500;
}
int ans = abs(a - kion.at(0));
int count = 1;
for (int i = 1; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> kion(n);
for (int i = 0; i < n; i++) {
int h;
cin >> h;
kion.at(i) = (double)t - (double)(3 * h) / (double)500;
}
double ans = abs(a - kion.at(0));
int count = 1;
for (int i = 1; i < ... | [
"variable_declaration.type.primitive.change"
] | 1,013,273 | 1,013,274 | u755918658 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | [
"call.add",
"call.arguments.change"
] | 1,013,275 | 1,013,276 | u880221923 | cpp |
p03220 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [
"variable_declaration.type.change"
] | 1,013,277 | 1,013,278 | u656731444 | cpp |
p03220 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [
"variable_declaration.type.primitive.change"
] | 1,013,279 | 1,013,278 | u656731444 | cpp |
p03220 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [
"variable_declaration.type.change"
] | 1,013,277 | 1,013,280 | u656731444 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.