Pagini recente » cexph | Cod sursa (job #741666) | Cod sursa (job #1551879) | preONI 2005 runda #3 - solutii | Cod sursa (job #1277396)
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[102][102];
int n;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
cin>>a[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 != k && j!= k)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}