| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1172463 | whatisdp | Best Place (NOI17_bestplace) | C++17 | 46 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;cin>>n;
unsigned long long sx=0,sy=0;
for(int i=0;i<n;i++) {
unsigned long long x,y;cin>>x>>y;
sx+=x,sy+=y;
}
cout<<sx/n<<' '<<sy/n;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
