Submission #1225422

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

using P = pair<ll, ll>;

int main() {
    int N;
    cin >> N;
    vector<vector<ll>> dp(N+1, vector<ll>(6*N+1, 0));
    dp[0][0] = 1;
    for(int i=0; i<N; ++i) {
        for(int j=1; j<=6; ++j) {
            for(int k=6*N-j; k>=0; --k) {
                dp[i+1][k+j] += dp[i][k];
            }
        }
    }
    int res = 0;
    for(int i=0; i<6*N+1; ++i) {
        if(dp[N][res] < dp[N][i]) {
            res = i;
        }
    }
    cout << res << endl;
}

Submission Info

Judge Result