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 |
|---|---|---|---|---|---|---|---|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
double ans = 0;
for (int i = 0; i < N; i++) {
cin >> A;
ans += 1.0 / (double)A;
}
cout << 1.0 / ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
double ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
ans += 1.0 / (double)A;
}
cout << 1.0 / ans << endl;
return 0;
}
|
[] | 736,064
| 736,065
|
u856234158
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority_queue
#define Spri priority_queue<P, vector<P>, greater<P>>
#define all(x) (x).begin(), (x).end()
using namespace std;
int x[100010];
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
signed main() {
int a, ans;
cin >> a;
f(i, a) {
cin >> x[i];
if (i)
ans = lcm(ans, x[i]);
else
ans = x[i];
}
int cnt = 0;
f(i, a) { cnt += ans / x[i]; }
printf("%.100lf/n", (double)ans / cnt);
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority_queue
#define Spri priority_queue<P, vector<P>, greater<P>>
#define all(x) (x).begin(), (x).end()
using namespace std;
int x[100010];
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
signed main() {
int a, ans;
cin >> a;
f(i, a) {
cin >> x[i];
if (i)
ans = lcm(ans, x[i]);
else
ans = x[i];
}
int cnt = 0;
f(i, a) { cnt += ans / x[i]; }
printf("%.100lf\n", (double)ans / cnt);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 736,066
| 736,067
|
u259210975
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int t;
double sum = 0.00;
cin >> t;
while (t--) {
double n;
cin >> n;
sum = sum + (1 / n);
}
printf("%.2f", (1 / sum));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int t;
double sum = 0.00;
cin >> t;
while (t--) {
double n;
cin >> n;
sum = sum + (1 / n);
}
printf("%.5f", (1 / sum));
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,070
| 736,071
|
u120250419
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[100];
double sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (int j = 0; j < N; j++) {
sum = sum + a[N - 1] / a[j];
}
cout << fixed << setprecision(12) << (1 / sum) * a[N - 1];
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double a[100];
double sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (int j = 0; j < N; j++) {
sum = sum + a[N - 1] / a[j];
}
cout << fixed << setprecision(12) << (1 / sum) * a[N - 1];
}
|
[
"variable_declaration.type.primitive.change"
] | 736,081
| 736,082
|
u077051605
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
long double sum = 0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0.0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.value.change"
] | 736,083
| 736,084
|
u077051605
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
long double sum = 0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0.0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.value.change"
] | 736,085
| 736,084
|
u077051605
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0.0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 736,086
| 736,084
|
u077051605
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
double a[100];
for (int j = 0; j < N; j++) {
cin >> a[j];
}
double sum = 0.0;
sort(a, a + N);
for (int i = 0; i < N; i++) {
sum = sum + a[N - 1] / a[i];
}
cout << fixed << setprecision(7) << (1 / sum) * a[N - 1];
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"io.output.change"
] | 736,087
| 736,084
|
u077051605
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<double> A(N);
REP(i, N) cin >> A[i];
double inv1 = 0, inv2 = 0;
REP(i, N) inv1 = inv1 + 1 / A[N];
inv2 = 1 / inv1;
cout << inv2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<double> A(N);
REP(i, N) cin >> A[i];
double inv1 = 0, inv2 = 0;
REP(i, N) inv1 = inv1 + 1 / A[i];
inv2 = 1 / inv1;
cout << inv2 << endl;
return 0;
}
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 736,094
| 736,095
|
u178788290
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
main() {
int n;
double sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += 1.0 / a;
}
double ans = 1 / sum;
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += 1.0 / a;
}
double ans = 1 / sum;
printf("%.10f\n", ans);
return 0;
}
|
[] | 736,104
| 736,105
|
u459233539
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
vector<double> b(n);
double c = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = 1 / a.at(i);
c += b.at(i);
}
/*printf("%.6f", 1 / c);*/
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
vector<double> a(n);
vector<double> b(n);
double c = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = 1 / a.at(i);
c += b.at(i);
}
/*printf("%.6f", 1 / c);*/
cout << 1 / c << endl;
}
|
[
"expression.operation.binary.add"
] | 736,111
| 736,112
|
u503221936
|
cpp
|
p02934
|
// template for atcoder beginners
// when you create a *.cpp file, this template is loaded
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
sum += 1.0 / tmp;
}
cout << 1.0 / sum << endl;
}
|
// template for atcoder beginners
// when you create a *.cpp file, this template is loaded
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp;
double sum = 0.0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
sum += 1.0 / tmp;
}
cout << 1.0 / sum << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 736,123
| 736,124
|
u241190159
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int arr[n];
ll total = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
total += 1 / (double)arr[i];
}
total = 1 / (double)total;
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int arr[n];
double total = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
total += 1 / (double)arr[i];
}
total = 1 / (double)total;
cout << total << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 736,131
| 736,132
|
u453639080
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define maxn 100000 + 100
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.3lf\n", 1.0 / sum);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define maxn 100000 + 100
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.7lf\n", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,136
| 736,137
|
u009597157
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define maxn 100000 + 100
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.3lf\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define maxn 100000 + 100
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.7lf\n", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,138
| 736,137
|
u009597157
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float b = 0.000;
cin >> N;
float arr[N];
for (int j = 0; j < N; j++) {
cin >> arr[j];
b += arr[j];
}
cout << 1 / (1 / b) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float b = 0.000;
cin >> N;
float arr[N];
for (int j = 0; j < N; j++) {
cin >> arr[j];
b += 1 / arr[j];
}
cout << 1 / b << endl;
}
|
[
"assignment.change"
] | 736,139
| 736,140
|
u808056523
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n, a[100];
cin >> n;
float f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
f = f + (1 / a[i]);
}
cout << 1 / f;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a[100];
cin >> n;
double f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
f = f + ((float)1 / a[i]);
}
cout << 1 / f;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,141
| 736,142
|
u407321105
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ans;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += 1 / A[i];
}
int aans;
aans = 1 / ans;
cout << aans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
float ans;
cin >> N;
vector<float> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += 1 / A[i];
}
float aans;
aans = 1 / ans;
cout << aans << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,145
| 736,146
|
u441865202
|
cpp
|
p02934
|
#include <stdio.h>
int main() {
int n;
double a, sum = 0, ans;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
sum += 1.0 / a;
}
ans = 1.0 / sum;
printf("%f", ans);
}
|
#include <stdio.h>
int main() {
int n;
double a, sum = 0, ans;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
sum += 1.0 / a;
}
ans = 1.0 / sum;
printf("%lf ", ans);
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,147
| 736,148
|
u628494808
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a; // <T>でT型のvector
int n;
cin >> n;
while (n--) {
int x;
cin >> x;
a.push_back(x);
}
double recip;
for (int i = 0; i < a.size(); i++) {
recip += 1 / a.at(i);
}
double f_recip;
f_recip = 1 / recip;
cout << f_recip << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<double> a; // <T>でT型のvector
int n = 2;
cin >> n;
while (n--) {
int x;
cin >> x;
a.push_back(x);
}
double recip;
for (int i = 0; i < a.size(); i++) {
recip += 1 / a.at(i);
}
double f_recip;
f_recip = 1 / recip;
cout << f_recip << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 736,151
| 736,152
|
u891807037
|
cpp
|
p02934
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[100];
int max = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (max > a[i]) {
max = a[i];
}
}
float sum = 0.0;
for (int i = 0; i < n; i++) {
sum = sum + (float)max / a[i];
}
cout << max / sum << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[100];
int max = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (max < a[i]) {
max = a[i];
}
}
float sum = 0.0;
for (int i = 0; i < n; i++) {
sum = sum + (float)max / a[i];
}
cout << max / sum << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 736,153
| 736,154
|
u524142273
|
cpp
|
p02934
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define eps DBL_EPSILON
#define mod (ll)1000000007
#define INF LLONG_MAX / 10
#define P pair<int, int>
#define prique priority_queue
using namespace std;
int n, a[110];
signed main() {
cin >> n;
double sum = 0;
rep(i, n) {
cin >> a[i];
sum += 1.0 / a[i];
}
printf("%.12lf/n", 1.0 / sum);
}
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define eps DBL_EPSILON
#define mod (ll)1000000007
#define INF LLONG_MAX / 10
#define P pair<int, int>
#define prique priority_queue
using namespace std;
int n, a[110];
signed main() {
cin >> n;
double sum = 0;
rep(i, n) {
cin >> a[i];
sum += 1.0 / a[i];
}
printf("%.12lf\n", 1.0 / sum);
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 736,168
| 736,169
|
u379822620
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = (int)a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(a) (a).begin(), (a).end()
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
cin >> n;
float sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = (int)a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(a) (a).begin(), (a).end()
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
cin >> n;
float sum = 0;
rep(i, n) {
float a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,173
| 736,174
|
u854612287
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i) = 1 / a.at(i);
sum += a.at(i);
}
int res;
res = 1 / sum;
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float sum = 0;
vector<float> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i) = 1 / a.at(i);
sum += a.at(i);
}
float res;
res = 1 / sum;
cout << res << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,177
| 736,178
|
u653482689
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
using vp = vector<P>;
using vpp = vector<PP>;
using vs = vector<string>;
#define fi first
#define se second
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename A, typename B>
istream &operator>>(istream &is, pair<A, B> &p) {
is >> p.fi >> p.se;
return is;
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
os << "(" << p.fi << "," << p.se << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &t) {
REP(i, t.size()) is >> t[i];
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &t) {
os << "{";
REP(i, t.size()) {
if (i)
os << ",";
os << t[i];
}
cout << "}";
return os;
}
const ll MOD = 1000000007LL;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
int main() {
int n;
cin >> n;
double x = 0;
REP(i, n) {
double a;
cin >> a;
x += 1.0 / a;
}
printf("%.10f\n", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
using vp = vector<P>;
using vpp = vector<PP>;
using vs = vector<string>;
#define fi first
#define se second
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename A, typename B>
istream &operator>>(istream &is, pair<A, B> &p) {
is >> p.fi >> p.se;
return is;
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
os << "(" << p.fi << "," << p.se << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &t) {
REP(i, t.size()) is >> t[i];
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &t) {
os << "{";
REP(i, t.size()) {
if (i)
os << ",";
os << t[i];
}
cout << "}";
return os;
}
const ll MOD = 1000000007LL;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
int main() {
int n;
cin >> n;
double x = 0;
REP(i, n) {
double a;
cin >> a;
x += 1.0 / a;
}
printf("%.10f\n", 1.0 / x);
return 0;
}
|
[
"expression.operation.binary.add"
] | 736,185
| 736,186
|
u437391064
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
b = 0;
cin >> a;
for (int i = 0; i < a; i++) {
int c;
cin >> c;
b += 1 / c;
}
cout << 1 / b;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
double b;
b = 0;
cin >> a;
for (int i = 0; i < a; i++) {
int c;
cin >> c;
b += 1.0 / c;
}
cout << 1 / b;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,187
| 736,188
|
u615530459
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num = 1;
double dec = 0;
cin >> N;
double A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
num = num * A[i];
}
for (int i = 0; i < N; i++) {
dec += (double)(num) / (A[i]);
}
cout << dec / num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num = 1;
double dec = 0;
cin >> N;
double A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
num = num * A[i];
}
for (int i = 0; i < N; i++) {
dec += (double)(num) / (A[i]);
}
cout << num / dec << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 736,189
| 736,190
|
u311517735
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num = 1;
double dec = 0;
cin >> N;
double A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
num = num * A[i];
}
for (int i = 0; i < N; i++) {
dec = (double)(num) / (A[i]);
}
cout << dec / num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num = 1;
double dec = 0;
cin >> N;
double A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
num = num * A[i];
}
for (int i = 0; i < N; i++) {
dec += (double)(num) / (A[i]);
}
cout << num / dec << endl;
return 0;
}
|
[
"assignment.value.change",
"expression.operation.binary.remove"
] | 736,191
| 736,190
|
u311517735
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int N = 0;
// string s;
// cout << "a =";
cin >> N;
// cout << "s =";
double A[N];
double sum = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
sum = 1 / A[i];
}
cout << 1 / sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N = 0;
cin >> N;
double A[N];
double sum = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
sum += 1 / A[i];
}
cout << 1 / sum << endl;
return 0;
}
|
[
"assignment.value.change"
] | 736,200
| 736,201
|
u201320915
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define F first
#define s second
#define int long long
int a[214514];
double b[214514];
signed main() {
ic(n) double sum = 0;
rep(0, i, n) {
cin >> b[i];
sum += 1 / b[i];
}
double ans = 1 / sum;
printf("%.100Lf\n", ans);
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define F first
#define s second
#define int long long
int a[214514];
double b[214514];
signed main() {
ic(n) double sum = 0;
rep(0, i, n) {
cin >> b[i];
sum += 1 / b[i];
}
double ans = 1 / sum;
printf("%.100f\n", ans);
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,218
| 736,219
|
u942393279
|
cpp
|
p02934
|
#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
double sum = 0;
for (ll i = 0; i < n; i++) {
sum += 1 / a[i];
}
cout << 1 / sum << endl;
}
|
#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll n;
cin >> n;
vector<double> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
double sum = 0;
for (ll i = 0; i < n; i++) {
sum += 1 / a[i];
}
cout << 1 / sum << endl;
}
|
[] | 736,228
| 736,229
|
u324139341
|
cpp
|
p02934
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a[100];
double s[100], g = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s[i] = 1 / a[i];
g += s[i];
}
cout << 1 / g << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a[100];
float s[100], g = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s[i] = 1.0 / a[i];
g += s[i];
}
cout << 1 / g << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,230
| 736,231
|
u705030113
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
double S = 0.000000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
S = S + 1 / A;
}
cout << 1.000000000 / S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
double S = 0.000000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
S = S + 1.000000000 / A;
}
cout << 1.000000000 / S << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,232
| 736,233
|
u083447997
|
cpp
|
p02934
|
#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);
}
double answer;
for (int i = 0; i < N; i++) {
answer += 1 / A.at(i);
}
cout << 1 / answer << endl;
}
|
#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);
}
double answer = 0;
for (int i = 0; i < N; i++) {
answer += 1 / A.at(i);
}
cout << 1 / answer << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 736,234
| 736,235
|
u358725896
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
int main(void) {
int n;
double su = 0.000000;
std::cin >> n;
std::vector<int> a(100);
for (int i = 0; i < n; i++) {
std::cin >> a.at(i);
su = su + (1 / a.at(i));
}
double k = 1 / su;
std::cout << k << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
int main(void) {
int n;
double su = 0.000000;
std::cin >> n;
std::vector<int> a(100);
for (int i = 0; i < n; i++) {
std::cin >> a.at(i);
su = su + (1.0 / a.at(i));
}
double k = 1.0 / su;
std::cout << k << std::endl;
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,247
| 736,248
|
u801884816
|
cpp
|
p02934
|
#include <iostream>
#include <stdio.h>
int main(int argc, char const *argv[]) {
int A[100];
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
double sum = 0.0;
for (size_t i = 0; i < n; i++) {
sum += 1.0 / A[i];
}
printf("%d", 1.0 / sum);
return 0;
}
|
#include <iostream>
#include <stdio.h>
int main(int argc, char const *argv[]) {
int A[100];
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
double sum = 0.0;
for (size_t i = 0; i < n; i++) {
sum += 1.0 / A[i];
}
printf("%lf", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,262
| 736,263
|
u414469094
|
cpp
|
p02934
|
/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x, y) \
cout << "#x = " << (x) << " and " \
<< "#y = " << (y) << endl;
#define deb(x) cout << "#x = " << (x) << endl;
#define COUT(n, a) cout << fixed << setprecision(a) << n << endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define vecc(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) \
__begin = clock(); \
ccc; \
cerr << "Time of work = " << (clock() - __begin) / CLOCKS_PER_SEC << endl;
#define MAXN 2000
// cin.ignore (7777, '\n');
using namespace std;
using namespace __gnu_pbds;
#define debug(args...) (Debugger()), args
class Debugger {
public:
Debugger(const std::string &_separator = ", ")
: first(true), separator(_separator) {}
template <typename ObjectType> Debugger &operator,(const ObjectType &v) {
if (!first)
cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() { cerr << endl; }
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
bool first = true;
os << "[";
for (unsigned ll i = 0; i < v.size(); i++) {
if (!first)
os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) {
bool first = true;
os << "[";
for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &os, const map<T1, T2> &v) {
bool first = true;
os << "[";
for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
double massiv[200];
ll n;
int main() {
FAST_READ;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> massiv[i];
double niz = 0.0;
for (ll i = 1; i <= n; i++) {
niz += (1.0 / massiv[i]);
}
COUT(1.0 / niz, 2);
return 0;
}
|
/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x, y) \
cout << "#x = " << (x) << " and " \
<< "#y = " << (y) << endl;
#define deb(x) cout << "#x = " << (x) << endl;
#define COUT(n, a) cout << fixed << setprecision(a) << n << endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define vecc(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) \
__begin = clock(); \
ccc; \
cerr << "Time of work = " << (clock() - __begin) / CLOCKS_PER_SEC << endl;
#define MAXN 2000
// cin.ignore (7777, '\n');
using namespace std;
using namespace __gnu_pbds;
#define debug(args...) (Debugger()), args
class Debugger {
public:
Debugger(const std::string &_separator = ", ")
: first(true), separator(_separator) {}
template <typename ObjectType> Debugger &operator,(const ObjectType &v) {
if (!first)
cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() { cerr << endl; }
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
bool first = true;
os << "[";
for (unsigned ll i = 0; i < v.size(); i++) {
if (!first)
os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) {
bool first = true;
os << "[";
for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &os, const map<T1, T2> &v) {
bool first = true;
os << "[";
for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
double massiv[200];
ll n;
int main() {
FAST_READ;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> massiv[i];
double niz = 0.0;
for (ll i = 1; i <= n; i++) {
niz += (1.0 / massiv[i]);
}
cout << 1.0 / niz << endl;
return 0;
}
|
[
"call.arguments.change"
] | 736,271
| 736,272
|
u805343140
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
double num = 0;
for (int i = 0; i < a; i++) {
int n;
cin >> n;
num += 1 / n;
}
cout << 1 / num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
double num = 0;
for (int i = 0; i < a; i++) {
int n;
cin >> n;
num += 1.000000000000000 / n;
}
cout << 1 / num << endl;
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,275
| 736,276
|
u438621426
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
int main() {
int n;
double ans = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
ans += 1 / a;
}
cout << 1 / ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
int main() {
int n;
double ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
ans += 1 / a;
// cout << ans << endl;
}
cout << 1 / ans << endl;
return 0;
}
|
[] | 736,288
| 736,289
|
u160036974
|
cpp
|
p02934
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / s[i];
sum += M[i];
}
printf("%llf", (double)1 / sum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / s[i];
sum += M[i];
}
printf("%lf", (double)1 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,298
| 736,299
|
u956941456
|
cpp
|
p02934
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / s[i];
sum += M[i];
}
printf("%lld", (double)1 / sum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / s[i];
sum += M[i];
}
printf("%lf", (double)1 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,300
| 736,299
|
u956941456
|
cpp
|
p02934
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / M[i];
sum += M[i];
}
printf("%lld", (double)1 / sum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int N, s[100010];
double M[100010];
double sum = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &s[i]);
M[i] = (double)1 / s[i];
sum += M[i];
}
printf("%lf", (double)1 / sum);
return 0;
}
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,301
| 736,299
|
u956941456
|
cpp
|
p02934
|
#include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long
#define go(i, a, n) for (int i = a; i < n; i++)
const ll MOD = (ll)1e9 + 7;
using namespace std;
const int mod = 998244353;
signed main() {
vaibhavv06;
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
double x = 0;
for (int i = 0; i < n; i++)
x += 1 / arr[i];
cout << 1 / x << endl;
return 0;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += (x / arr[i]);
}
cout << fixed << setprecision(16);
double ans = (1.0 * x) / (sum);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long
#define go(i, a, n) for (int i = a; i < n; i++)
const ll MOD = (ll)1e9 + 7;
using namespace std;
const int mod = 998244353;
signed main() {
vaibhavv06;
int n;
cin >> n;
double arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
double x = 0;
for (int i = 0; i < n; i++)
x += 1 / arr[i];
cout << 1 / x << endl;
return 0;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += (x / arr[i]);
}
cout << fixed << setprecision(16);
double ans = (1.0 * x) / (sum);
cout << ans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,304
| 736,305
|
u699580536
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[n];
}
float ans = 0;
for (int i = 0; i < n; i++) {
ans += (1 / arr[n]);
}
ans = 1 / ans;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
double ans = 0;
for (int i = 0; i < n; i++) {
ans += (1.0 / arr[i]);
}
ans = 1 / ans;
cout << ans;
return 0;
}
|
[
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 736,316
| 736,317
|
u475787977
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long int
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int>
#define P push_back
#define F first
#define S second
#define debug(x) cout << x << " "
#define pi vector<pair<int, int>>
#define FOR(i, x, n) for (int i = x; i < n; i++)
#define all(a) a.begin(), a.end()
ll mod = 1e9 + 7;
#define N 99999999
//#define int ll
using namespace std;
#define int ll
signed main() {
boost;
int n;
cin >> n;
vi a(n);
int sum = 1, sum2 = 0;
for (int i = 0; i < n; i++)
cin >> a[i], a[i] = 1 / a[i];
for (int i = 0; i < n; i++)
sum2 += a[i];
double ans = (long double)1 / sum2;
printf("%.10F", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long int
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int>
#define P push_back
#define F first
#define S second
#define debug(x) cout << x << " "
#define pi vector<pair<int, int>>
#define FOR(i, x, n) for (int i = x; i < n; i++)
#define all(a) a.begin(), a.end()
ll mod = 1e9 + 7;
#define N 99999999
//#define int ll
using namespace std;
#define int double
signed main() {
boost;
int n;
cin >> n;
vector<double> a(n);
int sum = 1, sum2 = 0;
for (int i = 0; i < n; i++)
cin >> a[i], a[i] = 1 / a[i];
for (int i = 0; i < n; i++)
sum2 += a[i];
double ans = (long double)1 / sum2;
printf("%.10F", ans);
return 0;
}
|
[
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 736,318
| 736,319
|
u989179648
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1145141919364364
#define all(vec) vec.begin(), vec.end()
#define P pair<int, int>
#define S second
#define F first
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mood) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mood;
x = x * x % mood;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
long double n, a[100];
long double cnt;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt += 1 / a[i];
}
printf("%.10f", 1 / cnt);
}
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1145141919364364
#define all(vec) vec.begin(), vec.end()
#define P pair<int, int>
#define S second
#define F first
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mood) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mood;
x = x * x % mood;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
double n, a[100];
double cnt;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt += 1 / a[i];
}
printf("%.10f", 1 / cnt);
}
|
[
"variable_declaration.type.narrow.change"
] | 736,324
| 736,325
|
u277153875
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n;
cin >> n;
int p;
double q, s = 0;
for (int a = 0; a < n; a++) {
cin >> p;
q = 1.0 / p;
s += q;
}
q = 1.0 / q;
cout << q;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n;
cin >> n;
int p;
double q, s = 0;
for (int a = 0; a < n; a++) {
cin >> p;
q = 1.0 / p;
s += q;
}
s = 1.0 / s;
cout << s;
return 0;
}
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 736,326
| 736,327
|
u468506413
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n;
int x = 1;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
x *= a.at(i);
}
vector<double> b(n);
s = 0;
for (int i = 0; i < n; i++) {
b.at(i) = x / a.at(i);
s += b.at(i);
}
cout << x / s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double x = 1;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
x *= a.at(i);
}
vector<double> b(n);
double s = 0;
for (int i = 0; i < n; i++) {
b.at(i) = x / a.at(i);
s += b.at(i);
}
cout << x / s << endl;
}
|
[
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 736,332
| 736,331
|
u646051775
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
double ans = 0.0;
for (int j = 0; j < N; j++) {
ans += 1 / A.at(j);
}
cout << 1 / ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
double ans = 0.0;
for (int j = 0; j < N; j++) {
ans += 1.0 / A.at(j);
}
cout << 1 / ans << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,333
| 736,334
|
u506858457
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, a;
float m, u;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
u = (float)1 / a;
// cout << u << endl;
m = float(m + u);
}
cout << setprecision(1) << fixed << 1 / m << endl;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, a;
double m, u;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
u = (double)1 / a;
// cout << u << endl;
m = double(m + u);
}
cout << setprecision(9) << fixed << 1 / m << endl;
}
|
[
"variable_declaration.type.primitive.change",
"assignment.value.change",
"call.function.change",
"literal.number.change",
"io.output.change"
] | 736,337
| 736,338
|
u526007715
|
cpp
|
p02934
|
#include <immintrin.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
float B = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
B += 1 / a[i];
}
float ans = 1 / B;
cout << ans << endl;
return 0;
}
|
#include <immintrin.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> a(N);
float B = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
B += 1 / a[i];
}
float ans = 1 / B;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,339
| 736,340
|
u684863590
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += (1.0 / a[i]);
}
cout << fixed << setprecision(10) << (1.0 / sum) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
int main() {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += (1.0 / a[i]);
}
cout << fixed << setprecision(10) << (1.0 / sum) << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,348
| 736,349
|
u402651318
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int total = 0;
for (int i = 0; i < n; i++) {
vec[i] = 1 / vec[i];
total += vec[i];
}
cout << 1 / total << endl;
}
|
#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[i];
double total = 0;
for (int i = 0; i < n; i++) {
vec[i] = 1 / vec[i];
total += vec[i];
}
cout << 1 / total << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,355
| 736,356
|
u799521877
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll tmp = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sum += 1 / tmp;
}
cout << 1 / sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
double tmp = 0;
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sum += 1 / tmp;
}
cout << 1 / sum;
return 0;
}
|
[
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 736,361
| 736,362
|
u515047101
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
int ans = 1 / sum;
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];
a[i] = 1 / a[i];
}
double sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
double ans = 1 / sum;
cout << ans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,373
| 736,374
|
u978809566
|
cpp
|
p02934
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int n;
double sum = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
[] | 736,377
| 736,378
|
u161609067
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
float ac = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ac += 1 / a[i];
}
float b = 1 / ac;
cout << b;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
float ac = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ac += 1 / a[i];
}
float b = 1 / ac;
cout << b;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,384
| 736,385
|
u674491576
|
cpp
|
p02934
|
#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);
}
float S = 0;
for (int i = 0; i < N; i++) {
S += 1 / (A.at(i));
}
cout << 1 / S << endl;
}
|
#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);
}
double S = 0;
for (int i = 0; i < N; i++) {
S += 1 / A.at(i);
}
cout << 1 / S << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,386
| 736,387
|
u411557858
|
cpp
|
p02934
|
#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);
}
double S = 0;
for (int i = 0; i < N; i++) {
S += 1 / (A.at(i));
}
cout << 1 / S << endl;
}
|
#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);
}
double S = 0;
for (int i = 0; i < N; i++) {
S += 1 / A.at(i);
}
cout << 1 / S << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,388
| 736,387
|
u411557858
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
float sum = 0.0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += 1 / a[i];
}
sum = 1 / sum;
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
float sum = 0.0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += (double)1 / (double)a[i];
}
sum = 1 / sum;
cout << sum;
return 0;
}
|
[
"type_conversion.add"
] | 736,400
| 736,401
|
u162519859
|
cpp
|
p02934
|
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int m;
cin >> m;
float a;
int s = 0;
int i;
for (i = 0; i < m; i++) {
cin >> a;
a = 1 / a;
s += a;
}
cout << s;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int m;
cin >> m;
float a;
float s = 0;
int i;
for (i = 0; i < m; i++) {
cin >> a;
a = 1 / a;
s += a;
}
cout << 1 / s;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,422
| 736,423
|
u721765521
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
double x;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
x += 1.0 / t;
}
printf("%llf", 1.0 / x);
return 0;
}
|
#include <iostream>
using namespace std;
double x;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
x += 1.0 / t;
}
printf("%lf", 1.0 / x);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,430
| 736,431
|
u382002817
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
double x;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
x += 1.0 / t;
}
printf("%.15llf", 1.0 / x);
return 0;
}
|
#include <iostream>
using namespace std;
double x;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
x += 1.0 / t;
}
printf("%lf", 1.0 / x);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,432
| 736,431
|
u382002817
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i;
int A[120];
double sum = 0.0;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
sum += 1.0 / (double)A[i];
}
cout << (1.0 / sum) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i;
int A[120];
double sum = 0.0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
sum += 1.0 / (double)A[i];
}
cout << (1.0 / sum) << endl;
return 0;
}
|
[] | 736,435
| 736,436
|
u099619676
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
int main() {
int n;
cin >> n;
vector<float> a(n);
int i;
for (i = 0; i < n; i++)
cin >> a[i];
float b = 1.0;
float ans = 0;
for (i = 0; i < n; i++) {
ans += b / a[i];
}
// cout<<"ok"<<endl;
// cout<<ans<<endl;
ans = b / ans;
cout << setprecision(5) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
int main() {
int n;
cin >> n;
vector<double> a(n);
int i;
for (i = 0; i < n; i++)
cin >> a[i];
double b = 1.0;
double ans = 0;
for (i = 0; i < n; i++) {
ans += b / a[i];
}
// cout<<"ok"<<endl;
// cout<<ans<<endl;
ans = b / ans;
cout << setprecision(10) << ans << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 736,439
| 736,440
|
u634999820
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int n, a[1050];
double r;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= a[i]; i++) {
r += 1.0 / a[i];
}
cout << 1 / r;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[1050];
double r;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
r += 1.0 / a[i];
}
cout << 1 / r;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 736,446
| 736,447
|
u316473009
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int sum = 0;
rep(i, n) { sum = sum + (1 / a[i]); }
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n;
cin >> n;
vector<double> a(n + 2);
rep(i, n) cin >> a[i];
double sum = 0;
rep(i, n) { sum = sum + (1 / a[i]); }
cout << 1 / sum << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,450
| 736,451
|
u703214333
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
sum += 1.0 / a;
}
printf("%.1lf\n", 1.0 / sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
sum += 1.0 / a;
}
printf("%lf\n", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,452
| 736,453
|
u654104650
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define ll long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
cout << fixed;
cout << setprecision(8);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
ll arr[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ans += (ll)1 / arr[i];
}
cout << (ll)1 / ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
cout << fixed;
cout << setprecision(8);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
ll arr[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ans += (ll)1 / arr[i];
}
cout << (ll)1 / ans;
}
|
[] | 736,458
| 736,459
|
u506112954
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, start, end) for (ll i = start; i < end; i++)
#define dwn(i, n) for (int i = n; i >= 0; i--)
#define dwn2(i, start, end) for (ll i = start; i >= end; i--)
#define pll pair<ll, ll>
#define mk(x, y) make_pair(x, y)
#define pdl pair<double, ll>
const ll N = 4e5 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
int main() {
int n, m;
cin >> n;
vector<double> v(n);
double sum = 0;
rep(i, n) {
double x;
cin >> x;
v[i] = 1.0 / x;
}
rep(i, n) { sum += v[i]; }
printf("%llf\n", 1.0 / sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, start, end) for (ll i = start; i < end; i++)
#define dwn(i, n) for (int i = n; i >= 0; i--)
#define dwn2(i, start, end) for (ll i = start; i >= end; i--)
#define pll pair<ll, ll>
#define mk(x, y) make_pair(x, y)
#define pdl pair<double, ll>
const ll N = 4e5 + 200;
const ll INF = 0x3f3f3f;
const ll Mode = 1e9 + 7;
int main() {
int n, m;
cin >> n;
vector<double> v(n);
double sum = 0;
rep(i, n) {
double x;
cin >> x;
v[i] = 1.0 / x;
}
rep(i, n) { sum += v[i]; }
printf("%.6lf\n", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,460
| 736,461
|
u624688258
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
double ans = 0;
double b = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b += 1.0 / a[i];
}
ans = 1 / b;
cout << setprecision(5) << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
double ans = 0;
double b = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b += 1.0 / a[i];
}
ans = 1 / b;
cout << setprecision(10) << ans << endl;
return 0;
}
|
[
"literal.number.change",
"io.output.change"
] | 736,464
| 736,465
|
u846226907
|
cpp
|
p02934
|
#include <algorithm> // sort
#include <bits/stdc++.h>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int x;
double s = 0;
for (int i = 0; i < n; i++) {
cin >> x;
s += 1 / x;
}
cout << s << endl;
}
|
#include <algorithm> // sort
#include <bits/stdc++.h>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double x;
double s = 0;
for (int i = 0; i < n; i++) {
cin >> x;
s += 1 / x;
}
cout << 1 / s << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,470
| 736,471
|
u704064492
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
ans += 1.0 / a;
}
cout << 1.0 / ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
ans += 1.0 / a;
}
cout << 1.0 / ans;
}
|
[] | 736,476
| 736,477
|
u885523920
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> vi(n);
for (int &c : vi) {
cin >> c;
}
sort(vi.begin(), vi.end());
vector<double> sum(n - 1, 0);
for (int i = 0; i < n - 1; i++) {
if (i == 0) {
sum.at(0) = (vi.at(0) + vi.at(1)) / 2;
} else {
sum.at(i) = (sum.at(i - 1) + vi.at(i + 1)) / 2;
}
}
cout << sum.at(n - 2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<double> vi(n);
for (double &c : vi) {
cin >> c;
}
sort(vi.begin(), vi.end());
vector<double> sum(n - 1, 0);
for (int i = 0; i < n - 1; i++) {
if (i == 0) {
sum.at(0) = (vi.at(0) + vi.at(1)) / 2;
} else {
sum.at(i) = (sum.at(i - 1) + vi.at(i + 1)) / 2;
}
}
cout << sum.at(n - 2) << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,484
| 736,485
|
u993104815
|
cpp
|
p02935
|
#include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T> void print_vect(std::vector<T> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
vi v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 1; i < n; i++) {
v[i] = (v[i] + v[i - 1]) / 2;
}
cout << v.back() << endl;
}
int main() {
// making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while (TEST_CASES--) {
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
// Thanks to CSES problemset
// I am trained with this kind of problem
|
#include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T> void print_vect(std::vector<T> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<float> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 1; i < n; i++) {
v[i] = (v[i] + v[i - 1]) / 2;
}
cout << v.back() << endl;
}
int main() {
// making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while (TEST_CASES--) {
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
// Thanks to CSES problemset
// I am trained with this kind of problem
|
[
"variable_declaration.type.change"
] | 736,494
| 736,495
|
u161190523
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
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 sum = 0;
sum += (v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
sum = (sum + v[i]) / 2;
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
double N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double sum = 0;
sum = (v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
sum = (sum + v[i]) / 2;
}
cout << sum << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 736,511
| 736,512
|
u209457657
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<int>>;
using dou = long double;
string Yes = "Yes";
string YES = "YES";
string NO = "NO";
string No = "No";
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;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define res resize
#define as assign
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0)
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 922337203685477580ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
const double pi = 3.1415926535897932384626;
int main() {
int n;
std::cin >> n;
VEC(double, a, n);
sort(all(a));
itn ans = (a[0] + a[1]) / 2;
rrep(i, 1, n - 1) { ans = (ans + a[i + 1]) / 2; }
std::cout << keta(10) << ans << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<int>>;
using dou = long double;
string Yes = "Yes";
string YES = "YES";
string NO = "NO";
string No = "No";
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;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define res resize
#define as assign
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0)
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 922337203685477580ll;
const int mod = 1000000007ll;
const ll MOD = 1000000007LL;
const double pi = 3.1415926535897932384626;
int main() {
int n;
std::cin >> n;
VEC(double, a, n);
sort(all(a));
double ans = (a[0] + a[1]) / 2;
rrep(i, 1, n - 1) { ans = (ans + a[i + 1]) / 2; }
std::cout << keta(10) << ans << std::endl;
}
|
[
"variable_declaration.type.change"
] | 736,515
| 736,516
|
u539011156
|
cpp
|
p02935
|
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
double div = 0;
div = (a.at(0) + a.at(1)) / 2;
a.erase(a.begin() + 1);
a.erase(a.begin());
a.push_back(div);
sort(a.begin(), a.end());
}
cout << a.at(0);
}
|
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
double div = 0;
div = (a.at(0) + a.at(1)) / 2;
a.erase(a.begin() + 1);
a.erase(a.begin());
a.push_back(div);
sort(a.begin(), a.end());
}
cout << a.at(0);
}
|
[
"variable_declaration.type.primitive.change"
] | 736,521
| 736,522
|
u921532128
|
cpp
|
p02935
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vi v(N);
REP(i, N) cin >> v[i];
sort(ALL(v));
ll ans = v[0] + v[1];
ll c = 2;
REP(i, N - 2) {
ans += 2 * v[i + 2];
c *= 2;
}
print((long double)ans / c);
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
vi v(N);
REP(i, N) cin >> v[i];
sort(ALL(v));
ll ans = v[0] + v[1];
ll c = 2;
REP(i, N - 2) {
ans += c * v[i + 2];
c *= 2;
}
print((long double)ans / c);
}
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 736,529
| 736,530
|
u089177147
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase = 1;
// cin>>testcase;
for (int p = 0; p < testcase; p++) {
ll n = 0;
cin >> n;
int array[n] = {0};
for (int i = 0; i < n; i++) {
cin >> array[i];
}
sort(array, array + n);
float sum = (array[0] + array[1]) / 2;
for (int i = 2; i < n; i++) {
sum += array[i];
sum = sum / 2;
}
cout << sum;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase = 1;
// cin>>testcase;
for (int p = 0; p < testcase; p++) {
ll n = 0;
cin >> n;
float array[n] = {0};
for (int i = 0; i < n; i++) {
cin >> array[i];
}
sort(array, array + n);
float sum = (array[0] + array[1]) / 2;
for (int i = 2; i < n; i++) {
sum += array[i];
sum = sum / 2;
}
cout << sum;
}
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,553
| 736,554
|
u208922403
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
int count = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < n - 1; i++) {
A[i + 1] = (A[i] + A[i + 1]) / 2;
}
cout << A[A.size() - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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++) {
A[i + 1] = (A[i] + A[i + 1]) / 2;
}
cout << A[A.size() - 1] << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 736,555
| 736,556
|
u431458875
|
cpp
|
p02935
|
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define uset unordered_set
#define umap unordered_map
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vi, greater<int>()>
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define rev(v) reverse(v.begin(), v.end())
#define sz(x) (int)x.size()
#define def(v) memset(v, -1, sizeof(v));
#define def0(v) memset(v, 0, sizeof(v));
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))
#define sumv(a) accumulate(all(a), 0)
#define lb lower_bound
#define ub upper_bound
#define desc greater<int>()
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a / (__gcd(a, b))) * b
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define ip(v) \
for (auto &i : v) \
cin >> i;
#define op(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define deb(x) cout << "Value of " #x << " : " << x << endl;
void solve() {
int n;
cin >> n;
int a[n];
ip(a);
sort(a, a + n);
float ans = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << ans << endl;
}
int32_t main() {
fastio cout << setprecision(15) << fixed;
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case "<<i<<" : "<<endl;
solve();
}
#ifndef ONLINE_JUDGE
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define uset unordered_set
#define umap unordered_map
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vi, greater<int>()>
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define rev(v) reverse(v.begin(), v.end())
#define sz(x) (int)x.size()
#define def(v) memset(v, -1, sizeof(v));
#define def0(v) memset(v, 0, sizeof(v));
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))
#define sumv(a) accumulate(all(a), 0)
#define lb lower_bound
#define ub upper_bound
#define desc greater<int>()
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a / (__gcd(a, b))) * b
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define ip(v) \
for (auto &i : v) \
cin >> i;
#define op(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define deb(x) cout << "Value of " #x << " : " << x << endl;
void solve() {
int n;
cin >> n;
int a[n];
ip(a);
sort(a, a + n);
float ans = (a[0] + a[1]) / (2 * 1.0);
for (int i = 2; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << ans << endl;
}
int32_t main() {
fastio cout << setprecision(15) << fixed;
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case "<<i<<" : "<<endl;
solve();
}
#ifndef ONLINE_JUDGE
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
#endif
return 0;
}
|
[] | 736,559
| 736,560
|
u982602691
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[55];
double m;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
m = (a[1] + a[0]) / 2.0;
if (n == 2)
printf("%.7lf", m);
else {
for (int i = 2; i < n; i++)
m = m / 2 + a[i] / 2;
printf("%.7lf", m);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[55];
double m;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
m = (a[1] + a[0]) / 2.0;
if (n == 2)
printf("%.7lf", m);
else {
for (int i = 2; i < n; i++)
m = m / 2.0 + a[i] / 2.0;
printf("%.7lf", m);
}
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,571
| 736,572
|
u709642503
|
cpp
|
p02935
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<double, vector<double>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n;
cin >> n;
minq pq;
rep(i, n) {
int v;
cin >> v;
pq.push(v);
}
double ans = 0;
while (pq.size() > 1) {
int a = pq.top();
pq.pop();
int b = pq.top();
pq.pop();
pq.push((a + b) / (long double)2.0);
}
ans = pq.top();
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<double, vector<double>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n;
cin >> n;
minq pq;
rep(i, n) {
int v;
cin >> v;
pq.push(v);
}
double ans = 0;
while (pq.size() > 1) {
double a = pq.top();
pq.pop();
double b = pq.top();
pq.pop();
pq.push((a + b) / (double)2);
}
ans = pq.top();
printf("%.10f\n", ans);
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 736,573
| 736,574
|
u213868052
|
cpp
|
p02935
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<double, vector<double>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n;
cin >> n;
minq pq;
rep(i, n) {
int v;
cin >> v;
pq.push(v);
}
double ans = 0;
while (pq.size() > 1) {
int a = pq.top();
pq.pop();
int b = pq.top();
pq.pop();
pq.push((a + b) / (double)2.0);
}
ans = pq.top();
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<double, vector<double>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n;
cin >> n;
minq pq;
rep(i, n) {
int v;
cin >> v;
pq.push(v);
}
double ans = 0;
while (pq.size() > 1) {
double a = pq.top();
pq.pop();
double b = pq.top();
pq.pop();
pq.push((a + b) / (double)2);
}
ans = pq.top();
printf("%.10f\n", ans);
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 736,575
| 736,574
|
u213868052
|
cpp
|
p02935
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
double sin = (h[0] + h[1]) / 2;
double g;
for (int i = 2; i < n; i++) {
sin = (sin + h[i]) / 2;
}
cout << sin;
return 0;
}
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
double h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
double sin = (h[0] + h[1]) / 2;
double g;
for (int i = 2; i < n; i++) {
sin = (sin + h[i]) / 2;
}
cout << sin;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,582
| 736,583
|
u047572420
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <vector>
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 tmp = (a.at(0) + a.at(1)) / 2;
for (int i = 2; i < n; i++)
tmp = (tmp + a.at(i)) / 2;
cout << tmp;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
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 tmp = (a.at(0) + a.at(1)) / 2;
for (int i = 2; i < n; i++)
tmp = (tmp + a.at(i)) / 2;
cout << tmp;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,590
| 736,591
|
u236540805
|
cpp
|
p02935
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll INF = 1 << 29;
int main() {
int n;
cin >> n;
double v[n];
rep(i, n) { cin >> v[i]; }
sort(v, v + n);
double ave = 0.0;
ave = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ave = (v[i] + ave) / 2;
}
cout << setprecision(3) << ave << endl;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll INF = 1 << 29;
int main() {
int n;
cin >> n;
double v[n];
rep(i, n) { cin >> v[i]; }
sort(v, v + n);
double ave = 0.0;
ave = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ave = (v[i] + ave) / 2;
}
cout << ave << endl;
}
|
[
"expression.operation.binary.remove"
] | 736,592
| 736,593
|
u090005176
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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] + A[1]) / 2;
for (int i = 2; i < N; i++) {
ans += (ans + A[i]) / 2;
}
cout << fixed << setprecision(10) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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] + A[1]) / 2;
for (int i = 2; i < N; i++) {
ans = (ans + A[i]) / 2;
}
cout << fixed << setprecision(10) << ans << endl;
}
|
[
"assignment.value.change"
] | 736,594
| 736,595
|
u538808095
|
cpp
|
p02935
|
#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n - 1) { a[i + 1] = (a[i] + a[i + 1]) / 2; }
cout << a[n - 1];
}
|
#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
double n, sum = 0;
cin >> n;
vector<double> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n - 1) { a[i + 1] = (a[i] + a[i + 1]) / 2; }
cout << a[n - 1];
}
|
[
"variable_declaration.type.primitive.change"
] | 736,596
| 736,597
|
u928591554
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int v[n];
rep(i, n) cin >> v[i];
sort(v, v + n);
ld ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (long double)((ans + v[i]) / 2);
}
cout << fixed;
cout << setprecision(20);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int v[n];
rep(i, n) cin >> v[i];
sort(v, v + n);
ld ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < n; i++) {
ans = (long double)((ans + v[i]) / 2.0);
}
cout << fixed;
cout << setprecision(20);
cout << ans << endl;
}
|
[
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 736,612
| 736,613
|
u318661636
|
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];
}
if (n == 2) {
cout << (v[0] + v[1]) / 2.0 << endl;
return 0;
}
sort(v.begin(), v.end());
int ans = (v[0] + v[1]) / 2.0;
for (int i = 0; i < n - 2; i++) {
ans = (ans + v[i + 2]) / 2.0;
}
cout << ans << endl;
}
|
#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];
}
if (n == 2) {
cout << (v[0] + v[1]) / 2.0 << endl;
return 0;
}
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2.0;
for (int i = 0; i < n - 2; i++) {
ans = (ans + v[i + 2]) / 2.0;
}
cout << ans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,616
| 736,617
|
u909728445
|
cpp
|
p02935
|
// include
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vi = vector<int>;
using vs = vector<string>;
using vc = vector<char>;
using ll = long long;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
// define
//#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) cout << n << endl;
#define sortp(d) sort(d.begin(), d.end()) // 1234
#define sortm(d) (d.rbegin(), d.rend()) // 4321
//グローバル変数宣言
ll a = 0, b = 0, c = 0, e = 0, n = 0, k = 0;
int main() {
cin >> n;
vd v(n);
rep(i, n) cin >> v[i];
sortm(v);
rep(i, n - 1) { v[n - i - 2] = (v[n - i - 1] + v[n - i - 2]) / 2; }
print(v[0]);
}
|
// include
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vi = vector<int>;
using vs = vector<string>;
using vc = vector<char>;
using ll = long long;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
// define
//#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) cout << n << endl;
#define sortp(d) sort(d.begin(), d.end()) // 1234
#define sortm(d) sort(d.rbegin(), d.rend()) // 4321
//グローバル変数宣言
ll a = 0, b = 0, c = 0, e = 0, n = 0, k = 0;
int main() {
cin >> n;
vd v(n);
rep(i, n) cin >> v[i];
sortm(v);
rep(i, n - 1) { v[n - i - 2] = (v[n - i - 1] + v[n - i - 2]) / 2; }
print(v[0]);
}
|
[] | 736,622
| 736,623
|
u274201725
|
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);
}
double sum = 0.0;
reverse(v.begin(), v.end());
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < v.size(); i++) {
sum = (sum + v.at(i)) / 2;
}
cout << sum << endl;
}
|
#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);
}
double sum = 0.0;
sort(v.begin(), v.end());
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < v.size(); i++) {
sum = (sum + v.at(i)) / 2;
}
cout << sum << endl;
}
|
[
"identifier.change",
"call.function.change"
] | 736,624
| 736,625
|
u978913880
|
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);
}
double sum = 0.0;
reverse(v.begin(), v.end());
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < v.size(); i++) {
sum = (sum + v.at(i)) / 2;
}
cout << sum << endl;
}
|
#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);
}
double sum = 0.0;
sort(v.begin(), v.end());
sum = (v.at(0) + v.at(1)) / 2;
for (int i = 2; i < v.size(); i++) {
sum = (sum + v.at(i)) / 2;
}
cout << sum << endl;
}
|
[
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change"
] | 736,626
| 736,625
|
u978913880
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int b[100];
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
if (b[i] > b[j]) {
int temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
int sum = b[0];
for (int i = 1; i < a; i++) {
sum = (sum + b[i]) / 2;
}
cout << sum << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
double b[1003];
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
if (b[i] > b[j]) {
int temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
double sum = b[0];
for (int i = 1; i < a; i++) {
sum = (sum + b[i]) / 2;
}
cout << sum << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 736,635
| 736,636
|
u018679195
|
cpp
|
p02935
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int lst[100010];
int main() {
int n, pos;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> lst[i];
}
sort(lst, lst + n);
for (int i = 1; i < n; i++) {
lst[i] = (lst[i] + lst[i - 1]) / 2;
}
cout << lst[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
double lst[100010];
int main() {
int n, pos;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> lst[i];
}
sort(lst, lst + n);
for (int i = 1; i < n; i++) {
lst[i] = (lst[i] + lst[i - 1]) / 2;
}
cout << lst[n - 1] << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,641
| 736,642
|
u076642656
|
cpp
|
p02935
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vector<ll>>;
using vvc = vector<vector<char>>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
ll n, k, m, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vl a(n);
rep(i, n) cin >> a[i];
sort(all(a));
double r = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
r = (r + a[i]) / 2;
}
cout << r << endl;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vector<ll>>;
using vvc = vector<vector<char>>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
ll n, k, m, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vl a(n);
rep(i, n) cin >> a[i];
sort(all(a));
double r = (a[0] + a[1]) / 2.0;
for (int i = 2; i < n; i++) {
r = (r + a[i]) / 2.0;
}
cout << r << endl;
}
|
[
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 736,643
| 736,644
|
u715288765
|
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());
for (int i = 1; i > n; i++)
v[i] = (v[i] + v[i - 1]) / 2;
cout << v[n - 1] << endl;
}
|
#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());
for (int i = 1; i < n; i++)
v[i] = (v[i] + v[i - 1]) / 2;
cout << v[n - 1] << endl;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 736,645
| 736,646
|
u528258842
|
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());
for (int i = 1; i > n; i++)
v[i] = (v[i] + v[i - 1]) / 2;
cout << v[n - 1] << endl;
}
|
#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());
for (int i = 1; i < n; i++)
v[i] = (v[i] + v[i - 1]) / 2;
cout << v[n - 1] << endl;
}
|
[
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 736,647
| 736,646
|
u528258842
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.