Pagini recente » Cod sursa (job #1866246) | Cod sursa (job #1729210) | Cod sursa (job #2202274) | Cod sursa (job #637928) | Cod sursa (job #2801150)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define MAX_N 101
int n;
int dp[MAX_N][MAX_N];
int main()
{
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){
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;
}