【鏈接】 我是鏈接,點我呀:)
【題意】

在這裏輸入題意

【題解】

m比較小
<=1000

【代碼】

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int M = 1e3+10;

bool f[2][M];
int a[M],n,m;
vector<int> v;

int main()
{
    ios::sync_with_stdio(0),cin.tie(0);
    #ifdef LOCAL_DEFINE
 

        freopen("rush.txt","r",stdin);
    #endif
    cin >> n >> m;
    for (int i = 1;i <= n;i++) {
            int x;cin >>x;x%=m;
            a[x]++;
    }

    if (a[0]>0){
        cout<<"YES"<<endl;
        return 0;
    }

    for
 
 (int i = 1;i < m;i++)
        if (a[i]>0){
            int temp = 1;
            while (a[i]>=temp){
                v.push_back((1LL*temp*i)%m);
                a[i]-=temp;
                temp*=2;
            }
            if (a[i]>0) v.push_back((1LL*a[i]*i)%m);
        }
    if (!v.empty()){
        f[0][v[0]] = 1;
        if (v[0]==0) return cout<<"YES"<<endl,0;
        for (int i = 1;i <(int)v.size();i++){
            for (int j = 0;j < m;j++) f[i&1][j] = 0;
            for (int j = 1;j <= m-1;j++)
                if (f[(i&1)^1][j]){
                    int k = (j+v[i])%m;
                    f[i&1][j] = 1;
                    f[i&1][k] = 1;
                }
            f[i&1][v[i]] = 1;
            if (f[i&1][0]) return cout<<"YES"<<endl,0;
        }
    }
    cout<<"NO"<<endl;
    return 0;
}

【Henu ACM Round#18 B】Modulo Sum