/*
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
| / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ |
|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|
| / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ |
|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|
| \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / |
|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|
| \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
| / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ |
|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|
| / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ |
|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|
| \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / |
|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|\ \ | / /|
| \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / | \ \|/ / |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;
template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
ll n;
/*
(r - l + 1)(l + r) = 2 * n
r - l + 1 = x
l + r = y
2 * r + 1 = x + y
r = (x + y - 1) / 2
l = y - r
*/
int main() {
ll m;
#ifdef LOCAL
freopen("input.INP", "r", stdin);
#endif // LOCAL
cin.tie(0) -> sync_with_stdio(0);
cout.tie(0);
cin >> n;
m = n << 1;
for (ll x = 1, y, l, r; x * x <= m; ++x) {
if (m % x)
continue;
y = m / x;
r = x + y - 1;
if (r < 0 || (r & 1))
continue;
r >>= 1;
l = y - r;
if (0 < l && l < r)
cout << l << ' ' << r << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
320 KB |
Output is correct |
