Pagini recente » Cod sursa (job #2886417) | Cod sursa (job #2355340) | Borderou de evaluare (job #2120338) | Cod sursa (job #2808157) | Cod sursa (job #2293833)
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("royfloyd.in");
ofstream so("royfloyd.out");
int v[105][105];
int main() {
int n;
si>>n;
for(int i=1;i<=n;++i) {
for(int j=1;j<=n;++j) {
si>>v[i][j];
}
}
for(int k=1;k<=n;++k) {
for(int i=1;i<=n;++i) {
for(int j=1;j<=n;++j) {
if(v[i][j]&&v[i][k]&&v[k][j])
v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
if(!v[i][j]&&i!=j&&v[i][k]&&v[k][j])
v[i][j]=v[i][k]+v[k][j];
}
}
}
for(int i=1;i<=n;++i) {
for(int j=1;j<=n;++j) {
so<<v[i][j]<<' ';
}
so<<'\n';
}
return 0;
}