Pagini recente » Cod sursa (job #1584908) | Cod sursa (job #1935541) | Cod sursa (job #3149222) | Cod sursa (job #1721702) | Cod sursa (job #2847049)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dist[101][101];
int main()
{
int n;
fin>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
fin>>dist[i][j];
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (dist[i][k] && dist[k][j] && (dist[i][j]>dist[i][k]+dist[k][j] || dist[i][j]==0 && i!=j))
dist[i][j] = dist[i][k]+dist[k][j];
for (int i=1; i<=n; i++)
{
fout<<dist[i][1];
for (int j=2; j<=n; j++)
fout<<" "<<dist[i][j];
fout<<'\n';
}
return 0;
}