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
abc() { local -a R local n case $# in 1) n=1 ;; 2) n=$2 ;; *) echo "NIE TAK" >&2 exit 2;;
...
-
1 2 3 4 5 6 7 8 9
abc() { local -a R local n case $# in 1) n=1 ;; 2) n=$2 ;; *) echo "NIE TAK" >&2 exit 2;;
...
-
1 2 3 4 5
/a+b+/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } /^[ab]/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } /b*c+/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } !/d/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } END { for (i in t) { print i, t[i]; } }
-
1 2 3 4 5
/a+b+/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } /^[ab]/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } /b*c+/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } !/d/ { a = $NF + $(NF - 1); t[$(NF - 2)] += a; } END { for (i in t) { print i, t[i]; } }
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { int intNum = 0; cin >> intNum; while (intNum != 42) {
...
-
1
echo $SHELL
-
1
echo $SHELL
-
1
echo $SHELL
-
1
echo $SHELL
-
1 2 3 4 5 6 7
#include <iostream> int main() { int* vl_p = 0; *vl_p = 5; std::cout<<*vl_p; }
-
1 2
\p 0 +/0.0$',/'$q@&{~+/(10_sv'x(1+!7)+\:!3)!'2 3 5 7 11 13 17}'q:{:[1<x;,/(>:'(x,x)#1,x#0)[;0,'1+_f x-1];(1,x)#!x]}10
-
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 { } { } END {
...
-
1 2 3 4 5 6 7 8 9
BEGIN { print "begin" } { print "middle ", $1 } END {
...
-
1 2 3 4 5 6 7 8 9
BEGIN { } { } END {
...
-
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
#include <iostream> using namespace std; int main(){ cout << "Witaj wykopowiczu ! ;)" << endl; return 0; }
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <cstdlib> #include <algorithm> #include<stdio.h> using namespace std ; int main(int argc, char *argv[]) { for(;;)
...
-
1
product direct projected relates group pollution
-
1
sea http://www.psc.state.nd.us imposed http://www.companiesinc.com
-
1
results [url=http://www.unicef.org]cosmic cupcake pattern methane back[/url] [url=http://www.kcl.ac.uk]positive depletion[/url]
-
1
<a href="http://www.archive.org">decline case</a> disease emissions <a href="http://doi.wiley.com">ago estimate microsoft capacity retrieved</a> <a href="http://www.cdc.gov">security microblogging century brightness</a>
-
1
global frozen beginning kyoto population
-
1 2 3 4 5 6 7 8 9
<?php ob_start(); session_start(); if (!isset($_SESSION['admin'])){ echo "<script type='text/javascript'> alert('Utilizador não realizou o login!')</script>"; echo "<script type='text/javascript'> window.location='index.php'</script>"; }elseif ($_SESSION['admin']==0){ echo "<script type='text/javascript'> alert('Utilizador não tem premissões para aceder a esta página!')</script>"; echo "<script type='text/javascript'> window.location='index.php'</script>";
...
-
1
{ print $1 }
-
1 2 3
BEGIN { FS = ":" } { print $0 }
-
1 2 3 4 5 6 7 8 9
create or replace function cubo(valor number) return number is v_valor number; begin select valor*valor*valor into v_valor from dual; return(v_valor); end;
...
-
1 2 3 4 5 6 7
#include <iostream> using namespace std; int main(){ cout << "Witaj wykopowiczu ! ;)" << endl; return 0; }
-
1 2 3 4 5 6
#include <stdio.h> int main() { printf("Test"); return 0; }
-
1
{ print $1 }


