#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
ll n; cin >> n;
ll k = n/2+1;
vector<ll> table(k+1);
table[1] = 1;
for(ll i = 2; i <= k; i++){
if(table[i-1] == n){
cout << 1 <<" "<< i-1 <<"\n";
}
table[i] = ((i*(i+1))/2);
}
ll pos = upper_bound(table.begin(), table.end(), n) - table.begin();
for(ll i = pos; i <= k; i++){
if(binary_search(table.begin(), table.end(), table[i]-n)){
cout << lower_bound(table.begin(), table.end(), table[i]-n)-table.begin()+1 <<" "<< i <<"\n";
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
3 ms |
596 KB |
Output is correct |
5 |
Correct |
6 ms |
1108 KB |
Output is correct |
6 |
Correct |
53 ms |
8148 KB |
Output is correct |
7 |
Correct |
278 ms |
39380 KB |
Output is correct |
8 |
Runtime error |
30 ms |
65536 KB |
Execution killed with signal 9 |
9 |
Runtime error |
30 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Runtime error |
2 ms |
468 KB |
Execution killed with signal 6 |