Pagini recente » Cod sursa (job #2415400) | Cod sursa (job #131839) | Cod sursa (job #563405) | Borderou de evaluare (job #1317116) | Cod sursa (job #1219418)
#include<fstream>
# define INF 0
using namespace std;
int i, j, n, k, c[103][103];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main (){
in>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n ; j++){
in>>c[i][j];
}
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(c[i][j]>c[i][k]+c[k][j])
c[i][j]=c[i][k]+c[k][j];
for(i=1; i<=n; i++){
for(j=1; j<=n; j++)
out<<c[i][j]<<" ";
out<<"\n";
}
return 0;
}