| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 161445 | boolodifjenula | Prosjek (COCI18_prosjek) | Cpython 3 | 27 ms | 3664 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.
n=int(input())
L=[int(input()) for i in range (n)]
L.sort()
while len(L)!=1:
L.insert(0,(L.pop(0)+L.pop(0))/2)
print(L[0])
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||