Cod sursa(job #976163)

Utilizator mikeshadowIon Complot mikeshadow Data 22 iulie 2013 17:40:35
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <string>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)

#define INF 2147483647

using namespace std;

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

int n;

int **a,**d;
 
void Floyd()
{
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            if (a[i][j]!=0)
                d[i][j]=a[i][j];
            else d[i][j]=INF;
    for (int i=0; i<n; i++)
        d[i][i]=0;
    for (int k=0; k<n; k++)
        for (int i=0; i<n; i++)
            for (int j=0; j<n; j++)
                    d[i][j]=min(d[i][j],d[i][k]+d[j][k]);
}

int main()
{
	fin>>n;

	a=new int*[n];
	for (int i=0; i<n; i++)
		a[i]=new int[n];

	d=new int*[n];
	for (int i=0; i<n; i++)
		d[i]=new int[n];

	for (int i=0; i<n; i++)
		for (int j=0; j<n; j++)
			fin>>a[i][j];

	Floyd();

	for (int i=0; i<n; i++)
	{
		for (int j=0; j<n; j++)
			fout<<d[i][j]<<' ';
		fout<<'\n';
	}
	
    return 0;
}