hdu5776——sum

Problem Description

Given a sequence, you're asked whether there exists a consecutive subsequence whose sum is divisible by m. output YES, otherwise output NO

 

Input

The first line of the input has an integer T ( 1≤T≤10 ), which represents the number of test cases.
For each test case, there are two lines:
1.The first line contains two positive integers n, m ( 1≤n≤100000 , 1≤m≤5000 ).
2.The second line contains n positive integers x ( 1≤x≤100 ) according to the sequence.

 

Output

Output T lines, each line print a YES or NO.

 

Sample Input

  
  

   
   2
3 3
1 2 3
5 7
6 6 6 6 6
  
  

 

Sample Output

  
  

   
   YES
NO
  
  

题目大意：给一个序列，问你有没有一个字段和可以将m除尽

解题思路：例如 序列为1,2,3,4，m为4，分别求出前i项的和，sum[0]=0,sum[1]=1,sum[2]=3,sum[3]=6,sum[4]=10;他们分别对m求余为，0,1,3,2,2。其中2出现了两次，既说明sum[3],sum[4]都对m求余为2，他们都有m的倍数之外再加2，所以他们两个相减即为m的倍数。即(sum[i]-sum[j])%m==0.

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int sum[100005],cnt[5005];
int main()
{
    int t,n,m,x;
    scanf("%d",&t);
    while(t--)
    {
        memset(cnt,0,sizeof(cnt));
        scanf("%d%d",&n,&m);
        sum[0]=0,cnt[0]=1;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            sum[i]=sum[i-1]+x;
            cnt[sum[i]%m]++;
        }
        int flag=0;
        for(int i=0;i<m;i++)
        {
            if(cnt[i]>1){
                flag=1;
                break;
            }
        }
        if(flag)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}