#include <bits/stdc++.h>
using namespace std;
#define ll long long int
// Added
#define True true
#define False false
#define endl "\n"
void solve() {
ll n;
cin >> n;
vector<pair<ll, ll>> co(n);
for (ll i = 0; i < n; ++i) cin >> co[i].first >> co[i].second;
ll tx = 0, ty = 0;
for (ll i = 0; i < n; ++i) {
tx += co[i].first;
ty += co[i].second;
}
cout << tx/n << " " << ty/n << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
// int t;
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
1868 KB |
Output is correct |
2 |
Incorrect |
15 ms |
3020 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
20 ms |
1868 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |