Pagini recente » Cod sursa (job #13036) | Cod sursa (job #171681) | Cod sursa (job #49239) | Cod sursa (job #1546221) | Cod sursa (job #3255390)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 105;
const int INF = 1e9;
int a[NMAX][NMAX];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
fin >> a[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 && i != k){
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}