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
$awk {n=0}/[DEFG]/ {++n}{print 2**n}
-
1 2 3 4 5
$ awk /[DEFG]/ { ++n } { print 2**n }
-
1 2
awk '/[DEFG]/ { ++n } { print 2**n } '
-
1 2 3 4 5
$ awk BEGIN { n=0 } /[DEFG]/ { ++n } { print 2**n } END {}
-
1 2 3 4 5
$ awk BEGIN { print "Analysis" } /foo/ { ++n } { print "\"foo\" appears", n, "times." } END {}
-
1 2 3 4 5
$ awk BEGIN { print "Analysis" } /foo/ { ++n } { print "\"foo\" appears", n, "times." } END
-
1 2 3 4
$ awk BEGIN { print "Analysis of \"foo\"" } /foo/ { ++n } END { print "\"foo\" appears", n, "times." }
-
1 2 3 4
$ awk BEGIN { print "Analysis of \"foo\"" } /foo/ { ++n } END { print "\"foo\" appears", n, "times." }'
-
1 2 3 4
$ awk ' > BEGIN { print "Analysis of \"foo\"" } > /foo/ { ++n } > END { print "\"foo\" appears", n, "times." }'
-
1
awk /[DFG]/ {$n++} {print n}
-
1
awk '/[DFG]/ {$n++} {print n}'
-
1 2 3 4 5 6 7 8 9
BEGIN { # interpreter constants: stdin = "-"; true = 1; false = 0; constant = "#"; # flags literal atoms alist = -10000; # head of bound variable list
...
-
1 2 3 4 5 6 7 8 9
BEGIN {FS=" "} { for (i=1;i<=NF;i++) {line[i]=$i} m1=0; m2=0 for (e in line) { if (m1 <= line[e]) { m1=line[e]; m1i=e } } for (e in line) { if (m2 <= line[e] && line[e]<m1 ) { m2=line[e]; m2i=e } } if (m1i<=m2i) { first=m1i-1;last=m2i+1 } else { first=m2i-1;last=m1i+1 }
...
-
1
BEGIN{b=5e5;q=708;for(i=2;i<q;++i)if(!f[i])for(m=int(b/i);m>=i;--m)f[m*i]=1}NR>1{for(o=i=2;$0-i>=i;++i)if(!f[i]&&!f[$0-i])o+=i;print o-2}
-
1
BEGIN{b=5e5;q=708;for(i=2;i<q;++i)if(!f[i])for(m=int(b/i);m>=i;--m)f[m*i]=1}NR>1{for(o=i=2;$0-i>=i;++i)if(!f[i]&&!f[$0-i])o+=i;print o-2}
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2 3 4 5 6 7 8 9
begin 644 webutils_pl M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!" M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[ M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9! M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3 M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA> M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
...
-
1
MEszUmd0QyUyQklOQzkwTFhRc3RDMTBZRFF2dEdQMFlMUXZkQyUyQkxDRFF2ZEMlMkJJTkdQSU5DJTJGMEw0ZzBZTFF0ZEN4MExVZzBZSFF1dEdEMFlmUXNOR09MaTR1
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2 3 4 5 6
if [ 1 -eq 0 ] then echo succ else echo faile fi
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2 3 4 5 6 7 8
n-->0 && !/^ \\_/{ n=0 print "error:" NR } /^\\_/{ n=2 }
...
-
1 2 3 4 5 6 7 8
n-->0 && !/^ \\_/{ n=0 print "error:" NR } /^\\_/{ n=2 }
...
-
1 2 3 4 5 6 7 8 9
n--==1 && !/^ \\_/{ print "error:" NR-2 } /^\\_/{ n=2 } END{
...
-
1 2 3 4 5 6 7 8
n--==1 && !/^ \\_/{ n=0 print "error:" NR } /^\\_/{ n=2 }
-
1 2 3 4 5 6 7 8
n-->0 && !/^ \\_/{ n=0 print "error:" NF } /^\\_/{ n=2 }
-
1 2 3 4 5 6 7
n-->0 && !/^ \\_/{ print "error:" NF } /^\\_/{ n=2 }
-
1 2 3 4 5 6 7
n-->0 && !/^ \_/{ print "error:" NF } /^\_/{ n=2 }
-
1 2 3 4 5 6 7 8 9
BEGIN { num_missing_logical_paths=0 } (/^\\_/) { for(i=0;i<2;i++) { getline if ($0 !~ /^ \\_/) { print "Missing logical path on line " NR num_missing_logical_paths++
...


