Dice Cup

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

ll s[444][22];

/**
 * ups ratkaisin yleisen version -_-
 */

int main () {
    int n, m;
    cin>>n>>m;
    s[0][0] = 1;
    ll mx = 0;
    for (int i = 1; i <= 2; i++) {
        mx = 0;
        for (int j = 1; j <= m; j++) {
            for (int k = 400; k >= j; k--) {
                s[k][i] += s[k - j][i - 1];
                mx = max(mx, s[k][i]);
            }
        }
        m = n;
    }
    for (int i = 1; i <= 400; i++) {
        if (s[i][2] == mx) cout<<i<<endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED