Cod sursa(job #1162731)

Utilizator teoionescuIonescu Teodor teoionescu Data 31 martie 2014 22:27:04
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int Nmax = 101;
int N,A[Nmax][Nmax];
int main(){
    in>>N;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            in>>A[i][j];
        }
    }
    for(int k=1;k<=N;k++){
        for(int i=1;i<=N;i++){
            for(int j=1;j<=N;j++){
                if( i!=j && A[i][k] && A[k][j] && (A[i][k]+A[k][j]<A[i][j] || A[i][j]==0) ){
                    A[i][j]=A[i][k]+A[k][j];
                }
            }
        }
    }
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            out<<A[i][j]<<' ';
        }
        out<<'\n';
    }
    return 0;
}