#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int main()
{
//freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;
cin >> n;
vector <pair <ll, ll> > ans; ans.clear();
ll l = 1, r = 0, sum = 0;
while (r <= 500000000)
{
while (sum > n) sum -= l++;
if (sum == n && l != r) ans.pb({l, r});
sum += ++r;
}
for (auto it : ans) cout << it.F << " " << it.S << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
564 ms |
504 KB |
Output is correct |
2 |
Correct |
583 ms |
504 KB |
Output is correct |
3 |
Correct |
579 ms |
376 KB |
Output is correct |
4 |
Correct |
584 ms |
384 KB |
Output is correct |
5 |
Correct |
572 ms |
380 KB |
Output is correct |
6 |
Correct |
578 ms |
504 KB |
Output is correct |
7 |
Correct |
591 ms |
504 KB |
Output is correct |
8 |
Correct |
595 ms |
384 KB |
Output is correct |
9 |
Correct |
586 ms |
504 KB |
Output is correct |
10 |
Incorrect |
589 ms |
504 KB |
Output isn't correct |