Codeforces Round #319 (Div. 2) B Modulo Sum （dp，鸽巢）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3+5;
int cnt[maxn];
bool dp[maxn][maxn];
#define Y { puts("YES"); return 0; }
int main()
{
//freopen("in.txt","r",stdin);
int n,m; scanf("%d%d",&n,&m);
bool fg = false;//n>m;
for(int i = 1; i <= n; i++){
int x; scanf("%d",&x);
if(!fg){
x %= m;
dp[x][i] = true;
for(int k = 0; k <= m; k++){
dp[k][i] = dp[k][i]||dp[k][i-1];
if(dp[k][i-1]){
dp[(k+x)%m][i] = true;
}
}
if(dp[0][i]) fg = true;
}
}
if(fg) puts("YES");
else puts("NO");
return 0;
}