Pagini recente » Cod sursa (job #1284479) | Istoria paginii runda/simvlad000/clasament | Cod sursa (job #2153579) | Cod sursa (job #681343) | Cod sursa (job #2053066)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMax = 103;
int N, A[NMax][NMax];
void Citire (){
in >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
in >> A[i][j];
}
void Afisare (){
for (int i = 1; i <= N; ++i){
for (int j = 1; j <= N; ++j)
out << A[i][j] << " ";
out << '\n';
}
}
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();
Afisare();
return 0;
}