Crossword Answers
2015-07-29 21:39
302 查看
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.
and
),
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.
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.
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 (and
),
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 mustbe 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.
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
纯洁的我一开始是不知道紫书上有翻译的,然后……,题目就是一个字谜,然后按横向纵向输出单词,看了看样例大概能yy出来。
然后就是模拟,题目里面也说了,首先,第一行都是有数字的,然后就是左面或者上面是黑色的格子也有数字,按照这个规律对格子赋值就好了,最后按行或列找标记的数字输出就好了。
#include<cstdio> #include<cstring> #include<iostream> #include<string> #include<queue> #include<algorithm> using namespace std; string a[15]; int dp[15][15]; int main() { int i, j, m, n, ans, r, c, cnt, leap, p, k; p = 1; while (scanf("%d", &r) != EOF) { if (r == 0)break; scanf("%d", &c); for (i = 0; i < r; i++) cin >> a[i]; for (i = 0; i < r;i++) for (j = 0; j < c; j++) { dp[i][j] = 0; } cnt = 1; leap = 0; for (i = 0; i < c; i++) { if (a[0][i] == '*') leap = 0; else if (leap == 0){ dp[0][i] = cnt++; leap = 1; } else if (leap == 1){ dp[0][i] = cnt++; leap = 1; } } for (i = 1; i < r; i++) { for (j = 0; j < c; j++) { if (a[i][j] == '*')continue; else if (j >= 1 && a[i][j - 1] == '*') { dp[i][j] = cnt++; } else if (j == 0 && a[i][j] != '*') dp[i][j] = cnt++; else if (a[i - 1][j] == '*') dp[i][j] = cnt++; } } if (p != 1) cout << endl; cout << "puzzle #" << p << ":" << endl; p++; cout << "Across" << endl; for (i = 0; i < r; i++) { for (j = 0; j < c; ) { if (dp[i][j]) { if (dp[i][j] < 10) cout << " " << dp[i][j] << "."; else cout << " " << dp[i][j] << "."; k = 0; while (j + k < c&&a[i][j + k] != '*') { cout << a[i][j + k]; k++; } j = j + k; cout << endl; } else j++; } } cout << "Down" << endl; for (i = 0; i < c; i++) { if (dp[0][i]) { if (dp[0][i] < 10) cout << " " << dp[0][i] << "."; else cout << " " << dp[0][i] << "."; j = 0; while (j < r&&a[j][i] != '*') { cout << a[j][i]; j++; } cout << endl; } } for (i = 1; i < r; i++) { for (j = 0; j < c; j++) { if (dp[i][j] && a[i - 1][j] == '*') { if (dp[i][j] < 10) cout << " " << dp[i][j] << "."; else cout << " " << dp[i][j] << "."; k = 0; while (i + k < r&&a[i + k][j] != '*') { cout << a[i + k][j]; k++; } cout << endl; } } } } return 0; }
相关文章推荐
- zoj3728_Collision(简单计算几何)
- SQL Server建库-建表-建约束
- Bootstrap css背景图片的设置
- iOS——(文件管理)NSFileManager的常用方法
- PCI/PCIe接口卡Windows驱动程序(4)- 驱动程序代码(源文件)
- 利用QT中Qpainter画点,直线,弧线等简单图形
- Elasticsearch安装中文分词插件IK
- 图像去模糊之初探--Single Image Motion Deblurring
- C#中的WebBrowser控件的使用
- tsung 分布式压测工具
- diff两个文件夹里的东西
- xcode6的项目中虚拟键盘无法弹出
- Ajax中的XMLHttpRequest对象详解
- B\S备忘录23——Excalibur!!不对,是Expression!!
- struct/class/union内存对齐原则及面试题实例分析
- 大明A+B(1753)
- 《learning python the hard way》习题46 项目骨架搭建 问题小结(一)之软件包的安装
- Length of Last Word
- 一种面向高维数据的继承聚类算法
- PAT乙级 1016. 部分A+B