Cod sursa(job #2510552)
Utilizator | Ionita Andrei sygAndreiIonita | Data | 16 decembrie 2019 21:23:01 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int v[101][101];
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int main()
{
int i,j,k,n;
in>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
in>>v[i][j];
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (v[i][k]&&v[k][j]&&i!=j&&(!v[i][j]||v[i][j]>v[i][k]+v[k][j]))
v[i][j]=v[i][k]+v[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
out<<v[i][j]<<" ";
out<<'\n';
}
return 0;
}