Cod sursa(job #1379234)
Utilizator | Iordan Vlad Vladinho97 | Data | 6 martie 2015 17:06:20 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#define nmax 109
using namespace std;
int d[nmax][nmax],m[nmax][nmax];
int main()
{
int i,j,k,n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>m[i][j];
d[i][j]=m[i][j];
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(d[i][k]+d[k][j]<d[i][j])
{
d[i][j]=d[i][k]+d[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n-1;++j)
g<<d[i][j]<<" ";
g<<d[i][n]<<"\n";
}
return 0;
}