Pagini recente » Cod sursa (job #2402401) | Cod sursa (job #2873528) | Cod sursa (job #1474123) | Cod sursa (job #1145901) | Cod sursa (job #1250094)
#include <fstream>
#define Nmax 110
using namespace std;
int N, Distance[Nmax][Nmax];
void RoyFloyd() {
int i, j, k;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
for(k = 1; k <= N; k++)
if(i != j && Distance[i][k] && Distance[k][j] && (Distance[i][j] > Distance[i][k] + Distance[k][j] || !Distance[i][j]))
Distance[i][j] = Distance[i][k] + Distance[k][j];
}
void Read() {
int i, j;
ifstream in("royfloyd.in");
in >> N;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
in >> Distance[i][j];
in.close();
}
void Write() {
int i, j;
ofstream out("royfloyd.out");
for(i = 1; i <= N; i++) {
for(j = 1; j <= N; j++)
out << Distance[i][j] << ' ';
out << '\n';
}
out.close();
}
int main() {
Read();
RoyFloyd();
Write();
return 0;
}