P2946 [USACO09MAR] Cow Frisbee Team S

题目连接：[https://www.luogu.com.cn/problem/P2946](P2946 [USACO09MAR] Cow Frisbee Team S)

---

AC代码：

#include <bits/stdc++.h>
using namespace std;
# define i64 long long
bool _MUL = false;
const int N = 2e3 + 10;
const int mod = 1e8;
i64 arr[N][N];
void solve()
{
    i64 n, f;
    cin >> n >> f;
    vector<i64> v(n + 1);
    for(i64 i = 1; i <= n; ++ i)
        cin >> v[i];

    for(int i = 1; i <= n; ++ i)
    {
        (arr[i][v[i] % f] += 1) %= mod;
        for(int j = 0; j < f; ++ j)
        {
            (arr[i][j] += arr[i - 1][j]) %= mod;
            (arr[i][(j + v[i]) % f] += (arr[i - 1][j])) %= mod;
        }
    }
    cout << arr[n][0] % mod;
}
signed main()
{
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int _CASE = 1;
    if(_MUL) cin >> _CASE;
    while(_CASE --){
        solve();
    }
    return 0;
}