UVA oj 445 Marvelous Mazes(水题字符串)
2016-06-02 12:31
274 查看
Marvelous Mazes
Submit Status
Description
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
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!
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
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 numbersand 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
看样例就能直接猜出来的题,但是要注意输入一个空行也要输出一个空行,换成gets就过了
#include<cstdio> #include<iostream> #include<cstring> using namespace std; const int maxn = 150; char a[maxn]; int main() { while(gets(a)) { int len = strlen(a); for(int i=0;i<len;i++) { int sum = 0; while((a[i] >= '0' && a[i] <= '9') && i < len ) { sum += (a[i] - '0'); i++; } if(a[i] != '!') for(int k=0;k<sum;k++) { if(a[i] == 'b') printf(" "); else printf("%c",a[i]); } else printf("\n"); } printf("\n"); } return 0; }
相关文章推荐
- Cookie介绍
- Mybatis generator 自动生成代码时 ,insert如何返回主键值
- UESTC 486 Good Morning (水题+坑!)
- location对象
- TrueCrypt加密安全问题
- TCP、UDP、HTTP、SOCKET
- Nginx: error while loading shared libraries: libpcre.so.1解决
- From CORBA technology To Thrift technology
- volatile unsigned char; volatile有利于全局变量的实时更新,尤其含有中断中改变的量
- (礼拜四log)前端开发:Date
- Nginx+Luajit服务器全校验遇到的问题
- NSInvocation 注意事项
- HDU 5360 Hiking (贪心+优先队列)
- dwr3实现消息精确推送详细步骤
- 设置系统栏可见性
- Android中<meta-data>的使用
- 用VirtualBox 导入vmware的虚拟机
- PPT演示文稿放映时会议记录的技巧
- 启动系统设置页面
- 删除字符串