Cod sursa(job #1382535)
Utilizator | Data | 9 martie 2015 10:48:27 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
const int inf=1001;
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],n,i,j,k,x;
int main()
{ f >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
f>>x;
if ((i!=j)&&(x==0))
a[i][j]=inf;
else
a[i][j]=x;
}
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];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<"\n";
}
f.close();
g.close();
}