UVa 422 - Word-Search Wonder

来源：互联网发布：淘宝买的玉石是真的吗编辑：程序博客网时间：2024/05/18 00:48

題目：在一個nxn的矩陣中尋找字符串，如果存在輸出對應的起始和結束位置。

分析：枚舉。直接按照八個方向枚舉起始位置判斷即可。

說明：讀取數據時需要判斷如實數字則本組結束。

#include <stdio.h>#include <stdlib.h>#include <string.h>char matrix[101][202];char words[101][101];int dxy[8][2] = {0,1, 0,-1, 1,1, 1,0, 1,-1, -1,1, -1,0, -1,-1};int find_word(char str[], int x, int y, int n){int s_x = x, s_y = y, e_x = x, e_y = y;for (int k = 0; k < 8; ++ k) {int flag = 1;x = s_x, y = s_y;for (int i = 0; str[i]; ++ i) {e_x = x, e_y = y;if (x < 0 || x >= n || str[i] != matrix[x][y]) {flag = 0;break;} x = (x + dxy[k][0] + n) % n;y = (y + dxy[k][1] + n) % n;}if (flag) {printf("%d,%d %d,%d\n", s_x+1, s_y+1, e_x+1, e_y+1);return 1;}}return 0;}int main(){int n;while (~scanf("%d",&n) && n) {for (int i = 0; i < n; ++ i) {scanf("%s",matrix[i]);}getchar();int word_size = 0;while (~scanf("%c",&words[word_size][0])) {ungetc(words[word_size][0], stdin);if (words[word_size][0] >= 'A' && words[word_size][0] <= 'Z') {scanf("%s",words[word_size]);getchar();word_size ++;}else {break;}}for (int k = 0; k < word_size; ++ k) {int find_word_flag = 0;for (int i = 0; i < n; ++ i) {for (int j = 0; j < n; ++ j) {if (find_word(words[k], i, j, n)) {find_word_flag = 1;break;}}if (find_word_flag) {break;}}if (!find_word_flag) {puts("Not found");}}}return 0;}

0 0