Pagini recente » Cod sursa (job #2290471) | Cod sursa (job #580899) | Cod sursa (job #633202) | Cod sursa (job #357381) | Cod sursa (job #2759140)
#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)
mt[i][j] = min(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;
}