Cod sursa(job #939841)

Utilizator kassay_akosKassay Akos kassay_akos Data 14 aprilie 2013 22:31:17
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <fstream>
#include <stdio.h>
using namespace std ;
 
int v[102][102];
int n;
 
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");

void citire(){
    cin >> n ;
    for (int i = 0 ; i < n ; i++)
        for (int j = 0 ; j < n ; j++)
			cin >> v[i][j] ;
}
/*
void roy_floyd()
{
    int i, j, k;
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
}
 */
int main(){

    citire();
	//roy_floyd();
	int i,j,k;
	for(i=0 ; i < n ; i ++)
		for(j=0;j<n;j++)
			for(k=0;k<n;k++)
				if ((v[j][i]+v[i][k]<v[j][k] || !v[j][k]) &&
					v[j][i] && v[i][k] && (j != k))	
					      	v[j][k] = v[j][i]+v[i][k] ;	

	
	 for (int i = 0 ; i < n ; i++) {
        for (int j = 0 ; j < n ; j++)
			cout << v[i][j] << " ";
		cout << endl ;
	 }
	 cout.flush();
    return 0  ;
}