提交者：@

这题是dp？？？什么玩意

递推：每个格子都是他左边的和他上面的数量和

#include <iostream>
using namespace std;
int a[105][105];
char c[105][105];
int x,y,sx,sy;
int main()
{
	int n;
	cin >> n;
	cin >> x >> y >> sx >> sy;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			cin >> c[i][j];
		}
	}
	a[x][y]=1;
	for(int i = x; i <= sx; i++){
		for(int j = y; j <= sy; j++){
			if(i==x&&j==y)a[i][j]=1;//要把起点设为1
			else if(c[i][j]!='#')a[i][j]=a[i-1][j]+a[i][j-1];//递推
//			cout << a[i][j] << " ";
		}
//		cout << endl;
	}
	cout << a[sx][sy];
}