Cod sursa(job #2603310)

Utilizator bmc213Mihai Cosmin bmc213 Data 19 aprilie 2020 10:52:27
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
#define NMAX 1000005

using namespace std;

int a[101][101], n, i, j, k;

void Roy_Floyd()
{
    for(k = 1; k <= n; ++ k)
    {
        for(i = 1; i <= n; ++ i)
        {
            for(j = 1; j <= n; ++ j)
            {
                if(i != j && a[i][k] != NMAX && a[k][j] != NMAX && a[i][j] > a[i][k] + a[k][j])
                    a[i][j] = a[i][k] + a[k][j];
            }
        }
    }
}

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f >> n;
    for(i = 1; i <= n; ++ i)
    {
        for(j = 1; j <= n; ++ j)
        {
            f >> a[i][j];
            if(a[i][j] == 0) a[i][j] = NMAX;
        }
    }
    Roy_Floyd();
    for(i = 1; i <= n; ++ i)
    {
        for(j = 1; j <= n; ++ j)
        {
            if(a[i][j] == NMAX)
                g << "0 ";
            else
                g << a[i][j] << " ";
        }
        g << '\n';
    }
    return 0;
}