2013秋13级预备队集训练习1 H - Marvelous Mazes
来源:互联网 发布:网络管理工具有哪些 编辑:程序博客网 时间:2024/06/04 17:51
Marvelous Mazes
Your mission, if you decide to accept it, is to create a maze drawing program. A maze will consist of the alphabetic charactersA-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#include<stdio.h>#include<string.h>int main(){ int i , j , a = 0 ; char str[133]; while(gets(str)!=NULL) { for(i = 0 ; str[i]!='\0' ; i++) { if(str[i]=='!') printf("\n");if(str[i] >= '0' && str[i]<= '9')a = a + str[i] - '0';else{for(j = 0 ; j < a ; j++){if(str[i]=='b')printf(" ");elseprintf("%c", str[i]);}a = 0;} } printf("\n"); } return 0 ;}
- 2013秋13级预备队集训练习1 H - Marvelous Mazes
- 2013秋13级预备队集训练习2 --H - Immediate Decodability
- 2013秋13级预备队集训练习4 --H - Factstone Benchmark
- 2013秋13级预备队集训练习2 --A - Palindromes
- 2013秋13级预备队集训练习4 --B - Steps
- 2013秋13级预备队集训练习1 A - Hashmat the Brave Warrior
- 2013秋13级预备队集训练习1 B - Back to High School Physics
- 2013秋13级预备队集训练习1 C - Ecological Premium
- 2013秋13级预备队集训练习1 D - The Decoder
- 2013秋13级预备队集训练习1 E - Kindergarten Counting Game
- 2013秋13级预备队集训练习1 F - Machined Surfaces
- 2013秋13级预备队集训练习1 G - Rotating Sentences
- 2013秋13级预备队集训练习1 I - Triangle Wave
- 2013秋13级预备队集训练习1 J - Hangman Judge
- 2013秋13级预备队集训练习1 K - The Collatz Sequence
- 2013秋13级预备队集训练习1 L - Linear Cellular Automata
- 2013秋13级预备队集训练习3 --E - The ? 1 ? 2 ? ... ? n = k problem
- 2013秋13级预备队集训练习3--A - Power of Cryptography
- 要学的
- Android Tombstone/Crash的log分析和定位(救命的文章)
- tomcat重定向
- USB的gadget driver及usb枚举分 析
- response.getWriter()写超链接时应该用绝对地址加工程名
- 2013秋13级预备队集训练习1 H - Marvelous Mazes
- openwrt常用功能编译选项
- django redirect
- 在ArcEngine下实现图层属性过滤的两种方法
- javabean用变量向数据库中插入记录的sql语句写法
- 2013秋13级预备队集训练习1 I - Triangle Wave
- linux设置时间
- Android开发学习之UnIty3D重力感应
- 显示系统支持的最大连接数