# ICPC2006 ProblemA

ディリクレの算術級数定理 (defun primep (num) (loop for i from 2 upto (1- num) when (zerop (mod num i)) return nil finally (return t))) (defun find-prime (a d n) (labels ((%find-prime (a d num n) (let ((prime-p (primep num))) (if (and (zero…

# ICPC2004 ProblemB

Read and Black (defun list-to-2d-array (list) (make-array (list (length list) (length (first list))) :initial-contents list)) (defun read-map (width height) (list-to-2d-array (loop for i from 1 upto height collect (coerce (read-line) 'list…

# ICPC2005 ProblemC

Numerial Systemです。 (defun num-char-p (char) (when (typep char 'character) (<= (char-code #\0) (char-code char) (char-code #\9)))) (defun num-char-to-num (num-char) (- (char-code num-char) (char-code #\0))) (defun num-to-num-char (num) (…

# ICPC2005 ProblemB

Make Purse Light! (defun calc-return (money) (multiple-value-bind (500-yen rem) (floor money 500) (multiple-value-bind (100-yen rem) (floor rem 100) (multiple-value-bind (50-yen rem) (floor rem 50) (multiple-value-bind (10-yen rem) (floor …