Pagini recente » Cod sursa (job #1452520) | Cod sursa (job #1277452) | Cod sursa (job #1257185) | Cod sursa (job #1086800) | Cod sursa (job #634196)
Cod sursa(job #634196)
#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]);
}
}
//roy-floyd
for(int k = 0; k < n; k++)
{
for(int i = 0; i < n; i++)
{
for(int j = 0; 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];
}
}
}
//print
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
printf("%d", a[i][j]);
}
printf("\n");
}
return 0;
}