Pagini recente » Cod sursa (job #1714198) | Cod sursa (job #360012) | Cod sursa (job #1910969) | Cod sursa (job #2904207) | Cod sursa (job #2404751)
#include <iostream>
#include <fstream>
#define MAX 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int A[MAX][MAX];
int N;
void citire() {
in >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
in >> A[i][j];
}
void RoyFloyd() {
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
}
int main() {
citire();
RoyFloyd();
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++)
out << A[i][j] << " ";
out << endl;
}
return 0;
}