Cod sursa(job #2526277)

Utilizator remusdc11Remus Dascalu remusdc11 Data 18 ianuarie 2020 14:03:25
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include<fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int maxim = 100001, a[101][101];
int main()
{
	int n, i, j, k;
	fin>>n;
	
	for(i = 1; i <= n; i++)
		for(j = 1; j <= n; j++)
		{
			fin >> a[i][j];
			if(a[i][j] == 0 && i != j)
				a[i][j] = maxim;
		}
		
	for(k = 1; k <= n; k++)
		for(i = 1; i <= n; i++)
			for(j = 1; j <= n; j++)
			{
				if(a[i][j] > a[i][k] + a[k][j])
					a[i][j] = a[i][k] + a[k][j];
			}
			
			
	for(i = 1; i <= n; i++)
	{
	
		for(j = 1; j <= n; j++)
			fout << a[i][j]<<' ';
		
		fout<<'\n';
	}
	
	return 0;
}