Pagini recente » Clasament cei_mai_mari_olimpicari_runda_4 | Cod sursa (job #978800) | Cod sursa (job #2194033) | Cod sursa (job #1638648) | Cod sursa (job #2484183)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N, Map[105][105], Drum[105][105];
void citire()
{
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
fin>>Map[i][j];
Drum[i][j]=Map[i][j];
}
}
bool existaDrum(int a, int b, int c)
{
if(a!=c)
return Drum[a][b] && Drum[b][c];
return 0;
}
bool costDrum(int a, int b, int c)
{
if(!Drum[a][c])
return 1;
return Drum[a][c] > Drum[a][b] + Drum[b][c];
}
void royFloyd()
{
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if (existaDrum(i,k,j) && costDrum(i,k,j))
Drum[i][j] = Drum[i][k] + Drum[k][j];
}
void afisare()
{
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
fout<<Drum[i][j]<<" ";
fout<<'\n';
}
}
int main()
{
citire();
royFloyd();
afisare();
return 0;
}