Cod sursa(job #1691798)

Utilizator SebiSebiPirtoaca George Sebastian SebiSebi Data 19 aprilie 2016 14:12:09
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;

#define NMAX 101

int d[NMAX][NMAX],p[NMAX][NMAX];

void royFloyd(int n)
{
	int i,j,k;
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(d[i][k]!=0 && d[k][j]!=0 && i!=j && (d[i][k]+d[k][j]<d[i][j] || d[i][j]==0))
					d[i][j]=d[i][k]+d[k][j];
}

int main ()
{
	int n,i,j;
	ifstream f("royfloyd.in");
	ofstream g("royfloyd.out");
	f>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			f>>d[i][j];
	f.close();
	royFloyd(n);
	for(i=1;i<=n;i++) {
		for(j=1;j<=n;j++)
			g<<d[i][j]<<" ";
		g<<'\n';
	}
	g.close();
	return 0;
}