Pagini recente » Cod sursa (job #1821998) | Cod sursa (job #2523495) | Cod sursa (job #2738310) | Cod sursa (job #1409353) | Cod sursa (job #3247495)
#include <fstream>
using namespace std;
int n,dp[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main(){
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
fin>>dp[i][j];
if(i!=j && dp[i][j]==0)
dp[i][j]=1000000000;
}
for(int k =1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j)
dp[i][j]=min(dp[i][k]+dp[k][j],dp[i][j]);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(dp[i][j]==1000000000)
dp[i][j]=0;
fout<<dp[i][j]<<" ";}
fout<<'\n';
}
return 0;
}