Cod sursa(job #3295539)
| Utilizator | Data | 6 mai 2025 17:39:16 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.9 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,mat[101][101];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
fin>>mat[i][j];
if(mat[i][j]==0)
{
mat[i][j]=INT_MAX/2-1001;
}
}
}
for(int k=1; k<=n; k++)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);
}
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(i!=j)
{
fout<<mat[i][j]<<" ";
}
else{
fout<<0<<" ";
}
}
fout<<'\n';
}
return 0;
}
