Pagini recente » Cod sursa (job #41032) | Cod sursa (job #2093251) | Cod sursa (job #2868364) | Cod sursa (job #1602638) | Cod sursa (job #1709163)
#include <bits/stdc++.h>
using namespace std;
int A[100100], B[100100];
int nr;
int main()
{
freopen("consecutive.in","r",stdin);
freopen("consecutive.out","w",stdout);
int T;
scanf("%d", &T);
while(T--)
{
int n;
scanf("%d", &n);
nr = 0;
for(long long l = 2; ;l++)
{
long long ll = l*(l - 1)/2;
if (ll + l > n) break;
int m = n - ll;
if (m % l) continue;
int a = m / l;
A[++nr] = a;
B[nr] = a + l - 1;
}
cout << nr << '\n';
for(int i = 1; i <= nr; i++) {
cout << A[i] << ' ' << B[i] << '\n';
}
}
return 0;
}