Cod sursa(job #2053900)

Utilizator zanugMatyas Gergely zanug Data 1 noiembrie 2017 15:01:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

short m[101][101];
const int inf = 1001;

int main()
{
    ios::sync_with_stdio(false);

    int n;

    fin >> n;

    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            fin >> m[i][j];
            if(!m[i][j])
                m[i][j] = inf;
        }
    }

    for(int k = 0; k < n; ++k)
    {
        for(int i = 0; i < n; ++i)
        {
            if(k == i || m[i][k] == inf)
                continue;
            for(int j = 0; j < n; ++j)
            {
                if(i == j || m[k][j] == inf)
                    continue;

                if(m[i][j] > m[i][k] + m[k][j])
                    m[i][j] = m[i][k] + m[k][j];
            }
        }
    }

    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            if(m[i][j] == inf)
                m[i][j] = 0;

            fout << m[i][j] << " ";
        }
        fout << "\n";
    }

    return 0;
}