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 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [] | 1,013,279 | 1,013,280 | u656731444 | cpp |
p03220 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [] | 1,013,277 | 1,013,281 | u656731444 | cpp |
p03220 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespa... | [
"variable_declaration.type.change"
] | 1,013,279 | 1,013,281 | u656731444 | cpp |
p03220 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
int res = 1000;
int ans = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tem = t - h * 0.006;
if (a > tem) {
if (a - tem < res) {
res = a - t... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double res = 1000;
int ans = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tem = t - h * 0.006;
if (a > tem) {
if (a - tem < res) {
res = a - t... | [
"variable_declaration.type.primitive.change"
] | 1,013,282 | 1,013,283 | u661276889 | cpp |
p03220 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int res = 1000;
int ans = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
float tem = t - h * 0.006;
if (a > tem) {
if (a - tem < res) {
res = a - tem;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double res = 1000;
int ans = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double tem = t - h * 0.006;
if (a > tem) {
if (a - tem < res) {
res = a - t... | [
"variable_declaration.type.primitive.change"
] | 1,013,284 | 1,013,283 | u661276889 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A;
cin >> N;
cin >> T;
cin >> A;
int min_diff = 1 << 30;
int result = -1;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
/* 理想からどれだけ違うか. */
int diff = (A * 1000) - ((T * 1000) - (H * 6));
if (0 < diff)
dif... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A;
cin >> N;
cin >> T;
cin >> A;
int min_diff = 1 << 30;
int result = -1;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
/* 理想からどれだけ違うか. */
int diff = (A * 1000) - ((T * 1000) - (H * 6));
if (0 > diff)
dif... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,013,285 | 1,013,286 | u881071954 | cpp |
p03220 | #include <cstdio>
int N, T, A, X;
int main() {
scanf("%d%d%d", &N, &T, &A);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
scanf("%d", &X);
int d = ((T - X * 6) - A) * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
printf("%d\n", res);
} | #include <cstdio>
int N, T, A, X;
int main() {
scanf("%d%d%d", &N, &T, &A);
int res = 0;
int cc = 1 << 30;
for (int i = 1; i <= N; i++) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - A * 1000;
if (d < 0)
d = -d;
if (cc > d)
cc = d, res = i;
}
printf("%d\n", res);
} | [
"assignment.change"
] | 1,013,289 | 1,013,290 | u242526149 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
map<int, int> data;
int H;
double m = 1000;
rep(i, N) {
cin >> H;
data[abs(A - T + 0.006 * H)] = i + 1;
m = min(m, abs(A - T + 0.0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
map<double, int> data;
int H;
double m = 1000;
rep(i, N) {
cin >> H;
data[abs(A - T + 0.006 * H)] = i + 1;
m = min(m, abs(A - T + ... | [
"variable_declaration.type.primitive.change"
] | 1,013,293 | 1,013,294 | u114143339 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,297 | 1,013,298 | u313013569 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,013,305 | 1,013,306 | u080166565 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1002
int main() {
int N;
int T, A;
int H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = abs(A * 1000 - T * 1000 - H[i] * 6);
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (H[num] > ... | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1002
int main() {
int N;
int T, A;
int H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = abs(A * 1000 - (T * 1000 - H[i] * 6));
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (H[num] ... | [
"call.arguments.change"
] | 1,013,310 | 1,013,311 | u942850310 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1002
int main() {
int N;
int T, A;
int H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = fabs(A * 1000 - T * 1000 - H[i] * 6);
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (H[num] >... | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1002
int main() {
int N;
int T, A;
int H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = abs(A * 1000 - (T * 1000 - H[i] * 6));
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (H[num] ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,013,312 | 1,013,311 | u942850310 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1001
int main() {
int N;
double T, A;
double H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = fabs(A * 1000 - T * 1000 - H[i] * 6);
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (... | #include <iostream>
#include <math.h>
using namespace std;
#define MAXN 1002
int main() {
int N;
int T, A;
int H[MAXN + 1];
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
H[i] = abs(A * 1000 - (T * 1000 - H[i] * 6));
}
int num = 1;
for (int i = 2; i <= N; i++) {
if (H[num] ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,013,313 | 1,013,311 | u942850310 | cpp |
p03220 | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <ran... | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <ran... | [
"variable_declaration.type.primitive.change"
] | 1,013,317 | 1,013,318 | u132602393 | cpp |
p03220 | #include <algorithm>
#include <iostream>
using namespace std;
int N;
int T;
int A;
int H[1010];
double aveT[1010];
double Tdif[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++)
aveT[i] = T - H[i] * 0.0006;
for (int i = 0; i < N; i++)
Tdi... | #include <algorithm>
#include <iostream>
using namespace std;
int N;
int T;
int A;
int H[1010];
double aveT[1010];
double Tdif[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++)
aveT[i] = T - H[i] * 0.006;
for (int i = 0; i < N; i++)
Tdif... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,013,321 | 1,013,322 | u268625354 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int... | [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,013,323 | 1,013,324 | u711997425 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N, T, A;
cin >> N >> T >> A;
ll diff = INF;
ll ans = INF;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
ll temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N, T, A;
cin >> N >> T >> A;
float diff = INF;
ll ans = INF;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
floa... | [
"variable_declaration.type.change"
] | 1,013,325 | 1,013,326 | u777258731 | cpp |
p03220 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | [
"assignment.add"
] | 1,013,327 | 1,013,328 | u156778176 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | [
"variable_declaration.type.primitive.change"
] | 1,013,329 | 1,013,330 | u506464494 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,013,336 | 1,013,337 | u119171625 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 10000000000... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 10000000000... | [] | 1,013,338 | 1,013,339 | u475843109 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, sum, temp, n, a, h, x;
double dans, asum, diff, y, min = 100000.00;
vector<int> v1;
vector<double> v2, v3;
cin >> n >> h >> a;
for (i = 0; i < n; i++) {
cin >> x;
v1.push_back(x);
}
for (i = 0; i < n; i++) {
diff = (h ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, sum, temp, n, a, h, x;
double dans, asum, diff, y, min = 100000.00;
vector<int> v1;
vector<double> v2, v3;
cin >> n >> h >> a;
for (i = 0; i < n; i++) {
cin >> x;
v1.push_back(x);
}
for (i = 0; i < n; i++) {
diff = (h ... | [] | 1,013,340 | 1,013,341 | u353919145 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define cc(a) cout << a << endl;
#define msg(a, b) cout << a << " : " << b << endl;
#define msg2(a, b, c) cout << a << " : " << b << " : " << c << endl;
#define msg3(a, b, c, d) \
cout << a << " : " << b << " : " << c ... | #include <bits/stdc++.h>
using namespace std;
#define cc(a) cout << a << endl;
#define msg(a, b) cout << a << " : " << b << endl;
#define msg2(a, b, c) cout << a << " : " << b << " : " << c << endl;
#define msg3(a, b, c, d) \
cout << a << " : " << b << " : " << c ... | [
"variable_declaration.type.primitive.change",
"call.add"
] | 1,013,342 | 1,013,343 | u863370423 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int a[1010];
int min = 100000, f;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = abs(T - a[i] * 0.006 - A);
if (a[i] < min) {
min = a[i];
f = i;
}
}
cout << f + 1;
retur... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double a[1010];
double min = 100000;
int f;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = abs(T - a[i] * 0.006 - A);
if (a[i] < min) {
min = a[i];
f = i;
}
}
cout << f ... | [
"variable_declaration.type.primitive.change"
] | 1,013,344 | 1,013,345 | u863370423 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template <class T> inline bool chmax(T &a, T b)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template <class T> inline bool chmax(T &a, T b)... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,013,348 | 1,013,349 | u992723601 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> t(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
t[i] = T - 0.006 * H[i];
}
doub... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> t(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
t[i] = T - 0.006 * H[i];
}
doub... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,350 | 1,013,351 | u113960459 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> t(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
t[i] = T - 0.006 * H[i];
}
double ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
vector<double> t(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
t[i] = T - 0.006 * H[i];
}
doub... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,352 | 1,013,351 | u113960459 | 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 temp = 0;
int comptemp = INT_MAX;
int ans = 0;
for (int i = 1; i <= n; i++) {
temp = t - h.at(i - 1) * 0.006;
temp = abs(a ... | #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 temp = 0;
double comptemp = DBL_MAX;
int ans = 0;
for (int i = 1; i <= n; i++) {
temp = t - h.at(i - 1) * 0.006;
temp = abs... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,013,353 | 1,013,354 | u552331659 | cpp |
p03220 |
// auto 関数名 = [(&:ラムダ外の引数をとる時))](引数の型1 引数名1, 引数の型2,
// 引数名2, ...) { 関数の処理 }; //inside main() define function. take care of };
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
// sort(配列変数.begin(), 配列変数.end());
// do {
// // 順列に対する処理
// } while (next_permutation(配列... |
// auto 関数名 = [(&:ラムダ外の引数をとる時))](引数の型1 引数名1, 引数の型2,
// 引数名2, ...) { 関数の処理 }; //inside main() define function. take care of };
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
// sort(配列変数.begin(), 配列変数.end());
// do {
// // 順列に対する処理
// } while (next_permutation(配列... | [
"variable_declaration.type.primitive.change"
] | 1,013,355 | 1,013,356 | u340121166 | 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 maxhei = 999999;
int place = 0;
for (int i = 0; i < N; i++) {
double hei = A - (T - (h.at(i) * 0, 006));
if (hei > 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);
}
double maxhei = 999999;
int place = 0;
for (int i = 0; i < N; i++) {
double hei = A - (T - (h.at(i) * 0.006));
if (hei > 0) {
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,013,357 | 1,013,358 | u318661636 | 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 maxhei = 999999;
int place = 0;
for (int i = 0; i < N; i++) {
double hei = A - (T - h.at(i) * 0, 006);
if (hei > 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);
}
double maxhei = 999999;
int place = 0;
for (int i = 0; i < N; i++) {
double hei = A - (T - (h.at(i) * 0.006));
if (hei > 0) {
... | [] | 1,013,359 | 1,013,358 | u318661636 | 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 maxhei = 999999;
int place;
for (int i = 0; i < N; i++) {
double hei = A - (T - h.at(i) * 0, 006);
if (hei > 0) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
double maxhei = 999999;
int place = 0;
for (int i = 0; i < N; i++) {
double hei = A - (T - (h.at(i) * 0.006));
if (hei > 0) {
... | [
"variable_declaration.value.change"
] | 1,013,360 | 1,013,358 | u318661636 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | [
"variable_declaration.type.change"
] | 1,013,367 | 1,013,368 | u492447501 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,013,369 | 1,013,368 | u492447501 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,013,370 | 1,013,368 | u492447501 | cpp |
p03220 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A, ans = 1;
cin >> N >> T >> A;
vector<int> H(N), t(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
t.at(i) = T - H.at(i) * 0.006;
}
int dif = abs(t.at(0) - A);
for (int i = 1; i < N; i++) {
if (dif > abs(t.a... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, A, ans = 1;
cin >> N >> T >> A;
vector<int> H(N);
vector<float> t(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
t.at(i) = T - H.at(i) * 0.006;
}
float dif = abs(t.at(0) - A);
for (int i = 1; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,373 | 1,013,374 | u235321041 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"expression.operation.binary.add"
] | 1,013,379 | 1,013,380 | u946082956 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, t, a;
cin >> n >> t >> a;
vecto... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, t, a;
cin >> n >> t >> a;
vecto... | [
"expression.operation.binary.remove"
] | 1,013,381 | 1,013,382 | u982747006 | cpp |
p03220 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | [
"variable_declaration.type.primitive.change"
] | 1,013,383 | 1,013,384 | u705990127 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> S >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.0066;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> S >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.006;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,013,387 | 1,013,388 | u523119005 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> S >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.0066;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
c... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> S >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.006;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,013,389 | 1,013,388 | u523119005 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.0066;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
c... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, S, A, T, x, D, AnsD, AnsP = 1;
cin >> N >> S >> A;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i == 1) {
T = S - x * 0.006;
D = A - T;
if (D < 0) {
D = -D;
}
AnsD = D;
... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 1,013,390 | 1,013,388 | u523119005 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int s[N];
int l = 100000, ret;
for (int i = 0; i < N; i++) {
cin >> s[i];
s[i] = fabs((T * 1000 - s[i] * 6) - A * 1000);
if (l > s[i]) {
l = s[i];
ret = i + 1;
}
}
cout << ret << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int s[N];
int l = 100000000, re;
for (int i = 0; i < N; i++) {
cin >> s[i];
s[i] = fabs((T * 1000 - s[i] * 6) - A * 1000);
if (l > s[i]) {
l = s[i];
re = i + 1;
}
}
cout << re << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"assignment.variable.change",
"io.output.change"
] | 1,013,391 | 1,013,392 | u088805799 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double mi = 100000000, pmi = -1;
for (int i = 0; i < N; ++i) {
double h;
cin >> h;
double t = T - h * 0.006;
if (mi > abs(t - T))
mi = abs(t - T), pmi = i + 1;
}
cout << pmi << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double mi = 100000000, pmi = -1;
for (int i = 0; i < N; ++i) {
double h;
cin >> h;
double t = T - h * 0.006;
if (mi > abs(t - A))
mi = abs(t - A), pmi = i + 1;
}
cout << pmi << ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,393 | 1,013,394 | u692336506 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,013,400 | 1,013,401 | u441292535 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
struct mint {
ll x;
m... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
struct mint {
ll x;
m... | [
"variable_declaration.type.primitive.change"
] | 1,013,406 | 1,013,407 | u602267597 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
struct mint {
ll x;
m... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
struct mint {
ll x;
m... | [
"variable_declaration.type.primitive.change"
] | 1,013,408 | 1,013,407 | u602267597 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 1,013,409 | 1,013,410 | u476305001 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | [
"call.add",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,013,411 | 1,013,410 | u476305001 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
double dif =... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans = 0;
double dif =... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,013,412 | 1,013,413 | u530957410 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main() {
int n, t, a;
cin... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main() {
int n, t, a;
cin... | [
"assignment.change"
] | 1,013,414 | 1,013,415 | u296989351 | cpp |
p03220 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | [
"call.add",
"call.arguments.change"
] | 1,013,418 | 1,013,419 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
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 = 0;
double temp = 1e9;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,013,420 | 1,013,419 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | [
"call.add",
"call.arguments.change"
] | 1,013,418 | 1,013,421 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
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 = 0;
double temp = 1e9;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
double temp = 1e9;
for (int i = 0; i < n... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,013,420 | 1,013,421 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,013,422 | 1,013,423 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
int temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,013,424 | 1,013,423 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
int temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,425 | 1,013,423 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,013,422 | 1,013,426 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
int temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,424 | 1,013,426 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
int temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
int H[int(N)];
double ave[int(N)];
for (int i = 0; i < N; i++) {
cin >> H[i];
ave[i] = T - double(H[i]) * 0.006;
}
double temp = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,013,425 | 1,013,426 | u654240084 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
i... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,013,427 | 1,013,428 | u006576567 | cpp |
p03220 | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N, T, A;
int H[1200];
int main() {
cin >> N;
cin >> T >> A; //初期値
int Mind = 2000;
for (int i = 1; i < N + 1; ++i)
cin >> H[i];
int res = 1;
for (int i = 1; i < N + 1; ++i) {
int d = (T * 1000 - H[i] * 6) - A * 100... | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N, T, A;
int H[1200];
int main() {
cin >> N;
cin >> T >> A; //初期値
int Mind = 2000000;
for (int i = 1; i < N + 1; ++i)
cin >> H[i];
int res = 1;
for (int i = 1; i < N + 1; ++i) {
int d = (T * 1000 - H[i] * 6) - A * ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,429 | 1,013,430 | u023508658 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int sa = 1e6;
int ans = 0;
rep(i, n) {
double h;
cin >> h;
double x = t - (h * 0.006);
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double sa = 1e6;
int ans = 0;
rep(i, n) {
double h;
cin >> h;
double x = t - (h * 0.006);
i... | [
"variable_declaration.type.primitive.change"
] | 1,013,431 | 1,013,432 | u188332959 | cpp |
p03220 | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,013,436 | 1,013,437 | u798339690 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
int ... | [
"call.add",
"call.arguments.change"
] | 1,013,440 | 1,013,441 | u369067792 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define all(v) (v).begin(), (v).end()
int main() {
int N, T, A;
cin >> N >> T >> A;
double H_id = (T - A) / 0.006;
vector<double> H_i(N);
for (int i = 0; i < N; i++) {
cin >> H_i[i];
H_i[i] = abs(H_i[i] -... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define all(v) (v).begin(), (v).end()
int main() {
int N, T, A;
cin >> N >> T >> A;
double H_id = (T - A) / 0.006;
vector<double> H_i(N);
for (int i = 0; i < N; i++) {
cin >> H_i[i];
H_i[i] = abs(H_i[i] -... | [
"expression.operation.binary.add"
] | 1,013,444 | 1,013,445 | u895564652 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define all(v) (v).begin(), (v).end()
int main() {
int N, T, A;
cin >> N >> T >> A;
double H_id = (T - A) / 0.006;
vector<double> H_i(N);
for (int i = 0; i < N; i++) {
cin >> H_i[i];
H_i[i] = abs(H_i[i] -... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define all(v) (v).begin(), (v).end()
int main() {
int N, T, A;
cin >> N >> T >> A;
double H_id = (T - A) / 0.006;
vector<double> H_i(N);
for (int i = 0; i < N; i++) {
cin >> H_i[i];
H_i[i] = abs(H_i[i] -... | [
"identifier.change",
"call.function.change"
] | 1,013,446 | 1,013,445 | u895564652 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int T, A;
scanf("%d %d", &T, &A);
int tempMin = 1000000;
int ans;
for (int i = 0; i < N; i++) {
int H;
scanf("%d", &H);
int diff = abs(A - (T - H * 0.006));
if (diff < tempMin) {
tem... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int T, A;
scanf("%d %d", &T, &A);
double tempMin = 1000000;
int ans;
for (int i = 0; i < N; i++) {
int H;
scanf("%d", &H);
double diff = abs(A - (T - H * 0.006));
if (diff < tempMin) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,447 | 1,013,448 | u684448032 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int T, A;
scanf("%d %d", &T, &A);
int tempMin = 10000;
int ans;
for (int i = 0; i < N; i++) {
int H;
scanf("%d", &H);
int diff = abs(A - (T - H * 0.006));
if (diff < tempMin) {
tempM... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int T, A;
scanf("%d %d", &T, &A);
double tempMin = 1000000;
int ans;
for (int i = 0; i < N; i++) {
int H;
scanf("%d", &H);
double diff = abs(A - (T - H * 0.006));
if (diff < tempMin) {
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,449 | 1,013,448 | u684448032 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n, ans;
double t, a, h, tt;
int main() {
cin >> n >> t >> a;
int ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n;
double t, a, h, tt, ans;
int main() {
cin >> n >> t >> a;
int ti... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,013,452 | 1,013,453 | u063318293 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int candy = 0;
int k = 1e9 + 7;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double T = t - h * 0.006;
if (abs(a - T) < abs(a - k)) {
k = T;
candy = i + 1;
}
}
cout << candy << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int candy = 0;
double k = 1e9 + 7;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double T = t - h * 0.006;
if (abs(a - T) < abs(a - k)) {
k = T;
candy = i + 1;
}
}
cout << candy ... | [
"variable_declaration.type.primitive.change"
] | 1,013,454 | 1,013,455 | u110859855 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int T, A;
int ans;
int ave_Ans = INT_MAX;
int H[1000] = {};
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
int sa = abs(A - (T - H[i] * 0.006));
if (ave_Ans > sa) {... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int T, A;
int ans;
double ave_Ans = INT_MAX;
int H[1000] = {};
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
double sa = abs(A - (T - H[i] * 0.006));
if (ave_Ans >... | [
"variable_declaration.type.primitive.change"
] | 1,013,456 | 1,013,457 | u963353562 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
double T, A;
double H;
vector<pair<double, int>> data;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
data.push_back(make_pair(abs(A - (12 - H * 0.006)), i));
}
sort(data.begin(), data.end());
cout ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
double T, A;
double H;
vector<pair<double, int>> data;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
data.push_back(make_pair(abs(A - (T - H * 0.006)), i));
}
sort(data.begin(), data.end());
cout <... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,458 | 1,013,459 | u963353562 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int T, A;
int H;
vector<pair<int, int>> data;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
data.push_back(make_pair(abs(A - (12 - H * 0.006)), i));
}
sort(data.begin(), data.end());
cout << data.a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
double T, A;
double H;
vector<pair<double, int>> data;
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
data.push_back(make_pair(abs(A - (T - H * 0.006)), i));
}
sort(data.begin(), data.end());
cout <... | [
"variable_declaration.type.primitive.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,460 | 1,013,459 | u963353562 | 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 kion = A - (T - H.at(0) * 0.006);
int ans = 1;
for (int i = 0; i < N; i++) {
int sa = A - (T - H.at(i) * 0.006);
if (kion * kion >... | #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 kion = A - (T - H.at(0) * 0.006);
int ans = 1;
for (int i = 0; i < N; i++) {
double sa = A - (T - H.at(i) * 0.006);
if (kion * kio... | [
"variable_declaration.type.primitive.change"
] | 1,013,471 | 1,013,472 | u112249856 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
template <class t> using vc = vector<t>;
template <class t> using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first... | #include <bits/stdc++.h>
using namespace std;
template <class t> using vc = vector<t>;
template <class t> using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,013,473 | 1,013,474 | u648284535 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0, B = 0;
cin >> N;
int64_t T, A, K;
cin >> T >> A;
A *= 1000;
T *= 1000;
cin >> K;
Z = abs(A - T + 6 * K);
for (int i = 0; i < N; i++) {
int64_t k;
cin >> k;
if (abs(A - T + 6 * k) < Z) {
Z = abs(A - T + 6 * k);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0, B = 0;
cin >> N;
int64_t T, A, K;
cin >> T >> A;
A *= 1000;
T *= 1000;
cin >> K;
Z = abs(A - T + 6 * K);
for (int i = 1; i < N; i++) {
int64_t k;
cin >> k;
if (abs(A - T + 6 * k) < Z) {
Z = abs(A - T + 6 * k);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,013,475 | 1,013,476 | u158290747 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0, B = 0;
int64_t T, A, K;
cin >> T >> A;
A *= 1000;
T *= 1000;
cin >> K;
Z = abs(A - T + 6 * K);
for (int i = 0; i < N; i++) {
int64_t k;
cin >> k;
if (abs(A - T + 6 * k) < Z) {
Z = abs(A - T + 6 * k);
B = i;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0, B = 0;
cin >> N;
int64_t T, A, K;
cin >> T >> A;
A *= 1000;
T *= 1000;
cin >> K;
Z = abs(A - T + 6 * K);
for (int i = 1; i < N; i++) {
int64_t k;
cin >> k;
if (abs(A - T + 6 * k) < Z) {
Z = abs(A - T + 6 * k);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,013,477 | 1,013,476 | u158290747 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define p... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define p... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"expression.operation.binary.change"
] | 1,013,478 | 1,013,479 | u128265460 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define fi first
#define sc second
#define all(x) (x).begin(), (x).end()
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define fi first
#define sc second
#define all(x) (x).begin(), (x).end()
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
i... | [] | 1,013,484 | 1,013,485 | u450179832 | cpp |
p03220 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
// s#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 r... |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
// s#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 re... | [
"variable_declaration.type.primitive.change"
] | 1,013,486 | 1,013,487 | u278032600 | cpp |
p03220 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
// s#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 r... |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
// s#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 r... | [
"variable_declaration.type.primitive.change"
] | 1,013,486 | 1,013,488 | u278032600 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<int> a(n);
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<double> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,013,489 | 1,013,490 | u020933954 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a(n);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<double> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a... | [
"variable_declaration.type.primitive.change"
] | 1,013,491 | 1,013,490 | u020933954 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<int> a(n);
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<double> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a... | [
"variable_declaration.type.primitive.change"
] | 1,013,492 | 1,013,490 | u020933954 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<int> a(n);
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<double> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a... | [
"variable_declaration.type.primitive.change"
] | 1,013,493 | 1,013,490 | u020933954 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i <= (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<int> a(n);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int T;
cin >> T;
int A;
cin >> A;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<double> t(n);
rep(i, n) t[i] = T - h[i] * 0.006;
vector<double> a... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"variable_declaration.type.primitive.change"
] | 1,013,494 | 1,013,490 | u020933954 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n;
cin >> t >> a;
int ans = 0, min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(tmp - a))... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n;
cin >> t >> a;
int ans = 0;
double min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(... | [
"variable_declaration.type.change"
] | 1,013,502 | 1,013,503 | u574117434 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int ans = 0, min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(tmp - a)) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n;
cin >> t >> a;
int ans = 0;
double min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(... | [
"variable_declaration.type.change"
] | 1,013,504 | 1,013,503 | u574117434 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int ans, min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(tmp - a)) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h;
cin >> n;
cin >> t >> a;
int ans = 0;
double min;
for (int i = 0; i < n; i++) {
cin >> h;
double tmp = t - h * 0.006;
if (i == 0) {
ans = 0;
min = abs(tmp - a);
} else {
if (min > abs(... | [
"variable_declaration.add"
] | 1,013,505 | 1,013,503 | u574117434 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> t;
cin >> a;
int h[n];
int ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
cin ... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> t;
cin >> a;
float h[n];
float ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,506 | 1,013,507 | u583963729 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> a;
cin >> t;
int h[n];
int ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
cin ... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> t;
cin >> a;
float h[n];
float ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,508 | 1,013,507 | u583963729 | cpp |
p03220 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> a;
cin >> t;
float h[n];
float ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int_least64_t n;
cin >> n;
float t, a;
cin >> t;
cin >> a;
float h[n];
float ans[n];
float c = 0.006;
for (int i = 0; i < n; i++) {
... | [
"call.arguments.change"
] | 1,013,509 | 1,013,507 | u583963729 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<double, int>;
double n, t, a;
int main() {
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
vector<P> v(n);
rep(i, n) { v[i] = make_pair(abs(a - t - 0.006 * h[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<double, int>;
double n, t, a;
int main() {
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
vector<P> v(n);
rep(i, n) { v[i] = make_pair(abs(a - t + 0.006 * h[i]... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,013,514 | 1,013,515 | u326350779 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | [
"variable_declaration.type.primitive.change"
] | 1,013,516 | 1,013,517 | u469813907 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change"
] | 1,013,518 | 1,013,517 | u469813907 | 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 P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
int te = 1e9;
int id = -1;
rep(i, n) {
int h;
cin >> h;
double dh;
dh = t - h * 0.006;
h = abs(a - dh)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
double te = 1e9;
int id = -1;
rep(i, n) {
int h;
cin >> h;
double dh;
dh = t - h * 0.006;
dh = abs(a -... | [
"variable_declaration.type.primitive.change",
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,013,523 | 1,013,524 | u337734014 | cpp |
p03220 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,013,527 | 1,013,528 | u991713078 | cpp |
p03220 | #include <bits/stdc++.h>
#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++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | #include <bits/stdc++.h>
#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++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | [
"variable_declaration.type.widen.change"
] | 1,013,529 | 1,013,530 | u251242696 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.