Cod sursa(job #2131635)

Utilizator sulzandreiandrei sulzandrei Data 14 februarie 2018 20:18:13
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <bits/stdc++.h>
#include <algorithm>
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int d[101][101];
int main()
{
    int n;
    in >> n;
    for(int i = 0 ; i < n ; i++)
        for(int j = 0 ;  j < n ; j++)
            in >> d[i][j];
    for(int k = 0 ; k < n ; k++)
        for(int i = 0 ; i < n ; i++)
            for(int j = 0 ; j < n ; j++)
            if(d[i][k]!=0 && d[k][j]!=0 && i!= k && j !=k && i!=j)
                d[i][j] = std::min(d[i][j],d[i][k]+d[k][j]);
    for(int i = 0 ; i < n ;i++)
    {
        for(int j = 0 ; j < n ; j++)
            out<<d[i][j]<<" ";
        out<<'\n';
    }
    return 0;
}