Cod sursa(job #2883098)

Utilizator ioana0211Ioana Popa ioana0211 Data 1 aprilie 2022 10:21:59
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <climits>

using namespace std;

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

int n, ad[105][105], rf[105][105];

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin>>ad[i][j];
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            if(ad[i][j])
                rf[i][j]=ad[i][j];
            else
            if(i!=j)
                rf[i][j]=INT_MAX/2;
        }
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
                if(rf[i][j]>rf[i][k]+rf[k][j])
                    rf[i][j]=rf[i][k]+rf[k][j];
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(rf[i][j]==INT_MAX/2)
                fout<<0<<" ";
            else
                fout<<rf[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}