Pagini recente » Cod sursa (job #104850) | Cod sursa (job #829044) | Cod sursa (job #2284502) | Cod sursa (job #981108) | Cod sursa (job #3215566)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,A[101][101];
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fin >> A[i][j];
if(A[i][j]==0 && i!=j)
A[i][j]=10000001;
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i!=j && j!=k && i!=k)
{
A[i][j]=min(A[i][k]+A[k][j],A[i][j]);
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(A[i][j]==10000001) fout << "0 ";
else fout << A[i][j] << " ";
}
fout << "\n";
}
return 0;
}