#include <bits/stdc++.h>
using namespace std;
long long n,x,y;
/*
thinking...
6
1 0
3 0
5 0
7 0
9 0
11 0
to find x,y
we can do it by MEAN!
*/
long long sx;
long long sy;
int main()
{
cin>>n;
for(long long i =0;i<n;++i){
cin>>x>>y;
sx+=x;
sy+=y;
}
cout<<abs(sx/n)<<" "<<abs(sy/n);
}
//LunchBox:-
/*
int n,m;
int a[60001];
int main(){
cin>>n>>m;
for(int i=1;i<=m;++i){
cin>>a[i-1];
}
sort(a+0,a+m+1);
int s=0,t=0;
for(int i=0;i<m+1;++i)
{
if(s==m or s>m){
break;
}else{
s+=a[i];
t++;
}
}
cout<<t;
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 |
0 ms |
204 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 |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
204 KB |
Output is correct |
2 |
Incorrect |
49 ms |
204 KB |
Output isn't correct |
3 |
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 |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
72 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |