/**
* Author: grimzzz-404
**/
#include <bits/stdc++.h>
using namespace std;
#define FOR(x) for (int i = 0; i < (x); ++i)
#define FOR_(x,y) for (int i = (x); i < (y); ++i)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define vi vector<int>
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define p push
#define pp pop
#define mp make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size
#define endl '\n'
void solve();
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
FOR(t)
{
//cout << "Test Case #" << i + 1 << '\n';
solve();
}
return 0;
}
void solve()
{
int n;
cin >> n;
int one,two;
int ans = 0, ans1 = 0;
for (int i = 0; i < n; i++)
{
cin >> one >> two;
ans+=one;
ans1+=two;
}
//bug
cout << ceil(ans/n) << " " << ceil(ans1/n);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Expected integer, but "5e+08" found |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Expected integer, but "1.99085e+06" found |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
27 ms |
380 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |