Pagini recente » Cod sursa (job #1145433) | Cod sursa (job #1140046) | Cod sursa (job #1058236) | Cod sursa (job #1517616) | Cod sursa (job #1716122)
#include <fstream>
#include <cmath>
using namespace std;
int a[1000], b[1000];
int main()
{
int t, nr, i, j;
long long n;
ifstream cin ("consecutive.in");
ofstream cout ("consecutive.out");
cin >> t;
for (i = 0; i < t; ++i){
cin >> n;
nr = 0;
for (j = 1; (2 * n - j * j - j) >= (2 * j + 2); ++j){
if ((2 * n) % (j + 1) == 0 && (2 * n - j * j - j) % (2 * j + 2) == 0){
++nr;
a[nr] = (2 * n - j * j - j) / (2 * j + 2);
b[nr] = a[nr] + j;
}
}
cout << nr << "\n";
for (j = 1; j <= nr; ++j){
cout << a[j] << " " << b[j] << "\n";
}
}
return 0;
}