HDU 5464 动态规划

Clarke and problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 96    Accepted Submission(s): 57

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 ofp(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

12 31 2

 

Sample Output

2
#include<cstdio>#include<iostream>#include<cstring>using namespace std;__int64 dp[1002][1002]={0};int main(){    int t=0;    scanf("%d",&t);    while(t--)    {        int n=0,p=0;        __int64 s[1005]={0};        memset(dp,0,sizeof(dp));        scanf("%d%d",&n,&p);        for(int i=1;i<=n;i++)        {            scanf("%I64d",&s[i]);        }        dp[0][0]=1;        for(int i=1;i<=n;i++)        {          for(int j=0;j<=p-1;j++)          {                dp[i][j]=(dp[i-1][j]+dp[i-1][(p+j-s[i]%p)%p])%1000000007;          }        }        printf("%I64d\n",dp[n][0]%1000000007);    }    return 0;}