Cod sursa(job #2814941)
| Utilizator | Data | 8 decembrie 2021 20:37:46 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int N;fin>>N;
int mat[N][N];
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
fin>>mat[i][j];
for(int k=0;k<N;k++)
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
if(i!=j && mat[i][k] && mat[k][j] && (mat[i][j]>mat[i][k]+mat[k][j] || mat[i][j]==0))
mat[i][j]=mat[i][k]+mat[k][j];
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
fout<<mat[i][j]<<" ";
fout<<"\n";
}
return 0;
}