Cod sursa(job #312844)

Utilizator ssergiussSergiu-Ioan Ungur ssergiuss Data 7 mai 2009 09:19:46
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<algorithm>
using namespace std;

#define DIM 101
#define INF 1000001

int n,a[DIM][DIM];

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(a[i][k]&&a[k][j]&&a[i][k]+a[k][j]<a[i][j])
                    a[i][j]=a[i][k]+a[k][j];}

void solve(){
    int i,j;
    
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j){
            scanf("%d",&a[i][j]);
            if(!a[i][j]&&i!=j)
                a[i][j]=INF;}
    royfloyd();
    for(i=1; i<=n; printf("\n"),++i)
        for(j=1; j<=n; ++j)
            printf("%d ",a[i][j]);}

int main(){
    
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    
    solve();
    return 0;}