UVA - 10943

最新推荐文章于 2024-09-13 18:58:52 发布

__Kunagisa2774

最新推荐文章于 2024-09-13 18:58:52 发布

阅读量84

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/jsquerk/article/details/114291309

版权

UVA - 10943

题目介绍：
Larry is very bad at math — he usually uses a calculator, which
worked well throughout college. Unforunately, he is now struck in
a deserted island with his good buddy Ryan after a snowboarding
accident.
They’re now trying to spend some time figuring out some good
problems, and Ryan will eat Larry if he cannot answer, so his fate
is up to you!
It’s a very simple problem — given a number N, how many ways
can K numbers less than N add up to N?
For example, for N = 20 and K = 2, there are 21 ways:
0+20
1+19
2+18
3+17
4+16
5+15
…
18+2
19+1
20+0

大意：
总和为N，可以用K个数分，判断有多少种分法。
递推题。设1-100的所有对应的答案保存在SS[101][101]中，前一个下标表示K，后一个表示N。
SS[k][n]=(SS[k-1][0]+SS[k-1][1]+…+SS[k-1][n-1]+SS[k-1][n]).
最后结果余1000000.

AC代码：

#include<iostream>
#include<cstring>
using namespace std;

const int Maxn=101;
int ss[Maxn][Maxn]={0};		// K N
const int mod=1000000;

void init(){
	for(int i=0;i<Maxn;i++)
		ss[1][i]=1;
	for(int i=2;i<Maxn;i++){
		for(int j=0;j<Maxn;j++){
			int sum=0;
			for(int k=0;k<=j;k++){
				sum+=ss[i-1][k];
				sum%=mod;
			}
			ss[i][j]=sum;	
		}
	}
}

int main(){
	int n,k;
	init();
	while(scanf("%d%d",&n,&k)==2&&n){
		cout<<ss[k][n]<<endl;
	}
	return 0;
}