uva 1638 Pole Arrangement 递推

1. 递推就是要找到相互的联系。
2. 分样本空间，找到各自的组合数，分类。

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=825&problem=4513&mosmsg=Submission+received+with+ID+17970079

#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>
using namespace std;

#define ms(s) memset(s,0,sizeof(s))
typedef unsigned long long ULL;
typedef long long LL;

const int INF = 0x3fffffff;

LL num[21][21][21];

void makeTable(){
    num[1][1][1] = 1;
    for(int i = 2; i <= 20; ++i){
        for(int j = 1; j <= 20; ++j){
            for(int k = 1; k <= 20; ++k){
                num[i][j][k] = num[i-1][j-1][k]+num[i-1][j][k-1]+num[i-1][j][k]*(i-2);
            }
        }
    }
}

int main(){
//    freopen("F:\\input.txt","r",stdin);
//    freopen("F:\\output.txt","w",stdout);
//    ios::sync_with_stdio(false);

    LL n,l,r;
    int t;
    scanf("%d",&t);
    ms(num);
    makeTable();
    while(t--){
        scanf("%lld%lld%lld",&n,&l,&r);
        LL ans = num[n][l][r];
        printf("%lld\n",ans);
    }

    return 0;
}