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
...
-
1 2 3 4 5 6 7 8 9
qqq
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
noite.pl Kurs I - Podstawy środowiska Linux http://hotfile.com/dl/143826952/4e89fae/noite.pl_Kurs_I_-_Podstawy_rodowiska_Linux.zip.html http://extabit.com/file/28e98kdnxejil http://www.mediafire.com/?r4ejcya4urcc8fi http://depositfiles.com/files/nlkv6php2
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
<?xml version="1.0" ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"><head> <title>Geocache GC... Für Informatiker - 2</title> </head>
...
-
1 2 3 4 5 6
-
1 2 3 4 5 6 7 8 9
...
-
1
20 20 20 09 20 20 20 20 13 10 20 20 20 09 09 20 20 20 09 13 10 09 09 20 20 20 20 09 09 20 20 13 10 20 20 20 09 20 09 20 13 10 09 09 20 20 20 20 09 20 13 10 20 20 20 09 09 20 09 20 09 13 10 09 09 20 20 20 20 09 20 09 13 10 20 20 20 09 09 20 09 20 09 13 10 09 09 20 20 20 20 09 09 20 20 20 13 10 20 20 20 09 09 20 20 09 20 13 10 09 09 20 20 20 20 09 20 20 09 13 10 20 20 20 09 09 20 20 09 20 13 10 09 09 20 20 20 20 09 09 20 09 13 10 20 20 20 09 20 20 20 09 20 09 13 10 09 09 20 20 20 20 09 09 09 09 13 10 20 20 20 09 09 20 20 20 20 13 10 09 09 20 20 20 20 09 09 13 10 20 20 20 09 09 20 20 20 20 13 10 09 09 20 20 20 20 09 20 20 13 10 20 20 20 09 20 09 09 09 20 09 20 13 10 09 09 20 20 20 20 09 20 20 09 20 13 10 20 20 20 09 20 09 09 09 20 09 20 13 10 09 09 20 20 20 20 09 20 20 20 13 10 20 20 20 09 09 20 20 09 09 13 10 09 09 20 20 20 20 09 20 20 09 09 13 10 20 20 20 09 09 20 20 09 09 13 10 09 09 20 20 20 20 09 20 09 20 20 13 10 20 20 20 09 09 20 20 09 09 13 10 09 09 20 20 20 20 09 09 09 20 13 10 20 20 20 09 20 20 20 20 20 13 10 09 09 20 20 20 20 09 13 10 20 20 20 09 20 20 20 20 20 13 10 09 09 20 20 20 20 09 20 09 09 13 10 20 20 20 09 09 20 09 13 10 09 09 20 20 20 20 09 09 09 13 10 20 20 20 09 20 09 09 09 20 13 10 09 09 20 20 20 20 09 20 09 20 09 13 10 20 20 20 09 20 09 09 09 20 13 10 09 09 20 20 20 20 20 13 10 20 20 20 09 20 20 09 09 09 20 13 10 09 09 20 20 20 20 09 20 20 20 09 13 10 20 20 20 09 09 20 20 20 09 13 10 09 09 20 20 20 20 09 09 20 13 10 20 20 20 09 09 20 09 09 20 13 10 09 09 20 20 20 20 09 20 09 09 20 13 10 20 20 20 09 09 09 20 20 09 13 10 09 09 20 20 20 20 09 20 09 20 13 10 20 20 20 09 09 09 20 20 09 13 10 09 09 20 20 20 20 09 20 09 09 09 13 10 20 20 20 09 09 20 09 09 09 13 10 09 09 20 20 20 20 09 09 20 20 09 13 10 20 20 20 20 13 10 09 09 20 20 20 20 20 13 10 13 10 20 20 20 20 09 13 10 20 13 10 20 09 09 09 20 13 10 20 13 10 09 20 20 09 20 13 10 09 13 10 20 20 20 20 20 09 13 10 09 20 20 20 13 10 20 13 10 20 20 09 13 10 13 10 20 20 20 09 20 13 10 13 10 13 10 13 10
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
<?xml version="1.0" ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"><head> <title>Geocache GC... Für Informatiker - 2</title> </head>
...
-
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
...
-
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
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
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7
-
1 2 3 4
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...


