#include <stdio.h>

void ResolutionFactorZeroB(int a, int c, int *a1, int *a2, int **cFactor);
void ResolutionFactor(int a, int b, int c, int *a1, int *a2, int **cFactor);
int ComparisonOfCoefficient(int a, int b, int c, int *a1, int *a2, int **cFactor);
int Factorization(int c, int **cFactor);

int main(){
	int a,b,c;
	int *a1, *a2, **cFactor;

	printf("insert quadratic equation's coefficients a, b, c : ");
	scanf("%d %d %d", &a, &b, &c);

	if(a == 0){
		printf("Primary equation : %dx %+d", b,c);
		return 0;
	}
	if(b == 0){
		ResolutionFactorZeroB(a,c,a1,a2,cFactor);
	}else{
		ResolutionFactor(a,b,c,a1,a2,cFactor);
	}
	return 0;	
}

void ResolutionFactorZeroB(int a, int c, int *a1, int *a2, int **cFactor){
	if(ComparisonOfCoefficient(a,0,c,a1,a2,cFactor)){
	}
}
void ResolutionFactor(int a, int b, int c, int *a1, int *a2, int **cFactor){
	if(ComparisonOfCoefficient(a,b,c,a1,a2,cFactor)){
	}
}
int ComparisonOfCoefficient(int a, int b, int c, int *a1, int *a2, int **cFactor){
	int cSize = Factorization(c,cFactor);
	int i;
	printf("%lf", cFactor);
	for(i=0; i<cSize; i++){
//		printf("%d %d\n", cFactor[i][0], cFactor[i][1]);
		printf("%d %d\n", *(*(cFactor+i)), *(*(cFactor+i)+1));
	}
	free(cFactor);
}
int Factorization(int c, int **cFactor){
	int x,i, size = 4;
	int m = (int)sqrt(c);
	
	cFactor = (int **)malloc(size*sizeof(int));
	
	for(x=1,i=0; x<= m; x++){
		if(c % x == 0){
			if(i >= size){
				size = size * 2;
				cFactor = (int **)realloc(size * sizeof(int **));
			}
			*(cFactor+i) = (int *)malloc(2 * sizeof(int));
			*(*(cFactor+i)) = x;
			*(*(cFactor+i) + 1) = c/x;
			i++;
			*(cFactor+i) = (int *)malloc(2 * sizeof(int));
			*(*(cFactor+i)) = -x;
			*(*(cFactor+i) + 1) = -(c/x);
			i++;
		}
	}
	return i;
}