Cod sursa(job #2489947)

Utilizator uvIanisUrsu Ianis Vlad uvIanis Data 9 noiembrie 2019 13:58:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <bits/stdc++.h>
#define infinity 1000000000
using namespace std;

int main()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");

    int m[101][101], N;
    fin >> N;

    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j)
        {
            fin >> m[i][j];
            if(i != j && !m[i][j]) m[i][j] = infinity;
        }

    for(int k = 1; k <= N; ++k)
        for(int i = 1; i <= N; ++i)
            for(int j = 1; j <= N; ++j)
                if(m[i][k] + m[k][j] < m[i][j])
                      m[i][j] = m[i][k] + m[k][j];

    for(int i = 1; i <= N; ++i)
    {
         for(int j = 1; j <= N; ++j)
            if(m[i][j] == infinity)
                fout << "0 ";
            else
                fout << m[i][j] << ' ';

         fout << '\n';
    }
}