problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03220 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"call.arguments.change"
] | 1,013,899 | 1,013,900 | u407213771 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int ans = 0;
int mn = 10000;
rep(i, n) {
double h;
cin >> h;
double ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int ans = 0;
double mn = 10000;
rep(i, n) {
double h;
cin >> h;
doub... | [
"variable_declaration.type.primitive.change"
] | 1,013,901 | 1,013,902 | u068713120 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int ans = 0;
int mn = 10000;
rep(i, n) {
int h;
cin >> h;
int d = ab... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int ans = 0;
double mn = 10000;
rep(i, n) {
double h;
cin >> h;
doub... | [
"variable_declaration.type.primitive.change"
] | 1,013,903 | 1,013,902 | u068713120 | cpp |
p03220 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | [
"variable_declaration.type.change"
] | 1,013,904 | 1,013,905 | u425758699 | cpp |
p03220 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,906 | 1,013,905 | u425758699 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, T, A, ans;
cin >> N >> T >> A;
int64_t minDif = 1000000000;
T *= 1000;
A *= 1000;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int tmp = A - H * 6;
if (abs(T - tmp) < minDif) {
minDif = abs(T - tmp);
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, T, A, ans;
cin >> N >> T >> A;
int64_t minDif = 1000000000;
T *= 1000;
A *= 1000;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
int tmp = T - H * 6;
if (abs(A - tmp) < minDif) {
minDif = abs(A - tmp);
a... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,013,907 | 1,013,908 | u735528230 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<double> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<double> diff(n);
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<double> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<double> diff(n);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,911 | 1,013,912 | u372622736 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<int> diff(n);
for (int i = 0; i < n; i++) {
diff[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<double> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<double> diff(n);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,913 | 1,013,912 | u372622736 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<int> diff(n);
for (int i = 0; i < n; i++) {
diff[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<double> temp(n);
for (int i = 0; i < n; i++) {
temp[i] = t - h[i] * 0.006;
}
vector<double> diff(n);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,013,915 | 1,013,912 | u372622736 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, t, ans;
cin >> n >> a >> t;
a *= 1000, t *= 1000;
int min = 1000000000;
for (int i = 0, h; i < n; i++) {
cin >> h;
if (abs(t - h * 6 - a) < min) {
min = abs(t - h * 6 - a);
ans = i + 1;
}
}
cout << ans << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, t, ans;
cin >> n >> t >> a;
a *= 1000, t *= 1000;
int min = 1100001;
for (int i = 0, h; i < n; i++) {
cin >> h;
if (abs(t - h * 6 - a) < min) {
min = abs(t - h * 6 - a);
ans = i + 1;
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,918 | 1,013,919 | u154898295 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a, diff, close_t, x;
cin >> t >> a;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a, diff, close_t, x;
cin >> t >> a;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) {
cin... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 1,013,920 | 1,013,921 | u716970267 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
float t, a;
cin >> t >> a;
float diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) {... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) ... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,013,922 | 1,013,923 | u716970267 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++)... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,013,924 | 1,013,923 | u716970267 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
float t, a;
cin >> t >> a;
float diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) {... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,013,925 | 1,013,923 | u716970267 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
float t, a;
cin >> t >> a;
float diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) {... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000;
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double diff, close_t, x;
int close_index;
close_t = INF;
close_index = 0;
for (int i = 1; i <= n; i++) ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,013,926 | 1,013,923 | u716970267 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define INF_LL 1LL << 60
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for (int i = a; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define INF_LL 1LL << 60
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for (int i = a; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a ... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,013,927 | 1,013,928 | u730271001 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, ans;
int min = 200;
scanf("%d%d%d", &N, &T, &A);
for (int i = 1; i <= N; i++) {
int H, temp, def;
scanf("%d", &H);
temp = T * 1000 - H * 6;
def = temp - A * 1000;
if (def < 0) {
def *= -1;
}
if (def < m... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, ans;
int min = 1 << 30;
scanf("%d%d%d", &N, &T, &A);
for (int i = 1; i <= N; i++) {
int H, temp, def;
scanf("%d", &H);
temp = T * 1000 - H * 6;
def = temp - A * 1000;
if (def < 0) {
def *= -1;
}
if (def... | [
"literal.number.change"
] | 1,013,929 | 1,013,930 | u855871994 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, ans;
int min = 1 << 30;
scanf("%d%d%d", &N, &T, &A);
for (int i = 0; i < N; i++) {
int H, temp, def;
scanf("%d", &H);
temp = T * 1000 - H * 6;
def = temp - A * 1000;
if (def < 0) {
def *= -1;
}
if (def ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A, ans;
int min = 1 << 30;
scanf("%d%d%d", &N, &T, &A);
for (int i = 1; i <= N; i++) {
int H, temp, def;
scanf("%d", &H);
temp = T * 1000 - H * 6;
def = temp - A * 1000;
if (def < 0) {
def *= -1;
}
if (def... | [
"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,013,931 | 1,013,930 | u855871994 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int optInd = 0;
double diff = 10000000.0;
for (int i = 0; i < N; i++) {
int h;
std::cin >> h;
double temp = T - h * 0.06;
if (std::fabs(temp - A) < diff) {
diff = ... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, T, A;
std::cin >> N >> T >> A;
int optInd = 0;
double diff = 10000000.0;
for (int i = 0; i < N; i++) {
int h;
std::cin >> h;
double temp = T - h * 0.006;
if (std::fabs(temp - A) < diff) {
diff =... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,013,932 | 1,013,933 | u390165589 | cpp |
p03220 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF INT_MAX;
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int mn = INF;
int ans;
for (int i = 0; i < n; i++) {
cin >> h.... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF INT_MAX;
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
double mn = INF;
int ans;
for (int i = 0; i < n; i++) {
cin >>... | [
"variable_declaration.type.primitive.change"
] | 1,013,937 | 1,013,938 | u450089835 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h, ans;
double sub = 10000;
for (int i = 1; i <= n; i++) {
cin >> h;
if (sub > abs(t - h * 0.006 - a)) {
sub = t - h * 0.006 - a;
ans = i;
}
}
cout << ans << end... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h, ans;
double sub = 10000;
for (int i = 1; i <= n; i++) {
cin >> h;
if (sub > abs(t - h * 0.006 - a)) {
sub = abs(t - h * 0.006 - a);
ans = i;
}
}
cout << ans <... | [
"call.add",
"call.arguments.change"
] | 1,013,939 | 1,013,940 | u765815947 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | [
"variable_declaration.type.primitive.change"
] | 1,013,941 | 1,013,942 | u208844959 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std... | [
"assignment.add"
] | 1,013,943 | 1,013,944 | u343463670 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, min, ans;
cin >> n >> t >> a;
float h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
min ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
float min, ans;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
... | [
"variable_declaration.type.primitive.change"
] | 1,013,945 | 1,013,946 | u950901760 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, min, ans;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
min = ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
float min, ans;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
... | [
"variable_declaration.type.change"
] | 1,013,947 | 1,013,946 | u950901760 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a, min = 50, ans = 0;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
float min, ans;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
min = abs(a - (t - h[0] * 0.006));
ans = 1;
for (int i = 0; i < n; i++) {
if (min > abs(a - (t - h[i] * 0.006))) {
... | [
"variable_declaration.type.change"
] | 1,013,948 | 1,013,946 | u950901760 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> H(n);
rep(i, n) {
cin >> H[i];
H[i] = abs(a - (t - H[i] * 0.006));
}
int min = H[0];
int idx = 0;
rep(i, n) {
if (min > H[i]) {
min = H... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> H(n);
rep(i, n) {
cin >> H[i];
H[i] = abs(a - (t - H[i] * 0.006));
}
double min = H[0];
int idx = 0;
rep(i, n) {
if (min > H[i]) {
m... | [
"variable_declaration.type.primitive.change"
] | 1,013,949 | 1,013,950 | u665598835 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
double a, t;
cin >> n;
cin >> a;
cin >> t;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<double> tmp(n);
for (int i = 0; i < n; i++) {
tmp[i] = abs(a - t + 0.006 * h[i]);
}
doub... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
double a, t;
cin >> n;
cin >> t;
cin >> a;
vector<double> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<double> tmp(n);
for (int i = 0; i < n; i++) {
tmp[i] = abs(a - t + 0.006 * h[i]);
}
doub... | [] | 1,013,952 | 1,013,953 | u821071900 | cpp |
p03220 | // Palace
#include <iostream>
using namespace std;
int N, T, A, answear, delta, temp;
int main() {
cin >> N;
int H[N];
cin >> T >> A;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
answear = 1;
temp = T - 0.006 * H[0];
delta = (temp - A) * (temp - A);
for (int i = 0; i < N; ++i) {
temp = T - 0.0... | // Palace
#include <iostream>
using namespace std;
int N, T, A, answear;
double temp, delta;
int main() {
cin >> N;
int H[N];
cin >> T >> A;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
answear = 1;
temp = T - 0.006 * H[0];
delta = (temp - A) * (temp - A);
for (int i = 0; i < N; ++i) {
temp = ... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,013,959 | 1,013,960 | u790970437 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
int ans = 0;
int mindif = 1e9;
rep(i, n) {
cin >> h;
int dif = abs((a * 1000) - ((t * 1000) - (... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
int ans = 0;
int mindif = 1e9;
rep(i, n) {
cin >> h;
int dif = abs((a * 1000) - ((t * 1000) - (... | [
"expression.operation.binary.remove"
] | 1,013,961 | 1,013,962 | u735707638 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int t, a, h;
cin >> t >> a;
int ans = 0;
int mindif = 1e9;
rep(i, n) {
cin >> h;
int dif = abs(a - (t - h * 0.006));
if... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
double n;
cin >> n;
double t, a, h;
cin >> t >> a;
int ans = 0;
double mindif = 1e9;
rep(i, n) {
cin >> h;
double dif = abs(a - (t - h * 0.0... | [
"variable_declaration.type.primitive.change"
] | 1,013,963 | 1,013,964 | u735707638 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int bango, heikin, sabun, saisyou = 100000000;
for (int i = 0; i < N; i++) {
heikin = T - vec.at(i) * 0.006;
if (A >= heiki... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int bango;
double heikin, sabun, saisyou = 10000;
for (int i = 0; i < N; i++) {
heikin = T - vec.at(i) * 0.006;
if (A >= ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,967 | 1,013,968 | u027402181 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int bango, heikin, sabun, saisyou = 1000;
for (int i = 0; i < N; i++) {
heikin = T - vec.at(i) * 0.006;
if (A >= heikin)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int bango;
double heikin, sabun, saisyou = 10000;
for (int i = 0; i < N; i++) {
heikin = T - vec.at(i) * 0.006;
if (A >= ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,013,969 | 1,013,968 | u027402181 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
double tmp;
vector<double> res(n);
for (int i = 0; i < n; i++) {
tmp = t - h[i] * 0.006;
res[i] = abs(tmp - a); // resがminのindex!!!!!!!!!!!... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
double tmp;
vector<double> res(n);
for (int i = 0; i < n; i++) {
tmp = t - h[i] * 0.006;
res[i] = abs(tmp - a);
}
double min = *min_ele... | [
"variable_declaration.type.primitive.change"
] | 1,013,972 | 1,013,973 | u934529721 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int k;
float cc = 111;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
float c = t - (0.006 * h);
if (cc > abs(a - c)) {
cc = abs(a - c);
k = i;
}
}
cout << k << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int k;
float cc = 1111;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
float c = t - (0.006 * h);
if (cc > abs(a - c)) {
cc = abs(a - c);
k = i;
}
}
cout << k << endl;
return 0;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,976 | 1,013,977 | u323864528 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> A >> T;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ok = 0;
double answer = abs(1.0 * A - (1.0 * T - H.at(0) * 0.006));
for (int i = 1; i < N; i++) {
if (abs(1.0 * A - (1.0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ok = 0;
double answer = abs(1.0 * A - (1.0 * T - H.at(0) * 0.006));
for (int i = 1; i < N; i++) {
if (abs(1.0 * A - (1.0... | [
"expression.operation.binary.remove"
] | 1,013,978 | 1,013,979 | u629548179 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double ans;
double max1 = 120;
int index;
for (int i = 1; i < n + 1; i++) {
int h;
cin >> h;
ans = t - h * 0.006;
if (abs(a - ans) < max1) {
max1 = abs(a - ans);
index = i;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double ans;
double max1 = 1000;
int index;
for (int i = 1; i < n + 1; i++) {
int h;
cin >> h;
ans = t - h * 0.006;
if (abs(a - ans) < max1) {
max1 = abs(a - ans);
index = i;
}
}
co... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,013,989 | 1,013,990 | u459105164 | cpp |
p03220 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> high(N);
for (int i = 0; i < N; i++)
cin >> high.at(i);
int ans;
for (int i = 0; i < N; i++) {
double near_i = fabs(A - T + 0.06 * high.at(i));
if (i == 0)
ans = 0;
else... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> high(N);
for (int i = 0; i < N; i++)
cin >> high.at(i);
int ans;
for (int i = 0; i < N; i++) {
double near_i = fabs(A - T + 0.006 * high.at(i));
if (i == 0)
ans = 0;
els... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,013,993 | 1,013,994 | u392419780 | cpp |
p03220 | // #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define String std::string
#define fi first
#define se second
#define mp std::make_pair
#define Pair std::pair<int, int>
#define Map std::map<int, int>
#define Vector std::vector<int>
using std::cin;
using std::cout;
using std::endl;
typedef long ... | // #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define String std::string
#define fi first
#define se second
#define mp std::make_pair
#define Pair std::pair<int, int>
#define Map std::map<int, int>
#define Vector std::vector<int>
using std::cin;
using std::cout;
using std::endl;
typedef long ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,013,995 | 1,013,996 | u586940219 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define endl "\n"
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define endl "\n"
typedef long lo... | [
"variable_declaration.type.primitive.change"
] | 1,014,000 | 1,014,001 | u536085925 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
double now = 1001001001;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
double now = 1001001001;
rep(i... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,014,009 | 1,014,010 | u853721692 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int index = 1000;
int ans = -1;
int dif = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
dif = (t * 1000 - h.at(i) * 6) - a * 1000;
if (dif < 0) {
dif = -dif;
}
if (d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int index = 1000000;
int ans = -1;
int dif = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
dif = (t * 1000 - h.at(i) * 6) - a * 1000;
if (dif < 0) {
dif = -dif;
}
if... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,011 | 1,014,012 | u416413094 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int index = 1000;
int ans = -1;
int dif = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
dif = (t * 1000 - h.at(i) * 6) - a;
if (dif < 0) {
dif = -dif;
}
if (dif < in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
int index = 1000000;
int ans = -1;
int dif = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
dif = (t * 1000 - h.at(i) * 6) - a * 1000;
if (dif < 0) {
dif = -dif;
}
if... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,014,013 | 1,014,012 | u416413094 | cpp |
p03220 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,016 | 1,014,017 | u966508131 | cpp |
p03220 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,014,018 | 1,014,017 | u966508131 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double mn = 100000;
int pos = 1;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
double tem = (double)t - h * 0.006;
if (tem > t)
tem = tem - (double)t;
else
tem = (double)t - tem;
if ... | #include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double mn = 100000;
int pos = 1;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
double tem = (double)t - h * 0.006;
if (tem > a)
tem = tem - (double)a;
else
tem = (double)a - tem;
if ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,014,026 | 1,014,027 | u993074316 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
int temp(int I) {
double ans = T - H[I] * 0.006;
return fabs(A - ans);
}... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
double temp(int I) {
double ans = T - H[I] * 0.006;
return fabs(A - ans)... | [
"function.return_type.change"
] | 1,014,030 | 1,014,031 | u548977290 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
int temp(int N) {
double ans = T - H[N] * 0.006;
return abs(A - ans);
}
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
double temp(int I) {
double ans = T - H[I] * 0.006;
return fabs(A - ans)... | [
"function.return_type.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.function.change",
"function.return_value.change"
] | 1,014,033 | 1,014,031 | u548977290 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
int temp(int N) {
double ans = T - H[N] * 0.006;
return A - ans;
}
int ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
int N;
double T;
double A;
double H[1100];
double temp(int I) {
double ans = T - H[I] * 0.006;
return fabs(A - ans)... | [
"function.return_type.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 1,014,034 | 1,014,031 | u548977290 | cpp |
p03220 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
int n, t, a;
cin >> n >> t >> a;
vi h(n);
r... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
int n, t, a;
cin >> n >> t >> a;
vi h(n);
r... | [
"variable_declaration.type.primitive.change"
] | 1,014,035 | 1,014,036 | u614128939 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
const int N = 1000000;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) cin >> h[i];
int diff_min = N;
int ans;
int temp;
for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
const int N = 1000000;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
rep(i, n) cin >> h[i];
double diff_min = N;
int ans;
double temp;
... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,014,041 | 1,014,040 | u999788719 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
int h[N];
int res;
double temp = 10000.0;
for (int i = 0; i < N; i++) {
cin >> h[i];
ll t = T - 0.006 * h[i];
if (abs(temp - A) > abs(t - A)) {
temp = t;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
double T, A;
cin >> T >> A;
double h[N];
int res;
double temp = 1000000.0;
for (int i = 0; i < N; i++) {
cin >> h[i];
double t = T - 0.006 * h[i];
if (abs(temp - A) > abs(t - A)) {
temp =... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 1,014,042 | 1,014,043 | u559578080 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
double calc(int t, int x) { return t - x * 0.006; }
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
int dif = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (i == 0) {
dif = abs(a - calc(... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
double calc(int t, int x) { return t - x * 0.006; }
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double dif;
int ans;
for (int i = 0; i < n; i++) {
cin >> h;
if (i == 0) {
dif = abs(a - calc(t, h)... | [
"variable_declaration.type.primitive.change"
] | 1,014,044 | 1,014,045 | u904995051 | cpp |
p03220 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
double t, a, df;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ind = 0;
df = abs((t - h[0] * 0.006) - a);
for (int i = 0; i < n; i++) {
if (df > abs... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
double t, a, df;
cin >> n >> t >> a;
vector<double> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ind = 0;
df = abs((t - h[0] * 0.006) - a);
for (int i = 0; i < n; i++) {
if (df > abs... | [
"expression.operation.binary.add"
] | 1,014,046 | 1,014,047 | u904995051 | 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 d = abs(A - (T - H[0] * 0.006));
int answer = 1;
for (int i = 1; i < N; i++) {
int d2 = abs(A - (T - H[i] * 0.006));
if (d2 < d) {... | #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 d = abs(A - (T - H[0] * 0.006));
int answer = 1;
for (int i = 1; i < N; i++) {
double d2 = abs(A - (T - H[i] * 0.006));
if (d2 < d... | [
"variable_declaration.type.primitive.change"
] | 1,014,050 | 1,014,051 | u482654186 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | [
"variable_declaration.type.change"
] | 1,014,052 | 1,014,053 | u523383024 | cpp |
p03220 | #include <bits/stdc++.h>
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 dif[N];
for (int i = 0; i < N; i++) {
dif[i] = abs(T - 0.006 * H[i] - A);
}
int index = 0;
int tempmin = dif[0];
for (int i = 1; i < N;... | #include <bits/stdc++.h>
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 dif[N];
for (int i = 0; i < N; i++) {
dif[i] = abs(T - 0.006 * H[i] - A);
}
int index = 0;
double tempmin = dif[0];
for (int i = 1; i <... | [
"variable_declaration.type.primitive.change"
] | 1,014,057 | 1,014,058 | u135573741 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int dif[N];
for (int i = 0; i < N; i++) {
dif[i] = abs(T - 0.006 * H[i] - A);
}
int index = 0;
int tempmin = dif[0];
for (int i = 1; i < N; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double dif[N];
for (int i = 0; i < N; i++) {
dif[i] = abs(T - 0.006 * H[i] - A);
}
int index = 0;
double tempmin = dif[0];
for (int i = 1; i <... | [
"variable_declaration.type.primitive.change"
] | 1,014,059 | 1,014,058 | u135573741 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF 2147483647 // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n, 0);
rep(i, n) {
int high = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF 2147483647 // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<double> h(n, 0);
rep(i, n) {
int high... | [
"variable_declaration.type.primitive.change",
"assignment.change",
"expression.operation.binary.remove"
] | 1,014,060 | 1,014,061 | u901555384 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF 2147483647 // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n, 0);
rep(i, n) {
int high = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF 2147483647 // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<double> h(n, 0);
rep(i, n) {
int high... | [
"variable_declaration.type.primitive.change"
] | 1,014,062 | 1,014,061 | u901555384 | cpp |
p03220 | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | [
"variable_declaration.type.change"
] | 1,014,066 | 1,014,067 | u211964883 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, h, D, X = 0;
cin >> N >> T >> A >> h;
D = abs(1000 * (T - A) - 6 * h);
for (int i = 1; i < N; i++) {
cin >> h;
if (D > abs(1000 * (T - A) - 6 * h)) {
X = i;
D = abs(1000 * (T - A) - 6 * h);
}
}
cout << X << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, h, D, X = 0;
cin >> N >> T >> A >> h;
D = abs(1000 * (T - A) - 6 * h);
for (int i = 1; i < N; i++) {
cin >> h;
if (D > abs(1000 * (T - A) - 6 * h)) {
X = i;
D = abs(1000 * (T - A) - 6 * h);
}
}
cout << X + 1 << e... | [
"expression.operation.binary.add"
] | 1,014,068 | 1,014,069 | u820224016 | cpp |
p03220 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<int, int>> p(N);
rep(i, N) {
int H;
cin >> H;
double B = abs(A - T + H * 0.006);
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<double, double>> p(N);
rep(i, N) {
int H;
cin >> H;
double B = abs(A - T + H * 0.006)... | [
"variable_declaration.type.primitive.change"
] | 1,014,072 | 1,014,073 | u138273120 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" <... | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" <... | [
"assignment.add"
] | 1,014,074 | 1,014,075 | u753615299 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, n) for (ll i = 1; i < (ll)(n); i++)
#define P pair<ll, ll>
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
ret... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, n) for (ll i = 1; i < (ll)(n); i++)
#define P pair<ll, ll>
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
ret... | [
"variable_declaration.type.primitive.change"
] | 1,014,076 | 1,014,077 | u363936720 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define all(x) (x).begin(), (x).end()
#define lint long lo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define all(x) (x).begin(), (x).end()
#define lint long lo... | [
"variable_declaration.type.primitive.change"
] | 1,014,086 | 1,014,087 | u632094970 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
double ans = 10000000, c = 0;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
if (abs(a - (12 - h[i] * 0.006)) < ans) {
ans = abs(a - (12 - h[i] * 0.006));
c ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
double ans = 10000000, c = 0;
cin >> n >> t >> a;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
if (abs((t - h[i] * 0.006) - a) < ans) {
ans = abs(a - (t - h[i] * 0.006));
c = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,097 | 1,014,098 | u512624048 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int minn = 100000000000000;
int h;
int mn;
for (int i = 0; i < n; i++) {
cin >> h;
if (minn >= abs(a * 1000 - t * 1000 - h * 6)) {
minn = abs(a * 1000 - t * 1000 - h * 6);
mn = i + 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int minn = 10000000000;
int h;
int mn;
for (int i = 0; i < n; i++) {
cin >> h;
if (minn >= abs(a * 1000 - t * 1000 + h * 6)) {
minn = abs(a * 1000 - t * 1000 + h * 6);
mn = i + 1;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,099 | 1,014,100 | u796877631 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int minn = 1000000;
int h;
int mn;
for (int i = 0; i < n; i++) {
cin >> h;
if (minn >= abs(a * 1000 - t * 1000 - h * 6)) {
minn = abs(a * 1000 - t * 1000 - h * 6);
mn = i + 1;
}
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int minn = 10000000000;
int h;
int mn;
for (int i = 0; i < n; i++) {
cin >> h;
if (minn >= abs(a * 1000 - t * 1000 + h * 6)) {
minn = abs(a * 1000 - t * 1000 + h * 6);
mn = i + 1;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,101 | 1,014,100 | u796877631 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int score, dis;
int min = 10000, log;
vector<int> height(n);
for (int i = 0; i < n; i++) {
score = 0, dis = 0;
cin >> height.at(i);
score = t - height.at(i) * 0.006;
dis = abs(a - score);
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
double score, dis;
double min = 10000, log;
vector<int> height(n);
for (int i = 0; i < n; i++) {
score = 0, dis = 0;
cin >> height.at(i);
score = t - height.at(i) * 0.006;
dis = abs(a - sco... | [
"variable_declaration.type.primitive.change"
] | 1,014,102 | 1,014,103 | u062198110 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, t, a;
cin >> n >> t >> a;
int score, dis;
int min = 10000, log;
vector<int> height(n);
for (int i = 0; i < n; i++) {
score = 0, dis = 0;
cin >> height.at(i);
score = n - height.at(i) * 0.006;
dis = abs(a - score);
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
double n, t, a;
cin >> n >> t >> a;
double score, dis;
double min = 10000, log;
vector<int> height(n);
for (int i = 0; i < n; i++) {
score = 0, dis = 0;
cin >> height.at(i);
score = t - height.at(i) * 0.006;
dis = abs(a - sco... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,014,104 | 1,014,103 | u062198110 | cpp |
p03220 | ///スマホコーディング
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double minv = 1e9;
int idx = 0;
for (int i = 0; i < n; i++) {
double h;
cin >> h;
if (abs(t - h * 0.006 - a) < minv) {
minv = abs(t - h * 0.006 - a);
... | ///スマホコーディング
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double minv = 1e9;
int idx = 0;
for (int i = 1; i <= n; i++) {
double h;
cin >> h;
if (abs(t - h * 0.006 - a) < minv) {
minv = abs(t - h * 0.006 - a);
... | [
"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,014,105 | 1,014,106 | u523303964 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | [
"expression.operation.binary.remove"
] | 1,014,118 | 1,014,119 | u004411048 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int e = 1, ans;
double f = 1e9;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double b = T - H * 0.006;
if (abs(A - b) < f) {
ans = e;
f = abs(A - b);
e++;
}
}
cout << ans << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int e = 1, ans;
double f = 1e9;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
double b = T - H * 0.006;
if (abs(A - b) < f) {
ans = e;
f = abs(A - b);
}
e++;
}
cout << ans << en... | [] | 1,014,125 | 1,014,126 | u962609087 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double diff;
cin >> diff;
diff = abs(a - t - diff * 0.006);
int result = 1;
rep(i, n - 1) {
double tt;
cin >> tt;
double td = ab... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double diff;
cin >> diff;
diff = abs(a - (t - diff * 0.006));
int result = 1;
rep(i, n - 1) {
double tt;
cin >> tt;
double td = ... | [
"call.arguments.change"
] | 1,014,129 | 1,014,130 | u021358975 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
double dmin = 1e9;
rep(i, n) {
int h;
cin >> h;
int d = abs(a - (t - h * 0.006));
if (d < dmin)
ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans;
double dmin = 1e9;
rep(i, n) {
int h;
cin >> h;
double d = abs(a - (t - h * 0.006));
if (d < dmin)
... | [
"variable_declaration.type.primitive.change"
] | 1,014,136 | 1,014,137 | u258994590 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define INF 1.0E+32
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
int ans;
double tmp_diff = INF;
for (int i = 0; i < n; i++) {
int diff = fabs(a - (t - h.at(i) * 0.006));
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1.0E+8
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
int ans;
double tmp_diff = INF;
for (int i = 0; i < n; i++) {
double diff = fabs(a - (t - h.at(i) * 0.006));
... | [
"preprocessor.define.value.change",
"literal.float.change",
"variable_declaration.type.primitive.change"
] | 1,014,143 | 1,014,144 | u745529935 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define INF 1.0E+08
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
int ans;
double tmp_diff = INF;
for (int i = 0; i < n; i++) {
int diff = fabs(a - (t - h.at(i) * 0.006));
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1.0E+8
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
int ans;
double tmp_diff = INF;
for (int i = 0; i < n; i++) {
double diff = fabs(a - (t - h.at(i) * 0.006));
... | [
"preprocessor.define.value.change",
"literal.float.change",
"variable_declaration.type.primitive.change"
] | 1,014,145 | 1,014,144 | u745529935 | cpp |
p03220 | // abc113_b
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc113_b
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | [
"variable_declaration.type.primitive.change"
] | 1,014,146 | 1,014,147 | u614550445 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll t, a;
cin >> t >> a;
vector<ll> h(n);
rep(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll t, a;
cin >> t >> a;
vector<ll> h(n);
rep(i... | [
"assignment.change",
"expression.operation.binary.remove",
"control_flow.branch.if.add"
] | 1,014,148 | 1,014,149 | u480831358 | cpp |
p03220 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,014,150 | 1,014,151 | u020746846 | cpp |
p03220 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"expression.operation.binary.remove"
] | 1,014,152 | 1,014,151 | u020746846 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
float t, a;
cin >> n >> t >> a;
int h[n];
rep(i, n) cin >> h[i];
float min = 100000;
int ans = 0;
rep(i, n) {
float T = t - h[i] * 0.006;
if (min > abs(a - T)) {
min = ab... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
float t, a;
cin >> n >> t >> a;
int h[n];
rep(i, n) cin >> h[i];
float min = 100000;
int ans = 0;
rep(i, n) {
float T = t - h[i] * 0.006;
if (min > abs(a - T)) {
min = ab... | [
"expression.operation.binary.add"
] | 1,014,165 | 1,014,166 | u679159704 | cpp |
p03220 | #include <iostream>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
using std::fabs;
int main() {
int N, T, A;
cin >> N >> T >> A;
int best_place = 0;
int best_diff = 0;
for (int n = 1; n <= N; n++) {
int H;
cin >> H;
double diff = fabs(double(A - (T - H * 0.006)));
if (... | #include <iostream>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
using std::fabs;
int main() {
int N, T, A;
cin >> N >> T >> A;
int best_place = 0;
double best_diff = 0;
for (int n = 1; n <= N; n++) {
int H;
cin >> H;
double diff = fabs(double(A - (T - H * 0.006)));
i... | [
"variable_declaration.type.primitive.change"
] | 1,014,167 | 1,014,168 | u410434188 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double diff = numeric_limits<double>::max();
int answer = -1;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
double t = T - 0.006 * H;
if (diff > abs(T - t)) {
diff = abs(T - t);
answer =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double diff = numeric_limits<double>::max();
int answer = -1;
for (int i = 1; i <= N; i++) {
int H;
cin >> H;
double t = T - 0.006 * H;
if (diff > abs(A - t)) {
diff = abs(A - t);
answer =... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,169 | 1,014,170 | u599568485 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double ans = 100000000;
int number = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
double x;
double y;
x = t - h * 0.006;
y = abs(a - x);
if (y < ans) {
ans = x;
number = i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
double ans = 100000000;
int number = 0;
for (int i = 1; i <= n; i++) {
int h;
cin >> h;
double x;
double y;
x = t - h * 0.006;
y = abs(a - x);
if (y < ans) {
ans = y;
number = i... | [
"assignment.value.change",
"identifier.change"
] | 1,014,173 | 1,014,174 | u572559885 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,014,175 | 1,014,176 | u547754910 | cpp |
p03220 | #include <cmath>
#include <iostream>
int main() {
int n, t, a, h, i, r = 0;
double m = 100100100100;
std::cin >> n >> t >> a;
for (i = 1; i != n + 1; ++i) {
std::cin >> h;
if (std::fabs(a - 0.006 * h) < m) {
m = std::fabs(a - 0.006 * h);
r = i;
}
}
std::cout << r << "\n";
} | #include <cmath>
#include <iostream>
int main() {
int n, t, a, h, i, r = 0;
double m = 1001001;
std::cin >> n >> t >> a;
for (i = 1; i != n + 1; ++i) {
std::cin >> h;
if (std::fabs(a - t + 0.006 * h) < m) {
m = std::fabs(a - t + 0.006 * h);
r = i;
}
}
std::cout << r << "\n";
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,014,179 | 1,014,180 | u854175276 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans, h, min = 1000000;
for (int i = 0; i < n; i++) {
cin >> h;
if ((fabs((t - h * 0.006) - a)) < min) {
min = fabs((t - h * 0.006) - a);
ans = i + 1;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int ans, h;
double min = 1000000.0;
for (int i = 0; i < n; i++) {
cin >> h;
if ((fabs((t - h * 0.006) - a)) < min) {
min = fabs((t - h * 0.006) - a);
ans = i + 1;
}
}
cout << ans;
return ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,181 | 1,014,182 | u094746828 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> B(N);
rep(i, N) cin >> B.at(i);
int ans = T + B.at(0) * 0.006;
int count = 0;
rep(i, N) {
if (abs((double)A - T + B.at(i) * 0.006... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> B(N);
rep(i, N) cin >> B.at(i);
double ans = T + B.at(0) * 0.006;
int count = 0;
rep(i, N) {
if (abs((double)A - T + B.at(i) * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,014,186 | 1,014,187 | u854161810 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1100];
for (int i = 0; i < N; ++i) {
int temp;
cin >> temp;
H[i] = T - 0.006 * temp;
}
int dif = abs(A - H[0]);
int ans = 1;
for (int i = 0; i < N; ++i) {
int tmp = abs(A - H[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1100];
for (int i = 0; i < N; ++i) {
int temp;
cin >> temp;
H[i] = T - 0.006 * temp;
}
double dif = abs(A - H[0]);
int ans = 1;
for (int i = 0; i < N; ++i) {
double tmp = abs(A - H[i]... | [
"variable_declaration.type.primitive.change"
] | 1,014,188 | 1,014,189 | u362068529 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1100];
for (int i = 0; i < N; ++i) {
int temp;
cin >> temp;
H[i] = T - 0.006 * temp;
}
int dif = abs(A - H[0]);
int ans = 1;
for (int i = 0; i < N; ++i) {
int tmp = abs(A - H[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1100];
for (int i = 0; i < N; ++i) {
int temp;
cin >> temp;
H[i] = T - 0.006 * temp;
}
double dif = abs(A - H[0]);
int ans = 1;
for (int i = 0; i < N; ++i) {
double tmp = abs(A - H[i]... | [
"variable_declaration.type.primitive.change",
"assignment.add"
] | 1,014,190 | 1,014,189 | u362068529 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main(void) {
int N, T,... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
#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 ALL(v) v.begin(), v.end()
using namespace std;
int main(void) {
int N, T,... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,014,209 | 1,014,210 | u075689098 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
rep(i, N) cin >> H[i];
vector<double> t(N);
rep(i, N) { t[i] = T - H[i] * 0.006; }
int ans = 0;
double d = abs(A - t[0]);
rep(i, N) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
rep(i, N) cin >> H[i];
vector<double> t(N);
rep(i, N) { t[i] = T - H[i] * 0.006; }
int ans = 0;
double d = abs(A - t[0]);
rep(i, N) {
do... | [
"variable_declaration.type.primitive.change"
] | 1,014,211 | 1,014,212 | u646792990 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[100];
rep(i, n) { cin >> h[i]; }
float tmp, dif = FLT_MAX;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1000];
rep(i, n) { cin >> h[i]; }
float tmp, dif = FLT_MAX;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,014,213 | 1,014,214 | u561143568 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
float n, t, a;
cin >> n >> t >> a;
float h[100];
rep(i, n) { cin >> h[i]; }
float tmp, dif = 10000;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1000];
rep(i, n) { cin >> h[i]; }
float tmp, dif = FLT_MAX;
int ans;
rep(i, n) {
tmp = t - h[i] * 0.006;
if (dif > abs(tmp - a)) {
ans = i + 1;
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,014,215 | 1,014,214 | u561143568 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int ans = A +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
double ans = ... | [
"variable_declaration.type.primitive.change"
] | 1,014,216 | 1,014,217 | u631558039 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
int ans = A +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
double ans = ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,014,218 | 1,014,217 | u631558039 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a - 1); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a - 1); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
... | [
"variable_declaration.type.primitive.change"
] | 1,014,221 | 1,014,222 | u899909022 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int diff = 1001001000;
int h;
int ans;
rep(i, N) {
cin >> h;
int d = abs(A - ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
float diff = 1001001000;
int h;
int ans;
rep(i, N) {
cin >> h;
float d = abs(... | [
"variable_declaration.type.primitive.change"
] | 1,014,223 | 1,014,224 | u976045502 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.