Pagini recente » Cod sursa (job #2213912) | Cod sursa (job #2799200) | Cod sursa (job #30928) | Cod sursa (job #3215434) | Cod sursa (job #2578678)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dist[105][105], n;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> dist[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
if(dist[j][i] + dist[i][k] < dist[j][k] && dist[j][i] * dist[i][k] != 0 && j != k)
dist[j][k] = dist[j][i] + dist[i][k];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
fout << dist[i][j] << " ";
fout << '\n';
}
return 0;
}