Cod sursa(job #2107664)
Utilizator | Data | 17 ianuarie 2018 17:06:30 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n, v[101][101];
fin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin >> v[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(i!=j&&v[i][k]&&v[k][i]&&(v[i][k]+v[k][j]<v[i][j]||!v[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;
}