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 |
|---|---|---|---|---|---|---|---|
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
double m = sum / n;
int index = 0;
double d = 10000;
for (int i = 0; i < n; i++) {
if (abs(m - a.at(i)) < d) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
double m = (double)sum / n;
int index = 0;
double d = 10000;
for (int i = 0; i < n; i++) {
if (abs(m - a.at(i)) < d... | [
"type_conversion.add"
] | 1,009,550 | 1,009,551 | u465233477 | cpp |
p03214 | #include <iostream>
using namespace std;
int main() {
int N, ans = 101;
int sum = 0, A[101];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
double average = sum / N, min = 999, a, b;
for (int i = 0; i < N; i++) {
if (A[i] < average) {
a = average;
b = A[i];
... | #include <iostream>
using namespace std;
int main() {
int N, ans = 101, sum = 0, A[101];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
double average = (double)sum / N, min = 999, a,
b; // int,intの計算では値はintにしかならず、doubleにはならない:sum/N
for (int i = 0; i < N; i++) {
i... | [
"type_conversion.add"
] | 1,009,552 | 1,009,553 | u534015096 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll ave = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
double ave = 0;
for... | [
"variable_declaration.type.change"
] | 1,009,554 | 1,009,555 | u167755809 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ave = 0;
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
double ave = 0;
for... | [
"variable_declaration.type.primitive.change"
] | 1,009,556 | 1,009,555 | u167755809 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ave = 0;
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
double ave = 0;
for... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,009,557 | 1,009,555 | u167755809 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll ave = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
double ave = 0;
for... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,009,558 | 1,009,559 | u274962354 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < ... | [
"type_conversion.add"
] | 1,009,560 | 1,009,561 | u569272329 | cpp |
p03214 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPP(i, n) for (int i = 1; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPP(i, n) for (int i = 1; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | [
"variable_declaration.type.primitive.change",
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,009,562 | 1,009,563 | u881647420 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 0;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
k += a.at(i);
}
for (int i = 0; i < n; i++) {
b.at(i) = max(k - n * a.at(i), n * a.at(i) - k);
c.at(i) = b.at(i);
}
sort(c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 0;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
k += a.at(i);
}
for (int i = 0; i < n; i++) {
b.at(i) = max(k - n * a.at(i), n * a.at(i) - k);
c.at(i) = b.at(i);
}
sort(c... | [] | 1,009,566 | 1,009,567 | u646051775 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
int main() {
double m = 100, n, s = 0, a[114];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], s += a[i];
s = s / n;
int p;
for (int i = 0; i < n; i++) {
if (abs(s - a[(int)n - 1 - i])... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
int main() {
double m = 100, n, s = 0, a[114];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], s += a[i];
s = s / n;
int p;
for (int i = 0; i < n; i++) {
if (abs(s - a[(int)n - 1 - i])... | [
"assignment.change"
] | 1,009,568 | 1,009,569 | u601082779 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vi(N);
for (int i = 0; i < N; i++) {
cin >> vi.at(i);
}
int ave = 0;
for (int i = 0; i < N; i++) {
ave += vi.at(i);
}
vector<int> va(N);
for (int i = 0; i < N; i++) {
va.at(i) = N * va.at(i) - ave;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vi(N);
for (int i = 0; i < N; i++) {
cin >> vi.at(i);
}
int ave = 0;
for (int i = 0; i < N; i++) {
ave += vi.at(i);
}
vector<int> va(N);
for (int i = 0; i < N; i++) {
va.at(i) = N * vi.at(i) - ave;
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,009,574 | 1,009,575 | u890654777 | cpp |
p03214 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifndef ONLINE_JUDGE
// freopen("input.t... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifndef ONLINE_JUDGE
// freopen("input.t... | [
"expression.operation.binary.add"
] | 1,009,578 | 1,009,579 | u345794450 | cpp |
p03214 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define FILE_IO freopen("input.txt", ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define FILE_IO freopen("input.txt", ... | [
"assignment.add"
] | 1,009,582 | 1,009,583 | u572138437 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 30;
typedef long long int ll;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 30;
typedef long long int ll;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,009,586 | 1,009,587 | u630664279 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> a(N, 0);
double ave = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs(a[i] - ave) < abs(a[i - 1] - ave)) {
ans = i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> a(N, 0);
double ave = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs(a[i] - ave) < abs(a[ans] - ave)) {
ans = i;
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,009,590 | 1,009,591 | u261514692 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> a(N, 0);
int ave = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs(a[i] - ave) < abs(a[i - 1] - ave)) {
ans = i;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> a(N, 0);
double ave = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs(a[i] - ave) < abs(a[ans] - ave)) {
ans = i;
... | [
"variable_declaration.type.primitive.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,009,593 | 1,009,591 | u261514692 | cpp |
p03214 | #include <bits/stdc++.h>
#define inf ((int)(1e9))
using namespace std;
const int maxn = 100;
int n, a[maxn], sum = 0, pos = -1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int s = sum / n, minn = inf;
for (int i = 0; i < n; i++)
if (abs(a[i] - s) < minn) {
... | #include <bits/stdc++.h>
#define inf ((float)(1e9))
using namespace std;
const int maxn = 100;
int n, a[maxn], sum = 0, pos = -1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
float s = (float)sum / n, minn = inf;
for (int i = 0; i < n; i++)
if (abs(a[i] - s) < m... | [
"preprocessor.define.value.change",
"variable_declaration.type.primitive.change"
] | 1,009,603 | 1,009,604 | u954081460 | cpp |
p03214 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<double> a(N);
REP(i, N) cin >> a[i];
double avg = accumulate(ALL(a), 0) / N;
double diff = 1 << 30;
int ans = 0;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<double> a(N);
REP(i, N) cin >> a[i];
double avg = (double)accumulate(ALL(a), 0) / N;
double diff = 1 << 30;
int an... | [
"type_conversion.add"
] | 1,009,605 | 1,009,606 | u318727472 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,009,611 | 1,009,612 | u030685402 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
int a[100];
double ave = 0.0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= 1.0 * n;
int ans = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
cin >> n;
int a[100];
double ave = 0.0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= 1.0 * n;
... | [] | 1,009,613 | 1,009,614 | u452544900 | cpp |
p03214 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | [
"variable_declaration.type.change"
] | 1,009,615 | 1,009,616 | u388817534 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c = 0, d = 1000, e = 0;
cin >> a;
int test[101] = {0};
for (int h = 0; h < a; h++) {
cin >> b;
c += b;
test[h] = b;
}
for (int j = 0; j < a; j++) {
if (d > abs(test[j] - c ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
double a, b, c = 0, d = 1000, e = 0;
cin >> a;
int test[100] = {0};
for (int h = 0; h < a; h++) {
cin >> b;
c += b;
test[h] = b;
}
for (int j = 0; j < a; j++) {
if (d > abs(test[j] -... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,009,617 | 1,009,618 | u986568278 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[110], sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
double average = (double)sum / N;
int ans = 10000, dif = 10000;
for (int i = 0; i < N; i++) {
if (abs(average - a[i]) < dif) {
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[110], sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
double average = (double)sum / N;
int ans = 10000;
double dif = 10000.0;
for (int i = 0; i < N; i++) {
if (abs(average - a[i]) < dif... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,621 | 1,009,622 | u658901072 | cpp |
p03214 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, i... | [
"variable_declaration.type.primitive.change"
] | 1,009,623 | 1,009,624 | u200729311 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long int
using namespace std;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long int
using namespace std;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"variable_declaration.type.primitive.change"
] | 1,009,625 | 1,009,626 | u943004959 | cpp |
p03214 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
#define INF ((double)(1e9))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N, 0);
rep(i, N... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
#define INF ((double)(1e9))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N, 0);
rep(i, N... | [
"variable_declaration.type.primitive.change"
] | 1,009,627 | 1,009,628 | u635277286 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i++ < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
ll n, a[110... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i++ < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
ll n, a[110... | [
"variable_declaration.value.change"
] | 1,009,631 | 1,009,632 | u434208140 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int n;
double avg = 0;
std::cin >> n;
std::vector<int> v(n);
for (size_t i = 0; i < n; i++) {
std::cin >> v[i];
}
avg = 1.0 * std::accu... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int n;
double avg = 0;
std::cin >> n;
std::vector<int> v(n);
for (size_t i = 0; i < n; i++) {
std::cin >> v[i];
}
avg = 1.0 * std::accu... | [
"variable_declaration.type.primitive.change"
] | 1,009,637 | 1,009,638 | u914739916 | cpp |
p03214 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"call.remove"
] | 1,009,639 | 1,009,640 | u054106284 | cpp |
p03214 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"type_conversion.add"
] | 1,009,641 | 1,009,640 | u054106284 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N;
cin >> N;
float as[N], sum = 0;
for (int i = 0; i < N; i++) {
cin >> as[i];
sum += as[i];
}
sum /= N;
int ans = 0;
float diff = FLT_MAX;
for (int i = 0; i < N; i++) {
if (diff > abs(sum - as[i])) {
diff = abs(sum -... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N;
cin >> N;
float as[N], sum = 0;
for (int i = 0; i < N; i++) {
cin >> as[i];
sum += as[i];
}
sum /= N;
int ans = 0;
float diff = FLT_MAX;
for (int i = 0; i < N; i++) {
if (diff > abs(sum - as[i])) {
diff = abs(sum -... | [
"expression.operation.binary.remove"
] | 1,009,642 | 1,009,643 | u344412812 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, gokei = 0, temp = 1000000, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
gokei += a[i];
}
for (int i = 0; i < n; i++) {
if (temp > abs(gokei - n * a[i])) {
ans = i;
temp = gokei - n *... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, gokei = 0, temp = 1000000, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
gokei += a[i];
}
for (int i = 0; i < n; i++) {
if (temp > abs(gokei - n * a[i])) {
ans = i;
temp = abs(gokei -... | [
"call.add",
"call.arguments.change"
] | 1,009,646 | 1,009,647 | u560135121 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n)... | [
"variable_declaration.type.primitive.change"
] | 1,009,650 | 1,009,651 | u196497077 | cpp |
p03214 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a(N);
for (auto &t : a)
cin >> t;
int sum = 0;
for (auto &t : a)
sum += t;
int res = 0, dif = 1000000000;
for (int i = 0; i < N; i++) {
int sub = abs(sum - N * a[i]);
if (sub < dif) {
res = i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (auto &t : a)
cin >> t;
int sum = 0;
for (auto &t : a)
sum += t;
int res = 0, dif = 1000000000;
for (int i = 0; i < N; i++) {
int sub = abs(sum - N * a[i]);
if (sub < dif) {
... | [] | 1,009,652 | 1,009,653 | u002023395 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,009,656 | 1,009,657 | u754862537 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = sum / n;
double diff = 1000;
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(a[i] - ave) < diff) {
ans = i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = sum / n;
double diff = 1000;
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(a[i] - ave) < diff) {
ans = ... | [
"variable_declaration.type.primitive.change"
] | 1,009,658 | 1,009,659 | u633967774 | cpp |
p03214 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"variable_declaration.type.primitive.change"
] | 1,009,662 | 1,009,663 | u698760125 | cpp |
p03214 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,009,664 | 1,009,663 | u698760125 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double aver = sum / n;
double mn = fabs(aver - a[0]);
int index = 0;
for (int i = 1; i < n; i++) {
if (fabs(aver - a[... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double aver = (double)sum / n;
double mn = fabs(aver - a[0]);
int index = 0;
for (int i = 1; i < n; i++) {
if (fabs(a... | [
"type_conversion.add"
] | 1,009,665 | 1,009,666 | u765857778 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef double ld;
const int N = 100 + 10, M = 1000 + 10;
int a[N];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, sum = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef double ld;
const int N = 100 + 10, M = 1000 + 10;
int a[N];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, sum = 0;
cin >> n;
f... | [] | 1,009,671 | 1,009,672 | u810533911 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define prln(x) //(cerr << #x << ' ' << x << endl)
#define pr(x) //(cerr << #x << ' ' << x)
const int INF = 0x3f3f3f3f;
const int maxn = 105;
int a[maxn];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define prln(x) //(cerr << #x << ' ' << x << endl)
#define pr(x) //(cerr << #x << ' ' << x)
const int INF = 0x3f3f3f3f;
const int maxn = 105;
int a[maxn];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,009,673 | 1,009,674 | u625893557 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
sum += a.at(i);
}
int d = 1000;
int x;
int ans;
for (int i = 0; i < N; i++) {
x = abs(sum - a.at(i) * N);
if (d < x) {
d = x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
sum += a.at(i);
}
int d = 1000;
int x;
int ans;
for (int i = 0; i < N; i++) {
x = abs(sum - a.at(i) * N);
if (d > x) {
d = x... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,009,677 | 1,009,678 | u572077985 | cpp |
p03214 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
using namespace std;
const double pi = acos(-1);
#define nyan cout << "(=^•ω•^=)" << endl;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
using namespace std;
const double pi = acos(-1);
#define nyan cout << "(=^•ω•^=)" << endl;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++... | [] | 1,009,679 | 1,009,680 | u128258399 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
int main() {
int N, i, j;
j = 0;
double b, c;
c = 100000;
b = 0.0;
cin >> N;
int a[N];
int D[N];
for (i = 0; i < N; i++) {
cin >> a[i];
b = b + a[i];
}
b = b / N;
for (i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
int main() {
int N, i, j;
j = 0;
double b, c;
c = 100000;
b = 0.0;
cin >> N;
int a[N];
double D[N];
for (i = 0; i < N; i++) {
cin >> a[i];
b = b + a[i];
}
b = b / N;
for (i = 0; i < N; i... | [
"variable_declaration.type.primitive.change"
] | 1,009,692 | 1,009,693 | u499729664 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
int main() {
int N, i, j;
double b, c;
c = 100000;
b = 0.0;
cin >> N;
int a[N];
int D[N];
for (i = 0; i < N; i++) {
cin >> a[i];
b = b + a[i];
}
b = b / N;
for (i = 0; i < N; i++) {
D[... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
int main() {
int N, i, j;
j = 0;
double b, c;
c = 100000;
b = 0.0;
cin >> N;
int a[N];
double D[N];
for (i = 0; i < N; i++) {
cin >> a[i];
b = b + a[i];
}
b = b / N;
for (i = 0; i < N; i... | [
"assignment.add",
"variable_declaration.type.primitive.change"
] | 1,009,694 | 1,009,693 | u499729664 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, a[111];
cin >> n;
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= (double)n;
int ans, min = 22222222;
for (int i = 0; i < n; i++) {
double de = abs(ave - a[i]);
if (min > ... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n, a[111];
cin >> n;
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= (double)n;
int ans;
double min = 22222222;
for (int i = 0; i < n; i++) {
double de = abs(ave - a[i]);
i... | [
"variable_declaration.type.change"
] | 1,009,700 | 1,009,701 | u901561754 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100 + 7;
int A[MAX_N];
int main() {
int N;
scanf("%d", &N);
long long avg = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
A[i] *= 2;
avg += A[i];
}
avg /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100 + 7;
int A[MAX_N];
int main() {
int N;
scanf("%d", &N);
long long avg = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
A[i] *= N;
avg += A[i];
}
avg /= N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (abs... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,009,702 | 1,009,703 | u924194799 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//'A' = 65, 'a' = 97
int main() {
int n;
cin >> n;
double a[n];
double sum = 0;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//'A' = 65, 'a' = 97
int main() {
int n;
cin >> n;
double a[n];
double sum = 0;
... | [
"variable_declaration.type.primitive.change"
] | 1,009,710 | 1,009,711 | u214304095 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; ++i)
signed main() {
int n;
vector<double> a(n);
rep(i, 0, n) cin >> a[i];
double ave = accumulate(a.begin(), a.end(), double(0)) / n;
rep(i, 0, n) a[i] = abs(a[i] - ave);
cout << min_element(a.begin(), a.end()) - a.b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; ++i)
signed main() {
int n;
cin >> n;
vector<double> a(n);
rep(i, 0, n) cin >> a[i];
double ave = accumulate(a.begin(), a.end(), double(0)) /
n; //合計 accumulate(始め,終わり,初期値)
rep(i, 0, n) a[i] = abs(a[i] ... | [] | 1,009,716 | 1,009,717 | u874644572 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; ++i)
signed main() {
int n;
vector<double> a(n);
rep(i, 0, n) cin >> a[i];
double ave = accumulate(a.begin(), a.end(), double(0)) / n;
rep(i, 0, n) a[i] = abs(a[i] - ave);
cout << min_element(a.begin(), a.end()) - a.b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; ++i)
signed main() {
int n;
cin >> n;
vector<double> a(n);
rep(i, 0, n) cin >> a[i];
double ave = accumulate(a.begin(), a.end(), double(0)) / n;
rep(i, 0, n) a[i] = abs(a[i] - ave);
cout << min_element(a.begin(), a.... | [] | 1,009,716 | 1,009,718 | u874644572 | cpp |
p03214 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, ans;
double avg, c = 100;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
avg = accumulate(a.begin(), a.end(), 0) / a.size();
for (int i = 0; i < N; i++) {
if (avg > a.at(i)) {
... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, ans;
double avg, c = 100;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
avg = accumulate(a.begin(), a.end(), 0) / (double)a.size();
for (int i = 0; i < N; i++) {
if (avg > a.at(i)) ... | [
"type_conversion.add"
] | 1,009,719 | 1,009,720 | u441250130 | cpp |
p03214 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, ans;
double avg, c = 100000;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
avg = accumulate(a.begin(), a.end(), 0) / a.size();
for (int i = 0; i < N; i++) {
if (avg > a.at(i)) {
... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, ans;
double avg, c = 100;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
avg = accumulate(a.begin(), a.end(), 0) / (double)a.size();
for (int i = 0; i < N; i++) {
if (avg > a.at(i)) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,721 | 1,009,720 | u441250130 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int a[n];
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = sum / n;
double b[n];
for (int i = 0; i < n; i++) {
b[i] = abs(ave - a[i]);
}
double min = a[0]... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int a[n];
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = sum / n;
double b[n];
for (int i = 0; i < n; i++) {
b[i] = abs(ave - a[i]);
}
double min = b[0]... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,009,727 | 1,009,728 | u815028139 | cpp |
p03214 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = sum / n, def = 100;
int ans = -1;
for (int i = 0; i < n; i++)
if (abs(ave - a[i]) < def) {... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = (double)sum / (double)n, def = 100;
int ans = -1;
for (int i = 0; i < n; i++)
if (abs(ave ... | [
"type_conversion.add"
] | 1,009,729 | 1,009,730 | u623115612 | cpp |
p03214 | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
signed main() {
int N;
cin >> N;
int a[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
sum += a[i];
}
double m;
m = sum / (double)N;
// cout <<m <... | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
signed main() {
int N;
cin >> N;
int a[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
sum += a[i];
}
double m;
m = sum / (double)N;
// cout <<m <... | [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.add"
] | 1,009,731 | 1,009,732 | u888717396 | cpp |
p03214 | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
signed main() {
int N;
cin >> N;
int a[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
sum += a[i];
}
double m;
m = sum / (double)N;
// cout <<m <... | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
signed main() {
int N;
cin >> N;
int a[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
sum += a[i];
}
double m;
m = sum / (double)N;
// cout <<m <... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 1,009,733 | 1,009,732 | u888717396 | cpp |
p03214 | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main() {
double n, a[110];
double sum = 0;
cin >> n;
lol(i, n) {
cin >> a[i];
sum += a[i];
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main() {
double n, a[110];
double sum = 0;
cin >> n;
lol(i, n) {
cin >> a[i];
sum += a[i];
... | [
"variable_declaration.type.change"
] | 1,009,741 | 1,009,742 | u924885571 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
int a[200];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
double ave = 0.0;
for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
int a[200];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
double ave = 0;
for (int i = 0; i <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,743 | 1,009,744 | u946090308 | cpp |
p03214 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
float a[110];
int main() {
int n, pos = 0, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%f", &a[i]);
sum += a[i];
}
float av = sum / n;
float t = abs(a[0] - av);
for (int i = 1; i < n; i++) {
if (abs(a[i] - av... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
float a[110];
int main() {
int n, pos = 0, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%f", &a[i]);
sum += a[i];
}
float av = sum / (n * 1.0);
float t = abs(a[0] - av);
for (int i = 1; i < n; i++) {
if (abs(a... | [] | 1,009,745 | 1,009,746 | u820628270 | cpp |
p03214 | #include <algorithm> // std::copy()
#include <cctype> // std::isdigit()
#include <climits> // INT_MIN
#include <cmath>
#include <cstdio>
#include <functional> // std::greater<T>()
#include <iostream>
#include <iterator> // std::back_inserter()
#include <numeric> // accumulate(ALL(vec), 0) 0 は初期値
#include <string... | #include <algorithm> // std::copy()
#include <cctype> // std::isdigit()
#include <climits> // INT_MIN
#include <cmath>
#include <cstdio>
#include <functional> // std::greater<T>()
#include <iostream>
#include <iterator> // std::back_inserter()
#include <numeric> // accumulate(ALL(vec), 0) 0 は初期値
#include <string... | [
"type_conversion.add"
] | 1,009,747 | 1,009,748 | u870998297 | cpp |
p03214 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int n;
double a[105];
int main() {
cin >> n;
double sum = 0;
for (int i = 0; i < n; i++)
cin >> a[i], sum += a[i];
sum = sum / (1.0 * n);
int ans = 0, min = 1000000.0;
for (int i = 0; i < n; i++) {
if (fabs(a[i] - sum) < min... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int n;
double a[105];
int main() {
cin >> n;
double sum = 0;
for (int i = 0; i < n; i++)
cin >> a[i], sum += a[i];
sum = sum / (1.0 * n);
int ans = 0;
double min = 10000000.0;
for (int i = 0; i < n; i++) {
if (fabs(a[i] - ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,751 | 1,009,752 | u891481563 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
double s = 0;
for (auto &x : a) {
cin >> x;
s += x;
}
s /= n;
int idx = 0;
double mi = 110;
for (int i = 0; i < n; i++) {
int t = abs(a[i] - s);
if (t < mi) {
idx = i;
mi = t;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
double s = 0;
for (auto &x : a) {
cin >> x;
s += x;
}
s /= n;
int idx = 0;
double mi = 110;
for (int i = 0; i < n; i++) {
double t = abs(a[i] - s);
if (t < mi) {
idx = i;
mi =... | [
"variable_declaration.type.primitive.change"
] | 1,009,757 | 1,009,758 | u234435881 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
double s = 0;
for (auto &x : a) {
cin >> x;
s += x;
}
s /= n;
int idx = 0, mi = 110;
for (int i = 0; i < n; i++) {
int t = abs(a[i] - s);
if (t < mi) {
idx = i;
mi = t;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
double s = 0;
for (auto &x : a) {
cin >> x;
s += x;
}
s /= n;
int idx = 0;
double mi = 110;
for (int i = 0; i < n; i++) {
double t = abs(a[i] - s);
if (t < mi) {
idx = i;
mi =... | [
"variable_declaration.type.primitive.change"
] | 1,009,759 | 1,009,758 | u234435881 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
//素数判定
bool IsPrime(int p) {
if (p == 1)
return false;
for (int i = 2; i < p; i++) {
if (p % i == 0)
return false;
}
return true;
}
// 10進数の自然数の桁数を返す
int GetDigit(int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
//素数判定
bool IsPrime(int p) {
if (p == 1)
return false;
for (int i = 2; i < p; i++) {
if (p % i == 0)
return false;
}
return true;
}
// 10進数の自然数の桁数を返す
int GetDigit(int... | [] | 1,009,764 | 1,009,765 | u461044076 | cpp |
p03214 | #include <cmath>
#include <iostream>
#define INF 10e9
using namespace std;
static const int MAX = 100;
int main(void) {
int N;
cin >> N;
int A[MAX];
double res = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
res += A[i];
}
res /= N;
int ans, xmin = INF;
for (int i = 0; i < N; i++) {
if (... | #include <cmath>
#include <iostream>
#define INF 10e9
using namespace std;
static const int MAX = 100;
int main(void) {
int N;
cin >> N;
int A[MAX];
double res = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
res += A[i];
}
res /= N;
int ans;
double xmin = INF;
for (int i = 0; i < N; i++) {... | [
"variable_declaration.type.change"
] | 1,009,768 | 1,009,769 | u174265495 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"variable_declaration.type.primitive.change"
] | 1,009,770 | 1,009,771 | u550398291 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | [
"variable_declaration.type.primitive.change"
] | 1,009,776 | 1,009,777 | u111742294 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = N * a[i];
}
int ave = 0;
for (int i = 0; i < N; i++) {
ave = ave + a[i];
}
int min = 0;
for (int i = 1; i < N; i++) {
if (abs(ave - a[min]) > abs(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = N * a[i];
}
int ave = 0;
for (int i = 0; i < N; i++) {
ave = ave + a[i];
}
ave = ave / N;
int min = 0;
for (int i = 1; i < N; i++) {
if (abs(ave ... | [
"assignment.add"
] | 1,009,778 | 1,009,779 | u077536797 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, dif = 10000000, x = 0;
double s = 0;
cin >> n;
vector<int> a(n);
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double n, dif = 10000000;
int x = 0;
double s = 0;
cin >> n;
vector<double> a(n... | [
"variable_declaration.type.primitive.change"
] | 1,009,780 | 1,009,781 | u604231488 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int a[100];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
float ave = sum / n;
int min = 10000000;
int idx;
for (int i = 0; i < n; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int a[100];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ave = (double)sum / n;
double min = 10000000;
int idx;
// cout << ... | [
"variable_declaration.type.primitive.change"
] | 1,009,782 | 1,009,783 | u175948183 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int ave = 0;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
ave += A[i];
}
ave /= N;
int ans = 0;
rep(i, N) {
if (abs(A[ans] - ave) > abs(A[i] - ave)) {
ans = i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
double ave = 0;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
ave += A[i];
}
ave /= N;
int ans = 0;
rep(i, N) {
if (abs(A[ans] - ave) > abs(A[i] - ave)) {
ans = i;
... | [
"variable_declaration.type.primitive.change"
] | 1,009,786 | 1,009,787 | u406407674 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#el... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#el... | [
"variable_declaration.type.change"
] | 1,009,788 | 1,009,789 | u633020228 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define INF (1 << 28)
#define lp(i, n) for (int i = 0; i < n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define INF (1 << 28)
#define lp(i, n) for (int i = 0; i < n; i++)
#def... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,009,790 | 1,009,791 | u501494362 | cpp |
p03214 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[100];
double ave;
int ans;
int mi;
int sum = 0;
int main() {
scanf("%d", &n);
mi = 101;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
ave = sum * 1.0 / n;
for (int i = 0; i < n; i++) {
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[100];
double ave;
int ans;
double mi;
int sum = 0;
int main() {
scanf("%d", &n);
mi = 101;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
ave = sum * 1.0 / n;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,009,792 | 1,009,793 | u433665020 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define P... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define P... | [
"variable_declaration.name.change",
"identifier.change"
] | 1,009,798 | 1,009,799 | u257304866 | cpp |
p03214 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define ... | [
"variable_declaration.value.change"
] | 1,009,800 | 1,009,801 | u465574608 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 10000
int main() {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 10000
int main() {... | [
"variable_declaration.type.widen.change"
] | 1,009,804 | 1,009,805 | u510611356 | cpp |
p03214 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define int long long
#define ll long long
#define mo... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define int long long
#define ll long long
#define mo... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,806 | 1,009,807 | u592610268 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int ret = 0;
int min = 10000;
for (int i = 0; i < n; i++) {
double dif = abs((double)a[i] - (double)sum / n);
if (d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int ret = 0;
double min = 10000;
for (int i = 0; i < n; i++) {
double dif = abs((double)a[i] - (double)sum / n);
if... | [
"variable_declaration.type.primitive.change"
] | 1,009,808 | 1,009,809 | u158758819 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int ret = 0;
int min = 10000;
for (int i = 0; i < n; i++) {
double dif = abs((double)a[i] - (double)sum / n);
if (dif <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int ret = 0;
double min = 10000;
for (int i = 0; i < n; i++) {
double dif = abs((double)a[i] - (double)sum / n);
if... | [
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,009,810 | 1,009,809 | u158758819 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
cin.sync_with_stdio(false);
int N;
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
cin.sync_with_stdio(false);
int N;
c... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,009,815 | 1,009,816 | u906880177 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
cin.sync_with_stdio(false);
int N;
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
cin.sync_with_stdio(false);
int N;
c... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,817 | 1,009,816 | u906880177 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ans = sum / n;
int sa = 1e9;
int id = 0;
for (int i = 0; i < n; i++) ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ans = sum / n;
double sa = 1e9;
int id = 0;
for (int i = 0; i < n; i+... | [
"variable_declaration.type.primitive.change"
] | 1,009,818 | 1,009,819 | u890465662 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<int> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ans = sum / n;
int sa = 1e9;
int id = -1;
for (int i = 0; i < n; i++) {
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double ans = sum / n;
double sa = 1e9;
int id = 0;
for (int i = 0; i < n; i+... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,009,820 | 1,009,819 | u890465662 | cpp |
p03214 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (int i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (int i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | [
"variable_declaration.type.change"
] | 1,009,823 | 1,009,824 | u218842729 | cpp |
p03214 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,009,827 | 1,009,828 | u526532903 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
doub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
doub... | [
"variable_declaration.type.change"
] | 1,009,829 | 1,009,830 | u480831358 | cpp |
p03214 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"variable_declaration.type.primitive.change"
] | 1,009,831 | 1,009,832 | u579875569 | cpp |
p03215 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"control_flow.branch.if.condition.change"
] | 1,009,835 | 1,009,836 | u714724786 | cpp |
p03215 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,009,841 | 1,009,838 | u714724786 | cpp |
p03215 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,009,860 | 1,009,861 | u528720841 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.name.change",
"identifier.change",
"literal.number.type.widen.change",
"assignment.value.change",
"assignment.variable.change"
] | 1,009,876 | 1,009,875 | u137747137 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N, K;
cin >> N >> K;
vector<ll> a(N);
rep(i, 0, N) cin >> a[i];
// 累積和
vector<ll> s(N + 1, 0);
rep(i, 1, N + 1) s[i] = a[i] + s[i - 1];
// ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N, K;
cin >> N >> K;
vector<ll> a(N + 1);
rep(i, 1, N + 1) cin >> a[i];
// 累積和
vector<ll> s(N + 1, 0);
rep(i, 1, N + 1) s[i] = a[i] + s[i - 1]... | [
"literal.number.change",
"call.arguments.change"
] | 1,009,914 | 1,009,915 | u893584578 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
vector<int64_t> B(n);
for (int l = 0; l < n; l++) {
int64_t S = 0;
for (int r = l; r < n; r++) {
S += A[r];
B.push_back(S);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
vector<int64_t> B;
for (int l = 0; l < n; l++) {
int64_t S = 0;
for (int r = l; r < n; r++) {
S += A[r];
B.push_back(S);
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,009,916 | 1,009,917 | u268793453 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | [
"call.remove"
] | 1,009,961 | 1,009,962 | u632094970 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"identifier.change",
"call.arguments.change"
] | 1,009,964 | 1,009,965 | u322177979 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"identifier.change",
"call.arguments.change"
] | 1,009,966 | 1,009,965 | u322177979 | cpp |
p03215 | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"control_flow.loop.condition.change"
] | 1,009,981 | 1,009,982 | u155416173 | cpp |
p03215 | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | //#include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change"
] | 1,009,983 | 1,009,982 | u155416173 | cpp |
p03215 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef uint64_t ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n, val, k;
cin >> n >> k;
ll acc = 0;
vector<ll> dp = {0};
for (int... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef uint64_t ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int n, val, k;
cin >> n >> k;
ll acc = 0;
vector<ll> dp = {0};
for (int... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,010,021 | 1,010,022 | u067694854 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.