Pagini recente » Cod sursa (job #248565) | Cod sursa (job #1070680) | Cod sursa (job #2435361) | Cod sursa (job #2312915) | Cod sursa (job #1023521)
#include<fstream>
using namespace std;
ifstream f("rf.in");
ofstream g("rf.out");
int A[101][101],i,j,n,k,B[101][101];
int main()
{f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{f>>A[i][j];B[i][j]=(A[i][j]!=0);}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&A[i][k]*A[k][j])
if(A[i][k]+A[k][j]<A[i][j]||A[i][j]==0)
{A[i][j]=A[i][k]+A[k][j];
B[i][j]=B[i][k]+B[k][j];}
else if(A[i][j]==A[i][k]+A[k][j]&&B[i][j]<B[i][k]+B[k][j])
B[i][j]=B[i][k]+B[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<A[i][j]<<' ';
g<<'\n';}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<B[i][j]<<' ';
g<<'\n';}
return 0;
}