UVA - 445 Marvelous Mazes

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int main()
{
    int i,j,count;
    char s[1000];
    while(gets(s)!=NULL)
    {
        count=0;
        for(i=0;i<strlen(s);i++)
        {
            if(s[i]>='0'&&s[i]<='9')
                count+=s[i]-'0';
            if(s[i]>='A'&&s[i]<='Z'||s[i]=='*')
            {
                for(j=0;j<count;j++)
                    cout<<s[i];
                count=0;
            }
            if(s[i]=='b')
            {
                for(j=0;j<count;j++)
                    cout<<' ';
                count=0;
            }
            if(s[i]=='!')
                cout<<endl;
        }
        cout<<endl;
    }
    return 0;
}