Pagini recente » Cod sursa (job #1010215) | Cod sursa (job #1376376) | Cod sursa (job #3132232) | Cod sursa (job #1432695) | Cod sursa (job #2065333)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMAX = 105;
int N;
int V[NMAX][NMAX];
void Read(){
in >> N;
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j)
in >> V[i][j];
}
}
void Solve(){
for(int k = 1; k <= N; ++k){
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j){
if(V[i][k] && V[k][j]
&& (V[i][k] + V[k][j] < V[i][j]
|| !V[i][j]) && i != j)
V[i][j] = V[i][k] + V[k][j];
}
}
}
}
void Print(){
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j)
out << V[i][j] << " ";
out << "\n";
}
}
int main(){
Read();
Solve();
Print();
}