This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int k,n,t[100005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> k;
while (k != 0)
{
n++;
if (n == 1)
t[1] = -1;
else
{
k -= (n - 1);
if (k >= 0)
t[n] = n - 1;
else
{
k += (n - 1);
t[n] = k + 1;
k = 0;
}
}
}
if (n > 0)
{
cout << n << '\n';
for (int i = 1; i <= n; i++)
cout << i - 1 << ' ' << t[i] << '\n';
}
else
{
cout << 1 << '\n' << 0 << ' ' << -1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |