Pagini recente » Cod sursa (job #2281841) | Cod sursa (job #1877100) | Cod sursa (job #2895271) | Cod sursa (job #125810) | Cod sursa (job #3253539)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int INF = 0x3F3F3F3F;
const int Nmax = 101;
int a[Nmax][Nmax], n;
void roy()
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
cin >> a[i][j];
if(i != j && a[i][j] == 0)
a[i][j] = INF;
}
roy();
for(int i=1; i<=n; i++,cout << '\n')
for(int j=1; j<=n; j++)
if(a[i][j] == INF)
cout << "0";
else
cout << a[i][j] << " ";
return 0;
}