Cod sursa(job #2493284)
Utilizator | Data | 16 noiembrie 2019 11:19:07 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int oo=100000;
int n,c[101][101];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{f>>c[i][j];
if(c[i][j]==0)
c[i][j]=oo;
}
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j&&i!=k&&j!=k)
c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(c[i][j]==oo)
c[i][j]=0;
g<<c[i][j]<<' ';
}
g<<'\n';
}
return 0;
}