Pagini recente » Cod sursa (job #1770648) | Monitorul de evaluare | Cod sursa (job #461689) | Istoria paginii runda/simulareoji2015p2/clasament | Cod sursa (job #1134455)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream wer("royfloyd.out");
int c[101][101],n;
int INF=1000000;
void citire(){
fin>>n;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>c[i][j];
}
void initializari(){
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(c[i][j]==0)
c[i][j]=INF;
}
void royfloyd(){
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j and i!=k and k!=j){
int nc=c[i][k]+c[k][j];
if(nc<c[i][j])
c[i][j]=nc;
}
}
void reinitializari(){
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(c[i][j]==INF)
c[i][j]=0;
}
int main(){
citire();
initializari();
royfloyd();
reinitializari();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
wer<<c[i][j]<<" ";
wer<<endl;
}
return 0;
}