Pagini recente » Cod sursa (job #873195) | Cod sursa (job #2080185) | Cod sursa (job #1248978) | Cod sursa (job #2988469) | Cod sursa (job #2568595)
#include <bits/stdc++.h>
using namespace std;
#define N 105
int A[N][N], n;
void rf() {
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(A[i][k] && A[k][j] && i != j && (!A[i][j] || A[i][j] > A[i][k] + A[k][j]))
A[i][j] = A[i][k] + A[k][j];
}
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
fin >> A[i][j];
rf();
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j)
fout << A[i][j] << ' ';
fout.put('\n');
}
}