UVALive 4877 记忆搜索

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#define MAX 70

using namespace std;

long long D;
long long vis[10][MAX];

long long Fun(long long n,long long D)
{
    if(vis[n][D]) return vis[n][D];

    if(D == 0) return 1;

    long long count = 0;
    for(long long i = 0;i <= n;i++)
    {
        if(!vis[i][D-1])
           vis[i][D-1] = Fun(i,D-1);
        count += vis[i][D-1];
    }

    return count;
}

int main()
{
   // freopen("in.in","r",stdin);

    long long test_case;
    cin>>test_case;

    memset(vis,0,sizeof(vis));

    while(test_case--)
    {
        long long cas;cin>>cas;cout<<cas<<" ";

        cin>>D;

        long long count = 0;

        for(long long i = 0;i <= 9;i++)
        {
             if(!vis[i][D-1])
              vis[i][D-1] = Fun(i,D-1);
            count += vis[i][D-1];
        }

        cout<<count<<endl;
    }

    return 0;
}