Psst.. new poll here.
Psst.. new forums here.
Microsoft is blocking us again (TY IP Reputation!) so just use oauth login instead. :)
Paste
Pasted as Lisp by Sebas ( 14 years ago )
;==============2===============
(defun ncubos(n)(loop as i from 1 to n do ;Desde 1 -> n (i++)
(print (expt i 3))
));N numeros Cubo
;==============3===============
(defun capan(cf ci i)(log (/ cf ci) (+ 1 i)))
;==============4===============
(defun esprimo(n) (progn (setq cont 0);NUMEROS PRIMOS
(progn (loop for i from n downto 1 do ;Desde n -> 1 (i--)
(if(= (mod n i) 0) (setq cont (+ cont 1)) ()))
(if(<= cont 2) (if(= n 1) NIL T) NIL ))
)); Esta 100% Correcto
;==============5===============
(defun sumtoria(nu1 nu2) (progn (setq cont 0)
(if (>= nu2 nu1);if
(progn (loop for i from nu1 to nu2 do
(setq cont (+ cont i))
)
(+ cont 0))
;else
(format nil "Lo siento no se puede sumar")
)))
(sumtoria 1 99)
;==============6===============
(defun impa (lita)(progn (setq cont 0)
(progn (dolist (x lita)
(if(= (mod x 2) 0)
(setq cont (+ cont 1));if
()));else
(if(= cont 0) T NIL)
)))
(impa '(1 3 5 7 9))
;=========DOLIST==============
(progn (setq x '(1 2 3 4 5 6))
(dolist (y x) (print y)))
;===========SORT==============
(progn (setq x '(2 1 5 4 6))
(sort x #'>));Mayor a menor
;===========MEMBER============
(progn (setq x '(1 2 3 4 5 6 7 8 9 10))
(member 3 x));Encuentra la coincidencia e imprime hasta el final
;==============7===============
(defun mi-member (a lita)(progn
(setq cont 0)
(progn
(dolist (x lita)
(if(= cont 0)
(if(equal a x)
(progn (setq cont (+ cont 1))
(print x ))
())
(print x);else
)))))
(mi-member 6 '(1 2 3 walala 4 5 6 7))
;==============8===============
(defun mi-asoc(x lita)(dolist (y lita)
(print(cons x (cons y nil)))))
(mi-asoc 3 '(1 2 3 4 5 6))
;==============9===============
(defun mi-nth(x lita)(progn (setq cont 0)
(if(< x (length lita))
(dolist (y lita)
(if(= x cont)
(return y)
(setq cont (+ cont 1))))
(format nil "ERROR")
)))
(mi-nth 5 '(1 4 3 5 3 2))
;==============10===============
(defun plus(x y)(if (= y 0) (+ x 0)
(+ (+ x 1) (- y 1))))
(plus 51 49)
;==============11===============
(defun repeat (n x)(progn (setq lita nil)
(progn (loop for i from 1 to n do
(setq lita (cons x lita)))
lita
)))
(repeat 8 'T)
;==============12===============
(defun emparejar (lia1 lia2)(if(= (length lia1) (length lia2))
(progn (loop for i from 0 to (- (length lia1) 1) do
(progn (setq par nil)
(progn (setq par (cons (nth i lia2) par))
(progn (setq par (cons (nth i lia1) par))
(print par))))))
(format nil "ERROR")))
(emparejar '(1 2 3 4) '(8 7 6 5))
;==============13===============
(defun emparejar2 (lia1 lia2)(if(= (length lia1) (length lia2))
(progn (loop for i from 0 to (- (length lia1) 1) do
(progn (setq par nil)
(progn (setq par (cons (nth i lia2) par))
(progn (setq par (cons (nth i lia1) par))
(print par))))))
(if(> (length lia1) (length lia2))
(progn
(progn (setq cont 0)
(loop for i from 0 to (- (length lia1) 1) do
(progn (setq par nil)
(progn (setq par (cons (nth i lia2) par))
(progn (setq par (cons (nth i lia1) par))
(print par)))))))
(progn
(progn (setq cont 0)
(loop for i from 0 to (- (length lia2) 1) do
(progn (setq par nil)
(progn (setq par (cons (nth i lia2) par))
(progn (setq par (cons (nth i lia1) par))
(print par)))))
)))))
(emparejar2 '(1 2 3 4) '(8 7 6 5 4))
(emparejar2 '(1 2 3 4 5) '(8 7 6 5 4))
(emparejar2 '(1 2 3 4) '(8 7 6 5 9 8))
;==============14===============
(defun sublistas (lita)(progn (setq lista nil)
(progn (setq elm nil)
(progn (loop for i from (- (length lita) 1) downto 0 do
(progn (loop for e from (- (length lita) 1) downto i do
(setq elm (cons (nth e lita) elm)))
)
)
elm
))))
(sublistas '(a b c))
;==============15===============
(defun numeros (n) (loop for i from 1 to n do
(terpri);salto de linea
(loop as x from 1 to i do
(progn (princ i)
(princ " ")))
))
(numeros 8)
;==============16===============
(defun elementon(n)(progn(setq lista '(1))
(progn (setq ant 1)
(progn (loop for i from 2 to n do
(progn (setq lista (append lista (list (+ i ant))))
(setq ant (+ i ant))
)
)
lista
))))
(elementon 6);(1 3 6 10)
;==============17===============
(defun invierte (lita) (progn (setq lita2 nil)
(loop for i from 0 to (- (length lita) 1) do
(setq lita2 (cons (nth i lita) lita2)))
lita2
))
(invierte '(1 2 3 4 5 6 7 8 9 a b c d e f g h i))
;==============18===============
(defun get-position (arg lia)(progn (setq cont 0)
(dolist (x lia)
(if(equal arg x) (return cont) (setq cont (+ cont 1))))
))
(get-position 34 '(1 2 3 5 4 34 3 3 3 w))
;==============19===============
(defun get-number (lita)(progn(setq lia nil)
(progn (dolist (x lita)
(if(numberp x)
(setq lia (append lia (list x)))()))
(setq lia lia)
)))
(get-number '(1 w 3 2 r t 5))
;===============================
(defun asd(lia) (dolist (x lia) (print x)()))
(asd '((1 (2)) a (((5 c 7))) 4))
;==============20===============
;FALTAAAAAAAAAAAAAAAAAAAAA
;==============21===============
(defun ord(lita)(progn (setq cont 0)
(progn (setq ant (nth 0 lita))
(progn (dolist (x lita)
(if(>= x ant)(setq ant x)
(setq cont (+ cont 1)))
)
(if(= cont 0) T NIL)
))))
(ord '(1 2 3 5))
(ord '(1 4 3 2))
Revise this Paste
Parent: 48727