Cod sursa(job #3260126)
| Utilizator | Data | 30 noiembrie 2024 10:50:14 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,y,n,dp[110][110],dis;
int main()
{
cin.tie(0);
cout.tie(0);
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
fin>>dis;
dp[i][j]=dis;
}
for(y=1; y<=n; y++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
if(dp[i][y]!=INT_MAX && dp[y][j]!=INT_MAX)
dp[i][j]=min(dp[i][j],dp[i][y]+dp[y][j]);
}
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout<<dp[i][j]<<" ";
fout<<'\n';
}
return 0;
}
