Cod sursa(job #2425066)

Utilizator AlexNecula99Necula Florin-Alexandru AlexNecula99 Data 24 mai 2019 10:41:52
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <fstream>

using namespace std;

int dist[10000][10000];

int main()
{
	ifstream f("royfloyd.in");
	ofstream g("royfloyd.out");
	int n;
	f >> n;
	for(int i=1;i<=n;i++)
		for (int j = 1; j <= n; j++)
		{
			f >> dist[i][j];
			if (i != j && dist[i][j] == 0)
				dist[i][j] = 100000;
		}
	for (int i = 1; i <= n; i++)
		dist[i][i] = 0;
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (dist[i][k] + dist[k][j] < dist[i][j])
					dist[i][j] = dist[i][k] + dist[k][j];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			g << dist[i][j] << " ";
		g << "\n";
	}
	return 0;
}