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
原创粉丝点击