`(disivible'(1 2 3 4 5 6 7)).这是我到目前为止所做的:
(defun divisible(n)
(cond ((eq n 0) nill) (eq(rem n 3) 0) t )('else 0)))
Run Code Online (Sandbox Code Playgroud)
但我是lisp的新手,我不知道如何让它不显示3可被整除的数字,只需添加数字并显示结果.有谁可以帮助我吗?
(defun divisible (num-list)
(reduce #'+
(remove-if-not #'zerop
num-list
:key (lambda (x)
(mod x 3)))))
Run Code Online (Sandbox Code Playgroud)