Pagini recente » Cod sursa (job #1774976) | Cod sursa (job #2893004) | Istoria paginii runda/simulare_002 | Cod sursa (job #2009920) | Cod sursa (job #492089)
Cod sursa(job #492089)
#include <iostream>
#include <stdio.h>
#define Max 110
using namespace std;
int a[Max][Max], N;
void read()
{
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 royfloyd()
{
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 write()
{
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
read();
royfloyd();
write();
return 0;
}