动态规划

#include <iostream>
#include <cstring>

int main(){

    int cache[11][11];
    bzero(cache,sizeof(cache));
    for(int i=0;i<11;++i){
        cache[0][i] = cache[i][0] = 1;
        cache[1][i] = cache[i][1] = 1;
    }
    for(int i=2;i<11;++i){
        for(int j=2;j<11;++j){
            cache[i][j] = cache[i][j-1];
            int im = i-j;
            if(im == 0 || im == 1){cache[i][j] += 1;continue;}
            if(im > 1){cache[i][j] += cache[im][j];continue;}
        }
    }

    int m,n;
    while(std::cin >> m >> n){
        std::cout << cache[m][n] << std::endl;
    }
    return 0;
}