Pagini recente » Cod sursa (job #2137686) | Cod sursa (job #1787051) | Sedinta 2009-03-16 | Cod sursa (job #3264828) | Cod sursa (job #2784604)
#include <bits/stdc++.h>
using namespace std;
int n, a[101][101];
void read()
{
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][i] && i != j )
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i<=n; i++, cout<<'\n')
for(int j = 1; j<=n; j++)
cout<<a[i][j]<<' ';
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
read();
floyd();
return 0;
}