Pagini recente » Cod sursa (job #702498) | preoni-2004/clasament-9-10 | Cod sursa (job #1454649) | Cod sursa (job #273945) | Cod sursa (job #1060071)
#include <iostream>
#include <cstdio>
#define Nmax 100+5
using namespace std;
int n;
int c[Nmax][Nmax];
int a[Nmax][Nmax];
void citire()
{
scanf("%d",&n);
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
scanf("%d",&c[i][j]);
}
void RoyFloyd()
{
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (c[i][k] * c[k][j])
c[i][j]=min(c[i][j], c[i][k]+c[k][j]);
}
void afisare()
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
printf("%d ",c[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
RoyFloyd();
afisare();
return 0;
}