Pagini recente » Cod sursa (job #1104906) | Cod sursa (job #2219568) | Cod sursa (job #2786120) | Cod sursa (job #2914990) | Cod sursa (job #773750)
Cod sursa(job #773750)
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101],n;
void roy()
{
int i,j,k;
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (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 init()
{
int i,j;
scanf("%i",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++) scanf("%i",&a[i][j]);
}
void afis()
{
int i,j;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++) printf("%i ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
init();
roy();
afis();
return 0;
}