1
2
3
4
5
(defun gen-s-aux (l_sacos)
        (let num (+ 1 (random 8)))
        (cond ((equal (member num l_sacos) NIL) ((append l_sacos (list num)) (gen-s-aux l_sacos)))
          (t (gen-s-aux l_sacos))) 
        )

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
4857129956543803615

1
4857129956543803615

1
2
3
4
(apply str  
  (flatten 
    (map reverse 
      (partition 2 "lCuoerC doni goMknye"))))

1
setq(x 'dag)

1
 

1
2
3
4
(defrule animal
  (animal ?)
  =>
  (printout t "animal found" crlf))

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
#include <stdio.h> 
 
int main(void) { 
  int x; 
  for(; scanf("%d",&x) > 0 && x != 42; printf("%d\n", x)); 
  return 0; 
} 

1
2
3
4
5
6
7
8
9
#include<iostream>
using namespace std;
 
int main()
{
    int n,i;
    int ne,nm,pb;
    int pe=1;
    int fpb;
 ...

1
2
3
4
5
6
7
8
9
(progn
  (defun collatz (n)
    (if (evenp n)
        (/ n 2)
      (+ (* 3 n) 1)))
 
  (defun collatz-list (ls)
    (if (not (listp ls))
        (setq ls (cons ls ())))
 ...

1
2
3
4
5
6
7
8
9
(progn
  (defun collatz-aux (n)
    (if (evenp n)
        (/ n 2)
      (+ (* 3 n) 1)))
 
  (defun collatz-list(n, li)
    (let* ((col (collatz-aux n)))
      (format "%d" col)
 ...

1
2
3
4
5
6
7
var
a,b:int64;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
var
a,b:int64;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
var
a,b:int64;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
var
a,b:longint;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
var
a,b:longint;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
var
a,b:longint;
sp:char;
begin
read(a,sp,b);
writeln(a mod b);
end.

1
2
3
4
5
6
var
a,b,c:longint;
begin
read(a,b);
writeln(a mod b);
end.

1
2
3
4
5
6
var
a,b,c:longint;
begin
read(a,b);
writeln(a mod b);
end.

1
2
3
4
5
6
var
a,b,c:longint;
begin
read(a,b);
writeln(a mod b);
end.

1
2
3
4
5
6
7
8
9
int lim = 0x12345678; int pp = 256;
for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) {
    if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50
        lim = (lim / 50) * 40;
    int foo = lim; // bar
    for (int j = 0; j < 0x123456; j++)
        foo ^= (j >> 3) | (j << 29); // tidy
    pp &= foo; // in 42-0
    if (lim - ((lim / i) * i) == 0) {
 ...

1
2
3
4
5
6
7
 
(defrule R2
        (is shape (or long oblong)
        (test (>= diameter 4))
        =>
        (assert (is fruitclass vine))
)

1
2
3
4
5
6
7
8
9
(defrule R1
        (is shape long)
        (is colour (or green yellow))
        =>
        (assert (is fruit banana))
)
 
(defrule R2
        (is shape (or long oblong)
 ...

1
2
3
4
5
6
7
8
9
(defrule R1
        (is shape long)
        (is colour (or green yellow))
        =>
        (assert (is fruit banana))
)
(defrule R2
        (is shape (or long oblong)
        (test (>= diameter 4))
 ...

1
2
3
4
5
6
(defrule R2
        (is shape (or long oblong)
        (test (>= diameter 4))
        =>
        (assert (is fruitclass vine))
)

1
2
3
4
5
6
(defrule R1
        (is shape long)
        (is colour (or green yellow))
        =>
        (assert (is fruit banana))
)

1
2
3
4
5
6
7
8
9
(defrule R1
        (is shape long)
        (is colour (or green yellow))
        =>
        (assert (is fruit banana))
)
(defrule R2
        (is shape (or long oblong)
        (test (>= diameter 4))
 ...

1
2
3
4
5
6
7
8
9
(deffacts f1 (Color red))
(deffacts f2 (Shape round))
(deffacts f3 (Seedcount 1))
(deffacts f4 (Diameter 1))
 
(defrule rule1
        (Shape long)
        (or
                (Color green)
 ...