Pagini recente » Cod sursa (job #1009407) | Cod sursa (job #854695) | Cod sursa (job #634163) | Cod sursa (job #633794) | Cod sursa (job #1363422)
#include <iostream>
#include <fstream>
#define INF (1<<30)
using namespace std;
int N, c[110][110],dp[2][110][110]; bool l;
int main(){
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> N;
int i,j,k,t;
for (i=1; i<=N; i++)
for (j=1; j<=N; j++)
fin >> c[i][j];
for (i=1; i<=N; i++)
for (j=1; j<=N; j++)
if (i!=j) dp[0][i][j]=INF;
for (i=2; i<N; i++){
l=!l;
for (j=1; j<=N; j++){
dp[l][j][j]=0;
for (k=1; k<=N; k++)
if (k!=j){
dp[l][j][k]=dp[!l][j][k];
for (t=1; t<=N; t++)
if (c[t][k]) dp[l][j][k]=min(dp[l][j][k], c[t][k]+dp[!l][j][t]);
}
}
}
for (i=1; i<=N; i++, fout << "\n")
for (j=1; j<=N; j++)
if (dp[l][i][j]==INF) fout << 0 << " ";
else fout << dp[l][i][j] << " ";
return 0;
}