Cod sursa(job #2301661)

Utilizator tudor.bujdeiTudor Bujdei-Leonte tudor.bujdei Data 13 decembrie 2018 12:46:53
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <bits/stdc++.h>
#define nmax 100050

using namespace std;

int n, a[100][100];

void citire()
{
	ifstream fin("royfloyd.in");
	fin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			fin >> a[i][j];
}

void royfloyd()
{
	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] && i != j){
                    if (a[i][j] > a[i][k] + a[k][j] || !a[i][j]){
                        a[i][j] = a[i][k] + a[k][j];
                    }
                }
}

void tipar()
{
    ofstream fout("royfloyd.out");
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			fout << a[i][j] << " ";
		fout << "\n";
	}
}

int main()
{
	citire();
	royfloyd();
	tipar();

    return 0;
}