Pagini recente » Cod sursa (job #3198279) | Cod sursa (job #2805230) | Cod sursa (job #2948337) | Cod sursa (job #2989644) | Cod sursa (job #2578668)
#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[i][k] + dist[k][j] < dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
fout << dist[i][j] << " ";
fout << '\n';
}
return 0;
}