Pagini recente » Cod sursa (job #1820012) | Cod sursa (job #1843573) | Cod sursa (job #2042526) | Cod sursa (job #2704006) | Cod sursa (job #2301555)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int a[105][105];
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) f >> 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(i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] or a[i][j] == 0) )
a[i][j]=a[i][k]+a[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << a[i][j] << " ";
g << '\n';
}
return 0;
}