Pagini recente » Cod sursa (job #2192296) | Cod sursa (job #1622893) | Cod sursa (job #491888) | Cod sursa (job #1329149) | Cod sursa (job #1773633)
#include <stdio.h>
#include <vector>
using namespace std;
int n,t;
vector<pair<int,int> > S;
void rez(int n)
{
int i=1,a;
S.clear();
while (true)
{
i++;
a=n-i*(i+1)/2;
if (a<0) break;
if (a%i==0)
{
a/=i;
S.push_back(make_pair(a+1,a+i));
}
}
printf("%i",S.size());
for (i=0;i<S.size();i++)
printf("\n%i %i",S[i].first,S[i].second);
printf("\n");
}
int main()
{
freopen ("consecutive.in","r",stdin);
freopen ("consecutive.out","w",stdout);
scanf("%i",&t);
while (t--)
{
scanf("%i",&n);
rez(n);
}
return 0;
}