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
- Java7
- 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
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *prev, *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; struct list *append(struct list **l1, int k)
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int i=1; printf("%d\t%d\t%d\t%d\n", ++i, ++i, ++i, ++i ); return 0;
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; void append(struct list **l1, struct list l2)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; void append(struct list *l1, struct list l2)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> struct list { int key; struct list *next; }; void append(struct list *l1, struct list l2)
...
-
1 2 3 4 5 6 7 8 9
struct list { int key; struct list *next; }; void append(struct list *l1, struct l2) { l1 = malloc(sizeof *l1); *l1 = l2;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <fenv.h> //#pragma STDC FENV_ACCESS ON int main(void) { int i; for(i=3; i>0; i -= 0.5 ) printf("%d\n", i); // store the original rounding mode
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <fenv.h> #pragma STDC FENV_ACCESS ON int main(void) { int i; for(i=3; i>0; i -= 0.5 ) printf("%d\n", i); // store the original rounding mode
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int pushData(char **strAlpha) { size_t i; *strAlpha = malloc(10); for (i = 0; i < 10; ++i) {
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int pushData(char **strAlpha) { size_t i; *strAlpha = malloc(10); for (i = 0; i < 10; ++i) {
...


