Pagini recente » Cod sursa (job #2871610) | Cod sursa (job #184395) | Cod sursa (job #434215) | Cod sursa (job #2782611) | Cod sursa (job #1894623)
#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 ((i != j && a[i][k] && a[k][j]) && (a[i][j] > a[i][k] + a[k][j] || 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++) {
fout<<a[i][j]<<' ';
}
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}