Pagini recente » Cod sursa (job #2540498) | Cod sursa (job #3300956) | Cod sursa (job #2730886) | Cod sursa (job #740576) | Cod sursa (job #2422750)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
short int w[100][100], dist[100][100], ok[100][100];
int main()
{
int n;
fin>>n;
for(int i = 0; i< n; i++)
for(int j = 0; j < n; j++)
{
fin>>w[i][j];
dist[i][j] = w[i][j];
if(w[i][j])
{
dist[i][j] = w[i][j];
}
else
{
dist[i][j] = 32767;
}
}
for(int k = 0; k <n; k++)
for(int i = 0; i <n; i++)
for(int j = 0; j <n; j++)
if(dist[i][j] > dist[i][k] + dist[k][j] && dist[i][k]!= 32767 && dist[k][j]!= 32767 && i!= j)
{
dist[i][j] = dist[i][k] + dist[k][j];
}
for(int i = 0; i< n; i++)
{
for(int j = 0; j < n; j++)
{
if(dist[i][j] == 32767)
dist[i][j] = 0;
fout<<dist[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}