Submission

Score: 0

User: vachirasawin

Problemset: กองไฟ

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-13 19:06:09

// grader-chan | SU
// c2_su64_bonfire.cpp | c2_su64_bonfire

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int N;
    cin >> N;

    int a, b, c;
    cin >> a >> b >> c;

    long long dp[50][50][50][4];
    dp[0][0][0][0] = 1;
    dp[0][0][0][1] = 1;
    dp[0][0][0][2] = 1;
    dp[0][0][0][3] = 1;

    for (int i = 0; i <= a; i++) {
        for (int j = 0; j <= b; j++) {
            for (int k = 0; k <= c; k++) {
                if (i == 0 && j == 0 && k == 0) continue;

                for (int last = 0; last <= 3; last++) {
                    long long ways = 0;

                    if (i > 0 && last != 1) {
                        ways = (ways + dp[i - 1][j][k][1]) % 1000000007;
                    }
                    if (j > 0 && last != 2) {
                        ways = (ways + dp[i][j - 1][k][2]) % 1000000007;
                    }
                    if (k > 0 && last != 3) {
                        ways = (ways + dp[i][j][k - 1][3]) % 1000000007;
                    }

                    dp[i][j][k][last] = ways;
                }
            }
        }
    }

    cout << dp[a][b][c][0];

    return 0;
}