Cod sursa(job #2661258)

Utilizator XeinIonel-Alexandru Culea Xein Data 21 octombrie 2020 17:30:22
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>

using namespace std;

int main()
{
    ifstream f("in.in");
    ofstream g("out.out");
    int N, Cost[100][100];
    f >> N;
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
        {
            f >> Cost[i][j];
            if(Cost[i][j] == 0 && i != j)
                Cost[i][j] = 1001;
        }

    for(int k = 0; k < N; k++)
        for(int i = 0; i < N; i++)
            for(int j = 0; j < N; j++)
                if(Cost[i][k] + Cost[k][j] < Cost[i][j])
                    Cost[i][j] = Cost[i][k] + Cost[k][j];

    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < N; j++)
            if(Cost[i][j] == 1001 && i != j)
                g << 0 << ' ';
            else
                g << Cost[i][j] << ' ';
        g << '\n';
    }
    return 0;
}