UVA-232 ( Crossword Answers)

本文深入探讨了一种解决填字游戏的算法实现,详细解析了如何通过输入已解决的填字游戏网格来生成对应的横向和纵向单词列表,以及如何正确处理填字游戏的结构和规则。

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

题目

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 the other 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 squares immediately to the left or above them are “eligible.” White squares with no squares either immediately to the left or above are also “eligible.” No other squares 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 in a 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 a column 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 r and c (1 ≤ r ≤ 10 and 1 ≤ c ≤ 10), where r (the first number) is the number of rows in the puzzle and c (the second number) is the number of columns. The r rows of input which follow each contain c characters (excluding the end-of-line) which describe the solution. Each of those c characters is an alphabetic character which is part of a word or the character ‘*’, which indicates a black 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 down words. 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 puzzles by a blank line.
在这里插入图片描述

在这里插入图片描述

题目大意:

输入两个数字限制行和列,再输入表格,最后按照要求对每个样例输出Across和Down
每个样例先输出puzzle #i:(i表示第几个样例)
止于横纵的规则以及每一个横纵字词前面的数字的规则,我有点表达不清,怕越解释越乱我就不过多解释了
重要的是这里每一个横纵字词前面的数字有规定域宽(域宽为3)
c中可以用%3d规定整型的域宽
还有就是两个样例之间用换行分隔
但是最后一个样例后面没有换行符!!!

AC代码

#include<stdio.h>
char paper[15][15];
int num[15][15];
int main()
{
    int n,m;
    int w=0;
    int i,j;
    while(scanf("%d",&n))
    {
        if(n==0)
            break;
        scanf("%d\n",&m);
        w++;
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
                scanf("%c",&paper[i][j]);
            getchar();
        }
        int x=1;
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                if(paper[i][j]!='*'&&(paper[i][j-1]=='*'||paper[i-1][j]=='*'||i==0||j==0))
                {
                    num[i][j]=x++;
                }
            }
        }
        if(w>1)
            putchar('\n');
        printf("puzzle #%d:\n",w);
        printf("Across\n");
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                if(paper[i][j]!='*'&&(paper[i][j-1]=='*'||j==0))
                {
                    printf("%3d.",num[i][j]);
                    while(paper[i][j]!='*'&&j<m)
                    {
                        printf("%c",paper[i][j]);
                        j++;
                    }
                    putchar('\n');
                }
            }
        }
        printf("Down\n");
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                int z=i;
                if(paper[z][j]!='*'&&(paper[z-1][j]=='*'||z==0))
                {
                    printf("%3d.",num[z][j]);
                    while(paper[z][j]!='*'&&z<n)
                    {
                        printf("%c",paper[z][j]);
                        z++;
                    }
                    putchar('\n');
                }
            }
        }
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值