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 <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int func(int n) {
int out = (n % 2 == 0) ? (n / 2) : (3 * n + 1);
return out;
}
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int min = 99999999;
int ind = -1;
for ... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int func(int n) {
int out = (n % 2 == 0) ? (n / 2) : (3 * n + 1);
return out;
}
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double min = 999999;
int ind = -1;
for... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,014,920 | 1,014,919 | u476534289 | cpp |
p03220 | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | [
"call.arguments.change"
] | 1,014,921 | 1,014,922 | u265065462 | cpp |
p03220 | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 1,014,923 | 1,014,922 | u265065462 | cpp |
p03220 | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 1,014,924 | 1,014,922 | u265065462 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T, A, H;
cin >> N >> T >> A;
vector<float> temp(N);
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T, A, H;
cin >> N >> T >> A;
vector<float> temp(N);
for (int i = 0; i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,014,925 | 1,014,926 | u662852612 | cpp |
p03220 | #include <cstdio>
using namespace std;
int main(void) {
int n;
int t, a;
int h;
int i;
int x, ans, MIN;
int sum;
scanf("%d%d%d", &n, &t, &a);
MIN = 1000000000;
ans = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &h);
x = t * 1000 - h * 1000 * 6;
sum = x - a * 1000;
if (sum < 0)
sum... | #include <cstdio>
using namespace std;
int main(void) {
int n;
int t, a;
int h;
int i;
int x, ans, MIN;
int sum;
scanf("%d%d%d", &n, &t, &a);
MIN = 1000000000;
ans = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &h);
x = t * 1000 - h * 6;
sum = x - a * 1000;
if (sum < 0)
sum *= -1;... | [
"expression.operation.binary.remove"
] | 1,014,927 | 1,014,928 | u787972656 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int t, a;
int h[1001];
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int MIN;
int x = INT_MAX;
int z;
a *= 1000;
for (int i = 1; i <= n; i++) {
MIN = t * 1000 - h[i] * 1000 * 6;
if (x > abs... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int t, a;
int h[1001];
cin >> n;
cin >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int MIN;
int x = INT_MAX;
int z;
a *= 1000;
for (int i = 1; i <= n; i++) {
MIN = t * 1000 - h[i] * 6;
if (x > abs(MIN - ... | [
"expression.operation.binary.remove"
] | 1,014,929 | 1,014,930 | u787972656 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
double T, A;
int ans = 0;
double mind = 100000.0;
cin >> N;
cin >> T >> A;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
double T, A;
int ans = 0;
double mind = 100000.0;
cin >> N;
cin >> T >> A;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,931 | 1,014,932 | u699835930 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define ii pair<int, int>
#define MAX 1000000007
using namespace std;
int main(void) {
int n;
double t, a;
cin >> n >> t >> a;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define ii pair<int, int>
#define MAX 1000000007
using namespace std;
int main(void) {
int n;
double t, a;
cin >> n >> t >> a;
... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 1,014,935 | 1,014,936 | u582848517 | cpp |
p03220 | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | [
"variable_declaration.type.primitive.change"
] | 1,014,941 | 1,014,942 | u245710867 | cpp |
p03220 | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,943 | 1,014,942 | u245710867 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int temp = 10000;
int ans = 0;
for (int j = 0; j < N; j++) {
if (abs(temp - A) > abs((T - vec.at(j) * 0.006) - A)) {
ans = j;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
double temp = 10000;
int ans = 0;
for (int j = 0; j < N; j++) {
if (abs(temp - A) > abs((T - vec.at(j) * 0.006) - A)) {
a... | [
"variable_declaration.type.primitive.change"
] | 1,014,944 | 1,014,945 | u835534008 | cpp |
p03220 | #include <iostream>
using namespace std;
inline int absolute(int n) { return (n > 0) ? n : -n; }
int main() {
/*input*/
int n;
cin >> n;
int t, a;
cin >> t >> a;
int *h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
/*calculation*/
int ans = 1;
int min = absolute(a - (t - h[0] * ... | #include <iostream>
using namespace std;
inline double absolute(double n) { return (n > 0) ? n : -n; }
int main() {
/*input*/
int n;
cin >> n;
int t, a;
cin >> t >> a;
int *h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
/*calculation*/
int ans = 1;
double min = absolute(a - (t ... | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 1,014,948 | 1,014,949 | u637220270 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int min = 99999, tmp;
int i = 0, count = 0;
while (i < n) {
tmp = abs(a - (t - h[i] * 0.006));
if (tmp < min) {
min = tmp;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
float min = 99999, tmp;
int i = 0, count = 0;
while (i < n) {
tmp = abs(a - (t - h[i] * 0.006));
if (tmp < min) {
min = tmp;
... | [
"variable_declaration.type.primitive.change"
] | 1,014,950 | 1,014,951 | u023795241 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef pair<ul, ul> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
double N, T, A;
double min = 100000;
int num;
cin >> N >> T >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef pair<ul, ul> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
double N, T, A;
double min = 100000;
int num;
cin >> N >> T >> ... | [
"call.arguments.change"
] | 1,014,952 | 1,014,953 | u283779141 | 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++) {
int h;
cin >> h;
H[i] = abs(T - h * 0.006 - A);
}
cout << min_element(H.begin(), H.end()) - H.begin() + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
int h;
cin >> h;
H[i] = abs(T - h * 0.006 - A);
}
cout << min_element(H.begin(), H.end()) - H.begin() + 1 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 1,014,963 | 1,014,964 | u615194706 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int idx = 0;
int dif = 100000000;
int tmp = 0;
for (int i = 0; i < N; i++) {
tmp = T * 1000 - h[i] * 6;
// cout << tmp << endl;
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];
}
int idx = 0;
int dif = 100000000;
int tmp = 0;
for (int i = 0; i < N; i++) {
tmp = T * 1000 - h[i] * 6;
// cout << tmp << endl;
i... | [
"assignment.change"
] | 1,014,965 | 1,014,966 | u223172354 | cpp |
p03220 | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,972 | 1,014,973 | u139458416 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1010];
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
h[i] = 1000 * t - 6 * h[i] - 1000 * a;
if (h[i] < 0)
h[i] = -h[i... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h[1010];
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
h[i] = 1000 * t - 6 * h[i] - 1000 * a;
if (h[i] < 0)
h[i] = -h[i... | [
"expression.operation.binary.add"
] | 1,014,983 | 1,014,984 | u379440427 | cpp |
p03220 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | [] | 1,014,987 | 1,014,988 | u662918817 | cpp |
p03220 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,014,989 | 1,014,988 | u662918817 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <string>
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 t[N];
for (int i = 0; i < N; i++)
t[i] = T - H[i] * 0.006;
int ans = 1;
double sa[N];
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <string>
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 t[N];
for (int i = 0; i < N; i++)
t[i] = T - H[i] * 0.006;
int ans = 1;
double sa[N];
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change"
] | 1,014,990 | 1,014,991 | u646921304 | cpp |
p03220 | #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 h[N]; // H[i]での気温h[i]
for (int i = 0; i < N; i++)
h[i] = T - H[i] * 0.006;
double s[N];
for (int i = 0; i < N; i++) {
s[i] = h[i] - A;
}
fo... | #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 h[N]; // H[i]での気温h[i]
for (int i = 0; i < N; i++)
h[i] = T - H[i] * 0.006;
double s[N];
for (int i = 0; i < N; i++) {
s[i] = h[i] - A;
}
fo... | [
"variable_declaration.value.change"
] | 1,014,992 | 1,014,993 | u646921304 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = abs(A - T - H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = fabs(A - T + H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,003 | 1,015,004 | u961846252 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = fabs(A - T - H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = fabs(A - T + H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,005 | 1,015,004 | u961846252 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = abs(A - T - H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = abs(A - T + H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,003 | 1,015,006 | u961846252 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = fabs(A - T - H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, id;
double Max, T, H, A;
int main() {
cin >> N >> T >> A;
Max = 2e9;
for (int i = 1; i <= N; i++) {
cin >> H;
double res = abs(A - T + H * 0.006);
if (res < Max) {
Max = res;
id = i;
}
}
cout << id << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,005 | 1,015,006 | u961846252 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
int min = 100000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
float t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
float min = 100000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
float t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
r... | [
"variable_declaration.type.primitive.change"
] | 1,015,007 | 1,015,008 | u292209746 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
int min = 100000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
int t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
float min = 100000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
float t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
r... | [
"variable_declaration.type.primitive.change"
] | 1,015,009 | 1,015,008 | u292209746 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
int min = 10000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
int t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, T;
cin >> N >> T >> A;
int H;
float min = 100000;
int id;
for (int i = 0; i < N; i++) {
cin >> H;
float t = T - H * 0.006;
if (min > abs(A - t)) {
min = abs(A - t);
id = i;
}
}
cout << id + 1 << endl;
r... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,010 | 1,015,008 | u292209746 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, H[1000];
double A;
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int mini = 1000000000;
int ans;
for (int i = 0; i < N; i++) {
double a = T - H[i] * 0.006;
if (abs(A - a) < mini) {
mini = abs(A - a);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, H[1000];
double A;
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double mini = 1000000000;
int ans;
for (int i = 0; i < N; i++) {
double a = T - H[i] * 0.006;
if (abs(A - a) < mini) {
mini = abs(A - a);... | [
"variable_declaration.type.primitive.change"
] | 1,015,016 | 1,015,017 | u992875223 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A, H[1000];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int mini = 1000000000;
int ans;
for (int i = 0; i < N; i++) {
double a = T - H[i] * 0.006;
if (abs(A - a) < mini) {
mini = abs(A - a);
ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, H[1000];
double A;
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double mini = 1000000000;
int ans;
for (int i = 0; i < N; i++) {
double a = T - H[i] * 0.006;
if (abs(A - a) < mini) {
mini = abs(A - a);... | [
"variable_declaration.remove",
"variable_declaration.add",
"variable_declaration.type.primitive.change"
] | 1,015,018 | 1,015,017 | u992875223 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<pair<int, int>> a(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
double j = T - H[i] * 0.006;
a[i].first = abs(j - A);
a[i].second = H[i];
}
sort(a.begin(), a.end());
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
double A;
cin >> N >> T >> A;
vector<int> H(N);
vector<pair<double, double>> a(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
double j = T - H[i] * 0.006;
a[i].first = abs(j - A);
a[i].second = H[i];
}
sort(a.begin(), a... | [
"variable_declaration.type.primitive.change"
] | 1,015,021 | 1,015,022 | u515854808 | cpp |
p03220 | /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#... | /*------------------------- Bism Allah Alruhmin Alrahim
* -------------------------------*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#... | [
"call.arguments.change"
] | 1,015,023 | 1,015,024 | u624417383 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, t, a;
cin >> n >> t >> a;
double m = 999999;
int mIndex = -1;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
if (a - (... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, t, a;
cin >> n >> t >> a;
double m = 999999;
int mIndex = -1;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,015,025 | 1,015,026 | u432194969 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, t, a;
cin >> n >> t >> a;
double m = 999999;
int mIndex = -1;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
if (a - (... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, t, a;
cin >> n >> t >> a;
double m = 999999;
int mIndex = -1;
int h;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs(a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,015,027 | 1,015,026 | u432194969 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,030 | 1,015,031 | u767543103 | cpp |
p03220 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,015,032 | 1,015,033 | u575781793 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
int x[N]; //平均気温とAの差の絶対値
rep(i, N) {
cin >> H... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[N];
double x[N]; //平均気温とAの差の絶対値
rep(i, N) {
cin >... | [
"variable_declaration.type.primitive.change"
] | 1,015,036 | 1,015,037 | u828388155 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N), temp(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
temp[i] = T - H[i] * 0.006;
}
int dif = abs(A - temp[0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<double> temp(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
temp[i] = T - H[i] * 0.006;
}
double ... | [
"variable_declaration.type.primitive.change"
] | 1,015,038 | 1,015,039 | u591779169 | cpp |
p03220 | #include <bits/stdc++.h>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
int N, T, A, I;
double M;
int main(void) {
// IO("test.in", "test.out");
M = DBL_MAX;
scanf("%d%d%d", &N, &T, &A);
for (int i = 1; i <= N; i++) {
double e;
scanf("%lf", &e);
e = (A - (T -... | #include <bits/stdc++.h>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
int N, T, A, I;
double M;
int main(void) {
// IO("test.in", "test.out");
M = DBL_MAX;
scanf("%d%d%d", &N, &T, &A);
for (int i = 1; i <= N; i++) {
double e;
scanf("%lf", &e);
e = abs(A - (... | [
"call.add"
] | 1,015,040 | 1,015,041 | u027479217 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 1000;
int place = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans) {
ans = abs(A - (T - H[i] * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double ans = 1000;
int place = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans) {
ans = abs(A - (T - H[i]... | [
"variable_declaration.type.primitive.change"
] | 1,015,042 | 1,015,043 | u410041382 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 1000;
int place = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans) {
ans = abs(A - (T - H[i] * 0.0... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double ans = 1000;
int place = 0;
for (int i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans) {
ans = abs(A - (T - H[i]... | [
"variable_declaration.type.primitive.change"
] | 1,015,044 | 1,015,043 | u410041382 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int index;
cin >> N;
cin >> T >> A;
int dif = 1000000;
for (int i = 0; i < N; i++) {
int height, tempora, old;
old = dif;
cin >> height;
tempora = T - height * 0.006;
dif = min(dif, abs(A - tempora));
if (old !... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
int index = 0;
cin >> N;
cin >> T >> A;
double dif = 1000000;
for (int i = 0; i < N; i++) {
int height;
double tempora, old;
old = dif;
cin >> height;
tempora = T - height * 0.006;
dif = min(dif, abs(A - tempor... | [
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,015,045 | 1,015,046 | u653388379 | cpp |
p03220 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 1,015,047 | 1,015,048 | u636137609 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, h;
cin >> n >> t >> a;
pair<int, int> ans = make_pair(1000000, 0);
for (int i = 1; i <= n; ++i) {
cin >> h;
if (ans.first > abs(a - (t - h * 0.006)))
ans = make_pair(abs(a - (t - h * 0.006)), i);
}
cout << ans.second << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, t, a, h;
cin >> n >> t >> a;
pair<double, int> ans = make_pair(1000000, 0);
for (int i = 1; i <= n; ++i) {
cin >> h;
if (ans.first > abs(a - (t - h * 0.006)))
ans = make_pair(abs(a - (t - h * 0.006)), i);
}
cout << ans.seco... | [
"variable_declaration.type.primitive.change"
] | 1,015,049 | 1,015,050 | u848359007 | cpp |
p03220 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | [
"variable_declaration.type.primitive.change"
] | 1,015,060 | 1,015,061 | u850266651 | cpp |
p03220 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | [
"variable_declaration.type.primitive.change"
] | 1,015,062 | 1,015,061 | u850266651 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<int, int>> H(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
H[i].first = abs(A - T + a * 0.006);
H[i].second = i;
}
sort(H.begin(), H.end());
cout << H[0].second + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<double, int>> H(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
H[i].first = abs(A - T + a * 0.006);
H[i].second = i;
}
sort(H.begin(), H.end());
cout << H[0].second + 1 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 1,015,063 | 1,015,064 | u593555034 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<int, int>> H(N);
for (int i = 0; i < N; i++) {
int a;
H[i].first = abs(A - T + a * 0.006);
H[i].second = i;
}
sort(H.begin(), H.end());
cout << H[0].second + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<pair<double, int>> H(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
H[i].first = abs(A - T + a * 0.006);
H[i].second = i;
}
sort(H.begin(), H.end());
cout << H[0].second + 1 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 1,015,065 | 1,015,064 | u593555034 | cpp |
p03220 | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
int SUB = INT_MAX; // subtract between temp and A
int H[N];
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
for (int i = 0; i < N; i++) {
double tmp = T ... | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
double SUB = INT_MAX; // subtract between temp and A
int H[N];
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
for (int i = 0; i < N; i++) {
double tmp =... | [
"variable_declaration.type.primitive.change"
] | 1,015,072 | 1,015,073 | u865125601 | cpp |
p03220 | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
int SUB = INT_MAX;
int H[N];
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int tmp = T - H[i] * 0.006;
// cout << ... | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
double SUB = INT_MAX; // subtract between temp and A
int H[N];
cin >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int ans = 0;
for (int i = 0; i < N; i++) {
double tmp =... | [
"variable_declaration.type.primitive.change"
] | 1,015,074 | 1,015,073 | u865125601 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a, ans, min;
cin >> n >> t >> a;
min = 2e9;
int i, j;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
int hikaku = (double)t ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a, ans;
cin >> n >> t >> a;
double min = 2e9;
int i, j;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
double hikaku = (doub... | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 1,015,075 | 1,015,076 | u127768253 | cpp |
p03220 | #include <bits/stdc++.h>
int main(void) {
int N;
double T, A;
std::cin >> N >> T >> A;
double min = 1000000;
int min_num;
for (int i = 0; i < N; i++) {
double H;
std::cin >> H;
double temperture = T - (0.006 * H);
double diff = abs(temperture - A);
if (diff < min) {
min = diff;
... | #include <bits/stdc++.h>
int main(void) {
int N;
double T, A;
std::cin >> N >> T >> A;
double min = 1000000;
double min_num;
for (int i = 0; i < N; i++) {
double H;
std::cin >> H;
double temperture = T - (0.006 * H);
double diff = std::abs(temperture - A);
// std::cout<<"temperture = ... | [
"variable_declaration.type.primitive.change"
] | 1,015,077 | 1,015,078 | u261279477 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int num = 0;
double minabs = abs(A - ((T - H[0]) * 0.006));
for (int i = 1; i < N; i++) {
double tmp = abs(A - ((T - H[i]) * 0.006));
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int num = 0;
double minabs = abs(A - (T - H[0] * 0.006));
for (int i = 1; i < N; i++) {
double tmp = abs(A - (T - H[i] * 0.006));
if (tm... | [
"call.arguments.change"
] | 1,015,081 | 1,015,082 | u369479899 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int num = 0;
int minabs = abs(A - ((T - H[0]) * 0.006));
for (int i = 1; i < N; i++) {
int tmp = abs(A - ((T - H[i]) * 0.006));
if (tmp ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int num = 0;
double minabs = abs(A - (T - H[0] * 0.006));
for (int i = 1; i < N; i++) {
double tmp = abs(A - (T - H[i] * 0.006));
if (tm... | [
"variable_declaration.type.primitive.change",
"call.arguments.change"
] | 1,015,083 | 1,015,082 | u369479899 | cpp |
p03220 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,015,084 | 1,015,085 | u809967037 | cpp |
p03220 | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int minDiff = T * 1000 - H[0] * 6 - A * 1000, correctPlace = 1;
if (minDiff < 0)
minDiff = 0 - minDiff;
for (int i = 0; i < N; i++) {
int diff = T * 1000 - H[... | #include <iostream>
using namespace std;
int main() {
int N, T, A, H[1010];
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int minDiff = T * 1000 - H[0] * 6 - A * 1000, correctPlace = 1;
if (minDiff < 0)
minDiff = 0 - minDiff;
for (int i = 0; i < N; i++) {
int diff = T * 1000 - H[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,015,088 | 1,015,089 | u521712919 | cpp |
p03220 | #include <bits/stdc++.h>
#define i64 long long
#define maxn (int)(1e5)
#define pii pair<int, int>
#define L first
#define R second
#define all(x) x.begin(), x.end()
#define eps 1e-9
using namespace std;
bool lessThan(double a, double b) {
if (a + eps < b)
return true;
else
return false;
}
int main() {
int... | #include <bits/stdc++.h>
#define i64 long long
#define maxn (int)(1e5)
#define pii pair<int, int>
#define L first
#define R second
#define all(x) x.begin(), x.end()
#define eps 1e-9
using namespace std;
bool lessThan(double a, double b) {
if (a + eps < b)
return true;
else
return false;
}
int main() {
int... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,091 | 1,015,092 | u717687462 | cpp |
p03220 | #include <bits/stdc++.h>
#define i64 long long
#define maxn (int)(1e5)
#define pii pair<int, int>
#define L first
#define R second
#define all(x) x.begin(), x.end()
#define eps 1e-9
using namespace std;
bool lessThan(double a, double b) {
if (a + eps < b)
return true;
else
return false;
}
int main() {
int... | #include <bits/stdc++.h>
#define i64 long long
#define maxn (int)(1e5)
#define pii pair<int, int>
#define L first
#define R second
#define all(x) x.begin(), x.end()
#define eps 1e-9
using namespace std;
bool lessThan(double a, double b) {
if (a + eps < b)
return true;
else
return false;
}
int main() {
int... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,091 | 1,015,093 | u717687462 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
double t, a, h[1000], tmp = 100000, num;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (fabs(a - t - h[i] * 0.006) <= tmp) {
tmp = fabs(a - t - h[i] * 0.006);
num = i... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
double t, a, h[1000], tmp = 100000, num;
cin >> n >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (fabs(a - t + h[i] * 0.006) <= tmp) {
tmp = fabs(a - t + h[i] * 0.006);
num = i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,100 | 1,015,101 | u217596176 | cpp |
p03220 | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
typedef pair<int, int> p;
int H[1001];
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
for (int i = 0; i... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
typedef pair<int, int> p;
int H[1001];
int main() {
int N;
double T, A;
cin >> N;
cin >> T >> A;
for (int i = 0... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,015,102 | 1,015,103 | u775451660 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
double T, A;
int min = 999;
int ans = 1;
cin >> N;
cin >> T >> A;
ve... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
double T, A;
double min = 999;
int ans = 1;
cin >> N;
cin >> T >> A;
... | [
"variable_declaration.type.primitive.change"
] | 1,015,111 | 1,015,112 | u335104842 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
double T, A;
int min = 999;
int ans = 1;
cin >> N;
cin >> T >> A;
ve... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
double T, A;
double min = 999;
int ans = 1;
cin >> N;
cin >> T >> A;
... | [
"variable_declaration.type.primitive.change"
] | 1,015,113 | 1,015,112 | u335104842 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#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);
int min = 1000000;
int min_num = 0;
rep(i, n... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
double min = 1000000;
int min_num = 0;
... | [
"variable_declaration.type.primitive.change"
] | 1,015,114 | 1,015,115 | u130834452 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
int main() {
int N, T, A;
std::cin >> N >> T >> A;
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
int main() {
int N, T, A;
std::cin >> N >> T >> A;
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
... | [
"assignment.change"
] | 1,015,118 | 1,015,119 | u303039933 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
vector<int> H(N);
double min = 110.0;
for (int i = 0; i < H.size(); i++) {
cin >> H.at(i);
double X = abs(T - H.at(i) * 0.006 - A);
if (X < min) {
min = X;
}
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
vector<int> H(N);
double min = 1000000.0;
for (int i = 0; i < H.size(); i++) {
cin >> H.at(i);
double X = abs(T - H.at(i) * 0.006 - A);
if (X < min) {
min = X;
}
}
for (int ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,120 | 1,015,121 | u096717230 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int minT = 10000000;
int num = 0;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
int hT = T - H[i] * 0.006;
if (minT > abs(A - hT)) {
num = i + 1;
}
minT = min(minT, abs(A - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
double minT = 10000000;
int num = 0;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
double aveT = T - H[i] * 0.006;
if (minT > abs(A - aveT)) {
num = i + 1;
}
minT = min(mi... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,015,124 | 1,015,125 | u626463672 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[1010];
int min = 99999;
int ans = 0;
for (int i = 1; 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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
double H[1010];
double min = 99999;
int ans = 0;
for (int i = 1; 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 << a... | [
"variable_declaration.type.primitive.change"
] | 1,015,126 | 1,015,127 | u582357587 | cpp |
p03220 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | [
"call.remove",
"call.arguments.change"
] | 1,015,128 | 1,015,129 | u947375463 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::numeric_limits<ll>::... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::numeric_limits<ll>::... | [
"variable_declaration.type.widen.change"
] | 1,015,141 | 1,015,142 | u068362919 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::numeric_limits<ll>::... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::numeric_limits<ll>::... | [
"variable_declaration.type.widen.change"
] | 1,015,143 | 1,015,142 | u068362919 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
vecto... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
vecto... | [
"variable_declaration.type.primitive.change"
] | 1,015,146 | 1,015,147 | u489172963 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double mean = (T - A) / 0.006;
double del = 10e5;
int ans = 0;
for (int i = 0; i < N; i++) {
if (del > abs(mean - H[i])) {
del... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, T, A;
cin >> N >> T >> A;
vector<double> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double mean = (T - A) / 0.006;
double del = 10e5;
int ans = 0;
for (int i = 0; i < N; i++) {
if (del > abs(mean - H[i])) {
del... | [
"expression.operation.binary.add"
] | 1,015,158 | 1,015,159 | u261514692 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
int cnt = 0;
int sa = 99999;
for (int i = 0; i < N; i++) {
if (sa > abs(A - T - (H[i] * 0.006)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
int cnt = 0;
double sa = 99999;
for (int i = 0; i < N; i++) {
if (sa > abs(A - (T - (H[i] * 0.... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,160 | 1,015,161 | u911222357 | cpp |
p03220 | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long LL;
typedef long double LD;
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first <... | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long LL;
typedef long double LD;
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first <... | [
"call.add",
"call.arguments.change"
] | 1,015,162 | 1,015,163 | u321915648 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
retu... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
retu... | [
"variable_declaration.type.primitive.change"
] | 1,015,164 | 1,015,165 | u554988565 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<int> xxx(n);
int hozon = 100000000;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
xxx.at(i) = 1000 * (t - h.at(i) * 0.6);
xxx.at(i) = abs(a * 1000 - xxx.at(i));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
vector<int> xxx(n);
int hozon = 100000000;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
xxx.at(i) = 1000 * (t - h.at(i) * 0.006);
xxx.at(i) = abs(a * 1000 - xxx.at(i));
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,015,166 | 1,015,167 | u521723672 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
int min = 1000;
for (int i = 0; i < n; i++) {
double temp = t - h[i] * 0.006;
if (abs(temp - a) < min) {
min = abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
double min = 1000;
for (int i = 0; i < n; i++) {
double temp = t - h[i] * 0.006;
if (abs(temp - a) < min) {
min = ... | [
"variable_declaration.type.primitive.change"
] | 1,015,168 | 1,015,169 | u055447809 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define INF 1.0e9
using namespace std;
typedef long long ll;
int N, T, A;
const int MAX_N = 1000;
int H[MAX_N];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
int min_tmp =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define INF 1.0e9
using namespace std;
typedef long long ll;
int N, T, A;
const int MAX_N = 1000;
int H[MAX_N];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min_tm... | [
"variable_declaration.type.primitive.change"
] | 1,015,174 | 1,015,175 | u488352661 | cpp |
p03220 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 100000
int main() {
int N, T, A; //個数、気温、目標気温
cin >> N >> T >> A;
int now;
int res = 0;
vector<int> H(N);
int min = INF;
for (int i = 0; i < N; i++) {
cin >> H[i];
... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 10000000
int main() {
int N, T, A; //個数、気温、目標気温
cin >> N >> T >> A;
int now;
int res = 0;
vector<int> H(N);
int min = INF;
for (int i = 0; i < N; i++) {
cin >> H[i];
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,015,183 | 1,015,184 | u329706129 | cpp |
p03220 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 100000
int main() {
int N, T, A; //個数、気温、目標気温
cin >> N >> T >> A;
int now;
int res = 0;
vector<int> H(N);
int min = INF;
for (int i = 0; i < N; i++) {
cin >> H[i];
... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 10000000
int main() {
int N, T, A; //個数、気温、目標気温
cin >> N >> T >> A;
int now;
int res = 0;
vector<int> H(N);
int min = INF;
for (int i = 0; i < N; i++) {
cin >> H[i];
... | [
"preprocessor.define.value.change",
"literal.integer.change",
"assignment.change"
] | 1,015,185 | 1,015,184 | u329706129 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<double> vec1(N);
for (int i = 0; i < N; i++) {
vec1.at(i) = T - vec.at(i) * 0.006;
}
double ans = 100000.0;
int ans1;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<double> vec1(N);
for (int i = 0; i < N; i++) {
vec1.at(i) = T - vec.at(i) * 0.006;
}
double ans = 100000.0;
int ans1;
fo... | [
"call.add",
"call.arguments.change"
] | 1,015,186 | 1,015,187 | u365882800 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> vec1(N);
for (int i = 0; i < N; i++) {
vec1.at(i) = T - vec.at(i) * 0.006;
}
int ans = 100000.0;
int ans1;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<double> vec1(N);
for (int i = 0; i < N; i++) {
vec1.at(i) = T - vec.at(i) * 0.006;
}
double ans = 100000.0;
int ans1;
fo... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,015,188 | 1,015,187 | u365882800 | cpp |
p03220 | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,015,189 | 1,015,190 | u440032761 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<int> kion(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
kion[i] = abs(A - (T - H[i] * 0.006));
}
int m = 0;
for (int i = 0; i < N; i++) {
if (kion[m] > kion[i]) {
m =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<double> kion(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
kion[i] = abs(A - (T - H[i] * 0.006));
}
int m = 0;
for (int i = 0; i < N; i++) {
if (kion[m] > kion[i]) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,191 | 1,015,192 | u692650171 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<int> kion(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
kion[i] = abs(A - (T - H[i] * 0.006));
}
int m = 0;
for (int i = 0; i < N; i++) {
if (kion[m] > kion[i]) {
m =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<int> H(N);
vector<double> kion(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
kion[i] = abs(A - (T - H[i] * 0.006));
}
int m = 0;
for (int i = 0; i < N; i++) {
if (kion[m] > kion[i]) {
... | [
"variable_declaration.type.primitive.change"
] | 1,015,191 | 1,015,193 | u692650171 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | [
"variable_declaration.type.primitive.change"
] | 1,015,206 | 1,015,207 | u085117197 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,015,208 | 1,015,207 | u085117197 | cpp |
p03220 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
for (int i = 0; i < N; i++) {
H.at(i) = abs(A - abs(T - H.at(i) * 0.006)) * 1000;
}
vector<int>::iterator ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
for (int i = 0; i < N; i++) {
H.at(i) = abs(A - (T - H.at(i) * 0.006)) * 1000;
}
vector<int>::iterator min... | [
"call.arguments.change"
] | 1,015,218 | 1,015,219 | u912048901 | cpp |
p03220 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> vec(n);
vector<int> tmp(... | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> vec(n);
vector<int> tmp(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,015,222 | 1,015,223 | u132284673 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int min = INT_MAX;
int idx;
for (int j = 0; j < h.size(); +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
double min = DBL_MAX;
int idx;
for (int j = 0; j < h.size()... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,015,224 | 1,015,225 | u720829795 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<ll> h;
for (int i = 0; i < n; ++i) {
ll tmp;
cin >> tmp;
h.push_back(tmp);
}
ll min = INT_MAX;
int idx;
for (int j = 0; j < h.size(); ++j)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
double min = DBL_MAX;
int idx;
for (int j = 0; j < h.size()... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,015,226 | 1,015,225 | u720829795 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int min = INT_MAX;
int idx;
for (int j = 0; j < h.size(); +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, t, a;
cin >> n >> t >> a;
vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
double min = DBL_MAX;
int idx;
for (int j = 0; j < h.size()... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,015,227 | 1,015,225 | u720829795 | cpp |
p03220 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_B main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_B main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | [
"variable_declaration.type.primitive.change"
] | 1,015,228 | 1,015,229 | u404244809 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double best = 200;
int best_idx = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) <= best) {
best = abs((t - h * 0.006) - a);
best_idx = i;
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double best = 10000;
int best_idx = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) <= best) {
best = abs((t - h * 0.006) - a);
best_idx = i;
}
}... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,015,234 | 1,015,235 | u320106034 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double best = t + 60;
int best_idx;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) <= best) {
best = abs((t - h * 0.006) - a);
best_idx = i;
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
int h;
double best = 10000;
int best_idx = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (abs((t - h * 0.006) - a) <= best) {
best = abs((t - h * 0.006) - a);
best_idx = i;
}
}... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,015,236 | 1,015,235 | u320106034 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
double mind = 1000.0;
int idx = 0;
for (int i = 0; i < N; i++) {
double d = 0.0;
d = abs((double)A... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
double mind = 1000.0;
int idx = 0;
for (int i = 0; i < N; i++) {
double d = 0.0;
d = abs((double)A... | [
"io.output.change"
] | 1,015,239 | 1,015,240 | u166632863 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
int min;
int ans;
min = 1000000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs((T - H[i] *... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
double min;
int ans;
min = 1000000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs((T - H[i... | [
"variable_declaration.type.primitive.change"
] | 1,015,241 | 1,015,242 | u166632863 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
int min;
int ans;
min = 1000000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs(T - H[i] * ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
signed T, A;
cin >> N >> T >> A;
vector<int> H(N);
double min;
int ans;
min = 1000000, ans = 0;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (abs((T - H[i... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"call.arguments.change"
] | 1,015,243 | 1,015,242 | u166632863 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.