UVa 445 Marvelous Mazes (water ver.)

445 - Marvelous Mazes

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=386

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 11X21b1X4X1b1X

Sample Output

T TTTTTT  T TTT T  TTT   T TTTT   TT   T TTTTTT*T XX   XXXXX X

完整代碼：

/*0.009s*/  #include<cstdio>#include<cctype>  char str[150];  int main(void){    int i, j;    while (gets(str))    {        int cnt = 0;        for (i = 0; str[i]; i++)        {            if (str[i] == '!')                putchar('\n');            else if (isdigit(str[i]))                cnt += str[i] & 15;            else            {                for (j = 0; j < cnt; j++)                    putchar(str[i] == 'b' ? ' ' : str[i]);                cnt = 0;            }        }        putchar('\n');    }    return 0;}

查看本欄目更多精彩內容：http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/