UVA 445 - Marvelous Mazes

Problem PDF

Solution:

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include
using namespace std;
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
int main()
{
    char s[100010];
    while(gets(s))
    {
        int c=0;
        for(int i=0;s[i]!='\0';i++)
        {
            switch(s[i])
            {
            case 'b':
            {
            for(int j=0;j
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/445/445.cpp