Pagini recente » Cod sursa (job #551147) | Cod sursa (job #2883928) | Cod sursa (job #2091384) | Cod sursa (job #2716030) | Cod sursa (job #2715420)
#include <fstream>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int n, m, w[105][105];
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
cin>>w[i][j];
if(w[i][j]==0 && i!=j)
w[i][j]=1e9;
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
for(int q = 1; q <= n; ++q)
{
if(w[i][q] < 1e9 && w[q][j] < 1e9)
w[i][j] = min(w[i][j], w[i][q] + w[q][j]);
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
cout << w[i][j] << ' ';
}
cout << '\n';
}
return 0;
}