Pagini recente » Cod sursa (job #1118331) | Borderou de evaluare (job #2502559) | Borderou de evaluare (job #1515827) | Statistici tudor costin (Tuhuni) | Cod sursa (job #1167086)
#include<cstdio>
using namespace std;
const int NMAX = 100+5;
void Read(),Solve(),Print();
int N;
int Mat[NMAX][NMAX];
int main()
{
Read();
Solve();
Print();
return 0;
}
void Read()
{
int i,j;
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&N);
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
scanf("%d",&Mat[i][j]);
}
void Solve()
{
int i,j,k;
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if(i!=j && Mat[i][k] && Mat[k][j] && (!Mat[i][j] || (Mat[i][k] + Mat[k][j] < Mat[i][j]))) Mat[i][j] = Mat[i][k] + Mat[k][j];
}
void Print()
{
int i,j;
for(i = 1; i <= N; i++,printf("\n"))
for(j = 1; j <= N; j++)
printf("%d ",Mat[i][j]);
}