Cod sursa(job #2208962)

Utilizator stanbianca611Stan Bianca stanbianca611 Data 1 iunie 2018 13:30:12
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n, a[105][105];
void royfloyd()
{
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            for(int k=1; k<=n; k++)
            if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) &&i!=j)
                a[i][j]=a[i][k]+a[k][j];
}

int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
        f>>a[i][j];
    royfloyd();
    for(int i=1; i<=n; i++)
       {
        for (int j=1; j<=n; j++)
            g<<a[i][j]<<" ";
            g<<"\n";
       }
    return 0;
}