Pagini recente » Cod sursa (job #2760855) | Cod sursa (job #2936261) | Cod sursa (job #833121) | Cod sursa (job #2918120) | Cod sursa (job #2375489)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[105][105];
void RoyFloyd()
{
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] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
RoyFloyd();
for(int i = 1; i <= n; fout << '\n', i++)
for(int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fin.close();
fout.close();
return 0;
}