Pagini recente » Cod sursa (job #732795) | Cod sursa (job #2520195) | Cod sursa (job #1866641) | Cod sursa (job #1263768) | Cod sursa (job #2927491)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
///int drumuri[101][2];
int a[101][101];
int n;
void citire()
{
fin >> n;
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
{
fin >> a[i][j];
}
}
}
void rezolvare()
{
for(int k = 1; k <= n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if((a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0) && i != j && a[i][k] != 0 && a[j][k] != 0)
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
void afisare()
{
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
fout << a[i][j] << ' ';
fout << '\n';
}
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}