Pagini recente » Cod sursa (job #1919784) | Cod sursa (job #1245080) | Cod sursa (job #2935504) | Cod sursa (job #1684526) | Cod sursa (job #1067613)
#include <iostream>
#include <cstdio>
#define nmax 101
using namespace std;
int n;
int a[nmax][nmax];
void citire()
{
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> a[i][j];
}
void floyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
cout << a[i][j] << ' ';
cout << '\n';
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
citire();
floyd();
afisare();
return 0;
}