hdu 1331 Function Run Fun
2014-07-21 20:29
363 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1331
View Code
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int dp[30][30][30]; int dfs(int a,int b,int c) { if(a<=0||b<=0||c<=0) return 1; if(dp[a][b][c]!=0) return dp[a][b][c]; if(a<b&&b<c) { return dp[a][b][c]=dfs(a,b,c-1)+dfs(a,b-1,c-1)-dfs(a,b-1,c); } else return dp[a][b][c]=dfs(a-1,b,c)+dfs(a-1,b-1,c)+dfs(a-1,b,c-1)-dfs(a-1,b-1,c-1); } int main() { int a,b,c; while(scanf("%d%d%d",&a,&b,&c)!=EOF) { if(a==-1&&b==-1&&c==-1) break; if(a<=0||b<=0||c<=0) { printf("w(%d, %d, %d) = %d\n",a,b,c,1); } else if(a>20||b>20||c>20) { printf("w(%d, %d, %d) = %d\n",a,b,c,dfs(20,20,20)); } else printf("w(%d, %d, %d) = %d\n",a,b,c,dfs(a,b,c)); } return 0; }
View Code
相关文章推荐
- [递归理解/记忆化] HDU/HOJ 1331 Function Run Fun
- Function Run Fun HDU - 1331
- HDU 1331 Function Run Fun
- HDU 1331 Function Run Fun
- HDU 1331 Function Run Fun
- HDU 1331 Function Run Fun
- hdu 1331 Function Run Fun
- HDU 1579 Function Run Fun
- hdu 1579 Function Run Fun
- HDU Function Run Fun
- hdu 1579 Function Run Fun
- U - Function Run Fun HDU - 1579
- hdoj 1331 Function Run Fun
- Function Run Fun hdu1579 递推
- hdu 1759 Function Run Fun
- Function Run Fun
- Function Run Fun
- [ACM]Function Run Fun
- poj Function Run Fun(DP)(记忆化搜索)
- HDU-1331 Function Run Fun (记忆化搜索)