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 <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n, t, a, x, ans, deff = 1e9;
int main() {
cin >> n >> t >> t;
rep(i, n) {
cin >> x;
int d = abs(1000 * t - x * 6 - a * 1000);
if (d < deff) {
deff = d;
ans = i + 1;
}
}
cout << ans << endl;
... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n, t, a, x, ans, deff = 1e9;
int main() {
cin >> n >> t >> a;
rep(i, n) {
cin >> x;
int d = abs(1000 * t - x * 6 - a * 1000);
if (d < deff) {
deff = d;
ans = i + 1;
}
}
cout << ans << endl;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,015,966 | 1,015,967 | u658655325 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | [
"variable_declaration.type.primitive.change"
] | 1,015,971 | 1,015,972 | u676578971 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | [
"variable_declaration.type.primitive.change"
] | 1,015,973 | 1,015,972 | u676578971 | cpp |
p03220 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | [
"variable_declaration.type.primitive.change"
] | 1,015,974 | 1,015,972 | u676578971 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
float tem(int T0, int X0) { return T0 - X0 * 0.006; }
float myabs(float a) {
if (a <= 0)
return -a;
else
return a;
}
int main() {
int mark = 1;
int N;
float T;
float A;
cin >> N;
cin >> T >> A;
vector<float> H(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
float tem(int T0, int X0) { return T0 - X0 * 0.006; }
float myabs(float a) {
if (a <= 0)
return -a;
else
return a;
}
int main() {
int mark = 1;
int N;
float T;
float A;
cin >> N;
cin >> T >> A;
vector<float> H(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 1,015,975 | 1,015,976 | u617525345 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H[1000];
cin >> N >> T >> A;
int min = INT_MAX, ans;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (abs((T - H[i] * 0.006) - A) < min) {
min = abs((T - H[i] * 0.006) - A);
ans = i;
}
}
cout << ans + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H[1000];
cin >> N >> T >> A;
int ans;
double min = DBL_MAX;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (abs((T - H[i] * 0.006) - A) < min) {
min = abs((T - H[i] * 0.006) - A);
ans = i;
}
}
cout << ans + 1 <<... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,015,977 | 1,015,978 | u005580749 | cpp |
p03220 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, m, t, i, j, k, x, c = 1e9;
scanf("%d%d%d", &n, &t, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &x);
if (fabs(t - x * 0.006 - m) < c) {
c = fabs(t - x * 0.006 - m);
k = i;
}
}
printf("%d\n", k);
return 0;
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, m, t, i, j, k, x;
double c = 1e9;
scanf("%d%d%d", &n, &t, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &x);
if (fabs(t - x * 0.006 - m) < c) {
c = fabs(t - x * 0.006 - m);
k = i;
}
}
printf("%d\n", k);
retu... | [
"variable_declaration.type.change"
] | 1,015,979 | 1,015,980 | u677955137 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
const int maxn = 1007;
double n, x, y, t, a[maxn];
char s[maxn];
int main() {
cin >> n;
cin >> x >> y;
double k = y - x;
int ans = 1;
// cout<<k<<endl;
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
const int maxn = 1007;
double n, x, y, t, a[maxn];
char s[maxn];
int main() {
cin >> n;
cin >> x >> y;
double k = y - x;
int ans;
// cout<<k<<endl;
for (int ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,015,981 | 1,015,982 | u756545578 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, result;
double t, a, tmp = 10000000.0, hoge;
cin >> n >> t >> a;
for (int i = 0; i < n; ++i) {
cin >> hoge;
hoge = abs(a - t - hoge * 0.006);
if (hoge < tmp) {
tmp = hoge;
result = i + 1;
}
}
cout << result << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, result;
double t, a, tmp = 10000000.0, hoge;
cin >> n >> t >> a;
for (int i = 0; i < n; ++i) {
cin >> hoge;
hoge = abs(a - (t - hoge * 0.006));
if (hoge < tmp) {
tmp = hoge;
result = i + 1;
}
}
cout << result << ... | [
"call.arguments.change"
] | 1,015,987 | 1,015,988 | u599857640 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 1000 + 5;
double h[maxn];
int main() {
int n;
int T;
int A;
cin >> n;
cin >> T >> A;
int minn = 1;
double minmm = 1e20;
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 1000 + 5;
double h[maxn];
int main() {
int n;
int T;
int A;
cin >> n;
cin >> T >> A;
int minn = 1;
double minmm = 1e20;
for (int i = 0; i < n; i++)... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,015,989 | 1,015,990 | u001787660 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H[1000];
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int num, diff = 10000;
for (int i = 0; i < N; i++) {
double temp = T - H[i] * 0.006;
if (diff > abs(temp - A)) {
diff = abs(tem... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H[1000];
cin >> N;
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int num;
double diff = 10000.;
for (int i = 0; i < N; i++) {
double temp = T - H[i] * 0.006;
if (diff > abs(temp - A)) {
diff... | [
"variable_declaration.type.change"
] | 1,015,991 | 1,015,992 | u338225045 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, T, A;
cin >> N >> T >> A;
int mini = INF, ans;
rep(i, 0, N) {
int h;
cin >> h;
if (mini > abs(abs(T * 1000 - h ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, T, A;
cin >> N >> T >> A;
int mini = INF, ans;
rep(i, 0, N) {
int h;
cin >> h;
if (mini > abs(T * 1000 - h * 6 ... | [
"call.remove",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,995 | 1,015,996 | u157322125 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double mi = 1000000000;
int idx = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double diff = a - (t - h * 0.006);
if (diff < mi) {
mi = diff;
idx = i + 1;
}
}
cout << idx <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double mi = 1000000000;
int idx = -1;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
double diff = abs(a - (t - h * 0.006));
if (diff < mi) {
mi = diff;
idx = i + 1;
}
}
cout << i... | [
"call.add",
"call.arguments.change"
] | 1,015,997 | 1,015,998 | u234435881 | cpp |
p03220 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
long double T, A, H;
cin >> N >> T >> A;
int ans;
long double min = 10000000;
int tmp;
int i;
for (i = 0; i < N; i++) {
cin >> H;
... | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
long double T, A, H;
cin >> N >> T >> A;
int ans;
long double min = 10000000;
long double tmp;
int i;
for (i = 0; i < N; i++) {
ci... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,015,999 | 1,016,000 | u770161743 | cpp |
p03220 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
long double T, A, H;
cin >> N >> T >> A;
int ans;
double min = 1000;
int tmp;
int i;
for (i = 0; i < N; i++) {
cin >> H;
tmp =... | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
long double T, A, H;
cin >> N >> T >> A;
int ans;
long double min = 10000000;
long double tmp;
int i;
for (i = 0; i < N; i++) {
ci... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,016,001 | 1,016,000 | u770161743 | cpp |
p03220 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
double T, A, H;
cin >> N >> T >> A;
int ans;
double min = 1000;
int tmp;
int i;
for (i = 0; i < N; i++) {
cin >> H;
tmp = fabs... | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
long double T, A, H;
cin >> N >> T >> A;
int ans;
long double min = 10000000;
long double tmp;
int i;
for (i = 0; i < N; i++) {
ci... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,016,002 | 1,016,000 | u770161743 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int N;
double H[maxn], T, A;
int main() {
scanf("%d", &N);
scanf("%lf %lf", &T, &A);
for (int i = 1; i <= N; i++)
scanf("%lf", &H[i]);
for (int i = 1; i <= N; i++) {
H[i] = abs(T - H[i] * 0.06 - A);
}
int ans;
double tmin = 1e9;... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int N;
double H[maxn], T, A;
int main() {
scanf("%d", &N);
scanf("%lf %lf", &T, &A);
for (int i = 1; i <= N; i++)
scanf("%lf", &H[i]);
for (int i = 1; i <= N; i++) {
H[i] = abs(T - H[i] * 0.006 - A);
}
int ans;
double tmin = 1e9... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,005 | 1,016,006 | u566801415 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int n, t, x, a, h;
int main() {
cin >> n;
cin >> t >> a;
int ans, bst = 1e9;
a = a * 1000;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 6 - a) < bst) {
bst = abs(t - h * 6 - a);
ans = i + 1;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int n, t, x, a, h;
int main() {
cin >> n;
cin >> t >> a;
int ans, bst = 1e9;
a = a * 1000;
t = t * 1000;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(t - h * 6 - a) < bst) {
bst = abs(t - h * 6 - a);
ans = i + 1;
... | [
"assignment.add"
] | 1,016,023 | 1,016,024 | u824402098 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H, tmp, ans, diff;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H;
tmp = abs(T - (H * 0.006) - A);
if (i == 0) {
diff = tmp;
ans = i + 1;
}
if (tmp < diff) {
diff = tmp;
ans = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A, H, tmp, ans, diff;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
cin >> H;
tmp = abs(T - (H * 0.006) - A);
if (i == 0) {
diff = tmp;
ans = i + 1;
}
if (tmp < diff) {
diff = tmp;
ans = i + 1... | [
"variable_declaration.type.primitive.change"
] | 1,016,029 | 1,016,030 | u454145409 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H, temp, ans;
cin >> N >> T >> A >> H;
for (int i = 1; i <= N; i++) {
cin >> H;
if (abs((T * 1000 - H * 6) - A * 1000) <= temp || i == 1) {
temp = abs((T * 1000 - H * 6) - A * 1000);
ans = i;
}
}
cout... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A, H, temp, ans;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H;
if (abs((T * 1000 - H * 6) - A * 1000) <= temp || i == 1) {
temp = abs((T * 1000 - H * 6) - A * 1000);
ans = i;
}
}
cout << a... | [
"expression.operation.binary.remove"
] | 1,016,038 | 1,016,039 | u707894307 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i < N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[1] * 6) - A * 1000);
int index = 1;
for (int i = 1; i <= N; i++) {
if (abs((... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i <= N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[1] * 6) - A * 1000);
int index = 1;
for (int i = 1; i <= N; i++) {
if (abs(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,016,040 | 1,016,041 | u707894307 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i < N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[1] * 6) - A * 1000);
int index = 1;
for (int i = 1; i < N; i++) {
if (abs((T ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i <= N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[1] * 6) - A * 1000);
int index = 1;
for (int i = 1; i <= N; i++) {
if (abs(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,016,042 | 1,016,041 | u707894307 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i < N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[0] * 6) - A * 1000);
int index = 1;
for (int i = 1; i < N; i++) {
if (abs((T ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T;
cin >> T;
int A;
cin >> A;
int a[1500] = {};
for (int i = 1; i <= N; i++)
cin >> a[i];
int temp = abs((T * 1000 - a[1] * 6) - A * 1000);
int index = 1;
for (int i = 1; i <= N; i++) {
if (abs(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,016,043 | 1,016,041 | u707894307 | cpp |
p03220 | #include <iostream>
using namespace std;
int n, t, a, h;
int main() {
cin >> n >> t >> a;
int ans = 0;
int ss = 100000000;
for (int i = 1; i <= n; i++) {
cin >> h;
int d = a * 1000 - t * 1000 + h * 1000;
if (d < 0)
d = -d;
if (ss > d) {
ss = d;
ans = i;
}
}
cout << ans ... | #include <iostream>
using namespace std;
int n, t, a, h;
int main() {
cin >> n >> t >> a;
int ans = 0;
int ss = 100000000;
for (int i = 1; i <= n; i++) {
cin >> h;
int d = a * 1000 - t * 1000 + h * 6;
if (d < 0)
d = -d;
if (ss > d) {
ss = d;
ans = i;
}
}
cout << ans << ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,016,045 | 1,016,046 | u728522370 | cpp |
p03220 | #include <stdio.h>
#define MAXN 1005
int N;
int T, A;
double h[MAXN];
int main() {
scanf("%d", &N);
scanf("%d%d", &T, &A);
for (int i = 0; i < N; i++) {
int hh;
scanf("%d", &hh);
h[i] = (double)A - (double)T - (double)hh * 0.006;
if (h[i] < 0)
h[i] = -h[i];
}
double x = 1e6;
int ans =... | #include <stdio.h>
#define MAXN 1005
int N;
int T, A;
double h[MAXN];
int main() {
scanf("%d", &N);
scanf("%d%d", &T, &A);
for (int i = 0; i < N; i++) {
int hh;
scanf("%d", &hh);
h[i] = (double)A - ((double)T - (double)hh * 0.006);
if (h[i] < 0)
h[i] = -h[i];
}
double x = 1e6;
int ans... | [] | 1,016,047 | 1,016,048 | u257242995 | cpp |
p03220 | #include <cstdio>
int N, T, A, X, z, c;
int main() {
scanf("%d%d%d", &N, &T, &A);
int zz = 30000000000;
for (int i = 0; i < N; i++) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - 1000 * A;
if (d < 0)
d = -d;
if (zz >= d)
zz = d, c = i;
}
printf("%d\n", c);
}
| #include <cstdio>
int N, T, A, X, z, c;
int main() {
scanf("%d%d%d", &N, &T, &A);
int zz = 300000000;
for (int i = 1; i <= N; i++) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - 1000 * A;
if (d < 0)
d = -d;
if (zz >= d)
zz = d, c = i;
}
printf("%d\n", c);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,049 | 1,016,050 | u858042641 | cpp |
p03220 | #include <cstdio>
int N, T, A, X, z, c;
int main() {
scanf("%d%d%d", &N, &T, &A);
int zz = 300000000;
for (int i = 0; i <= N; i++) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - 1000 * A;
if (d < 0)
d = -d;
if (zz >= d)
zz = d, c = i;
}
printf("%d\n", c);
}
| #include <cstdio>
int N, T, A, X, z, c;
int main() {
scanf("%d%d%d", &N, &T, &A);
int zz = 300000000;
for (int i = 1; i <= N; i++) {
scanf("%d", &X);
int d = (T * 1000 - X * 6) - 1000 * A;
if (d < 0)
d = -d;
if (zz >= d)
zz = d, c = i;
}
printf("%d\n", c);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,016,051 | 1,016,050 | u858042641 | cpp |
p03220 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | [
"assignment.value.change",
"identifier.change"
] | 1,016,052 | 1,016,053 | u937608388 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h, min, ans = -1;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (i == 0 || min > abs(a - (t - h * 0.006))) {
min = abs(a - (t - h * 0.006));
ans = i + 1;
}
}
cout << ans << endl;
r... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h, ans = -1;
double min;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h;
if (i == 0 || min > abs(a - (t - h * 0.006))) {
min = abs(a - (t - h * 0.006));
ans = i + 1;
}
}
cout << ans << ... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,016,054 | 1,016,055 | u414939626 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
int h[1005];
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t * 1000 - (h[i] * 6);
}
int ans = abs(a - h[0]);
int answer = 0;
for (int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
int h[1005];
for (int i = 0; i < n; i++) {
cin >> h[i];
h[i] = t * 1000 - (h[i] * 6);
}
int ans = abs(a - h[0]);
int answer = 0;
for (int... | [
"io.output.change"
] | 1,016,059 | 1,016,060 | u154672915 | cpp |
p03220 | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
int best_height = 45600;
int best_id = 0;
int hi, tmp;
// printf("%d",N);
// printf("%d %d\n",T,A);
for (int i = 0; i < N; i++) {
scanf("%d", &hi);
if (abs(T - 0.006 * ... | #include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
double best_height = 45600;
int best_id = 0;
int hi, tmp;
// printf("%d",N);
// printf("%d %d\n",T,A);
for (int i = 0; i < N; i++) {
scanf("%d", &hi);
if (abs(T - 0.00... | [
"variable_declaration.type.primitive.change"
] | 1,016,061 | 1,016,062 | u086752773 | cpp |
p03220 | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, t, a;
scanf("%d %d %d", &n, &t, &a);
double min = 1000;
int h, ans;
for (int i = 0; i < n; i++) {
scanf("%d", &h);
if (abs(t - 0.006 * h - a) < min) {
min = abs(t - 0.006 * h - a);
ans = i;
}
}
printf(... | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, t, a;
scanf("%d %d %d", &n, &t, &a);
double min = 1000;
int h, ans;
for (int i = 0; i < n; i++) {
scanf("%d", &h);
if (abs(t - 0.006 * h - a) < min) {
min = abs(t - 0.006 * h - a);
ans = i + 1;
}
}
pri... | [
"assignment.change"
] | 1,016,063 | 1,016,064 | u519066440 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
h[i] = t - h[i] * 0.006;
}
int ans = 1;
int delta = 1000;
for (int i = 0; i < n; i++) {
if (a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
h[i] = t - h[i] * 0.006;
}
int ans = 1;
double delta = 1000000;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,065 | 1,016,066 | u735499035 | cpp |
p03220 |
#include <cmath>
#include <iostream>
int main() {
int N, T, A, P;
double Y = 10000;
std::cin >> N >> T >> A;
int H[N + 2];
for (int i = 1; i <= N; i++)
std::cin >> H[i];
for (int i = 1; i <= N; i++) {
double temp = std::abs(A - T - (H[i] * 0.006));
if (temp < Y) {
Y = temp;
P = i;... |
#include <cmath>
#include <iostream>
int main() {
int N, T, A, P;
double Y = 10000;
std::cin >> N >> T >> A;
int H[N + 2];
for (int i = 1; i <= N; i++)
std::cin >> H[i];
for (int i = 1; i <= N; i++) {
double temp = std::abs(A - (T - (H[i] * 0.006)));
if (temp < Y) {
Y = temp;
P = ... | [
"call.arguments.change"
] | 1,016,072 | 1,016,073 | u985625318 | cpp |
p03220 |
#include <cmath>
#include <iostream>
int main() {
int N, T, A, P;
double Y = 10000;
std::cin >> N >> T >> A;
int H[N + 1];
for (int i = 1; i <= N; i++)
std::cin >> H[i];
for (int i = 1; i <= N; i++) {
double temp = std::abs(A - T - (H[i] * 0.006));
if (temp < Y) {
Y = temp;
P = i;... |
#include <cmath>
#include <iostream>
int main() {
int N, T, A, P;
double Y = 10000;
std::cin >> N >> T >> A;
int H[N + 2];
for (int i = 1; i <= N; i++)
std::cin >> H[i];
for (int i = 1; i <= N; i++) {
double temp = std::abs(A - (T - (H[i] * 0.006)));
if (temp < Y) {
Y = temp;
P = ... | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,016,074 | 1,016,073 | u985625318 | cpp |
p03220 | #include <cfloat>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int *h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double min = -DBL_MAX;
int index = 0;
for (int i = 0; i < n; i++) {
if (abs(a - (t - 0.... | #include <cfloat>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int *h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double min = DBL_MAX;
int index = 0;
for (int i = 0; i < n; i++) {
if (abs(a - (t - 0.0... | [
"expression.operation.unary.arithmetic.remove"
] | 1,016,077 | 1,016,078 | u149945867 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, in, ans;
double mindis;
cin >> n;
cin >> t;
cin >> a;
cin >> in;
mindis = fabs(a - (t - in * 0.006));
ans = 1;
for (int i = 0; i < n - 1; i++) {
cin >> in;
int tmp = fabs(a - (t - in * 0.006));
if (tmp < ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, in, ans;
double mindis;
cin >> n;
cin >> t;
cin >> a;
cin >> in;
mindis = fabs(a - (t - in * 0.006));
ans = 1;
for (int i = 0; i < n - 1; i++) {
cin >> in;
double tmp = fabs(a - (t - in * 0.006));
if (tmp... | [
"variable_declaration.type.primitive.change"
] | 1,016,089 | 1,016,090 | u385300954 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, in, mindis, ans;
cin >> n;
cin >> t;
cin >> a;
cin >> in;
mindis = fabs(a - (t - in * 0.006));
ans = 1;
for (int i = 0; i < n - 1; i++) {
cin >> in;
int tmp = fabs(a - (t - in * 0.006));
if (tmp < mindis) {... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, in, ans;
double mindis;
cin >> n;
cin >> t;
cin >> a;
cin >> in;
mindis = fabs(a - (t - in * 0.006));
ans = 1;
for (int i = 0; i < n - 1; i++) {
cin >> in;
double tmp = fabs(a - (t - in * 0.006));
if (tmp... | [
"variable_declaration.remove",
"variable_declaration.add",
"variable_declaration.type.primitive.change"
] | 1,016,091 | 1,016,090 | u385300954 | cpp |
p03220 | #include <cmath>
#include <stdio.h>
int GetAverageTemperatureX1000(int T, int x) { return T * 1000 - x * 0.006; }
int main() {
int N, T, A;
int resultIndex;
int mindef = 1000000000;
scanf("%d", &N);
scanf("%d %d", &T, &A);
for (int i = 1; i <= N; i++) {
int h;
scanf("%d", &h);
int currentDef... | #include <cmath>
#include <stdio.h>
int GetAverageTemperatureX1000(int T, int x) { return T * 1000 - x * 6; }
int main() {
int N, T, A;
int resultIndex;
int mindef = 1000000000;
scanf("%d", &N);
scanf("%d %d", &T, &A);
for (int i = 1; i <= N; i++) {
int h;
scanf("%d", &h);
int currentDef = (... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,016,092 | 1,016,093 | u051981922 | cpp |
p03220 | //おまじない
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << en... | //おまじない
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << en... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,016,094 | 1,016,095 | u297203024 | cpp |
p03220 | #include <bits/stdc++.h>
#define ll long long
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout << s, 0
#define int long long
using namespace std;
double n, t, a, h[1005];
signed main() {
ios_base... | #include <bits/stdc++.h>
#define ll long long
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout << s, 0
#define int long long
using namespace std;
double n, t, a, h[1005];
signed main() {
ios_base... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,098 | 1,016,099 | u022510862 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int sa = 1000000000;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
double k = t - a - x * 0.006;
if (k < 0)
k = -k;
if (sa > k)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double sa = 1000000000;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
double k = t - a - x * 0.006;
if (k < 0)
k = -k;
if (sa >... | [
"variable_declaration.type.primitive.change"
] | 1,016,104 | 1,016,105 | u843842420 | cpp |
p03220 | #include <bits/stdc++.h>
#define FIN freopen("input/in.txt", "r", stdin)
#define FOUT freopen("output/out.txt", "w", stdout)
using namespace std;
typedef long long LL;
typedef unsigned u;
typedef unsigned long long ull;
typedef long double ld;
const int MAXN = 2e5 + 5;
const int MAXM = 5e6 + 5;
const double eps = 1e-8... | #include <bits/stdc++.h>
#define FIN freopen("input/in.txt", "r", stdin)
#define FOUT freopen("output/out.txt", "w", stdout)
using namespace std;
typedef long long LL;
typedef unsigned u;
typedef unsigned long long ull;
typedef long double ld;
const int MAXN = 2e5 + 5;
const int MAXM = 5e6 + 5;
const double eps = 1e-8... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,016,110 | 1,016,111 | u619004341 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (in... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,016,112 | 1,016,113 | u039805629 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans = 1;
int x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
x[i] = abs(t - x[i] * 0.006 - a);
}
cout << 1 + (min_element(x, x + n) - x) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans = 1;
double x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
x[i] = abs(t - x[i] * 0.006 - a);
}
cout << 1 + (min_element(x, x + n) - x) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 1,016,116 | 1,016,117 | u280512618 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double T, A;
cin >> T >> A;
double H;
int ans = 0;
int value = 0;
for (int i = 0; i < N; i++) {
cin >> H;
if (i == 0) {
ans = i + 1;
value = abs(A - (T - 0.006 * H));
} else {
if (abs(A - (T ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double T, A;
cin >> T >> A;
double H;
int ans = 0;
double value = 0;
for (int i = 0; i < N; i++) {
cin >> H;
if (i == 0) {
ans = i + 1;
value = abs(A - (T - 0.006 * H));
} else {
if (abs(A - ... | [
"variable_declaration.type.primitive.change"
] | 1,016,118 | 1,016,119 | u618697411 | cpp |
p03220 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
int N;
int T;
int A;
int H;
int iMin;
int iNum;
int iNew;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
cin >> T;
cin >> A;
T *= 1000;
A *= 1000;
iMin = 1000000000;
iNum = 0;
for (i = 1; i <= N; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
int N;
int T;
int A;
int H;
int iMin;
int iNum;
int iNew;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
cin >> T;
cin >> A;
T *= 1000;
A *= 1000;
iMin = 1000000000;
iNum = 0;
for (i = 1; i <= N; i++) {
c... | [
"assignment.change"
] | 1,016,120 | 1,016,121 | u627562722 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
cin >> h;
double min = abs(a - (t - h * 0.006));
int id = 0;
for (int i = 1; i < n; i++) {
cin >> h;
int tmp = abs(a - (t - h * 0.006));
if (min > tmp) {
min ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h;
cin >> h;
double min = abs(a - (t - h * 0.006));
int id = 0;
for (int i = 1; i < n; i++) {
cin >> h;
double tmp = abs(a - (t - h * 0.006));
if (min > tmp) {
m... | [
"variable_declaration.type.primitive.change"
] | 1,016,122 | 1,016,123 | u158758819 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
int h[1005];
int id;
double d;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
int h[1005];
int id;
double d;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {... | [
"assignment.add"
] | 1,016,124 | 1,016,125 | u352067440 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,126 | 1,016,127 | u095826906 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,128 | 1,016,127 | u095826906 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | [
"variable_declaration.type.primitive.change"
] | 1,016,129 | 1,016,130 | u185034753 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int n, a;
double t;
double min = 999999999;
int min_num;
std::cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int h;
std::cin >> h;
if (min > std::abs(a - t - h * 0.006)) {
min = std::abs(a - t - h * 0.006);
min_num = i;
}
}
... | #include <cmath>
#include <iostream>
int main() {
int n, a;
double t;
double min = 999999999;
int min_num;
std::cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int h;
std::cin >> h;
if (min > std::abs(a - (t - h * 0.006))) {
min = std::abs(a - (t - h * 0.006));
min_num = i;
}
... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,016,133 | 1,016,134 | u718277423 | 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];
}
double mini = 0, minh = abs(t - h[0] * 0.006 - a);
for (int i = 1; i < n; i++) {
if (abs(t - h[i] * 0.006 - a) < minh) {
minh = abs(... | #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];
}
double mini = 0, minh = abs(t - h[0] * 0.006 - a);
for (int i = 1; i < n; i++) {
if (abs(t - h[i] * 0.006 - a) < minh) {
minh = abs(... | [
"expression.operation.binary.add"
] | 1,016,135 | 1,016,136 | u852130183 | cpp |
p03220 | /*
Copyright: razouq (c)
Author: Anass BENDARSI
Date: 04/11/2018 13:06:56
flamers will **** you
*/
//#include<flamers.h>
#include "bits/stdc++.h"
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#define ll long long
#define ull unsigned long long
#define F first
#define S second
#d... | /*
Copyright: razouq (c)
Author: Anass BENDARSI
Date: 04/11/2018 13:06:56
flamers will **** you
*/
//#include<flamers.h>
#include "bits/stdc++.h"
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#define ll long long
#define ull unsigned long long
#define F first
#define S second
#d... | [
"call.arguments.change"
] | 1,016,137 | 1,016,138 | u179184333 | cpp |
p03220 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define int long long
#define LONG LLONG_MAX / 3;
#define INT INT_MAX / 3;
#define mod 1000000007
typedef long long ll;
using namespace std;
int mypow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return mypo... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define int long long
#define LONG LLONG_MAX / 3;
#define INT INT_MAX / 3;
#define mod 1000000007
typedef long long ll;
using namespace std;
int mypow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return mypo... | [
"call.add",
"call.arguments.change"
] | 1,016,139 | 1,016,140 | u259210975 | cpp |
p03220 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = std::min(x, y);
in... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
int gcd(int x, int y) {
x = std::abs(x);
y = std::abs(y);
int a = std::max(x, y), b = std::min(x, y);
in... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 1,016,143 | 1,016,144 | u299647642 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int n, t, a;
scanf("%d %d %d", &n, &t, &a);
int diff = 10000000;
int result = 0;
int h[n];
for (int i = 0; i < n; i++) {
scanf("%d", h + i);
int avg = t - h[i] * 0.006;
if (abs(avg - a) < diff) {
... | #include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int n, t, a;
scanf("%d %d %d", &n, &t, &a);
float diff = 10000000;
int result = 1;
int h[n];
for (int i = 0; i < n; i++) {
scanf("%d", h + i);
float avg = t - h[i] * 0.006;
if (abs(avg - a) < diff) {
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,150 | 1,016,151 | u374165283 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | [
"call.arguments.change"
] | 1,016,152 | 1,016,153 | u874039158 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int t, a;
cin >> N;
cin >> t >> a;
int H[N];
int min = 1000000;
int idx = 0;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
double b = t - c * 0.006 - ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int t, a;
cin >> N;
cin >> t >> a;
int H[N];
double min = 1000000;
int idx = 0;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
double b = t - c * 0.006... | [
"variable_declaration.type.primitive.change"
] | 1,016,154 | 1,016,155 | u185294445 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int t, a;
cin >> N;
cin >> t >> a;
int H[N];
int min = 10000;
int idx = 0;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
double b = t - c * 0.006 - a;... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int t, a;
cin >> N;
cin >> t >> a;
int H[N];
double min = 1000000;
int idx = 0;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
double b = t - c * 0.006... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,156 | 1,016,155 | u185294445 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000001
using namespace std;
#define ll long long
#define dbg if (0)
int main() {
ll n, t, a;
ll ansnum;
ll ans;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int tmp;
ci... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000001
using namespace std;
#define ll long long
#define dbg if (0)
int main() {
ll n, t, a;
ll ansnum;
ll ans;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
int tmp;
ci... | [
"call.add",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,016,157 | 1,016,158 | u828752458 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n, t, a;
int main() {
cin >> n >> t >> a;
int h;
int d = INT_MAX;
int m = -1;
for (int i = 0; i < n; i++) {
cin >> h;
if (d > abs(a - (t - 0.006 * h))) {
d = abs(a - (t - 0.006 * h));
m = i + 1;
}
}
cout << m << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
double n, t, a;
int main() {
cin >> n >> t >> a;
double h;
double d = DBL_MAX;
int m = -1;
for (int i = 0; i < n; i++) {
cin >> h;
if (d > abs(a - (t - 0.006 * h))) {
d = abs(a - (t - 0.006 * h));
m = i + 1;
}
}
cout << m << endl;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,016,168 | 1,016,169 | u806601169 | cpp |
p03220 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
int n, cnt;
int a[500000];
// llじゃなくて大丈夫か？
int main() {
int n, t, a;
cin >> n >... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
int n, cnt;
int a[500000];
// llじゃなくて大丈夫か？
int main() {
int n, t, a;
cin >> n >... | [
"variable_declaration.type.change"
] | 1,016,170 | 1,016,171 | u317754719 | cpp |
p03220 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
int n, cnt;
int a[500000];
// llじゃなくて大丈夫か？
int main() {
int n, t, a;
cin >> n >... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
int n, cnt;
int a[500000];
// llじゃなくて大丈夫か？
int main() {
int n, t, a;
cin >> n >... | [
"variable_declaration.type.change"
] | 1,016,172 | 1,016,171 | u317754719 | cpp |
p03220 | #include <bits/stdc++.h>
#define reg register
using namespace std;
typedef long long ll;
int n;
int ansid;
double ansd = 1e18, T, A;
int main() {
scanf("%d%lf%lf", &n, &T, &A);
for (reg int i = 1, x; i <= n; i++) {
scanf("%d", &x);
reg double delta = T - (double)x * .006;
if (fabs(delta - T) < fabs(ansd... | #include <bits/stdc++.h>
#define reg register
using namespace std;
typedef long long ll;
int n;
int ansid;
double ansd = 1e18, T, A;
int main() {
scanf("%d%lf%lf", &n, &T, &A);
for (reg int i = 1, x; i <= n; i++) {
scanf("%d", &x);
reg double delta = T - (double)x * .006;
if (fabs(delta - A) < fabs(ansd... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,016,175 | 1,016,176 | u969675036 | cpp |
p03220 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [] | 1,016,177 | 1,016,178 | u539339654 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int ans;
double mi = 1e9;
for (int i = 1; i <= n; i++) {
double k;
cin >> k;
if (fabs(k * 0.006 - a) < mi)
ans = i, mi = fabs(k * 0.006 - a);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int ans;
double mi = 1e9;
for (int i = 1; i <= n; i++) {
double k;
cin >> k;
if (fabs(t - k * 0.006 - a) < mi)
ans = i, mi = fabs(t - k * 0.006 - a);
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,016,182 | 1,016,183 | u676323984 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stri... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,016,184 | 1,016,185 | u587248350 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (auto &i : h)
cin >> i;
double mn = INF;
int mnindex = -1;
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<double> h(n);
for (auto &i : h)
cin >> i;
double mn = INF;
int mnindex = -1;
for (int i = 0; i < n; +... | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,186 | 1,016,187 | u268977772 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"assignment.change",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,016,188 | 1,016,189 | u310790595 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, A;
int N, ans = -1, ans_m = (int)1e9;
cin >> N >> T >> A;
double H[N];
for (int i = 0; i < N; ++i)
cin >> H[i];
for (int i = 0; i < N; ++i) {
if (abs(A - (T - H[i] * 0.006)) < ans_m) {
ans_m = abs(A - (T - H[i] * 0.006));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, A;
int N, ans = -1;
double ans_m = (double)1e9;
cin >> N >> T >> A;
double H[N];
for (int i = 0; i < N; ++i)
cin >> H[i];
for (int i = 0; i < N; ++i) {
if (abs(A - (T - H[i] * 0.006)) < ans_m) {
ans_m = abs(A - (T - H[i]... | [
"variable_declaration.type.primitive.change"
] | 1,016,195 | 1,016,196 | u694951525 | cpp |
p03220 | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll n, t, a, h[1010];
int main() {
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++) {
std::... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll n, t, a, h[1010];
int main() {
std::cin >> n;
std::cin >> t >> a;
for (int i = 0; i < n; i++) {
std::... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,197 | 1,016,198 | u121794232 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
int n, t, a, h[1001], k = 0;
cin >> n >> t >> a;
t *= 1000;
a += 1000;
h[0] = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> h[i];
h[i] = abs(t - 6 * h[i] - a);
if (h[i] < h[k]) {
k = i;
}
}
cout << k << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, t, a, h[1001], k = 0;
cin >> n >> t >> a;
t *= 1000;
a *= 1000;
h[0] = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> h[i];
h[i] = abs(t - 6 * h[i] - a);
if (h[i] < h[k]) {
k = i;
}
}
cout << k << endl;
}
| [
"expression.operator.change"
] | 1,016,199 | 1,016,200 | u024809932 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
int n, t, a, h[1001], k = 0;
cin >> n >> t >> a;
t += 1000;
h[0] = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> h[i];
h[i] = abs(t - 6 * h[i] - a);
if (h[i] < h[k]) {
k = i;
}
}
cout << k << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, t, a, h[1001], k = 0;
cin >> n >> t >> a;
t *= 1000;
a *= 1000;
h[0] = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> h[i];
h[i] = abs(t - 6 * h[i] - a);
if (h[i] < h[k]) {
k = i;
}
}
cout << k << endl;
}
| [
"expression.operator.change",
"assignment.add"
] | 1,016,201 | 1,016,200 | u024809932 | cpp |
p03220 | #include <bits/stdc++.h>
#define int long long
const int maxn = 100100;
const int inf = 0x3f3f3f3f;
inline int read() {
register int g = 1;
register char ch;
while (!isdigit(ch = getchar()))
if (ch == '-')
g = -1;
register int x = ch ^ '0';
while (isdigit(ch = getchar()))
x = (((x << 2) + x) <... | #include <bits/stdc++.h>
#define int long long
const int maxn = 100100;
const int inf = 0x3f3f3f3f;
inline int read() {
register int g = 1;
register char ch;
while (!isdigit(ch = getchar()))
if (ch == '-')
g = -1;
register int x = ch ^ '0';
while (isdigit(ch = getchar()))
x = (((x << 2) + x) <... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,204 | 1,016,205 | u003210082 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
vec... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
double t, a;
cin >> n;
cin >> t >> a;
vec... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,016,206 | 1,016,207 | u704411633 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#pragma region
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r);... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#pragma region
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r);... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,016,210 | 1,016,211 | u215122692 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T, A;
int ans = -1;
int ansabs = 1000000000;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
double t = abs(T - x * 0.006 - A);
if (t <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T, A;
int ans = -1;
double ansabs = 1000000000.0;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
double t = abs(T - x * 0.006 - A);
if... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,016,212 | 1,016,213 | u453764945 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
... | [
"variable_declaration.type.primitive.change"
] | 1,016,214 | 1,016,215 | u799021348 | 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 rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"assignment.change"
] | 1,016,216 | 1,016,217 | u096883693 | 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 rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,218 | 1,016,217 | u096883693 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = ... | [
"call.arguments.change"
] | 1,016,219 | 1,016,220 | u591883167 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int H[1010];
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans, d = INT_MAX;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs((T * 1000 - H * 6) - A) < d) {
d = abs((T * 1000 - H * 6) - A);
ans = i;
}
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
int H[1010];
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans, d = INT_MAX;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs((T * 1000 - H * 6) - A * 1000) < d) {
d = abs((T * 1000 - H * 6) - A * 1000);
ans = i;
}
}
cout <... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,016,223 | 1,016,224 | u296096665 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int H[1010];
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans, d = INT_MAX;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs((T * 100 - H * 6) - A) < d) {
d = abs((T * 100 - H * 6) - A);
ans = i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int H[1010];
int main() {
int N, T, A;
cin >> N >> T >> A;
int ans, d = INT_MAX;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
if (abs((T * 1000 - H * 6) - A * 1000) < d) {
d = abs((T * 1000 - H * 6) - A * 1000);
ans = i;
}
}
cout <... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,016,225 | 1,016,224 | u296096665 | cpp |
p03220 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P std::pair<int, int>
#define double long double
#define prique priority_queue<int, vector<int>, greater<int>>
#define INF LLONG_MAX / 3
#define inf INT_MAX / 3
#define moder 100000
typedef long long ll;
using namespace... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P std::pair<int, int>
#define double long double
#define prique priority_queue<int, vector<int>, greater<int>>
#define INF LLONG_MAX / 3
#define inf INT_MAX / 3
#define moder 100000
typedef long long ll;
using namespace... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,016,226 | 1,016,227 | u379822620 | cpp |
p03220 | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int n, t, A, ans;
double Min = INF;
double abss(double x) { return x < 0 ? -x : x; }
int main() {
... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int n, t, A, ans;
double Min = INF, tem;
double abss(double x) { return x < 0 ? -x : x; }
int main(... | [
"variable_declaration.add",
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,016,228 | 1,016,229 | u554106628 | cpp |
p03220 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int ans = -1;
double def = 1000000;
for (int i = 0; i < n; i++) {
cin >> h;
if (def > abs((double)t - h * 0.006 - t)) {
ans = i + 1;
def = abs((double)t - h * 0.006 - t);
... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
int ans = -1;
double def = 1000000;
for (int i = 0; i < n; i++) {
cin >> h;
if (def > abs((double)t - h * 0.006 - a)) {
ans = i + 1;
def = abs((double)t - h * 0.006 - a);
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,230 | 1,016,231 | u623115612 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,016,232 | 1,016,233 | u479953984 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,016,234 | 1,016,233 | u479953984 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int hmk;
cin >> hmk;
float zerotemp, wanttemp;
cin >> zerotemp >> wanttemp;
vector<float> htati(hmk);
for (int i = 0; i < hmk; i++) {
cin >> htati.at(i);
}
vector<float> tempati(hmk);
for (int i = 0; i < hmk; i++) {
tempati.at(i) = ze... | #include <bits/stdc++.h>
using namespace std;
int main() {
int hmk;
cin >> hmk;
float zerotemp, wanttemp;
cin >> zerotemp >> wanttemp;
vector<float> htati(hmk);
for (int i = 0; i < hmk; i++) {
cin >> htati.at(i);
}
vector<float> tempati(hmk);
for (int i = 0; i < hmk; i++) {
tempati.at(i) = ze... | [
"expression.operation.binary.remove"
] | 1,016,239 | 1,016,240 | u165267345 | cpp |
p03220 | #include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[10005];
int pj[1005];
int m[1005];
int x = 1000000;
int main() {
int n;
int t, q;
scanf("%d", &n);
scanf("%d %d", &t, &q);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i... | #include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[10005];
float pj[1005];
float m[1005];
float x = 1000000;
int main() {
int n;
int t, q;
scanf("%d", &n);
scanf("%d %d", &t, &q);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,016,247 | 1,016,248 | u504805007 | cpp |
p03220 | #include <algorithm>
#include <functional>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
int min_index;
float H[N];
float tem[N];
for (int i = 0; i < N; i++) {
scanf("%f", &H[i]);
H[i] = fabs(A - (T... | #include <algorithm>
#include <functional>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, T, A;
scanf("%d", &N);
scanf("%d %d", &T, &A);
int min_index;
float H[N];
float tem[N];
for (int i = 0; i < N; i++) {
scanf("%f", &H[i]);
H[i] = fabs(A - (T... | [
"variable_declaration.type.primitive.change"
] | 1,016,251 | 1,016,252 | u510039320 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
double a = 0, b = 0, ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
double a = 0, b = 0, ... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,016,255 | 1,016,256 | u142996493 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
ll a = 0, b = 0, c = ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
double a = 0, b = 0, ... | [
"variable_declaration.type.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,016,257 | 1,016,256 | u142996493 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
double ans = 9999999999;
int aa = 0;
int N;
double A, T;
double h = 0;
cin >> N;
cin >> T >> A;
rep(i, N) {
cin >> h;
double temp = T - h *... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
double ans = 9999999999;
int aa = 0;
int N;
double A, T;
double h = 0;
cin >> N;
cin >> T >> A;
rep(i, N) {
cin >> h;
double temp = T - h *... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,016,258 | 1,016,259 | u657611449 | cpp |
p03220 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
int i, B;
int U = 1000000;
int H[1000];
double M[1000];
double K[1000];
cin >> N >> T >> A;
for (i = 0; i < N; ++i)
cin >> H[i];
for (i = 0; i < N; ++i)
M[i] = T - H[i] * 0.006;
for (i = 0; i < N; ++i) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
int i, B;
double U = 1000000;
int H[1000];
double M[1000];
double K[1000];
cin >> N >> T >> A;
for (i = 0; i < N; ++i)
cin >> H[i];
for (i = 0; i < N; ++i)
M[i] = T - H[i] * 0.006;
for (i = 0; i < N; ++i)... | [
"variable_declaration.type.primitive.change"
] | 1,016,262 | 1,016,263 | u109792330 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
int d = 100000000;
int p;
cin >> n >> t >> a;
vector<double> vec(n);
vector<double> vecx(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
for (int i = 0; i < n; i++)
vecx.at(i) = fabs(t - 0.006 * vec.at(i) - a);
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
double d = 100000000;
int p;
cin >> n >> t >> a;
vector<double> vec(n);
vector<double> vecx(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
for (int i = 0; i < n; i++)
vecx.at(i) = abs(t - 0.006 * vec.at(i) - a);
for (i... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,016,268 | 1,016,269 | u209011781 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
int d = 100000000;
int p;
cin >> n >> t >> a;
vector<double> vec(n);
vector<double> vecx(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
for (int i = 0; i < n; i++)
vecx.at(i) = abs(t - 0.006 * vec.at(i) - a);
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
double d = 100000000;
int p;
cin >> n >> t >> a;
vector<double> vec(n);
vector<double> vecx(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
for (int i = 0; i < n; i++)
vecx.at(i) = abs(t - 0.006 * vec.at(i) - a);
for (i... | [
"variable_declaration.type.primitive.change"
] | 1,016,270 | 1,016,269 | u209011781 | cpp |
p03220 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF (2e9)
#define EPS (1e-7)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, t, a;
cin >> ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF (2e9)
#define EPS (1e-7)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, t, a;
cin >> ... | [
"variable_declaration.type.primitive.change"
] | 1,016,273 | 1,016,274 | u618512227 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.