UVa 336 - A Node Too Far

/*
Lionel Messi is such a player that you may catch him, you may touch him, you may feel him
and definitely you may Love him.
Lionel Messi is Messi. A little Magician in this World.

*/

// My Best Runtime: 0.010
// Accepted


#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 45;

vii adj[high];
int cost[high], visited[high];

int BFS(int s , int val)
{
    int u , v , cnt=0;
    vii :: iterator it;


    visited[s] = 1;
    cost[s] = 0;

    queue<int>Q;
    Q.push(s);

    while(!Q.empty())
    {
        u = Q.front();
        Q.pop();

        if(cost[u] > val) return cnt;

        cnt+=1;

        for(it=adj[u].begin(); it!=adj[u].end(); it++)
        {
            v = *it;

            if(visited[v] == 0)
            {
                visited[v] = 1;
                cost[v] = cost[u] + 1;
                Q.push(v);
            }
        }
    }
}

void CLR()
{
    for(int i=0; i<=high; i++)
    {
        adj[i].clear();
    }
}

int main()
{
    int N , i , TTL , tc=0 ;

    while(~sf("%d", &N) && N)
    {
        mpii mp;
        int assin=0 , ix , iy , x , y;
        CLR();

        while(N--)
        {
            scanf("%d %d", &ix, &iy);

                x = mp[ix];

                if(x == 0)
                {

                    mp[ix] = ++assin;

                    x = assin;
                }

                y = mp[iy];

                if(y == 0)
                {

                    mp[iy] = ++assin;

                    y = assin;
                }

                adj[x].push_back(y);
                adj[y].push_back(x);
            }

        while(~sf("%d %d", &x , &TTL))
        {
            if(!x && !TTL) break;

            y = x;
            x = mp[x];

            mset(cost , 0);
            mset(visited , 0);

            int ret = BFS(x , TTL);

            int ans = assin - ret;

            pf("Case %d: %d nodes not reachable from node %d with TTL = %d.\n", ++tc , ans, y , TTL);
        }
    }

    return 0;
}