Cod sursa(job #2375116)

Utilizator LazarRazvanLazar Razvan LazarRazvan Data 7 martie 2019 22:26:26
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <bits/stdc++.h>
#define NMax 101
#define oo 10001
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
int ma[NMax][NMax];

int main(void)
{
    fin >> N;
    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
            fin >> ma[i][j];
    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
        {
            if (ma[i][j] == 0 && i!=j)
                ma[i][j] = oo;
        }
    for (int k=1; k<=N; k++)
    {
        for (int i=1; i<=N; i++)
        {
            for (int j=1; j<=N; j++)
            {
                if (ma[i][j] > ma[i][k] + ma[k][j])
                    ma[i][j] = ma[i][k] + ma[k][j];
            }
        }
    }
    for (int i=1; i<=N; i++)
    {
        for (int j=1; j<=N; j++)
            fout << ma[i][j] << " ";
        fout << '\n';
    }
}