Pagini recente » Cod sursa (job #763090) | Cod sursa (job #1387551) | Cod sursa (job #1053363) | Cod sursa (job #3132456) | Cod sursa (job #2458006)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int ma[105][105];
void citire()
{
cin>>n;
for (int i=1; i <= n ; i++)
{
for (int j = 1; j <= n ; j++)
{
cin>>ma[i][j];
}
}
}
void RoyFloyd()
{
int k;
for (int k = 1; k <=n ; k++)
{
for (int i = 1; i <= n ; i++)
{
for (int j = 1; j <= n ; j++)
{
if (ma[i][k] && ma[k][j] && (ma[i][j] > ma[i][k] + ma[k][j] || !ma[i][j] && i!=j))
{
ma[i][j] = ma[k][j] + ma[i][k];
}
}
}
}
}
void afisare()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cout<<ma[i][j]<<" ";
}
cout<<'\n';
}
}
int main()
{
citire();
RoyFloyd();
afisare();
return 0;
}