Cod sursa(job #1205603)

Utilizator andreas.chelsauAndreas Chelsau andreas.chelsau Data 7 iulie 2014 14:13:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <stdio.h>
using namespace std;
int p[101][101],n;
void RoyFloyd(){	
	int i, j, k;
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if( i != k && k != j && i != j )
                    if( p[i][j] > p[i][k] + p[k][j])
                        p[i][j] = p[i][k] + p[k][j];
}

int main(){
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%d",&n);
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++){
			scanf("%d",&p[i][j]);
			if(p[i][j] == 0)
				p[i][j] = 1001;
		}
	RoyFloyd();
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			p[i][j] = p[i][j] == 1001 ? 0 : p[i][j];
			printf("%d ",p[i][j]);
		}
		printf("\n");
	}
	return 0;
}