Codeforces Round #302 (Div. 2)C (完全背包)
2015-05-08 03:15
423 查看
C. 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.
Sample test(s)
input
output
input
output
input
output
把m写成了n,dp一直调不出来,囧rz,dp[i][j]表示前i天bug为j的方案数,希望今后比赛能细心点。
#include <bits/stdc++.h>
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
using namespace std;
typedef long long ll;
const int maxn = 5e2 + 5;
int a[maxn],mod,b,n,m;
ll dp[maxn][maxn];
int main()
{
while(cin>>n>>m>>b>>mod) {
memset(dp,0,sizeof dp);
for(int i = 1; i <= n; i++)cin>>a[i];
dp[0][0] = 1;
for(int i = 1; i <= n; i++) {
for(int k = 1; k <= m; k++) {
for(int j = a[i]; j <= b; j++)
dp[k][j] += dp[k-1][j-a[i]],dp[k][j]%=mod;
}
}
ll res = 0;
for(int i = 0; i <= b; i++)res += dp[m][i];
cout<<res%mod<<endl;
}
return 0;
}
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.
Sample test(s)
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
把m写成了n,dp一直调不出来,囧rz,dp[i][j]表示前i天bug为j的方案数,希望今后比赛能细心点。
#include <bits/stdc++.h>
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
using namespace std;
typedef long long ll;
const int maxn = 5e2 + 5;
int a[maxn],mod,b,n,m;
ll dp[maxn][maxn];
int main()
{
while(cin>>n>>m>>b>>mod) {
memset(dp,0,sizeof dp);
for(int i = 1; i <= n; i++)cin>>a[i];
dp[0][0] = 1;
for(int i = 1; i <= n; i++) {
for(int k = 1; k <= m; k++) {
for(int j = a[i]; j <= b; j++)
dp[k][j] += dp[k-1][j-a[i]],dp[k][j]%=mod;
}
}
ll res = 0;
for(int i = 0; i <= b; i++)res += dp[m][i];
cout<<res%mod<<endl;
}
return 0;
}
相关文章推荐
- 完全背包 Codeforces Round #302 (Div. 2) C Writing Code
- 完全背包——Codeforces Round #302 (Div. 2) C. Writing Code
- Codeforces Round #119 (Div. 2) / 189A Cut Ribbon (完全背包)
- POJ 3260 The Fewest Coins(多重背包+完全背包)
- BZOJ 1042 硬币购物(完全背包+DP)
- UVa 10306 e-Coins(二维完全背包)
- 01,完全,多重背包模板
- 动态规划 杭电1171 0-1背包和完全背包结合
- hdu(1114)——Piggy-Bank(完全背包)
- 01背包与完全背包(我已经放弃治疗了。。。。)
- HDU2159 FATE 二维费用背包-完全背包
- poj 2063 Investment 完全背包
- 完全背包 HDU 1114
- UVa 10280 Old Wine Into New Bottles(剪枝+完全背包)
- noj [1482] 嘛~付钱吧!(完全背包)
- 【完全背包问题】有1,2...K种类型的dollar,求组成价值为N的方法有多少种
- ZOJ-3623 Battle Ships (完全背包 应用题)
- F - Piggy-Bank 【完全背包】
- HDU 5410 CRB and His Birthday(01背包+完全背包)
- HDU1248:寒冰王座(完全背包)