Marvelous Mazes

原创 2013年12月04日 20:35:20

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
#include <stdio.h>
int main()
{
    int i, s = 0;
    char a;
    while((a = getchar())!=EOF)
    {
        if(a >= '0' && a <= '9')
        {
            s = s + a - 48;
        }
        else if(a == 'b')
        {
            for(i = 1; i <= s; i++)
            {
                printf(" ");
            }
            s = 0;
        }
        else if(a != '\n' && a != '!')
        {
            for(i = 1; i <= s; i++)
            {
                printf("%c", a);
            }
            s = 0;
        }
        else
        {
            printf("\n");
            s = 0;
        }
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

UVa 445 Marvelous Mazes(非凡的迷宫)

Marvelous Mazes  Your mission, if you decide to accept it, is to create a maze drawing program...

445 - Marvelous Mazes

Marvelous Mazes  Your mission, if you decide to accept it, is to create a mazedrawing pro...

UVA oj 445 Marvelous Mazes(水题字符串)

Marvelous Mazes Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %l...
  • Sara_YF
  • Sara_YF
  • 2016年06月02日 12:31
  • 145

UVA, 445 Marvelous Mazes(根据输入的字符输出相应的矩阵)

Problem H : Marvelous Mazes From:UVA, 445 Marvelous Mazes Your mission,...

UVa - 445 - Marvelous Mazes(AC)

Your mission, if you decide to accept it, is to create a maze drawing program. A maze will consist o...

UVa 445 Marvelous Mazes (water ver.)

445 - Marvelous Mazes Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onli...

Marvelous Mazes

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

UVA 445 - Marvelous Mazes

题目链接:445 - Marvelous Mazes  Marvelous Mazes  Your mission, if you deci...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Marvelous Mazes
举报原因:
原因补充:

(最多只允许输入30个字)