Pagini recente » Cod sursa (job #1702436) | Borderou de evaluare (job #1036990) | Cod sursa (job #796826) | Cod sursa (job #228908) | Cod sursa (job #2890029)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dp[103][103];
int main(){
int n;
fin >> n;
for(int i = 1 ; i <= n ; ++ i)
for(int j = 1 ; j <= n ; ++ j)
dp[i][j] = INT_MAX;
for(int i = 1 ; i <= n ; ++ i)
for(int j = 1 ; j <= n ; ++ j)
fin >> dp[i][j];
for(int k = 1 ; k <= n ; ++ k)
for(int i = 1 ; i <= n ; ++ i)
for(int j = 1 ; j <= n ; ++ j)
if(dp[i][k] != -1 && dp[j][k] != -1 && dp[i][j] > dp[i][k] + dp[k][j])
dp[i][j] = dp[i][k] + dp[k][j];
for(int i = 1 ; i <= n ; ++ i){
for(int j = 1 ; j <= n ; ++ j)
fout << dp[i][j] << ' ';
fout << '\n';
}
return 0;
}