Description
Marvelous Mazes
Marvelous Mazes |
Your mission, if you decide to accept it, is to create a maze drawing program. A maze will consist of the alphabetic characters A-Z, *(asterisk), and spaces.
Input and Output
Your program will get the information for the mazes from the input file. This file will contain lines of characters which your program must interpret to draw a maze. Each row of the maze will be described by a series of numbers and characters, where the numbers before a character tell how many times that character will be used. If there are multiple digits in a number before a character, then the number of times to repeat the character is the sum of the digits before that character.
The lowercase letter "b" will be used in the input file to represent spaces in the maze. The descriptions for different rows in the maze will be separated by an exclamation point (!) or by an end of line.
Descriptions for different mazes will be separated by a blank line in both input and output. The input file will be terminated by an end of file.
There is no limit to the number of rows in a maze or the number of mazes in a file, though no row will contain more than 132 characters.
Happy mazing!
Sample Input
1T1b5T!1T2b1T1b2T!1T1b1T2b2T!1T3b1T1b1T!3T3b1T!1T3b1T1b1T!5T1*1T 11X21b1X 4X1b1X
Sample Output
T TTTTT T T TT T T TT T T T TTT T T T T TTTTT*T XX X XXXX X
解题报告
漫长的敲打代码,WA了两次。一开始使用gets()函数,发现有点不对劲,gets()函数在回车时就结束输入,就尝试用while((m=getchar())!=EOF)写,很奇怪的它不是多组输入似的。
其中遇到好几个问题,一个就是两个数字的问题,可以用累加的方式,但是最后要清零。还有就是分支语句的条件判断,一开始是把条件全都拆了,一条一条的判断,结果不知道为什么就WA了,看了网上大神的写法,就改进了下。
#include<stdio.h> #include<ctype.h> int main() { int i,j,s=0; char m; while((m=getchar())!=EOF) { if(isdigit(m)) s=s+m-48; else if(m=='\n'|| m=='!') putchar('\n'); else { if(m=='b') m=' '; for(j=1;j<=s;j++) putchar(m); s=0; } } return 0; }