15分,样例过不去,求dalao帮忙看看
查看原帖
15分,样例过不去,求dalao帮忙看看
781131
suxiaozhou楼主2023/10/14 19:54

15分,样例过不去,求dalao帮忙看看

#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int dp[50][50][110], n, m, k, a[50][50], b[50][50];

int main() {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> b[i][j];
		}
	}
	dp[1][1][k] = 1;
	for (int l = k; l >= 0; l--) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				dp[i][j][l] = (dp[i - 1][j][l + a[i - 1][j]] % MOD + dp[i][j - 1][l + b[i][j - 1]] % MOD + dp[i][j][l]) % MOD;
			}
		}
	}
	/*
	for (int l = k; l > 0; l--) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << dp[i][j][l] << " ";
			}
			cout << endl;
		}
		cout << endl;
	}
	*/
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << dp[i][j][0] << " ";
		}
		cout << endl;
	}
	return 0;
}

样例输入:

3 3 5
3 2 1
2 1 3
1 3 2
1 2 3
2 3 1
3 1 2

代码错误输出:

0 0 0
0 1 0
1 0 1

求调,太谢谢了!!

2023/10/14 19:54
加载中...