Cod sursa(job #2838054)
Utilizator | Data | 23 ianuarie 2022 00:34:44 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAX=105;
int n,mat[MAX][MAX];
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin >> mat[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(mat[i][k]+mat[k][j]<mat[i][j])
mat[i][j]=mat[i][k]+mat[k][j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout << mat[i][j] << " ";
fout << '\n';
}
return 0;
}