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
BEGIN{c=split($_,s);print c; for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; print k; while(++x<=k) {print a;t=a;a=a+b;b=t} } exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s);print s; for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; print k; while(++x<=k) {print a;t=a;a=a+b;b=t} } exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s);print c; for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; print k; while(++x<=k) {print a;t=a;a=a+b;b=t} } exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {print a;t=a;a=a+b;b=t} } exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print a;} exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print a;} exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print; t;} exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n=1;n<=c;++n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print; t;} exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n = 1; n <= c; + + n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print t}; exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n = 1; n <= c; + + n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print t}; exit}
-
1 2 3 4 5 6 7
BEGIN{c=split($0,s); for (n = 1; n <= c; + + n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print t}; exit}
-
1 2 3 4 5 6 7
awk BEGIN{c=split($0,s); for (n = 1; n <= c; + + n) {k=split($0,s); a=1; b=1;x=2; while(++x<=k) {t=a;a=a+b;b=t} print t}; exit}
-
1 2 3 4 5 6 7
awk BEGIN{c=split($0,s); for (n = 1; n <= c; + + n) {k = split ($ 0, s); a = 1, b = 1,x=2; while (+ + x <= k) { t = a, a = a + b, b = t} print t}; exit}
-
1 2 3 4 5 6 7 8
awk BEGIN {c = split ($ 0, s); for (n = 1, n <= c; + + n) {k = split ($ 0, s); a = 1, b = 1,x=2; while (+ + x <= k) { t = a, a = a + b, b = t} print t}; exit}
-
1 2 3 4 5 6 7 8
awk 'BEGIN {c = split ($ 0, s); for (n = 1, n <= c; + + n) {k = split ($ 0, s); a = 1, b = 1,x=2; while (+ + x <= k) { t = a, a = a + b, b = t} print t}; exit}'
-
1 2
awk 'BEGIN {c = split ($ 0, s);for (n = 1, n <= c; + + n){k = split ($ 0, s) a = 1, b = 1; while (+ + x <= k) { t = a; a = a + b, b = t}print t}; exit}'
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1
zsbsff
-
1
zsbsff
-
1 2 3
FNR == NR && $0 ~ /^\[/ {object = substr( $0, 2, length($0) - 2 ); pos = 0; next} FNR == NR {arr_obj[object, $0] = ++pos; next} FNR < NR {ret = split( $0, obj, /\./ ); if ( ret != 2 ) {next} printf "%s.%d\n", obj[1], arr_obj[ obj[1] SUBSEP obj[2] ]}
-
1 2 3
FNR == NR && $0 ~ /^\[/ {object = substr( $0, 2, length($0) - 2 ); pos = 0; next} FNR == NR {arr_obj[object, $0] = ++pos; next} FNR < NR {ret = split( $0, obj, /\./ ) if ( ret != 2 ) {next} printf "%s.%d\n", obj[1], arr_obj[ obj[1] SUBSEP obj[2] ]}
-
1 2 3 4 5 6
begin 0666 restricted M2&4@9&EE9"!A="!T:&4@8V]N<V]L92P-"D]F(&AU;F=E<B!A;F0@=&AI<G-T M+@T*3F5X="!D87D@:&4@=V%S(&)U<FEE9"P-"D9A8V4@9&]W;BP@;FEN92UE *9&=E(&9I<G-T+GD@ ` end
-
1 2 3 4 5 6 7 8 9
//uva 294 #include <stdio.h> long long int divisor(long long int n) { long long int i,ans=1,count=1; while(n%2==0) { n/=2; count++;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct abc { char name[100]; int lowprize; int highprize ; } database[100001]; int main() {
...
-
1 2 3 4 5 6 7 8 9
{ arr[$1][$2]=$3 ; } END{ for ( i in arr ) { for ( j in arr ) { print i,j,arr[i][j]; } }
...
-
1
awk -F':' '{ print $1 }' /etc/passwd | sort
-
1
awk '{c=split($0, s); for( n=1; n<=c; ++n) print s[n] }' testfile
-
1 2 3 4 5 6 7 8 9
#!/usr/bin/awk -f # awk version of 99 bottles of beer # by Whitey (whitey@netcom.com) - 06/05/95 # updated to create correct text including the ending # by Osamu Aoki (osamu@debian.org) - 20007-11-04 BEGIN { for(i = 99; i >= 0; i--) { print ubottle(i), "on the wall,", lbottle(i) "."
...
-
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 3 4 5 6
begin 0666 restricted M2&4@9&EE9"!A="!T:&4@8V]N<V]L92P-"D]F(&AU;F=E<B!A;F0@=&AI<G-T M+@T*3F5X="!D87D@:&4@=V%S(&)U<FEE9"P-"D9A8V4@9&]W;BP@;FEN92UE *9&=E(&9I<G-T+GD@ ` end


