Cod sursa(job #1851829)
| Utilizator | Data | 20 ianuarie 2017 09:49:50 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, v[110][110];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>v[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
if(v[i][k] && v[k][j] && (v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && i != j)
v[i][j] = v[i][k] + v[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<v[i][j]<<" ";
fout<<'\n';
}
return 0;
}
