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 9
values |
|---|---|---|---|---|---|---|---|
p02935 | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | [
"variable_declaration.type.primitive.change"
] | 737,197 | 737,196 | u522993719 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | [
"variable_declaration.type.primitive.change"
] | 737,198 | 737,196 | u522993719 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
float res = (float)v[0];
for (int i = 1; i < n; i++)
res = (float)((res + v[i]) / 2);
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
float res = (float)v[0];
for (int i = 1; i < n; i++)
res = (float)((res + v[i]) / 2);
cout << res << endl;
return 0;
} | [] | 737,207 | 737,208 | u508355276 | cpp |
p02935 | #include <algorithm>
#include <cstdio>
int main() {
int n;
scanf("%d", &n);
int v[50];
for (int i = 0; i < n; ++i) {
scanf("%d", v + i);
}
std::sort(v, v + n);
double ans = (*v + *(v + 1)) / 2;
for (int i = 2; i < n; ++i) {
ans = (ans + v[i]) / 2;
}
printf("%f\n", ans);
return 0;
} | #include <algorithm>
#include <cstdio>
int main() {
int n;
scanf("%d", &n);
int v[50];
for (int i = 0; i < n; ++i) {
scanf("%d", v + i);
}
std::sort(v, v + n);
double ans = (*v + *(v + 1)) / (double)2;
for (int i = 2; i < n; ++i) {
ans = (ans + (double)v[i]) / 2;
}
printf("%f\n", ans);
re... | [
"type_conversion.add"
] | 737,209 | 737,210 | u931819817 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int N;
int store[55];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
scanf("%d", &store[i]);
sort(store, store + N);
double ans = store[0];
for (int i = 1; i < N; i++) {
ans = (ans + (double)store[i]) / 2.0;
}
printf("%.1f\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int N;
int store[55];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
scanf("%d", &store[i]);
sort(store, store + N);
double ans = store[0];
for (int i = 1; i < N; i++) {
ans = (ans + (double)store[i]) / 2.0;
}
printf("%f\n", ans);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,213 | 737,214 | u945133959 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long int n;
cin >> n;
priority_queue<float> q;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
q.push(-temp);
}
float temp;
while (--n) {
int a = -q.top();
q.pop();
int b = -q.top();... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long int n;
cin >> n;
priority_queue<float> q;
for (int i = 0; i < n; i++) {
float temp;
cin >> temp;
q.push(-temp);
}
float temp;
while (--n) {
float a = -q.top();
q.pop();
float b = -q.... | [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 737,219 | 737,220 | u133716699 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int b;
int N;
cin >> N;
vector<float> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; ++i) {
b = (A[i] + A[i + 1]) / 2.0;
A[i + 1] = b;
}
cout << b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double b;
int N;
cin >> N;
vector<double> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; ++i) {
b = (A[i] + A[i + 1]) / 2.0;
A[i + 1] = b;
}
cout << b;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 737,221 | 737,222 | u699600793 | cpp |
p02935 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> ... | [
"variable_declaration.type.primitive.change"
] | 737,223 | 737,224 | u539675863 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double tmp = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < N; i++) {
tmp = (tmp + v.at(2)) / 2;
}
cout << tmp << endl... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double tmp = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < N; i++) {
tmp = (tmp + v.at(i)) / 2;
}
cout << tmp << endl... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 737,225 | 737,226 | u379959788 | cpp |
p02935 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,229 | 737,230 | u551247219 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++)
ans = (ans + v[i]) / 2;
cout << "ans" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
return 0;
}
| [] | 737,235 | 737,236 | u526708273 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++)
ans = (ans + v[i]) / 2;
cout << "ans" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++)
ans = (ans + v[i]) / 2.0;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,235 | 737,237 | u526708273 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
vd v(n);
rep(i, n) cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
vd v(n);
rep(i, n) cin >... | [
"call.arguments.add"
] | 737,242 | 737,243 | u688825490 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
int ans = a[0];
for (int i = 1; i < n; i++) {
ans += a[i];
ans = ans / 2;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
double ans = a[0];
for (int i = 1; i < n; i++) {
ans += a[i];
ans = ans / 2... | [
"variable_declaration.type.primitive.change"
] | 737,244 | 737,245 | u018807058 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
float a;
a = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < N; i++) {
a = (a + v.at(i)) / 2;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
float a;
a = (v.at(0) + v.at(1)) / 2;
// cout << a << endl;
for (int i = 2; i < N; i++) {
a = (a + v.at(i)) / 2;
}
... | [
"variable_declaration.type.primitive.change"
] | 737,255 | 737,256 | u806149832 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = ans + v[i] / 2;
}
printf("%.1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
printf("%... | [] | 737,259 | 737,260 | u625522718 | cpp |
p02935 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int N, M, K;
int main() {
cin >> N;
vector<int> R;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
R.push_back(tmp);
}
sort(R.begin(), R.end());
float ans = (R[0] + R[1]) / 2;
if (N >= 3) {
for (int i = 2; i < N; i++) {
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int N, M, K;
int main() {
cin >> N;
vector<int> R;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
R.push_back(tmp);
}
sort(R.begin(), R.end());
double ans = (R[0] + R[1]);
ans /= 2;
if (N >= 3) {
for (int i = 2; i < N... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.change",
"assignment.change"
] | 737,266 | 737,267 | u674052481 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0] + v[1] / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << fixed << setprecision(10) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << fixed << setprecision(10) <<... | [] | 737,270 | 737,271 | u450305541 | cpp |
p02935 | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N, v[50], ans;
cin >> N;
REP(i, N) {... | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N, v[50];
double ans;
cin >> N;
RE... | [
"variable_declaration.type.change"
] | 737,279 | 737,280 | u930957768 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
double sum = 0;
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < n - 1; i++) {
sum = (sum + v.at(i)) / 2;
}
cout << sum;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
double sum = 0;
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 1; i < n - 1; i++) {
sum = (sum + v.at(i + 1)) / 2;
}
cout << su... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 737,306 | 737,307 | u009870106 | cpp |
p02935 | //
// Created by kuroneko on 2019-09-07.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000000000009LL
#define MOD 1000000007LL
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src... | //
// Created by kuroneko on 2019-09-07.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000000000009LL
#define MOD 1000000007LL
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src... | [
"variable_declaration.type.primitive.change"
] | 737,319 | 737,320 | u492352831 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 100005;
int a[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int ave = (a[1] + a[2]) / 2;
for (int i = 3; i <= n; i++) {
ave = (ave + a[i]) / 2;
}
cout << a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 100005;
int a[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
double ave = (a[1] + a[2]) / 2.0;
for (int i = 3; i <= n; i++) {
ave = (ave + a[i]) / 2;
}
cout... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change"
] | 737,321 | 737,322 | u554919484 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
double ans = 0;
sort(v.begin(), v.end());
ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[1]) / 2;
}
cout << an... | // ac
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
double ans = 0;
sort(v.begin(), v.end());
ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,327 | 737,328 | u926025622 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"assignment.change",
"call.arguments.change"
] | 737,329 | 737,330 | u317177661 | cpp |
p02935 | #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.at(i);
}
sort(A.begin(), A.end());
double a = 0;
for (int i = 0; i < N - 1; i++) {
A.at(i + 1) = (A.at(i) + A.at(i + 1)) / 2.0;
}
cout << A.at(N - 1);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
double a = 0;
for (int i = 0; i < N - 1; i++) {
A.at(i + 1) = (A.at(i) + A.at(i + 1)) / 2.0;
}
cout << A.at(N - 1);
... | [
"variable_declaration.type.primitive.change"
] | 737,333 | 737,334 | u301875524 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<double> B(N - 1);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
//いつもの入力パターン
sort(A.begin(), A.end());
B.at(0) = (A.at(0) + A.at(1)) / 2;
for (int i = 1; i < N - 1; i++) {
B.at(i) = (B.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<double> B(N - 1);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
//いつもの入力パターン
sort(A.begin(), A.end());
B.at(0) = (A.at(0) + A.at(1)) / 2.0;
for (int i = 1; i < N - 1; i++) {
B.at(i) = (B.... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,335 | 737,336 | u854161810 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<double> B(N - 1);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
//いつもの入力パターン
sort(A.begin(), A.end());
B.at(0) = (A.at(0) + A.at(1)) / 2;
for (int i = 1; i < N - 1; i++) {
B.at(i) = (B.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<double> B(N - 1);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
//いつもの入力パターン
sort(A.begin(), A.end());
B.at(0) = (A.at(0) + A.at(1)) / 2.0;
for (int i = 1; i < N - 1; i++) {
B.at(i) = (B.... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 737,337 | 737,336 | u854161810 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
double sum = vec.at(0);
for (int i = 0; i < N - 1; i++) {
sum = (sum + vec.at(i)) / 2;
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
double sum = vec.at(0);
for (int i = 0; i < N; i++) {
sum = (sum + vec.at(i)) / 2;
}
cout << sum;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 737,355 | 737,356 | u386712304 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans;
ans = (v[0] + v[1]) / 2;
for (int i = 3; i < n; i++) {
ans = (ans + v[i]) / ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans;
ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,363 | 737,364 | u614669706 | cpp |
p02935 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
... | [
"variable_declaration.type.primitive.change"
] | 737,367 | 737,368 | u680788721 | cpp |
p02935 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
... | [
"variable_declaration.type.primitive.change"
] | 737,369 | 737,368 | u680788721 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *ar = new int[n];
for (int i = 0; i < n; i++)
cin >> ar[i];
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (ar[j] > ar[j + 1]) {
int temp = ar[j];
ar[j] = ar[j + 1];
ar[j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *ar = new int[n];
for (int i = 0; i < n; i++)
cin >> ar[i];
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (ar[j] > ar[j + 1]) {
int temp = ar[j];
ar[j] = ar[j + 1];
ar[j ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 737,382 | 737,383 | u508040971 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,402 | 737,403 | u061912210 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int i, j, n, t;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
j = (a[0] + a[1]) / 2.0;
for (i = 2; i < n; i++) {
j = (j + a[i]) / 2.0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int i, n, t;
double j;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
j = (a[0] + a[1]) / 2.0;
for (i = 2; i < n; i++) {
j = (j + a[i... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 737,408 | 737,409 | u805562306 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
double A = (vec.at(0) + vec.at(1)) / 2;
for (int i = 1; i < N - 1; i++) {
double A = (A + vec.at(i + 1)) / 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
double A = (vec.at(0) + vec.at(1)) / 2;
for (int i = 1; i < N - 1; i++) {
A = (A + vec.at(i + 1)) / 2;
}
cou... | [] | 737,410 | 737,411 | u454600293 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i) {
ans = (ans + v[i]) / 2... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<float> v(n);
rep(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
float ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i) {
ans = (ans + v[i]) / ... | [
"variable_declaration.type.primitive.change"
] | 737,423 | 737,424 | u006721330 | cpp |
p02935 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | [
"variable_declaration.type.change"
] | 737,429 | 737,430 | u622585907 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int ans = v[0];
for (int i = 1; i < N; i++) {
ans += v[i];
ans /= 2;
}
cout << an... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < N; i++) {
ans += v[i];
ans /= 2;
}
cout <<... | [
"variable_declaration.type.primitive.change"
] | 737,433 | 737,434 | u814317577 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int array[N];
for (int i = 0; i < N; i++) {
cin >> array[i];
}
double d = 0.0;
sort(array, array + N);
d = array[0];
for (int i = 1; i < N; i++) {
d = (d + array[i]) / 2;
}
return d;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int array[N];
for (int i = 0; i < N; i++) {
cin >> array[i];
}
double d = 0.0;
sort(array, array + N);
d = array[0];
for (int i = 1; i < N; i++) {
d = (d + array[i]) / 2;
}
cout << d << endl;
} | [
"io.output.change",
"io.output.newline.add"
] | 737,444 | 737,445 | u984200859 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,446 | 737,447 | u191893303 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,448 | 737,447 | u191893303 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | [
"assignment.change"
] | 737,449 | 737,447 | u191893303 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | [
"assignment.change"
] | 737,450 | 737,447 | u191893303 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, v[1000] = {0}, ex;
int i, j;
double max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (v[i] < v[j]) {
ex = v[i];
... | [
"assignment.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 737,451 | 737,447 | u191893303 | cpp |
p02935 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<ll, ll>
const ll N = 1e5 + 4, M = N, inf = (ll)1e9;
const ll mod = 1e9 + 7;
ll fastAbs(ll n) { return (... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<ll, ll>
const ll N = 1e5 + 4, M = N, inf = (ll)1e9;
const ll mod = 1e9 + 7;
ll fastAbs(ll n) { return (... | [
"variable_declaration.type.change"
] | 737,458 | 737,459 | u082568020 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
cout ... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
cou... | [
"literal.number.change",
"expression.operation.binary.change"
] | 737,464 | 737,465 | u495035954 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
cout <... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
cou... | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.change"
] | 737,466 | 737,465 | u495035954 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", std... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define mod 998244353
const int N = 200005;
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
cou... | [
"literal.number.change",
"io.output.change",
"variable_declaration.type.primitive.change",
"expression.operation.binary.change"
] | 737,467 | 737,465 | u495035954 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<int> values;
for (int i = 0; i < N; ++i) {
int V;
std::cin >> V;
values.push_back(V);
}
std::sort(std::begin(values), std::end(values));
int x = values[0];
for (i... | #include <algorithm>
#include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<double> values;
for (int i = 0; i < N; ++i) {
double V;
std::cin >> V;
values.push_back(V);
}
std::sort(std::begin(values), std::end(values));
double x = values[0];... | [
"variable_declaration.type.primitive.change"
] | 737,468 | 737,469 | u922974720 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(0);
int vel;
for (int i = 0; i < N; i++) {
cin >> vel;
v.push_back(vel);
}
sort(v.begin(), v.end());
int ans;
ans = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < N; i++) {
ans = (ans + v.at(i)) / 2;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(0);
int vel;
for (int i = 0; i < N; i++) {
cin >> vel;
v.push_back(vel);
}
sort(v.begin(), v.end());
double ans;
ans = (v.at(0) + v.at(1)) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + v.at(i))... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,480 | 737,481 | u628597699 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int *arr = new int[N];
for (int i = 0; i < N; i++)
cin >> arr[i];
sort(arr, arr + N);
float val = 0;
val = (arr[0] + arr[1]) / 2;
for (int i = 2; i < N; i++) {
val = (val + arr[i]) / ((float)2);
}
cout << val << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int *arr = new int[N];
for (int i = 0; i < N; i++)
cin >> arr[i];
sort(arr, arr + N);
float val = 0;
val = (arr[0] + arr[1]) / ((float)2);
for (int i = 2; i < N; i++) {
val = (val + arr[i]) / ((float)2);
}
cout << v... | [] | 737,488 | 737,489 | u835052656 | cpp |
p02935 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
int ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 737,497 | 737,498 | u547692881 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[51];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
int ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change"
] | 737,499 | 737,498 | u547692881 | cpp |
p02935 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> v;
for (int i = 0; i < N; i++) {
double temp;
cin >> temp;
v.push_back(temp);
}
sort(v.begin(), v.end());
double result = 0;
for (int i = 0; i <... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> v;
for (int i = 0; i < N; i++) {
double temp;
cin >> temp;
v.push_back(temp);
}
sort(v.begin(), v.end());
double result = v[0];
for (int i = 0; ... | [] | 737,506 | 737,507 | u616901930 | cpp |
p02935 | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName;
#define INPUT_STR(valName) ... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName;
#define INPUT_STR(valName) ... | [
"identifier.change",
"call.function.change"
] | 737,508 | 737,509 | u911738004 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
どうすれば最大化できるか？
3個の時は2個になった時の合計値が高いものを作る
n個の時はn-1個になった時の合計値の最大化をすれば良い
a < b < cの時、c+((a+b)/2) > b+((c+a)/2) > a+((b+c)/2)
*/
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
so... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
どうすれば最大化できるか？
3個の時は2個になった時の合計値が高いものを作る
n個の時はn-1個になった時の合計値の最大化をすれば良い
a < b < cの時、c+((a+b)/2) > b+((c+a)/2) > a+((b+c)/2)
*/
int main() {
int N;
cin >> N;
vector<double> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
... | [
"variable_declaration.type.primitive.change"
] | 737,512 | 737,513 | u037098269 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> value(N, 0);
for (int i = 0; i < N; i++) {
cin >> value.at(i);
}
sort(value.begin(), value.end());
double s = (value.at(0) + value.at(1)) / 2;
if (N >= 3) {
for (int i = 2; i < N; i++) {
s = (s + val... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> value(N, 0);
for (int i = 0; i < N; i++) {
cin >> value.at(i);
}
sort(value.begin(), value.end());
double s = (value.at(0) + value.at(1)) / 2;
if (N >= 3) {
for (int i = 2; i < N; i++) {
s = (s + ... | [
"variable_declaration.type.primitive.change"
] | 737,518 | 737,519 | u428138851 | cpp |
p02935 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
sort(a... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
sort(a... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,539 | 737,540 | u930561195 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, n) for (ll i = x; i < n; i++)
#define pb push_back
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first
#define ss second
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, n) for (ll i = x; i < n; i++)
#define pb push_back
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first
#define ss second
#define ... | [
"variable_declaration.type.primitive.change"
] | 737,541 | 737,542 | u544021245 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, n) for (ll i = x; i < n; i++)
#define pb push_back
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first
#define ss second
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, n) for (ll i = x; i < n; i++)
#define pb push_back
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first
#define ss second
#define ... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change"
] | 737,543 | 737,542 | u544021245 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans, k;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> k;
v.push_back(k);
}
sort(v.begin(), v.end());
ans = v[0];
for (int i = 1; i < n; i++) {
ans = ans + v[i];
ans /= 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<double> v;
for (int i = 0; i < n; i++) {
cin >> k;
v.push_back(k);
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = ans + v[i];
ans /= 2;
}
cout << ans << endl;
}
| [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 737,544 | 737,545 | u883921263 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
template <typename T>
using reversed_priority_queue =
std::priority_queue<T, std::vector<T>, s... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
template <typename T>
using reversed_priority_queue =
std::priority_queue<T, std::vector<T>, s... | [
"variable_declaration.type.change"
] | 737,548 | 737,549 | u702996070 | cpp |
p02935 | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | [] | 737,550 | 737,551 | u268618319 | cpp |
p02935 | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | [] | 737,552 | 737,551 | u268618319 | cpp |
p02935 | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | /*
QQgBgIPPPqPKPqPKPKqqqKPKPqPqPqPKPqK1BBBB2JXKPqPKPqPKPPPKPKPPPPPqPPPKPKPKPqPqPqPqPPPKPqPPPqPqPqPqPqPKPqPKPqPKPqPqPKPqPqPPPqPqPKPqPPPPPPPqPqPqPqPqq2
Rr .Bvs1u1uuJjLL77r7r77vvJJuuUuUju7ds
uB57vYujuJususjJujuJ1s1J1Juj1jUuususuJjJujuuUuU12u1u1j1jUuuJuJuJjJujujuJ1uUuUu1u1j1jUu2u2uU12uU1Uu1usvssuYE
7K:: UE ... | [] | 737,553 | 737,551 | u268618319 | cpp |
p02935 | #include <stdio.h>
void swap(double *x, double *y) {
double t = *x;
*x = *y;
*y = t;
}
int minChild(double *ar, int len, int r, int x, int y) {
if (x < len && ar[r] > ar[x])
r = x;
if (y < len && ar[r] > ar[y])
r = y;
return r;
}
void heapify(double *ar, int len, int r) {
int c = minChild(ar, len,... | #include <stdio.h>
void swap(double *x, double *y) {
double t = *x;
*x = *y;
*y = t;
}
int minChild(double *ar, int len, int r, int x, int y) {
if (x < len && ar[r] > ar[x])
r = x;
if (y < len && ar[r] > ar[y])
r = y;
return r;
}
void heapify(double *ar, int len, int r) {
int c = minChild(ar, len,... | [
"call.arguments.change",
"expression.unary.arithmetic.add"
] | 737,564 | 737,565 | u466597986 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
typedef long long tint;
const tint MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
forn(i, n) cin >> a[i];
sort(a.rbe... | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
typedef long long tint;
const tint MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<double> a(n);
forn(i, n) cin >> a[i];
sort(a.... | [
"variable_declaration.type.primitive.change"
] | 737,574 | 737,575 | u061383139 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | [] | 737,576 | 737,577 | u136378781 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> value(n);
for (int i = 0; i < n; i++) {
cin >> value[i];
}
sort(value.begin(), value.end());
double sum = (value[0] + value[1]) / 2;
if (n > 2) {
for (int i = 2; i < n; i++) {
sum = (sum + value[i]) / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> value(n);
for (int i = 0; i < n; i++) {
cin >> value[i];
}
sort(value.begin(), value.end());
double sum = (value[0] + value[1]) / 2;
if (n > 2) {
for (int i = 2; i < n; i++) {
sum = (sum + value[i])... | [
"variable_declaration.type.primitive.change"
] | 737,578 | 737,579 | u862412671 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
// cout<<"Hello World!";
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
double ans = (arr[0] + arr[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + arr[i]) / 2;
}
cout << fixed <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cout<<"Hello World!";
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
double ans = (arr[0] + arr[1]) / 2.0;
for (int i = 2; i < n; i++) {
ans = (ans + arr[i]) / 2.0;
}
cout << fixe... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 737,583 | 737,584 | u345631412 | cpp |
p02935 | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
bool prime[200005];
void sieve() {
memset(prime, true, sizeof(prime)... | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
bool prime[200005];
void sieve() {
memset(prime, true, sizeof(prime)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 737,594 | 737,595 | u290929730 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int v[50];
for (int i = 0; i < N; ++i)
cin >> v[i];
sort(v, v + N);
for (int i = 0; i < N - 1; ++i) {
v[i + 1] = (v[i] + v[i + 1]) / 2;
}
cout << v[N - 1];
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double v[50];
for (int i = 0; i < N; ++i)
cin >> v[i];
sort(v, v + N);
for (int i = 0; i < N - 1; ++i) {
v[i + 1] = (v[i] + v[i + 1]) / 2;
}
cout << v[N - 1];
}
| [
"variable_declaration.type.primitive.change"
] | 737,596 | 737,597 | u275488634 | cpp |
p02935 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, i, a[100009];
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
double ans = (a[0] + a[1]) / 2;
for (i = 2; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, i, a[100009];
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
double ans = (a[0] + a[1]) / 2.0;
for (i = 2; i < n; i++) {
ans = (ans + a[i]) / 2.0;
}
cout << ans << endl;
return 0... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 737,598 | 737,599 | u256976779 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#i... | [
"variable_declaration.type.change"
] | 737,608 | 737,609 | u667375816 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, value;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end(), greater<double>());
for (int i = 0; i < N - 1; i++) {
value += v[i] / pow(2, i + 1);
}
value += v[N - 1] / pow(2, N - 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double value;
cin >> N;
vector<double> v(N);
for (double i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end(), greater<double>());
for (double i = 0; i < N - 1; i++) {
value += v[i] / pow(2, i + 1);
}
value += v[N - 1] / ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 737,612 | 737,613 | u384561774 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<long> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.begin(), vec.end());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<double> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.begin(), vec.end());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 737,625 | 737,626 | u845851868 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.begin(), vec.end());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<double> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.begin(), vec.end());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 737,627 | 737,626 | u845851868 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.rbegin(), vec.rend());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<double> vec(n);
rep(i, n) cin >> vec[i];
sort(vec.begin(), vec.end());
rep(i, n - 1) { vec[0] = (vec[0] + vec[i + 1]) / 2; }
cout << vec[0] << endl;
}
| [
"variable_declaration.type.primitive.change",
"call.function.change",
"call.arguments.change"
] | 737,628 | 737,626 | u845851868 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n);
double ans = (arr[0] + arr[1]) / 2;
for (int i = 3; i < n; i++)
ans = (ans + arr[i]) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n);
double ans = (arr[0] + arr[1]) / 2;
for (int i = 2; i < n; i++)
ans = (ans + arr[i]) / 2;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,644 | 737,645 | u278797554 | cpp |
p02935 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int v[55];
double ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < n; i += 2) {
ans = (ans + v[i]) / 2.0;
}
printf("%.7f",... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int v[55];
double ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2.0;
}
printf("%.7f", an... | [] | 737,650 | 737,651 | u008639671 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#de... | [
"type_conversion.add"
] | 737,666 | 737,667 | u619535866 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
multiset<double> s;
int main() {
int n;
cin >> n;
double x;
for (int i = 0, y; i < n; i++) {
cin >> y;
s.insert(y);
}
while (s.size() > 1) {
set<double>::iterator it = s.begin();
double u = *it;
s.erase(u);
it = s.begin();
double v = ... | #include <bits/stdc++.h>
using namespace std;
multiset<double> s;
int main() {
int n;
cin >> n;
double x;
for (int i = 0, y; i < n; i++) {
cin >> y;
s.insert(y);
}
while (s.size() > 1) {
set<double>::iterator it = s.begin();
double u = *it;
s.erase(it);
it = s.begin();
double v =... | [
"identifier.change",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 737,668 | 737,669 | u207680181 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
double sum = (a[0] + a[1]) / 2;
for (ll i = 2; i < n; i++)
sum = (sum + a[i]) / 2;
printf("%.9lf", sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
double a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
double sum = (a[0] + a[1]) / 2;
for (ll i = 2; i < n; i++)
sum = (sum + a[i]) / 2;
printf("%.9lf", sum);
return 0;
} | [
"variable_declaration.type.change"
] | 737,673 | 737,674 | u712974382 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
if (n == 1) {
cout << v[0];
return 0;
}
sort(v, v + n);
float avg = 0;
avg = (float)(v[0] + v[1]) / 2;
for (int i = 2; i < n; i--) {
avg = (avg + (floa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
if (n == 1) {
cout << v[0];
return 0;
}
sort(v, v + n);
float avg = 0.0;
avg = (float)(v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
avg = (avg + (fl... | [
"literal.number.change",
"variable_declaration.value.change"
] | 737,678 | 737,679 | u162519859 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int n;
cin >> n;
int hairetu[n];
for (int i = 0; i < n; i++) {
cin >> hairetu[i];
}
sort(hairetu, hairetu + SIZE_OF_ARRAY(hairetu));
double te... | #include <algorithm>
#include <iostream>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int n;
cin >> n;
double hairetu[n];
for (int i = 0; i < n; i++) {
cin >> hairetu[i];
}
sort(hairetu, hairetu + SIZE_OF_ARRAY(hairetu));
double... | [
"variable_declaration.type.primitive.change"
] | 737,680 | 737,681 | u259590403 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int n;
cin >> n;
int hairetu[n];
for (int i = 0; i < n; i++) {
cin >> hairetu[i];
}
sort(hairetu, hairetu + SIZE_OF_ARRAY(hairetu));
long doub... | #include <algorithm>
#include <iostream>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int n;
cin >> n;
double hairetu[n];
for (int i = 0; i < n; i++) {
cin >> hairetu[i];
}
sort(hairetu, hairetu + SIZE_OF_ARRAY(hairetu));
double... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 737,682 | 737,681 | u259590403 | cpp |
p02935 | //
// Created by yuu on 2019-08-18.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int V[60];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N; +... | //
// Created by yuu on 2019-08-18.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
double V[60];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,688 | 737,689 | u149583407 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> vec(3);
for (int i = 0; i < n; i++) {
double v;
cin >> v;
vec.at(i) = v;
}
for (int i = 0; i < n - 1; i++) {
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
double num;
//... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> vec(n);
for (int i = 0; i < n; i++) {
double v;
cin >> v;
vec.at(i) = v;
}
for (int i = 0; i < n - 1; i++) {
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
double num;
//... | [
"call.arguments.change"
] | 737,693 | 737,694 | u799939777 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
double ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i];
ans /= 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
double ans = a[0];
for (int i = 1; i < n; i++) {
ans += a[i];
ans /= 2;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,699 | 737,700 | u978809566 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
std::vector<int> a(t);
for (int i = 0; i < t; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = a[0];
for (int i = 1; i < t; ++i) {
ans = (a[i] + ans) / 2;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
std::vector<double> a(t);
for (int i = 0; i < t; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
double ans = a[0];
for (int i = 1; i < t; ++i) {
ans = (a[i] + ans) / 2;
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 737,701 | 737,702 | u614576698 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> vectorV;
for (int i = 0; i < n; i++) {
int v;
scanf("%d", &v);
vectorV.push_back(v);
}
std::sort(vectorV.begin(), vectorV.end());
float sumValu... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> vectorV;
for (int i = 0; i < n; i++) {
int v;
scanf("%d", &v);
vectorV.push_back(v);
}
std::sort(vectorV.begin(), vectorV.end());
float sumValu... | [
"type_conversion.add"
] | 737,713 | 737,714 | u335478716 | cpp |
p02935 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double nw = (double)(a[0] + a[1]) / 2;
for (int i = 2; n > i; i++) {
nw = (dou... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double nw = (double)(a[0] + a[1]) / 2;
for (int i = 2; n > i; i++) {
nw = (dou... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,719 | 737,720 | u466161487 | cpp |
p02935 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
float nw = (float)(a[0] + a[1]) / 2;
for (int i = 2; n > i; i++) {
nw = (float... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double nw = (double)(a[0] + a[1]) / 2;
for (int i = 2; n > i; i++) {
nw = (dou... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,721 | 737,720 | u466161487 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(6);
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
int c = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
c = (c + a[i]) / 2;
}
cout << c << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
double c = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
c = (c + a[i]) / 2;
}
cout << c <... | [
"literal.number.change",
"io.output.change",
"variable_declaration.type.primitive.change"
] | 737,749 | 737,750 | u222866518 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float sum;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
sum = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++)
sum = (sum + a[i]) / 2;
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
double sum;
double a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
sum = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++)
sum = (sum + a[i]) / 2;
cout << sum;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 737,751 | 737,752 | u949698785 | cpp |
p02935 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N, 0);
for (int i = 0; i < V.size(); i++) {
cin >> V[i];
}
// sort
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (V[j] >= V[j + 1]) {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> V(N, 0);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
// sort
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (V[j] >= V[j + 1]) {
int... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 737,753 | 737,754 | u979982996 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end(), greater<float>());
for (int i = N; i >= 2; i--) {
int x;
x = (v.at(i - 2) + v.at(i - 1)) / 2.0;
v.pop_back();
v.pop_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> v(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end(), greater<float>());
for (int i = N; i >= 2; i--) {
float x;
x = (v.at(i - 2) + v.at(i - 1)) / 2.0;
v.pop_back();
v.po... | [
"variable_declaration.type.primitive.change"
] | 737,759 | 737,760 | u932319885 | cpp |
p02935 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int m;
cin >> m;
int i, a[m];
for (i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (i = 1; i < m; i++) {
a[i] = a[i - 1] + a[i];
a[i] /= 2;
}
cout << a[m - 1];
return 0... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int m;
cin >> m;
float a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (int i = 1; i < m; i++) {
a[i] = a[i - 1] + a[i];
a[i] /= 2;
}
cout << a[m - 1];
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 737,761 | 737,762 | u721765521 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int j, m;
cin >> j;
int a[j];
for (int i = 0; i < j; i++)
cin >> a[i];
sort(a, a + j);
for (int i = 0; i < j - 1; i++) {
m = (a[i] + a[i + 1]) / 2;
a[i + 1] = m;
}
co... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int j;
cin >> j;
double a[j], m;
for (int i = 0; i < j; i++)
cin >> a[i];
sort(a, a + j);
for (int i = 0; i < j - 1; i++) {
m = (a[i] + a[i + 1]) / 2;
a[i + 1] = m;
}
... | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change",
"variable_declaration.add"
] | 737,768 | 737,769 | u309758014 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define INF 2100000000
#define int long long
template <typename T> void remove(vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
signed main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int tmp;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define INF 2100000000
#define int long long
template <typename T> void remove(vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
signed main() {
int n;
cin >> n;
vector<float> a;
for (int i = 0; i < n; i++) {
int tmp;
cin... | [
"variable_declaration.type.primitive.change"
] | 737,796 | 737,797 | u005570675 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.