Cod sursa(job #3277959)
Utilizator | Data | 18 februarie 2025 12:04:15 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.07 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int m[200][200];
int main()
{
int n;
in>>n;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
in>>m[i][j];
}
}
for(int k=1; k<=n; k++)
{
for(int a=1; a<=n; a++)
{
for(int b=1; b<=n; b++)
{
if(m[a][k]!=0 && m[k][b]!=0 && a!=b)
{
if(m[a][b]==0)
{
m[a][b]=m[a][k]+m[k][b];
}
else
{
if(m[a][b]>m[a][k]+m[k][b])
{
m[a][b]=m[a][k]+m[k][b];
}
}
}
}
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
out<<m[i][j]<<' ';
}
out<<'\n';
}
return 0;
}