Ecco un problema algoritmico che sto cercando di risolvere:
Given a list [x_1,x_2,...,x_n] return a permutation of elements of the list [y_1,y_2,...,y_n] (where for each i we have y_i = x_j for only one j) which maximises the sum from k=1 t...
posta
13.12.2014 - 00:30