Pagini recente » Cod sursa (job #475570) | Cod sursa (job #1970253) | Cod sursa (job #2559052) | Cod sursa (job #2539642) | Cod sursa (job #1988414)
#include<fstream>
using namespace std;
int main(){
ifstream in; ofstream out;
in.open("royfloyd.in"); out.open("royfloyd.out");
out.clear();
int n,i,j,k,inf=100001;
in>>n;
int dist[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
in>>dist[i][j];
if(i==j) dist[i][j]=0;
else if(dist[i][j]==0) dist[i][j]=inf;
}
}
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++){
if(dist[i][j]>dist[i][k]+dist[k][j])
dist[i][j]=dist[i][k]+dist[k][j];
}
for(i=0;i<n;i++){
for(j=0;j<n;j++) out<<dist[i][j]<<" ";
out<<endl;
}
in.close(); out.close();
return 0;}