Cod sursa(job #2384313)
Utilizator | Dobre Gabriel gabriel2506 | Data | 20 martie 2019 16:54:22 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.95 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[102][102];
long long oo=100000;
int main()
{
int i,j,n;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>m[i][j];
if((m[i][j]==0)&&(i!=j))
{
m[i][j]=oo;
}
}
}
for(int k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][k]+m[k][j]<m[i][j])
{
m[i][j]=m[i][k]+m[k][j];
//pred[i][j]=pred[k][j];
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][j]=oo)
{
fout<<0<<" ";
continue;
}
fout<<m[i][j]<<" ";
}
fout<<endl;
}
return 0;
}