Cod sursa(job #2758746)

Utilizator mitocaru_marioMitocaru Mario-Alexandru mitocaru_mario Data 12 iunie 2021 12:55:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N=102;
const int INF=1000000;
int n,a[N][N];
int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
        for(int j=1;j<=n;j++)
        f>>a[i][j];

    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            if(a[i][j]==0)
                a[i][j]=INF;
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(k!=i && k!=j && i!=j)
                    a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]==INF)
                a[i][j]=0;
            g<<a[i][j]<<' ';
        }
        g<<'\n';
    }

    return 0;
}