Cod sursa(job #2927489)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 20 octombrie 2022 18:37:46
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include<fstream>

using namespace std;

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

int a[101][101], n;

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

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

int main()
{
    citire();
    royfloyd();
    for(int i = 1; i <=n; i++)
    {
        for(int j = 1; j <=n; j++)
            fout << a[i][j] << " ";
        fout << endl;
    }
    return 0;
}