Cod sursa(job #2408696)
Utilizator | Data | 18 aprilie 2019 11:26:11 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
int n,v[101][101];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>v[i][j];
for(int k=1;k<=n;k++)
for(int j=1;j<=n;j++)
for(int i=1;i<=n;i++)
if(v[j][k]!=0 and v[k][i]!=0 and(v[j][i]>v[j][k]+v[k][i] || !v[j][i]) and i!=j)
v[j][i]=v[j][k]+v[k][i];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<v[i][j]<<" ";
out<<'\n';
}
}