Cod sursa(job #1710315)
| Utilizator | Data | 28 mai 2016 19:41:51 | |
|---|---|---|---|
| Problema | Consecutive | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva ICPC | Marime | 0.63 kb |
#include <cstdio>
#define MAXN 65536
int v[2][MAXN];
int main(){
FILE*fi,*fout;
int m,i,t,n;
long long l;
fi=fopen("consecutive.in" ,"r");
fout=fopen("consecutive.out" ,"w");
fscanf(fi,"%d" ,&t);
while(t>0){
t--;
fscanf(fi,"%d" ,&n);
l=2;
m=0;
while((l*(l+1))/2<=n){
if((n-(l*(l+1))/2)%l==0){
v[0][m]=(n-(l*(l+1))/2)/l+1;
v[1][m]=v[0][m]+l-1;
m++;
}
l++;
}
fprintf(fout,"%d\n" ,m);
for(i=0;i<m;i++)
fprintf(fout,"%d %d\n" ,v[0][i],v[1][i]);
}
fclose(fi);
fclose(fout);
return 0;
}
