Pagini recente » Cod sursa (job #1668429) | Cod sursa (job #1433645) | Cod sursa (job #1449919) | Cod sursa (job #1466899) | Cod sursa (job #2167413)
#include <iostream>
#include <stdio.h>
using namespace std;
int a[101][101],n;
void citire()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void roy_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][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i!=j)
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
citire();
roy_floyd();
afisare();
return 0;
}