Cod sursa(job #2375492)

Utilizator Fatu_SamuelFatu Samuel Fatu_Samuel Data 8 martie 2019 09:53:30
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int a[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(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j]) && i != j)
                    a[i][j] = a[i][k] + a[k][j];
}

int main()
{
    fin >> n;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j];

    RoyFloyd();

    for(int i = 1; i <= n; fout << '\n', i++)
        for(int j = 1; j <= n; j++)
            fout << a[i][j] << ' ';

    fin.close();
    fout.close();
    return 0;
}