Pagini recente » Cod sursa (job #2783111) | Cod sursa (job #410006) | Cod sursa (job #2316656) | Cod sursa (job #2298983) | Cod sursa (job #2174328)
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
const int N = 105;
int d[N][N];
int main()
{
int n, i, j, k;
in >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
in >> d[i][j];
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(d[i][k] != 0 && d[k][j] != 0 && i!= j)
if(d[i][j] == 0 || 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; j++)
out << d[i][j] <<" ";
out <<"\n";
}
return 0;
}