Pagini recente » Cod sursa (job #2521643) | Cod sursa (job #2914154) | Cod sursa (job #2572042) | Cod sursa (job #2097664) | Cod sursa (job #1713000)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
int n,i,t,x,k,r,j,sol,suma,nr1,nr2;
struct vct{
int v1,v2;
}v[100001];
bool comp(vct a, vct b)
{
return a.v1>b.v1;
}
int main()
{
fin>>t;
for(k=1;k<=t;++k)
{
nr1=0;
fin>>x;
for(i=2;i*(i+1)<=2*x;++i)
{
if((x-((i-1)*i/2))%i==0) v[++nr1].v1=(x-((i-1)*i/2))/i, v[nr1].v2=v[nr1].v1+i-1;
}
fout<<nr1<<"\n";
for(i=1;i<=nr1;++i)
fout<<v[i].v1<<" "<<v[i].v2<<"\n";
}
return 0;
}