| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 479314 | PaNz3r | Best Place (NOI17_bestplace) | C++14 | 86 ms | 2976 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 <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
std::vector<int> x(n);
std::vector<int> y(n);
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
}
int x_s=0;
int y_s=0;
for(auto a: x) x_s=x_s+a;
for(auto a: y) y_s=y_s+a;
cout<<x_s/n<<" "<<y_s/n<<endl;
}
| # | 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... | ||||
