This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author : pham van sam
* created : 28 August 2023 (Monday)
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void you_make_it(void) {
int k, n = 1; cin >> k;
for (int i = 1; 1LL * i * (i + 1) <= 2LL * k; ++i) {
n = i;
}
int diff = k - 1LL * n * (n + 1) / 2;
cout << n + 1 + (diff > 0) << '\n';
for (int i = 0; i <= n; ++i) {
cout << i << " " << i - 1 << '\n';
}
if(diff > 0) {
cout << n + 1 << " " << diff - 1 << '\n';
}
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
auto start_time = chrono::steady_clock::now();
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
you_make_it();
auto end_time = chrono::steady_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |