Cod sursa(job #3286812)
| Utilizator | Data | 14 martie 2025 18:16:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, i, j, dp[105][105], k;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
dp[i][j]=1e9;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>dp[i][j];
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
for(k=1; k<=n; k++)
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++)
fout<<dp[i][j]<<" ";
fout<<'\n';
}
return 0;
}
