acm-uva445(水题)
2014-07-21 20:55
302 查看
/*
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
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
*/
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
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
*/
#include<iostream> #include<string.h> #include<ctype.h> #define MAXN 1000 using namespace std; char a[MAXN]; int main(){ while(cin.getline(a,MAXN)){ int len = strlen(a); for(int i=0;i<len;i++){ if(a[i]=='!') cout<<endl; if(isalpha(a[i])||a[i]=='*'){ int x=0,y,flag=1; if(!isdigit(a[i-2])&&isdigit(a[i-1])) { flag=0; } else if(isdigit(a[i-2])&&isdigit(a[i-1])){ flag=1; } if(flag) x=a[i-2]-'0'; y=a[i-1]-'0'; for(int j=0;j<x+y;j++){ if(a[i]=='b')cout<<' '; else cout<<a[i]; } } } cout<<endl; } return 0; }
相关文章推荐
- acm-UVA1055(水题)
- acm-UVA10071(水题)
- acm-uva488(水题)
- acm-uva458(水题)
- acm-UVA494(水题)
- acm-UVa414(水题)
- UVA445水题
- [ACM_水题] UVA 11292 Dragon of Loowater [勇士斗恶龙 双数组排序 贪心]
- [ACM_水题] UVA 11729 Commando War [不可同时交代任务 可同时执行 最短完成全部时间 贪心]
- acm-uva490(水题)
- [ACM_水题] UVA 12502 Three Families [2人干3人的活后分钱,水]
- 算法竞赛 例3-5生成元(Digit Generator,ACM/ICPC Seoul 2005,UVa1583)
- hdu 5007 Post Robot 水题 2014 ACM/ICPC Asia Regional Xi'an Online
- Uva 11461 - Square Numbers 解题报告(水题)
- UVa 11040 Add bricks in the wall (水题递推)
- UVa 7037 ACM/ICPC 2014 Xian(网络流+最大密度子图)
- UVa 10112 - Myacm Triangles
- UVA - 10112 Myacm Triangles
- UVA10300 Ecological Premium【Ad Hoc+水题】
- Uva 10112 Myacm Triangles