Codeforces Round #302 (Div. 2) C dp（背包思想）

链接：戳这里

C. Writing Code

time limit per test3 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard 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个程序员写m行代码，每个程序员写一行代码会出现ai个bug。一个优秀的plan是每个程序员写vi行代码。

使得：v1+v2+..+vn=m。并且总的bug不超过b。有多少种这样的plan。

思路：

类似完全背包的思想，每个程序员写Ni行代码，达到b的状态有多种方式

设置dp[i][j]表示当前第i行，出现了j个bug

dp[i][j]=dp[i][j]+dp[i-1]][j-a[k]]

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
int n,m,b,mod;
ll dp[550][550];/// 前i行出现j个bug
int a[550];
int main(){
    scanf("%d%d%d%d",&n,&m,&b,&mod);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            for(int k=a[i];k<=b;k++){
                dp[j][k]=(dp[j][k]+dp[j-1][k-a[i]])%mod;
            }
        }
    }
    ll ans=0;
    for(int i=0;i<=b;i++) {
        ans=(ans+dp[m][i])%mod;
    }
    cout<<ans<<endl;
    return 0;
}