Pagini recente » Borderou de evaluare (job #105368) | Borderou de evaluare (job #1716562) | Borderou de evaluare (job #2571681) | Borderou de evaluare (job #715154) | Cod sursa (job #3202403)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int dist[101][101];
int a[101][101], x, y, z, maxx, poz, m;
int inf=INT_MAX;
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){
if(i==j){
dist[i][j]=0;
}else if(a[i][j]!=0){
dist[i][j]=a[i][j];
}else{
dist[i][j]=inf;
}
}
}
for(int k=1;k<=n;++k){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j)if(dist[i][k]!=inf&&dist[k][j]!=inf){
if(dist[i][j]>dist[i][k]+dist[k][j]){
dist[i][j]=dist[i][k]+dist[k][j];
}
}
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)fout<<dist[i][j]<<' '; fout<<endl;}
return 0;
}