Pagini recente » Cod sursa (job #2589782) | Cod sursa (job #2422088) | Cod sursa (job #1261920) | Cod sursa (job #1534000) | Cod sursa (job #1395203)
#include <fstream>
#define nmax 101
#define inf 1100
using namespace std;
ifstream f("rf.in");
ofstream g("rf.out");
int n,b[nmax][nmax];
int main()
{
f>>n;
int i,j,k;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>b[i][j];
for(k=1;k<=n;++k)
{
for(i=1;j<=n;++i)
{
for(j=1;j<=n;++j)
{
if(b[i][j]>b[i][k]+b[k][j] && i!=j && b[i][k]!=0 && b[k][j])
{
b[i][j]=b[i][k]+b[k][j];
}
}
}
}
for(i=1;i<=n;++i)
{for(j=1;j<=n;++j)
if(i!=j && b[i][j]!=inf) g<<b[i][j]<<" ";
else g<<0<<" ";
g<<"\n";
}
return 0;
}