Cod sursa(job #2731075)
Utilizator | Data | 27 martie 2021 11:43:08 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int dp[110][110];
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 && i!=j)
dp[i][j]=1000000000;
}
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
cout<<dp[i][j]<<" ";
cout<<"\n";
}
return 0;
}