Cod sursa(job #3325467)

Utilizator DJipaDragos Jipa DJipa Data 25 noiembrie 2025 15:16:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <iostream>
#include <fstream>
using namespace std;

const int INF = 1e9;

int main()
{
    ifstream in("royfloyd.in");
    ofstream out("royfloyd.out");

    int N;
    in >> N;

    int graph[105][105];


    for(int i = 1; i <= N; i++)
    {
        for(int j = 1; j <= N; j++)
        {
            in >> graph[i][j];
            if(graph[i][j] == 0 && i != j)
                graph[i][j] = INF;
        }
    }

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

    for(int i = 1; i <= N; i++)
    {
        for(int j = 1; j <= N; j++)
        {
            if(graph[i][j] == INF)
                graph[i][j] = 0;
            out << graph[i][j] << " ";
        }
        out << "\n";
    }

    return 0;
}