1839.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 29 行

/*  This Code is Submitted by wywcgs for Problem 1839 on 2006-09-03 at 22:22:30 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1024;

int main()
{
	int T, r, c, path[N];
	char map[N];

	scanf("%d", &T);
	for(int t = 0; t < T; t++) {
		scanf("%d %d\n", &r, &c);
		memset(path, 0, sizeof(path));
		for(int i = 0; i < r; i++) {
			gets(map);
			for(int j = 0; j < c; j++)
				if(map[j] == '#') path[j] = 0;
				else if(i == 0 && j == 0) path[j] = 1;
				else if(j != 0) path[j] += path[j-1];
		}
		printf("Existuje %d ruznych cest.\n", path[c-1]);
	}

	return 0;
}