Cod sursa(job #1657771)

Utilizator starduststardust stardust Data 20 martie 2016 19:47:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include<fstream>
#define maxn 150

int mat[maxn][maxn];
int n;

int main() {

    std::ifstream in("royfloyd.in");
    std::ofstream out("royfloyd.out");

    in>>n;

    for (int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            in>>mat[i][j];

    for(int k = 0;k < n; k++)
        for(int i = 0 ;i < n; i++)
            for(int j = 0 ;j < n; j++) {
                if(i == j)
                    continue;
                if(!mat[i][k] || !mat[k][j])
                    continue;
                    
                if(!mat[i][j])
                    mat[i][j] = mat[i][k] + mat[k][j];
                else
                    mat[i][j] = std::min(mat[i][k] + mat[k][j],mat[i][j]);
            }


    for (int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++)
            out<<mat[i][j]<<" ";
        out<<"\n";
    }

    return 0;
}