| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 869 | Accepted: 405 |
Description
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
Output
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
这是一道字符串模拟题。给你一个字符矩阵，让你水平读，竖直读。遇到'*'或者换行，就输出读取的字符串，至于编号，则是第一行和第一列非‘*’的都要标号，其他的若该字符不是‘*’并且其前一个或是上一个字符若为‘*’则将其编号。
下面是我的代码:
#include <iostream>
#include <iomanip>
using namespace std;
char ch[][];
int ch1[][]; int main()
{
int r,c,i,j,k,m,puzzle=;
while(cin>>r && r)
{
cin>>c;
memset(ch1,,sizeof(ch1));
for(i=; i<r; i++)
for(j=; j<c; j++)
cin>>ch[i][j];
m = ;
for(i=; i<r; i++) //对字符进行编号
for(j=; j<c; j++)
{
if(i== || j==)
{
if(ch[i][j] != '*')
ch1[i][j] = m++;
}
else
{
if(ch[i][j] != '*')
if(ch[i-][j]=='*' || ch[i][j-]=='*')
ch1[i][j] = m++;
}
}
cout<<"puzzle #"<<puzzle++<<":"<<endl;
cout<<"Across"<<endl;
{
for(i=; i<r; i++)
for(j=; j<c; j++)
{
if(ch[i][j]!='*')
{
cout<<setw()<<ch1[i][j]<<"."<<ch[i][j];
j++;
while(j<c && ch[i][j]!='*')
cout<<ch[i][j++];
j--;
cout<<endl;
}
}
}
cout<<"Down"<<endl;
{
for(i=; i<r; i++)
{ for(j=; j<c; j++)
{
k=i;
if(ch[k][j]!='*')
{
cout<<setw()<<ch1[k][j]<<"."<<ch[k][j];
ch[k][j] = '*';
k++;
while(k<r && ch[k][j]!='*')
{
cout<<ch[k][j];
ch[k][j] = '*';
k++;
}
k--;
cout<<endl;
}
}
}
}
cout<<endl;
}
return ;
}