UVaOJ 445 Marvelous Mazes

来源:互联网 发布:贪婪洞窟淘宝刷钻石 编辑:程序博客网 时间:2024/06/11 00:45
#include <stdio.h>#include <string.h>#include <ctype.h>char c;int main(){    //freopen("in.txt","r",stdin);    //freopen("out.txt","w",stdout);    int sum = 0;    while(scanf("%c",&c)!=EOF)    {        if(isdigit(c))        {            sum+=(int)(c-48);        }        else        {            switch(c)            {            case '\n':                printf("\n");                break;            case 'b':                for(int i=0; i<sum; i++)printf(" ");                break;            case '!':                printf("\n");                break;            default:                for(int i=0; i<sum; i++)printf("%c",c);                break;            }            sum = 0;        }    }    return 0;}

0 0