Cod sursa(job #2482557)

Utilizator BaraianTudorBaraian Tudor Stefan BaraianTudor Data 28 octombrie 2019 15:45:32
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>
#include <fstream>
#define nmax 260
using namespace std;
ifstream in("rf.in");
ofstream out("rf.out");
int n,a[nmax][nmax],str[nmax][nmax];
int main()
{
    in>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            in>>a[i][j];
        }
    }

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

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            out<<a[i][j]<<" ";
        }
        out<<'\n';
    }
    return 0;
}