Pagini recente » Cod sursa (job #2470770) | Cod sursa (job #2459121) | Cod sursa (job #3000692) | Cod sursa (job #2876308) | Cod sursa (job #2197541)
#include <fstream>
using namespace std;
ofstream fout("royfloyd.out");
ifstream fin("royfloyd.in");
int n;
int a[110][110];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fin >> a[i][j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
for(int k = 1; k <= n; k++){
if(j == k) continue;
if(a[j][i] && a[i][k] && (!a[j][k] || a[j][k] > a[j][i] + a[i][k])){
a[j][k] = a[j][i] + a[i][k];
}
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}