0分求调Q_Q
查看原帖
0分求调Q_Q
1056753
What_is_Solution楼主2025/1/13 21:29

代码如下:

#include<bits/stdc++.h>
using namespace std;
const int mod = 100003;
int f[1005][1005], m, n, s, x, y;

int main() {
    cin >> n >> m;
    cin >> s;
    for (int i = 1; i <= s; i++) {
        cin >> x >> y;
        f[x][y] = -1;
    }
    f[1][1] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (i == 1 && j == 1) {
                continue;
            } else if (f[i][j] == -1) {
                f[i][j] = 0;
            } else {
                f[i][j] = (f[i - 1][j] + f[i][j - 1]) % mod;
            }
        }
    }
    cout << f[n][m];
}

这是哪错了啊a_a,dalao帮帮蒟蒻吧

2025/1/13 21:29
加载中...