Pagini recente » Cod sursa (job #623779) | Cod sursa (job #1426563) | Cod sursa (job #2427458) | Cod sursa (job #2881996) | Cod sursa (job #2659993)
#include <fstream>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
long long int rez[100001][5];
int main()
{
long long int n,t,suma,secv,i;
int j,teste;
fin>>teste;
for(j=1;j<=teste;j++)
{
secv=0;
fin>>n;
if(n==1)
{fout<<1<<'\n'<<0<<' '<<1<<'\n';
return 0;
}
suma=1;
for(i=2;suma<n;i++)
{
suma=suma+i;
if((n-suma)%i==0&&suma<=n)
{
t=(n-suma)/i;
secv++;
rez[secv][1]=t+1;
rez[secv][2]=t+i;
}
}
fout<<secv<<'\n';
for(i=1;i<=secv;i++)
fout<<rez[i][1]<<' '<<rez[i][2]<<'\n';
}
return 0;
}