sum(抽屉原理、同余)

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

给定一个序列，您会被问到是否存在其和可被m整除的连续子序列。输出YES，否则输出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.

抽屉原理：

 同余：

若 x % m = b 且 y % m = b，那么x可以写成x = a1 * m + b，y可以写成y = a2 * m + b，(y - x) % m = ((a2 - a1) * m) % m = 0，对应题中就是s[i]%m==s[j]%m,即st[b] >= 2

#include <iostream>
#include <cstring>
using namespace std;

typedef long long LL;
const int N = 1e5 + 10;
int T;
LL a[N], s[N];
int st[N];
int main()
{
    ios::sync_with_stdio(false);
    cin >> T;

    while(T --)
    {
        int n, m;
        cin >> n >> m;

        memset(st, 0, sizeof st);
        //处理前缀和,同余
        bool flag = false;
        for (int i = 1; i <= n; i ++ )
        {
            cin >> a[i];
            s[i] = (a[i] + s[i - 1]) % m;
            st[s[i]] ++;

            if(s[i] == 0 || st[s[i]] >= 2)//当抽屉放了两个(说明有s[i]与s[j]同余)或者序列本身整除m
                flag = true;
        }

        if (flag)
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
       
        }
    }
    return 0;
}