习题3-6(uva-232)

#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int r, c,num = 1;
char matrix[10][10] = {0};
int id[10][10] = { 0 };

bool IsStart(int x, int y) {
	if (matrix[x][y] == '*') return false;
	int leftx = x - 1, upy = y - 1;
	if (leftx < 0 || upy < 0) return true;
	return matrix[leftx][y] == '*' || matrix[x][upy] == '*';
}

void ReadRow(int &x, int &y) {
	cout << setw(3) << id[x][y] << ".";

	while (x < r && matrix[x][y] != '*') { id[x][y] = 0; cout << matrix[x++][y];}
	cout << endl;
}

void ReadLine(int &x, int &y) {
	cout << setw(3) << id[x][y] << ".";

	while (y < c && matrix[x][y] != '*') cout << matrix[x][y++]; 
	cout << endl;
}

int main()
{
	int nCount = 0;
	while (cin >> r && r) {
		memset(id, 0, sizeof(id));
		cin >> c;
		num = 1;
		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				cin >> matrix[i][j];
				if (IsStart(i, j)) id[i][j] = num++;
			}
		}
		if (nCount) cout << endl;
		cout << "puzzle #" << ++nCount <<":"<< endl;
		cout << "Across" << endl;
		int last = 0;
		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				if(!id[i][j]) continue;
				ReadLine(i, j);
			}
		}
		cout << "Down" << endl;
		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				if (!id[i][j]) continue;
				last = i;
				ReadRow(i, j);
				i = last;
			}
		}
	}
	return 0;
}