用动态规划的思想来解决组合数问题

根据组合数公式

c[m][n]=c[m-1][n]+c[m-1][n-1]

---

#include <iostream>
#include <cstring>
#include <cstdio>
#include <limits.h>
using namespace std;
long long cal(int m,int n){
    long long dp[110][110];
    for (int i = 0; i <=m ; ++i) {
        dp[i][0]=1;
        dp[i][i]=1;
    }
    for (int i = 1; i <=m ; ++i) {
        for (int j =1; j <i&&j<=n ; ++j) {
            dp[i][j]=dp[i-1][j]+dp[i-1][j-1];
        }
    }
    return dp[m][n];
}

int main(){
    long long a=6;
    long long b=3;
    cout<<cal(6,3);
}