http://acm.hdu.edu.cn/showproblem.php?pid=5464
分析: dp[i][j] 表示前i个数除mod余j的个数
代码:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define Pi acos(-1.0)
double Deg2Rad(double deg){return (deg*Pi/180.0);}
double Rad2Deg(double rad){return (rad*180.0/Pi);}
double ArcSin(double val){return Rad2Deg(asin(val));}
double ArcCos(double val){return Rad2Deg(acos(val));}
double Sin(double deg){return sin(Deg2Rad(deg));}
double Cos(double deg){return cos(Deg2Rad(deg));}
int gcd(int a,int b)
{
return b==0 ? a : gcd(b,a%b);
}
//const
//#define ll long long
int num[1090];
int dp[1090][1090]; //dp[i][j] 表示前i个数除mod余j的个数
int main()
{
int T;
scanf("%d",&T);
int M =1000000007;
while(T--)
{
int n,p;
scanf("%d%d",&n,&p);
for(int i=1;i<=n;i++)
scanf("%d",&num[i]);
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
int t=((p-num[i])%p+p)%p;
for(int j=0;j<p;j++)
{
dp[i][j]=(dp[i-1][j]+dp[i-1][t]) % M;
t=(t+1)%p;
}
}
printf("%d\n",dp[n][0]);
}
return 0;
}