Pagini recente » Borderou de evaluare (job #3108834) | Cod sursa (job #770002) | Cod sursa (job #2298398) | Cod sursa (job #2360741) | Cod sursa (job #2298401)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], tata[101][101], n;
void citire();
void graf();
void afisare();
int main()
{
citire();
graf();
afisare();
return 0;
}
void citire()
{
int i, j;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
fin >> a[i][j];
if(i!=j && a[i][j]==0)
a[i][j]=INT_MAX/2;
}
}
void graf()
{
int x, v, u;
for (x = 1; x <= n; x++)
for (u = 1; u <= n; u++)
for (v = 1; v <= n; v++)
{
if (u != v && a[u][v] > a[u][x] + a[x][v])
{
a[u][v] = a[u][x] + a[x][v];
tata[u][v] = tata[x][v];
}
}
}
void afisare()
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << '\n';
}
}