Pagini recente » Cod sursa (job #1884301) | Cod sursa (job #747176) | Cod sursa (job #2883618) | Cod sursa (job #1357994) | Cod sursa (job #2764034)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int dp[MAXN][MAXN];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
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] > 0 && dp[k][j] > 0 && i != j)
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)
fout << dp[i][j] << " ";
fout << "\n";
}
return 0;
}