Pagini recente » Cod sursa (job #2295310) | Cod sursa (job #2978182) | Cod sursa (job #472887) | Cod sursa (job #217573) | Cod sursa (job #2859345)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 102;
int rf[NMAX][NMAX], N;
int main()
{
fin>>N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
fin>>rf[i][j];
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++)
{
if(i == j) continue;
rf[i][j] = (rf[i][j] ? min(rf[i][j], rf[i][k] + rf[k][j]) : rf[i][k] + rf[k][j]);
}
}
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++)
fout << rf[i][j] << " ";
fout<<endl;
}
return 0;
}