UVA 445 Marvelous Mazes
来源:互联网 发布:cf雷神刷枪软件 编辑:程序博客网 时间:2024/06/11 15:17
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 11X21b1X4X1b1X
Sample Output
T TTTTTT T TTT T TTT T TTTT TT T TTTTTT*T XX XXXXX X
题意:
将字符串转换成非凡的迷宫,‘!’对应回车,‘b’对应空格,其他字母或字符前面的数字累加的和就是输出这个东西的个数。
疏忽大意,作了好久!
#include<cstdio>#include<iostream>#include<cstring>#include<cctype>using namespace std;int main(){ char ch[150]; int i, j; while(gets(ch) != NULL){ int s = 0; for(i = 0; i < strlen(ch); i++){ if(isdigit(ch[i])) s += ch[i] - '0'; //是数字的话,累加 else{ if(ch[i] == '!') printf("\n"); else{ while(s--) { if(ch[i] == 'b') printf(" "); else printf("%c", ch[i]); } s = 0; } } } printf("\n"); } return 0;}
- 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
- UVA 445 Marvelous Mazes
- 4.4-按行输出二叉树(same in LeetCode)
- 系统开发权限总结篇
- linux--档案的搜寻
- 华为副总裁徐家骏离职:年薪千万工作感悟十二条
- NSString类的使用及其内部方法
- UVA 445 Marvelous Mazes
- BEGINNING SHAREPOINT® 2013 DEVELOPMENT 第4章节--理解你的开发选项 应用程序和解决方案类型
- 张飞传
- UVA 1649
- win8下cocos2dx3.2移植android平台及代码打包APK
- 从零开始—java中第一个数组
- FragmentActivity实现滑动
- Mnesia数据库的一些细节问题
- hdu 1002