Cod sursa(job #2458008)

Utilizator nicolaee2Martinescu Nicolae nicolaee2 Data 19 septembrie 2019 11:48:17
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int ma[105][105];


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

void RoyFloyd()
{
    int k;
    for (int k = 1; k <=n ; k++)
    {
        for (int i = 1; i <= n ; i++)
        {
            for (int j = 1; j <= n ; j++)
            {
                if (ma[i][k] && ma[k][j] && (ma[i][j] > ma[i][k] + ma[k][j] || !ma[i][j] && i!=j))
                {
                    ma[i][j] = ma[k][j] + ma[i][k];
                }
            }
        }
    }
}

void afisare()
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cout<<ma[i][j]<<" ";
        }
        cout<<'\n';
    }
}

int main()
{
    citire();
    RoyFloyd();
    afisare();
    return 0;
}