Pagini recente » Cod sursa (job #1997057) | Cod sursa (job #1334621) | Cod sursa (job #857828) | Cod sursa (job #1770661) | Cod sursa (job #1929257)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
#define INF 0x3f3f3f3f;
int N, a[102][102];
void Solve () {
int k, i, j;
for (k = 1; k <= N; ++ k) {
for (i = 1; i <= N; ++ i) {
for (j = 1; j <= N; ++ j) {
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
}
}
for (i = 1; i <= N; ++ i) {
for (j = 1; j <= N; ++ j) {
out << a[i][j] << " ";
}
out << '\n';
}
}
int main()
{
in >> N;
for (int i = 1; i <= N; ++ i) {
for (int j = 1; j <= N; ++ j) {
in >> a[i][j];
if (a[i][j] == 0 && i != j)
a[i][j] = INF;
}
}
Solve ();
return 0;
}