UVA10943How do you add?
来源:互联网 发布:人工智能真的来了杨澜 编辑:程序博客网 时间:2024/04/29 16:19
题目链接:http://vjudge.net/contest/view.action?cid=46225#problem/C
状态转移公式为 dp[n][k]=dp[n][k-1]+dp[n-1][k]
意思就是 n用k个数表示等于n用k-1个数表示 然后加上一个0的种数 加上n-1用k个数表示的种数;
#include<iostream>#include<cstring>#include<string>#include<algorithm>#define mod 1000000using namespace std;int a[101][101];void dp(){ for(int i=0;i<=100;i++) { a[0][i]=1; a[i][0]=0; } for(int i=1;i<=100;i++) { for(int j=1;j<=100;j++) { a[i][j]=(a[i][j-1]+a[i-1][j])%mod; } }}int main(){ int n,k; dp(); while(cin>>n>>k) { if(n==0&&k==0) break; else cout<<a[n][k]<<endl; } return 0;}
0 0
- UVA10943How do you add?
- How do you add?
- uva10943 How do you add?
- UVA10943 How do you add?
- UVA 10943 - How do you add
- UVA 10943 How do you add?
- uva 10943 - How do you add?
- UVa 10943 - How do you add?
- UVa:10943 How do you add?
- UVA 10943 - How do you add?(dp)
- uva 10943 - How do you add?(dp)
- UVA 10943 - How do you add?
- UVA 10943 How do you add?
- uva 10943 How do you add? (DP)
- UVa 10943 - How do you add?
- UVA10943- How do you add?(隔板法)
- UVA10943 - How do you add?(DP)
- UVA 10943 How do you add?
- 关于封装的一点想法
- 熵编码 之 2. Arithmetic coding
- mangos地图管理
- 程序一直报错,不知道该如何改了,望各位大神帮我看看
- PHP扩展使用libpng出core
- UVA10943How do you add?
- 熵编码 之 3. Golomb coding
- Etag、Expires、Last-Modified
- String,StringBuffer,StringBuilder性能分析
- 简单排序
- Android地图显示
- codeforces 472C Checkposts 强连通
- 黑马程序员 java基础24天 GUI编程学习总结
- 修饰模式