纵横字谜的答案(Crossword Answers)

本文介绍了一种解决填字游戏的程序设计方法,详细解释了如何通过标记和遍历来确定填字游戏中的横纵词汇及其起始位置。通过具体实例展示了程序的工作流程,并附上了实现该功能的C语言源代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

rossword Answers

Time limit: 3.000 seconds

 

 

A crossword puzzle consists of a rectangular grid of black and white squares and two lists of definitions (or descriptions).

One list of definitions is for ``words" to be written left to right across white squares in the rows and theother list is for words to be written down white squares in the columns. (A word is a sequence of alphabetic characters.)

To solve a crossword puzzle, one writes the words corresponding to the definitions on the white squares of the grid.

The definitions correspond to the rectangular grid by means of sequential integers on ``eligible" white squares. White squares with black squaresimmediately to the left or above them are ``eligible." White squares with nosquares either immediately to the left or above are also ``eligible." No othersquares are numbered. All of the squares on the first row are numbered.

The numbering starts with 1 and continues consecutively across white squares of the first row, then across the eligible white squares of the second row, then across the eligible white squares of the third row and so on across all of the rest of the rows of the puzzle. The picture below illustrates a rectangular crossword puzzle grid with appropriate numbering.

An ``across" word for a definition is written on a sequence of white squares ina row starting on a numbered square that does not follow another white square in the same row.

The sequence of white squares for that word goes across the row of the numbered square, ending immediately before the next black square in the row or in the rightmost square of the row.

A ``down" word for a definition is written on a sequence of white squares in acolumn starting on a numbered square that does not follow another white square in the same column.

The sequence of white squares for that word goes down the column of the numbered square, ending immediately before the next black square in the column or in the bottom square of the column.

Every white square in a correctly solved puzzle contains a letter.

You must write a program that takes several solved crossword puzzles as input and outputs the lists of across and down words which constitute the solutions.

Input

Each puzzle solution in the input starts with a line containing two integers rand c ( tex2html_wrap_inline39 and tex2html_wrap_inline41 ), where r (the first number) is the number ofrows in the puzzle and c (the second number) is the number of columns.

The rrows of input which follow each contain c characters (excluding the end-of-line) which describe the solution. Each of those c characters is an alphabeticcharacter which is part of a word or the character ``*", which indicates ablack square.

The end of input is indicated by a line consisting of the single number 0.

Output

Output for each puzzle consists of an identifier for the puzzle (puzzle #1:,puzzle #2:, etc.) and the list of across words followed by the list of downwords. Words in each list must be output one-per-line in increasing order of the number of their corresponding definitions.

The heading for the list of across words is ``Across". The heading for the list of down words is ``Down".

In the case where the lists are empty (all squares in the grid are black), the Across and Down headings should still appear.

Separate output for successive input puzzlesby a blank line.

Sample Input

2 2
AT
*O
6 7
AIM*DEN
*ME*ONE
UPON*TO
SO*ERIN
*SA*OR*
IES*DEA
0

Sample Output

puzzle #1:
Across
  1.AT
  3.O
Down
  1.A
  2.TO

puzzle #2:
Across
  1.AIM
  4.DEN
  7.ME
  8.ONE
  9.UPON
 11.TO
 12.SO
 13.ERIN
 15.SA
 17.OR
 18.IES
 19.DEA
Down
  1.A
  2.IMPOSE
  3.MEO
  4.DO
  5.ENTIRE
  6.NEON
  9.US
 10.NE
 14.ROD
 16.AS
 18.I
 20.A

这一题我刚看见想用的直接遇到*就输出一句单词然后换行,但是会遇到有2个或者多个连续的*出现,所以这种算法可以得到那些单词,但是格式错误
后来再仔细一看题目,发现还要求输出起始格的位置(题目给了起始格的定义),然后我看了看别人的代码,理解了这道题目到底什么含义

自己刚开始想的方法太蠢了 贴上正确代码:
 1 #include<stdio.h>
 2 #include<string.h>
 3 int main()
 4 {
 5     
 6     char puzzle[100][100];///定义表格
 7    
 8     int mark[10][10]; ///定义标记
 9     
10     int ct=0;///换行标记
11     
12     int m,n; 
13     
14     while(scanf("%d",&m)==1)///输入m 并判断其是否正确输入
15     {
16         if(m==0)break;///置零
17         memset(mark,0,sizeof(mark));///mark用来找起始格 多组样例 每次要清空
18         scanf("%d",&n);///输入n
19         int i=0;
20         while(i<m)
21             scanf("%s",puzzle[i++]);///初始化网格
22         int j,p=1;///遍历 并标记
23         
24         for(int i=0; i<m; i++)
25         {
26             for(j=0; j<n; j++)
27             {
28                 if(puzzle[i][j]=='*')continue;///若是'*' 跳出循环 继续循环
29                 
30                 if(i==0||j==0)mark[i][j]=p++;///标记初始格
31                 
32                 else if(puzzle[i-1][j]=='*'||puzzle[i][j-1]=='*')mark[i][j]=p++;///给起始格做标记 
33             }
34         }
35         if(ct)printf("\n");
36         printf("puzzle #%d:\n",++ct);
37         printf("Across\n");
38         ///遍历输出
39         for(int i=0; i<m; i++)
40         {
41             for(int j=0; j<n; j++)
42             {
43                 if(mark[i][j]>0)///初始格
44                 {
45                     printf("%3d.",mark[i][j]);///初始格后 一直输出 直到'*'
46                     while(j<n&&puzzle[i][j]!='*')
47                     {
48                         putchar(puzzle[i][j++]);
49                     }
50                     
51                     printf("\n");///换行
52                 }
53             }
54 
55         }
56         printf("Down\n");
57         for(int j=0; j<n; j++)
58         {
59             for(int i=0; i<m; i++)
60             {
61                 if(mark[i][j]>0)///初始格
62                 {
63                     printf("%3d.",mark[i][j]); ///初始格后 一直输出 直到'*'
64                     while(i<m&&puzzle[i][j]!='*')
65                     {
66                         putchar(puzzle[i++][j]);
67                     }
68                     printf("\n");///换行
69                 }
70             }
71 
72         }
73     }
74     return 0;
75 }

 



转载于:https://www.cnblogs.com/1starfish/p/8144051.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值