Cod sursa(job #2118719)

Utilizator TudorFinaruTudor Cristian Finaru TudorFinaru Data 30 ianuarie 2018 21:42:11
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[103][103];

void roy_floyd()
{
    int i, j, k;
    for (k=1;k<=n;k++)
        for (i=1;i<=n;i++)
            for (j=1;j<=n;j++)
                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()
{
    int i,j;
    f>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            f>>a[i][j];
        }
    roy_floyd();
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++) g<<a[i][j]<<' ';
        g<<'\n';
    }
    f.close();
    g.close();
    return 0;
}