Cod sursa(job #1724072)
| Utilizator | Data | 2 iulie 2016 11:52:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int n,cost[105][105];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>cost[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++)
if(cost[i][k]&&cost[k][j]&&(cost[i][k]+cost[k][j]<cost[i][j]||cost[i][j]==0))
cost[i][j]=cost[i][k]+cost[k][j];
cost[i][i]=0;
}
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++)
fout<<cost[i][j]<<" ";
fout<<'\n';
}
return 0;
}
