Cod sursa(job #2726180)
| Utilizator | Data | 20 martie 2021 14:18:01 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
#define INF 1e6
int dp[101][101];
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int main()
{
int n,i,j,k;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
cin>>dp[i][j];
if(dp[i][j]==0)
dp[i][j]=INF;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i!=j)
dp[i][j]=min(dp[i][k]+dp[k][j],dp[i][j]);
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
{
if(dp[i][j]==INF || i==j)
cout<<0;
else
cout<<dp[i][j];
cout<<" ";
}
cout<<'\n';
}
return 0;
}
