UVA 567 risk FLOYD

#include <cstdio>
#include <algorithm> 
#define N 20
using namespace std; 
const int inf = 2000000; 
int f[N + 3][N + 3];
int s[102],e[102]; 
int a,  n, x;

void pro( int t)
{
      for (int i = 0; i < x ; i++){
                     scanf("%d", &a) ; 
                     f[a][t] = f[t][a] = 1;
      }
} 

int ca = 1; 
int main()
{
      
     while (scanf("%d", &x) != EOF)
     {
            for (int i = 1; i <= N; i++){ 
               for (int j = 1; j <= N; j++)
                   f[i][j] = inf;
               f[i][i] = 0;
            } 
            pro(1); 
            for (int i = 2; i <= 19; i++)
                  scanf("%d", &x),pro(i);
             
            for (int k = 1; k <= N; k++) 
            for (int i = 1; i <= N; i++)  
               for (int j = 1; j <= N; j++)  
                       f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
             printf("Test Set #%d\n", ca++);
            scanf("%d", &n);
            int ss, ee; 
            for (int i = 0; i < n ;i ++)
            { 
                scanf("%d %d",  &ss, &ee);
                 printf("%2d to %2d:%2d\n", ss, ee, f[ss][ee]);
            }  
            puts(""); 
          //  getchar(); 
     }
     return 0;
}