最短路-find the safest road

#include<stdio.h>
double map[1005][1005];
double a[1005];
int v[1005];
int main()
{
    int n,m;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                scanf("%lf",&map[i][j]);
                if(i==j)
                    map[i][j]=1;
            }
        }
        for(int k=1; k<=n; k++)
        {
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=n; j++)
                {
                    if(map[i][j]<map[i][k]*map[k][j])
                    {
                        map[i][j]=map[i][k]*map[k][j];
                    }
                }
            }
        }
        /*for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
                printf("%.4f ",map[i][j]);
            printf("\n");
        }*/
        scanf("%d",&m);
        while(m--)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if(map[x][y]==0)
                printf("What a pity!\n");
            else
                printf("%.3f\n",map[x][y]);
        }
    }
    return 0;
}
/*
3
1 0.5 0.5
0.5 1 0.4
0.5 0.4 1
3
1 2
2 3
1 3
*/