UVa - 445 - Marvelous Mazes(AC)
来源:互联网 发布:初学者学linux 编辑:程序博客网 时间:2024/06/05 23:42
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
题意:就是根据读入的字符串输出图形
注意: 不同的图之间通过空行分离,直接无视就行
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){char ch;int count = 0, i;int num = 0;while((ch = getchar())!=EOF){if(isdigit(ch)){count += ch - '0'; //转换为整型}else if(ch == '!'){printf("\n");}else if(ch == 10) //ASCII为10是换行符{printf("\n");}else{for(i = 0; i < count; i++){if(ch == 'b')putchar(' ');elseprintf("%c", ch);}count = 0;}}return 0;}
- UVa - 445 - Marvelous Mazes(AC)
- 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
- SORM与MYSQL的最简例子
- C实现cpu运算
- ios 异常处理 来自开源中国代码 记录下
- 深度剖析C++虚函数
- 作为程序员应该知道的九句话
- UVa - 445 - Marvelous Mazes(AC)
- SQL语言学习小结(一)
- BOM 输入物料反查函数(待测试) CS15功能类似
- HDU 4436 str2int(后缀数组,一种统计n个digit字符串所有不同子串之和的方法)
- struts2的配置文件global-results
- 让sles10支持多处理器
- 第十二周项目三 用递归方法求解(2)求1*3*...*n的递归式
- Java操作LDAP的基本方法
- 第12周项目递归函数返回fib(20)