Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
(- 2 4)
;gnu clisp 2.49.60 ;(print (EQ (mod 2 2) 0)) ;(COND ((EQ (mod 2 2) 0) 'Не-простое-число ; (T 'Простое-число))) (defun TEST (x) (COND ((> x 1) (loop for y from 2 to (- x 1) never (zerop(mod x y)))) (T 1))) (print (TEST 29))
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
homework.lisp
ExemplosLisp1
lr_1
S17016281_ACTIVIDAD_14
Sift-down operation for heapification
testing.lisp
Классическая задача расстановки безопасных фигур для махараджи
fibonacci with if
Project Euler Problem 149
5
Please log in to post a comment.