Cod sursa(job #2890858)

Utilizator MihaiZ777MihaiZ MihaiZ777 Data 16 aprilie 2022 20:34:06
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>
using namespace std;

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

int n;
int graph[105][105];


void RoyFloyd()
{
    for (int k = 1; k <= n; k++)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (graph[k][j] + graph[i][k] < graph[i][j])
                {
                    graph[i][j] = graph[k][j] + graph[i][k];
                }
            }
        }
    }
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            fin >> graph[i][j];
        }
    }

    RoyFloyd();

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            fout << graph[i][j] << ' ';
        }
        fout << '\n';
    }
}