Cod sursa(job #2006193)

Utilizator valorosu_300Cristian Gherman valorosu_300 Data 28 iulie 2017 22:38:04
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 105;
int mat[N][N];
void roy(int n){
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(mat[i][k] && mat[k][j])
                    mat[i][j] = min(mat[i][j] , mat[i][k] + mat[k][j]);
}
int main()
{
    int n;
    in>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            in>>mat[i][j];
    in.close();
    roy(n);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            out<<mat[i][j]<<" ";
        out<<"\n";
    }
    out.close();
    return 0;
}