zoj1569 Partial Sums

sum[i...j] = a[i]+a[i+1]+...+a[j] = sum[1...j]-sum[1...i-1]，1 =< i <= j <= n

分两种情况：

1、i=1时，sum[1...j]%m==0，cnt++；

2、i>1时，sum[i...j]%m==0 <=> (sum[1...j]-sum[1...i-1])%m==0 <=> sum[1...j]%m==sum[1...i-1]%m (令= k != 0)，cnt += C(k出现的次数,2)

 

1. //zoj1569 Partial Sums
2. //Accepted 1569 C ++ 00:00.05 448K
3. #include <stdio.h>
4. #include <string.h>
5. #define MAXN 10000
6. #define MAXM 5000
7. int n,m;
8. void solve()
9. {
10.        int i,cnt=0,sum=0,a,b[MAXM];
11.        memset(b,0,sizeof(b));
12.        for (i=0; i<n; ++i) {
13.               scanf ("%d",&a);
14.               sum = (sum+a)%m;
15.               if (sum==0) cnt++;
16.               b[sum]++;
17.        }
18.        for (i=0; i<m; ++i)
19.               if (b[i]) cnt += b[i]*(b[i]-1)/2;
20.        printf ("%d/n",cnt);
21. }
22. int main()
23. {
24.        while (scanf ("%d %d",&n,&m) != EOF)
25.               solve();
26.        return 0;
27. }