Cod sursa(job #2260263)

Utilizator 18.1.26.22.1.14Bobei Razvan 18.1.26.22.1.14 Data 14 octombrie 2018 18:31:18
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream scan("royfloyd.in");
ofstream print("royfloyd.out");
int n ,ad[105][105] ;
int main()
{
  scan >> n;
  for(int i = 1 ; i <= n ; ++i)
   for(int j = 1 ; j <= n ; ++j)
    scan >> ad[i][j];
  for(int k = 1 ; k <= n ; k++)
   for(int i = 1 ; i <= n ; i++)
    for(int j = 1 ; j <= n ; j++)
     if(ad[i][k]&&ad[k][j])
      ad[i][j] = min(ad[i][j],ad[i][k]+ad[k][j]);
  for(int i = 1 ; i <= n ; i ++ ){
    for(int j = 1  ; j <= n  ; j ++ )
     print << ad[i][j] << " ";
     print << "\n";
  }
    return 0;
}