Pagini recente » Cod sursa (job #2309631) | Cod sursa (job #141829) | Cod sursa (job #1973849) | Cod sursa (job #916928) | Cod sursa (job #2488221)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int A[105][105];
int n;
int main()
{
int 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(i != j){
if(A[i][k] != 0 && A[k][j] != 0){
if(!A[i][j]){
A[i][j] = A[i][k] + A[k][j];
}else{
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<<endl;
}
return 0;
}