Cod sursa(job #1370456)
| Utilizator | Data | 3 martie 2015 14:48:21 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n,i,j,k;
fin>>n;
int A[n][n];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>A[i][j];
//Roy-Floyd
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(A[i][j]>A[i][k]+A[k][j]) A[i][j]=A[i][k]+A[k][j];
// Afisare
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<A[i][j]<<' ';
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}
