Cod sursa(job #2124233)

Utilizator nicu_serteSerte Nicu nicu_serte Data 7 februarie 2018 00:46:41
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define inf INT_MAX
int n, a[105][105];
void citire()
{
    int i, j;
    fin>>n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            fin>>a[i][j];
    fin.close();
}
void royfloid()
{
    int i, j, k;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(i!=j && a[i][j]==0)
                a[i][j]=inf;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(i!=j && i!=k && j!=k)
                    if(a[i][j]>a[i][k]+a[k][j])
                        a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
    int i, j;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            fout<<a[i][j]<<' ';
        fout<<'\n';
    }
    fout.close();
}
int main()
{
    citire();
    royfloid();
    afisare();
    return 0;
}