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;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
unsigned euclidean_lcm(unsigned a, unsigned b) {
unsigned g;
g = euclidean_gcd(a, b);
return a... | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
unsigned euclidean_lcm(unsigned a, unsigned b) {
unsigned g;
g = euclidean_gcd(a, b);
return a... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 736,648 | 736,649 | u464527162 | cpp |
p02934 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<double> a(n);
for (int i = 0; i < n; ++i)
std::cin >> a[i];
double ans = 0;
for (int i = 0; i < n; ++i)
ans += a[i];
ans = 1 / ans;
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<double> a(n);
for (int i = 0; i < n; ++i)
std::cin >> a[i];
double ans = 0;
for (int i = 0; i < n; ++i)
ans += 1 / a[i];
ans = 1 / ans;
std::cout << ans << std::endl;
return 0;
}
| [
"assignment.change"
] | 736,652 | 736,653 | u313111801 | cpp |
p02934 | ///////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////
#define ll long long
#define ull insigned lon long
///////////////... | ///////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////
#define ll long long
#define ull insigned lon long
///////////////... | [
"call.remove"
] | 736,656 | 736,657 | u335921722 | 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 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;
typedef long long ll;
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,660 | 736,661 | u457283867 | cpp |
p02934 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 1;
cin >> n;
vector<double> a(n);
double s1 = 0, s2 = 1;
for (int i = 0; i < n; i++) {
cin >> a[n];
s1 += 1 / a[n];
}
cout << 1 / s1 << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 1;
cin >> n;
// vector<double>a(n);
double a[105];
double s1 = 0, s2 = 1;
for (int i = 0; i < n; i++) {
cin >> a[n];
s1 += 1 / a[n];
}
cout << 1 / s1 << endl;
return 0;
} | [] | 736,662 | 736,663 | u199184624 | cpp |
p02934 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
//#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(a... | [] | 736,664 | 736,665 | u054475353 | cpp |
p02934 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 736,664 | 736,666 | u054475353 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, i;
double b, ans;
cin >> a;
for (i = 0; i < a; i++) {
cin >> b;
ans = ans + 1 / b;
cout << ans;
}
ans = 1 / ans;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, i;
double b, ans;
cin >> a;
for (i = 0; i < a; i++) {
cin >> b;
ans = ans + 1 / b;
}
ans = 1 / ans;
cout << ans;
return 0;
} | [] | 736,667 | 736,668 | u293317519 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, i;
double b, ans;
cin >> a;
for (i = 0; i <= a; i++) {
cin >> b;
ans = ans + 1 / b;
}
ans = 1 / ans;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, i;
double b, ans;
cin >> a;
for (i = 0; i < a; i++) {
cin >> b;
ans = ans + 1 / b;
}
ans = 1 / ans;
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 736,669 | 736,668 | u293317519 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float sum = 0, kei;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
float a;
a = (1 / vec.at(i));
sum += a;
}
kei = 1 / sum;
cout << kei << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
float sum = 0, kei;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
float a;
a = (1.0 / vec.at(i));
sum += a;
}
kei = 1.0 / sum;
cout << kei << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,679 | 736,680 | u361557064 | cpp |
p02934 | /*
* AtCode Beginner Contest 138 : B.Resistor in Parallel
* Author : anaksoleh
* 18 August 2019
*
*/
#include <bits/stdc++.h>
using namespace std;
int N;
float x = (1 / 10e4);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
float A, B;
cin >> N;
if (N >= 2) {
cin >> A >> B;
float pembilan... | /*
* AtCode Beginner Contest 138 : B.Resistor in Parallel
* Author : anaksoleh
* 18 August 2019
*
*/
#include <bits/stdc++.h>
using namespace std;
int N;
float x = (1 / 10e4);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
double A, B;
cin >> N;
if (N >= 2) {
cin >> A >> B;
double pembil... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 736,693 | 736,694 | u387120391 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[101];
for (int i = 0; i < n; i++)
cin >> a[i];
double p = 0;
for (int i = 0; i < n; i++) {
p += (double)(1 / a[i]);
}
cout << (double)(1 / p) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[101];
for (int i = 0; i < n; i++)
cin >> a[i];
double p = 0;
for (int i = 0; i < n; i++) {
p += (double)1 / a[i];
}
cout << (double)1 / p << endl;
return 0;
} | [] | 736,697 | 736,698 | u179077505 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0.0;
while (n--) {
double x;
cin >> x;
sum += 1.0 / x;
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double sum = 0.0;
while (n--) {
double x;
cin >> x;
sum += 1.0 / x;
}
cout << 1.0 / sum << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 736,699 | 736,700 | u144695182 | cpp |
p02934 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
float sum = 0;
for (int i = 0; i < n; ++i) {
sum += 1 / numArr[i];
}
cout << 1 / sum;
retu... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
double sum = 0;
for (int i = 0; i < n; ++i) {
sum += 1.0 / numArr[i];
}
cout << 1.0 / sum... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 736,716 | 736,717 | u780842141 | cpp |
p02934 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
float S = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
S += 1 / vec.at(i);
}
cout << 1 / S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
float S = 0;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
S += 1 / vec.at(i);
}
cout << 1 / S << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 736,721 | 736,722 | u890758760 | 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];
float ans = 0;
for (int i = 0; i < n; i++)
ans += 1 / a[i];
cout << 1 / ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
float ans = 0;
for (int i = 0; i < n; i++)
ans += 1 / a[i];
cout << 1 / ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 736,733 | 736,734 | u243126309 | 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];
float ans;
for (int i = 0; i < n; i++)
ans += 1 / a[i];
cout << 1 / ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
float ans = 0;
for (int i = 0; i < n; i++)
ans += 1 / a[i];
cout << 1 / ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 736,735 | 736,734 | u243126309 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> v(N);
rep0(i, N) { cin >> v[i]; }
... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<double> v(N);
rep0(i, N) { cin >> v[i]; ... | [
"type_conversion.add"
] | 736,736 | 736,737 | u053064675 | cpp |
p02935 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(1000) << fixed;
int n;
cin >> n;
int *v = new int[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort_heap(v, v + n);
double ans = v[0];
for (int ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
int n;
cin >> n;
int *v = new int[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
double ans = v[0];
for (int i = 1; ... | [
"literal.number.change",
"io.output.change",
"identifier.change",
"call.function.change"
] | 736,740 | 736,741 | u242082438 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
sort(V.begin(), V.end());
int sum = V.at(0) / pow(2, N);
for (int i = 0; i < N; i++)
sum += V.at(i) / pow(2, N - i);
cout << setprecision(8) << sum << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
sort(V.begin(), V.end());
double sum = V.at(0) / pow(2, N);
for (int i = 0; i < N; i++)
sum += V.at(i) / pow(2, N - i);
cout << setprecision(8) << sum << ... | [
"variable_declaration.type.primitive.change"
] | 736,744 | 736,745 | u101018317 | cpp |
p02935 | #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;
typ... | #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;
typ... | [
"variable_declaration.type.primitive.change"
] | 736,746 | 736,747 | u981759938 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"variable_declaration.type.primitive.change"
] | 736,759 | 736,760 | u584787460 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n;
int a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double ans = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) {
ans = 1.0 * (a[i] + a[i + 1]) / 2;
a[i + 1] = ans;
}
cout << setpre... | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n;
double a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double ans = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) {
ans = 1.0 * (a[i] + a[i + 1]) / 2;
a[i + 1] = ans;
}
cout << set... | [
"variable_declaration.type.primitive.change",
"io.output.change"
] | 736,769 | 736,770 | u670128805 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n;
int a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double ans = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) {
ans = 1.0 * (a[i] + a[i + 1]) / 2;
a[i + 1] = ans;
}
cout << setpre... | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n;
double a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double ans = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) {
ans = 1.0 * (a[i] + a[i + 1]) / 2;
a[i + 1] = ans;
}
cout << set... | [
"variable_declaration.type.primitive.change"
] | 736,771 | 736,770 | u670128805 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change"
] | 736,774 | 736,775 | u499347398 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vs;
int v;
for (int i = 0; i < N; ++i) {
cin >> v;
vs.push_back(v);
}
sort(vs.begin(),... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vs;
double v;
for (int i = 0; i < N; ++i) {
cin >> v;
vs.push_back(v);
}
sort(vs.be... | [
"variable_declaration.type.primitive.change"
] | 736,780 | 736,781 | u319569229 | cpp |
p02935 | #include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> q;
for (int i = 0; i < n; i++) {
double n;
cin >> n;
q.push(n);
}
while (q.size(... | #include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> q;
for (int i = 0; i < n; i++) {
double n;
cin >> n;
q.push(n);
}
while (q.size(... | [
"variable_declaration.type.primitive.change"
] | 736,782 | 736,783 | u289545075 | cpp |
p02935 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | [
"variable_declaration.type.primitive.change"
] | 736,786 | 736,787 | u237054088 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
int64_t a = 2;
double Z = 0;
for (int i = 1; i < N; i++) {
Z += p.at(i) / a;
a *= 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
int64_t a = 2;
double Z = 0;
for (int i = 0; i < N; i++) {
Z += p.at(i) / a;
a *= 2;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 736,800 | 736,801 | u158290747 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
rep(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
rep(i, n - 1) { v[i + 1] = (v[i] + v[i + 1]) / 2; }
cout << v[n - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<float> v(n, 0);
rep(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
rep(i, n - 1) { v[i + 1] = (v[i] + v[i + 1]) / 2; }
cout << v[n - 1] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 736,804 | 736,805 | u443151804 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double x = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++)
x = (x + v[i]) / 2;
cout << fixed << setprecision(10) << x << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double x = v[0] + v[1];
x /= 2;
for (int i = 2; i < n; i++)
x = (x + v[i]) / 2;
cout << fixed << setprecision(10) << x <... | [] | 736,814 | 736,815 | u261947526 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double x = v[0] + v[1] / 2;
for (int i = 2; i < n; i++)
x = (x + v[i]) / 2;
cout << fixed << setprecision(10) << x << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double x = v[0] + v[1];
x /= 2;
for (int i = 2; i < n; i++)
x = (x + v[i]) / 2;
cout << fixed << setprecision(10) << x <... | [
"expression.operation.binary.change",
"assignment.change"
] | 736,816 | 736,815 | u261947526 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double x = (v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i) {
x = double(x + v[i]) / 2;
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double x = double(v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i) {
x = double(x + v[i]) / ... | [
"call.add"
] | 736,821 | 736,822 | u754114382 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
float accum = 0;
bool flag = true;
std::sort(v.begin(), v.end());
while (flag) {
int first = v.front();
int second = v.at(... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<float> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
float accum = 0;
bool flag = true;
std::sort(v.begin(), v.end());
while (flag) {
float first = v.front();
float second =... | [
"variable_declaration.type.primitive.change",
"call.remove",
"call.arguments.change"
] | 736,825 | 736,824 | u083254278 | cpp |
p02935 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.primitive.change"
] | 736,831 | 736,832 | u914047482 | cpp |
p02935 | #include <bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define N 100005
#define ALL(x) x.begin(), x.end()
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define N 100005
#define ALL(x) x.begin(), x.end()
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); ... | [] | 736,841 | 736,842 | u915287802 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> x(n);
for (int i = 0; i < n; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (int i = 1; i < n; i++) {
for (int j = 0; j < i + 1; j++)
cout << x[j] << endl;
}
double sum = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> x(n);
for (int i = 0; i < n; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (int i = 1; i < n; i++) {
for (int j = 0; j < i + 1; j++)
x[j] /= 2;
}
double sum = 0;
for (int i = 0; i < n; i++)
... | [
"expression.operation.binary.remove"
] | 736,843 | 736,844 | u028906014 | cpp |
p02935 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | [
"type_conversion.add"
] | 736,845 | 736,846 | u293523151 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, max;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
max = v[0];
for (int i = 1; i < n; ++i)
max = (max + v[i]) / 2;
cout << max << '\n';
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
double max;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
max = v[0];
for (int i = 1; i < n; ++i)
max = (max + v[i]) / 2;
cout << max << '\... | [
"variable_declaration.type.change"
] | 736,861 | 736,862 | u722351299 | cpp |
p02935 | #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 n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
int ans = v.at(0);
rep(i, n - 1) ans = (ans + v.at(i + 1))... | #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 n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
double ans = v.at(0);
rep(i, n - 1) ans = (ans + v.at(i + ... | [
"variable_declaration.type.primitive.change"
] | 736,870 | 736,871 | u297398560 | cpp |
p02935 | #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 n;
vector<double> v(n);
rep(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
int ans = v.at(0);
rep(i, n - 1) ans = (ans + v.at(i + 1)) / 2;
cout... | #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 n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
double ans = v.at(0);
rep(i, n - 1) ans = (ans + v.at(i + ... | [
"variable_declaration.type.primitive.change"
] | 736,872 | 736,871 | u297398560 | cpp |
p02935 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<double> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
while (v.size() > 1) {
sort(v.begin(), v.end());
int a ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<double> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
while (v.size() > 1) {
sort(v.begin(), v.end());
double... | [
"variable_declaration.type.primitive.change"
] | 736,876 | 736,877 | u489302942 | 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];
}
for (int i = 0; i < n - 1; i++)
for (int j = 1; j < n; j++) {
if (a[i] > a[j]) {
float t;
t = a[i];
a[i] = a[j];
a[j] = t;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++)
for (int j = i; j < n; j++) {
if (a[i] > a[j]) {
float t;
t = a[i];
a[i] = a[j];
a[j] = t;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 736,882 | 736,883 | u294547216 | 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];
}
for (int i = 0; i < n - 1; i++)
for (int j = 1; j < n; j++) {
if (a[i] > a[j]) {
float t;
t = a[i];
a[i] = a[j];
a[j] = t;
... | #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];
}
for (int i = 0; i < n - 1; i++)
for (int j = i; j < n; j++) {
if (a[i] > a[j]) {
double t;
t = a[i];
a[i] = a[j];
a[j] = t;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 736,882 | 736,884 | u294547216 | cpp |
p02935 | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout ... | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout ... | [
"identifier.change",
"expression.operation.binary.change"
] | 736,885 | 736,886 | u043964516 | cpp |
p02935 | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout ... | #pragma once
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout ... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"expression.operation.binary.change"
] | 736,887 | 736,886 | u043964516 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 736,888 | 736,889 | u420130252 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double ans = 0;
ans = v.at(0) * pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double ans = 0;
ans = v.at(0) / pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans <... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,890 | 736,891 | u553183019 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double ans = 0;
ans = v.at(0) * pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
double ans = 0;
ans = v.at(0) / pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans <... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 736,892 | 736,891 | u553183019 | 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());
int ans = 0;
ans += v[0] / pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = 0;
ans += v[0] / pow(2, n - 1);
for (int i = 1; i < n; i++) {
ans += v[i] / pow(2, n - i);
}
cout << ans << en... | [
"variable_declaration.type.primitive.change"
] | 736,896 | 736,897 | u265359795 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
for (int i = 0; i < N - 1; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
cout << v[N - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
for (int i = 0; i < N - 1; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
cout << v[N - 1];
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 736,906 | 736,907 | u109191542 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int ans = a[0];
for (int i = 1; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
float ans = a[0];
for (int i = 1; i < n; i++) {
ans = (ans + a[i]) * 1.0 / 2;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 736,916 | 736,917 | u127438619 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int ans = a[0];
for (int i = 1; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
float a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
float ans = a[0];
for (int i = 1; i < n; i++) {
ans = (ans + a[i]) * 1.0 / 2;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 736,916 | 736,918 | u127438619 | cpp |
p02935 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | [] | 736,928 | 736,929 | u047655753 | cpp |
p02935 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, res;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
res = v.at(0);
for (int i = 1; i < n; i++) {
res = (res + v.at(i)) / 2;
}
cout <... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
double res;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
res = v.at(0);
for (int i = 1; i < n; i++) {
res = (res + v.at(i)) / 2.;
... | [
"variable_declaration.type.change"
] | 736,940 | 736,941 | u353748264 | cpp |
p02935 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;... | [
"variable_declaration.type.change"
] | 736,950 | 736,951 | u143100985 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
double ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
double ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2.0;
}
cout <... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 736,955 | 736,956 | u787005274 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
int ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
double ans = (v[0] + v[1]) / 2.0;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2.0;
}
cout <... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 736,957 | 736,956 | u787005274 | cpp |
p02935 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vll = V<ll>;
using VVll = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
usin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vll = V<ll>;
using VVll = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
usin... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,958 | 736,959 | u868099754 | cpp |
p02935 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vll = V<ll>;
using VVll = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
usin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vll = V<ll>;
using VVll = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
usin... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 736,960 | 736,959 | u868099754 | cpp |
p02935 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int... | [] | 736,969 | 736,970 | u452512115 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | [
"variable_declaration.type.primitive.change",
"call.add"
] | 736,971 | 736,972 | u115838990 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> u(N);
for (int i = 0; i < N; i++)
cin >> u.at(i);
sort(u.begin(), u.end());
int sum = u.at(0);
for (int i = 1; i < N; i++)
sum = (sum + u.at(i)) / 2;
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> u(N);
for (int i = 0; i < N; i++)
cin >> u.at(i);
sort(u.begin(), u.end());
double sum = u.at(0);
for (int i = 1; i < N; i++)
sum = (sum + u.at(i)) / 2;
cout << sum << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 736,973 | 736,974 | u620626180 | cpp |
p02935 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <float.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF 1e9
#... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <float.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF 1e9
#... | [
"expression.operation.binary.add"
] | 736,975 | 736,976 | u516525290 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2;
// double ans = 0;
if (n == 2) {
cout << ans;
} else {
for (int i = 2; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2;
// double ans = 0;
if (n == 2) {
cout << ans;
} else {
for (int i = 2; i < n; i++) ... | [] | 736,977 | 736,978 | u934529721 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<float> v(n);
for (float &i : v)
cin >> i;
sort(v.begin(), v.end());
n--;
while (n--) {
float k = v[v.size() - 1] + v[v.size() - 2];
k /= 2.0;
v.pop_back();
v.pop_back();
v.push_back(k);
sort(v.b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<float> v(n);
for (float &i : v)
cin >> i;
sort(v.rbegin(), v.rend());
n--;
while (n--) {
float k = v[v.size() - 1] + v[v.size() - 2];
k /= 2.0;
v.pop_back();
v.pop_back();
v.push_back(k);
sort(v... | [
"call.function.change",
"call.arguments.change"
] | 736,981 | 736,982 | u767871438 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (size_t i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ave = 0;
av... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (size_t i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ave = 0;
... | [
"variable_declaration.type.primitive.change"
] | 736,983 | 736,984 | u696988954 | cpp |
p02935 | #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using namespa... | #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using namespa... | [
"variable_declaration.type.primitive.change"
] | 736,985 | 736,986 | u954176652 | 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++) {
int v;
cin >> v;
V.at(i) = v;
}
sort(V.begin(), V.end());
int ans = V.at(0);
for (int i = 1; i < N; i++) {
ans = (ans + V.at(i)) / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
int v;
cin >> v;
V.at(i) = v;
}
sort(V.begin(), V.end());
double ans = V.at(0);
for (int i = 1; i < N; i++) {
ans = (ans + V.at(i)) / 2;
}
cout << ans << endl;... | [
"variable_declaration.type.primitive.change"
] | 736,987 | 736,988 | u536916602 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, tmp;
priority_queue<int, vector<int>, greater<int>> queue;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> tmp;
queue.push(tmp * 100000);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, tmp;
priority_queue<int, vector<int>, greater<int>> queue;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> tmp;
queue.push(tmp * 100000);
... | [
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 736,996 | 736,997 | u280097533 | cpp |
p02935 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, i, j;
ll a, b;
double c;
cin >> n;
priority_queue<double, vector<double>, greater<double>> q;
for (i = 0; i < n; i++) {... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, i, j;
double a, b;
double c;
cin >> n;
priority_queue<double, vector<double>, greater<double>> q;
for (i = 0; i < n; i+... | [
"variable_declaration.type.change"
] | 737,000 | 737,001 | u716242664 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
std::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 - 1] + v[i]) / 2;
}
cout << v[n - 1] << endl;
re... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<float> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (int i = 1; i < n; i++) {
v[i] = (v[i - 1] + v[i]) / 2;
}
cout << v[n - 1] << endl;
... | [
"variable_declaration.type.primitive.change"
] | 737,004 | 737,005 | u420421811 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
int ans = (ar[0] + ar[1]) / 2;
for (int i = 2; i < n; i++)
ans = (ans + ar[i]) / 2;
co... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
float ans = (ar[0] + ar[1]) / 2.0;
for (int i = 2; i < n; i++)
ans = (ans + ar[i]) / 2.0;... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 737,006 | 737,007 | u773406543 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(0);
for (int i = 1; i < n; i++) {
ans... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(0);
for (int i = 1; i < n; i++) {
ans... | [
"call.arguments.add"
] | 737,017 | 737,018 | u648009244 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(1);
for (int i = 1; i < n; i++) {
ans... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(0);
for (int i = 1; i < n; i++) {
ans... | [
"literal.number.change",
"call.arguments.change",
"call.remove",
"call.arguments.add"
] | 737,019 | 737,018 | u648009244 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(1);
for (int i = 1; i < n; i++) {
ans... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v.at(0);
for (int i = 1; i < n; i++) {
ans... | [
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 737,020 | 737,018 | u648009244 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
ll ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
printf("%.10... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
printf("... | [
"variable_declaration.type.change"
] | 737,027 | 737,028 | u147556624 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
double result = 0;
for (int i = n - 1; i > 0; i--) {
sort(v.rbegin(), v.rend());
result = v.at... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
int main() {
int n;
cin >> n;
vector<double> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
double result = 0;
for (int i = n - 1; i > 0; i--) {
sort(v.rbegin(), v.rend());
result = v... | [
"variable_declaration.type.primitive.change"
] | 737,029 | 737,030 | u820925909 | 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());
int ans = v[0];
for (int i = 1; i < N; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < N; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 737,037 | 737,038 | u584139221 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v(n);
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
sort(v.begin(), v.end());
int ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v(n);
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2.0;
}
printf("%lf\n", ans);
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,039 | 737,040 | u224590796 | cpp |
p02935 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> _v(N);
auto *const v = &_v[0];
for (int i = 0; i < N; ++i)
cin >> v[i];
sort(v, v + N);
double den = 2.;
double sum = 0.;
for (int i = N - 1; 1 <= i; --i) {
v[i] /= den;
... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> _v(N);
auto *const v = &_v[0];
for (int i = 0; i < N; ++i)
cin >> v[i];
sort(v, v + N);
double den = 2.;
double sum = 0.;
for (int i = N - 1; 1 <= i; --i) {
v[i] /= de... | [
"variable_declaration.type.primitive.change"
] | 737,041 | 737,042 | u673513296 | 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());
int ans = v[0];
for (int i = 1; i < n; ++i)
ans = (ans + v[i]) / 2;
printf("%.8f", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; ++i)
ans = (ans + v[i]) / 2;
printf("%.8f", ans);
}
| [
"variable_declaration.type.primitive.change"
] | 737,082 | 737,083 | u458187055 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
double ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i)
ans = (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
double ans = (double)(v[0] + v[1]) / 2;
for (int i = 2; i < n; ++i)
... | [
"type_conversion.add"
] | 737,093 | 737,094 | u386131832 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double temp = 0;
for (int i = 0; i < n - 1; i++) {
temp = (double)(v[i] + v[i + 1]) / 2;
v[i + 1] = temp;
}
cout << temp;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double temp = 0;
for (int i = 0; i < n - 1; i++) {
temp = (v[i] + v[i + 1]) / 2;
v[i + 1] = temp;
}
cout << temp;
}
| [
"variable_declaration.type.primitive.change"
] | 737,108 | 737,109 | u523261038 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| [] | 737,112 | 737,113 | u882039496 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 737,116 | 737,113 | u882039496 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
ans = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++) {
ans = (ans + v[i]) / 2.0;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,129 | 737,130 | u544165468 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int t = 0; t < n; t++) {
cin >> vec.at(t);
}
sort(vec.begin(), vec.end());
int ans = vec.at(0);
for (int i = 0; i < n - 1; i++) {
ans = ans + vec.at(i + 1);
ans /= 2;
}
cout << ans << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int t = 0; t < n; t++) {
cin >> vec.at(t);
}
sort(vec.begin(), vec.end());
double ans = vec.at(0);
for (int i = 0; i < n - 1; i++) {
ans += vec.at(i + 1);
ans /= 2;
}
cout << ans << endl... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 737,131 | 737,132 | u371051907 | 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());
int ans;
ans = v[0];
for (int i = 1; i < N; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans;
ans = v[0];
for (int i = 1; i < N; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 737,133 | 737,134 | u231455327 | cpp |
p02935 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define TR(container, it) \
for (auto it... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define TR(container, it) \
for (auto it... | [
"identifier.change",
"expression.operation.binary.change"
] | 737,146 | 737,147 | u093219895 | cpp |
p02935 | #include <algorithm>
#include <bits/stdc++.h>
// #include <cstdio>
// #include <iomanip>
// #include <iostream>
// #include <queue>
#include <cstdio>
#include <queue>
// 3
// 500 300 200
using namespace std;
int main() {
int n;
scanf("%d", &n);
std::priority_queue<float, std::vector<float>, std::greater<float... | #include <algorithm>
#include <bits/stdc++.h>
// #include <cstdio>
// #include <iomanip>
// #include <iostream>
// #include <queue>
#include <cstdio>
#include <queue>
// 3
// 500 300 200
using namespace std;
int main() {
int n;
scanf("%d", &n);
std::priority_queue<float, std::vector<float>, std::greater<float... | [
"variable_declaration.type.primitive.change"
] | 737,154 | 737,155 | u006576567 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v... | [
"variable_declaration.type.primitive.change"
] | 737,156 | 737,157 | u732817215 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
priority_queue<double, vector<double>, greater<double>> q;
int v;
for (int i = 0; i < N; i++) {
cin >> v;
q.push(v);
}
int top1, top2;
for (int i = 0; i < N - 1; i++) {
top1 = q.top();
q.pop();
top2 = q.to... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
priority_queue<double, vector<double>, greater<double>> q;
int v;
for (int i = 0; i < N; i++) {
cin >> v;
q.push(v);
}
double top1, top2;
for (int i = 0; i < N - 1; i++) {
top1 = q.top();
q.pop();
top2 = q... | [
"variable_declaration.type.primitive.change"
] | 737,162 | 737,163 | u182310429 | cpp |
p02935 | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); ... | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 737,172 | 737,173 | u433132072 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double make;
vector<int> rare(N);
for (int i = 0; i < N; i++) {
cin >> rare.at(i);
}
for (int i = 0; i < N - 1; i++) {
sort(rare.begin(), rare.end());
make = (rare.at(0) + rare.at(1)) / 2;
rare.push_back(make);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double make;
vector<double> rare(N);
for (int i = 0; i < N; i++) {
cin >> rare.at(i);
}
for (int i = 0; i < N - 1; i++) {
sort(rare.begin(), rare.end());
make = (double)(rare.at(0) + rare.at(1)) / 2;
rare.push_ba... | [
"variable_declaration.type.primitive.change"
] | 737,176 | 737,177 | u525502670 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 55;
int n, a[N];
double ans;
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
sort(a + 1, a + n + 1);
ans = (a[1] + a[2]) / 2;
rep(i, 3, n) ans = (ans + a[i]) / 2;
cout << ans << endl;
return 0;... | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 55;
double n, a[N];
double ans;
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
sort(a + 1, a + (int)n + 1);
ans = (a[1] + a[2]) / 2;
rep(i, 3, n) ans = (ans + a[i]) / 2;
cout << ans << endl;
r... | [
"variable_declaration.type.primitive.change"
] | 737,186 | 737,187 | u299994354 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
for (int k = 0; k < N - 1; k++) {
A[k + 1] = (A[k] + A[k + 1]) / 2;
}
cout << A[N - 1] << 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[i];
sort(A.begin(), A.end());
for (int k = 0; k < N - 1; k++) {
A[k + 1] = (A[k] + A[k + 1]) / 2;
}
cout << A[N - 1] << endl;
} | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 737,190 | 737,191 | u001858868 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
for (int k = 0; k < N; k++) {
A[k + 1] = (A[k] + A[k + 1]) / 2;
}
cout << A[N - 1] << 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[i];
sort(A.begin(), A.end());
for (int k = 0; k < N - 1; k++) {
A[k + 1] = (A[k] + A[k + 1]) / 2;
}
cout << A[N - 1] << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 737,192 | 737,191 | u001858868 | cpp |
p02935 | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::priority_queue<float, std::vector<float>, std::greater<float>> que;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
que.push(v);
}... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::priority_queue<double, std::vector<double>, std::greater<double>> que;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
que.push(v);
... | [
"variable_declaration.type.primitive.change"
] | 737,193 | 737,194 | u909162870 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
long long M = max(a, b), m = min(a, b);
while (m != 0) {
long long r = M % m;
M = m;
m = r;
}
return M;
}
int digit_sum(long long n) {
long long ans;
while (n != 0) {
ans += n % 10;
n /= 10;
}
return ... | [
"variable_declaration.type.primitive.change"
] | 737,195 | 737,196 | u522993719 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.