Mai intai trebuie sa te autentifici.
Cod sursa(job #2424260)
Utilizator | Data | 22 mai 2019 20:24:56 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void citire()
{
fin>>n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin>>a[i][j];
}
void roy()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if( a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
citire();
roy();
afisare();
return 0;
}