hdu5775 sum

sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2560    Accepted Submission(s): 982

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
  
  

 

题意：输入n，m；下一行输入n个数字，问这n个数的序列中是否存在连续子序列整除m；

思路：逆向思考，连续子序列整除m也就是：

            (sum[j]-sum[i])%m==0 =》sum[j]%m-sum[i]%m==0 =》sum[i]%m==sum[j]%m;

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;

const int maxn=100005;
int a[maxn],ans[maxn];
ll sum[maxn];

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m;
        memset(a,0,sizeof(a));
        memset(sum,0,sizeof(sum));
        memset(ans,0,sizeof(ans));

        int flag=0;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]%m==0)
                flag=1;
        }
        for(int i=1;i<=n;i++)
        {
            sum[i]=sum[i-1]+a[i];
            if(sum[i]%m==0)
                flag=1;
        }

        for(int i=1;i<=n;i++)
            ans[sum[i]%m]++;

        for(int i=1;i<m;i++)
            if(ans[i]>1)
                flag=1;

        if(flag)  printf("YES\n");
        else  printf("NO\n");
    }

    return 0;
}