#include<stdio.h>
int main()
{
int i,j,k,n,m;
int sum[10000],num[10000],add;
freopen("in.txt","r",stdin);
while(scanf("%d %d",&n,&m)!=EOF)
{
for (i=0;i<n;i++) scanf("%d",&num);
sum[n-1]=sum[n-1]%m;
k=0;
for (i=n-2;i>-1;i--)
{
add=num%m;
sum=0;
for (j=i;j<n;j++)
{
sum[j]+=add;
if(sum[j]>=m) sum[j]-=m;
if(sum[j]==0) k++;
}
}
printf("%d\n",k);
}
return 0;
}
快了,少用了取模运算,还是超时 |