Cod sursa(job #2863871)
| Utilizator | Data | 7 martie 2022 12:40:19 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[110][110];
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(a[i][k] && a[k][j] && (!a[i][j] || a[i][j] > a[i][k] + a[k][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';
}
return 0;
}
