UVA - 10010 Where's Waldorf?
2016-07-12 18:15
465 查看
题目大意:给出几行几列的字母和几个单词,从字母列表里找单词,单词要位于一条直线上,可以从八个方向求找,输出第一个单词在表中的位置,无视大小写。
解题思路:输入时全部化为小写字母,找到第一个相同字母的位置先记录,然后按方向检索,成功就输出。
解题思路:输入时全部化为小写字母,找到第一个相同字母的位置先记录,然后按方向检索,成功就输出。
#include<iostream> #include<cstdio> #include<string.h> #include<stdlib.h> #include<cmath> using namespace std; char map[100][100]; char word[50]; int xx[]={0,-1,-1,-1,0,1,1,1}; int yy[]={-1,-1,0,1,1,1,0,-1}; int main() { int T, m, n, N; scanf("%d", &T); while(T--) { memset (map, '\0', sizeof(map)); scanf("%d%d\n", &m, &n); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { scanf("%c", &map[i][j]); if (map[i][j] >= 'A' && map[i][j] <= 'Z') map[i][j] = map[i][j] - 'A' + 'a'; } getchar(); } scanf("%d\n", &N); while(N--) { memset (word, '\0', sizeof(word)); int x = 0, y = 0, k = 0; gets(word); int len = strlen(word); for (int i = 0; i < len; i++) { if (word[i] >= 'A' && word[i] <= 'Z') word[i] = word[i] - 'A' + 'a'; } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if(map[i][j] == word[0]) for (int t = 0; t < 8; t++) { x = i; y = j; for (k = 0; x >= 0 && x <= m && y >= 0 && y <= n; k++) { if (map[x][y] != word[k]) break; if (k == len - 1) printf("%d %d\n", i+1, j+1); x += xx[t]; y += yy[t]; } if (k == len) break; } if (k == len) break; } if (k == len) break; } } if(T) printf("\n"); } return 0; }
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?