Cod sursa(job #2571404)
| Utilizator | Data | 4 martie 2020 22:53:33 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], n;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fin>>a[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 && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<a[i][j]<<' ';
}
fout<<'\n';
}
}
