UVA_534_Frogger

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#pragma warning(disable:4996)
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
double distance(const pair<double, double>&a, const pair<double, double>&b)
{
return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
int n,count=0;
while (cin >> n)
{
if (!n)
{
break;
}
vector<pair<double,double>>position(n);
for (int i = 0; i < n; i++)
{
cin >> position[i].first >> position[i].second;
}
vector<vector<double>>graph(n,(vector<double>)n);
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
graph[i][j] = graph[j][i] = distance(position[i], position[j]);
}
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
auto max = std::max(graph[i][k],graph[k][j]);
graph[i][j] = std::min(graph[i][j], max);
}
}
}
printf("Scenario #%d\n",++count);
printf("Frog Distance = %.3lf\n\n",graph[0][1]);
}
    return 0;
}