bzoj 1491 floyd

/**************************************************************
    Problem: 1491
    User: BLADEVIL
    Language: C++
    Result: Accepted
    Time:68 ms
    Memory:948 kb
****************************************************************/
 
//By BLADEVIL
#include <cstdio>
#include <cstring>
#define maxn 110
#define maxm 10010
 
using namespace std;
 
int n,m;
int dis[maxn][maxn];
double w[maxn][maxn],ans[maxn];
 
int main() {
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++) dis[i][j]=10000000;
    for (int i=1;i<=m;i++) {
        int x,y,z; scanf("%d%d%d",&x,&y,&z);
        dis[x][y]=dis[y][x]=z;
        w[x][y]=w[y][x]=1;
    }
    for (int k=1;k<=n;k++) {
        for (int i=1;i<=n;i++) if (i!=k)
            for (int j=1;j<=n;j++) if (j!=i&&j!=k) {
                if (dis[i][k]+dis[k][j]<dis[i][j]) {
                    dis[i][j]=dis[i][k]+dis[k][j];
                    w[i][j]=w[i][k]*w[k][j];
                } else
                if (dis[i][k]+dis[k][j]==dis[i][j]) w[i][j]+=w[i][k]*w[k][j];
            }
    }
    for (int k=1;k<=n;k++) {
        for (int i=1;i<=n;i++) if (i!=k)
            for (int j=1;j<=n;j++) if (j!=i&&j!=k)
                if (dis[i][k]+dis[k][j]==dis[i][j]) ans[k]+=(w[i][k]*w[k][j])/w[i][j];
        printf("%.3f\n",ans[k]);
    }
    return 0;
}