Dynamic programming algorithm for calculating binomial coefficients

binomial_coefficients2.cpp

#define C_MAX 250

int C[C_MAX][C_MAX];
C[0][0] = 1;
for (int i = 1; i < C_MAX; i++){
	C[i][0] = 1;
	for (int j = 1; j <= i; j++){
                
                /* Actual Binomial Coefficient */
		//C[i][j] = C[i-1][j] + C[i-1][j-1];

                /* Binomial Coefficient modulo MAX */
		C[i][j] = (C[i-1][j] + C[i-1][j-1]) % MAX; 	 
	}
}