Cod sursa(job #670948)

Utilizator danflorian10Stoica Dan danflorian10 Data 30 ianuarie 2012 14:26:58
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define inf 2000000
int n, i, a[101][101],j,k,rf[101][101];
 
void royfloyd(){
	for(i=1;i<=n;i++){
		rf[i][i]=0;
		for(j=1;j<=n;j++)
		rf[i][j]=a[i][j];
		if(rf[i][j]==0)
		rf[i][j]=inf;
	}
	for(k=1;k<=n;k++)
	for(i=1;i<=n;i++)
	for(j=1;j<=n;j++){
		if((rf[i][k]&&rf[k][j])&&((rf[i][k]+rf[k][j]<rf[i][j])||(rf[i][j]==0&&i!=j)))
		rf[i][j]=rf[i][k]+rf[k][j];
	}
	for(i = 1; i <= n; i ++){
		for(j = 1; j <= n; j ++)
		fout << rf[i][j] << " ";
		fout << "\n";
	}
}
int main(){
	fin >> n;
	for(i = 1; i <= n; i ++){
		for(j = 1; j <= n; j ++)
		fin >> a[i][j];
	}
	royfloyd();
	return 0;
}