Cod sursa(job #2343523)

Utilizator baranceanuBaranceanu Vlad baranceanu Data 14 februarie 2019 08:20:46
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[105][105];
int n;
void citire();
int main()
{
    int i,j,k;
    citire();
    for(k=1;k<=n;k++)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                if(k!=i&&k!=j)
                m[i][j]=min(m[i][j],m[i][k]+m[k][j]);
            }
        }
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        if(i!=j&&m[i][j]==999999999)
        {
            m[i][j]=0;
        }
    }
    for(i=1;i<=n;i++)
     {for(j=1;j<=n;j++)
    {
        fout<<m[i][j]<<' ';
    }
    fout<<'\n';
    }
    return 0;
}
void citire()
{
    int i,j;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        fin>>m[i][j];
        if(i!=j&&m[i][j]==0)
        {
            m[i][j]=999999999;
        }
    }
}