Pagini recente » Cod sursa (job #478289) | Cod sursa (job #164178) | Cod sursa (job #1192142) | Cod sursa (job #2931893) | Cod sursa (job #2923202)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int mat[105][105];
int main()
{
int n;
cin>>n;
///citire
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>mat[i][j];
if(mat[i][j]==0)
{
mat[i][j]=1000000000;
}
}
}
///alegi drumul minim intre drumul dintre 2 indici vs 2 indici si un intermediar
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=1;k<=n;k++)
{
if(i!=j)
mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);
}
}
}
///afisare
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(mat[i][j]==1000000000)
mat[i][j]=0;
cout<<mat[i][j]<<" ";
}
cout<<'\n';
}
return 0;
}