Cod sursa(job #2484635)

Utilizator nunucotropitoruDarabant Alex Dan nunucotropitoru Data 31 octombrie 2019 11:56:17
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
int i,j,k;
int a[101][101];
int main()
{
    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(i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0))
                    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";


    }
}