Cod sursa(job #3302388)
| Utilizator | Data | 7 iulie 2025 11:41:17 | |
|---|---|---|---|
| Problema | Consecutive | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva ICPC | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin("consecutive.in");
ofstream cout("consecutive.out");
long long v1[100005],v2[100005],k;
int main()
{
long long t,n;
cin>>t;
while(t--)
{
cin>>n;
long long adv;
k=0;
for(long long i=2;i*i<=2*n;i++)
{
adv=(2*n-i*i+i)%(2*i);
if(adv==0)
{
v1[++k]=(2*n-i*i+i)/(2*i);
v2[k]=(2*n-i*i+i)/(2*i)+i-1;
}
}
cout<<k<<"\n";
for(long long i=1;i<=k;i++)
cout<<v1[i]<<" "<<v2[i]<<"\n";
}
return 0;
}