Pagini recente » Cod sursa (job #3295813) | Cod sursa (job #3298248) | Cod sursa (job #1481013) | Cod sursa (job #2257985) | Cod sursa (job #3297694)
#include <bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
long long test,n[51];
long long k;
// n = (p + p + k - 1) * k / 2
// 2 * n =
int main()
{
fin>>test;
for(int i=1;i<=test;i++){
fin>>n[i];
int x=sqrt(2 * n[i]);
int counter = 0;
for(k=2;k<=x;k++)
{
if((2*n[i])%k==0)
if(((2*n[i])/k-k+1)%2==0)
counter += 1;
}
fout << counter << "\n";
for(k=2;k<=x;k++)
{
if((2*n[i])%k==0)
if(((2*n[i])/k-k+1)%2==0)
fout<<((2*n[i])/k-k+1)/2<<" "<<((2*n[i])/k-k+1)/2 + k - 1<<endl;
}}
return 0;
}