hdu 5464(01背包)

题意：有n个数字，选一些数字(也可以不选)，问和是p的倍数的方案数(0也是p的倍数)。
题解：每个数字是选或者不选，明显是01背包，因为每个数字的范围是-1e9到1e9，p的范围是1000，f[i][j]表示前i个数字余数为j的方案数，状态转移方程：
f[i][j] = f[i][j] + f[i - 1][j] 不选第i个数字
f[i][(j + a[i]) % p] = f[i][(j + a[i]) % p] + f[i - 1][j] 选了第i个数字

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 1005;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int n, p, a[N], f[N][N];

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d%d", &n, &p);
        memset(f, 0, sizeof(f));
        f[0][0] = 1;
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            a[i] %= p;
            a[i] = (a[i] + p) % p;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < p; j++) {
                f[i][j] = (f[i][j] + f[i - 1][j]) % MOD;
                f[i][(j + a[i]) % p] = (f[i][(j + a[i]) % p] + f[i - 1][j]) % MOD;
            }
        }
        printf("%d\n", f[n][0]);
    }
    return 0;
}