组合数模板C(m,n)

版权声明：本文为博主原创文章，转载需标明原创地址 https://blog.csdn.net/qq_42321579/article/details/82824430

#include<iostream>
#include<cstdio>
using namespace std;
long long C[2018][2018];

int main(){
	int k,n;
	cin >> k >> n;
	C[0][0] = 1;
	for (int i = 1; i <= n; ++i) {
    		C[i][0] = 1;
   	 	for (int j = 1; j <= i; ++j) {
        	C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % k;
    	}
	}//杨辉三角优化
    return 0;
}