# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
87828 | 2018-12-02T17:19:27 Z | AntonioDaki | Prosjek (COCI18_prosjek) | C++14 | 3 ms | 708 KB |
#include<bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, x[22]; double m; cin >> n; for(int i = 0; i < n; ++i) cin >> x[i]; sort(x, x + n); m = x[0]; for(int i = 1; i < n; ++i) m = (m + x[i]) / 2; cout << m; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 276 KB | Output is correct |
2 | Correct | 2 ms | 428 KB | Output is correct |
3 | Correct | 2 ms | 576 KB | Output is correct |
4 | Correct | 2 ms | 656 KB | Output is correct |
5 | Correct | 2 ms | 656 KB | Output is correct |
6 | Correct | 2 ms | 656 KB | Output is correct |
7 | Correct | 2 ms | 656 KB | Output is correct |
8 | Correct | 2 ms | 656 KB | Output is correct |
9 | Correct | 2 ms | 656 KB | Output is correct |
10 | Correct | 2 ms | 708 KB | Output is correct |