Cod sursa(job #344465)
| Utilizator | Data | 30 august 2009 12:31:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#define dmax 103
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,mat[dmax][dmax];
void royfloyd()
{ int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);
}
int main()
{ int i,j;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>mat[i][j];
in.close();
royfloyd();
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
out<<mat[i][j]<<" ";
out<<'\n';
}
out.close();
return 0;
} 