Cod sursa(job #2851466)

Utilizator Madalin_IonutFocsa Ionut-Madalin Madalin_Ionut Data 18 februarie 2022 18:16:00
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n;
int a[103][103];

void Init()
{
	int i, j;
	for (i = 1; i <= n; i++)
		a[i][i] = 0;
}

void Citire()
{
	int i, j;
	fin >> n;
	Init();
	for (i = 1; i <= n; i++)
		for (j = 1; j <= n; j++)
			fin >> a[i][j];
}

int Verif(int i, int j, int k)
{
	if (i != j && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
		return 1;
	return 0;
}

void RoyFloyd()
{
	int i, j, k;
	for (k = 1; k <= n; k++)
		for (i = 1; i <= n; i++)
			for (j = 1; j <= n; j++)
				if (Verif(i, j, k))
					a[i][j] = a[i][k] + a[k][j];
}

void Afisare()
{
	int i, j;
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
			fout << a[i][j] << " ";
		fout << "\n";
	}
}

int main()
{
	Citire();
	RoyFloyd();
	Afisare();
}