poj 2472 106 miles to Chicago floyd
2011-11-26 21:06
465 查看
View Code
#include <stdio.h> #include <string.h> int n,m; double map[105][105]; void floyd() { int i,j,k; for (i=1;i<=n;i++) { for (j=1;j<=n;j++) { for (k=1;k<=n;k++) { if(i==j||i==k||j==k)continue; if(map[j][k]<map[j][i]*map[i][k]) map[j][k]=map[j][i]*map[i][k]; } } } } int main() { int a,b,i; double p; while (scanf("%d",&n)&&n) { scanf("%d",&m); memset(map,0,sizeof(map)); for (i=0;i<m;i++) { scanf("%d%d%lf",&a,&b,&p); map[a][b]=map[b][a]=p/100; } floyd(); printf("%.6lf percent\n",map[1] *100); } return 0; }
相关文章推荐
- Poj 2472 106 miles to Chicago【Floyd】
- POJ 2472 106 miles to Chicago(Floyd)
- POJ 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ-2472 106 miles to Chicago
- POJ 2472 ||SDUT 2358 106 miles to Chicago(Dijkstra算法变形)
- zoj 2792 && poj 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- ZOJ 2797 POJ 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- 【POJ】2472 106 miles to Chicago 最短路
- poj 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- poj 2472--106 miles to Chicago-最短路flody
- POJ 2472 106 miles to Chicago(最短路)
- POJ:2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ 2472 &&ZOJ 2797 (106 miles to Chicago)
- poj 2472 106 miles to Chicago a->b有安全概率,求i->j安全概率最大的一条路