fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. //#include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int n,m;
  34. int f[108][108],map[108][108];
  35. ll c[108][108];
  36. double ans[108];
  37. void Work()
  38. {
  39. scanf("%d%d",&n,&m);
  40. memset(f,55,sizeof f);
  41. int x,y,z;
  42. rep(i,1,m)
  43. {
  44. scanf("%d%d%d",&x,&y,&z);
  45. f[x][y]=f[y][x]=map[x][y]=map[y][x]=z;
  46. }
  47. rep(k,1,n)rep(i,1,n)rep(j,1,n)
  48. if(i!=j&&j!=k&&i!=k)
  49. f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
  50. rep(i,1,n)rep(j,1,n)
  51. if(map[i][j]==f[i][j])c[i][j]=1;
  52. rep(k,1,n)rep(i,1,n)rep(j,1,n)
  53. if(i!=j&&j!=k&&i!=k&&f[i][j]==f[i][k]+f[k][j])
  54. c[i][j]+=c[i][k]*c[k][j];
  55. rep(k,1,n)rep(i,1,n)rep(j,1,n)
  56. if(i!=j&&j!=k&&i!=k&&f[i][j]==f[i][k]+f[k][j])
  57. ans[k]+=(double)c[i][k]*c[k][j]/c[i][j];
  58. rep(i,1,n)printf("%.3lf\n",ans[i]);
  59. }
  60. int main()
  61. {
  62. // freopen((name+in).c_str(),"r",stdin);
  63. // freopen((name+out).c_str(),"w",stdout);
  64. // Init();
  65. Work();
  66. return 0;
  67. }
  68. 
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty