Cod sursa(job #1395217)
Utilizator | Data | 21 martie 2015 10:27:02 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
#define nmax 101
#define inf 1100
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,b[nmax][nmax];
int main()
{
f>>n;
int i,j,k;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>b[i][j];
for(k=1;k<=n;++k)
{
for(i=1;j<=n;++i)
{
for(j=1;j<=n;++j)
{
if((b[i][j]>b[i][k]+b[k][j] || b[i][j]==0) && i!=j && b[i][k]!=0 && b[k][j])
{
b[i][j]=b[i][k]+b[k][j];
}
}
}
}
for(i=1;i<=n;++i)
{for(j=1;j<=n;++j)
g<<b[i][j]<<" ";
g<<"\n";
}
return 0;
}