Cod sursa(job #2577529)
Utilizator | Data | 9 martie 2020 16:08:27 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,n,k;
int mat[105][105];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
fin>>mat[i][j];
}
}
for(k=1; k<=n; k++)
{
for(i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(mat[i][j]>mat[i][k]+mat[k][j])
{
mat[i][j]=mat[i][k]+mat[k][j];
}
}
}
}
fout<<'\n';
for(i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
fout<<mat[i][j]<<" ";
}
fout<<'\n';
}
}