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
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1
0 dup 0 = invert . . . .
-
1
0 dup 0 = dup invert . . . .
-
1
0 dup 0 = dup invert . . .
-
1
0 dup 0 = dup invert . .
-
1
0 dup 0 = dup invert .
-
1
0 dup 0 = dup invert
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1
9 1- .
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup swap ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
9 constant limit : next-is-zero dup 0 = ; : keep-number dup swap ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
999 constant limit : next-is-zero dup 0 = ; : keep-number dup swap ; : multiple-of-3 dup 3 mod 0 = ; : test-next multiple-of-3 if
...
-
1 2 3 4 5 6 7 8 9
: NEXT-IS-ZERO DUP 0 = ; : ADD-NUMBER DUP SWAP ; : MULTIPLE-OF-3 DUP 3 MOD 0 = ; : TEST-NEXT MULTIPLE-OF-3 IF ADD-NUMBER THEN 1- ;
...
-
1 2 3 4 5 6 7 8 9
: NEXT-IS-ZERO DUP 0 = ; : ADD-NUMBER DUP SWAP ; : TEST-NEXT MULTIPLE-OF-3 IF ADD-NUMBER THEN 1- ; : GENERATE-NUMBERS
...
-
1 2 3 4 5 6 7 8 9
: NEXT-IS-ZERO DUP 0 = ; : GENERATE-NUMBERS NEXT-IS-ZERO DUP INVERT IF TEST-NEXT THEN ; : TEST-NEXT MULTIPLE-OF-3 IF ADD-NUMBER THEN 1- ;
...
-
1 2 3 4 5
: EULER1 999 ; EULER1 .
-
1
10 10 * .
-
1 2 3 4
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
Die Zeichen des Frühlings sind unsichtbar UMS Team
-
1 2 3 4 5 6 7 8 9
: check ( m cnt -- b ) { m cnt } \ var i -1 3 -1 begin over m <= and while nip dup 2 + swap cnt swap mod tuck ( # cnt+2 # ) repeat
...
-
1 2 3 4 5 6 7 8 9
: check ( m cnt -- b ) { m cnt } \ var i -1 3 -1 begin over m <= and while nip dup 2 + swap cnt swap mod tuck ( # cnt+2 # ) repeat
...
-
1 2
1 2 + . bye
-
1 2
." Hello" cr bye
-
1 2 3
: test ." Hello" CR ; test bye
-
1 2
: test ." Hello" CR ; test
-
1 2
: test ." Hello" CR ; test


