aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-04-30 12:34:36 -04:00
parent 4bb20c9b71
commit cbaf4c4b64
12390 changed files with 318560 additions and 27248 deletions
Download patch file Download diff file Expand all files Collapse all files

48
Task/Knapsack-problem-Unbounded/EchoLisp/knapsack-problem-unbounded.l
View file

@ -31,35 +31,35 @@
;; compute best quantity.score (i), assuming best (i-1 p v) is known
(define (score-qty i p v (q) (score)(smax)(qmax))
(or
(t-get i p v) ;; already known
(begin
(set! q (min (quotient p (poids i)) (quotient v (volume i)))) ;; max possible q
(set! smax -Infinity)
( for ((k (1+ q))) ;; try all legal quantities
(set! score (+
(first (score-qty (1- i) (- p (* k (poids i))) (- v (* k (volume i)))))
(* k (valeur i))))
#:continue (< score smax)
(set! smax score)
(set! qmax k))
(hash-set H (t-key i p v) (cons smax qmax)))))
(or
(t-get i p v) ;; already known
(begin
(set! q (min (quotient p (poids i)) (quotient v (volume i)))) ;; max possible q
(set! smax -Infinity)
( for ((k (1+ q))) ;; try all legal quantities
(set! score (+
(first (score-qty (1- i) (- p (* k (poids i))) (- v (* k (volume i)))))
(* k (valeur i))))
#:continue (< score smax)
(set! smax score)
(set! qmax k))
(hash-set H (t-key i p v) (cons smax qmax)))))
;; compute best scores, starting from last item
(define (task P V)
(define N (1- (table-count T)))
(define qty 0)
(set! H (make-hash))
(writeln 'total-value (first (score-qty N P V)))
(for/list ((i (in-range N -1 -1)))
(set! qty (rest (t-get i P V)))
#:continue (= qty 0)
(begin0
(cons (name i) (t-get i P V))
(set! P (- P (* (poids i) qty)))
(set! V (- V (* (volume i) qty))))))
(writeln 'total-value (first (score-qty N P V)))
(for/list ((i (in-range N -1 -1)))
(set! qty (rest (t-get i P V)))
#:continue (= qty 0)
(begin0
(cons (name i) (t-get i P V))
(set! P (- P (* (poids i) qty)))
(set! V (- V (* (volume i) qty))))))
;; output
(task 25000 250)