Pagini recente » Cod sursa (job #1643247) | Cod sursa (job #196154) | Cod sursa (job #1981679) | Cod sursa (job #1083282) | Cod sursa (job #2433384)
#include <iostream>
#include <fstream>
const int MAXN = 100 + 1,INF = 2e9;
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,matrice[MAXN][MAXN],dp[MAXN][MAXN];
int main()
{
in>>n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
in>>matrice[i][j];
dp[i][j] = matrice[i][j];
}
}
for(int pivot = 1; pivot <= n; pivot++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(dp[i][pivot] && dp[pivot][j] && (dp[i][pivot] + dp[pivot][j] < dp[i][j]) || (i != j && dp[i][j] == 0))
dp[i][j] = dp[i][pivot] + dp[pivot][j];
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)
out<<dp[i][j]<<" ";
out<<"\n";
}
return 0;
}