Pagini recente » Cod sursa (job #2264514) | Cod sursa (job #1514308) | Cod sursa (job #1814633) | Cod sursa (job #810364) | Cod sursa (job #2525238)
#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];
}
}
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] && dp[k][j] && (dp[i][j] > dp[i][k] + dp[k][j] || !dp[i][j]) && i != j)
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;
}