信息学奥赛一本通——糖果

#include <iostream>
#include <cstring>

using namespace std;

const int N = 110;

int n, k;
int w[N];
int f[N][N];


int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i ++ ) cin >> w[i];
    
    memset(f, -0x3f, sizeof f);
    f[0][0] = 0;
    for (int i = 1; i <= n; i ++ ) 
        for (int j = 0; j < k; j ++ ) 
            f[i][j] = max(f[i - 1][j], f[i - 1][(j + k - w[i] % k) % k] + w[i]);
    
    cout << f[n][0] << endl;
    return 0;
}