hdoj 5464 Clarke and problem 【DP】

Clarke and problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 816    Accepted Submission(s): 329 Problem Description Clarke is a patient with multiple personality disorder. One day, Clarke turned into a student and read a book. Suddenly, a difficult problem appears:  You are given a sequence of number  a1,a2,...,an  and a number  p . Count the number of the way to choose some of number(choose none of them is also a solution) from the sequence that sum of the numbers is a multiple of  p ( 0  is also count as a multiple of  p ). Since the answer is very large, you only need to output the answer modulo  109+7   Input The first line contains one integer  T(1≤T≤10)  - the number of test cases.  T  test cases follow.  The first line contains two positive integers  n,p(1≤n,p≤1000)   The second line contains  n  integers  a1,a2,...an(|ai|≤109 ).   Output For each testcase print a integer, the answer.   Sample Input 1 2 3 1 2   Sample Output 2 Hint: 2 choice: choose none and choose all.

题意：给你N个数，可以从里面选若干个数，问你选出数之和可以被P整除的方案数。 注——0%P=0。

以前做过类似的题目。O(∩_∩)O~

设dp[i][j]为前i个数% P 为j的方案数。

dp[i][j] = dp[i-1][j] + dp[i-1][(j-a[i]) % P];

注意取余操作为了防止负数的出现，可以这样实现——((j-a[i])%P+P)%P。

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#define LL long long
#define MOD 1000000007
using namespace std;
LL dp[1001][1001];
int a[1001];
int main()
{
    int t;
    int N, P;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d", &N, &P);
        for(int i = 1; i <= N; i++)
            scanf("%d", &a[i]);
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;
        for(int i = 1; i <= N; i++)
        {
            for(int j = 0; j < P; j++)
                dp[i][j] = (dp[i-1][j] + dp[i-1][((j-a[i])%P+P)%P]) % MOD;
        }
        printf("%lld\n", dp[N][0]);
    }
    return 0;
}