Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #1841117)
| Utilizator | Data | 5 ianuarie 2017 12:56:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[101][101];
void Citire()
{int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{fin>>a[i][j];
}
}
void royfloyd()
{int k,i,j;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j]=a[i][k]+a[k][j];
}
void Afisare()
{int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
Citire();
royfloyd();
Afisare();
return 0;
}
