Pagini recente » Cod sursa (job #1998538) | Cod sursa (job #2421545) | Cod sursa (job #289733) | Monitorul de evaluare | Cod sursa (job #2966413)
#include <bits/stdc++.h>
#define MAX 102
using namespace std;
int n,a[MAX][MAX];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
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(a[i][j] > a[i][k]+a[k][j]){
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;
}