Pagini recente » Cod sursa (job #725501) | Cod sursa (job #2284655) | Cod sursa (job #894947) | Cod sursa (job #2061106) | Cod sursa (job #2559048)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1<<31;
int n, a[105][105];
int d[105][105];
void Do()
{
int i,j,k;
fin>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
{
fin>>a[i][j];
d[i][j] = a[i][j];
}
for(k = 1; k<=n; ++k)
for(i = 1; i<=n; ++i)
for(j = 1; j<=n; ++j)
if( d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for(i=1; i<=n; ++i)
{
for(j=1; j<=n; ++j)
fout<<d[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
Do();
return 0;
}