Cod sursa(job #2660672)

Utilizator NeacsuMihaiNeacsu Mihai NeacsuMihai Data 20 octombrie 2020 02:45:36
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int a[101][101];
int main()
{
    int n, k, i, j;
    fin>>n;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fin>>a[i][j];
        }
    }

    for(k=1; k<=n; k++)
    {
        for(i=1; i<=n; i++)
        {
            for(j=1; j<=n; j++)
            {
                if(a[i][k] && a[k][j])
                {
                    if(i!=j && a[i][j]==0) a[i][j] = a[i][k] + a[k][j];
                    else a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
                }
            }
        }
    }

    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fout<<a[i][j]<<' ';
        }
        fout<<"\n";
    }
}