aNode Too Far

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (32)
unordered_map<int,int> T;
int g[MX][MX],C,N,cc,S;
int st(int A){
    if(T.count(A))return T[A];
    return T[A]=C++;
}
int main(void){
    int a,b,h;
    while(scanf("%d",&N),N){
        T.clear(),C=0;
        F(MX)FF(MX)g[i][j]=i==j?0:INF-1;//init
        F(N)scanf("%d%d",&a,&b),a=st(a),b=st(b),g[a][b]=g[b][a]=a!=b;
        FT(0,C)F(C)FF(C)g[i][j]=min(g[i][j],g[i][k]+g[k][j]);//FW
        while(scanf("%d%d",&a,&b),a){
            S=0,h=a,a=st(a);
            F(C)S+=g[a][i]<=b;
            printf("Case %d: %d nodes not reachable from node %d with TTL = %d.\n",++cc,C-S,h,b);
        }
    }
    return 0;
}