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 merge_sort(arr,s): global cnt n = len(arr) if n <= 1: return arr mid=n/2 first_half = merge_sort(arr[0:mid],s) second_half = merge_sort(arr[mid:n],s) temp=merge(first_half,second_half,s)
...
-
1 2
import time print time.gmtime(0)
-
1 2
import time print gmtime(0)
-
1 2 3 4 5 6 7 8 9
t = input( ) # read string t = int( t ) # convert string to integer while t>0: t=t-1 a = raw_input() f=[] for i in range(255): f.append(0)
...
-
1 2 3 4 5 6 7 8 9
t = input( ) # read string t = int( t ) # convert string to integer while t>0: t=t-1 a = raw_input() f=[] for i in range(255): f.append(0)
...
-
1 2 3 4 5 6 7 8 9
t = input( ) # read string t = int( t ) # convert string to integer while t>0: t=t-1 a = raw_input() f=[] for i in range(255): f.append(0)
...
-
1 2 3 4
Print"hy dear how are you" x=5 y=6 x+5+y
-
1 2 3 4
a=['at','','','','ball','','','','car'] b=raw_input()#accept string to be found s=a.index(b) print s
-
1 2 3 4
a=['at','','','','ball','','','','car'] b=raw_input()#accept string to be found s=a.index(b) print s
-
1 2 3 4
a=['at','','','','ball','','','','car'] b=raw_input()#accept string to be found s=a.index(b) print s
-
1 2 3 4 5 6 7 8 9
from itertools import * r = 200 p = [1,2,5,10,20,50,100,200] n = 0 def t(s,pc): if pc>=len(p): return for i in count(0): l = s+i*p[pc]
...
-
1
print("123")
-
1 2 3 4
n = int(raw_input()) while n != 42: print n n = int(raw_input())
-
1 2 3 4 5 6 7 8 9
import json # Writing to the file somedict = {'word': 'definition'} f = open('somefile.json', 'w') json.dump(somedict, f) f.close() # and now let's read it from the file
...
-
1 2 3 4 5 6 7 8 9
t = input() def calc(a, m, i, j): if m[i][j] >= 0: return m[i][j] if i == j: m[i][j] = 0 else: for k in xrange(i, j):
...
-
1 2 3 4
a=['at','','','','ball','','','','car'] b=raw_input()#accept string to be found s=a.index(b) print s
-
1 2 3 4 5 6 7 8 9
# Made by disKret import sys from net.sf.l2j.gameserver.model.quest import State from net.sf.l2j.gameserver.model.quest import QuestState from net.sf.l2j.gameserver.model.quest.jython import QuestJython as JQuest qn = "247_PossessorOfAPreciousSoul_4" #NPC
...
-
1
vart = input("test")
-
1 2 3 4 5 6 7 8 9
import json somedict = {'word': 'definition'} with open('somefile.json', 'w') as f: json.dump(somedict, f) # and now let's read it from the file with open('somefile.json') as f:
...
-
1 2 3 4 5 6 7 8 9
import json somedict = {'word': 'definition'} with open('somefile.json', 'w') as f: json.dump(f, somedict) # and now let's read it from the file with open('somefile.json') as f:
...
-
1 2 3 4 5 6 7 8 9
def merge_sort(arr,s): global cnt n = len(arr) if n <= 1: return arr mid=n/2 first_half = merge_sort(arr[0:mid],s) second_half = merge_sort(arr[mid:n],s) temp=merge(first_half,second_half,s)
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { cout<<"HEY, you, I'm alive! Oh, and Hello World!\n"; cin.get(); }
-
1
import numpy
-
1 2 3 4 5 6 7 8 9
a=[1,5,6,8,10] b=len(a)*[None] k=int(raw_input()) #rotation factor b[:]=a[(k-1):] #print b b[len(b):]=a[0:len(a)-len(b)] #b is rotated array #print b s=int(raw_input())#element to find
...
-
1 2 3 4 5 6 7 8 9
a=[1,5,6,8,10] b=len(a)*[None] k=int(raw_input()) #rotation factor b[:]=a[(k-1):] #print b b[len(b):]=a[0:len(a)-len(b)] #b is rotated array #print b s=int(raw_input())#element to find
...
-
1 2 3 4 5 6 7 8 9
from collections import deque graph={'A':['B','C'],'B':['D','E'],'C':['F','G']} def bfs(graph,start): queue=deque(start) visited=[] last='' while(queue): u=queue.popleft()
...
-
1 2 3 4
n = int(raw_input()) while n != 42: print n n = int(raw_input())
-
1
print [x*x for x in range(0,9)]
-
1 2
Age = input("how old are you:") print "you are " + Age + " years old"
-
1 2 3 4 5 6 7 8 9
import math t=int(raw_input()) while(t): a=raw_input() n=len(a) freq=dict((u,0)for u in a) for u in a: freq[u]+=1 #print c
...


