# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011248 | sleepntsheep | Mean (info1cup19_mean) | C11 | 0 ms | 344 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>
int main() {
int n, a[205];
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
for (int i = 1; i < n; ++i)
for (int j = 1; j < n; ++j)
if (a[j] < a[j - 1]) a[200] = a[j], a[j] = a[j - 1], a[j - 1] = a[200];
for (int i = 1; i < n; ++i)
a[0] = (a[0] + a[i]) / 2;
printf("%d", a[0]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |