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
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print("A") binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): if binary[i] != 0: print(A) binary[i]=0 print(binary)
...
-
1 2 3 4 5 6 7 8 9
def Piano(n,w): global binary if w == 0: for i in xrange(0,n): binary[i]=0 print(binary) elif w == n: for i in xrange(0,n):
...
-
1 2
s = raw_input("Your name: ") print "Hello ",s,"! From Android!"
-
1 2
s = raw_input("Your name: ") print "Hello World! From Android!", s
-
1 2
s = raw_input("Your name: ") print "Hello World! From Android!", s
-
1 2
while True: print "kurwa"
-
1 2 3 4 5 6 7 8 9
#! /usr/bin/python def reverse(st): newString = '' for z in range(0,len(st)): newString += st[0-z] return newString
...
-
1 2 3 4 5 6 7 8 9
#! /usr/bin/python def reverse(st): newString = '' for z in range(0,len(st)): newString += st[0-z] return newString
...
-
1 2 3 4 5 6 7 8 9
import base64 # Het is leuker dan het lijkt, want er staan 'maar' 8 berichten op het forum. # We hebben het wachtwoord geanalyseerd kunnen opvragen via not-so-bruteforce.py # Toepassen is verder triviaal, per bericht gaat de bit omhoog, maar is niet # afhankelijk van de rest van de berichten. def decrypt(msg, password, bit): result = ''
...
-
1 2 3 4 5 6 7 8 9
import base64 # Het is leuker dan het lijkt, want er staan 'maar' 8 berichten op het forum. # We hebben het wachtwoord geanalyseerd kunnen opvragen via not-so-bruteforce.py # Toepassen is verder triviaal, per bericht gaat de bit omhoog, maar is niet # afhankelijk van de rest van de berichten. def decrypt(msg, password, bit): result = ''
...
-
1 2 3 4 5 6 7 8 9
def fib_rec ( a, b, p, q, num ): if ( num == 0 ): return b if ( num % 2 == 0 ): return fib_rec(a, b, p*p+q*q, 2*p*q+q*q, num/2) return fib_rec(b*q+a*q+a*p, b*p+a*q, p, q, num-1) def power_fib ( N,M ): # write your code here
...
-
1 2
a = 6678577788.222 print a
-
1 2
a = 123.222 print a
-
1 2 3
k = 1 s = 2 k + s
-
1 2 3 4 5 6 7 8 9
class LOLERROR(Exception): pass def retry(tries, delay=3, backoff=2): def _retry(f): def f_retry(*args, **kwargs): last_exception = None for attempt in range(1, tries + 1): try:
...
-
1 2 3 4 5 6 7 8 9
import random def runner(job, maxtry=4): for x in range(maxtry): try: job() except Exception,e: print(x, e) else:
...
-
1 2 3 4 5 6 7 8 9
import math def meteor(n): pi = math.pi ro = 1.2 t = 0 v = 0 r = .01 x = 1 g = 9.8
...
-
1 2 3 4 5 6 7 8 9
import math def meteor(n): pi = math.pi ro = 1.2 t = 0 v = 0 r = .01 x = 1 g = 9.8
...


