POJ 2472 106 miles to Chicago(Floyd)

题目链接

这个题好搞笑啊。。。少输出后面的单词，居然也AC。。。以前就见过题，表示再次读题，费了很长时间。

 1 #include <stdio.h>
 2 #include <string.h>
 3 double p[101][101];
 4 int main()
 5 {
 6     int n,m,i,j,k,sv,ev;
 7     double w;
 8     while(scanf("%d",&n)!=EOF)
 9     {
10         if(n == 0) break;
11         scanf("%d",&m);
12         memset(p,0,sizeof(p));
13         for(i = 1;i <= m;i ++)
14         {
15             scanf("%d%d%lf",&sv,&ev,&w);
16             if(p[sv][ev] < w)
17             {
18                 p[sv][ev] = w;
19                 p[ev][sv] = w;
20             }
21         }
22         for(k = 1;k <= n;k ++)
23         for(i = 1;i <= n;i ++)
24         for(j = 1;j <= n;j ++)
25         {
26             if(p[i][j] < p[i][k]*p[k][j]/100)
27             p[i][j] = p[i][k]*p[k][j]/100;
28         }
29         printf("%.6lf percent\n",p[1][n]);
30     }
31     return 0;
32 }

转载于:https://www.cnblogs.com/naix-x/archive/2012/06/21/2558192.html