Problem 90 Project Euler, Common Lisp

Problem 90 Project Euler

;gnu clisp 2.49

(defparameter dice (loop for i1 from 0 to 9 nconc
                                   (loop for i2 from (1+ i1) to 9 nconc
                                   (loop for i3 from (1+ i2) to 9 nconc
                                   (loop for i4 from (1+ i3) to 9 nconc
                                   (loop for i5 from (1+ i4) to 9 nconc
                                   (loop for i6 from (1+ i5) to 9 collect (vector i1 i2 i3 i4 i5 i6))))))))

(defun test-dice (die1 die2)
   (loop for d1 fixnum across #(0 0 0 1 2 3 4 6 8)
            for d2 fixnum across #(1 4 9 6 5 6 9 4 1)
            always (or (and (find d1 die1 :test #'(lambda (x y) (if (find x #(6 9)) (find y #(6 9)) (= x y))))
                                     (find d2 die2 :test #'(lambda (x y) (if (find x #(6 9)) (find y #(6 9)) (= x y)))))
                             (and (find d2 die1 :test #'(lambda (x y) (if (find x #(6 9)) (find y #(6 9)) (= x y))))
                                     (find d1 die2 :test #'(lambda (x y) (if (find x #(6 9)) (find y #(6 9)) (= x y))))))))

(pprint (loop for i on dice 
                    summing (loop for j on i counting (test-dice (car i) (car j)))))


run \| edit \| history \| help	0

λ

                                      .NET NoSQL database for rapid development