Cod sursa(job #2870652)
| Utilizator | Data | 12 martie 2022 14:47:50 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[101][101];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n;j++)
fin >> d[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 && d[i][k] && d[k][j])
d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n;j++)
fout << d[i][j] << ' ';
fout << '\n';
}
return 0;
}
