Pascal J. Bourguignon wrote:

> >> count from 1 to 100
> >> if the number is divizible by three print fizz
> >> if by 5 print bazz
> >> if by both 3 and 5, print fizzbazz
> >> if none of those, print the number
> >>
> >>
> >>
> >> post your lisp solution!
>
>
> Just put parentheses around your own solution!
>
> (defun divisiblep (n d) (zerop (mod n d)))
>
> (loop for number from 1 to 100
> if (divisiblep number 3) do (princ "fizz")
> if (divisiblep number 5) do (princ "bazz")
> if (not (or (divisiblep number 3) (divisiblep number 5))) do (princ number)
> do (terpri))

Gauche Scheme:

(use srfi-13)

(define (print* a b n)
(let ((s (string-append a b)))
(print (if (#/./ s) s n))))

(for-each
print*
(circular-list "" "" "fizz")
(circular-list "" "" "" "" "buzz")
(iota 15 1))

1
2 fizz
4 buzz
fizz
7 8
fizz
buzz
11
fizz
13
14
fizzbuzz

On 3/21/2022, Robert L. wrote:

> (use srfi-13)

Correction:

(use srfi-1) ;; for circular-list