Marvelous Mazes

[Dheeraj Oswal]

Marvelous Mazes
Time Limit : 3 Seconds.

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

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

[Dheeraj Oswal]

I solved this one. Submitted the answer. But it says wrong answer :(
Anyone willing to attempt this one let me know if you get the right
answer.

> Source :http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&...

[Payas]

I got it.

Hi,

This is an automated response from UVa Online Judge.

Your submission with number 8335437 for the problem 445 - Marvelous
Mazes has succeeded with verdict Accepted.

Congratulations! Now it is time to try a new problem.

Best regards,

The UVa Online Judge team

[Payas]

Well algo is simple and I am damn sure you must have used the same
1)accept input as string or char array(i went for array)
2)check if arr[0]=\n indication of new maze
3)similarly assign checks for 'b' and '!'
4)create some int n and do n=no.- 48
run loop till j<n for printing the char for no. wala case
5) for b putchar 32(space)
6)if ! print newline

the possible areas of mistake according to me are
1) you must have created array of 132 char as one line contains atmost
132 characters. but as it is array you must include '\0' also. So
array of 133 is required.
2) interpretting the cases may be. as the nos. are also characters you
should handle them with care.

reply whether it helped.

[Dheeraj Oswal]

I solved it. Forgot to write it here. I made a mistake in returning the number. I was returning an int and the return type was char. SILLY :(