UVA 10943 - How do you add
来源:互联网 发布:闪凌网络是真的吗 编辑:程序博客网 时间:2024/05/16 05:53
DP[k][n] = sum{DP[k-1][i]} (0<=i<=n)
所以只需要做一下预处理,把所有需要的数存在一个100*100的数组里,然后根据输入的k,n输出对应的DP[k][n]就行了;
#include<cstdio>
#include<cstring>
int DP[101][101];
int main()
{
int i,j;
memset(DP,0,sizeof(DP));
for(i=0;i<101;i++)
DP[i][0]=1;
for(i=1;i<101;i++)
{
for(j=1;j<101;j++)
{
for(int k=0;k<=j;k++)
{
DP[i][j]+=DP[i-1][k];
DP[i][j]%=1000000;
}
}
}
int n,k;
while(scanf(\"%d%d\",&n,&k)!=EOF,(n||k))
printf(\"%d\\n\",DP[k][n]);
return 0;
}
- 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?
- 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?
- How do you add?(UVA 10943)
- uva 10943 How do you add?
- 树状数组学习系列2 之 OJ题目大汇总
- UVA 701 - The Archeologists\' Dilemma
- UVA 10105 - Polynomial Coefficients
- UVA 10717 - Mint
- UVA 11069 - A Graph Problem
- UVA 10943 - How do you add
- UVA 10491-Cows and Cars
- UVA 10706 - Number Sequence
- UVA 10375 - Choose and divide
- UVA 10161-Ant on a Chessboard
- UVA 10177 - (234)-D SqrRectsCubesBoxes
- UVA 10182 - Bee Maja
- UVA 10195 - The Knights Of The Round Table
- UVA 10209 - Is This Integration