Pagini recente » Cod sursa (job #1328469) | Cod sursa (job #1110048) | Cod sursa (job #2594891) | Cod sursa (job #2090751) | Cod sursa (job #2296674)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[300][300],b[300][300];
int main (){
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
fin>>a[i][j];
if(a[i][j]!=0)
b[i][j]=1;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j){
if(a[i][j]>a[i][k]+a[k][j]){
a[i][j]=a[i][k]+a[k][j];
b[i][j]=b[i][k]+b[k][j];
}
if(a[i][j]==a[i][k]+a[k][j])
b[i][j]=max(b[i][k]+b[k][j],b[i][j]);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<endl;
}/*
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<b[i][j]<<" ";
fout<<endl;
}*/
return 0;
}