Pagini recente » Cod sursa (job #894983) | Cod sursa (job #2796040) | Cod sursa (job #193672) | Cod sursa (job #292030) | Cod sursa (job #1520775)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout ("royfloyd.out");
const int MAX = 105;
int M[MAX][MAX];
int main()
{
int n;
fin >> n;
for(int i = 1;i <= n; i++)
for(int j = 1;j <= n;j++)
fin >> M[i][j];
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if((M[i][j] > M[i][k] + M[k][j] || M[i][j] == 0) && M[k][j] && M[i][k] && i != j)
M[i][j] = M[i][k] + M[k][j];
}
}
}
for(int i = 1;i <= n; i++){
for(int j = 1;j <= n;j++){
fout << M[i][j] << " ";
}
fout << "\n";
}
return 0;
}