洛谷P2946 [USACO09MAR]Cow Frisbee Team S（余数dp）

原题链接

#include <iostream>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <stdio.h>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define ll long long
inline int read()
{
    int k = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        k = k * 10 + ch - '0';
        ch = getchar();
    }
    return k * f;
}
#define inf 0x3f3f3f3f
int dp[2005][1005];
int a[2005];
const int mod=100000000;
int main()
{
    int n=read(),m=read();
    for(int i=1;i<=n;i++)
    {
        a[i]=(read()%m);
        dp[i][a[i]]=1;
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<m;j++)
        {
            dp[i][j]=(dp[i][j]+dp[i-1][j]+dp[i-1][(j-a[i]+m)%m])%mod;
        }
    }
    cout<<dp[n][0]<<'\n';
}