Codemaster
Открыть в Telegram
💯% Working Solution Provider of any Codechef Contest Very Trustable
Больше5 799
Подписчики
Нет данных24 часа
-127 дней
-7330 дней
Архив постов
5 799
#include <iostream>
#include <vector>
const int MOD = 998244353;
int puzzleWays(int a, int b, int c, int d) {
std::vector<std::vector<std::vector<std::vector<int>>>> dp(a + 1,
std::vector<std::vector<std::vector<int>>>(b + 1,
std::vector<std::vector<int>>(c + 1, std::vector<int>(d + 1, 0))));
dp[0][0][0][0] = 1;
for (int i = 0; i <= a; ++i) {
for (int j = 0; j <= b; ++j) {
for (int k = 0; k <= c; ++k) {
for (int l = 0; l <= d; ++l) {
if (i > 0 && j > 0) {
dp[i][j][k][l] = (dp[i][j][k][l] + dp[i - 1][j - 1][k][l]) % MOD;
}
if (j > 0 && k > 0) {
dp[i][j][k][l] = (dp[i][j][k][l] + dp[i][j - 1][k - 1][l]) % MOD;
}
if (k > 0 && l > 0) {
dp[i][j][k][l] = (dp[i][j][k][l] + dp[i][j][k - 1][l - 1]) % MOD;
}
if (l > 0 && i > 0) {
dp[i][j][k][l] = (dp[i][j][k][l] + dp[i - 1][j][k][l - 1]) % MOD;
}
}
}
}
}
return dp[a][b][c][d];
}
int main() {
int t;
std::cin >> t;
while (t--) {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << puzzleWays(a, b, c, d) << std::endl;
}
return 0;
}
