Cod sursa(job #1645076)

Utilizator serbanSlincu Serban serban Data 10 martie 2016 10:57:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>

using namespace std;

int d[105][105];

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    int n; f >> n;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            f >> d[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 && d[i][k] && d[k][j]) {
            if(!d[i][j]) d[i][j] = d[i][k] + d[k][j];
            else d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
        }
    for(int i = 1; i <= n; i ++) {
        for(int j = 1; j <= n; j ++) g << d[i][j] << " ";
        g << "\n";
    }
    return 0;
}