Cod sursa(job #1487948)
| Utilizator | Data | 17 septembrie 2015 17:51:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| 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 n,drum[101][101],i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>drum[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(drum[i][k]>0 && drum[k][j]>0 && drum[i][j]>drum[i][k]+drum[k][j])
drum[i][j]=drum[i][k]+drum[k][j];
}
for(i=1;i<=n;i++, fout<<'\n')
for(j=1;j<=n;j++)
fout<<drum[i][j]<<" ";
return 0;
}
