Crossword
Answers
| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 869 | Accepted: 405 |
Description
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.
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.TOpuzzle #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
这是一道字符串模拟题。给你一个字符矩阵，让你水平读，竖直读。遇到‘*‘或者换行，就输出读取的字符串，至于编号，则是第一行和第一列非‘*’的都要标号，其他的若该字符不是‘*’并且其前一个或是上一个字符若为‘*’则将其编号。
下面是我的代码:
1 #include <iostream>
2 #include <iomanip>
3 using namespace std;
4 char ch[12][12];
5 int ch1[12][12];
6
7 int main()
8 {
9 int r,c,i,j,k,m,puzzle=1;
10 while(cin>>r && r)
11 {
12 cin>>c;
13 memset(ch1,0,sizeof(ch1));
14 for(i=0; i<r; i++)
15 for(j=0; j<c; j++)
16 cin>>ch[i][j];
17 m = 1;
18 for(i=0; i<r; i++) //对字符进行编号
19 for(j=0; j<c; j++)
20 {
21 if(i==0 || j==0)
22 {
23 if(ch[i][j] != ‘*‘)
24 ch1[i][j] = m++;
25 }
26 else
27 {
28 if(ch[i][j] != ‘*‘)
29 if(ch[i-1][j]==‘*‘ || ch[i][j-1]==‘*‘)
30 ch1[i][j] = m++;
31 }
32 }
33 cout<<"puzzle #"<<puzzle++<<":"<<endl;
34 cout<<"Across"<<endl;
35 {
36 for(i=0; i<r; i++)
37 for(j=0; j<c; j++)
38 {
39 if(ch[i][j]!=‘*‘)
40 {
41 cout<<setw(3)<<ch1[i][j]<<"."<<ch[i][j];
42 j++;
43 while(j<c && ch[i][j]!=‘*‘)
44 cout<<ch[i][j++];
45 j--;
46 cout<<endl;
47 }
48 }
49 }
50 cout<<"Down"<<endl;
51 {
52 for(i=0; i<r; i++)
53 {
54
55 for(j=0; j<c; j++)
56 {
57 k=i;
58 if(ch[k][j]!=‘*‘)
59 {
60 cout<<setw(3)<<ch1[k][j]<<"."<<ch[k][j];
61 ch[k][j] = ‘*‘;
62 k++;
63 while(k<r && ch[k][j]!=‘*‘)
64 {
65 cout<<ch[k][j];
66 ch[k][j] = ‘*‘;
67 k++;
68 }
69 k--;
70 cout<<endl;
71 }
72 }
73 }
74 }
75 cout<<endl;
76 }
77 return 0;
78 }