Uva 445 Marvelous Mazes
2012-03-29 16:04
435 查看
#include<stdio.h> #include<ctype.h> #include<string.h> int main() { int count=0; char ch; while(scanf("%c",&ch)!=EOF) { if(isdigit(ch)) count += ch - '0'; else if((isalpha(ch) && ch != 'b') || ch=='*') { while(count--) printf("%c",ch); count = 0; } else if(ch=='b') { while(count--) printf(" "); count = 0; } else if(ch=='!' || ch =='\n') { printf("\n"); count = 0; } } return 0; }
相关文章推荐
- UVa 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- uva445 Marvelous Mazes
- Uva 445 Marvelous Mazes
- UVa - 445 - Marvelous Mazes(AC)
- UVA - 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- uva445 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
- UVa445 - Marvelous Mazes
- 算法竞赛入门经典-前四章-UVa445 - Marvelous Mazes-非凡的迷宫-难度1
- UVA445—— Marvelous Mazes
- UVA445―― Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes