Pagini recente » Cod sursa (job #2298912) | Cod sursa (job #918451) | Cod sursa (job #3209947) | Cod sursa (job #300858) | Cod sursa (job #2245431)
#include <iostream>
#include <fstream>
#define MAXN 105
#define INF 1000000
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,dp[MAXN][MAXN];
void RoyFloyd(){
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]);
}
int main()
{
in>>n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
in>>dp[i][j];
if(!dp[i][j])
dp[i][j] = INF;
}
}
RoyFloyd();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(dp[i][j] != INF && i != j)
out<<dp[i][j]<<" ";
else
out<<0<<" ";
}
out<<"\n";
}
return 0;
}