Cod sursa(job #2426462)
| Utilizator | Data | 28 mai 2019 09:19:44 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1001][1001], n;
void roy_floyd()
{
for(int k = 1; k<=n; k++)
for(int i = 1; i<=n; i++)
for(int j = 1; j<=n; j++)
v[i][j] = min(v[i][k] + v[k][j], v[i][j]);
}
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1; i<=n; i++)
for(int j = 1; j<=n; j++)
fin >> v[i][j];
roy_floyd();
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
fout << v[i][j] <<' ';
fout <<'\n';
}
}
