Pagini recente » Cod sursa (job #670762) | Cod sursa (job #2185333) | Cod sursa (job #2316379) | Cod sursa (job #946793) | Cod sursa (job #2759142)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, mt[105][105];
int main() {
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> mt[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (mt[i][k] != 0 && mt[k][j] != 0 && (mt[i][j] == 0 || mt[i][k] + mt[k][j] < mt[i][j]) && i != j)
mt[i][j] = mt[i][k] + mt[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
fout << mt[i][j] << " ";
fout << "\n";
}
return 0;
}