UVA 821 Page Hopping——最短路

UVA 821 Page Hopping——最短路

#include #include #include #include using namespace std;const int maxn = 105;const int INF = 0X3f3f3f3f;int kase = 0;int cnt, dp[maxn][maxn];int main() { int a, b; while (~scanf("%d %d", &a, &b) && a + b) { cnt = 0; memset(dp, INF, sizeof(dp)); for (int i = 1; i <= 100; i++) dp[i][i] = 0; dp[a][b] = 1; while (~scanf("%d %d", &a, &b) && a + b) dp[a][b] = 1; for (int k = 1; k <= 100; k++) { for (int i = 1; i <= 100; i++) { for (int j = 1; j <= 100; j++) { dp[i][j] = min(dp[i][j], dp[i][k]+dp[k][j]); } } } int ans = 0; for (int i = 1; i <= 100; i++) { for (int j = 1; j <= 100; j++) { if (dp[i][j] < INF && dp[i][j] != 0) { ans += dp[i][j]; cnt++; } } } printf("Case %d: average length between pages = %.3lf clicks\n", ++kase, 1.0*ans/cnt); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。