Pagini recente » Cod sursa (job #2103718) | Cod sursa (job #1105784) | Cod sursa (job #2949285) | Cod sursa (job #1298601) | Cod sursa (job #1834235)
#include <iostream>
#include <cstdio>
using namespace std;
#define NMAX 105
int n;
int a[NMAX][NMAX];
int dist[NMAX][NMAX];
void read()
{
scanf("%d ",&n);
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
scanf("%d ",&a[i][j]);
}
void royfloyd()
{
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
for(int k=1; k<=n; k++)
{
if(i!=j && a[i][k] && a[k][j] && (dist[i][j]>dist[i][k]+dist[k][j] || !dist[i][j]))
dist[i][j]=dist[i][k]+dist[k][j];
}
}
void print()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
printf("%d ",dist[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
royfloyd();
print();
return 0;
}