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
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
NR>1&&$0>0{x+=$0}END{print x}
-
1
NR>1&&$0>0{x+=$0}END{print x}
-
1
NR==1{y=$0}NR>1&&NR<=y&&$0>0{x+=$0}END{print x}
-
1
NR==1{y=$0}NR>1&&NR<=y&&$0>0{x+=$0}END{print x}
-
1
NR>1&&$0>=0{x+=$0}END{print x}
-
1
$0=2^gsub([LDFT],1)
-
1
$0=2^gsub(/[LDFT]/,1)
-
1
$0=2^gsub(/[LDFT]/,)
-
1
$0=2^gsub(/[LDFT]/)
-
1
$0=2^gsub(/[LDFT]/,1)/2
-
1
$0=2^split($0,a,[LDFT])/2
-
1
2^split($0,a,/[LDFT]/)/2
-
1
$0=2^split($0,a,/[LDFT]/)/2
-
1
$0=2^split($0,a,"[LDFT]")>0
-
1
$0=2^split($0,a,"[]LDFT")>0
-
1
($0=2^split($0,a,"[]LDFT")>0
-
1
{print 2^/LDFT//2}
-
1
BEGIN{FS="[LDFT]"}{print 2^NF/2}
-
1 2
BEGIN{FS="[LDFT]"} {print 2^NF/2}
-
1 2
{FS="[LDFT]"} {print 2^NF/2}
-
1
{FS="[LDFT]"}{print 2^NF/2}
-
1
{FS="[LDFT]";print 2^NF/2}
-
1 2
BEGIN{FS="[LDFT]"} {print 2^NF/2}
-
1 2
{FS="/[LDFT]/"} {print 2^NF/2}
-
1
BEGIN{FS="/[LDFT]/"}{print 2^NF/2}
-
1
BEGIN{FS="/[LDFT]/"}{print 2^NF/2}
-
1
/[LDFT]/{print 2^NF/2}
-
1
BEGIN{FS=/[LDFT]/}{print 2^NF/2}
-
1
BEGIN{FS=[LDFT]}{print 2^NF/2}


