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 <cmath>
#include <iostream>
using namespace std;
int N;
double a[101];
int solve(double ave) {
int index = 0;
for (int i = 0; i < N; i++) {
if (abs(a[i] - ave) < abs(a[index] - ave)) {
index = i;
}
}
cout << index << endl;
return 0;
}
int main() {
cin >> N;
double ave = 0;
for ... | #include <cmath>
#include <iostream>
using namespace std;
int N;
int a[101];
int solve(double ave) {
int index = 0;
for (int i = 0; i < N; i++) {
if (abs(a[i] - ave) < abs(a[index] - ave)) {
index = i;
}
}
cout << index << endl;
return 0;
}
int main() {
cin >> N;
double ave = 0;
for (in... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 1,010,786 | 1,010,787 | u540433787 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int N;
int a[101];
int solve(double ave) {
int index = 0;
for (int i = 0; i < N; i++) {
if (abs(a[i] - ave) < abs(a[index] - ave)) {
index = i;
}
}
cout << index << endl;
return 0;
}
int main() {
cin >> N;
double ave = 0;
for (in... | #include <cmath>
#include <iostream>
using namespace std;
int N;
int a[101];
int solve(double ave) {
int index = 0;
for (int i = 0; i < N; i++) {
if (abs(a[i] - ave) < abs(a[index] - ave)) {
index = i;
}
}
cout << index << endl;
return 0;
}
int main() {
cin >> N;
double ave = 0;
for (in... | [
"expression.operation.binary.remove"
] | 1,010,788 | 1,010,787 | u540433787 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pos;
cin >> n;
int a[n], i, sum = 0;
double avg, temp = 100000000;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
avg = sum / n;
for (i = 0; i < n; i++) {
if (abs(avg - a[i]) < temp) {
temp = abs(avg - a[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pos;
cin >> n;
int a[n], i;
double avg, sum = 0, temp = 100000000;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
avg = sum / n;
for (i = 0; i < n; i++) {
if (abs(avg - a[i]) < temp) {
temp = abs(avg - a[i]);
... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,010,794 | 1,010,795 | u002680242 | cpp |
p03214 | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int n;
int ave = 0;
int kiroku;
int min = 100000000;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= n;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int n;
double ave = 0;
double kiroku;
double min = 100000000;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= n;
for (int i = 0; i < ... | [
"variable_declaration.type.primitive.change"
] | 1,010,796 | 1,010,797 | u371535422 | cpp |
p03214 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
int a[105];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
a[i] -= sum / n;
}
double minn = 999;
int k = 0;... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
double a[105];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
a[i] -= sum / n;
}
double minn = 999;
int k =... | [
"variable_declaration.type.primitive.change"
] | 1,010,800 | 1,010,801 | u935016091 | cpp |
p03214 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
int a[105];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
a[i] -= sum / n;
}
int minn = 999;
int k = 0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
double a[105];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
a[i] -= sum / n;
}
double minn = 999;
int k =... | [
"variable_declaration.type.primitive.change"
] | 1,010,802 | 1,010,801 | u935016091 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
struct f {
int no;
int f;
};
f t[110];
double tot = 0;
int ans, mini = 1e7;
double doabs(double a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t[i].f);
t[i].no = i;
... | #include <bits/stdc++.h>
using namespace std;
struct f {
int no;
int f;
};
f t[110];
double tot = 0;
int ans;
double mini = 1e7;
double doabs(double a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t[i].f);
t[i].no ... | [
"variable_declaration.type.change"
] | 1,010,803 | 1,010,804 | u091286840 | cpp |
p03214 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
int N;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = 0; // 要素の合計値
double ave = 0; // 要素の平均値
double absmin = 101; // 平均値との差を比較するための変数
int ans = 0;... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
int N;
cin >> N;
vector<double> a(N, 0);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
double sum = 0; // 要素の合計値
double ave = 0; // 要素の平均値
double absmin = 101; // 平均値との差を比較するための変数
int ans =... | [
"variable_declaration.type.primitive.change"
] | 1,010,805 | 1,010,806 | u067367418 | cpp |
p03214 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
int ave = 0;
cin >> N;
double a[100];
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
double y = fabs(a[0] - ave);
int any = 0;
for (int i = 1; i < N; i++) {
double x = fabs(a[i] - ave);
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
double ave = 0;
cin >> N;
double a[100] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave /= N;
double y = fabs(a[0] - ave);
int any = 0;
for (int i = 1; i < N; i++) {
double x = fabs(a[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,010,809 | 1,010,810 | u266643907 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ave = 0;
int frame = 0;
int l = 0;
int min = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int j = 0; j < n; j++) {
ave += a.at(j);
}
ave /= n;
for (int k = 0; k < n; k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ave = 0;
double frame = 0;
double l = 0;
int min = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int j = 0; j < n; j++) {
ave += a.at(j);
}
ave /= n;
for (int k = 0; k < n; k... | [
"variable_declaration.type.primitive.change"
] | 1,010,811 | 1,010,812 | u536015544 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,010,813 | 1,010,814 | u387055019 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,010,815 | 1,010,814 | u387055019 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[101];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
double ave = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / n;
for (int i = 1; i < n; i++) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,010,816 | 1,010,814 | u387055019 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
double ave = accumulate(a.begin(), a.end(), 0) / a.size();
double temp = 1111111111111;
int ans = a.size() - 1;
for (int i = N - 1; 0 <= i; i--) {
if (abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
double ave = accumulate(a.begin(), a.end(), 0.0) / a.size();
double temp = 1111111111111;
int ans = a.size() - 1;
for (int i = N - 1; 0 <= i; i--) {
if (a... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,010,817 | 1,010,818 | u654240084 | cpp |
p03214 | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
float avg = 0;
avg = (float)sum / (float)n;
int min = 1000;
int ans = 0;
... | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
float avg = 0;
avg = (float)sum / (float)n;
float min = 1000;
int ans = 0... | [
"variable_declaration.type.primitive.change"
] | 1,010,819 | 1,010,820 | u652037179 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int a[10001];
int main() {
double num = 0;
int mini, minn, n, m, i, j, k, t, s;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
num += a[i];
}
num = num / (int)n;
mini = 0;
minn = abs(a[0] - num);
for (i = 1; i < n; i++) {
doub... | #include <bits/stdc++.h>
using namespace std;
int a[10001];
int main() {
double num = 0, minn;
int mini, n, m, i, j, k, t, s;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
num += a[i];
}
num = num / (int)n;
mini = 0;
minn = abs(a[0] - num);
for (i = 1; i < n; i++) {
doub... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 1,010,821 | 1,010,822 | u965377001 | cpp |
p03214 | //ドワンゴプログラミングコンテストソース
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[110] = {};
double num = 0.0;
double hoge = 0.0;
int count = 100000;
int number = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
num += a[i];
}
// cout<<num;
num = num / n;
// cout<<n... | //ドワンゴプログラミングコンテストソース
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[110] = {};
double num = 0.0;
double hoge = 0.0;
double count = 100000;
int number = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
num += a[i];
}
// cout<<num;
num = num / n;
// cout... | [
"variable_declaration.type.primitive.change"
] | 1,010,823 | 1,010,824 | u320509353 | cpp |
p03214 | //ドワンゴプログラミングコンテストソース
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[110] = {};
double num = 0.0;
double hoge = 0.0;
int count = 100000;
int number = 110;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
num += a[i];
}
// cout<<num;
num = num / n;
// cout<... | //ドワンゴプログラミングコンテストソース
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[110] = {};
double num = 0.0;
double hoge = 0.0;
double count = 100000;
int number = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
num += a[i];
}
// cout<<num;
num = num / n;
// cout... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,825 | 1,010,824 | u320509353 | cpp |
p03214 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using... | [
"expression.operation.binary.remove"
] | 1,010,831 | 1,010,832 | u614421689 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, sum = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
sum += a[i];
}
// cout << "sum : " << sum << '\n';
double mean = su... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i;
double sum = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
sum += a[i];
}
// cout << "sum : " << sum << '\n';
double ... | [
"variable_declaration.type.change"
] | 1,010,835 | 1,010,836 | u959718851 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[N]... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
float sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[... | [
"variable_declaration.type.primitive.change"
] | 1,010,837 | 1,010,838 | u942534145 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[N]... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
float sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,010,839 | 1,010,838 | u942534145 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[N]... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
// 平均値を求める
float ave;
float sum = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
}
ave = sum / N;
// 距離を求める
float b[... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,010,840 | 1,010,838 | u942534145 | cpp |
p03214 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, i, a[110], ans;
double ave = 0, b, c = 2100000000;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= n;
for (i = 1; i <= n; i++) {
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, i, a[110], ans;
double ave = 0, b, c = 2100000000;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= n;
for (i = 1; i <= n; i++) {
... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,010,841 | 1,010,842 | u697367509 | cpp |
p03214 | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
vector<int> a;
cin >> n;
int avg = 0;
int i = 0;
for (i = 0; i < n; i++) {
cin >> k;
a.push_back(... | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
vector<int> a;
cin >> n;
double avg = 0;
int i = 0;
for (i = 0; i < n; i++) {
cin >> k;
a.push_ba... | [
"variable_declaration.type.primitive.change"
] | 1,010,847 | 1,010,848 | u536712674 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define step(i, n) ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define step(i, n) ... | [] | 1,010,849 | 1,010,850 | u196798307 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int arr[109];
int main() {
int i, n, ind = 0, mini = 100000;
double sum = 0.0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
double avg = sum / n;
for (i = 0; i < n; i++) {
double dif = abs(avg - arr[i]);
if (dif < mini) {... | #include <bits/stdc++.h>
using namespace std;
int arr[1099];
int main() {
int i, n;
double ind = 0.0, mini = 10000000;
double sum = 0.0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
double avg = sum / n;
for (i = 0; i < n; i++) {
double dif = abs(avg - arr[i]);
if ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 1,010,851 | 1,010,852 | u026903678 | cpp |
p03214 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
double avg = (double)sum / (double)n;
double sa = abs(avg - a[n - 1]);
// printf("sa=%f\... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
double avg = (double)sum / (double)n;
double sa = abs(avg - a[n - 1]);
// printf("sa=%f\... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,853 | 1,010,854 | u102305348 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
// sort(pro1, pro1 + SIZE_OF_ARRAY(pro1))... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
// sort(pro1, pro1 + SIZE_OF_ARRAY(pro1))... | [
"variable_declaration.type.primitive.change"
] | 1,010,857 | 1,010,858 | u248442450 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
// sort(pro1, pro1 + SIZE_OF_ARRAY(pro1))... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
// sort(pro1, pro1 + SIZE_OF_ARRAY(pro1))... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,010,859 | 1,010,858 | u248442450 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int N;
vector<int> a;
int input;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> input;
a.push_back(input);
}
int ave = accumulate(a.begin(), a.end(), 0) / N;
f... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
double N;
vector<double> a;
double input;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> input;
a.push_back(input);
}
double ave = accumulate(a.begin(), a.end(), ... | [
"variable_declaration.type.primitive.change"
] | 1,010,860 | 1,010,861 | u141004837 | cpp |
p03214 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
//#include <boost/math/common_factor_rt.hpp>
#define ll long long
#define max 100000
using namespace std;
ll l = 100... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
//#include <boost/math/common_factor_rt.hpp>
#define ll long long
#define max 100000
using namespace std;
ll l = 100... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,010,862 | 1,010,863 | u943840701 | cpp |
p03214 | #include "math.h"
#include <stdio.h>
int main() {
int N = 0;
int a[100];
double ave;
double sa = 100000;
int minnumber;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < N; i++) {
ave += a[i];
}
ave /= N;
for (int i = 0; i < N; i++) {
if (a[i] -... | #include "math.h"
#include <stdio.h>
int main() {
int N = 0;
int a[100];
double ave;
double sa = 100000;
int minnumber;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < N; i++) {
ave += a[i];
}
ave /= N;
for (int i = 0; i < N; i++) {
if (a[i] -... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,010,864 | 1,010,865 | u872031579 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int a[1919];
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
double n;
double iwa = 0;
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { iwa += a[i]; }
iwa = iwa / ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
double a[1919];
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
double n;
double iwa = 0;
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { iwa += a[i]; }
iwa = iwa... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,866 | 1,010,867 | u409872261 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int a[1919];
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
double n;
double iwa = 0;
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { iwa += a[i]; }
iwa = iwa / ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
double a[1919];
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
double n;
double iwa = 0;
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { iwa += a[i]; }
iwa = iwa... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,010,868 | 1,010,867 | u409872261 | cpp |
p03214 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, sum = 0, min;
int a[101] = {};
int flag = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
sum = sum / N;
for (int i = 0; i < N; i++) {
a[i] = a[i] - sum;
if (a[i] < 0)
a[i] = a[i... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double N, sum = 0, min;
double a[101] = {};
int flag = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
sum = sum / N;
for (int i = 0; i < N; i++) {
a[i] = a[i] - sum;
if (a[i] < 0)
a[i]... | [
"variable_declaration.type.primitive.change"
] | 1,010,873 | 1,010,874 | u696415377 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int dat[N];
int sum = 0;
for (int i = 0; i < N; ++i)
cin >> dat[i], sum += dat[i];
long long MIN = -1;
int idx = -1;
for (int i = 0; i < N; ++i) {
if (idx == -1) {
idx = i + 1;
MIN = abs(sum - N * dat[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int dat[N];
int sum = 0;
for (int i = 0; i < N; ++i)
cin >> dat[i], sum += dat[i];
long long MIN = -1;
int idx = -1;
for (int i = 0; i < N; ++i) {
if (idx == -1) {
idx = i + 1;
MIN = abs(sum - N * dat[i]);
... | [
"expression.operation.binary.add"
] | 1,010,883 | 1,010,884 | u000351359 | cpp |
p03214 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a;
cin >> N;
int sum = 0;
a = vector<int>(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
double average = (double)sum / N;
double min_dist = abs(average - a[0]);
i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a;
cin >> N;
int sum = 0;
a = vector<int>(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
double average = (double)sum / N;
double min_dist = abs(average - a[0]);
i... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,010,885 | 1,010,886 | u664826564 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int a[100], dis[100];
int sum = 0;
int samune = 1000;
int ans = 1000;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < N; i++) {
dis[i] = fabs((sum / N) - a[i]);
if (dis[i] ... | #include "bits/stdc++.h"
using namespace std;
int main() {
double N;
cin >> N;
double a[100], dis[100];
double sum = 0.;
double samune = 1000.;
int ans = 1000;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < N; i++) {
dis[i] = fabs((sum / N) - a[i]);
... | [
"variable_declaration.type.primitive.change"
] | 1,010,890 | 1,010,891 | u663970214 | cpp |
p03214 | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sc scanf
#define scin(x) sc("%d", &(x))
#define scln(x) sc("%lld", &(x))
#define pf printf
#define NL pf("\n")
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_bac... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sc scanf
#define scin(x) sc("%d", &(x))
#define scln(x) sc("%lld", &(x))
#define pf printf
#define NL pf("\n")
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_bac... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,010,892 | 1,010,893 | u986554750 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | [
"variable_declaration.type.change"
] | 1,010,894 | 1,010,895 | u588568850 | cpp |
p03214 | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
int a[150];
double ave;
double sum = 0;
int tmp = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ave = sum / n;
for (int i = 0; i < n; i++) {
if (fabs(ave - a[i])... | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
int a[150];
double ave;
double sum = 0;
int tmp = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ave = sum / n;
for (int i = 0; i < n; i++) {
if (fabs(ave - a[i])... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,010,899 | 1,010,900 | u546736430 | cpp |
p03214 | #include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
int N, a[100];
cin >> N;
pair<int,... | #include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
int N, a[100];
cin >> N;
pair<doub... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,010,901 | 1,010,902 | u270170852 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int n;
cin >> n;
vector<double> a(n);
vector<pair<double, int>> d(n);
int sum{};
double avg{};
REP(i, n) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int n;
cin >> n;
vector<double> a(n);
vector<pair<double, int>> d(n);
double sum{};
double avg{};
REP(i, n) {
... | [
"variable_declaration.type.primitive.change"
] | 1,010,907 | 1,010,908 | u970831327 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[100];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg;
avg = sum / n;
float pre;
float an... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[105];
float sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg;
avg = sum / n;
float pre;
float ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 1,010,911 | 1,010,912 | u072831727 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[100];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg;
avg = sum / n;
float pre;
int ans ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[105];
float sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg;
avg = sum / n;
float pre;
float ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,010,913 | 1,010,912 | u072831727 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[100];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg = 0;
avg = sum / n;
float pre;
int ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
int main() {
int n, a[105];
float sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
float avg;
avg = sum / n;
float pre;
float ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 1,010,914 | 1,010,912 | u072831727 | cpp |
p03214 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
double average = accumulate(a.begin(), a.end(), 0) / n;
double d = numeric_limits<double>::max();
int f;
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
double average = (double)accumulate(a.begin(), a.end(), 0) / n;
double d = numeric_limits<double>::max();
int f;
for (int i = 0;... | [
"type_conversion.add"
] | 1,010,915 | 1,010,916 | u774263141 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <map>
#include <string.h>
#include <vector>
#define rep(i, N) for (int i = 0; i < ((int)N); i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(void) {
int N;
cin >> N;
double num = N;
double a[N];
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string.h>
#include <vector>
#define rep(i, N) for (int i = 0; i < ((int)N); i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(void) {
int N;
cin >> N;
double num = N;
double a[N];
for (int i = 0; i < N; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 1,010,917 | 1,010,918 | u238235808 | cpp |
p03214 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | [
"variable_declaration.type.primitive.change"
] | 1,010,925 | 1,010,926 | u525432476 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long N;
int main() {
cin >> N;
vector<long long> a;
vector<pair<double, long long>> b;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long N;
int main() {
cin >> N;
vector<long long> a;
vector<pair<double, long long>> b;
double sum = 0;
for (int i = 0; i < N; i++) {
long long t;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,010,927 | 1,010,928 | u453764945 | 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];
}
float h = sum / n;
float dis = 1000;
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(a[i] - h) < dis) {
dis = abs(a[i... | #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];
}
float h = (float)sum / n;
float dis = 1000;
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(a[i] - h) < dis) {
dis = ... | [
"type_conversion.add"
] | 1,010,929 | 1,010,930 | u735499035 | cpp |
p03214 | #include <iostream>
using namespace std;
int main() {
int N, a[100], ans;
double ave = 0, tmp, min;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / N;
min = ave - a[0];
if (min < 0)
min = -min;
for (int i = 0; i < N; i++) {
tmp = ave - a[i];
if (tmp... | #include <iostream>
using namespace std;
int main() {
int N, a[100], ans = 0;
double ave = 0, tmp, min;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
ave += a[i];
}
ave = ave / N;
min = ave - a[0];
if (min < 0)
min = -min;
for (int i = 0; i < N; i++) {
tmp = ave - a[i];
if ... | [
"variable_declaration.value.change"
] | 1,010,931 | 1,010,932 | u656929062 | cpp |
p03214 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int mai... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int mai... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,010,933 | 1,010,934 | u353542198 | cpp |
p03214 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<double> a(100);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
double ave;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
}
ave = sum / n;
double min = 999... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<double> a(100);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
double ave;
double sum = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
}
ave = sum / n;
double min = ... | [
"variable_declaration.type.primitive.change"
] | 1,010,935 | 1,010,936 | u598382605 | cpp |
p03214 | #include <iostream>
int n, a[110];
int main() {
std::cin >> n;
double ave = 0;
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
ave += a[i];
}
ave /= n;
int diff = 1000000;
int num = 0;
for (int i = 0; i < n; ++i) {
auto res = a[i] - ave;
if (res < 0)
res *= -1;
if (res < diff... | #include <iostream>
int n, a[110];
int main() {
std::cin >> n;
double ave = 0;
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
ave += a[i];
}
ave /= n;
double diff = 1000000;
int num = 0;
for (int i = 0; i < n; ++i) {
auto res = a[i] - ave;
if (res < 0)
res *= -1;
if (res < d... | [
"variable_declaration.type.primitive.change"
] | 1,010,941 | 1,010,942 | u640248738 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, a[100000];
cin >> N;
long total = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
total += a[i];
}
double avg = total / N;
double min = 100;
int ans;
for (int i = N - 1; i >= 0; i--) {
if (abs(a[i] - avg) <= min) {
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, a[100000];
cin >> N;
long total = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
total += a[i];
}
double avg = (double)total / N;
double min = 100;
int ans;
for (int i = N - 1; i >= 0; i--) {
if (abs(a[i] - avg) <= min) {
... | [
"type_conversion.add"
] | 1,010,943 | 1,010,944 | u005580749 | cpp |
p03214 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, a[100000];
cin >> N;
long total = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
total += a[i];
}
double avg = total / N;
long min = 100;
int ans;
for (int i = N - 1; i >= 0; i--) {
if (abs(a[i] - avg) <= min) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, a[100000];
cin >> N;
long total = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
total += a[i];
}
double avg = (double)total / N;
double min = 100;
int ans;
for (int i = N - 1; i >= 0; i--) {
if (abs(a[i] - avg) <= min) {
... | [
"variable_declaration.type.primitive.change"
] | 1,010,945 | 1,010,944 | u005580749 | cpp |
p03214 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, a;
double sum = 0.0;
vector<int> As;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
As.push_back(a);
sum += a;
}
sum /= N;
int minval = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
if (minval > abs(As[i] - s... | #include "bits/stdc++.h"
using namespace std;
int main() {
double N, a;
double sum = 0.0;
vector<double> As;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
As.push_back(a);
sum += a;
}
sum /= N;
double minval = 100000;
int ans = 0;
for (int i = 0; i < N; i++) {
if (minval > abs(... | [
"variable_declaration.type.primitive.change"
] | 1,010,949 | 1,010,950 | u709583164 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int main() {
ll n;
cin >> n;
do... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int main() {
ll n;
cin >> n;
do... | [] | 1,010,951 | 1,010,952 | u536625271 | cpp |
p03214 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) pu... |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) pu... | [
"variable_declaration.type.change"
] | 1,010,955 | 1,010,956 | u213156132 | cpp |
p03214 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) pu... |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) pu... | [
"variable_declaration.type.change"
] | 1,010,957 | 1,010,956 | u213156132 | cpp |
p03214 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | [
"variable_declaration.type.primitive.change"
] | 1,010,960 | 1,010,961 | u493750228 | cpp |
p03214 | #include <stdio.h>
int main() {
int n, a[111], min = 1111111, ans, i, ave, d;
scanf("%d", &n);
ave = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
ave += a[i];
}
for (i = 0; i < n; i++) {
d = a[i] * d - ave;
if (d < 0)
d = -d;
if (d < min) {
ans = i;
min = d;
}
... | #include <stdio.h>
int main() {
int n, a[111], min = 1111111, ans, i, ave, d;
scanf("%d", &n);
ave = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
ave += a[i];
}
for (i = 0; i < n; i++) {
d = a[i] * n - ave;
if (d < 0)
d = -d;
if (d < min) {
ans = i;
min = d;
}
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,010,962 | 1,010,963 | u933068010 | cpp |
p03214 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
int sum = 0;
for (auto &ai : a) {
std::cin >> ai;
sum += ai;
}
int average = sum / n;
for (auto &ai : a) {
ai = std::abs(ai - average);
}
int min = a[0];
int min_idx = 0;
for (auto ai = 0; ai < ... | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<float> a(n);
int sum = 0;
for (auto &ai : a) {
std::cin >> ai;
sum += ai;
}
float average = sum / (float)n;
for (auto &ai : a) {
ai = std::abs(ai - average);
}
auto min = a[0];
int min_idx = 0;
for (auto a... | [
"variable_declaration.type.primitive.change"
] | 1,010,964 | 1,010,965 | u696729148 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int dx[] = {... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int dx[] = {... | [
"variable_declaration.type.primitive.change"
] | 1,010,966 | 1,010,967 | u952094438 | cpp |
p03214 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int dx[] = {... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int dx[] = {... | [
"variable_declaration.type.primitive.change"
] | 1,010,968 | 1,010,967 | u952094438 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <malloc.h>
#include <map>
#include <set>
#include <stack>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int a[1000];
int main() {
int n;
int sum = 0;
double ss;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += ... | #include <algorithm>
#include <iostream>
#include <malloc.h>
#include <map>
#include <set>
#include <stack>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int a[1000];
int main() {
int n;
int sum = 0;
double ss;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += ... | [
"variable_declaration.type.primitive.change"
] | 1,010,969 | 1,010,970 | u914135866 | cpp |
p03214 | #include <algorithm>
#include <iostream>
#include <malloc.h>
#include <map>
#include <set>
#include <stack>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int a[1000];
int main() {
int n;
int sum = 0;
double ss;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += ... | #include <algorithm>
#include <iostream>
#include <malloc.h>
#include <map>
#include <set>
#include <stack>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int a[1000];
int main() {
int n;
int sum = 0;
double ss;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += ... | [
"variable_declaration.value.change",
"identifier.change",
"variable_declaration.type.primitive.change"
] | 1,010,971 | 1,010,970 | u914135866 | cpp |
p03214 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 1,010,972 | 1,010,973 | u043443359 | cpp |
p03214 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N;
int a[100];
int main() {
cin >> N;
int s = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
s += a[i];
}
int m = s / N;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N;
double a[100];
int main() {
cin >> N;
double s = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
s += a[i];
}
double m = ... | [
"variable_declaration.type.primitive.change"
] | 1,010,980 | 1,010,979 | u012298376 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 2e6 + 5;
char s[maxn];
int sum[maxn];
int k[maxn];
int n;
LL slove(int k) {
queue<int> q;
int j = 1, pre = 0;
LL ans = 0, res = 0;
for (int i = 1; i <= n; i++) {
if (s[i] != 'D')
continue;
// cout << "i " << i << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 2e6 + 5;
char s[maxn];
int sum[maxn];
int k[maxn];
int n;
LL slove(int k) {
queue<int> q;
int j = 1, pre = 0;
LL ans = 0, res = 0;
for (int i = 1; i <= n; i++) {
if (s[i] != 'D')
continue;
// cout << "i " << i << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,011,019 | 1,011,020 | u089230684 | cpp |
p03216 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
long long solve(int n, const string &s, int k) {
vector<long long> dp1(n + 1); // dp1[i+1] := # of D in s(i-k,i]
vector<long long> dp2(n + 1); // dp2[i+1] := # of M in s(i-k,i]
vector<long long> dp3(n + 1); // dp3[i+1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
long long solve(int n, const string &s, int k) {
vector<long long> dp1(n + 1); // dp1[i+1] := # of D in s(i-k,i]
vector<long long> dp2(n + 1); // dp2[i+1] := # of M in s(i-k,i]
vector<long long> dp3(n + 1); // dp3[i+1... | [
"assignment.change"
] | 1,011,045 | 1,011,046 | u781095600 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | [
"expression.operation.binary.remove"
] | 1,011,053 | 1,011,054 | u071692456 | cpp |
p03216 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,011,055 | 1,011,056 | u050865477 | cpp |
p03216 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl... | [
"variable_declaration.type.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change"
] | 1,011,116 | 1,011,114 | u487769730 | cpp |
p03216 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,011,127 | 1,011,128 | u714564133 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,011,135 | 1,011,136 | u759266806 | cpp |
p03217 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long do... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long do... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,011,139 | 1,011,140 | u955723966 | cpp |
p03217 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long do... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long do... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,011,141 | 1,011,140 | u955723966 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 1005;
int n, D;
int cnt[Maxn][Maxn];
int B[Maxn][Maxn];
void Add(int X1, int X2, int Y1, int Y2, int val) {
if (X1 > X2) {
Add(X1, D - 1, Y1, Y2, val);
Add(0, X2, Y1, Y2, val);
return;
}
if (Y1 > Y2) {
Add(X1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 1005;
int n, D;
int cnt[Maxn][Maxn];
int B[Maxn][Maxn];
void Add(int X1, int X2, int Y1, int Y2, int val) {
if (X1 > X2) {
Add(X1, D - 1, Y1, Y2, val);
Add(0, X2, Y1, Y2, val);
return;
}
if (Y1 > Y2) {
Add(X1,... | [
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add"
] | 1,011,142 | 1,011,143 | u055221623 | cpp |
p03217 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,011,144 | 1,011,145 | u491153752 | cpp |
p03217 | #include <bits/stdc++.h>
using namespace std;
void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' || k > ... | #include <bits/stdc++.h>
using namespace std;
void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' || k > ... | [
"identifier.change",
"call.arguments.change",
"call.arguments.add"
] | 1,011,151 | 1,011,152 | u066369439 | cpp |
p03218 | #include <bits/stdc++.h>
using namespace std;
long long N, A[1 << 18], E = 1;
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
sort(A + 1, A + N + 1);
for (int i = 1; i <= N; i++) {
E *= __gcd(A[i], 1LL * i);
E %= 998244353;
}
cout << E << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long N, A[1 << 18], E = 1;
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
sort(A + 1, A + N + 1);
for (int i = 1; i <= N; i++) {
E *= __gcd(A[i], 1LL * (i - 1));
E %= 998244353;
}
cout << E << endl;
return 0;
} | [
"call.arguments.change"
] | 1,011,157 | 1,011,158 | u504103417 | cpp |
p03218 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | [
"identifier.change",
"expression.operation.binary.remove"
] | 1,011,163 | 1,011,164 | u294531924 | cpp |
p03218 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
int64 ret = 1;
for (int i = 0; i < N; i++)
(ret *= __gcd(i + 1, A[i])) %= mod;
cout << ret << endl... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
int64 ret = 1;
for (int i = 0; i < N; i++)
(ret *= __gcd(i, A[i])) %= mod;
cout << ret << endl;
}
| [
"expression.operation.binary.remove"
] | 1,011,167 | 1,011,168 | u524343822 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
}
| [] | 1,011,212 | 1,011,213 | u312172322 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
} | [] | 1,011,212 | 1,011,215 | u312172322 | cpp |
p03219 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
using Graph = vector<vector<int>>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
cout << x + 1 / 2 << endl;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
using Graph = vector<vector<int>>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,011,220 | 1,011,221 | u843929518 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int x, y, total;
int main() {
cin >> x >> y;
total = (y + (x / 2));
cout << total << endl;
} | #include <bits/stdc++.h>
using namespace std;
int x, y, total;
int main() {
cin >> x >> y;
total = (x + (y / 2));
cout << total << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,011,222 | 1,011,223 | u353919145 | cpp |
p03219 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x, y;
cout << x + y / 2 << endl;
return 0... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return... | [] | 1,011,242 | 1,011,243 | u530957410 | cpp |
p03219 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"call.arguments.change"
] | 1,011,244 | 1,011,245 | u950002813 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"expression.operation.binary.add"
] | 1,011,246 | 1,011,247 | u722640678 | cpp |
p03219 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [] | 1,011,285 | 1,011,286 | u580593895 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [] | 1,011,298 | 1,011,299 | u531461815 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
} | [] | 1,011,321 | 1,011,322 | u455067221 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
}
| [] | 1,011,335 | 1,011,336 | u494609869 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
}
| [] | 1,011,356 | 1,011,357 | u237390401 | cpp |
p03219 | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int x, y;
cin >> x >> y;
cout << x + 2 * y << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,011,359 | 1,011,360 | u365077014 | cpp |
p03219 | #include <iostream>
using namespace std;
void ABC110(void);
void ABC111(void);
void ABC112(void);
void ABC113(void);
void ABC114(void);
void ABC115(void);
void ABC116(void);
void ABC117(void);
void ABC118(void);
void ABC119(void);
int main(void) { ABC113(); }
void ABC113() {
int x, y;
cin >> x >> y;
cout << (x ... | #include <iostream>
using namespace std;
void ABC110(void);
void ABC111(void);
void ABC112(void);
void ABC113(void);
void ABC114(void);
void ABC115(void);
void ABC116(void);
void ABC117(void);
void ABC118(void);
void ABC119(void);
int main(void) { ABC113(); }
void ABC113() {
int x, y;
cin >> x >> y;
cout << x +... | [
"io.output.newline.add"
] | 1,011,370 | 1,011,371 | u225660136 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.