HDU 5776 sum （模拟）

sum

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=5776

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整除.
##题解： 维护每个前缀和的余数即可. 如果有两个前缀和的余数相同，那么这两段之差构成的字串一定能被m整除. WA了一发：cnt[0]要初始化为1.
##代码： ``` cpp #include #include #include #include #include #include #include