Cod sursa(job #1153387)

Utilizator irimiecIrimie Catalin irimiec Data 25 martie 2014 13:53:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include <fstream>
#include <cstring>
#define INF 0x3f

using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n, in[101][101], dist[101][101];

int main()
{
	f >> n;
	
	for(int i = 1; i <= n; ++i)
	{
		dist[i][i] = 0;
		for(int j = 1; j <= n; ++j)
			f >> in[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 && in[i][k] && in[k][j] && (in[i][j] > in[i][k] + in[k][j] || !in[i][j]))
					in[i][j] = in[i][k] + in[k][j];
	
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 1; j <= n; ++j)
			g << in[i][j] << " ";
		g << '\n';
	}
}