uva10912 Simple Minded Hashing（DP）

题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=11&page=show_problem&problem=1853

 

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int l,s;
int dp[30][400][30];
int DP(int x,int y,int z){
   if(dp[x][y][z]!=-1) return dp[x][y][z];
   if(x!=0&&y==0) return 0;
   if(x==0&&y==0) return 1;
   if(x==0&&y!=0) return 0;
   int ret=0;
   for(int i=1;i<z;i++){
      if(y-i>=0) ret+=DP(x-1,y-i,i);
   }
   return dp[x][y][z]=ret;
}
int main(){
    int cas=1;
    while(cin>>l>>s){
        if(l==0&&s==0) break;
        printf("Case %d: ",cas++);
        if(l>26) {cout<<0<<endl;continue;}
        if((53-l)*l/2<s) {cout<<0<<endl;continue;}
        memset(dp,-1,sizeof dp);
        cout<<DP(l,s,27)<<endl;
    }
    return 0;
}

uva10912

 

转载于:https://www.cnblogs.com/wonderzy/p/3541889.html