Pagini recente » Cod sursa (job #1317226) | Cod sursa (job #390114) | Cod sursa (job #556437) | Cod sursa (job #2451395) | Cod sursa (job #3122521)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N = 105;
const int oo = 1e9 + 5;
int n, adj[N][N];
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++){
f >> adj[i][j];
if (!adj[i][j] && i != j) adj[i][j] = oo;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (adj[i][j] > adj[i][k] + adj[k][j])
adj[i][j] = adj[i][k] + adj[k][j];
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++)
g << (adj[i][j] == oo ? 0 : adj[i][j]) << ' ';
g << '\n';
}
return 0;
}