problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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 priori... | #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 priori... | [
"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... | #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 << setprecis... | [
"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 << setprecisi... | #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 << setpreci... | [
"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 << setpreci... | #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 << setpreci... | [
"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(... | #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 << setpreci... | [
"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 ... | #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 << setpreci... | [
"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<doub... | #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<doub... | [
"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;
... | #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 ... | [
"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 / re... | #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 =... | [
"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... | #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... | [
"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 <... | #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 <... | [
"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;
... | #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;
... | [
"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 = vec... | #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 = vec... | [
"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; ... | #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; ... | [
"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... | #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<dou... | [] | 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 ... | /*
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 ... | [
"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 en... |
#include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define en... | [
"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); ... | #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); ... | [
"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 ... | #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 ... | [
"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;
... | #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;
... | [
"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... | #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 <... | [
"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 << s... | #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 <... | [
"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;... | #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;
... | [] | 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;
// c... | #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;
/... | [
"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;
... | #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;
... | [
"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... | #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;
fo... | [] | 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,... | #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,... | [
"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 {
... | #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;
} el... | [
"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 ... | #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... | [
"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 = 10010... | #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 = 10010... | [
"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 ch... | #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 ch... | [
"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.... | #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 = ... | [
"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...... |
#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...... | [
"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]... | #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[... | [
"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); \... | #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); \... | [] | 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)... | #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"... | [
"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> s... | #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> s... | [
"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> s... | #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> s... | [
"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 = (s... | #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 =... | [
"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;
... | #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;
... | [
"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]; }
... | #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]; }
... | [
"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);
re... | #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)... | [
"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 doub... | #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 do... | [
"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;... | #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 -... | [
"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... | // 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... | [] | 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;
}... | #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;
}
... | [
"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;
}
... | #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;
}
... | [
"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;... | #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] = t... | [
"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++) {
... | #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++)... | [
"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 a... | #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 a... | [
"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.