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 <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
int W[N];
for (int i = 0; i < N; i++)
W[i] = T - H[i] * 0.006;
int min = 1000000;
int ans;
for (int i = 0; i < N; i++) {... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
double W[N];
for (int i = 0; i < N; i++)
W[i] = T - H[i] * 0.006;
double min = 1000000;
int ans;
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change"
] | 1,017,089 | 1,017,088 | u656527663 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double gap = 100000000.0;
int index = 0;
for (int i = 0; i < n; i++) {
double ave... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double gap = 100000000.0;
int index = 0;
for (int i = 0; i < n; i++) {
double ave =... | [
"expression.operation.binary.add"
] | 1,017,090 | 1,017,091 | u223960644 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, T, A;
int a[1000 + 5];
float b[1000 + 5];
cin >> n >> T >> A;
int flag = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = T - a[i] * 0.006;
}
float minx = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) {
if (minx > fabs(A - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, T, A;
int a[1000 + 5];
float b[1000 + 5];
cin >> n >> T >> A;
int flag = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = T - a[i] * 0.006;
}
float minx = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) {
if (minx > fabs(A - ... | [
"call.add",
"call.arguments.change"
] | 1,017,092 | 1,017,093 | u533620702 | cpp |
p03220 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, t, a;
cin >> n >> t >> a;
double hoge = static_cast<double>(t - a);
int closest = 1;
double diff;
cin >> diff;
diff = abs(hoge + 0.006 * diff);
for (int i = 2; i <= n; ++i) {
double tmp;
cin >> tmp;
i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, t, a;
cin >> n >> t >> a;
double hoge = static_cast<double>(t - a);
int closest = 1;
double diff;
cin >> diff;
diff = abs(hoge - 0.006 * diff);
for (int i = 2; i <= n; ++i) {
double tmp;
cin >> tmp;
i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,096 | 1,017,097 | u937545465 | cpp |
p03220 | #include <cstdio>
const int N = 1e3 + 5;
int n, t, a, x, ans;
double mi = 2000000000;
double abs(double x) { return x > 0 ? x : -x; }
int main() {
scanf("%d%d%d", &n, &t, &a);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
double p = t - x * 1.0 / 0.006;
if (mi > abs(p - a))
mi = abs(p - a), ... | #include <cstdio>
const int N = 1e3 + 5;
int n, t, a, x, ans;
double mi = 2000000000;
double abs(double x) { return x > 0 ? x : -x; }
int main() {
scanf("%d%d%d", &n, &t, &a);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
double p = t - x * 0.006;
if (mi > abs(p - a))
mi = abs(p - a), ans = ... | [
"expression.operation.binary.remove"
] | 1,017,098 | 1,017,099 | u353005270 | cpp |
p03220 | #include <cstdio>
const int N = 1e3 + 5;
int n, t, a, x, ans;
double mi = 2000000000;
double abs(int x) { return x > 0 ? x : -x; }
int main() {
scanf("%d%d%d", &n, &t, &a);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
double p = t - x * 1.0 / 0.006;
if (mi > abs(p - a))
mi = abs(p - a), ans... | #include <cstdio>
const int N = 1e3 + 5;
int n, t, a, x, ans;
double mi = 2000000000;
double abs(double x) { return x > 0 ? x : -x; }
int main() {
scanf("%d%d%d", &n, &t, &a);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
double p = t - x * 0.006;
if (mi > abs(p - a))
mi = abs(p - a), ans = ... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 1,017,100 | 1,017,099 | u353005270 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int t;
int a;
cin >> n;
cin >> t >> a;
int temp;
int point = 0;
int mostnear = 1000;
for (int i = 1; i <= n; i++) {
cin >> temp;
if (abs((double)t - (double)temp * 0.006 - (double)a) < (double)mostnear) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int t;
int a;
cin >> n;
cin >> t >> a;
int temp;
int point = 0;
double mostnear = 1000;
for (int i = 1; i <= n; i++) {
cin >> temp;
if (abs((double)t - (double)temp * 0.006 - (double)a) < mostnear) {
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change"
] | 1,017,101 | 1,017,102 | u891531063 | cpp |
p03220 | #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 vector<pii> vpii;
typedef vector<pll> vpll;
#define get_bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n = ((1 << i) | n))))
#define ... | #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 vector<pii> vpii;
typedef vector<pll> vpll;
#define get_bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n = ((1 << i) | n))))
#define ... | [
"variable_declaration.type.change"
] | 1,017,103 | 1,017,104 | u621267127 | cpp |
p03220 | #include <bits/stdc++.h>
#define ll long long
#define tox x + dx[i]
#define toy y + dy[i]
using namespace std;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + ch - 48... | #include <bits/stdc++.h>
#define ll long long
#define tox x + dx[i]
#define toy y + dy[i]
using namespace std;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + ch - 48... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,017,113 | 1,017,114 | u279678523 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h[100000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ans_d = abs(a - (t - h[0] * 0.006));
int ans = 0;
for (int i = 0; i < n; i++) {
if (ans_d > abs(a ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, t, a, h[100000];
cin >> n >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
double ans_d = abs(a - (t - h[0] * 0.006));
int ans = 0;
for (int i = 0; i < n; i++) {
if (ans_d > abs... | [
"variable_declaration.type.primitive.change"
] | 1,017,115 | 1,017,116 | u206293281 | cpp |
p03220 | #include <cmath>
#include <iostream>
#define MAX_N 1000
int N, T, A;
int H[MAX_N];
int main() {
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
std::cin >> H[i];
}
int ans = 0;
int ansDiff = std::abs(A - (T - H[0] * 0.006));
for (int i = 1; i < N; ++i) {
int diff = std::abs(A - (T - H[i] ... | #include <cmath>
#include <iostream>
#define MAX_N 1000
int N, T, A;
int H[MAX_N];
int main() {
std::cin >> N >> T >> A;
for (int i = 0; i < N; ++i) {
std::cin >> H[i];
}
int ans = 0;
double ansDiff = std::abs(A - (T - H[0] * 0.006));
for (int i = 1; i < N; ++i) {
double diff = std::abs(A - (T -... | [
"variable_declaration.type.primitive.change"
] | 1,017,120 | 1,017,121 | u600759947 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
const int maxn = 1000010;
double f[maxn];
int main() {
int n, t, a;
int ans, ansn = 19260817;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> f[i];
if (abs(t - f[i] * 0.006 - a) < ansn) {
ansn = abs(t - f[i] * 0.006 - a);
an... | #include <cmath>
#include <iostream>
using namespace std;
const int maxn = 1000010;
double f[maxn];
int main() {
double n, t, a;
double ans, ansn = 19260817;
cin >> n >> t >> a;
for (int i = 1; i <= n; i++) {
cin >> f[i];
if (abs(t - f[i] * 0.006 - a) < ansn) {
ansn = abs(t - f[i] * 0.006 - a);
... | [
"variable_declaration.type.primitive.change"
] | 1,017,122 | 1,017,123 | u877324783 | cpp |
p03220 | /*---- enazuma11------- */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define F first
#define S second
#define M 1000000007
int main() {
... | /*---- enazuma11------- */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define inc(a, n) sort(a, a + n)
#define dec(a, n) sort(a, a + n, greater<int>())
#define F first
#define S second
#define M 1000000007
int main() {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,017,126 | 1,017,127 | u944248697 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int main() {
int n, a, t;
int s;
int ans, minn = 0x3f3f3f;
scanf("%d %d %d", &n, &t, &a);
for (int i = 0; i < n; i++) {
scanf("%d", &s);
double tt = t - s * 0.006;
if (abs(tt - a) < minn) {
minn = abs(tt - a);
ans = i... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int main() {
int n, a, t;
int s;
int ans;
double minn = 0x3f3f3f;
scanf("%d %d %d", &n, &t, &a);
for (int i = 1; i <= n; i++) {
scanf("%d", &s);
double tt = t - s * 0.006;
if (abs(tt - a) < minn) {
minn = abs(tt - 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",
"expression.operation.binary.remove"
] | 1,017,128 | 1,017,129 | u274744399 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define pi 3.1415926535897932384626433832795028841971693993... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define pi 3.1415926535897932384626433832795028841971693993... | [
"variable_declaration.type.change",
"call.add",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,017,130 | 1,017,131 | u394634573 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define pi 3.1415926535897932384626433832795028841971693993... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define pi 3.1415926535897932384626433832795028841971693993... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,017,132 | 1,017,131 | u394634573 | cpp |
p03220 | #include <iostream>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main() {
int N, T, A;
int H[1010] = {};
double Min = 1e9;
int ans;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
Min = abso(A - (T - H[1] * 0.006));
for (int i = 1; ... | #include <iostream>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main() {
int N, T, A;
int H[1010] = {};
double Min = 1e9;
int ans = 1;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
Min = abso(A - (T - H[1] * 0.006));
for (int i =... | [
"variable_declaration.value.change"
] | 1,017,134 | 1,017,135 | u021423660 | cpp |
p03220 | #include <iostream>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main() {
int N, T, A;
int H[1010] = {};
double Min = 1e9;
int ans;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
Min = abso(A - (T - H[0] * 0.006));
for (int i = 1; ... | #include <iostream>
using namespace std;
double abso(double x) {
if (x < 0)
return -x;
return x;
}
int main() {
int N, T, A;
int H[1010] = {};
double Min = 1e9;
int ans = 1;
cin >> N >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
Min = abso(A - (T - H[1] * 0.006));
for (int i =... | [
"variable_declaration.value.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,136 | 1,017,135 | u021423660 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
int n;
int t, a;
long long h[1000000];
long long te[1000000];
int main() {
cin >> n;
cin >> t >> a;
long long s = 1000001;
long long answer;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = 0; i < n; ++i) {
te[i] = t - 0.006 * ... | #include <iostream>
#include <math.h>
using namespace std;
int n;
int t, a;
long long h[1000000];
double te[1000000];
int main() {
cin >> n;
cin >> t >> a;
double s = 1000001;
long long answer;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = 0; i < n; ++i) {
te[i] = t - 0.006 * h[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,017,137 | 1,017,138 | u229235826 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
bitset<1000001> primeArr;
void sieve() {
int num_sqrt = sqrt(1000000);
primeArr[1] = 1;
for (int i = 4; i <= 1000000; i += 2)
primeArr[i] = 1;
for (int i = 3; i <= num_sqrt; i += 2) {
for (int j = 2; i * j <= 1000000; j++)
primeArr[i * j] = 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
bitset<1000001> primeArr;
void sieve() {
int num_sqrt = sqrt(1000000);
primeArr[1] = 1;
for (int i = 4; i <= 1000000; i += 2)
primeArr[i] = 1;
for (int i = 3; i <= num_sqrt; i += 2) {
for (int j = 2; i * j <= 1000000; j++)
primeArr[i * j] = 1;
}
}
... | [
"variable_declaration.type.primitive.change"
] | 1,017,140 | 1,017,141 | u387604940 | cpp |
p03220 | #include "bits/stdc++.h"
using namespace std;
const int maxn = 1e5 + 100;
typedef long long LL;
int n;
LL T, A;
LL h[maxn], b[maxn];
int main() {
scanf("%d", &n);
scanf("%lld%lld", &T, &A);
T *= 1000, A *= 1000;
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
h[i] *= 1000;
}
for (int i = 1; i <... | #include "bits/stdc++.h"
using namespace std;
const int maxn = 1e5 + 100;
typedef long long LL;
int n;
LL T, A;
LL h[maxn], b[maxn];
int main() {
scanf("%d", &n);
scanf("%lld%lld", &T, &A);
T *= 1000, A *= 1000;
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
h[i] *= 1000;
}
for (int i = 1; i <... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,017,151 | 1,017,152 | u404238779 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
double abss(double x) { return x >= 0 ? x : -x; }
int main() {
int N, res;
double T, A, t, t_ = 1000.0;
cin >> N >> T >> A;
double H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
t = abss(A - T - H[i]... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
double abss(double x) { return x >= 0 ? x : -x; }
int main() {
int N, res;
double T, A, t, t_ = 100000000000.0;
cin >> N >> T >> A;
double H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
t = abss(A - ... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 1,017,153 | 1,017,154 | u021083776 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define N 1002
int h[N];
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
int i;
for (i = 0; i < n; i++)
cin >> h[i];
double cl = 1000000;
int index;
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define N 1002
int h[N];
int main() {
int n;
cin >> n;
double T, A;
cin >> T >> A;
int i;
for (i = 0; i < n; i++)
cin >> h[i];
double cl = 1000000;
int index;
for (... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,017,155 | 1,017,156 | u512632182 | cpp |
p03220 | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
main() {
double n, t, a, i;
cin >> n >> t >> a;
double h, ans, d = 100;
for (i = 1; i <= n; i++) {
cin >> h;
if (d > fabs(a - t + h * 0.006)) {
d = fabs(a - t + h * 0.006);
ans = i;
}
}
cout << ans << endl;... | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
main() {
double n, t, a, i;
cin >> n >> t >> a;
double h, ans, d = 10000;
for (i = 1; i <= n; i++) {
cin >> h;
if (d > fabs(a - t + h * 0.006)) {
d = fabs(a - t + h * 0.006);
ans = i;
}
}
cout << ans << end... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,017,157 | 1,017,158 | u160321725 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int h[1100];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
double min = 100000;
for (int i = 0; i < n; i++) {
double th = abs(t - h[i] * 0.006);
if (min > th) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int h[1100];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
double min = 100000;
for (int i = 0; i < n; i++) {
double th = abs(a - (t - h[i] * 0.006));
if (min > th) ... | [
"call.arguments.add",
"call.arguments.change"
] | 1,017,159 | 1,017,160 | u330661451 | cpp |
p03220 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int h[51];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
double min = 100000;
for (int i = 0; i < n; i++) {
double th = abs(t - h[i] * 0.006);
if (min > th) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int n, t, a;
int h[1100];
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++)
cin >> h[i];
int ans;
double min = 100000;
for (int i = 0; i < n; i++) {
double th = abs(a - (t - h[i] * 0.006));
if (min > th) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 1,017,161 | 1,017,160 | u330661451 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
int temp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> temp[i];
temp[i] = t - temp[i] * 0.006;
}
double minn = 1000000, minv;
for (int i = 1; i <= n; i++) {
if (abs(a - temp[i]) < minn) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double t, a;
cin >> n >> t >> a;
double temp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> temp[i];
temp[i] = t - temp[i] * 0.006;
}
double minn = 1000000, minv;
for (int i = 1; i <= n; i++) {
if (abs(temp[i] - a) < minn) {
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,017,168 | 1,017,169 | u152997492 | cpp |
p03220 | /*
for (int i = 0; i < N; ++i){}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が ... | /*
for (int i = 0; i < N; ++i){}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 1,017,170 | 1,017,171 | u757738907 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100000;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++... | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100000;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 1,017,172 | 1,017,173 | u012298376 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 50;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100000;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,017,174 | 1,017,173 | u012298376 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 10000;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++)... | #include <algorithm>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
int N;
double T, A;
double H[1010];
int main() {
cin >> N >> T >> A;
for (int i = 0; i < N; i++)
cin >> H[i];
double min = 100000;
double c = 0;
int ans = 0;
for (int i = 0; i < N; i++... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,017,175 | 1,017,173 | u012298376 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define INF (1 << 30)
#define LINF (1ll << 60ll)
#define MOD 1000000007
#define pb(a) push_back(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define INF (1 << 30)
#define LINF (1ll << 60ll)
#define MOD 1000000007
#define pb(a) push_back(a)... | [
"expression.operation.binary.add"
] | 1,017,176 | 1,017,177 | u502709453 | cpp |
p03220 | #include <algorithm> // min,max
#include <cmath> // abs() for float, and fabs()
#include <cstdlib>
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[1000];
int X[1000];
cin >> N;
cin >> T >> ... | #include <algorithm> // min,max
#include <cmath> // abs() for float, and fabs()
#include <cstdlib>
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[1000];
float X[1000];
cin >> N;
cin >> T >... | [
"variable_declaration.type.primitive.change"
] | 1,017,180 | 1,017,181 | u398072911 | cpp |
p03220 | #include <algorithm> // min,max
#include <cmath> // abs() for float, and fabs()
#include <cstdlib>
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[1000];
int X[1000];
cin >> N;
cin >> T >> ... | #include <algorithm> // min,max
#include <cmath> // abs() for float, and fabs()
#include <cstdlib>
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string>
using namespace std;
int main() {
int N, T, A;
int H[1000];
float X[1000];
cin >> N;
cin >> T >... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,017,182 | 1,017,181 | u398072911 | cpp |
p03220 | #include <algorithm>
#include <iostream>
int n, t, a, h[1010];
int main() {
std::cin >> n >> t >> a;
for (int i = 0; i < n; ++i)
std::cin >> h[i];
double res = 10000000000000;
double ans;
for (int i = 0; i < n; ++i) {
double tmp = a - t - h[i] * 0.006;
if (tmp < 0)
tmp *= -1;
if (res > ... | #include <algorithm>
#include <iostream>
int n, t, a, h[1010];
int main() {
std::cin >> n >> t >> a;
for (int i = 0; i < n; ++i)
std::cin >> h[i];
double res = 10000000000000;
double ans;
for (int i = 0; i < n; ++i) {
double tmp = a - (t - h[i] * 0.006);
if (tmp < 0)
tmp *= -1;
if (res ... | [] | 1,017,183 | 1,017,184 | u640248738 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
struct N {
int p, v;
bool operator<(N b) const { return v < b.v; }
};
N P[1010];
int main() {
int t, a, n, h;
scanf("%d%d%d", &n, &t, &a);
for (int i = 0; i < n; i++) {
scanf("%d", &h);
P[i].p = i + 1;
P[i].v = abs(a - (t - h * 0.006));
}
sort(P... | #include <bits/stdc++.h>
using namespace std;
struct N {
int p;
double v;
bool operator<(N b) const { return v < b.v; }
};
N P[1010];
int main() {
int t, a, n, h;
scanf("%d%d%d", &n, &t, &a);
for (int i = 0; i < n; i++) {
scanf("%d", &h);
P[i].p = i + 1;
P[i].v = abs(a - (t - h * 0.006));
}... | [] | 1,017,187 | 1,017,188 | u399616977 | cpp |
p03220 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
int T;
int A;
cin >> N;
cin >> T;
cin >> A;
int H[N];
double Tx;
double Tbet_min;
double Tbet;
int ans;
Tbet_min = 500.0;
ans = 0;
for (int n = 0; n < N; n++) {
cin >> H[n];
Tx = T - H[n] * 0.006;
... | #include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
int T;
int A;
cin >> N;
cin >> T;
cin >> A;
int H[N];
double Tx;
double Tbet_min;
double Tbet;
int ans;
Tbet_min = 500.0;
ans = 0;
for (int n = 0; n < N; n++) {
cin >> H[n];
Tx = ... | [
"import.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,192 | 1,017,193 | u756614568 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double min_num = 0;
int min = INT_MAX;
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int min_num = 0;
double min = INT_MAX;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,017,194 | 1,017,195 | u830782448 | cpp |
p03220 |
#include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int min_num = 0;
int min = INT_MAX;
for (int i = 1; i <= n; i++) {
in... | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
int min_num = 0;
double min = INT_MAX;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,017,196 | 1,017,195 | u830782448 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int n;
int t, a;
int ans;
int main(void) {
// Here your code !
scanf("%d", &n);
scanf("%d %d", &t, &a);
int ho;
scanf("%d", &ho);
int cur = t - ho * 0.006;
int tmp = abs(cur - a);
ans = 1;
for (int i = 2; i <= n; ++i) {
int h;
scanf("%d", ... | #include <bits/stdc++.h>
using namespace std;
int n;
int t, a;
int ans;
int main(void) {
// Here your code !
scanf("%d", &n);
scanf("%d %d", &t, &a);
int ho;
scanf("%d", &ho);
double cur = t - ho * 0.006;
double tmp = abs(cur - a);
ans = 1;
for (int i = 2; i <= n; ++i) {
int h;
scanf(... | [
"variable_declaration.type.primitive.change"
] | 1,017,197 | 1,017,198 | u497422208 | cpp |
p03220 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
//#include<math.h>
using namespace std;
#define int long long
/* ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
//#include<math.h>
using namespace std;
#define int long long
/* ... | [
"call.arguments.change"
] | 1,017,200 | 1,017,201 | u384299515 | cpp |
p03220 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int i, N;
double T, A;
int H[1200];
int ans_h = 100000;
int ans;
cin >> N >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans_h) {
ans_h = abs(... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int i, N;
double T, A;
double H[1200];
double ans_h = 100000;
int ans;
cin >> N >> T >> A;
for (i = 0; i < N; i++) {
cin >> H[i];
}
for (i = 0; i < N; i++) {
if (abs(A - (T - H[i] * 0.006)) < ans_h) {
ans_h ... | [
"variable_declaration.type.primitive.change"
] | 1,017,202 | 1,017,203 | u913852240 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#define INF (1LL << 40)
using namespace std;
typedef long long ll;
int main() {
ll N, min_number = 0LL, near_num = INF;
ll A, T, H;
cin >> N >> T >> A;
T *= 1000LL;
A *= 1000LL;
for (int i = 0; i < N; i++) {
cin >> H;
H *= 1000LL;
ll avg_num = T - H * 6L... | #include <algorithm>
#include <iostream>
#define INF (1LL << 40)
using namespace std;
typedef long long ll;
int main() {
ll N, min_number = 0LL, near_num = INF;
ll A, T, H;
cin >> N >> T >> A;
T *= 1000LL;
A *= 1000LL;
for (int i = 0; i < N; i++) {
cin >> H;
ll avg_num = T - H * 6LL;
ll stride;... | [] | 1,017,204 | 1,017,205 | u134519179 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i = 0, j = 0, k = 0, ans = 0;
long double n, t, a, h[1000] = {0};
cin >> n >> t >> a;
for (i; i < n; i++)
cin >> h[i];
k = LLONG_MAX;
for (i = 0; i < n; i++) {
long double tem = t - h[i] * 0.006;
if (k > fabsl(a - tem)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i = 0, j = 0, k = 0, ans = 0;
long double n, t, a, h[1000] = {0};
cin >> n >> t >> a;
for (i; i < n; i++)
cin >> h[i];
long double l = LLONG_MAX;
for (i = 0; i < n; i++) {
long double tem = t - h[i] * 0.006;
if (l > fabsl(a -... | [
"variable_declaration.add",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,017,209 | 1,017,210 | u932175579 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
double m = t;
int ans;
for (int i = 0; i < n; ++i) {
if (fabs(m - (double)a) >
fabs(((double)t - (double)h[i] * 0.006) - (double)a)) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
double m = 1000000;
int ans;
for (int i = 0; i < n; ++i) {
if (fabs(m - (double)a) >
fabs(((double)t - (double)h[i] * 0.006) - (double... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,017,213 | 1,017,214 | u254187258 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, t, a;
int h[1000];
double g[1000];
int min = 10000000;
int idx;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
g[i] = (double)(t - h[i... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, t, a;
int h[1000];
double g[1000];
double min = 10000000;
int idx;
cin >> n;
cin >> t >> a;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
g[i] = (double)(t - ... | [
"variable_declaration.type.primitive.change"
] | 1,017,215 | 1,017,216 | u175948183 | cpp |
p03220 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
vector<int> H;
vector<float> temp;
H.resize(N);
temp.resize(N);
int k = 0;
int basho;
for (int n = 0; n < N; ++n) {
cin >> H[n];
temp[n] = T - H[n] * 0.006;
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
vector<float> H;
vector<float> temp;
H.resize(N);
temp.resize(N);
float k = 0;
float basho;
for (int n = 0; n < N; ++n) {
cin >> H[n];
temp[n] = T - H[n] * 0.... | [
"variable_declaration.type.primitive.change"
] | 1,017,217 | 1,017,218 | u055685044 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[1000];
int answer;
double min_dif = 10000;
double temp;
for (int i = 0; i <= N; i++) {
cin >> H[i];
temp = double(T) - double(H[i]) * 0.006;
if (abs(temp - A) < min_dif) {
min_... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[1000];
int answer;
double min_dif = 10000;
double temp;
for (int i = 0; i < N; i++) {
cin >> H[i];
temp = double(T) - double(H[i]) * 0.006;
if (abs(temp - A) < min_dif) {
min_d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,017,219 | 1,017,220 | u567956966 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] = t - v[i] * 0.006;
}
int dif = 100000000;
int ans = -1;
for (int i = 0; i < n; i++) {
if (dif > abs(a - v[i])) {
dif = abs(a -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] = t - v[i] * 0.006;
}
double dif = 1000000;
int ans = -1;
for (int i = 0; i < n; i++) {
if (dif > abs(a - v[i])) {
dif = abs... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,017,221 | 1,017,222 | u561186440 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
double a, t;
cin >> n >> a >> t;
double m = 1000000;
int best = 0;
for (int i = 0; i < n; ++i) {
double h;
cin >> h;
double tmp = t - 0.006 * h;
if (m > abs(a - tmp)) {
best = i + 1;
m = abs(a - tmp)... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
double a, t;
cin >> n >> t >> a;
double m = 1000000;
int best = 0;
for (int i = 0; i < n; ++i) {
double h;
cin >> h;
double tmp = t - 0.006 * h;
if (m > abs(a - tmp)) {
best = i + 1;
m = abs(a - tmp)... | [
"expression.operation.binary.remove"
] | 1,017,225 | 1,017,226 | u416511777 | cpp |
p03220 | #include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define il inline
#define rg register
using namespace std;
il int gi() {
rg int o = 0, fl = 1;
char ch = getchar();
while (!isdigit(ch))
fl ^= ch == '-', ch = getchar();
while (isdigit(ch))
o = 10 * o + ch -... | #include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define il inline
#define rg register
using namespace std;
il int gi() {
rg int o = 0, fl = 1;
char ch = getchar();
while (!isdigit(ch))
fl ^= ch == '-', ch = getchar();
while (isdigit(ch))
o = 10 * o + ch -... | [
"assignment.change"
] | 1,017,229 | 1,017,230 | u564690766 | cpp |
p03220 | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <vector>
int main(int argc, char **argv) {
int N, T, A;
cin.tie(NULL);
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
float h[N];
for (int i = 0; i < N; i++) {
h[i] = T - H[... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <vector>
int main(int argc, char **argv) {
int N, T, A;
cin.tie(NULL);
cin >> N >> T >> A;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
float h[N];
for (int i = 0; i < N; i++) {
h[i] = T - H[... | [
"variable_declaration.type.change"
] | 1,017,239 | 1,017,240 | u528744583 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1000000;
int t_ans = 0;
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
int temp = t - h[i] * 0.006;
if (abs(temp - a) < ans) {
ans = abs(temp -... | #include <bits/stdc++.h>
using namespace std;
int main() {
float ans = 1000000;
int t_ans = 0;
int n, t, a;
cin >> n >> t >> a;
vector<float> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
float temp = t - h[i] * 0.006;
if (abs(temp - a) < ans) {
ans = abs(... | [
"variable_declaration.type.primitive.change"
] | 1,017,241 | 1,017,242 | u592099403 | cpp |
p03220 | // Author: Jinhai Chen
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int n, A, t;
const int maxn = 1e5 + 10;
double h[maxn], a[maxn];
int main() {
#ifndef ONLINE_JUDGE
// freopen("data.in","r",stdin)... | // Author: Jinhai Chen
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int n, A, t;
const int maxn = 1e5 + 10;
double h[maxn], a[maxn];
int main() {
#ifndef ONLINE_JUDGE
// freopen("data.in","r",stdin)... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,017,243 | 1,017,244 | u645239706 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int i1, i2;
char ch;
inline int read() {
i1 = i2 = ch = 0;
while (!isdigit(ch))
i1 |= ch == '-', ch = getchar();
while (isdigit(ch))
i2 = (i2 << 1) + (i2 << 3) + (ch ^ 48), ch = getchar();
return i1 ? -i2 : i2;
}
int main() {
int n = read(), t = read(), ... | #include <bits/stdc++.h>
using namespace std;
int i1, i2;
char ch;
inline int read() {
i1 = i2 = ch = 0;
while (!isdigit(ch))
i1 |= ch == '-', ch = getchar();
while (isdigit(ch))
i2 = (i2 << 1) + (i2 << 3) + (ch ^ 48), ch = getchar();
return i1 ? -i2 : i2;
}
int main() {
int n = read(), t = read(), ... | [
"variable_declaration.type.primitive.change"
] | 1,017,250 | 1,017,251 | u920282748 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
... | [
"variable_declaration.type.change"
] | 1,017,254 | 1,017,255 | u493080913 | cpp |
p03220 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
... | [
"literal.number.change",
"assignment.value.change"
] | 1,017,256 | 1,017,255 | u493080913 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | [
"variable_declaration.type.primitive.change"
] | 1,017,257 | 1,017,258 | u099918199 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 1,017,259 | 1,017,258 | u099918199 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
const double k = 0.006;
int n, t, a, h, ans = 1;
double tmp;
inline double calc(int x) { return abs(a - t - x * k); }
int main() {
cin >> n >> t >> a >> h;
tmp = calc(h);
for (int i = 2; i <= n; ++i) {
cin >> h;
if (calc(h) < tmp) {
tmp = calc(h);
... | #include <bits/stdc++.h>
using namespace std;
const double k = 0.006;
int n, t, a, h, ans = 1;
double tmp;
inline double calc(int x) { return abs(a - (t - x * k)); }
int main() {
cin >> n >> t >> a >> h;
tmp = calc(h);
for (int i = 2; i <= n; ++i) {
cin >> h;
if (calc(h) < tmp) {
tmp = calc(h);... | [
"call.arguments.change",
"function.return_value.change"
] | 1,017,260 | 1,017,261 | u449491657 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 1e5 + 100;
const int INF = 0x3f3f3f3f;
int main() {
int n, T, A;
cin >> n;
cin >> T >> A;
T *= 1000;
A *= 1000;
int dif = INF, pos;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int N = 1e5 + 100;
const int INF = 0x3f3f3f3f;
int main() {
int n, T, A;
cin >> n;
cin >> T >> A;
T *= 1000;
A *= 1000;
int dif = INF, pos;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
... | [] | 1,017,262 | 1,017,263 | u677724546 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
double b[56000];
double c[56000];
int main() {
int n;
cin >> n;
double x, y;
cin >> x >> y;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
b[i] = x - 1.0 * a * 0.006;
}
for (int i = 0; i < n; i++) {
c[i] = fabs(b... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
double b[56000];
double c[56000];
int main() {
int n;
cin >> n;
double x, y;
cin >> x >> y;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
b[i] = x - 1.0 * a * 0.006;
}
for (int i = 0; i < n; i++) {
c[i] = fabs(b... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,017,264 | 1,017,265 | u191117799 | cpp |
p03220 | #include <iostream>
#include <math.h>
using namespace std;
#define N 1010
#define inf 0x3f3f3f3f
int n, a, t;
double h[N];
int main() {
ios::sync_with_stdio(false);
while (cin >> n >> t >> a) {
int temp;
int ans = 1;
int min_abs = inf;
for (int i = 1; i <= n; i++) {
cin >> temp;
h[i] = f... | #include <iostream>
#include <math.h>
using namespace std;
#define N 1010
#define inf 0x3f3f3f3f
int n;
double a, t;
double h[N];
int main() {
ios::sync_with_stdio(false);
while (cin >> n >> t >> a) {
double temp;
int ans = 1;
double min_abs = inf;
for (int i = 1; i <= n; i++) {
cin >> temp;
... | [
"variable_declaration.type.primitive.change"
] | 1,017,266 | 1,017,267 | u811005174 | cpp |
p03220 | #include <bits/stdc++.h>
#pragma GCC optimize(3)
namespace ZDY {
#define res register
#define ri res int
#define ll long long
#define db double
#define sht short
#define il inline
#define MB template <class T>
#define Fur(i, x, y) for (ri i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, ... | #include <bits/stdc++.h>
#pragma GCC optimize(3)
namespace ZDY {
#define res register
#define ri res int
#define ll long long
#define db double
#define sht short
#define il inline
#define MB template <class T>
#define Fur(i, x, y) for (ri i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,270 | 1,017,271 | u127394455 | cpp |
p03220 | #include <algorithm>
#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 <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#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 <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,017,272 | 1,017,273 | u032337012 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int num = 0;
char c = ' ';
bool flag = true;
for (; c > '9' || c < '0'; c = getchar())
if (c == '-')
flag = false;
for (; c >= '0' && c <= '9';
num = (num << 1) + (num << 3) + c - 48, c = getchar())
;
return flag ? num : ... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int num = 0;
char c = ' ';
bool flag = true;
for (; c > '9' || c < '0'; c = getchar())
if (c == '-')
flag = false;
for (; c >= '0' && c <= '9';
num = (num << 1) + (num << 3) + c - 48, c = getchar())
;
return flag ? num : ... | [
"variable_declaration.type.change"
] | 1,017,282 | 1,017,283 | u534442611 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define rep(i, x, y) \
for (declt... | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define rep(i, x, y) \
for (declt... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,284 | 1,017,285 | u153767929 | cpp |
p03220 | /**
* @author torith
* @date 2018-11-04
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int T, A;
cin >> T >> A;
int ans = 0;
int diff = 1e9;
for (int i = 0; i < N; ++i) {
int H;
cin >> H;
... | /**
* @author torith
* @date 2018-11-04
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
double T, A;
cin >> T >> A;
int ans = 0;
double diff = 1e9;
for (int i = 0; i < N; ++i) {
int H;
cin >... | [
"variable_declaration.type.primitive.change"
] | 1,017,286 | 1,017,287 | u278446060 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define inf 0x3f3f3f3f
using namespace std;
int main() {
int n, t, a, x;
while (cin >> n) {
cin >> t >> a;
int mo = inf, mm, mark;
for (int i = 0; i < n; i++) {
cin >> x;
mm = t - a * x;
if (fabs(mm - a) < fabs(... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define inf 0x3f3f3f3f
using namespace std;
int main() {
int n, t, a, x;
while (cin >> n) {
cin >> t >> a;
double mo = inf, mm, mark;
for (int i = 0; i < n; i++) {
cin >> x;
mm = t - 0.006 * x;
if (fabs(mm - a) ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 1,017,288 | 1,017,289 | u781383449 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,292 | 1,017,293 | u499009346 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
ll p[m], y[m];
rep(i, m) cin >> p[i] >> y[i];
vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
ll p[m], y[m];
rep(i, m) cin >> p[i] >> y[i];
vec... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,017,294 | 1,017,295 | u877494916 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
LLONG times[50][2501];
int main() {
int N, M;
cin >> N >> ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
LLONG times[50][2501];
int main() {
int N, M;
cin >> N >> ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,017,296 | 1,017,297 | u214685595 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | [] | 1,017,298 | 1,017,299 | u513211419 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i], p[i]--;
vector<vector<int>> vals(n);
for (int i = 0; i < m; i++)
vals[p[i]].push_back(y[i]);
for (int... | /*
解法が分からなかった（アイデアが分からなかった）
*/
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
p[i]--;
}
vector<vector<int>> vals(n);
for (int i = 0; i < m; i++)
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,310 | 1,017,311 | u477343425 | cpp |
p03221 | /*
解法が分からなかった（アイデアが分からなかった）
https://drken1215.hatenablog.com/entry/2019/03/21/234900
*/
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i], p[i]--;
vector<vector<... | /*
解法が分からなかった（アイデアが分からなかった）
*/
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
p[i]--;
}
vector<vector<int>> vals(n);
for (int i = 0; i < m; i++)
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,312 | 1,017,311 | u477343425 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#de... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,017,315 | 1,017,316 | u313043608 | cpp |
p03221 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
const doub... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
const doub... | [] | 1,017,328 | 1,017,329 | u634999820 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int digit(int x) {
int ans = 0;
while (x > 0) {
++ans;
x /= 10;
}
return ans;
}
int main() {
in... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int digit(int x) {
int ans = 0;
while (x > 0) {
++ans;
x /= 10;
}
return ans;
}
int main() {
in... | [] | 1,017,347 | 1,017,348 | u826189900 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int digit(int x) {
int ans = 0;
while (x > 0) {
++ans;
x /= 10;
}
return ans;
}
int main() {
in... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int digit(int x) {
int ans = 0;
while (x > 0) {
++ans;
x /= 10;
}
return ans;
}
int main() {
in... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,349 | 1,017,348 | u826189900 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int p[100010], y[100010];
vector<int> id[100010];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
id[p[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++) {
sort(id[i].begin(), id[i].end());
}
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int p[100010], y[100010];
vector<int> id[100010];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
id[p[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++) {
sort(id[i + 1].begin(), id[i + 1].end());
}
f... | [
"expression.operation.binary.add"
] | 1,017,350 | 1,017,351 | u166378830 | cpp |
p03221 | // ref: https://drken1215.hatenablog.com/entry/2019/03/21/234900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | // ref: https://drken1215.hatenablog.com/entry/2019/03/21/234900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | [] | 1,017,352 | 1,017,353 | u456420540 | cpp |
p03221 | // ref: https://drken1215.hatenablog.com/entry/2019/03/21/234900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | // ref: https://drken1215.hatenablog.com/entry/2019/03/21/234900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | [
"expression.unary.arithmetic.remove"
] | 1,017,354 | 1,017,353 | u456420540 | cpp |
p03221 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using name... | [
"expression.operation.binary.add"
] | 1,017,355 | 1,017,356 | u239409893 | cpp |
p03221 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 1,017,357 | 1,017,358 | u239409893 | cpp |
p03221 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool cmp1(pair<int, pair<int, long long int>> a,
pair<int, pair<int, long long int>> b) {
if (a.second.first != b.second.first) {
return a.second.first < b.second.first;
} else {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool cmp1(pair<int, pair<int, long long int>> a,
pair<int, pair<int, long long int>> b) {
if (a.second.first != b.second.first) {
return a.second.first < b.second.first;
} else {
... | [
"expression.unary.arithmetic.add"
] | 1,017,364 | 1,017,365 | u806657856 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,017,374 | 1,017,375 | u461336793 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N, M;
int P[100000], Y[100000];
vector<int> idy[100001];
int main() {
cin >> N >> M;
re... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N, M;
int P[100000], Y[100000];
vector<int> idy[100001];
int main() {
cin >> N >> M;
re... | [
"literal.number.change",
"call.arguments.change"
] | 1,017,376 | 1,017,377 | u765815947 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N, M;
int P[100000], Y[100000];
vector<int> idy[100000];
int main() {
cin >> N >> M;
re... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N, M;
int P[100000], Y[100000];
vector<int> idy[100001];
int main() {
cin >> N >> M;
re... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 1,017,378 | 1,017,377 | u765815947 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
bool city(pair<P, int> a, pair<P, int> b) { return a.second < b.second; }
int main() {
int n... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
bool city(pair<P, int> a, pair<P, int> b) { return a.second < b.second; }
int main() {
int n... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 1,017,379 | 1,017,380 | u416773418 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 1,017,385 | 1,017,386 | u942393279 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define INIT(a, n, x) ... | [
"expression.operation.binary.add"
] | 1,017,387 | 1,017,388 | u168017191 | cpp |
p03221 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int... | [
"expression.operation.binary.add"
] | 1,017,394 | 1,017,395 | u495881622 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define ft \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define ft \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 1,017,396 | 1,017,397 | u999669186 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
ll n, m;
ll p[100000], y[100000];
vector<ll> yd[100001];
int main() {
cin >> n >> m;
rep(i, m) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
ll n, m;
ll p[100000], y[100000];
vector<ll> yd[100001];
int main() {
cin >> n >> m;
rep(i, m) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
rep... | [
"call.add",
"call.arguments.change"
] | 1,017,400 | 1,017,401 | u264265458 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,402 | 1,017,403 | u828388155 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,404 | 1,017,405 | u828388155 | cpp |
p03221 | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
const in... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
const in... | [] | 1,017,406 | 1,017,407 | u536712674 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long int ll;
struct fuck {
int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long int ll;
struct fuck {
int... | [] | 1,017,410 | 1,017,409 | u275488634 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
typedef pair<ll, pll> ppll;
string tos(ll n) {
string res;
while (n) {
res = res + (char)((int)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
typedef pair<ll, pll> ppll;
string tos(ll n) {
string res;
while (n) {
res = (char)((int)(n % 1... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,017,411 | 1,017,412 | u718758485 | cpp |
p03221 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef long double lb;
typedef tuple<ll, ll, ll> T;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#de... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef long double lb;
typedef tuple<ll, ll, ll> T;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#de... | [
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,017,420 | 1,017,421 | u526459074 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.