Pagini recente » Cod sursa (job #2887726) | Cod sursa (job #1027357) | Cod sursa (job #2162562) | Cod sursa (job #2359827) | Cod sursa (job #1912962)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMax = 103;
const int INF = 0x3f3f3f3f;
int n,m,x;
int dp[NMax][NMax];
int main()
{
f >> n;
memset(dp,INF,sizeof(dp));
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
f >> x;
if(x == 0)
dp[i][j] = INF;
else
dp[i][j] = x;
}
}
for(int inter = 1; inter <= n; ++inter){
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
if(i != j && dp[i][j] > dp[i][inter] + dp[inter][j]){
dp[i][j] = dp[i][inter] + dp[inter][j];
}
}
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
if(dp[i][j] == INF){
g << 0 << ' ';
}else
g << dp[i][j] << ' ';
}
g << '\n';
}
return 0;
}