Pagini recente » Cod sursa (job #1032700) | Cod sursa (job #2449290) | Cod sursa (job #356882) | Cod sursa (job #1698553) | Cod sursa (job #1709517)
#include<fstream>
using namespace std;
ifstream f ("consecutive.in");
ofstream g ("consecutive.out");
long long t,i,nr,x,k,j,a[1000000],b[1000000],n;
int main()
{
f>>t;
for(i=1;i<=t;i++){
f>>nr;
k=0;
x=2;
while((2*nr-x*(x-1))/(2*x)>=1){
n=(2*nr-x*(x-1))/(2*x);
if(x*n+x*(x-1)/2==nr){
k++;
a[k]=n;
b[k]=n+x-1;
}
x++;
}
if(k==0) g<<0;
else{
g<<k<<'\n';
for(j=1;j<=k;j++){
g<<a[j]<<" "<<b[j]<<'\n';
}
}
}
return 0;
}