出于某种原因,它曾经工作过。但现在我得到了一个 SIGFPE .....怎么了?
#include "usefunc.h"
long factorial(long num) {
if (num > 1) {
long counter;
long fact = 1;
for (counter = num; counter > 0; counter--) fact *= counter;
return fact;
}
else return 0;
}
long combinations(long n, long k) {
return (factorial(n)) / (factorial(k)*factorial(n-k));
}
int main()
{
printf("How many rows of Pascal\'s triangle should I print?\t");
int rows = GetInteger();
long pArray[rows][rows];
int counter;
int counter2;
for (counter = 1; counter <= rows; counter++)
{
int y = rows-counter;
for (; y > 0; y--) printf(" ");
for (counter2 = 0; counter2 <= counter; counter2++)
{
/*
THIS IS AN OUTPUT
*/
printf("%9.0lu", (long) combinations(counter, counter2));
pArray[counter][counter2] = (long) combinations(counter, counter2);
}
/*
THIS IS AN OUTPUT
*/
printf("\n");
}
return 0;
}