hdu 5464(简单dp)

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn = 1005;
const int mod = 1e9+7;
int n,p;
int a[maxn],dp[maxn][maxn];

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(dp,0,sizeof(dp));
		scanf("%d%d",&n,&p);
		for(int i = 1; i <= n; i++)
		{
			scanf("%d",&a[i]);
			a[i] = (a[i] % p + p) % p;
		}
		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][(p+j-a[i])%p]) % mod;
		printf("%d\n",dp[n][0]);
	}
	return 0;
}