# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146951 | ronaldo_k | Prosjek (COCI18_prosjek) | C++14 | 2 ms | 380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
const int MAXN = 30;
int n;
double v[MAXN];
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%lf", &v[i]);
}
sort(v, v + n);
for(int i = 1; i < n; i++) {
v[i] = (v[i] + v[i-1])/2;
}
printf("%.6lf\n", v[n-1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |