* 素数を求める
素直にループ
update : 2006-06-22 (Thu) 00:39:48
(defun generate-primes (limit) (let ((prime nil)) (push 2 prime) (do ((x 3 (+ x 2))) ((> x limit)) (if (dolist (i prime t) (if (zerop (rem x i)) (return nil))) (push x prime))) (format t "~{ ~A~}~%" (nreverse prime))))
update : 2006-06-22 (Thu) 00:39:48