Cod sursa(job #892675)
Utilizator | Data | 26 februarie 2013 11:10:08 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int D[101][101],n,i,j,z;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>D[i][j];
for(z=1;z<=n;z++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(D[i][z]+D[z][j]<D[i][j])
D[i][j]=D[i][z]+D[z][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<D[i][j]<<" ";
fout<<"\n";
}
}