Pagini recente » Diferente pentru problema/minmaxstore intre reviziile 7 si 8 | Cod sursa (job #3342920) | Cod sursa (job #1323558) | Cod sursa (job #604414) | Cod sursa (job #3342919)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int const INF=1e9;
int n, i, j, k;
int mat[105][105];
int main()
{
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>mat[i][j];
if(mat[i][j]==0 && i!=j){
mat[i][j]=INF;
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
for(k=1;k<=n;k++){
mat[i][j]=min(mat[i][j], mat[i][k]+mat[k][j]);
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(mat[i][j]==INF)
mat[i][j]=0;
fout<<mat[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}