40pt
查看原帖
40pt
317400
Foggy_night楼主2023/6/7 12:18
#include<iostream>
using namespace std;
int a[1005][1005], dp[1005][1005];
int main(){
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		int x, y;
		cin >> x >> y;
		a[x][y] = 1;
	}
	for(int i = 1; i <= n; i++)
	{
		if(!a[1][i])
			dp[i][1] = 1;
		if(!a[i][1])
			dp[1][i] = 1;
		else break;
	}	
	for(int i = 2; i <= n; i++)
		for(int j = 2; j <= n; j++)
			dp[i][j] = (dp[i][j] + dp[i-1][j] + dp[i][j-1]) % 100003;
	cout << dp[n][n] % 100003;
	return 0;
}
2023/6/7 12:18
加载中...