Mai intai trebuie sa te autentifici.
Cod sursa(job #1979616)
| Utilizator | Data | 10 mai 2017 22:20:56 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.83 kb |
#include <iostream>
#include <fstream>
/// O(n^3)
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define lim 110
int n;
int a[lim][lim];
void citire()
{
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>a[i][j];
}
void royfloyd()
{
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();
royfloyd();
afisare();
fin.close();
fout.close();
return 0;
}
