Cod sursa(job #1546609)
| Utilizator | Data | 8 decembrie 2015 13:31:54 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define nmax 101
int n,d[nmax][nmax];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>d[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j&&i!=k&&j!=k)
if(d[i][k]!=0&&d[k][j]!=0)
if(d[i][j]==0||d[i][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<d[i][j]<<" ";
fout<<"\n";}
return 0;
}
