题解 | 小红走矩阵
小红走矩阵
https://www.nowcoder.com/practice/1ae49fb83b3f404f89dc0933bb8a0694
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
const int N = 1010,M = 1010;
int dp[N][M];
int main(){
int n,m; cin >> n >> m;
dp[1][0] = 1;
for(int i=1 ; i <= n ; i++){
for(int j=1 ; j <= m ; j++){
dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % MOD;
}
}
cout << dp[n][m];
return 0;
}
查看7道真题和解析