Cod sursa(job #3251752)

Utilizator DARIUSQSSDarius Nicoara DARIUSQSS Data 26 octombrie 2024 19:19:47
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <bits/stdc++.h>

using  namespace std;

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


#define inf 2000000000

int main()
{
    int n, nums[101][101];
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            fin >> nums[i][j];
            if(nums[i][j] == 0) nums[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(i != j)
                {
                    nums[i][j] = max(nums[i][k] + nums[k][j], nums[i][j]);
                }
            }
        }
    }

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            if(nums[i][j] == inf) fout << 0 << ' ';
            else fout << nums[i][j] << ' ';
        }
        fout << endl;
    }

}