Cod sursa(job #2171439)

Utilizator SantimosSantimos Santimos Data 15 martie 2018 12:22:49
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
using namespace std;
int n,d,a[105][105];

void Citire(){
    cin>>n;
    for (int i=1;i<=n;i++){
        for (int  j=1;j<=n;j++){
            cin>>a[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];
            }
        }
    }
}

void Afisare(){
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++) cout<<a[i][j]<<endl;
    }
}

int main(){
    Citire();
    Roy_floyd();
    Afisare();
return 0;
}