Pagini recente » Cod sursa (job #2345884) | Cod sursa (job #1232101) | Cod sursa (job #796359) | Cod sursa (job #2526807) | Cod sursa (job #2347561)
#include <fstream>
#define nmax 100002
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
long long sol[nmax],sol1[nmax];
int c=0;
int main()
{
long long n;
int t;
fin>>t;
for(int i=1;i<=t;i++)
{
c=0;
fin>>n;
for(int j=1;j*j<=2*n;j++)
if((2*n)%(j+1)==0&&((2*n)/(j+1)-j)%2==0)
if(((2*n)/(j+1)-j)/2!=0)
{
sol[++c]=((2*n)/(j+1)-j)/2;
sol1[c]=sol[c]+j;
}
fout<<c<<"\n";
for(int j=1;j<=c;j++)
fout<<sol[j]<<" "<<sol1[j]<<"\n";
}
return 0;
}