Pagini recente » Cod sursa (job #1880831) | Cod sursa (job #1874884) | Monitorul de evaluare | Cod sursa (job #1874896) | Cod sursa (job #1915159)
#include <iostream>
#include <cstdio>
using namespace std;
const int inf = 0x3f3f3f3f;
int N;
int RF[105][105];
void Read()
{
scanf("%d", &N);
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
{
scanf("%d", &RF[i][j]);
if( i != j && !RF[i][j])
RF[i][j] = inf;
}
}
void Roy_Floyd()
{
for(int k = 1; k <= N; ++k)
for(int i = 1 ; i<=N; ++i)
for(int j = 1; j<=N; ++j)
if( i!=j && k!=i && k!=j && RF[i][k]+RF[k][j] < RF[i][j])
RF[i][j]=RF[i][k]+RF[k][j];
}
void Print()
{
for(int i = 1; i <= N; ++i)
{
for(int j = 1; j <= N; ++j)
printf("%d ", RF[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
Read();
Roy_Floyd();
Print();
return 0;
}