Pagini recente » Cod sursa (job #2337192) | Istoria paginii runda/skibidi/clasament | sim-oji-cls10-24.01 | Cod sursa (job #1653890) | Cod sursa (job #1992317)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cstring>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define ll long long
#define pb push_back
#define ui unsigned int
const int inf = 1e9 + 5;
const int NMax = 1e2 + 5;
int N;
int dist[NMax][NMax];
int main() {
in>>N;
for (int i=1;i <= N;++i) {
for (int j=1;j <= N;++j) {
int val;
in>>val;
dist[i][j] = (i != j && !val) ? inf : val;
}
}
for (int k=1;k <= N;++k) {
for (int i=1;i <= N;++i) {
for (int j=1;j <= N;++j) {
if (dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for (int i=1;i <= N;++i) {
for (int j=1;j <= N;++j) {
out<<dist[i][j]<<' ';
}
out<<'\n';
}
in.close();out.close();
return 0;
}