Cod sursa(job #2103984)

Utilizator futurengineerOana Rosca futurengineer Data 10 ianuarie 2018 23:56:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include <fstream>

using namespace std;

int n, m[101][101], new_d;

int main () {
  ifstream fi("royfloyd.in");
  ofstream fo("royfloyd.out");
  fi >> n;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      fi >> m[i][j];
  for (int k = 1; k <= n; k++)
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++) {
        new_d = m[i][k]+m[k][j];
        if (i != j and m[i][k] and m[k][j] and (!m[i][j] or m[i][j] > new_d))
          m[i][j] = new_d;
      }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      fo << m[i][j] << ' ';
    fo << '\n';
  }
  return 0;
}