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
: jvm_class.getField_offset2() { addr c-addr n -- off wior } addr BEGIN dup jvm_class.getField_offset_wid() c-addr n rot TRY jvm_find_word invert IFERROR false WHILE ENDIF
...
-
1
http://pastebin.com/MAzpmPuP
-
1
4 5 + .
-
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
#include<stdio.h> void main() { int a=2,b=5,c; printf("Enter the numbers"); scanf("%d,%d"&a,&b); c=a*b; printf("the sum of two numbers are",c); }
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<conio.h> void main() { int a=2,b=5,c; printf("Enter the numbers"); scanf("%d,%d"&a,&b); c=a*b; printf("the sum of two numbers are",c);
...
-
1 2 3 4 5 6 7 8
\ vim: sw=2 ts=2 sta et 256 CONSTANT jvm_opcode_count CREATE jvm_opcode_table jvm_opcode_count cells allot : ^> ( opcode imm mnemonic len -- opcode imm opcode name ) 2over drop -rot ( opcode imm opcode mnemonic len ) nextname ( opcode imm opcode name ) ;
...
-
1 2 3 4 5 6 7 8
\ vim: sw=2 ts=2 sta et 256 CONSTANT jvm_opcode_count CREATE jvm_opcode_table jvm_opcode_count cells allot : ^> ( opcode imm mnemonic len -- opcode imm opcode name ) 2over drop -rot ( opcode imm opcode mnemonic len ) nextname ( opcode imm opcode name ) ;
...
-
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> main() { int i,n; printf("enter the numbers:"); scanf("%d",&n); for(i=0;i<n;i++)
...
-
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
pbrain is a procedural dialect of brainfuck programming language which, well, supports procedures. commands ( and ) mark start an d end of new procedure, indexed by contents of current cell, and : calls procedure indexed by contents of current cell. created b y paul m. parks in 2004 and implemented "between the hours of 9: 45 PM and 6:15 AM, in a single session", it is supported by seve ral more interpreters and ides. the dialect is criticised for di sallowing the reader to figure out which procedure is being call ed from reading the code. if this is important (as if it is ever
...
-
1 2
: sq dup * ; 10 sq .
-
1 2 3 4 5 6 7 8
(define (margreteborg row col) (cond ((< row col) #f) ((or (= 0 col) (= row col)) 1) (else (+ (margreteborg (- row 1) col) (margreteborg (- row 1) (- col 1)))))) N (margreteborg 2 2)+(margreteborg 3 2)+(margreteborg 11 2) (margreteborg 6 3)+(margreteborg 3 2) .(margreteborg 12 5)- (margreteborg 5 3)
...
-
1
2 1 5 + * .
-
1
1 5 + .
-
1
1 5 +
-
1 2
: test words ; test
-
1 2
: test see words ; test
-
1 2
: test see words ; Test
-
1 2 3 4
3 4 + . . 4 .
-
1
3 4 + .
-
1
0><|=02|), )-(4|_||°7574|)7 |)32 3|\|61!5()-(3|\| 624|=5()-(4|=7 0><|=02|)5)-(!23 I33)-(32I33267 3!|\|!63 31!73|_||\|!\/325!7°A°73|\|. |_||\||) |)|_| 63)-(°O°257 4|_|()-( z|_| 3!|\|32 31!73 - |)3|\||\| |)|_| |<4|\||\|57 |)!353|\| 73><7 1353|\| |)32 !|\| 13375|°34|< 635()-(2!3I33|\| !57. \/\/45 ? |)|_| )-(457 \/02)-(32 |\|0()-( |\|!3 \/\/45 |)4\/0|\| 63)-(°O°27 ? 72°O°573 |)!()-( 35 63)-(7 \/!313|\| 50. 3|\|7\/\/3|)32 I3!57 |)|_| °U°I332 |)3|\| )-(!|\|7 )-(!32 )-(32 63|<0/\/\/\/\3|\| 0|)32 |)|_| \/\/4257 5()-(0|\| !/\/\/\/\32 3!|\| \/\/!553|\||)32. 3!|\|3213!, _|37z7 63)-(7 35 4I3 !|\| |)!3 |\|47|_|2. |)3|\| (4()-(3 5|_|()-(3|\|. |_||\||) |)3|\| |=!|\||)357 |)|_| )-(!32: |\|02|) \/!32 4()-(7 624|) |\||_|11 4()-(7 |°|_||\||<7 \/!32 5!3I33|\| |=°U°|\||= 057 |\||_|11 3!|\|5 53()-(5 624|) 3!|\|5 |=°U°|\||= |°|_||\||<7 |\||_|11 |\|3|_||\| |=°U°|\||= \/!31 5|°4ß |_||\||) 32|=016.
-
1
2 2 * .
-
1 2
: HELLO ( -- ) CR . 1 3 + ; HELLO <cr> HELLO
-
1 2
: HELLO ( -- ) CR .1 3 + ; HELLO <cr> HELLO
-
1 2
: HELLO ( -- ) CR ." Hello, world!" ; HELLO <cr> HELLO
-
1
1 2 + p
-
1
1 2 +


