Pagini recente » Cod sursa (job #1525032) | Cod sursa (job #2337482) | Cod sursa (job #1056396) | Cod sursa (job #683148) | Cod sursa (job #2593963)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[101][101];
void RoyFloid()
{
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] && a[k][j]) {
if(a[i][j] > a[i][k] + a[k][j] || !a[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];
RoyFloid();
for (int i = 1 ; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout << a[i][j] << " ";
fout << "\n";
}
return 0;
}