Cod sursa(job #2772346)
| Utilizator | Data | 31 august 2021 19:44:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,a[110][110];
int main()
{
in>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
in>>a[i][j];
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
if(i==j)
continue;
for(int q=1;q<=n;++q)
{
if(a[i][q]&&a[q][j]&&(a[i][q]+a[q][j]<a[i][j]||a[i][j]==0))
a[i][j]=a[i][q]+a[q][j];
}
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}
