problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
double n, t, a, min = 10000, ans;
cin >> n >> t >> a;
rep(i, n) {
d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
double n, t, a, min = 10000, ans;
cin >> n >> t >> a;
rep(i, n) {
d... | [
"call.add",
"call.arguments.change"
] | 1,014,225 | 1,014,226 | u931071094 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
double n, t, a, min = 10000, ans;
cin >> n >> t >> a;
rep(i, n) {
d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define mod 1000000007
typedef long long ll;
int main() {
double n, t, a, min = 10000, ans;
cin >> n >> t >> a;
rep(i, n) {
d... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 1,014,227 | 1,014,226 | u931071094 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<pair<double, int>> x(n);
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int y = abs(a - (t - h * 0.006));
int z = i + 1;
x[i] = make_pair(y, z);
}
sort(x.begin(), x.end());
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<pair<double, int>> x(n);
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double y = abs(a - (t - h * 0.006));
int z = i + 1;
x[i] = make_pair(y, z);
}
sort(x.begin(), x.end());
cout ... | [
"variable_declaration.type.primitive.change"
] | 1,014,228 | 1,014,229 | u931071094 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
cin >> H.at(i);
int d = (T * 1000 - H.at(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, T, A;
cin >> N >> T >> A;
vector<int> H(N + 10);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
cin >> H.at(i);
int d = (T * 1000 - H.at(i) * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, r... | [
"assignment.change"
] | 1,014,230 | 1,014,231 | u162911959 | 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;
double t, a;
cin >> n >> t >> a;
int min = 1001001;
int ans;
rep(i, n) {
int h;
cin >> h;
int tmp = abs(a - (t - h * 0.006));
if (min > tmp) {
min =... | #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;
double t, a;
cin >> n >> t >> a;
double min = 1001001;
int ans;
rep(i, n) {
int h;
cin >> h;
double tmp = abs(a - (t - h * 0.006));
if (min > tmp) {
... | [
"variable_declaration.type.primitive.change"
] | 1,014,232 | 1,014,233 | u915797797 | cpp |
p03220 | #include <cmath>
#include <cstdio>
int main() {
int N, T, A;
scanf("%d %d %d", &N, &T, &A);
int H[N];
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
int min = __INT_MAX__;
int temp;
int goal = 0;
for (int i = 0; i < N; i++) {
temp = std::abs((T - H[i] * 0.006) - A);
if (temp < min) {... | #include <cmath>
#include <cstdio>
int main() {
int N, T, A;
scanf("%d %d %d", &N, &T, &A);
int H[N];
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
double min = __INT_MAX__;
double temp;
int goal = 0;
for (int i = 0; i < N; i++) {
temp = std::abs((T - H[i] * 0.006) - A);
if (temp < ... | [
"variable_declaration.type.primitive.change"
] | 1,014,234 | 1,014,235 | u568501780 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
int co = 100000000;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < co) {
co = abs(A - (T - H[i] *... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
double co = 100000000;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < co) {
co = abs(A - (T - H[i... | [
"variable_declaration.type.primitive.change"
] | 1,014,238 | 1,014,239 | u106782100 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> hight(N);
vector<int> temp(N);
for (int i = 0; i < N; i++) {
cin >> hight.at(i);
temp.at(i) = abs(T - hight.at(i) * 0.006 - A);
}
vector<int> mini = {1, temp.at(0)};
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<int> hight(N);
vector<double> temp(N);
for (int i = 0; i < N; i++) {
cin >> hight.at(i);
temp.at(i) = abs(T - hight.at(i) * 0.006 - A);
}
vector<double> mini = {1, temp.at(0)};
for (int i = 1; i <... | [
"variable_declaration.type.primitive.change"
] | 1,014,245 | 1,014,246 | u838744063 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<double> h;
rep(i, n) {
int x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<double> h;
rep(i, n) {
double x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1... | [
"variable_declaration.type.primitive.change"
] | 1,014,247 | 1,014,248 | u905170328 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<int> h;
rep(i, n) {
double x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<double> h;
rep(i, n) {
double x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,249 | 1,014,248 | u905170328 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<int> h;
rep(i, n) {
int x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<double> h;
rep(i, n) {
double x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,250 | 1,014,248 | u905170328 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<int> h;
rep(i, n) {
int x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 100000;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
vector<double> h;
rep(i, n) {
double x;
cin >> x;
x = t - 0.006 * x;
h.push_back(x);
}
int ansnum = 0;
double mn = 1... | [
"variable_declaration.type.primitive.change"
] | 1,014,251 | 1,014,248 | u905170328 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
}
template <class T> bool chmin(T &a, const T &b) {
if (... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
}
template <class T> bool chmin(T &a, const T &b) {
if (... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,014,261 | 1,014,262 | u983505021 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d[1010], e, f;
cin >> a;
cin >> b >> c;
for (int i = 0; i < a; i++)
cin >> d[i];
e = 1000;
f = 0;
for (int i = 0; i < a; i++) {
if (e > abs((b - d[i] * 0.006) - c)) {
e = abs((b - d[i] * 0.006) - c... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d[1010], f;
double e;
cin >> a;
cin >> b >> c;
for (int i = 0; i < a; i++)
cin >> d[i];
e = 1000;
f = 0;
for (int i = 0; i < a; i++) {
if (e > abs((b - d[i] * 0.006) - c)) {
e = abs((b - d[i] * 0... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,014,265 | 1,014,266 | u530329977 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long long N, T, A, H[1 << 18];
pair<long long, long long> minx = make_pair(1LL << 60, 0);
int main() {
cin >> N >> T >> A;
A *= 1000LL;
for (int i = 1; i <= N; i++) {
cin >> H[i];
long long r = T - H[i] * 6LL;
minx = min(... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long long N, T, A, H[1 << 18];
pair<long long, long long> minx = make_pair(1LL << 60, 0);
int main() {
cin >> N >> T >> A;
T *= 1000LL;
A *= 1000LL;
for (int i = 1; i <= N; i++) {
cin >> H[i];
long long r = T - H[i] * 6LL;
... | [
"assignment.add"
] | 1,014,267 | 1,014,268 | u504103417 | cpp |
p03220 | #include <assert.h>
#include <math.h>
#include <stdio.h>
int minElement(const float *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
int min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int m... | #include <assert.h>
#include <math.h>
#include <stdio.h>
int minElement(const float *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
float min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int... | [
"variable_declaration.type.primitive.change"
] | 1,014,269 | 1,014,270 | u956381076 | cpp |
p03220 | #include <assert.h>
#include <math.h>
#include <stdio.h>
int minElement(const int *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
int min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int mai... | #include <assert.h>
#include <math.h>
#include <stdio.h>
int minElement(const float *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
float min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int... | [
"variable_declaration.type.primitive.change"
] | 1,014,271 | 1,014,270 | u956381076 | cpp |
p03220 | #include <assert.h>
#include <stdio.h>
#include <stdlib.h>
int minElement(const int *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
int min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int m... | #include <assert.h>
#include <math.h>
#include <stdio.h>
int minElement(const float *array, size_t size) {
int x = 0;
assert(array != NULL);
assert(size >= 1);
float min = array[0];
for (size_t i = 0; i < size; ++i) {
if (min > array[i]) {
min = array[i];
x = i;
}
}
return x;
}
int... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,272 | 1,014,270 | u956381076 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int a[1000];
double best = 100000;
double sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i] - A;... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double a[1000];
double best = 100000;
double sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i... | [
"variable_declaration.type.primitive.change"
] | 1,014,273 | 1,014,274 | u318287889 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int a[1000];
float best = 100000;
float sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i] - A;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double a[1000];
double best = 100000;
double sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i... | [
"variable_declaration.type.primitive.change"
] | 1,014,275 | 1,014,274 | u318287889 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int a[1000];
int best = 100000;
int sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i] - A;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double a[1000];
double best = 100000;
double sa, best_ad;
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = T - a[i] * 0.006;
if (A >= a[i]) {
sa = A - a[i];
} else {
sa = a[i... | [
"variable_declaration.type.primitive.change"
] | 1,014,276 | 1,014,274 | u318287889 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;... | [
"variable_declaration.type.primitive.change"
] | 1,014,277 | 1,014,278 | u869282786 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
int ondosa = 1000;
int answer;
for (int i = 0; i < n; i++) {
if (abs(b - (a - vec.at(i) * 0.006)) < ondosa) {
ondosa = abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
double ondosa = 1000;
int answer;
for (int i = 0; i < n; i++) {
if (abs(b - (a - vec.at(i) * 0.006)) < ondosa) {
ondosa = a... | [
"variable_declaration.type.primitive.change"
] | 1,014,282 | 1,014,283 | u363369454 | cpp |
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
double H[N];
double ans = 123456789;
int ans2 = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (ans > min(ans, A - (T - 0.006 * H[i]))) {
ans ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
double H[N];
double ans = 123456789;
int ans2 = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (ans > min(ans, abs(A - (T - 0.006 * H[i])))) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,014,286 | 1,014,287 | u393754572 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sor... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sor... | [
"assignment.change"
] | 1,014,288 | 1,014,289 | u428830428 | 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;
vector<pair<double, int>> h(n);
rep(i, n) {
h.at(i).second = i;
cin >> h.at(i).first;
h.at(i).first = abs(a - t - h.at(i).first * 0.006);
}
sort(h.begin(),... | #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;
vector<pair<double, int>> h(n);
rep(i, n) {
h.at(i).second = i;
cin >> h.at(i).first;
h.at(i).first = abs(a - t + h.at(i).first * 0.006);
}
sort(h.begin(),... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,294 | 1,014,295 | u009870106 | 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;
vector<pair<double, int>> h(n);
rep(i, n) {
h.at(i).second = i;
cin >> h.at(i).first;
h.at(i).first = abs(a - h.at(i).first);
}
sort(h.begin(), h.end());
... | #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;
vector<pair<double, int>> h(n);
rep(i, n) {
h.at(i).second = i;
cin >> h.at(i).first;
h.at(i).first = abs(a - t + h.at(i).first * 0.006);
}
sort(h.begin(),... | [
"assignment.change"
] | 1,014,296 | 1,014,295 | u009870106 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int f(int n) {
if (n % 2)
return 3 * n + 1;
else
return n / ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int f(int n) {
if (n % 2)
return 3 * n + 1;
else
return n / ... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,014,297 | 1,014,298 | u319093540 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) \
#a ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,299 | 1,014,300 | u167988719 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,014,301 | 1,014,302 | u338791285 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n];
int k[n];
int num = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
k[i] = abs(a - (t - 0.006 * h[i]));
if (k[num] >= k[i]) {
num = i;
}
}
cout << num + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
float h[n];
float k[n];
int num = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
k[i] = abs(a - (t - 0.006 * h[i]));
if (k[num] >= k[i]) {
num = i;
}
}
cout << num + 1 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 1,014,303 | 1,014,304 | u922999444 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n];
int k[n];
int num = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
k[i] = abs(a - (t - 0.006 * h[i]));
if (k[num] > k[i]) {
num = i;
}
}
cout << num + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
float h[n];
float k[n];
int num = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
k[i] = abs(a - (t - 0.006 * h[i]));
if (k[num] >= k[i]) {
num = i;
}
}
cout << num + 1 << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,014,305 | 1,014,304 | u922999444 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"variable_declaration.type.primitive.change"
] | 1,014,312 | 1,014,313 | u322177979 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, log, minnum = 1000;
cin >> n >> t >> a;
vector<int> num(n);
double nums[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
nums[i] = abs(a - (t - num[i] * 0.006));
if (minnum > nums[i]) {
minnum = nums[i];
log = i +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, log;
double minnum = 1000.1;
cin >> n >> t >> a;
vector<int> num(n);
double nums[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
nums[i] = abs(a - (t - num[i] * 0.006));
if (minnum > nums[i]) {
minnum = nums[i];
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,320 | 1,014,321 | u351265848 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N;
cin >> T >> A;
vector<float> H(N);
float diff = 10000;
int ans = 0;
for (int i = 0; i < N; i++) {
/* c... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N;
cin >> T >> A;
vector<float> H(N);
float diff = 10000;
int ans = 0;
for (int i = 0; i < N; i++) {
/* c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,014,322 | 1,014,323 | u123724799 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
double T, A;
cin >> N;
cin >> T >> A;
vector<double> H(N);
double diff = 10000;
int ans = 0;
for (int i = 0; i < N; i++) {
/... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N;
cin >> T >> A;
vector<float> H(N);
float diff = 10000;
int ans = 0;
for (int i = 0; i < N; i++) {
/* c... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,014,324 | 1,014,323 | u123724799 | cpp |
p03220 | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N >> T >> A;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
// cout ... | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N >> T >> A;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
// cout ... | [
"variable_declaration.type.primitive.change"
] | 1,014,325 | 1,014,326 | u123724799 | cpp |
p03220 | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
vec[i] = a... | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N >> T >> A;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
// cout ... | [
"variable_declaration.type.primitive.change"
] | 1,014,327 | 1,014,326 | u123724799 | cpp |
p03220 | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
vec[i] = abs(... | // 113
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float T, A;
cin >> N >> T >> A;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
/* code */
cin >> vec[i];
vec[i] = T - (vec[i] * 0.006);
// cout ... | [
"variable_declaration.type.primitive.change"
] | 1,014,328 | 1,014,326 | u123724799 | 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 ans;
int temp;
vector<int> LT(N);
for (int i = 0; i < N; ++i) {
LT[i] = (T * 1000 - H[i] * 6) - A * 1000;
if (LT[i] < 0)
LT... | #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 ans;
int temp = 10000000;
vector<int> LT(N);
for (int i = 0; i < N; ++i) {
LT[i] = (T * 1000 - H[i] * 6) - A * 1000;
if (LT[i] < ... | [
"variable_declaration.value.change"
] | 1,014,329 | 1,014,330 | u134302690 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> h(n);
vector<double> ans(n);
int count;
double com = 100;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
ans.at(i) = t - h.at(i) * 0.006 - a;
if (com > abs(ans.at(i))) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> h(n);
vector<double> ans(n);
int count;
double com = 1000;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
ans.at(i) = t - h.at(i) * 0.006 - a;
if (com > abs(ans.at(i)))... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,350 | 1,014,351 | u955282280 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | [
"variable_declaration.type.primitive.change"
] | 1,014,363 | 1,014,364 | u264265458 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
#define mod 1000000007
int main() {
int n, t, a;
int ans;
int mi = inf;
cin >> n >> t >> a;
rep(i, n) {
int h;
cin >> h;
double... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
#define mod 1000000007
int main() {
int n, t, a;
int ans;
double mi = inf;
cin >> n >> t >> a;
rep(i, n) {
int h;
cin >> h;
dou... | [
"variable_declaration.type.primitive.change"
] | 1,014,365 | 1,014,366 | u001327021 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define MAX lli max = 9000000000000000000;
#define MIN lli min = 9000000000000000000;
#define LLI(n) \
lli n; \... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define MAX lli max = 9000000000000000000;
#define MIN lli min = 9000000000000000000;
#define LLI(n) \
lli n; \... | [
"assignment.change"
] | 1,014,369 | 1,014,370 | u743889070 | cpp |
p03220 | //大文字->小文字 tolower(),逆はtoupper()
// int a = stoi(c); 文字列をintへ
//途中の出力をそのまま残さない
//数値計算 基本はdouble
// map<キー,値> p は辞書。p[キー] = 値
//絶対値 abs()
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 1; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// Nの桁数
ll dig(ll N) {
ll... | //大文字->小文字 tolower(),逆はtoupper()
// int a = stoi(c); 文字列をintへ
//途中の出力をそのまま残さない
//数値計算 基本はdouble
// map<キー,値> p は辞書。p[キー] = 値
//絶対値 abs()
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 1; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// Nの桁数
ll dig(ll N) {
ll... | [
"variable_declaration.type.primitive.change"
] | 1,014,373 | 1,014,374 | u565692645 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1010;
int n, t, a;
int res = 0x3f3f3f3f, idx;
int main() {
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
if (abs(a - (t - 0.006 * h)) < res) {
res = abs(a - (t - 0.006 * h));
idx = i;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1010;
int n, t, a;
double res = 0x3f3f3f3f;
int idx;
int main() {
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
double h;
cin >> h;
if (abs(a - (t - 0.006 * h)) < res) {
res = abs(a - (t - 0.006 * h));
... | [
"variable_declaration.type.primitive.change"
] | 1,014,377 | 1,014,376 | u866538547 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MOD = 10000;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int tmp_h = 0;
double ans = 1;
double near_t = 0;
rep(i, n) {
cin >> tmp_h;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MOD = 10000;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int tmp_h = 0;
double ans = 1;
double near_t = 0;
rep(i, n) {
cin >> tmp_h;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,014,378 | 1,014,379 | u596311864 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MOD = 10000;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int tmp_h = 0;
double ans = 1;
double near_t = 0;
rep(i, n) {
cin >> tmp_h;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MOD = 10000;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int tmp_h = 0;
double ans = 1;
double near_t = 0;
rep(i, n) {
cin >> tmp_h;
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,014,380 | 1,014,379 | u596311864 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
double T, A;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int j = 0;
double S = abs(A - abs(T - H[0] * 0.006));
double NowS = 0;
for (int i = 0; i < N; i++) {
NowS = abs(A - abs(T - H... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
double T, A;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int j = 0;
double S = abs(A - (T - H[0] * 0.006));
double NowS = 0;
for (int i = 0; i < N; i++) {
NowS = abs(A - (T - H[i] * ... | [
"call.arguments.change"
] | 1,014,385 | 1,014,386 | u406634703 | cpp |
p03220 | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string... | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string... | [
"variable_declaration.type.primitive.change"
] | 1,014,390 | 1,014,391 | u058317639 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int res = 0;
double tmp;
double min_t = 100001;
vector<int> h(n);
rep(i, n) {
cin >> h.at(i);
tmp = abs(a - abs((double)t - (double)h.at(i) * 0.006... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int res = 0;
double tmp;
double min_t = 100001;
vector<int> h(n);
rep(i, n) {
cin >> h.at(i);
tmp = abs(a - ((double)t - (double)h.at(i) * 0.006));... | [
"call.arguments.change"
] | 1,014,394 | 1,014,395 | u690475097 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, T, A;
cin >> N >> T >> A;
ll answer = -1;
double near = 1e6;
for (int i = 0; i < N; i++) {
double temp;
cin >> temp;
double diff = abs(T - (A - temp * 0.006));
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, T, A;
cin >> N >> T >> A;
ll answer = -1;
double near = 1e6;
for (int i = 0; i < N; i++) {
double temp;
cin >> temp;
double diff = abs(A - (T - temp * 0.006));
i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,399 | 1,014,400 | u759177660 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1010];
double Tdif[1010];
for (int i = 0; i < N; i++) {
cin >> H[i];
Tdif[i] = T - H[i] * 0.006 - A;
if (Tdif[i] < 0)
Tdif[i] *= -1;
}
int ans;
int d = 1000;
for (int i = 0; i < N; i++) ... | #include <iostream>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
double H[1010];
double Tdif[1010];
for (int i = 0; i < N; i++) {
cin >> H[i];
Tdif[i] = T - H[i] * 0.006 - A;
if (Tdif[i] < 0)
Tdif[i] *= -1;
}
int ans;
double d = 1000;
for (int i = 0; i < N;... | [
"variable_declaration.type.primitive.change"
] | 1,014,401 | 1,014,402 | u226233437 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[1010];
double Tdif[1010];
for (int i = 0; i < N; i++) {
cin >> H[i];
Tdif[i] = T - H[i] * 0.006 - A;
if (Tdif[i] < 0)
Tdif[i] *= -1;
}
int ans;
int d = 1000;
for (int i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
double H[1010];
double Tdif[1010];
for (int i = 0; i < N; i++) {
cin >> H[i];
Tdif[i] = T - H[i] * 0.006 - A;
if (Tdif[i] < 0)
Tdif[i] *= -1;
}
int ans;
double d = 1000;
for (int i = 0; i < N;... | [
"variable_declaration.type.primitive.change"
] | 1,014,403 | 1,014,402 | u226233437 | cpp |
p03220 | #include <iostream>
using namespace std;
#include <cmath> //小数のabs
#include <cstdlib> //整数のabs
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
int gap[N];
for (int i = 0; i < N; i++)
gap[i] = abs(A - (T - H[i] * 0.006));
double minimum = gap[0... | #include <iostream>
using namespace std;
#include <cmath> //小数のabs
#include <cstdlib> //整数のabs
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
double gap[N];
for (int i = 0; i < N; i++)
gap[i] = abs(A - (T - H[i] * 0.006));
double minimum = ga... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,014,404 | 1,014,405 | u523545435 | 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);
double min = 1000000000.0;
int ret = 1;
for (int i = 0; i < N; i++) {
// cout << T - H[i] * 0.006 << endl;
double dt = abs(double(A) - abs(d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
double min = 1000000000.0;
int ret = 1;
for (int i = 0; i < N; i++) {
// cout << T - H[i] * 0.006 << endl;
double dt = abs(double(A) - (doub... | [
"call.arguments.change"
] | 1,014,408 | 1,014,409 | u391039004 | 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);
double min = 1000000000.0;
int ret = 0;
for (int i = 0; i < N; i++) {
// cout << T - H[i] * 0.006 << endl;
double dt = abs(double(A) - abs(d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
double min = 1000000000.0;
int ret = 1;
for (int i = 0; i < N; i++) {
// cout << T - H[i] * 0.006 << endl;
double dt = abs(double(A) - (doub... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,014,410 | 1,014,409 | u391039004 | 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);
}
int mint = 10000;
int find = 1;
for (int i = 0; i < N; i++) {
if (mint > abs(T - 0.006 * H.at(i) - A)) {
mint = ab... | #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);
}
double mint = 1000;
int find = 1;
for (int i = 0; i < N; i++) {
if (mint > abs(T - 0.006 * H.at(i) - A)) {
mint = ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,411 | 1,014,412 | u418084321 | 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);
}
int mint = 1000;
int find = 1;
for (int i = 0; i < N; i++) {
if (mint > abs(T - 0.006 * H.at(i) - A)) {
mint = abs... | #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);
}
double mint = 1000;
int find = 1;
for (int i = 0; i < N; i++) {
if (mint > abs(T - 0.006 * H.at(i) - A)) {
mint = ... | [
"variable_declaration.type.primitive.change"
] | 1,014,413 | 1,014,412 | u418084321 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template ... | [
"assignment.add"
] | 1,014,419 | 1,014,420 | u608258653 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
int N, T, A;
int min = 100000;
int num;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(A - T + H * 0.006) < min) {
nu... | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
int N, T, A;
double min = 100000;
int num;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(A - T + H * 0.006) < min) {
... | [
"variable_declaration.type.primitive.change"
] | 1,014,421 | 1,014,422 | u316491370 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
int N, T, A;
int min = 1000;
int num;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(A - T + H * 0.006) < min) {
num ... | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
int N, T, A;
double min = 100000;
int num;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(A - T + H * 0.006) < min) {
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,423 | 1,014,422 | u316491370 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int H[N];
int num;
int x;
for (int i = 0; i < N; i++)
cin >> H[i];
int d = 0;
int ans = 10000000;
for (int i = 0; i < N; i++) {
d = T * 1000 - H[i] * 6 - A * 1000;
if (d < 0)
d = -d;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int H[N];
int num;
int x;
for (int i = 0; i < N; i++)
cin >> H[i];
int d = 0;
int ans = 10000000;
for (int i = 0; i < N; i++) {
d = T * 1000 - H[i] * 6 - A * 1000;
if (d < 0)
d = -d;
... | [
"assignment.change"
] | 1,014,427 | 1,014,428 | u109191542 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, temp, hikaku, ans;
hikaku = 100000;
ans = 0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
temp = t - h * 0.006;
// cout<<abs(a-temp)<<"<"<<abs(a-hikaku)<<endl;
if (abs(a - temp) < abs(a - hikaku)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h, ans;
double temp, hikaku;
hikaku = 100000;
ans = 0;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
temp = t - h * 0.006;
// cout<<abs(a-temp)<<"<"<<abs(a-hikaku)<<endl;
if (abs(a - temp) < abs(a - hik... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,014,429 | 1,014,430 | u039241365 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9 + 7;
c... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9 + 7;
c... | [
"variable_declaration.type.primitive.change"
] | 1,014,431 | 1,014,432 | u721082205 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
int m;
int l;
cin >> n >> m >> l;
double a[n];
double ans[n];
// cout << n << endl;
// cout << m << endl;
// cout << l << endl;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
int m;
int l;
cin >> n >> m >> l;
double a[n];
double ans[n];
// cout << n << endl;
// cout << m << endl;
// cout << l << endl;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,437 | 1,014,438 | u049376978 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
int m;
int l;
cin >> n >> m >> l;
double a[n];
double ans[n];
// cout << n << endl;
// cout << m << endl;
// cout << l << endl;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
int m;
int l;
cin >> n >> m >> l;
double a[n];
double ans[n];
// cout << n << endl;
// cout << m << endl;
// cout << l << endl;
... | [
"variable_declaration.type.primitive.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,014,440 | 1,014,438 | u049376978 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int n, a;
double t;
double dif(double tmp) { return abs(tmp - a); }
int main() {
cin >> n >> t >> a;
double h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int min_dif = dif(t - h[0] * 0.006), min_index = 0;
for (int i = 1; i < n; ++i) {
... | #include <cmath>
#include <iostream>
using namespace std;
int n, a;
double t;
double dif(double tmp) { return abs(tmp - a); }
int main() {
cin >> n >> t >> a;
double h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
double min_dif = dif(t - h[0] * 0.006), min_index = 0;
for (int i = 1; i < n; ++i) {... | [
"variable_declaration.type.primitive.change"
] | 1,014,441 | 1,014,442 | u190761897 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, min = 1e9, ans;
cin >> N >> T >> A;
for (int i = 0, H; i < N; i++) {
cin >> H;
double tmp = abs(T - H * 0.006 - A);
if (tmp < min) {
min = tmp;
ans = i + 1;
}
}
cout << ans << endl;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, ans;
double min = 1e9;
cin >> N >> T >> A;
for (int i = 0, H; i < N; i++) {
cin >> H;
double tmp = abs(T - H * 0.006 - A);
if (tmp < min) {
min = tmp;
ans = i + 1;
}
}
cout << ans << endl;
}
| [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,014,445 | 1,014,446 | u024469792 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x, p = 1;
double tmp, min = 200;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> x;
tmp = abs(a - (t - x * 0.006));
if (min > tmp) {
min = tmp;
p = i;
}
}
cout << p << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x, p = 1;
double tmp, min = 100000;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> x;
tmp = abs(a - (t - x * 0.006));
if (min > tmp) {
min = tmp;
p = i;
}
}
cout << p << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,447 | 1,014,448 | u475043664 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x, p = 1;
double tmp, min = -120;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> x;
tmp = abs(a - (t - x * 0.006));
if (min > tmp) {
min = tmp;
p = i;
}
}
cout << p << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x, p = 1;
double tmp, min = 100000;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> x;
tmp = abs(a - (t - x * 0.006));
if (min > tmp) {
min = tmp;
p = i;
}
}
cout << p << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,449 | 1,014,448 | u475043664 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n], spot = 0, temp, dif = 1000000;
for (int i = 0; i < n; i++) {
cin >> h[i];
temp = t - h[i] * ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double h[n], spot = 0, temp, dif = 1000000;
for (int i = 0; i < n; i++) {
cin >> h[i];
temp = t - h[i]... | [
"variable_declaration.type.primitive.change",
"call.add"
] | 1,014,450 | 1,014,451 | u893907405 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n, t, h, a, ans = 0;
double min = INT_MAX, sa;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
sa = abs(a - (t - h) * 0.006);
if (min > sa) {
min = sa;
ans = i + 1;
}
}
cout << ans... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n, t, h, a, ans = 0;
double min = INT_MAX, sa;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
sa = abs(a - (t - h * 0.006));
if (min > sa) {
min = sa;
ans = i + 1;
}
}
cout << ans... | [
"call.arguments.change"
] | 1,014,456 | 1,014,457 | u777656471 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, ans = -1;
cin >> n >> t >> a;
float best_temp_diff = -100001 * 0.006;
for (int i = 0; i < n; i++) {
int h;
float temp_diff;
cin >> h;
temp_diff = abs(t - h * 0.006 - a);
if (temp_diff < best_temp_diff) {
best_temp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, ans = -1;
cin >> n >> t >> a;
float best_temp_diff = 100000;
for (int i = 0; i < n; i++) {
int h;
float temp_diff;
cin >> h;
temp_diff = abs(t - h * 0.006 - a);
if (temp_diff < best_temp_diff) {
best_temp_diff = t... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,014,460 | 1,014,461 | u868237899 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = (m); i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = (m); i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
... | [
"variable_declaration.type.primitive.change"
] | 1,014,462 | 1,014,463 | u850516963 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n, t, a, m = INF, ans = 0;
cin >> n >> t >> a;
vector<int> A(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> A[i];
A[i] = t - 0.006 * A[i];
tmp = max(A[i], a) - min(A[i], a);
if (m > tmp) {
m = tm... | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
double n, t, a, m = INF, ans = 0;
cin >> n >> t >> a;
vector<double> A(n);
for (int i = 0; i < n; i++) {
double tmp;
cin >> A[i];
A[i] = t - 0.006 * A[i];
tmp = max(A[i], a) - min(A[i], a);
if (m > tmp) {
... | [
"variable_declaration.type.primitive.change"
] | 1,014,476 | 1,014,477 | u207948013 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n, t, a, m = INF, ans = 0;
cin >> n >> t >> a;
vector<int> A(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> A[i];
A[i] = t - 0.006 * A[i];
tmp = max(A[i], a) - min(A[i], a);
if (m > tmp) {
m = tm... | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
double n, t, a, m = INF, ans = 0;
cin >> n >> t >> a;
vector<double> A(n);
for (int i = 0; i < n; i++) {
double tmp;
cin >> A[i];
A[i] = t - 0.006 * A[i];
tmp = max(A[i], a) - min(A[i], a);
if (m > tmp) {
... | [
"variable_declaration.type.primitive.change"
] | 1,014,478 | 1,014,477 | u207948013 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> X(n);
for (int i = 0; i < n; i++)
cin >> X.at(i);
double min = fabs(a - (t - X.at(0) * 0.006));
int answer = 0;
for (int i = 0; i < n; i++) {
double check = fabs(a - (t - X.at(i) * 0.006));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> X(n);
for (int i = 0; i < n; i++)
cin >> X.at(i);
double min = fabs(a - (t - X.at(0) * 0.006));
int answer = 1;
for (int i = 0; i < n; i++) {
double check = fabs(a - (t - X.at(i) * 0.006));
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,483 | 1,014,484 | u868580535 | 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;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, h.size()) cin >> h.at(i);
vector<int> h_d(n);
int ans = 0;
int sa = 0;
rep(i, n) {
h_d.at(i) ... | #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;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, h.size()) cin >> h.at(i);
vector<double> h_d(n);
int ans = 0;
int sa = 0;
rep(i, n) {
h_d.at(... | [
"variable_declaration.type.primitive.change"
] | 1,014,500 | 1,014,501 | u440632112 | cpp |
p03220 | #include <stdio.h>
int main() {
int n;
int t, a;
scanf("%d%d%d", &n, &t, &a);
int h[n];
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
double T[n];
for (int i = 0; i < n; i++) {
T[i] = t - h[i] * 0.006;
if (T[i] > a)
T[i] = T[i] - a;
else
T[i] = a - T[i];
}
double min_t =... | #include <stdio.h>
int main() {
int n;
int t, a;
scanf("%d%d%d", &n, &t, &a);
int h[n];
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
double T[n];
for (int i = 0; i < n; i++) {
T[i] = t - h[i] * 0.006;
if (T[i] > a)
T[i] = T[i] - a;
else
T[i] = a - T[i];
}
double min_t =... | [
"expression.operation.binary.add"
] | 1,014,502 | 1,014,503 | u789673251 | cpp |
p03220 | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int min_diff = INT_MAX;
int index = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tmp = t - 0.006 * h;
double diff = abs(tmp - a);
if (diff < ... | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
double min_diff = INT_MAX;
int index = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tmp = t - 0.006 * h;
double diff = abs(tmp - a);
if (diff... | [
"variable_declaration.type.primitive.change"
] | 1,014,508 | 1,014,509 | u552122040 | cpp |
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> 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) = t - vec.at(i) * 0.006;
}
auto min_diff = 10000000;
int index = ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
double n, t, a;
cin >> n;
cin >> t >> a;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
vec.at(i) = t - vec.at(i) * 0.006;
}
double min_diff = 10000000;
int ... | [
"variable_declaration.type.primitive.change"
] | 1,014,510 | 1,014,511 | u552122040 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define MOD 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define MOD 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 1,014,512 | 1,014,513 | u430681166 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) re... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,514 | 1,014,515 | u351012095 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
double func(double t, double a, double h) {
int tmp = t - h * 0.006;
return abs(tmp - a);
}
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 ans;
double min_diff;
for (... | #include <bits/stdc++.h>
using namespace std;
double func(double t, double a, double h) {
double tmp = t - h * 0.006;
return abs(tmp - a);
}
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 ans;
double min_diff;
fo... | [
"variable_declaration.type.primitive.change"
] | 1,014,518 | 1,014,519 | u548778623 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, T, A;
cin >> N >> T >> A;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans;
long long num = pow(10, 9) + 1;
for (int i = 0; i < N; i++) {
if (abs(A - (T * 1000 - H.at(i) * 6)) <= num) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, T, A;
cin >> N >> T >> A;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans;
long long num = pow(10, 9) + 1;
for (int i = 0; i < N; i++) {
if (abs(A * 1000 - (T * 1000 - H.at(i) * 6)) <= num... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,014,522 | 1,014,523 | u868205915 | 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 res = -1;
int cc = 1000000000000000;
for (int i = 0; i < N; i++) {
int d = (T * 1000 - H.at(i) * 6) - A * 1000;
if (d < 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int res = -1;
int cc = 10000000000;
for (int i = 0; i < N; i++) {
int d = (T * 1000 - H.at(i) * 6) - A * 1000;
if (d < 0)
d = -... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,526 | 1,014,527 | u462451018 | 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);
rep(i, n) cin >> h[i];
int ans = 1e9;
int res = 0;
rep(i, n) {
int tmp = abs(t - h[i] * 0.006 - a);
if (ans >= tmp) {... | #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);
rep(i, n) cin >> h[i];
double ans = 1e9;
int res = 0;
rep(i, n) {
double tmp = abs(t - h[i] * 0.006 - a);
if (ans > t... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,014,530 | 1,014,529 | u374190629 | 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;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(a - (t - ... | #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;
cin >> n;
double t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
double res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(a -... | [
"variable_declaration.type.primitive.change"
] | 1,014,533 | 1,014,532 | u430209651 | 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;
cin >> n;
double t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(a - (t... | #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;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
double res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(... | [
"variable_declaration.type.primitive.change"
] | 1,014,531 | 1,014,534 | u430209651 | 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;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(a - (t - ... | #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;
cin >> n;
double t, a;
cin >> t >> a;
vector<double> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
double res = abs(a - (t - h[0] * 0.006));
rep(i, n) {
if (res > abs(... | [
"variable_declaration.type.primitive.change"
] | 1,014,533 | 1,014,534 | u430209651 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
vector<pair<double, int>> h;
rep(i, n) {
int x;
cin >> x;
h.emplace_back(abs(a - x * 0.006), i + 1);
}
sort(h.begin(), h.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
vector<pair<double, int>> h;
rep(i, n) {
int x;
cin >> x;
h.emplace_back(abs(a - (t - x * 0.006)), i + 1);
}
sort(h.begin... | [
"call.arguments.change"
] | 1,014,543 | 1,014,544 | u924451152 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long int
ll ans = 0;
const int N = pow(10, 5) + 20;
bool x[N] = {};
ll fanc(ll t, ll x) { return t - x * 6; }
int main() {
ll n, t, a, ans, result, includes;
cin >> n >> t >> a;
ll h;
cin >> h;
result = fanc(t, h);
ans = 1;
for (int i = 2; i <... | #include <bits/stdc++.h>
using namespace std;
#define ll long int
ll ans = 0;
const int N = pow(10, 5) + 20;
bool x[N] = {};
double fanc(ll t, ll x) { return t - x * 0.006; }
int main() {
double n, t, a, ans, result, includes;
cin >> n >> t >> a;
double h;
cin >> h;
result = fanc(t, h);
ans = 1;
for... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 1,014,545 | 1,014,546 | u798665594 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long int
ll ans = 0;
const int N = pow(10, 5) + 20;
bool x[N] = {};
ll fanc(ll t, ll x) { return t - x * 0.006; }
int main() {
ll n, t, a, ans, result, includes;
cin >> n >> t >> a;
ll h;
cin >> h;
result = fanc(t, h);
ans = 1;
for (int i = 2;... | #include <bits/stdc++.h>
using namespace std;
#define ll long int
ll ans = 0;
const int N = pow(10, 5) + 20;
bool x[N] = {};
double fanc(ll t, ll x) { return t - x * 0.006; }
int main() {
double n, t, a, ans, result, includes;
cin >> n >> t >> a;
double h;
cin >> h;
result = fanc(t, h);
ans = 1;
for... | [
"variable_declaration.type.change"
] | 1,014,547 | 1,014,546 | u798665594 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
rep(i, N) cin >> H[i];
int temp[N];
rep(i, N) { temp[i] = T * 1000 - H[i] * 6; }
int min = 10000;
int ans = 0;
rep(i, N) {
if (abs(temp[i] - A... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
rep(i, N) cin >> H[i];
int temp[N];
rep(i, N) { temp[i] = T * 1000 - H[i] * 6; }
int min = 1000000;
int ans = 0;
rep(i, N) {
if (abs(temp[i] -... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,553 | 1,014,554 | u030716762 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
rep(i, N) cin >> H[i];
int temp[N];
rep(i, N) { temp[i] = T * 1000 - H[i] * 6; }
int min = 10000;
int ans = 0;
rep(i, N) {
if (abs(temp[i] - T... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
rep(i, N) cin >> H[i];
int temp[N];
rep(i, N) { temp[i] = T * 1000 - H[i] * 6; }
int min = 1000000;
int ans = 0;
rep(i, N) {
if (abs(temp[i] -... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,555 | 1,014,554 | u030716762 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N, T, A;
double t[1001];
int res = INF;
cin >> N >> T >> A;
rep(i, N) {
double h;
cin >> h;
t[i] = abs(A - (T - h * 0.006));
}
int index = N;
rep(i, N) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
double N, T, A;
double t[1001];
double res = INF;
cin >> N >> T >> A;
rep(i, N) {
double h;
cin >> h;
t[i] = abs(A - (T - h * 0.006));
}
int index = 0;
rep(i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,014,556 | 1,014,557 | u411427373 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
int min_abs;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int ave_t = 1000 * t - (h * 6);
if (i == 0 || abs(1000 * t - ave_t) <= min_abs) {
min_abs = abs(1000 * t - ave_t);
ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
int min_abs;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int ave_t = 1000 * t - (h * 6);
if (i == 0 || abs(1000 * a - ave_t) < min_abs) {
min_abs = abs(1000 * a - ave_t);
ans = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,560 | 1,014,561 | u543466827 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
int min_abs;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int ave_t = 1000 * t - (h * 6);
if (i == 0 || abs(1000 * t - ave_t) < min_abs) {
min_abs = abs(1000 * t - ave_t);
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
int min_abs;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int ave_t = 1000 * t - (h * 6);
if (i == 0 || abs(1000 * a - ave_t) < min_abs) {
min_abs = abs(1000 * a - ave_t);
ans = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,562 | 1,014,561 | u543466827 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
int n, t, a, findID = 0;
cin >> n >> t >> a;
vector<int> h(n), w(n);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
int n, t, a;
int findID = 0;
cin >> n >> t >> a;
vector<float> h(n)... | [
"variable_declaration.type.primitive.change"
] | 1,014,563 | 1,014,564 | u356754940 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.