Pagini recente » Cod sursa (job #2462178) | Cod sursa (job #3215168) | Cod sursa (job #1111649) | Cod sursa (job #3281212) | Cod sursa (job #3232641)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[101][101];
int main()
{
int n;
fin >> n;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)fin >> a[i][j];
}
for(int k = 1; k<=n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j<=n; j++)
{
if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
}
}
}
for(int i = 1; i<=n; i++, fout << '\n')
for(int j = 1; j<=n; j++)
{
fout << a[i][j] << ' ';
}
return 0;
}