摘要： 规律题k 1 2 3 4 5 6 7 8....1 1 2 3 4 5 6 7 8....2 1 3 6 10 15 20...3 1 4 10 20 35 55...就是dp[i][j]=dp[i-1][j]+dp[i-1][j]#include #include #define N 110#define mod 1000000int dp[N][N];void solve(){ memset(dp, 0, sizeof(dp)); for(int i=1; i<N; ++i) dp[i][1]=dp[0][i]=1; for(int i=1; i<N; ++i) {... 阅读全文