Cod sursa(job #2446460)
Utilizator | Data | 8 august 2019 23:41:24 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n,v[100][100];
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(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<<endl;
}
return 0;
}