Pagini recente » Cod sursa (job #1642643) | Cod sursa (job #658980) | Cod sursa (job #2108397) | Cod sursa (job #1337448) | Cod sursa (job #1912530)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nMax = 103;
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(dp[i][k] && dp[k][j] && (dp[i][k] + dp[k][j] < dp[i][j] || dp[i][j] == 0 && i != j)) {
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;
}