Pagini recente » Cod sursa (job #2337604) | Cod sursa (job #1809170) | Cod sursa (job #1387991) | Cod sursa (job #2236388) | Cod sursa (job #1637730)
#include <bits/stdc++.h>
#define N 100
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[N + 1][N + 1];
inline void Citire()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> d[i][j];
}
inline void RoyFloyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
inline void Afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
fout << d[i][j] << " ";
fout << '\n';
}
}
int main()
{
Citire();
RoyFloyd();
Afisare();
return 0;
}