Pagini recente » Cod sursa (job #1205867) | Cod sursa (job #2635957) | Cod sursa (job #2097011) | Cod sursa (job #31633) | Cod sursa (job #2726159)
#include <iostream>
#include<fstream>
using namespace std;
int dp[101][101];
int main() {
int n, i, j, k;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin>>n;
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
fin>>dp[i][j];
if(dp[i][j]==0 && i!=j) {
dp[i][j]=1e9;
}
}
}
for(k=1;k<=n;k++) {
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
if(dp[i][j]>dp[i][k]+dp[k][j]) {
dp[i][j]=dp[i][k]+dp[k][j];
}
}
}
}
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
if(dp[i][j]==1e9) {
fout<<"0 ";
}
else {
fout<<dp[i][j]<<" ";
}
}
fout<<endl;
}
return 0;
}