Pagini recente » Borderou de evaluare (job #2100066) | Cod sursa (job #461578) | Cod sursa (job #3261771) | Cod sursa (job #2891781) | Cod sursa (job #3125781)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105];
int main()
{
int n,i,j,k;
fin >> n;
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
fin >> a[i][j];
}
}
for(k = 1; k <= n; k++){
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
if(a[i][j] != 0 && a[i][k] && a[k][j]) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}