Cod sursa(job #2416016)

Utilizator GoogalAbabei Daniel Googal Data 26 aprilie 2019 19:05:05
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 1e2;

int n;
int g[1 + NMAX][1 + NMAX];

int main()
{
  in >> n;

  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
      in >> g[i][j];

  for(int k = 1; k <= n; k++)
    for(int i = 1; i <= n; i++)
      for(int j = 1; j <= n; j++)
        if(g[i][k] && g[k][j] && (g[i][k] + g[k][j] < g[i][j] || g[i][j] == 0) && i != j)
          g[i][j] = g[i][k] + g[k][j];

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= n; j++) {
      out << g[i][j] << ' ';
    }

    out << '\n';
  }

  in.close();
  out.close();

  return 0;
}