Pagini recente » Cod sursa (job #2189337) | Cod sursa (job #1388925) | Cod sursa (job #858679) | Cod sursa (job #2729915) | Cod sursa (job #634192)
Cod sursa(job #634192)
#include <cstdio>
#define INF 20000001
int a[100][100];
int n;
int min(int x, int y)
{
if(x > y)
return y;
return x;
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
scanf("%d", &a[i][j]);
if(a[i][j] == 0)
a[i][j] = INF;
}
}
//roy-floyd
for(int k = 0; k < n; k++)
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(i == j)
continue;
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for(int i = 0; i < n; i++)
{
a[i][i] = 0;
}
//print
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
printf("%d", a[i][j]);
}
printf("\n");
}
return 0;
}