Cod sursa(job #3217492)
Utilizator | Rosu Dragos RosuDragos123 | Data | 23 martie 2024 11:10:42 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int dp[102][102];
int n;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>dp[i][j];
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(dp[i][k] && dp[k][j] &&(dp[i][j]>dp[i][k]+dp[k][j] || dp[i][j]==0) && i!=j)
dp[i][j]=dp[i][k]+dp[k][j];
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
cout<<dp[i][j]<<" ";
cout<<'\n';
}
return 0;
}