hdu5776 sum （鸽巢原理）

sum

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

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

 

Source

BestCoder Round #85

 

Recommend

鸽巢原理啊啊啊，组合数学43面详细讲解~~~

#include <iostream>
#include <string.h>
#include <cstdio>

using namespace std;

int mm[5020];

int main()
{
    int T;
    cin>>T;
    int n,m;
    int sum = 0;
    int flag = 0;
    while(T--){
        scanf("%d%d",&n,&m);
        int temp;
        for(int i = 0;i < n;i++){
            scanf("%d",&temp);
            sum += temp;
            mm[sum%m]++;
            if(mm[sum%m] == 2)flag = 1;
        }
        if(mm[0] != 0)flag = 1;
        if(n >= m)printf("YES\n");
        else{
            if(flag == 1)printf("YES\n");
            else{
                printf("NO\n");
            }
        }
        sum = 0;
        flag = 0;
        memset(mm,0,sizeof(mm));
    }
    return 0;
}