Mai intai trebuie sa te autentifici.

Cod sursa(job #2053889)

Utilizator zanugMatyas Gergely zanug Data 1 noiembrie 2017 14:43:25
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>

using namespace std;

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

short m[101][101];

int main()
{
    int n;

    fin >> n;

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

    for(int k = 0; k < n; ++k)
    {
        for(int i = 0; i < n; ++i)
        {
            for(int j = 0; j < n; ++j)
            {
                if(m[i][j] && m[i][k] && m[k][j])
                {
                    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)
            fout << m[i][j] << " ";
        fout << "\n";
    }

    return 0;
}