Cod sursa(job #2096685)

Utilizator omegasFilip Ion omegas Data 29 decembrie 2017 16:44:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <iostream>
#include <fstream>

using namespace std;

int a[101][101];
int s[101][101];
int aux[101][101];
int n;

void solve(int k)
{
    if(k==0)
    {
    int p,q;
    for(p=1;p<=n;++p)
        for(q=1;q<=n;++q)
        s[p][q]=a[p][q];
    }

    if(k >= 1)
    {
        solve(k-1);
        int i,j;
        for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            if(s[i][j]<s[i][k]+s[k][j])
                aux[i][j]=s[i][j];
            else
                aux[i][j]=s[i][k]+s[k][j];
        for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            s[i][j]=aux[i][j];
    }
}

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

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

    solve(n);

    for(i=1;i<=n;++i)
    {
    for(j=1;j<=n;++j)
    {
        if(s[i][j]==2000)
            fout << 0;
        else
        fout << s[i][j] <<" ";
    }
    fout << "\n";
    }



    return 0;
}