Cod sursa(job #3196192)

Utilizator suimerchantsui merchant suimerchant Data 23 ianuarie 2024 09:14:34
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
using namespace std;


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


int n;
int a[105][105];


void read()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>a[i][j];
}


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


int main()
{
    read();
    solve();
    return 0;
}