Where's Waldorf?
来源:互联网 发布:mac java安装到哪里了 编辑:程序博客网 时间:2024/06/05 08:58
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.The input begins with a pair of integers, m followed by n, in decimal notation on a single line. The next m lines contain nletters each; this is the grid of letters in which the words of the list must be found. The letters in the grid may be in upper or lower case. Following the grid of letters, another integer k appears on a line by itself ( ). The next k lines of input contain the list of words to search for, one word per line. These words may contain upper and lower case letters only (no spaces, hyphens or other non-alphabetic characters).
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.For each word in the word list, a pair of integers representing the location of the corresponding word in the grid must be output. The integers must be separated by a single space. The first integer is the line in the grid where the first letter of the given word can be found (1 represents the topmost line in the grid, and m represents the bottommost line). The second integer is the column in the grid where the first letter of the given word can be found (1 represents the leftmost column in the grid, and n represents the rightmost column in the grid). If a word can be found more than once in the grid, then the location which is output should correspond to the uppermost occurence of the word (i.e. the occurence which places the first letter of the word closest to the top of the grid). If two or more words are uppermost, the output should correspond to the leftmost of these occurences. All words can be found at least once in the grid.
Sample Input
18 11abcDEFGhigghEbkWalDorkFtyAwaldORmFtsimrLqsrcbyoArBeDeyvKlcbqwikomkstrEBGadhrbyUiqlxcnBjf4WaldorfBambiBettyDagbert
Sample Output
2 52 31 27 8
- 110302 Where's Waldorf (Where s Waldorf)
- 10010- Where's Waldorf?
- 10010 Where's Waldorf?
- 10010 - Where's Waldorf?
- Where's Waldorf?
- Where's Waldorf?
- 10010 - Where's Waldorf?
- uva10010 - Where's Waldorf?
- uva10010 - Where's Waldorf?
- 10010 - Where's Waldorf?
- uva_10010-Where's Waldorf?
- 10010 - Where's Waldorf?
- 10010 - Where's Waldorf?
- 10010 - Where's Waldorf?
- UVa10010 Where's Waldorf?
- 10010 - Where's Waldorf?
- Where's Waldorf?
- Where's Waldorf?
- 利用指针对两个数字进行排序
- C#判断操作系统类型总结
- 带你走进“微”世界 与你共创“微”未来
- [学习笔记]do{...}while(0)的意义和用法
- Linux下安装telnet-server服务
- Where's Waldorf?
- js线程机制
- jQuery实现可编辑表格
- dede 提交表单 发送邮件
- mysql tpch
- 历届博客之星获奖博客分享
- java 加密 rsa例子
- linux中eclipse调试mysql源代码
- Automatic Poetry