Pagini recente » Cod sursa (job #2428786) | Cod sursa (job #3289181) | Cod sursa (job #122560) | Cod sursa (job #1864875) | Cod sursa (job #1657772)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[101][101],i,j,k,infinit=1000000;
int main(){
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>a[i][j];
if(i!=j && a[i][j]==0){
a[i][j]=infinit;
}
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(a[i][k]+a[k][j]<a[i][j]){
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(a[i][j]==infinit){
a[i][j]=0;
}
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
fout.close();
fin.close();
return 0;
}