Pagini recente » Cod sursa (job #2522542) | Cod sursa (job #2626183) | Cod sursa (job #2659062) | Cod sursa (job #1890703) | Cod sursa (job #1710416)
#include <stdio.h>
#include <stdlib.h>
int q[100000][2], ind;
int main(){
int t, i, n, k;
FILE*fi,*fo;
fi=fopen("consecutive.in","r");
fo=fopen("consecutive.out","w");
fscanf(fi,"%d", &t);
for(i=0;i<t;i++){
fscanf(fi,"%d", &n);
n*=2;
ind=0;
k=2;
while(k*k<=n){
if(n%k==0){
if((n/k-(k+1))%2==0){
q[ind][0]=(n/k-(k+1))/2+1;
q[ind][1]=q[ind][0]+k-1;
ind++;
}
}
k++;
}
fprintf(fo,"%d\n", ind);
for(int j=0;j<ind;j++){
fprintf(fo,"%d %d\n", q[j][0], q[j][1]);
}
}
fclose(fi);
fclose(fo);
return 0;
}