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 |
|---|---|---|---|---|---|---|---|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define INF 2100000000
#define int long long
signed main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s << endl;
else
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 2100000000
#define int long long
signed main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[
"io.output.change"
] | 735,481
| 735,482
|
u005570675
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,483
| 735,484
|
u299529534
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a;
if (a >= 3200)
cout << s << endl;
else
cout << "red\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red\n";
return 0;
}
|
[
"expression.operation.binary.add"
] | 735,485
| 735,486
|
u344644921
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operation.binary.add"
] | 735,488
| 735,489
|
u822037230
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string ch;
scanf("%d", &a);
cin >> ch;
if (a <= 3200)
cout << "red" << endl;
else
cout << ch << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string ch;
scanf("%d", &a);
cin >> ch;
if (a < 3200)
cout << "red" << endl;
else
cout << ch << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,494
| 735,495
|
u333542501
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 735,507
| 735,508
|
u773916255
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << 'red';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
}
|
[
"literal.string.change",
"io.output.change"
] | 735,509
| 735,510
|
u408650734
|
cpp
|
p02933
|
#include <iostream>
#include <math.h>
using namespace std;
int a;
char s;
int main() {
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200) {
printf("%s", s);
} else {
printf("red");
}
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
int a;
char s[11];
int main() {
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200) {
printf("%s", s);
} else {
printf("red");
}
return 0;
}
|
[] | 735,513
| 735,514
|
u088989565
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a;
getline(cin, str);
if (a < 3200)
cout << "red" << endl;
else
cout << str << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a >> str;
if (a < 3200)
cout << "red" << endl;
else
cout << str << endl;
}
|
[
"call.remove",
"call.arguments.change"
] | 735,523
| 735,524
|
u134075835
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = (int)(1e9 + 7);
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64> vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
int main() {
int A;
cin >> A;
string S;
if (A >= 3200)
cout << S << endl;
else
cout << "red\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = (int)(1e9 + 7);
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64> vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
int main() {
int A;
cin >> A;
string S;
cin >> S;
if (A >= 3200)
cout << S << endl;
else
cout << "red\n";
}
|
[] | 735,530
| 735,531
|
u524343822
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int total = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
total += (1 / a);
}
cout << 1 / total << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
float total = 0;
for (int i = 0; i < N; i++) {
float a;
cin >> a;
total += (1.0 / a);
}
cout << 1.0 / total << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 735,532
| 735,533
|
u312172322
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double sum = 0.0;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 735,548
| 735,549
|
u373365067
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double sum = 0.0;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 735,550
| 735,549
|
u373365067
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double sum = 0.0;
cin >> n;
double a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = sum + (1 / a[i]);
}
cout << 1 / sum << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 735,551
| 735,549
|
u373365067
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, S = 1;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] = 1 / v[i];
S += v[i];
}
cout << fixed << setprecision(9) << 1 / S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double S = 0;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] = 1 / v[i];
S += v[i];
}
cout << fixed << setprecision(9) << 1 / S << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 735,565
| 735,566
|
u882098164
|
cpp
|
p02934
|
/*
author : nishi5451
created : 15.08.2020 12:06:13
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
double ans = 0.0;
rep(i, n) {
int a;
cin >> a;
ans += 1.0 / a;
}
printf("%.12lf/n", 1.0 / ans);
return 0;
}
|
/*
author : nishi5451
created : 15.08.2020 12:06:13
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
double ans = 0.0;
rep(i, n) {
int a;
cin >> a;
ans += 1.0 / a;
}
printf("%.12lf\n", 1.0 / ans);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 735,567
| 735,568
|
u033937898
|
cpp
|
p02934
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
double X = 0;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
X += 1 / A.at(i);
}
cout << fixed << setprecision(20) << 1 / X << endl;
}
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
double X = 0;
vector<double> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
X += 1 / A.at(i);
}
cout << fixed << setprecision(20) << 1 / X << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,582
| 735,583
|
u580593895
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int, int>
const ll INF = pow(10, 9) + 7;
int main() {
int n;
double a = 0, b;
rep(i, n) {
double x;
cin >> x;
a += 1 / x;
}
cout << 1 / a << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int, int>
const ll INF = pow(10, 9) + 7;
int main() {
int n;
cin >> n;
double a = 0, b;
rep(i, n) {
double x;
cin >> x;
a += 1 / x;
}
cout << 1 / a << endl;
}
|
[] | 735,590
| 735,591
|
u957398141
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep_ll(i, x, n) for (ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<long double> a(n);
rep(i, 0, n) cin >> a[i];
long double total = 0;
rep(i, 0, n) total = 1 / a[i];
total = 1 / total;
cout << fixed << setprecision(6) << total;
}
|
#include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep_ll(i, x, n) for (ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<long double> a(n);
rep(i, 0, n) cin >> a[i];
long double total = 0;
rep(i, 0, n) total += 1 / a[i];
total = 1 / total;
cout << fixed << setprecision(6) << total;
}
|
[
"assignment.value.change"
] | 735,592
| 735,593
|
u364076769
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define MOD_P 1000000007
#define ll long long
using namespace std;
int main() {
int n;
double sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.12", 1.0 / sum);
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define MOD_P 1000000007
#define ll long long
using namespace std;
int main() {
int n;
double sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
sum += 1.0 / tmp;
}
printf("%.12f", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 735,612
| 735,613
|
u426966697
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0.0, a;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
ans += a;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0.0, a;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
return 0;
}
|
[
"assignment.change"
] | 735,620
| 735,621
|
u372319000
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<double> b(n);
rep(i, n) cin >> a[i];
rep(i, n) b[i] = 1 / a[i];
double sum = 0.0;
rep(i, n) sum += b[i];
cout << fixed << setprecision(10) << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<double> b(n);
rep(i, n) cin >> a[i];
rep(i, n) b[i] = 1.0 / a[i];
double sum = 0.0;
rep(i, n) sum += b[i];
cout << fixed << setprecision(10) << 1 / sum << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,627
| 735,628
|
u981759938
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<double> b(n);
rep(i, n) cin >> a[i];
rep(i, n) b[i] = 1 / a[i];
double sum = 0;
rep(i, n) sum += b[i];
cout << fixed << setprecision(10) << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<double> b(n);
rep(i, n) cin >> a[i];
rep(i, n) b[i] = 1.0 / a[i];
double sum = 0.0;
rep(i, n) sum += b[i];
cout << fixed << setprecision(10) << 1 / sum << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 735,629
| 735,628
|
u981759938
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
double b = 0;
vector<int> a(A);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
}
for (int i = 0; i < A; i++) {
b += 1 / (a.at(i));
}
cout << 1 / b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
double b = 0;
vector<int> a(A);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
}
for (int i = 0; i < A; i++) {
b += (double)1 / (a.at(i));
}
cout << (double)1 / b << endl;
}
|
[
"type_conversion.add"
] | 735,630
| 735,631
|
u896053584
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
const ll INF = 1001001001;
const ll mod = 10000000007;
int main() {
int n;
cin >> n;
int a;
ld sum = 0;
rep(i, n) {
cin >> a;
sum += 1 / a;
}
cout << fixed << setprecision(10);
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
const ll INF = 1001001001;
const ll mod = 10000000007;
int main() {
int n;
cin >> n;
int a;
ld sum = 0;
rep(i, n) {
cin >> a;
sum += 1.0 / a;
}
cout << fixed << setprecision(10);
cout << 1 / sum << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,632
| 735,633
|
u564204618
|
cpp
|
p02934
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
double n;
vector<double> a(n);
rep(i, n) cin >> a[i];
vector<double> b(n);
rep(i, n) b[i] = 1 / a[i];
double sum = 0;
rep(i, n) sum += b[i];
double ans = 1 / sum;
cout << ans << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
double n;
cin >> n;
vector<double> a(n);
rep(i, n) cin >> a[i];
vector<double> b(n);
rep(i, n) b[i] = 1 / a[i];
double sum = 0;
rep(i, n) sum += b[i];
double ans = 1 / sum;
cout << ans << endl;
}
|
[] | 735,636
| 735,637
|
u485925545
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 0.0;
double v;
rep(i, n) {
cin >> v;
a += (double)1, 0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(16);
cout << a << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 0.0;
double v;
rep(i, n) {
cin >> v;
a += (double)1.0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(16);
cout << a << endl;
}
|
[
"literal.number.change",
"assignment.value.change"
] | 735,638
| 735,639
|
u831954260
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 0;
double v;
rep(i, n) {
cin >> v;
a += (double)1, 0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(10);
cout << a << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 0.0;
double v;
rep(i, n) {
cin >> v;
a += (double)1.0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(16);
cout << a << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"io.output.change"
] | 735,640
| 735,639
|
u831954260
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 1.0;
double v;
rep(i, n) {
cin >> v;
a += (double)1, 0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(10);
cout << a << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(j, m) for (int j = 0; i < (int)(n); j++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
double a = 0.0;
double v;
rep(i, n) {
cin >> v;
a += (double)1.0 / v;
}
a = (double)1.0 / a;
cout << fixed << setprecision(16);
cout << a << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"io.output.change"
] | 735,641
| 735,639
|
u831954260
|
cpp
|
p02934
|
#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);
}
int k;
double ans = 0.0;
for (double x : a) {
k = 1 / x;
ans += k;
}
cout << fixed << setprecision(10);
cout << 1 / ans << 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 k;
double ans = 0.0;
for (double x : a) {
k = 1 / x;
ans += k;
}
cout << fixed << setprecision(10);
cout << 1 / ans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,644
| 735,645
|
u373661220
|
cpp
|
p02934
|
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
double tmp = 0;
for (int i = 0; i < n; ++i) {
tmp = 1.0 / a[i];
}
tmp = 1.0 / tmp;
cout << setprecision(9) << fixed << tmp << endl;
return 0;
}
|
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
double tmp = 0;
for (int i = 0; i < n; ++i) {
tmp += 1.0 / a[i];
}
tmp = 1.0 / tmp;
cout << setprecision(9) << fixed << tmp << endl;
return 0;
}
|
[
"assignment.value.change"
] | 735,646
| 735,647
|
u904995051
|
cpp
|
p02934
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += (double)1 / a[i];
}
cout << (double)1 / sum << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += (double)1 / a[i];
}
cout << (double)1 / sum << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,648
| 735,649
|
u607564800
|
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.0 / A[i]);
}
int T = 0;
T = 1.0 / S;
cout << S << endl;
}
|
#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.0 / A[i]);
}
double T = 0;
T = 1.0 / S;
cout << T << endl;
}
|
[
"variable_declaration.type.primitive.change",
"identifier.change",
"io.output.change"
] | 735,652
| 735,653
|
u016183710
|
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.0 / A[i]);
}
int T = 0;
T = 1 / S;
cout << S << endl;
}
|
#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.0 / A[i]);
}
double T = 0;
T = 1.0 / S;
cout << T << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 735,654
| 735,653
|
u016183710
|
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[i]);
}
double T = 0;
T = 1 / S;
cout << T << endl;
}
|
#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.0 / A[i]);
}
double T = 0;
T = 1.0 / S;
cout << T << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,655
| 735,653
|
u016183710
|
cpp
|
p02934
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<long double> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1.0 / a[i];
}
long double ans = accumulate(a.begin(), a.end(), 0);
cout << fixed << setprecision(10) << 1.0 / ans << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<long double> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1.0 / a[i];
}
long double ans = accumulate(a.begin(), a.end(), 0.0);
cout << fixed << setprecision(10) << 1.0 / ans << endl;
return 0;
}
|
[
"literal.number.change",
"call.arguments.change"
] | 735,658
| 735,659
|
u261538386
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
double ans = 0.0, a;
std::cin >> n;
for (int i = 1; i < n; ++i) {
std::cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
std::cout << setprecision(16) << ans << "\n";
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
double ans = 0.0, a;
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
std::cout << setprecision(16) << ans << "\n";
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 735,660
| 735,661
|
u589238650
|
cpp
|
p02934
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0, d;
for (int i = 0; i < n; i++) {
cin >> d;
sum += 1.0 / d;
}
printf("%.10af\n", 1.0 / sum);
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0, d;
for (int i = 0; i < n; i++) {
cin >> d;
sum += 1.0 / d;
}
printf("%.10f\n", 1.0 / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 735,662
| 735,663
|
u955202970
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n;
double a[101], b[101];
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = 1 / a[i];
sum += b[i];
}
cout << 1 / sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
double a[101], b[101];
cin >> n;
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = 1 / a[i];
sum += b[i];
}
cout << 1 / sum << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,664
| 735,665
|
u745267317
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n) + 1; i++)
#define all(vecto) vecto.begin(), vecto.end()
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
double sum = 0;
rep(i, n) { sum += 1.0 / vec.at(i); }
cout << fixed << setprecision << endl;
cout << 1.0 / sum << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n) + 1; i++)
#define all(vecto) vecto.begin(), vecto.end()
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
double sum = 0.0;
rep(i, n) { sum += 1.0 / vec.at(i); }
cout << fixed << setprecision(9);
cout << 1.0 / sum << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 735,672
| 735,673
|
u296160120
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, sum = 0;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
double a;
cin >> a;
sum += 1 / a;
}
cout << 1 / sum << endl;
}
|
[] | 735,676
| 735,677
|
u873762144
|
cpp
|
p02934
|
#include <iostream>
int main() {
int n, s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
}
|
#include <iostream>
int main() {
int n;
float s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
}
|
[
"variable_declaration.type.change"
] | 735,678
| 735,679
|
u467710662
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a;
int temp;
while (std::cin >> temp)
a.push_back(temp);
double sum = 0;
for (auto i : a)
sum += i;
std::cout << 1 / sum << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a;
int temp;
while (std::cin >> temp)
a.push_back(temp);
double sum = 0;
for (auto i : a)
sum += 1 / (double)i;
std::cout << 1 / sum << std::endl;
return 0;
}
|
[
"assignment.change"
] | 735,680
| 735,681
|
u864752370
|
cpp
|
p02934
|
#include <iostream>
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 << endl;
return 0;
}
|
#include <iostream>
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 << endl;
return 0;
}
|
[] | 735,690
| 735,691
|
u016119075
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
double f = 0;
for (int i = 0; i < n; i++) {
f += 1 / a[i];
}
f = 1 / f;
cout << f << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
float f = 0;
for (int i = 0; i < n; i++) {
f += (double)1 / a[i];
}
f = 1 / f;
cout << f << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,692
| 735,693
|
u478964347
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
float f = 0;
for (int i = 0; i < n; i++) {
f += 1 / a[i];
}
f = 1 / f;
cout << f << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
float f = 0;
for (int i = 0; i < n; i++) {
f += (double)1 / a[i];
}
f = 1 / f;
cout << f << endl;
}
|
[
"type_conversion.add"
] | 735,694
| 735,693
|
u478964347
|
cpp
|
p02934
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes\n";
else
cout << "No\n";
}
void dodecagon() {
int r;
cin >> r;
cout << 3 * r * r << "\n";
}
void harmony() {
int a, b;
cin >> a >> b;
if (a % 2 == b % 2)
cout << (a + b) / 2 << "\n";
else
cout << "IMPOSSIBLE\n";
}
void transfer() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << "\n";
}
void A_137() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b)) << "\n";
}
void red_or_not() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
void tenki() {
string s, t;
cin >> s >> t;
int cnt = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
++cnt;
}
cout << cnt << "\n";
}
void password() {
int n;
cin >> n;
cout << pow(n, 3) << "\n";
}
void resistors_in_parallel() {
int n;
cin >> n;
vector<float> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
float ans = 0.0;
for (int i = 0; i < n; ++i)
ans += 1 / a[i];
cout << ans << "\n";
}
void power_socket() {
int a, b;
cin >> a >> b;
if (b == 1)
cout << 0 << "\n";
int cnt = 1, tap = (a - 1) * cnt + 1;
while (tap < b) {
++cnt;
tap += a - 1;
}
cout << cnt << "\n";
}
void buffet() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += b[a[i] - 1];
if (i > 0 && a[i - 1] + 1 == a[i])
ans += c[a[i - 1] - 1];
}
cout << ans << "\n";
}
int main() {
// security();
// fifty_fify();
// dodecagon();
// harmony();
// transfer();
// A_137();
// red_or_not();
// tenki();
// password();
// resistors_in_parallel();
// power_socket();
// buffet();
resistors_in_parallel();
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes\n";
else
cout << "No\n";
}
void dodecagon() {
int r;
cin >> r;
cout << 3 * r * r << "\n";
}
void harmony() {
int a, b;
cin >> a >> b;
if (a % 2 == b % 2)
cout << (a + b) / 2 << "\n";
else
cout << "IMPOSSIBLE\n";
}
void transfer() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << "\n";
}
void A_137() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b)) << "\n";
}
void red_or_not() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
void tenki() {
string s, t;
cin >> s >> t;
int cnt = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
++cnt;
}
cout << cnt << "\n";
}
void password() {
int n;
cin >> n;
cout << pow(n, 3) << "\n";
}
void resistors_in_parallel() {
int n;
cin >> n;
vector<float> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
float ans = 0.0;
for (int i = 0; i < n; ++i)
ans += 1.0 / a[i];
cout << 1.0 / ans << "\n";
}
void power_socket() {
int a, b;
cin >> a >> b;
if (b == 1)
cout << 0 << "\n";
int cnt = 1, tap = (a - 1) * cnt + 1;
while (tap < b) {
++cnt;
tap += a - 1;
}
cout << cnt << "\n";
}
void buffet() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += b[a[i] - 1];
if (i > 0 && a[i - 1] + 1 == a[i])
ans += c[a[i - 1] - 1];
}
cout << ans << "\n";
}
int main() {
// security();
// fifty_fify();
// dodecagon();
// harmony();
// transfer();
// A_137();
// red_or_not();
// tenki();
// password();
// resistors_in_parallel();
// power_socket();
// buffet();
resistors_in_parallel();
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,703
| 735,704
|
u546641746
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int sum = 0;
int n = 0;
cin >> n;
rep(i, n) {
double A = 0;
cin >> A;
sum += 1 / A;
}
cout << 1 / sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double sum = 0;
int n = 0;
cin >> n;
rep(i, n) {
double A = 0;
cin >> A;
sum += 1 / A;
}
cout << 1 / sum << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,709
| 735,710
|
u297398560
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
int main() {
int n;
double sum = 0;
rep(i, n) {
double a;
cin >> a;
sum += 1 / a;
}
double ans = 1 / sum;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
int main() {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
double a;
cin >> a;
sum += 1 / a;
}
double ans = 1 / sum;
cout << ans << endl;
}
|
[] | 735,726
| 735,727
|
u853721692
|
cpp
|
p02934
|
// author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n;
cin >> n;
double z = 0.0;
for (int i = 0; n > i; i++) {
int t;
cin >> t;
z += 1 / t;
}
cout << fixed << setprecision(10) << 1 / z << endl;
}
|
// author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n;
cin >> n;
double z = 0.0;
for (int i = 0; n > i; i++) {
int t;
cin >> t;
z += (double)1 / t;
}
cout << fixed << setprecision(10) << 1 / z << endl;
}
|
[
"type_conversion.add"
] | 735,728
| 735,729
|
u466161487
|
cpp
|
p02934
|
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
double sum = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
sum += 1 / A;
}
cout << setprecision(14) << 1 / sum << endl;
}
|
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long double sum = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
sum += 1 / (long double)A;
}
cout << setprecision(14) << 1 / sum << endl;
}
|
[
"variable_declaration.type.widen.change"
] | 735,734
| 735,735
|
u323542775
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double A, S = 0;
for (int i = 0; i < N; i++) {
cin >> A;
S += 1 / A;
}
printf("lf%", 1 / S);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double A, S = 0;
for (int i = 0; i < N; i++) {
cin >> A;
S += 1 / A;
}
printf("%lf\n", 1 / S);
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 735,741
| 735,742
|
u820224016
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int a = 0;
double sumrep = 0;
rep(i, N) {
cin >> a;
sumrep += 1 / a;
}
double sum = 1 / sumrep;
cout << sum << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
double a = 0;
double sumrep = 0;
rep(i, N) {
cin >> a;
sumrep += 1 / a;
}
double sum = 1 / sumrep;
cout << sum << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,743
| 735,744
|
u978535698
|
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.at(i);
for (int i = 0; i < N; i++)
vec.at(i) = 1 / vec.at(i);
double S = 0;
for (int i = 0; i < N; i++)
S += vec.at(i);
cout << 1 / S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
for (int i = 0; i < N; i++)
vec.at(i) = 1 / vec.at(i);
double S = 0;
for (int i = 0; i < N; i++)
S += vec.at(i);
cout << 1 / S << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,745
| 735,746
|
u111440489
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
for (int i = 0; i < N; i++)
vec.at(i) = 1 / vec.at(i);
S = 0;
for (int i = 0; i < N; i++)
S += vec.at(i);
cout << 1 / S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
for (int i = 0; i < N; i++)
vec.at(i) = 1 / vec.at(i);
double S = 0;
for (int i = 0; i < N; i++)
S += vec.at(i);
cout << 1 / S << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 735,747
| 735,746
|
u111440489
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double sum = 0;
for (int i = 0; i < N; i++) {
int A;
sum += 1.0 / A;
}
double ans = 1.0 / sum;
cout << setprecision(20) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double sum = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
sum += 1.0 / A;
}
double ans = 1.0 / sum;
cout << setprecision(20) << ans << endl;
}
|
[] | 735,770
| 735,771
|
u624830211
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
double inv;
for (int i = 0; i < n; ++i) {
cin >> A[i];
inv += 1 / A[i];
}
cout << 1 / inv << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
double inv;
for (int i = 0; i < n; ++i) {
cin >> A[i];
inv += 1.0 / A[i];
}
cout << 1 / inv << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,772
| 735,773
|
u864785784
|
cpp
|
p02934
|
#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[i];
}
sort(a.begin(), a.end());
double greater = a[n - 1];
vector<double> div(n);
double sum2 = 0;
for (int i = 0; i < n; i++) {
div[i] = greater / a[i];
sum2 += div[i];
}
cout << setprecision(5) << greater / sum2 << "\n";
return 0;
}
|
#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[i];
}
sort(a.begin(), a.end());
double greater = a[n - 1];
vector<double> div(n);
double sum2 = 0;
for (int i = 0; i < n; i++) {
div[i] = greater / a[i];
sum2 += div[i];
}
cout << setprecision(12) << greater / sum2 << "\n";
return 0;
}
|
[
"literal.number.change",
"io.output.change"
] | 735,780
| 735,781
|
u845907943
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long double K;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
K += 1 / A;
}
cout << 1 / K << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long double K = 0;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
long double A;
cin >> A;
K += 1 / A;
}
cout << 1 / K << endl;
}
|
[
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 735,782
| 735,783
|
u306482197
|
cpp
|
p02934
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N;
ldb ans = 0.0, a;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
printf("%.10lf\n", ans);
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N;
ldb ans = 0.0, a;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
printf("%.10Lf\n", ans);
}
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 735,786
| 735,787
|
u105100688
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << endl
#define debug4(x, y, z, o) \
cout << "DEBUG " << x << " " << y << " " << z << " " << o << endl
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> ppi;
typedef vector<vector<int>> mat;
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int32_t main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += (1.0 / x);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << endl
#define debug4(x, y, z, o) \
cout << "DEBUG " << x << " " << y << " " << z << " " << o << endl
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> ppi;
typedef vector<vector<int>> mat;
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int32_t main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += (1.0 / x);
}
cout << 1.0 / ans << endl;
}
|
[
"expression.operation.binary.add"
] | 735,797
| 735,798
|
u437229403
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int pans;
for (int i = 0; i < n; i++) {
pans += 1 / a[i];
}
cout << 1 / pans << 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];
}
double pans;
for (int i = 0; i < n; i++) {
pans += 1 / a[i];
}
cout << 1 / pans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,825
| 735,826
|
u917518913
|
cpp
|
p02934
|
#include <cstdio>
using namespace std;
int N, A[101];
int main() {
scanf("%d", &N);
A[0] = 1;
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
A[0] *= A[i];
}
int sum;
for (int i = 1; i <= N; ++i) {
sum += A[0] / A[i];
}
printf("%lf\n", (double)A[0] / sum);
}
|
#include <cstdio>
using namespace std;
int N;
double A[101];
int main() {
scanf("%d", &N);
A[0] = 1;
for (int i = 1; i <= N; ++i) {
scanf("%lf", &A[i]);
A[0] *= A[i];
}
double sum;
for (int i = 1; i <= N; ++i) {
sum += A[0] / A[i];
}
printf("%.10lf\n", (double)A[0] / sum);
}
|
[
"literal.string.change",
"call.arguments.change",
"variable_declaration.type.primitive.change",
"io.output.change"
] | 735,833
| 735,834
|
u923285281
|
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);
}
int count = 0;
for (int i = 0; i < n; i++) {
count += 1.0 / a.at(i);
}
cout << 1.0 / count << 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 count = 0;
for (int i = 0; i < n; i++) {
count += 1.0 / a.at(i);
}
cout << 1.0 / count << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,856
| 735,857
|
u955282280
|
cpp
|
p02934
|
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
double ans = 1.0;
for (int i = 0; i < N; i++) {
double a;
cin >> a;
ans += 1 / a;
}
ans = 1 / ans;
cout << setprecision(10) << ans << endl;
}
|
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
double ans = 0.0;
for (int i = 0; i < N; i++) {
double a;
cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
cout << setprecision(10) << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 735,858
| 735,859
|
u658993896
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, a[1005], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 735,860
| 735,861
|
u562321612
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, a[1005], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 735,862
| 735,861
|
u562321612
|
cpp
|
p02934
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int A[101];
double sum = 0.0l;
for (int i = 0; i < N; i++) {
scanf("%d", A + i);
sum += 1.0l / (double)A[i];
}
printf("%lf", 1.0l / sum);
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int A[101];
double sum = 0.0l;
for (int i = 0; i < N; i++) {
scanf("%d", A + i);
sum += 1.0l / (double)A[i];
}
printf("%llf", 1.0l / sum);
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 735,875
| 735,876
|
u103357948
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, r[101];
double sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
sum = sum + (1.0 * 1 / r[i]);
}
cout << setprecision(5);
cout << (1 / sum) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, r[101];
double sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
sum = sum + (1.0 * 1 / r[i]);
}
cout << setprecision(14);
cout << (1 / sum) << endl;
return 0;
}
|
[
"literal.number.change",
"io.output.change"
] | 735,881
| 735,882
|
u082268669
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
ans += 1 / A.at(i);
}
cout << 1 / ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double ans;
cin >> N;
vector<double> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
ans += 1 / A.at(i);
}
cout << 1 / ans << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,885
| 735,886
|
u770009793
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> point(N);
for (int i = 0; i < N; i++) {
cin >> point.at(i);
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += 1 / (double)point.at(i);
}
cout << 1 / (double)sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> point(N);
for (int i = 0; i < N; i++) {
cin >> point.at(i);
}
double sum = 0;
for (int i = 0; i < N; i++) {
sum += 1.0 / (double)point.at(i);
}
cout << 1.0 / (double)sum << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 735,895
| 735,896
|
u525502670
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
double S;
S = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
S += 1 / A[i];
}
double ans;
ans = 1 / S;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
double S;
S = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
S += (double)1 / A[i];
}
double ans;
ans = 1 / S;
cout << ans << endl;
return 0;
}
|
[
"type_conversion.add"
] | 735,899
| 735,900
|
u871941262
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int N, i;
int A[110];
float sum = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
sum = sum + 1 / A[i];
}
cout << 1 / sum << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int N, i;
float A[110];
float sum = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
sum = sum + 1 / A[i];
}
cout << 1 / sum << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,905
| 735,906
|
u544511937
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
long long mul = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
mul *= a[i];
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += mul / a[i];
}
double answer = mul / sum;
cout << answer;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
double mul = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
mul *= a[i];
}
double sum = 0;
for (int i = 0; i < n; i++) {
sum += mul / a[i];
}
double answer = mul / sum;
cout << answer;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 735,909
| 735,910
|
u387480576
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int mul = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
mul *= a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += mul / a[i];
}
double answer = mul / sum;
cout << answer;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
double mul = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
mul *= a[i];
}
double sum = 0;
for (int i = 0; i < n; i++) {
sum += mul / a[i];
}
double answer = mul / sum;
cout << answer;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,911
| 735,910
|
u387480576
|
cpp
|
p02934
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int x = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
x += 1 / a.at(i);
}
cout << 1 / x << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(110);
double x = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
x += 1 / (a.at(i));
}
cout << 1 / x << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,918
| 735,919
|
u629044751
|
cpp
|
p02934
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
int n;
cin >> n;
double k = 0;
for (int i = 0; i < n; ++i) {
int num;
cin >> num;
k += (1 / num);
}
cout << 1. / k << endl;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
int n;
cin >> n;
double k = 0;
for (int i = 0; i < n; ++i) {
double num;
cin >> num;
k += (1 / num);
}
cout << 1. / k << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,942
| 735,943
|
u157759251
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int n;
double sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += 1.0 / a;
}
double ans = 1 / sum;
printf("%.10f", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += 1.0 / a;
}
double ans = 1 / sum;
printf("%.10f", ans);
return 0;
}
|
[] | 735,944
| 735,945
|
u462639463
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
/*
*Resistors in Parallel
*setprecisionは浮動小数点の精度を指定する
*/
int main() {
int N;
cin >> N;
double ans = 0.0, A;
for (int i = 1; i < N; ++i) {
cin >> A;
ans += 1.0 / A;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double ans = 0.0, A;
for (int i = 0; i < N; ++i) {
cin >> A;
ans += 1.0 / A;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 735,946
| 735,947
|
u901555384
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
/*
*Resistors in Parallel
*setprecisionは浮動小数点の精度を指定する
*/
int main() {
int N;
cin >> N;
double ans = 0.0, A;
for (int i = 1; i < N; i++) {
cin >> A;
ans += 1.0 / A;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double ans = 0.0, A;
for (int i = 0; i < N; ++i) {
cin >> A;
ans += 1.0 / A;
}
ans = 1.0 / ans;
cout << setprecision(16) << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 735,948
| 735,947
|
u901555384
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += 1 / x;
}
cout << fixed << setprecision(6);
cout << 1 / ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += 1 / x;
}
cout << fixed << setprecision(6);
cout << 1 / ans;
}
|
[] | 735,956
| 735,957
|
u009870106
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += 1 / x;
}
cout << fixed << setprecision(5);
cout << 1 / ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
cin >> x;
ans += 1 / x;
}
cout << fixed << setprecision(6);
cout << 1 / ans;
}
|
[
"literal.number.change",
"io.output.change"
] | 735,958
| 735,957
|
u009870106
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n = 0, input = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n = 0;
double input = 0.9, sum = 0.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 735,965
| 735,966
|
u620069376
|
cpp
|
p02934
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
double ans = 0.0, A;
for (int i = 0; i < N; ++i) {
cin >> A;
ans += 1.0 / A;
}
cout << (1.0 / ans) << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
double ans = 0.0, A;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A;
ans += 1.0 / A;
}
cout << (1.0 / ans) << endl;
}
|
[] | 735,967
| 735,968
|
u419501474
|
cpp
|
p02934
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
double A;
double sum = 0.0;
rep(i, 0, N) {
cin >> A;
sum = 1.0 / A;
}
double ans = 1 / sum;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
double A;
double sum = 0.0;
rep(i, 0, N) {
cin >> A;
sum += 1.0 / A;
}
double ans = 1 / sum;
cout << ans << endl;
}
|
[
"assignment.value.change"
] | 735,971
| 735,972
|
u726060136
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
cin >> N;
int a;
double d = 0.0;
double answer = 0.0;
for (int i = 0; i < N; i++) {
cin >> a;
d += 1 / a;
}
answer = 1 / d;
// 出力
cout << answer << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
cin >> N;
double a;
double d = 0.0;
double answer = 0.0;
for (int i = 0; i < N; i++) {
cin >> a;
d += 1 / a;
}
answer = 1 / d;
// 出力
cout << answer << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 735,973
| 735,974
|
u135358384
|
cpp
|
p02934
|
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N, A;
cin >> N;
int i;
double sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += 1 / A;
}
sum = 1 / sum;
cout << setprecision(16) << sum << endl;
}
|
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int i;
double A;
double sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += 1 / A;
}
sum = 1 / sum;
cout << setprecision(16) << sum << endl;
}
|
[
"variable_declaration.remove",
"variable_declaration.add"
] | 735,975
| 735,976
|
u864044904
|
cpp
|
p02934
|
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
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;
}
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
double ans = 0.0;
REP(i, n) {
double a;
cin >> a;
ans += 1.0 / a;
}
cout << fixed << setprecision(12) << ans << '\n';
return 0;
}
|
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
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;
}
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
double ans = 0.0;
REP(i, n) {
double a;
cin >> a;
ans += 1.0 / a;
}
cout << fixed << setprecision(12) << 1.0 / ans << '\n';
return 0;
}
|
[
"expression.operation.binary.add"
] | 735,979
| 735,980
|
u077337864
|
cpp
|
p02934
|
#include "bits/stdc++.h"
using namespace std;
float reverse(int number) { return 1 / number; }
int main() {
int N;
int sum = 0;
int n_values;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> n_values;
sum += reverse(n_values);
}
cout << reverse(sum);
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
double reverse(double number) { return 1 / number; }
int main() {
int N;
double sum = 0;
int n_values;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> n_values;
sum += reverse(n_values);
}
cout << 1 / sum;
return 0;
}
|
[
"function.return_type.change",
"variable_declaration.type.primitive.change",
"call.arguments.change"
] | 735,991
| 735,992
|
u090445726
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; ++i) {
double a;
cin >> a;
ans += 1 / a;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
for (int i = 0; i < n; ++i) {
double a;
cin >> a;
ans += 1 / a;
}
cout << 1 / ans;
}
|
[
"expression.operation.binary.add"
] | 736,007
| 736,008
|
u971421535
|
cpp
|
p02934
|
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int sosu(int a) {
for (int i = 2; i <= a; i++) {
if (a % i == 0)
return i;
}
}
int main() {
int n;
int a[1000], arr[1000];
int answer = 1;
double mox = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
arr[i] = a[i];
}
for (int i = 0; i < n; i++) {
while (arr[i] != 1) {
int tp = sosu(arr[i]);
answer = answer * tp;
for (int j = 0; j < n; j++) {
if (arr[j] % tp == 0)
arr[j] = arr[j] / tp;
}
}
}
for (int i = 0; i < n; i++)
mox = mox + a[i] / answer;
cout << answer / mox;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int sosu(int a) {
for (int i = 2; i <= a; i++) {
if (a % i == 0)
return i;
}
}
int main() {
int n;
int a[1000], arr[1000];
int answer = 1;
double mox = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
arr[i] = a[i];
}
for (int i = 0; i < n; i++) {
while (arr[i] != 1) {
int tp = sosu(arr[i]);
answer = answer * tp;
for (int j = 0; j < n; j++) {
if (arr[j] % tp == 0)
arr[j] = arr[j] / tp;
}
}
}
for (int i = 0; i < n; i++)
mox = mox + answer / a[i];
cout << answer / mox;
return 0;
}
|
[
"assignment.change",
"expression.operation.binary.remove"
] | 736,012
| 736,013
|
u812487947
|
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<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.0 / A.at(i);
}
cout << 1 / s << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,018
| 736,019
|
u707810208
|
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);
}
int 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<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.0 / A.at(i);
}
cout << 1 / s << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,020
| 736,019
|
u707810208
|
cpp
|
p02934
|
///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld", &a)
#define sf2(a, b) scanf("%lld %lld", &a, &b)
#define sf3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pf(a) printf("%lld", a)
#define pf2(a, b) printf("%lld %lld", a, b)
#define pf3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main() {
timesave;
long n;
while (cin >> n) {
long i, a;
double sum = 0.0;
for (i = 1; i <= n; i++) {
cin >> a;
sum = sum + (1.0 / a);
}
sum = 1.0 / sum;
printf("%.lf\n", sum);
}
}
|
///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld", &a)
#define sf2(a, b) scanf("%lld %lld", &a, &b)
#define sf3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pf(a) printf("%lld", a)
#define pf2(a, b) printf("%lld %lld", a, b)
#define pf3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main() {
timesave;
long n;
while (cin >> n) {
long i, a;
double sum = 0.0;
for (i = 1; i <= n; i++) {
cin >> a;
sum = sum + (1.0 / a);
}
sum = 1.0 / sum;
printf("%lf\n", sum);
}
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,023
| 736,024
|
u701011345
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int n;
double s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s += 1.0 / a;
}
cout << s << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
double s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s += 1.0 / a;
}
cout << 1.0 / s << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 736,043
| 736,044
|
u169639579
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double count = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
count += 1 / A.at(i);
}
cout << 1 / count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double count = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
count += 1.0 / A.at(i);
}
cout << 1.0 / count << endl;
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 736,045
| 736,046
|
u625176086
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
count += 1 / A.at(i);
}
cout << 1 / count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double count = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
count += 1.0 / A.at(i);
}
cout << 1.0 / count << endl;
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 736,047
| 736,046
|
u625176086
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int input_number;
cin >> input_number;
int count = 0;
int total = 0;
while (input_number > count) {
float input;
cin >> input;
total += 1.0 / input;
count++;
}
cout << 1 / total;
}
|
#include <iostream>
using namespace std;
int main() {
int input_number;
cin >> input_number;
int count = 0;
float total = 0;
while (input_number > count) {
int input;
cin >> input;
total += 1.0 / input;
count++;
}
cout << 1 / total;
}
|
[
"variable_declaration.type.primitive.change"
] | 736,052
| 736,053
|
u814317577
|
cpp
|
p02934
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int k = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
k = k + a[i];
}
double d = 0;
for (int i = 0; i < N; i++) {
d = d + k / a[i];
}
cout << (k / d) << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
double k = 1.0;
for (int i = 0; i < N; i++) {
cin >> a[i];
k = k + a[i];
}
double d = 0.0;
for (int i = 0; i < N; i++) {
d = d + k / a[i];
}
cout << (k / d) << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 736,056
| 736,057
|
u984200859
|
cpp
|
p02934
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans = 0.0;
for (int i = 0; i < n; i++) {
double tmp;
cin >> tmp;
ans += 1.0 / tmp;
}
ans = 1 / ans;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0.0;
for (int i = 0; i < n; i++) {
double tmp;
cin >> tmp;
ans += 1.0 / tmp;
}
ans = 1 / ans;
cout << ans << endl;
return 0;
}
|
[] | 736,060
| 736,061
|
u737262551
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.