UVA 445 Marvelous Mazes
来源:互联网 发布:过滤器 angular在js 编辑:程序博客网 时间:2024/06/11 20:45
#include <cstdio>#include <cstring>int main() {char str[300];while (gets(str)) {int len = strlen(str), sum = 0;for (int i = 0; i < len ; i++) {if(str[i] >= '0' && str[i] <= '9')sum += str[i] - '0';else if (str[i] == '!')printf("\n");else while (sum) {printf("%c", str[i] == 'b'? ' ': str[i]);sum--;}}printf("\n");}return 0;}
0 0
- 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
- UVA 445 Marvelous Mazes
- HDU 3549 Flow Problem
- x86的ABI分析(函数实现原理)--part2
- 杭电acm hdu-1060Leftmost Digit
- HDU 1166 敌兵布阵 (树状数组)
- gcc编译器对memcpy的优化
- UVA 445 Marvelous Mazes
- 字符串匹配算法 BF/KMP实现/栈、队列
- UVA 11235 - Frequent values(RMQ)
- B树/B+树
- HDU n^n求最高位
- hdu 2552 三足鼎立
- leetcode median of two sorted arrays
- 死锁的三种形式:一般死锁,嵌套管程锁死,重入锁死
- js识别不同浏览器