543A - Writing Code （动态规划）

A. Writing Code
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.

Let’s call a sequence of non-negative integers v1, v2, …, vn a plan, if v1 + v2 + … + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let’s call a plan good, if all the written lines of the task contain at most b bugs in total.

Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input

The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.

The next line contains n space-separated integers a1, a2, …, an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output

Print a single integer — the answer to the problem modulo mod.
Examples
Input

3 3 3 100
1 1 1

Output

10

Input

3 6 5 1000000007
1 2 3

Output

0

Input

3 5 6 11
1 2 1

Output

0

---

题解：
有n个程序，这n个程序运作产生m行代码，但是每个程序产生的BUG总和不能超过b，给出每个程序产生的代码，每行会产生ai个BUG，问在总BUG不超过b的情况下，我们有几种选择方法
本题用到完全背包思想，建立二维数组保存方案次数。
dp[j][k]，j：代码数m、k：bug数b。遍历i（人数n）次，表示每位程序员可能的方案。只要k ！= b 就令 dp[j][k] += dp[j - 1][k - a[i]]，存放达到当前bug数可能的方案数量，不断更新数组dp。
错误分析：1.数值足够大应该设置成long long类型保存结果。2.最后计算sum总数时，开始是1 -> n，但需要考虑如果有程序员每行代码bug = 0的情况，改为0 -> n。

---

#include <iostream>
#include <algorithm>

using namespace std;
int  n,m,b,mod;
long long sum;
long long dp[600][600],a[600];
int i,j,k;

int main()
{
    cin>>n>>m>>b>>mod;
    for(i = 1; i <= n; i++)
    {
        cin>>a[i];
    }
    dp[0][0] = 1;

    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= m; j++)
        {
            for(k = a[i]; k <= b; k++)
            {
                dp[j][k] += dp[j - 1][k - a[i]];
                dp[j][k] %= mod;
            }
        }
    }

    sum = 0; 
    for(i = 0; i <= b; i++)
    {
        sum += dp[m][i];
        sum %= mod;
    }
    cout<<sum <<endl;
    return 0;
}