Cod sursa(job #1697148)

Utilizator GeorginskyGeorge Georginsky Data 30 aprilie 2016 21:13:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
#define NMAX 101
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[NMAX][NMAX], n;
void rf(){
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                if(a[i][k]>0&&a[k][j]>0&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j])&&i!=j)
                    a[i][j]=a[i][k]+a[k][j];
            }
        }
    }
}

void init(){
    in>>n;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)in>>a[i][j];
    }
    rf();
}

void print(){
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)out<<a[i][j]<<" ";
        out<<"\n";
    }
}

int main(){
    init();
    print();
    return 0;
}