HDU 5776 sum ( BC #85 1001)

sum

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

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
  
  

分析：首先预处理一下前i项的和，然后sum[ i ] %m 如果出现大于1次，说明其中包含子序列为 m 的倍数 ，相当于(sum [ i ] - sum [ j ])%m==0  ( i > j)

代码如下：

#include <stdio.h>
#include <string.h>
int main()
{
	int T;
	int n,m,i,j;
	int a,sum[100010],ans[5005];
	scanf("%d",&T);
	while(T--)
	{
		int peace=0;
		memset(ans,0,sizeof(ans));
		memset(sum,0,sizeof(sum));
		scanf("%d %d",&n,&m);
		sum[0]=0;
		ans[0]=1;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a);
			sum[i]=sum[i-1]+a;
			ans[sum[i]%m]++;
		}
		for(i=0;i<=m;i++)
		{
			if(ans[i]>1)
			{
				peace=1;
				break;
			}
		}
		if(peace)
			printf("YES\n");
		else
			printf("NO\n");
	}
	
	return 0;
}