Pagini recente » Cod sursa (job #1496870) | Cod sursa (job #4405) | Cod sursa (job #2136099) | Cod sursa (job #2112685) | Cod sursa (job #2047822)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("consecutive.in");
ofstream g("consecutive.out");
long long T,n,k,i,nrsol,t,sol[2][100001];
int main()
{
f>>T>>n;
for(t=1;t<=T;t++){
for(k=2;k<=sqrt(2*n);k++)
{
if(((2*n+k-k*k)%(2*k)==0)&&((2*n+k-k*k)/(2*k)>0)){
sol[0][++nrsol]=(2*n+k-k*k)/(2*k);
sol[1][nrsol]=sol[0][nrsol]+k-1;
}
}
g<<nrsol<<'\n';
for(i=1;i<=nrsol;i++)
g<<sol[0][i]<<" "<<sol[1][i]<<'\n';
}
return 0;
}