Pagini recente » Cod sursa (job #1043178) | Cod sursa (job #1442418) | Cod sursa (job #442114) | Rating Dragusanu Ana (Dragusanuana) | Cod sursa (job #529897)
Cod sursa(job #529897)
#include<fstream.h>
#include<stdio.h>
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,a[101][101],b[101][101],k,inf=1002;
int fct(){
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if((a[i][j]>a[i][k]+a[k][j])&&)
a[i][j]=a[i][k]+a[k][j];
return 0;
}
int main(){
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
f>>a[i][j];
if(i==j) a[i][j]=0;
if((i!=j)&&(a[i][j]==0) a[i][j]=inf;
fct();
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(a[i][j]==inf) g<<"0 ";
else
g<<a[i][j]<<' ';
}
g<<"\n";
}
f.close();
g.close();
return 0;
}