rt。我写的一个完全错误的弗洛伊德让我拿了60pts。

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e2 + 10;
const int INF = 1e9;

int n, m;
long long d[MAXN][MAXN];
long long cnt[MAXN][MAXN];

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i != j) {
        d[i][j] = INF;
      }
    }
  }
  for (int i = 1, u, v, w; i <= m; i++) {
    cin >> u >> v >> w;
    d[u][v] = w;
    d[v][u] = w;
    cnt[u][v] = cnt[v][u] = 1;
  }
  for (int k = 1; k <= n; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        if (d[i][k] == INF || d[k][j] == INF) {
          continue;
        }
        if (d[i][k] + d[k][j] < d[i][j]) {
          d[i][j] = d[i][k] + d[k][j];
          cnt[i][j] = cnt[i][k] * cnt[k][j];
        } else if (d[i][k] + d[k][j] == d[i][j]) {
          cnt[i][j] += cnt[i][k] * cnt[k][j];
        }
      }
    }
  }
  cout << fixed << setprecision(3);
  for (int k = 1; k <= n; k++) {
    long double sum = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        if (i == k || j == k || i == j) {
          continue;
        }
        if (d[i][k] + d[k][j] == d[i][j]) {
          sum += 1.0 / cnt[i][j];
          // 不是 1.0 除
        }
      }
    }
    cout << sum << '\n';
  }
  return 0;
}