I. A Constant Struggle

UCF Local Programming Contest 2014（Practice）

Your math teacher Xavier Guha has given your class an extra credit assignment to work on. The problem he gives is as follows: Given a linear equation of the form

$$c_1{x}_1+c_2{x}_2+c_3{x}_3+c_4{x}_4+c_5{x}_5+c_5{x}_5+c_6{x}_6+c_7{x}_7+c_8{x}_8=N$$

Having taken several programming classes from his brother, you decide to prove your teacher wrong by writing a program to determine how many solutions the equation has.
题意：给出c₁……c₈ 和 N 求有多少种非负整数解。

我们可以考虑记忆化搜索：
Code1：

#include<bits/stdc++.h>

using namespace std;
typedef long long LL;

int n;
int a[9];
LL dp[10][110];

LL dfs(int x,int sum)
{
	if(sum==n) return 1;
	if(x>8||sum>n) return 0;
	if(dp[x][sum]>=0) return dp[x][sum];
	return dp[x][sum] = dfs(x+1,sum)+dfs(x,sum+a[x]);  //不选第x个和选第x个
}

int main()
{
	int T;
	cin>>T;
	for(int i=1;i<=T;i++){
		for(int j=1;j<=8;j++) cin>>a[j];
		cin>>n;
		memset(dp,-1,sizeof dp);
		dfs(1,0);
		cout<<"Equation #"<<i<<": "<<dp[1][0]<<"\n";
	}
	return 0;
}

完全背包：
Code2：

#include<bits/stdc++.h>

using namespace std;
typedef long long LL;

LL dp[10][110];		//前i个数，装满大小为j的背包的种类数；
int a[10];

int main()
{
	int T,m,K=1;
	cin>>T;
	while(T--){
		for(int i=1;i<=8;i++) cin>>a[i];
		memset(dp,0,sizeof dp);
		for(int i=0;i<=8;i++) dp[i][0] = 1;
		cin>>m;
		for(int i=1;i<=8;i++){
			for(int j=1;j<=m;j++)
				for(int k=0;k*a[i]<=j;k++)
				dp[i][j] += dp[i-1][j-k*a[i]];
		}
		cout<<"Equation #"<<K<<": "<<dp[8][m]<<"\n";K++;
	}
	return 0;
}

既然是完全背包那我们就可以优化一波
Code3：

#include<bits/stdc++.h>

using namespace std;
typedef long long LL;

LL dp[110];
int a[10];

int main()
{
	int T,m,K=1;
	cin>>T;
	while(T--){
		for(int i=1;i<=8;i++) cin>>a[i];
		memset(dp,0,sizeof dp);
		dp[0] = 1;
		cin>>m;
		for(int i=1;i<=8;i++){
			for(int j=a[i];j<=m;j++)
				dp[j] += dp[j-a[i]];
		}
		cout<<"Equation #"<<K<<": "<<dp[m]<<"\n";K++;
	}
	return 0;
}