i 0 1 2 3 4 5
j 0 1 0 0 0 0 0
1 1 1 0 0 0 0
2 1 2 1 0 0 0
3 1 3 3 1 0 0
4 1 4 6 4 1 0
5 1 5 10 10 5 1
static long[][] c = new long[105][105];
public static void init() {//杨辉三角,用因为不用排序,所以用组合,就是杨辉三角。
c[0][0] = 1;
for (int i = 1; i <= 100; i++) {
c[i][0] = 1;
for(int j = 1;j <= 100;j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
}
}