Pagini recente » Cod sursa (job #2070517) | Cod sursa (job #3149761) | Istoria paginii runda/ichb-scoala-2014-9 | Cod sursa (job #2736814) | Cod sursa (job #777326)
Cod sursa(job #777326)
#include <fstream>
#include <math.h>
#include <limits.h>
using namespace std;
int n, M[103][103],D[103][103], i, j, k;
void SP( int i, int j , int k )
{
for(k=0;k<n;++k)
for(i=0;i<n;++i)
for(j=0;j<n;++j)
D[i][j] = min( D[i][j], D[i][k]+D[k][j] );
}
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin>>n;
for(i=0;i<n;++i)
for(j=0;j<n;++j)
{
fin>>M[i][j];
D[i][j]=M[i][j];
}
SP(0,0,0);
for(i=0;i<n;++i)
{
for(j=0;j<n;++j)
fout<<D[i][j]<<" ";
fout<<"\n";
}
return 0;
}