Pagini recente » Cod sursa (job #3148020) | Cod sursa (job #380447) | Cod sursa (job #1541174) | Cod sursa (job #2426754) | Cod sursa (job #2156513)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[102][102];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fin >> a[i][j];
}
}
for(int k = 1 ; k <= n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if((i != j && a[i][k] != 0 && a[k][j] != 0) && ((a[i][j] > a[i][k] + a[k][j]) || (a[i][j] == 0)))
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}