UVa 445 Marvelous Mazes (water ver.)
来源:互联网 发布:微信数据迁移即将完成 编辑:程序博客网 时间:2024/05/20 01:45
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;}
- UVa 445 Marvelous Mazes (water ver.)
- UVa 445 - Marvelous Mazes
- Uva 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA-445-Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA:445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVA - 445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVa 445 Marvelous Mazes
- UVA 445 Marvelous Mazes
- UVA - 445 Marvelous Mazes
- UVA 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA - 445 Marvelous Mazes
- 2014年华为上机题目
- 3 线性回归模型
- 用 rman 备份自动备份控制文件恢复数据库
- XML:四种解析器(dom,sax,jdom,dom4j)原理及性能比较
- C++中友元函数和成员函数的区别
- UVa 445 Marvelous Mazes (water ver.)
- JUnit的各种断言
- (poj1.1.2)2965(The Pilots Brothers' refrigerator——DFS+枚举)
- git format-patch 使用方法
- php mysql计数器代码一例
- php图片计数器的代码
- 顽石Ceo见解
- 堆和栈的区别
- 软件工程——需求分析