Pagini recente » Cod sursa (job #2253804) | Cod sursa (job #2885236) | Cod sursa (job #2686433) | Cod sursa (job #1018852) | Cod sursa (job #2394752)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("consecutive.in");
ofstream g("consecutive.out");
long long t,n,nr,i,a;
vector < pair<long long,long long> >v;
int main()
{
f>>t;
while(t--)
{
f>>n;
nr=0;
for(i=1;i*(i+1)<2*n;i++)
{
if((2*n-i*(i+1))%(2*(i+1))==0)
{
nr++;
a=(2*n-i*(i+1))/(2*(i+1));
v.push_back({a,a+i});
}
}
g<<nr<<"\n";
for(i=0;i<v.size();i++)
{
g<<v[i].first<<" "<<v[i].second<<"\n";
}
}
return 0;
}