1
2
3
4
5
6
(defun gcd (a b)
        (if (zerop b) a (gcd b (mod a b))))
 
(defun lcd (a b) (/ (* a b) (gcd a b)))
 
(print (reduce #'lcd (loop for i from 1 to 20 collect i)))

1
2
@ 0,0 say "hello world"
inkey(0)

1
2
@ 0,0 say "hello world"
inkey(0)

1
2
3
4
5
6
7
8
9
Lemon os
 
New//int
O.s Lemon|:Boot
//gif>>lemon:
0
:Run/open/con
Nstream;/gif>>
0
 ...

1
2
3
4
5
6
7
8
9
begin 644 webutils_pl
M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR
M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!"
M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[
M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9!
M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y
M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3
M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA>
M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
 ...

1
2
3
4
5
6
7
8
9
(defrule readin
        ?f<-(initial-fact)
=>
        (retract ?f)
        (assert (number (read)))
)
 
(defrule writeout
        ?f<-(number ?n)(test (<> ?n 42))
 ...

1
2
3
4
5
6
7
8
9
(deftemplate apilado
(slot encima (type SYMBOL))
(slot debajo (type SYMBOL))
)
(deftemplate objetivo
(slot encima (type SYMBOL))
(slot debajo (type SYMBOL))
)
(deffacts bloques
 ...

1
2
3
4
5
6
7
8
9
#
(defun n-words-with-width-less-than (words fontsize length &optional (accum nil))
#
  "The first N words with a combined fontwidth (including spaces) less than the width required."
#
  (if (<= (* fontsize
#
             (+ (length accum) ;;Add the spaces.
#
 ...

1
2
3
4
5
6
7
8
9
(defrule readin
        ?f<-(initial-fact)
=>
        (retract ?f)
        (assert (number (read)))
)
 
(defrule writeout
        ?f<-(number ?n)(test (<> ?n 42))
 ...

1
2
3
4
5
6
7
8
9
;;Solution to facebook hacker cup Billboard brain teaser.
;;author: sea <http://sea4ever.users.sourceforge.net>
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
 
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
2
3
4
5
6
7
8
9
;;Solution to facebook hacker cup Billboard brain teaser.
;;author: sea <http://sea4ever.users.sourceforge.net>
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
 
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
2
3
4
5
6
7
8
9
(defun n-words-with-width-less-than (words fontsize length &optional (accum nil))
  "The first N words with a combined fontwidth (including spaces) less than the width required."
  (if (<= (* fontsize
             (+ (length accum) ;;Add the spaces.
                -1 ;;Minus one, since the last word needs no space after it.
                (apply #'+ (mapcar #'length accum))));;Total width of the words
          length)
      (if (null words) accum
          (n-words-with-width-less-than (cdr words) fontsize length (cons (car words) accum)))
 ...

1
2
3
4
5
6
7
8
9
;;Solution to facebook hacker cup Billboard brain teaser.
;;author: sea <http://sea4ever.users.sourceforge.net>
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
 
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
2
3
4
5
6
7
8
9
(defun n-words-with-width-less-than (words fontsize length &optional (accum nil))
  "The first N words with a combined fontwidth (including spaces) less than the width required."
  (if (<= (* fontsize
             (+ (length accum) ;;Add the spaces.
                -1 ;;Minus one, since the last word needs no space after it.
                (apply #'+ (mapcar #'length accum))));;Total width of the words
          length)
      (if (null words) accum
          (n-words-with-width-less-than (cdr words) fontsize length (cons (car words) accum)))
 ...

1
2
3
4
5
6
7
8
9
(defun n-words-with-width-less-than (words fontsize length &optional (accum nil))
  "The first N words with a combined fontwidth (including spaces) less than the width required."
  (if (<= (* fontsize
             (+ (length accum) ;;Add the spaces.
                -1 ;;Minus one, since the last word needs no space after it.
                (apply #'+ (mapcar #'length accum))));;Total width of the words
          length)
      (if (null words) accum
          (n-words-with-width-less-than (cdr words) fontsize length (cons (car words) accum)))
 ...

1
2
3
4
5
6
7
8
9
main()
{
int i,n,fact=1;
printf("enter value of n");
scanf("%d",&n);
for(i=1;i<n;i++)
{
fact=fact*(n-1)
  }
 ...

1
2
3
4
5
6
7
8
9
main()
{
int i,n,fact=1;
printf("enter value of n");
scanf("%d",&n);
for(i=1;i<n;i++)
{
fact=fact*(n-1);
  }
 ...

1
2
3
4
5
6
7
8
9
main()
{
int i,n,fact=1;
printf("enter value of n");
scanf("%d",&n);
for(i=1;i<n;i++)
{
fact=fact*(n-1)
  }
 ...

1
bbjlkb

1
(+ (- 2 3) (+ 4 6))

1
2
3
4
5
6
7
8
9
 (funcall (lambda (toi three xexp xx pred)
           (funcall (lambda (x)
                      (map (quote (vector character)) (lambda (i) (funcall (lambda (x) (code-char (+ 48 x))) (ldb (byte (funcall toi (lambda (f) (lambda (x) (funcall f (funcall f (funcall f x)))))) i) x)))
                           (funcall (lambda (x)
                                      (declare (special x))
                                      (funcall (lambda (tf) (funcall (lambda (f) (funcall tf f)) (lambda (f) (funcall tf f))))
                                               (lambda (f)
                                                 (cons (funcall toi x)
                                                       (unless (funcall (funcall x (lambda (x) nil)) t)
 ...

1
Mfp ey zwvo fvat rjx hwprdrr lb nawzh tnfpc: Anj icvlu, hjgy Kbffhg, zk hjp gm nso nntjj, phf sw vawwhnwer, pcum nu oeq ewllxqmqit

1
2
3
4
5
my$x35 =chr(176)."55".chr(46);my$x34 ;$x35=$x35."0\x363
E \t1;\10". 1 % 2 .chr(176/1) ."3\x34."; $x34=36 ;print
"\x4E\11\x350" .$x35."1".$x34% 32 ."\x38\nH@". chr (80)
.";\10Py "."c\x41c".chr ($x34*2 ) ."!Ng! :\x29 \n\7" ;;
 

1
2
3
4
5
6
7
8
9
(defun msqrt (n)
        (if (= n 1)
                1
                (let 
                        ((prib (msqrt(- n 1))))
                        (/ (+ prib (/ n prib)) 2)
                )
        )
)

1
2
(defun lol (x) (+ x 2))
(print (lol 2))

1
2
(defun lol(x) (+ x 2))
(print (lol 2))

1
2
(defun lol (+ x 2))
(print (lol 2))

1
2
(defun (lol x) (+ x 2))
(print (lol 2))

1
2
(define (lol x) (+ x 2))
(print (lol 2))

1
2
3
4
5
6
7
8
9
(defrule readin
        ?f<-(initial-fact)
=>
        (retract ?f)
        (assert (number (read)))
)
 
(defrule writeout
        ?f<-(number ?n)(test (<> ?n 42))
 ...