Pagini recente » Cod sursa (job #1797023) | Cod sursa (job #579181) | Cod sursa (job #239701) | Cod sursa (job #790475) | Cod sursa (job #2525228)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int dp[105][105],m[105][105];
int main()
{
in>>n;
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
in>>m[i][j];
dp[i][j]=m[i][j];
if(m[i][j]==0)
m[i][j]=1000000;
}
}
for(int k=1;k<=n;++k){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
if(m[i][k]!=-1&&m[k][j]!=-1)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
out<<dp[i][j]<<" ";
}
out<<'\n';
}
return 0;
}