Pagini recente » Cod sursa (job #3153661) | Cod sursa (job #3160319) | Cod sursa (job #1097435) | Cod sursa (job #973532) | Cod sursa (job #1310019)
#include <cstdio>
typedef char BYTE;
using namespace std;
BYTE a[102][102];
short 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];
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%i", &n);
int i,j;
for(i=1; i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%i", &a[i][j]);
}
}
roy();
for(i=1; i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("%i ", a[i][j]);
}
printf("\n");
}
return 0;
}