Pagini recente » Cod sursa (job #1560571) | Istoria paginii runda/return_of_the_troll | Atasamentele paginii Profil TusineanAlq | Cod sursa (job #1651085) | Cod sursa (job #892767)
Cod sursa(job #892767)
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define Nmax 110
int Mat[Nmax][Nmax], N;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int i, j, k;
scanf("%i", &N);
for(i = 1; i <= N; ++i)
for(j = 1; j <= N; ++j)
scanf("%i", &Mat[i][j]);
for(k = 1; k <= N; ++k)
for(i = 1; i <= N; ++i)
for(j = 1; j <= N; ++j)
if(Mat[i][k] && Mat[k][j] && (Mat[i][k] + Mat[k][j] < Mat[i][j] || !Mat[i][j]) && i != j)
Mat[i][j] = Mat[i][k] + Mat[k][j];
for(i = 1; i <= N; ++i)
{
for(j = 1; j <= N; ++j) printf("%i ", Mat[i][j]);
printf("\n");
}
return 0;
}