Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
(deftemplate hunter "A hunter" (slot agent (default Xena)) (slot x (type INTEGER)) (slot y (type INTEGER)) (slot alive (default TRUE))) (deftemplate cave "Cave objects sore the hunter's model of the world" (slot x (type INTEGER)) ; (x,y) coordinates of cave
...
-
1 2 3 4 5 6 7 8 9
(deftemplate hunter "A hunter" (slot agent (default Xena)) (slot x (type INTEGER)) (slot y (type INTEGER)) (slot alive (default TRUE))) (deftemplate cave "Cave objects sore the hunter's model of the world" (slot x (type INTEGER)) ; (x,y) coordinates of cave
...
-
1 2 3 4 5 6 7 8 9
(deftemplate hunter "A hunter" (slot agent (default Xena)) (slot x (type INTEGER)) (slot y (type INTEGER)) (slot alive (default TRUE))) (deftemplate cave "Cave objects sore the hunter's model of the world" (slot x (type INTEGER)) ; (x,y) coordinates of cave
...
-
1 2 3 4 5 6 7 8 9
(deftemplate hunter "A hunter" (slot agent (default Xena)) (slot x (type INTEGER)) (slot y (type INTEGER)) (slot alive (default TRUE))) (deftemplate cave "Cave objects sore the hunter's model of the world" (slot x (type INTEGER)) ; (x,y) coordinates of cave
...
-
1 2 3 4 5 6 7
(deftemplate hunter "A hunter" (slot agent (default Xena)) (slot x (type INTEGER)) (slot y (type INTEGER)) (slot gold (default 0)(type INTEGER)) (slot alive (default TRUE)))
-
1 2 3 4 5 6 7 8 9
v################################################ v################################################ >###8995*\9-13\##>-p55:2**3$#!+59*:!3$9$$2+2p6v## v############################################$<## v##########################?##################### 1################################################ 4#####?##########>v############################## 8##########>##v##$ ############################## *###########>v#########################v-<#######
...
-
1 2 3 4 5 6 7 8 9
Er ist’s Frühling läßt sein blaues Band wieder flattern durch die Lüfte; süße, wohlbekannte Düfte
...
-
1 2 3 4 5 6 7 8 9
Er ist’s Frühling läßt sein blaues Band wieder flattern durch die Lüfte; süße, wohlbekannte Düfte
...
-
1
(defvar *db* )
-
1 2 3 4 5 6 7 8 9
f~^kn~+c+ia~^+~cf+?/ [f!c-ki~:~b/au>++*+k~~r~bn!*+i <kk]k/>rkbrn~!:?[->+uc*a+af~>^b+ub+k +i?:fn>+b+kb^+>kn?+ii/kb++u>?a+^+?+u>u?c+ i:+~/+>++:kba+~b?+:>+rr!b+k+++u?n<k!b**<i<c~i <!^<<<<krb~^/]>>-u~/*-:<ck^<++!!:n+!kcbinc[~kr-: *k:!kb?>c~>>*u!nnrbabi>+irn>i?+~+?>icc*+ci+i+!<<rb ^knnb<!<!i<b^r<i!^/]>f/>>a/?>i~>~>>>b--.r/rucffa!/<n <:u<?ua<cr<*:<i:bb<fu/nb.>b:r:*?**>n:!>::~/*+.>>r-:.:
...
-
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
(+ 5 7)
-
1
(list 12)
-
1 2 3 4 5 6 7 8
(defrule fu (x y) (loop (when (or (= x 0) (= y 0)) (return (+ x y))) (if (> x y) (setq x (mod x y)) (setq y (mod y x))) ) ) (fu 10 12)
-
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
(defun fu (x y) (loop (when (or (= x 0) (= y 0)) (return (+ x y))) (if (> x y) (setq x (mod x y)) (setq y (mod y x))) ) ) (fu 10 12)
-
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 8 9
#include<stdio.h> int main() { int a; scanf("%d",&a); a = a * 2; printf("The answer is %d",a); return 0;
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int c; c = 127; printf("%d",c); return 0;
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int c; c = 127; printf("%d,%d",c++,c); return 0;
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int c; c = 127; printf("%d,%d",c,++c); return 0;
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int c; c = 127; printf("%d,%d",c,(c+1)); return 0;
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int c; c = 127; printf("%d,%d",c,c+1); return 0;
-
1
-
1 2 3 4
(dotimes (x 10) (dotimes (y 10) (format t "~3d " (* (1+ x) (1+ y)))) (format t "~%"))
-
1
(format nil "~R" 311)
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; int main () { int k, suma=0; while (cin>>k){ suma=suma+k; }
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; int main () { int k, mitjana, f, suma; while (cin>>n){ suma=suma+k; mitjana=suma/f;
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; int main () { int n, mitjana, f; while (cin>>n){ mitjana=n/f
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; int main () { int k, suma=0; while (cin>>k){ suma=suma+k; } cout <<suma<< endl; }


