uva10943
来源:互联网 发布:环境工程就业率数据 编辑:程序博客网 时间:2024/05/19 03:22
//d[k][n]=d[k-1][n]+d[k-1][n-1]+,,,,+d[k-1][0]
#include <iostream>
using namespace std;
#include <cstring>
int d[105][105],n;
int dfs(int k,int m)
{
int i;
if(d[k][m]!=0) return d[k][m];
for(i=0;i<=n;i++)
if(m-i>=0) d[k][m]=(d[k][m]+dfs(k-1,m-i))%1000000;
return d[k][m];
}
int main(int argc, char *argv[])
{
int i,k;
while(cin>>n>>k&&(n||k))
{
memset(d,0,sizeof(d));
for(i=0;i<=n;i++)
d[1][i]=1,d[i][0]=1;
cout<<dfs(k,n)<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
#include <cstring>
int d[105][105],n;
int dfs(int k,int m)
{
int i;
if(d[k][m]!=0) return d[k][m];
for(i=0;i<=n;i++)
if(m-i>=0) d[k][m]=(d[k][m]+dfs(k-1,m-i))%1000000;
return d[k][m];
}
int main(int argc, char *argv[])
{
int i,k;
while(cin>>n>>k&&(n||k))
{
memset(d,0,sizeof(d));
for(i=0;i<=n;i++)
d[1][i]=1,d[i][0]=1;
cout<<dfs(k,n)<<endl;
}
return 0;
}
- uva10943
- uva10943
- uva10943
- uva10943
- UVa10943
- UVA10943简单递推
- 全加和 UVa10943
- uva10943(球放盒子问题)
- uva10943 How do you add?
- UVA10943 How do you add?
- UVA10943- How do you add?(隔板法)
- UVA10943 - How do you add?(DP)
- uva10943 How do you add?(隔板法+递推)
- 计算机图形学
- Chrome源码剖析 【四】
- Spring配置
- ASP.NET MVC HtmlHelper类的方法总结
- Chrome源码剖析 【五】
- uva10943
- 函数调用函数的压栈
- Head First 设计模式 (九) 迭代器与组合模式(Iterator & Composite pattern) C++实现
- CloseGestureInfoHandle 函数-中文整理
- uva10780
- win32 汇编基础
- localhost与127.0.0.1的区别
- Oracle自带的sql developer导入导出数据
- 【生活随笔】决定