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
num = 0 for i in range(1,100+1): num+=i**i print num
-
1
print sum(pow(range(0,101),2))
-
1
print sum(range(0,101))
-
1 2 3
num=0 num=sum(range(0,101)) print num
-
1 2 3
num=0 num=sum(i in range(0,101)) print num
-
1 2 3
num=0 num=sum(for i in range(0,101)) print num
-
1 2 3 4 5 6 7 8 9
def fib(n): a=1.0 b=0.0 c=0.0 for i in range(0,n+1): c=b b+=a a=c return b/n
-
1 2 3 4 5 6 7 8 9
def fib(n): a=1.0 b=0.0 c=0.0 for i in range(0,n+1): c=b b+=a a=c return b/n
-
1 2 3 4 5 6 7 8 9
def fib(n): a=1.0 b=0.0 c=0.0 for i in range(0,n+1): c=b b+=a a=c return b/n
-
1 2 3 4 5 6 7 8 9
def fib(10): a=1.0 b=0.0 c=0.0 for i in range(0,n+1): c=b b+=a a=c return b/n
-
1 2 3 4 5 6 7 8 9
def fib(n): a=1.0 b=0.0 c=1.0 for i in range(0,n+1): print b c=b b+=a a=c
...
-
1 2 3 4 5 6 7 8 9
def fib(n): a=0.0 b=0.0 c=1.0 for i in range(0,n+1): print b c+=a b+=c a=c
...
-
1 2 3 4 5 6 7 8 9
def fib(n): a=0.0 b=0.0 c=1.0 for i in range(0,n+1): print b b=a+c a=c c=b+a
...
-
1
print "hello"
-
1 2 3 4 5 6 7 8 9
def fib(n): a=0.0 b=0.0 c=1.0 for i in range(0,n+1): print b b=b+c a=c c=b
...
-
1
print "hell"
-
1 2 3 4 5
def func(a): return a - 1 while 1==1: print func(3)
-
1 2 3 4 5
def func(a): return a - 1 while 1==1: print a(3)
-
1 2 3 4 5 6 7 8
def maxx(subs): al = {} for sub in subs: for s in sub: if not al.has_key(s): al[s] = 1 else: al[s] += 1 maxx = max(al.values()) return filter(lambda item: item[1] == maxx and len(item[0]) > 1, al.iteritems())
...
-
1 2 3 4 5 6 7 8
def maxx(subs): al = {} for sub in subs: for s in sub: if not al.has_key(s): al[s] = 1 else: al[s] += 1 maxx = max(al.values()) return filter(lambda item: item[1] == maxx and len(item[0]) > 1, al.iteritems())
...
-
1 2 3 4 5 6 7 8 9
def maxx(subs): maxx, al = 0, [] for sub in subs: for s in sub: if not al.count([s, 1]): al.append([s, 1]) else: i = al.index([s, 1]) c = al[i]
...
-
1 2 3 4 5 6 7 8
def maxx(subs): al = {} for sub in subs: for s in sub: if not al.has_key(s): al[s] = 1 else: al[s] += 1 maxx = max(al.values()) return filter(lambda item: item[1] == maxx and len(item[0]) > 1, al.iteritems())
...
-
1 2 3 4 5 6 7 8
def maxx(subs): al = {} for sub in subs: for s in sub: if not al.has_key(s): al[s] = 1 else: al[s] += 1 maxx = max(al.values()) return filter(lambda item: item[1] == maxx and len(item[0]) > 1, al.iteritems())
...
-
1 2 3 4 5 6 7 8
def maxx(subs): al = {} for sub in subs: for s in sub: if not al.has_key(s): al[s] = 1 else: al[s] += 1 maxx = max(al.values()) return filter(lambda item: item[1] == maxx, al.iteritems())
...
-
1 2 3
s = "we are testing this test so be sure to test it" t = "test" s.find(t,5);
-
1 2 3 4 5 6 7 8 9
import sys def fib(n): if (n < 2): return n else: return fib(n - 1) + fib(n - 2) def main():
...
-
1 2 3 4 5 6 7 8 9
import sys def fib(n): if n < 2: return n else: return fib(n - 1) + fib(n - 2) def main():
...
-
1 2 3 4 5 6 7 8 9
def maxx(subs): maxx, al = 0, [] for sub in subs: for s in sub: if not al.count([s, 1]): al.append([s, 1]) else: i = al.index([s, 1]) c = al[i]
...
-
1 2 3 4 5 6 7 8 9
def maxx(subs): maxx, al = 0, [] for sub in subs: for s in sub: if not al.count([s, 1]): al.append([s, 1]) else: i = al.index([s, 1]) c = al[i]
...
-
1 2 3 4 5 6 7 8 9
def maxx(subs): maxx, al = 0, [] for sub in subs: for s in sub: if not al.count([s, 1]): al.append([s, 1]) else: i = al.index([s, 1]) c = al[i]
...


