Pagini recente » Cod sursa (job #1334680) | Cod sursa (job #1585341) | Cod sursa (job #1207994) | Cod sursa (job #1502419) | Cod sursa (job #2810694)
#include<bits/stdc++.h>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
#define INFINIT 0x3f3f3f3f
int main()
{
int m[105][105];
int n;
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
fin>>m[i][j];
if(m[i][j]==0) m[i][j]=INFINIT;
}
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(m[i][k]!=INFINIT and m[k][j]!=INFINIT and m[i][j]>m[i][k]+m[k][j])
m[i][j]=m[i][k]+m[k][j];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(i!=j and m[i][j]!=INFINIT) fout<<m[i][j]<<" ";
else fout<<"0 ";
if(j==n) fout<<'\n';
}
}
return 0;
}