#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define size size()
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
int a[n],b[n];
for (int i = 0; i < n; ++i) {
cin>>a[i]>>b[i];
}
int x = 0, y= 0;
for (int i = 0; i < n; ++i) {
x += a[i];
y+= b[i];
}
x = x / n;
y = y / n;
cout<<x<<" "<<y<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
1876 KB |
Output is correct |
2 |
Incorrect |
18 ms |
3056 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
21 ms |
1748 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |