Pagini recente » Cod sursa (job #2949809) | Cod sursa (job #2569314) | Cod sursa (job #2105442) | Cod sursa (job #620800) | Cod sursa (job #2172874)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nMax = 105;
int dp[nMax][nMax];
int main()
{
int n;
f >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
f >> 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(i == j) {
continue;
}
if((dp[i][k] > 0 && dp[k][j] > 0) && (dp[i][j] > dp[i][k] + dp[k][j] || dp[i][j] == 0)) {
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
g << dp[i][j] <<" ";
g << "\n";
}
return 0;
}