Cod sursa(job #2204985)

Utilizator vladboss2323Ciorica Vlad vladboss2323 Data 17 mai 2018 15:36:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int N=105;
const int MAX=10000000;
int n,a[N][N];

void citire()
{
    in>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            in>>a[i][j];
            if(i!=j && a[i][j]==0)
                a[i][j]=MAX;
        }
}

void cost()
{
    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][j]=a[i][k]+a[k][j];
                }
}

void afisare()
{
    int i,j;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            if(a[i][j]!=MAX)
                out<<a[i][j]<<" ";
            else
                out<<0<<" ";
        out<<endl;

    }
}
int main()
{
    citire();
    cost();
    afisare();
    return 0;
}