problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
rep(i, N) { cin >> H.at(i); }
int index = 0;
long long m... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
rep(i, N) { cin >> H.at(i); }
int index = 0;
double min ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,014,567 | 1,014,566 | u715366261 | cpp |
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
rep(i, N) { cin >> H.at(i); }
int index = 0;
long long m... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
rep(i, N) { cin >> H.at(i); }
int index = 0;
double min ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,014,568 | 1,014,566 | u715366261 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | [
"variable_declaration.type.change"
] | 1,014,570 | 1,014,571 | u194385557 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int height;
cin >> height;
int ans = 1, minDiff = abs(A - (T - height * 0.006));
if (minDiff == 0) {
cout << 1;
return 0;
}
for (int i = 2; i <= N; i++) {
cin >> height;
int curDi... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int height;
cin >> height;
int ans = 1;
double minDiff = abs(A - (T - height * 0.006));
if (minDiff == 0) {
cout << 1;
return 0;
}
for (int i = 2; i <= N; i++) {
cin >> height;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,574 | 1,014,575 | u995932296 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
int temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} else... | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
double temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} e... | [
"variable_declaration.type.primitive.change"
] | 1,014,578 | 1,014,579 | u718758485 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
int temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} else... | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
double temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} e... | [
"variable_declaration.type.primitive.change"
] | 1,014,580 | 1,014,579 | u718758485 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
int temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} else... | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
double temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} e... | [
"variable_declaration.type.primitive.change"
] | 1,014,578 | 1,014,581 | u718758485 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
int temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} else... | #include <cmath>
#include <iostream>
int main() {
int N;
int T;
int A;
std::cin >> N >> T >> A;
double out_t;
int out_n;
for (int i = 0; i < N; i++) {
double temp_t;
std::cin >> temp_t;
temp_t = T - 0.006 * temp_t;
if (i == 0) {
out_t = std::abs(A - temp_t);
out_n = i;
} e... | [
"variable_declaration.type.primitive.change"
] | 1,014,580 | 1,014,581 | u718758485 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x;
cin >> n;
cin >> t >> a;
int res = 0;
int cc = 100000;
for (int i = 1; i <= n; i++) {
cin >> x;
int deg = (t * 1000 - x * 6) - a * 1000;
if (deg < 0)
deg = -deg;
if (deg < cc)
cc = deg, res = i;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, x;
cin >> n;
cin >> t >> a;
int res = 0;
int cc = 100000000;
for (int i = 1; i <= n; i++) {
cin >> x;
int deg = (t * 1000 - x * 6) - a * 1000;
if (deg < 0)
deg = -deg;
if (deg < cc)
cc = deg, res = i;
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,582 | 1,014,583 | u980485808 | cpp |
p03220 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans = 0;
int minDist = INT_MAX;
for (int i = 0; i < n; ++i) {
int h;
cin >> h;
int tmp = t - h * 0.006;
int dist = abs(tmp - a);
if (dist < minDist) {
minDist = di... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans = 0;
double minDist = INT_MAX;
for (int i = 0; i < n; ++i) {
int h;
cin >> h;
double tmp = t - h * 0.006;
double dist = abs(tmp - a);
if (dist < minDist) {
min... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 1,014,586 | 1,014,587 | u616461826 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<pair<int, int>> h(n);
for (int i = 0; i < n; i++) {
int height;
cin >> height;
h[i] = make_pair(abs((t - 0.006 * height) - a), i);
}
sort(h.begin(), h.end());
cout << h[0].second + 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<pair<double, int>> h(n);
for (int i = 0; i < n; i++) {
int height;
cin >> height;
h[i] = make_pair(abs((t - 0.006 * height) - a), i);
}
sort(h.begin(), h.end());
cout << h[0].second + 1 << ... | [
"variable_declaration.type.primitive.change"
] | 1,014,588 | 1,014,589 | u180716041 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
#define REP(i, m, n) for (int(i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
using namespace std;
double f(int t, int x) { return (double)t - ((double)x * 0.... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
#define REP(i, m, n) for (int(i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
using namespace std;
double f(int t, int x) { return (double)t - ((double)x * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,014,590 | 1,014,591 | u775681539 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
//入力
int N, T, A;
cin >> N >> T >> A;
int H[N];
float a[N];
int min = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
int sa = A - (T - H[i] * 0.006);
//差がマイナスだったらマイナスをかける
if (sa < 0) {
sa = -sa;
}
a[i] = sa;
... | #include <iostream>
using namespace std;
int main(void) {
//入力
int N, T, A;
cin >> N >> T >> A;
int H[N];
float a[N];
float min = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
float sa = A - (T - H[i] * 0.006);
//差がマイナスだったらマイナスをかける
if (sa < 0) {
sa = -sa;
}
a[i] = ... | [
"variable_declaration.type.primitive.change"
] | 1,014,596 | 1,014,597 | u303563078 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int target, diff, diff_min = 0xffffffff;
int ret = 1;
cin >> N;
cin >> T >> A;
int *H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
target = 500 * (T - A) / 3;
for (int i = 0; i < N; i++) {
diff = abs(targe... | #include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int target, diff, diff_min = 2147483647;
int ret = 1;
cin >> N;
cin >> T >> A;
int *H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
target = 500 * (T - A) / 3;
for (int i = 0; i < N; i++) {
diff = abs(targe... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,603 | 1,014,604 | u547448704 | 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, A, T;
cin >> N >> T >> A;
vector<pair<int, int>> H(N);
rep(i, N) {
int h;
cin >> h;
float temperature = (float)T - (float)h * 0.006;
temperature = abs(temperature - A);
H[i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, T;
cin >> N >> T >> A;
vector<pair<float, int>> H(N);
rep(i, N) {
int h;
cin >> h;
float temperature = (float)T - (float)h * 0.006;
temperature = abs(temperature - A);
H... | [
"variable_declaration.type.primitive.change"
] | 1,014,613 | 1,014,614 | u063131621 | cpp |
p03220 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector... | [
"variable_declaration.type.primitive.change"
] | 1,014,615 | 1,014,616 | u562206657 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double H[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
double alpha = 0.006;
double min_diff = abs(A - (T - H[0] * alpha));
int res = 1;
for (int i = 1; i < N; ++i) {
int diff = abs(A - (T - H[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double H[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
double alpha = 0.006;
double min_diff = abs(A - (T - H[0] * alpha));
int res = 1;
for (int i = 1; i < N; ++i) {
double diff = abs(A - (T - H... | [
"variable_declaration.type.primitive.change"
] | 1,014,619 | 1,014,620 | u374051158 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int H[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
double alpha = 0.006;
double min_diff = abs(A - (T - H[0] * alpha));
int res = 1;
for (int i = 1; i < N; ++i) {
int diff = abs(A - (T - H[i] * alp... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
double H[1100];
cin >> N >> T >> A;
for (int i = 0; i < N; ++i)
cin >> H[i];
double alpha = 0.006;
double min_diff = abs(A - (T - H[0] * alpha));
int res = 1;
for (int i = 1; i < N; ++i) {
double diff = abs(A - (T - H... | [
"variable_declaration.type.primitive.change"
] | 1,014,621 | 1,014,620 | u374051158 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
// ifst... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
cin.tie(0... | [
"variable_declaration.type.primitive.change"
] | 1,014,622 | 1,014,623 | u848433916 | cpp |
p03220 | // https://atcoder.jp/contests/abc113/tasks/abc113_b
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, t, a;
cin >> n >> ... | // https://atcoder.jp/contests/abc113/tasks/abc113_b
#include <bits/stdc++.h>
using namespace std;
using P = pair<double, int>;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
double t, a;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,624 | 1,014,625 | u858107870 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
/*
*/
void solve() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double h[n + 10];
rep(i, n) { cin >> h[i]; }
doub... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
/*
*/
void solve() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double h[n + 10];
rep(i, n) { cin >> h[i]; }
doub... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,630 | 1,014,631 | u272496669 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cout << (#x) << " = " << (x) << "\n"
#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 ALL(r) r.begin(), r.end()
#define DUP(x, y) (((x) + (y)-1) / (y))
#define YES puts("YES")
#defi... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cout << (#x) << " = " << (x) << "\n"
#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 ALL(r) r.begin(), r.end()
#define DUP(x, y) (((x) + (y)-1) / (y))
#define YES puts("YES")
#defi... | [
"variable_declaration.type.primitive.change"
] | 1,014,632 | 1,014,633 | u664394831 | cpp |
p03220 | #include <bits/stdc++.h>
// macros
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> h(N);
double res = 99999999;
int index = 0;
rep(i, 0, N) {
cin >> h[i];
double diff... | #include <bits/stdc++.h>
// macros
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> h(N);
double res = 99999999;
int index = 0;
rep(i, 0, N) {
cin >> h[i];
double diff... | [
"call.add",
"call.arguments.change"
] | 1,014,638 | 1,014,639 | u291552830 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
scanf("%lf %lf", &t, &a);
double h[n];
for (int i = 0; i < n; i++)
scanf("%lf", &h[i]);
for (int i = 0; i < n; i++) {
h[i] = a - (t - h[i] * 0.006);
if (h[i] < 0)
h[i] = 0.0 - h[i];
}
double min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
scanf("%lf %lf", &t, &a);
double h[n];
for (int i = 0; i < n; i++)
scanf("%lf", &h[i]);
for (int i = 0; i < n; i++) {
h[i] = a - (t - h[i] * 0.006);
if (h[i] < 0)
h[i] = 0.0 - h[i];
}
double min... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,646 | 1,014,647 | u319967566 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int h[1100];
cin >> n >> t >> a;
for (int i = 0; i < n; ++i)
cin >> h[i];
double min = fabs(t - h[0] * 0.006 - a);
int ans = 1;
for (int i = 0; i < n; ++i) {
double tem = t - h[i] * 0.006;
if (min > fabs(tem ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
int h[1100];
cin >> n >> t >> a;
for (int i = 0; i < n; ++i)
cin >> h[i];
double min = fabs(t - h[0] * 0.006 - a);
int ans = 1;
for (int i = 0; i < n; ++i) {
double tem = t - h[i] * 0.006;
if (min > fabs(tem ... | [
"assignment.change"
] | 1,014,650 | 1,014,651 | u912025537 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
int s = 100000;
int ans = 0;
rep(i, N) {
int x;
cin >> x;
if (abs((T - x * 0.006) - A) < s) {
ans = i + 1;
s = abs((T - x * 0.006) - A);
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, T, A;
cin >> N >> T >> A;
double s = 100000.0;
int ans = 0;
rep(i, N) {
int x;
cin >> x;
if (fabs((T - x * 0.006) - A) < s) {
ans = i + 1;
s = fabs((T - x * 0.006) - A);
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,014,656 | 1,014,657 | u108540384 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
const int INF = 1e9;
int main() {
int N;
double T, A... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
const int INF = 1e9;
int main() {
int N;
double T, A... | [
"call.arguments.change",
"assignment.change"
] | 1,014,662 | 1,014,663 | u539675863 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
const int INF = 1e9;
int main() {
int N;
double T, A... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
const int INF = 1e9;
int main() {
int N;
double T, A... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,014,664 | 1,014,663 | u539675863 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int N;
double T, A;
std::cin >> N;
std::cin >> T >> A;
int ans;
double X = 10000000.0;
double H;
for (int i = 0; i < N; i++) {
std::cin >> H;
double a = std::fabs(A - (T - H * 0.006));
if (a < X) {
X = a;
ans = i;
}
}
... | #include <cmath>
#include <iostream>
int main() {
int N;
double T, A;
std::cin >> N;
std::cin >> T >> A;
int ans;
double X = 10000000.0;
double H;
for (int i = 0; i < N; i++) {
std::cin >> H;
double a = std::fabs(A - (T - H * 0.006));
if (a < X) {
X = a;
ans = i + 1;
}
}... | [
"assignment.change"
] | 1,014,665 | 1,014,666 | u922974720 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
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 closePoint = 1 << 19;
int ans;
for (int i = 0; i < N; i++) {
double temp = T - H[i] * 0.006;
if ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
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 closePoint = 1 << 19;
int ans;
for (int i = 0; i < N; i++) {
double temp = T - H[i] * 0.006;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,667 | 1,014,668 | u835561357 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int pos = -1;
int sub = 1000;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = abs((double)a - ((double)t - 0.006 * h));
if (tmp < sub) {
sub = tmp;
pos = i + 1;
}
}
cout << pos... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int pos = -1;
double sub = 1000.0;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = abs((double)a - ((double)t - 0.006 * h));
if (tmp < sub) {
sub = tmp;
pos = i + 1;
}
}
cout <... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,673 | 1,014,674 | u595655231 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h, ans;
double tmp = 10000.;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (tmp > a - (t - h * 0.006)) {
tmp = a - (t - h * 0.006);
ans = i + 1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h, ans;
double tmp = 10000.;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (tmp > fabs(a - (t - h * 0.006))) {
tmp = fabs(a - (t - h * 0.006));
ans = i + 1;
}
}
cout << ans << endl;
return 0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,014,675 | 1,014,676 | u173648629 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define SUM(a) accumulate((a).begin(), (a).end(), 0)
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define dump(x) cerr << #x << " = " << ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define SUM(a) accumulate((a).begin(), (a).end(), 0)
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define dump(x) cerr << #x << " = " << ... | [
"variable_declaration.type.primitive.change"
] | 1,014,682 | 1,014,683 | u709304134 | cpp |
p03220 | /*
*
* Author : Amit Kumar
* Date : August 31 , 2019
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | /*
*
* Author : Amit Kumar
* Date : August 31 , 2019
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | [] | 1,014,686 | 1,014,687 | u896543512 | cpp |
p03220 | /*
*
* Author : Amit Kumar
* Date : August 31 , 2019
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | /*
*
* Author : Amit Kumar
* Date : August 31 , 2019
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | [
"identifier.change",
"call.function.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,688 | 1,014,687 | u896543512 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int num = 100000;
int t_ans;
rep(i, N) {
int h;
cin >> h;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double num = 1000000000;
int t_ans;
rep(i, N) {
int h;
cin ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,696 | 1,014,697 | u647767910 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, *h, i;
cin >> n >> t >> a;
h = new int[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (i = 1; i < n; i++) {
if (abs(a - (t - h[ans] * 0.006)) > abs(a - (t - h[i] * 0.006))) {
ans = i;
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, *h, i;
cin >> n >> t >> a;
h = new int[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (i = 1; i < n; i++) {
if (abs(a - (t - h[ans] * 0.006)) > abs(a - (t - h[i] * 0.006))) {
ans = i;
}
... | [
"expression.operation.binary.add"
] | 1,014,698 | 1,014,699 | u110383054 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, *h, i;
cin >> n >> t >> a;
h = new int[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (i = 1; i < n; i++) {
if (abs(a - (t - h[ans] * 0.006)) > abs(a - (t - h[i] * 0.006))) {
ans = i;
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, *h, i;
cin >> n >> t >> a;
h = new int[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (i = 1; i < n; i++) {
if (abs(a - (t - h[ans] * 0.006)) > abs(a - (t - h[i] * 0.006))) {
ans = i;
}
... | [
"identifier.change",
"io.output.change"
] | 1,014,700 | 1,014,699 | u110383054 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int min = t - h[0] * 0.006, minat = 1;
for (int i = 1; i < n; i++) {
int ave = t - h[i] * 0.006;
if (abs(a - min) > abs(a - ave)) {
mi... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
float min = t - h[0] * 0.006, minat = 1;
for (int i = 1; i < n; i++) {
float ave = t - h[i] * 0.006;
if (abs(a - min) > abs(a - ave)) {
... | [
"variable_declaration.type.primitive.change"
] | 1,014,701 | 1,014,702 | u907518238 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> v1(n);
for (int i = 0; i < n; i++)
cin >> v1.at(i);
// compute
int ideal = 10000;
int point = 0;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> v1(n);
for (int i = 0; i < n; i++)
cin >> v1.at(i);
// compute
float ideal = 100000;
int point = 0;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,710 | 1,014,711 | u404145225 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, t, n, d = 334, r = -1;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
double h, k, l;
cin >> h;
k = t - h * 6 / 1000;
l = k - a;
if (l < 0)
l *= -1;
if (l < d) {
d = l;
r = i;
}
}
cout << r <... | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, t, n, d = 334, r = -1;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
double h, k, l;
cin >> h;
k = t - h * 6 / 1000;
l = k - a;
if (l < 0)
l *= -1;
if (l < d) {
d = l;
r = i + 1;
}
}
cout <<... | [
"assignment.change"
] | 1,014,721 | 1,014,722 | u757584836 | 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;
vector<int> H(N);
rep(i, N) cin >> H[i];
double x = abs(T - H[0] * 0.006 - A);
int ans;
rep(i, N) {
x = min(x, abs(T - H[i] * 0.006 - A));
if (x == abs(... | #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;
vector<int> H(N);
rep(i, N) cin >> H[i];
double x = abs(T - H[0] * 0.006 - A);
int ans;
rep(i, N) {
x = min(x, abs(T - H[i] * 0.006 - A));
if (x == abs(... | [
"assignment.change"
] | 1,014,723 | 1,014,724 | u319179101 | cpp |
p03220 | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define psortsecond(A, N) \
sort(A, A + N, ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define psortsecond(A, N) \
sort(A, A + N, ... | [
"variable_declaration.type.change"
] | 1,014,735 | 1,014,736 | u008229752 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int INF = 10000000;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int s = INF;
int ans;
for (int i = 0; i < n; i++) {
int u = max((double)a, t - h[i] * 0.006)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int INF = 10000000;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
double s = INF;
int ans;
for (int i = 0; i < n; i++) {
double u =
max((double)a, t -... | [
"variable_declaration.type.primitive.change"
] | 1,014,737 | 1,014,738 | u389041967 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int H[1010];
int N, T, A, h;
double abs_temperature[1010];
int i, j;
cin >> N;
cin >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
abs_temperature[i] = fabs(A - T + 0.06 * H[i]);
}
j ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int H[1010];
int N, T, A, h;
double abs_temperature[1010];
int i, j;
cin >> N;
cin >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
abs_temperature[i] = fabs(A - T + 0.006 * H[i]);
}
j... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,751 | 1,014,752 | u544511937 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int H[1010];
int N, T, A, h;
double abs_temperature[1010];
int i, j;
cin >> N;
cin >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
abs_temperature[i] = fabs(A - T + 0.06 * H[i]);
}
j ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int H[1010];
int N, T, A, h;
double abs_temperature[1010];
int i, j;
cin >> N;
cin >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
abs_temperature[i] = fabs(A - T + 0.006 * H[i]);
}
j... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,753 | 1,014,752 | u544511937 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int ans = 1 << 30;
int f = 0;
for (int i = 0; i < N; i++) {
int H, temp;
cin >> H;
temp = (T * 1000 - H * 6) - A * 1000;
if (temp < 0)
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int ans = 1 << 30;
int f = 0;
for (int i = 0; i < N; i++) {
int H, temp;
cin >> H;
temp = (T * 1000 - H * 6) - A * 1000;
if (temp < 0)
... | [
"assignment.add"
] | 1,014,754 | 1,014,755 | u964726243 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int i;
vector<vector<int>> h(n, vector<int>(2));
for (i = 0; i < n; i++) {
cin >> h.at(i).at(0);
h.at(i).at(0) = 1000 * t - 6 * h.at(i).at(0);
h.at(i).at(0) = abs(a - h.at(i).at(0));
h.at(i).at(1) = i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int i;
vector<vector<int>> h(n, vector<int>(2));
for (i = 0; i < n; i++) {
cin >> h.at(i).at(0);
h.at(i).at(0) = 1000 * t - 6 * h.at(i).at(0);
h.at(i).at(0) = abs(1000 * a - h.at(i).at(0));
h.at(i).at... | [
"assignment.change"
] | 1,014,756 | 1,014,757 | u979163294 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
signed main() {
Int... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
signed main() {
Int... | [
"control_flow.branch.if.condition.change"
] | 1,014,758 | 1,014,759 | u902149880 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
int mini = 10000;
int ans;
int i;
for (i = 1; i <= n; i++) {
cin >> h;
int T = t - h * 0.006;
if (mini >= abs(a - T)) {
ans = i;
mini = abs(a - T);
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
double mini = 10000;
int ans;
int i;
for (i = 1; i <= n; i++) {
cin >> h;
double T = t - h * 0.006;
if (mini > abs(a - T)) {
ans = i;
mini = abs(a - T);
}
}
cout << a... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,014,760 | 1,014,761 | u111600809 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
int mini = 10000;
int ans;
int i;
for (i = 1; i <= n; i++) {
cin >> h;
int T = t - h * 0.006;
if (mini > abs(a - T)) {
ans = i;
mini = abs(a - T);
}
}
cout << ans << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
double mini = 10000;
int ans;
int i;
for (i = 1; i <= n; i++) {
cin >> h;
double T = t - h * 0.006;
if (mini > abs(a - T)) {
ans = i;
mini = abs(a - T);
}
}
cout << a... | [
"variable_declaration.type.primitive.change"
] | 1,014,762 | 1,014,761 | u111600809 | cpp |
p03220 | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.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;
int tmp = 1 << 30;
rep(i, ... | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.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;
double tmp = 1 << 30;
rep(... | [
"variable_declaration.type.primitive.change"
] | 1,014,763 | 1,014,764 | u014967455 | cpp |
p03220 | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long... | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long... | [
"call.add",
"call.arguments.change"
] | 1,014,765 | 1,014,766 | u598902504 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
int N, T, A, h;
vector<int> H;
cin >> N >> T >> A;
while (cin >> h)
H.push_back(h);
double ans, answer = 120;
int answer_i;
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
int N, T, A, h;
vector<int> H;
cin >> N >> T >> A;
while (cin >> h)
H.push_back(h);
double ans, answer = 1000000000;
int answer_i;
for (int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,769 | 1,014,770 | u457985479 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,772 | 1,014,773 | u301409936 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::vector;
#define rep(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::vector;
#define rep(... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,774 | 1,014,775 | u301409936 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int tem = 0;
int num = 999999;
int ans = 1;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
double tem = 0;
double num = 999999;
int ans = 0;
for (int i = 0; i < n; i+... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,776 | 1,014,777 | u034810328 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int tem = 0;
int num = 999999;
int ans = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
double tem = 0;
double num = 999999;
int ans = 0;
for (int i = 0; i < n; i+... | [
"variable_declaration.type.primitive.change"
] | 1,014,778 | 1,014,777 | u034810328 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = (1LL << 60);
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = (1LL << 60);
int ma... | [
"variable_declaration.type.primitive.change"
] | 1,014,779 | 1,014,780 | u052332717 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = (1LL << 60);
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = (1LL << 60);
int ma... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,781 | 1,014,780 | u052332717 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define repi(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
int diff = 1000;
int ans;
rep(i, N) {
int H;
... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define repi(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
double diff = 1000;
int ans;
rep(i, N) {
int H;... | [
"variable_declaration.type.primitive.change"
] | 1,014,782 | 1,014,783 | u162080911 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define repi(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
int diff = 1000;
int ans = 0;
rep(i, N) {
int H... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define repi(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
double diff = 1000;
int ans;
rep(i, N) {
int H;... | [
"variable_declaration.type.primitive.change"
] | 1,014,784 | 1,014,783 | u162080911 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
auto h = vector<double>(n, 0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i] = abs(t - x * 0.006 - a);
}
cout << distance(h.begin(), min_element(h... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
auto h = vector<double>(n, 0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i] = abs(t - x * 0.006 - a);
}
cout << distance(h.begin(), min_element(h... | [
"expression.operation.binary.add"
] | 1,014,785 | 1,014,786 | u533749093 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
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;
cin >> n >> t >> a;
int ans;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
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;
cin >> n >> t >> a;
int ans;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,787 | 1,014,788 | u654115954 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int ans = -1;
double best = 100000000;
rep1(i, n) {
int h;
cin >> h;
double score = abs(a - t - h * 0.006);
if (score < best) {
ans =... | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int ans = -1;
double best = 100000000;
rep1(i, n) {
int h;
cin >> h;
double score = abs(a - (t - h * 0.006));
if (score < best) {
ans... | [
"call.arguments.change"
] | 1,014,791 | 1,014,792 | u778614444 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int ans = -1;
double best = 1000000;
rep1(i, n) {
int h;
cin >> h;
double score = abs(a - t - h * 0.006);
if (score < best) {
ans = i... | #include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int ans = -1;
double best = 100000000;
rep1(i, n) {
int h;
cin >> h;
double score = abs(a - (t - h * 0.006));
if (score < best) {
ans... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,014,793 | 1,014,792 | u778614444 | cpp |
p03220 |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... | [
"variable_declaration.type.primitive.change"
] | 1,014,796 | 1,014,797 | u155985376 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1010];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
double tem[1010];
int ans = 10000000;
int ansPoint = 0;
for (int i = 1; i <= n; i++) {
tem[i] = (double)t - h[i] * 0.006;
if (ans >= abs(a ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1010];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
double tem[1010];
double ans = 10000000.0;
int ansPoint = -1;
for (int i = 1; i <= n; i++) {
tem[i] = (double)t - h[i] * 0.006;
if (ans >= ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,801 | 1,014,802 | u692131329 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define MAX 1000
int main() {
int N, T, A;
int point = 0;
double min = 100.0;
cin >> N;
cin >> T >> A;
int H[MAX];
double h[MAX];
for (int i = 0; i < N; i++) {
cin >> H[i];
h[i] = (double)(T - 0.006 * H[i]);
if (min > (double)abs(A - h[i])) {... | #include <bits/stdc++.h>
using namespace std;
#define MAX 1000
int main() {
int N, T, A;
int point = 0;
double min = 100000;
cin >> N;
cin >> T >> A;
int H[MAX];
double h[MAX];
for (int i = 0; i < N; i++) {
cin >> H[i];
h[i] = (double)(T - 0.006 * H[i]);
if (min > (double)abs(A - h[i])) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,814 | 1,014,815 | u270825463 | cpp |
p03220 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,014,816 | 1,014,817 | u366445643 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,829 | 1,014,830 | u203033720 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,831 | 1,014,830 | u203033720 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define r... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,832 | 1,014,830 | u203033720 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int n, T, A, ans = 1e9, p;
cin >> n >> T >> A;
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
double n, T, A, ans = 1e9, p;
cin >> n >> T >> A;
rep(... | [
"variable_declaration.type.primitive.change"
] | 1,014,833 | 1,014,834 | u540877546 | cpp |
p03220 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H_index = -1;
int Opt = 1000;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(A - (T - H * 0.006)) < Opt) {
Opt = abs(A - (T - H * 0.006));
H_index = i + 1;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N;
double T, A;
cin >> N >> T >> A;
int H_index = -1;
double Opt = 10000;
for (int i = 0; i < N; i++) {
double H;
cin >> H;
if (abs(A - (T - H * 0.006)) < Opt) {
Opt = abs(A - (T - H * 0.006));
H_in... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,835 | 1,014,836 | u808593466 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
signed main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> vec(N);
for (int i =... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
signed main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> vec(N);
for (int i =... | [
"variable_declaration.type.primitive.change"
] | 1,014,837 | 1,014,838 | u322714721 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0, h;
double T;
int ans = 1000;
for (int i = 0; i < n; i++) {
cin >> h;
T = t - h * 0.006;
if (abs(T - a) < ans) {
ans = abs(T - a);
index = i;
}
}
cout << index + 1 << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0, h;
double T;
double ans = 1000;
for (int i = 0; i < n; i++) {
cin >> h;
T = t - h * 0.006;
if (abs(T - a) < ans) {
ans = abs(T - a);
index = i;
}
}
cout << index + 1 <<... | [
"variable_declaration.type.primitive.change"
] | 1,014,839 | 1,014,840 | u332153950 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0, h, T;
int ans = 1000;
for (int i = 0; i < n; i++) {
cin >> h;
T = t - h * 0.006;
if (abs(T - a) < ans) {
ans = abs(T - a);
index = i;
}
}
cout << index + 1 << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0, h;
double T;
double ans = 1000;
for (int i = 0; i < n; i++) {
cin >> h;
T = t - h * 0.006;
if (abs(T - a) < ans) {
ans = abs(T - a);
index = i;
}
}
cout << index + 1 <<... | [
"variable_declaration.type.primitive.change"
] | 1,014,841 | 1,014,840 | u332153950 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
int m;
double temp;
for (int i = 0; i < n; i++) {
cin >> m;
temp = t - m * 0.006;
v.pus... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
int m;
double temp;
for (int i = 0; i < n; i++) {
cin >> m;
temp = t - m * 0.006 - a;
v... | [
"assignment.change"
] | 1,014,842 | 1,014,843 | u726604428 | cpp |
p03220 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | [
"call.add",
"call.arguments.change"
] | 1,014,844 | 1,014,845 | u422558819 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
const int N = 123456;
double a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
double t, h;
cin >> n >> t >> h;
rep(i, 1, n) { cin >> a[i]; }
int ind =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
const int N = 123456;
double a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
double t, h;
cin >> n >> t >> h;
rep(i, 1, n) { cin >> a[i]; }
int ind =... | [
"variable_declaration.type.primitive.change"
] | 1,014,846 | 1,014,847 | u095029955 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
const int N = 123456;
double a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
double t, h;
cin >> n >> t >> h;
rep(i, 1, n) { cin >> a[i]; }
int ind =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
const int N = 123456;
double a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
double t, h;
cin >> n >> t >> h;
rep(i, 1, n) { cin >> a[i]; }
int ind =... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,014,848 | 1,014,847 | u095029955 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float t, a;
cin >> t >> a;
float h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
float diff = 9999;
int idx = 0;
for (int j = 0; j < n; j++) {
float tempDiff = abs(a - (t - h[j] * 0.006));
if (diff > tempD... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float t, a;
cin >> t >> a;
float h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
float diff = 9999;
int idx = 0;
for (int j = 0; j < n; j++) {
float tempDiff = abs(a - (t - h[j] * 0.006));
if (diff > tempD... | [
"expression.operation.binary.add"
] | 1,014,851 | 1,014,852 | u318027064 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
// cout << T << endl;
int H[1001];
int best, diff, ans;
best = pow(10, 5);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
// cout << T << "T" << " " << A<< endl;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
// cout << T << endl;
int H[1001];
int best, diff, ans;
best = pow(10, 6);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
// cout << T << "T" << " " << A<< endl;
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 1,014,857 | 1,014,858 | u412659798 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int tmp = 1000000;
int ans = 1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
ll temperature = abs(a - (t - 0.006 * h));
if (temperature < tmp) {
tmp = tem... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int n;
cin >> n;
int t, a;
cin >> t >> a;
double tmp = 1000000;
int ans = 1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double temperature = abs(a - (t - 0.006 * h));
if (temperature < tmp) {
tm... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.change"
] | 1,014,872 | 1,014,873 | u030848580 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return b;
} else {
return gcd(b, amari);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool cmp(int a, int b) { return a > b;... | #include <bits/stdc++.h>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return b;
} else {
return gcd(b, amari);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool cmp(int a, int b) { return a > b;... | [
"variable_declaration.type.primitive.change"
] | 1,014,874 | 1,014,875 | u005570675 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int n, t, a, k, ans, min = 1e9;
cin >> n >> t >> a;
vector<int> h(n);
vector<int> v;
REP(i, n) {
cin >> h[i];
k = t - 0.006 * h[i];
v.push_back(abs(k - a));
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
double n, t, a, k, ans, min = 1e9;
cin >> n >> t >> a;
vector<double> h(n);
vector<double> v;
REP(i, n) {
cin >> h[i];
k = t - 0.006 * h[i];
v.push_back(abs(k ... | [
"variable_declaration.type.primitive.change"
] | 1,014,881 | 1,014,882 | u354648318 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int min = numeric_limits<int>::max();
int index = 1;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
int tmp = t - 0.006 * x;
int diff = abs(a - tmp);
if (... | #include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double min = numeric_limits<double>::max();
int index = 1;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
double tmp = t - 0.006 * x;
double diff = abs(a -... | [
"variable_declaration.type.primitive.change"
] | 1,014,883 | 1,014,884 | u100757865 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int min_dif = 10000;
int place = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(T - H * 0.006 - A) < min_dif) {
min_dif = abs(T - H * 0.006 - A);
place = i;
}
}
cout << place... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double min_dif = 10000;
int place = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(T - H * 0.006 - A) < min_dif) {
min_dif = abs(T - H * 0.006 - A);
place = i;
}
}
cout << pl... | [
"variable_declaration.type.primitive.change"
] | 1,014,885 | 1,014,886 | u536916602 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int min_dif = 1000;
int place = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(T - H * 0.006 - A) < min_dif) {
min_dif = abs(T - H * 0.006 - A);
place = i;
}
}
cout << place ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double min_dif = 10000;
int place = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (abs(T - H * 0.006 - A) < min_dif) {
min_dif = abs(T - H * 0.006 - A);
place = i;
}
}
cout << pl... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,887 | 1,014,886 | u536916602 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll t, a;
cin >> t >> a;
ll ans = 1;
ll minv = 100000;
for (int i = 1; i <= n; ++i) {
long double h;
cin >> h;
const long double th = (long double)t - h * 0.006;
if (minv > abs(a -... | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll t, a;
cin >> t >> a;
ll ans = 1;
long double minv = 100000;
for (int i = 1; i <= n; ++i) {
long double h;
cin >> h;
const long double th = (long double)t - h * 0.006;
if (minv ... | [
"variable_declaration.type.widen.change"
] | 1,014,888 | 1,014,889 | u455757400 | 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 cnt = 0;
double minnum = 10000000;
for (int i = 0; i < N; i++) {
double num = 0;
num = abs(A - T - H.at(i) * 0.006);
if (num ... | #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 cnt = 0;
double minnum = 10000000;
for (int i = 0; i < N; i++) {
double num = 0;
num = abs(A - (T - H.at(i) * 0.006));
if (nu... | [
"call.arguments.change"
] | 1,014,890 | 1,014,891 | u825405258 | 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++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, t, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, t, ... | [
"call.add",
"call.arguments.change"
] | 1,014,892 | 1,014,893 | u703214333 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 1,014,894 | 1,014,895 | u720721463 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a =... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,014,903 | 1,014,904 | u628332144 | cpp |
p03220 | #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()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0;
int dif = MOD;
rep(i, n) {
int buf;
cin >> buf;
... | #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()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int n, t, a;
cin >> n >> t >> a;
int index = 0;
double dif = MOD;
rep(i, n) {
int buf;
cin >> buf;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,905 | 1,014,906 | u494379309 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int main() {
#ifdef MYLOCAL
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int main() {
#ifdef MYLOCAL
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n... | [
"variable_declaration.type.primitive.change"
] | 1,014,907 | 1,014,908 | u335667012 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
//関数
const long INF = 1000000000000000;
int main(void) {
long N;
cin >> N;
double T, A;
cin >> T >> A;
long ans = -1, d = INF;
for (int i = 1; i <= N; i++) {
double H;
cin >> H;
if (abs((T - 0.006 * H) - A) < d) {
d = abs((T - 0.006 * H) - A)... | #include <bits/stdc++.h>
using namespace std;
//関数
const long INF = 1000000000000000;
int main(void) {
long N;
cin >> N;
double T, A;
cin >> T >> A;
long ans = -1;
double d = (double)INF;
for (int i = 1; i <= N; i++) {
double H;
cin >> H;
if (abs((T - 0.006 * H) - A) < d) {
d = abs((T ... | [
"variable_declaration.type.change"
] | 1,014,912 | 1,014,913 | u968365254 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
int n, t, a;
cin >> ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
double n, t, a;
cin ... | [
"variable_declaration.type.primitive.change"
] | 1,014,914 | 1,014,915 | u008582165 | cpp |
p03220 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int func(int n) {
int out = (n % 2 == 0) ? (n / 2) : (3 * n + 1);
return out;
}
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int min = 9999999999;
int ind = -1;
fo... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int func(int n) {
int out = (n % 2 == 0) ? (n / 2) : (3 * n + 1);
return out;
}
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double min = 999999;
int ind = -1;
for... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,918 | 1,014,919 | u476534289 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.