Pagini recente » Cod sursa (job #2236970) | Cod sursa (job #1151926) | Cod sursa (job #302463) | Cod sursa (job #737822) | Cod sursa (job #1709060)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
long long n,i,j;
vector <long long> inceput;
vector <long long> finall;
int T;
int main()
{
fin>>T;
for(j=1;j<=T;j++)
{
fin>>n;
for(i=2;(i*i)/2<=n;i++)
{
if(i%2)
{
if(n%i==0 && n/i-i/2>0)
{
inceput.push_back(n/i-i/2);
finall.push_back(n/i+i/2);
}
}
else
{
if(n%i==i/2 && n/i-i/2>=0)
{
inceput.push_back(n/i-i/2+1);
finall.push_back(n/i+i/2);
}
}
}
fout<<inceput.size()<<"\n";
for(i=0;i<inceput.size();i++)
{
fout<<inceput[i]<<" "<<finall[i]<<"\n";
}
inceput.clear();
finall.clear();
}
}