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
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') do i=i+1 end i=0 digits=i j=digits-1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') do i=i+1 end digits=i j=digits-1 flag=1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') do i=i+1 end digits=i j=digits-1 flag=1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') do i=i+1 end digits=i j=digits-1 flag=1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') do i=i+1 end digits=i j=digits-1 flag=1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0'){ i=i+1 } digits=i j=digits-1 flag=1
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') i=i+1 digits=i j=digits-1 flag=1 while(i<j)
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') i=i+1 digits=i j=digits-1 flag=1 while(i<j)
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') i=i+1 digits=i j=digits-1 flag=1 while(i<j):
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0'): i=i+1 digits=i j=digits-1 flag=1 while(i<j):
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0') i=i+1 digits=i j=digits-1 flag=1 while(i<j)
...
-
1 2 3 4 5 6 7 8 9
a="malayalam\0" i=0 digits=0 while(a[i]!='\0'): i=i+1 digits=i j=digits-1 flag=1 while(i<j):
...
-
1 2 3 4 5 6 7 8 9
#!/usr/bin/ruby class Integer MAPPING = [" |\n |\n", " |/\n |\n", " |_\n |\n", " |\n |\\\n", " |\n/|\n", "_|\n |\n", "\\|\n |\n", "\\|/\n |\n", "\\|_\n |\n", "\\|\n |\\\n"] def to_pss
...
-
1 2
read a print a
-
1
times 5 puts "Hello"
-
1
5 times puts "Hello"
-
1
5.times puts "Hello"
-
1
times.5 puts "Hello"
-
1 2 3 4 5 6 7 8 9
def test_method foo = 123 bar = 'baz' @bob = :alice $binding = binding end test_method p(eval 'local_variables', $binding)
-
1
class Integer MAPPING = [" |\n |\n", " |/\n |\n", " |_\n |\n", " |\n |\\\n", " |\n/|\n", "_|\n |\n", "\\|\n |\n", "\\|/\n |\n", "\\|_\n |\n", "\\|\n |\\\n"] def to_pss (self % 1000).to_s.rjust(3, "0").chars.map(&:to_i).reverse.map { |n| MAPPING[n] }.join endendclass Symbol MAPPING = { :e => " |/\n |\n\\|\n |\n\\|\n |\n", :n => "_|/\n |\n\\|\n |\n |\n/|\n", :dot => " |\n/|\n |/\n |\n |/\n |\n" } def to_pss MAPPING[self] endendinput = nilbegin input = ARGF.read.gsub(/\s+/, "").bytes.to_a input = input.fill(1, input.length, 800 - input.length)rescue => e puts "no valid input given" puts "usage: #{__FILE__} input_file"end[[:n, input[170] - input[261], input[38] - input[399], :dot, ((input[185] * input[223]) % 1000) + (input[446] / 10) + 2].map(&:to_pss), [:e, input[212] - input[266], input[661] - input[781], :dot, (((input[60] + input[66]) * input[195]) % 1000) + input[159]].map(&:to_pss)].each do |coord| puts coord.join("\n") putsend
-
1
#!/usr/bin/rubyclass Integer MAPPING = [" |\n |\n", " |/\n |\n", " |_\n |\n", " |\n |\\\n", " |\n/|\n", "_|\n |\n", "\\|\n |\n", "\\|/\n |\n", "\\|_\n |\n", "\\|\n |\\\n"] def to_pss (self % 1000).to_s.rjust(3, "0").chars.map(&:to_i).reverse.map { |n| MAPPING[n] }.join endendclass Symbol MAPPING = { :e => " |/\n |\n\\|\n |\n\\|\n |\n", :n => "_|/\n |\n\\|\n |\n |\n/|\n", :dot => " |\n/|\n |/\n |\n |/\n |\n" } def to_pss MAPPING[self] endendinput = nilbegin input = ARGF.read.gsub(/\s+/, "").bytes.to_a input = input.fill(1, input.length, 800 - input.length)rescue => e puts "no valid input given" puts "usage: #{__FILE__} input_file"end[[:n, input[170] - input[261], input[38] - input[399], :dot, ((input[185] * input[223]) % 1000) + (input[446] / 10) + 2].map(&:to_pss), [:e, input[212] - input[266], input[661] - input[781], :dot, (((input[60] + input[66]) * input[195]) % 1000) + input[159]].map(&:to_pss)].each do |coord| puts coord.join("\n") putsend
-
1
#!/usr/bin/rubyclass Integer MAPPING = [" |\n |\n", " |/\n |\n", " |_\n |\n", " |\n |\\\n", " |\n/|\n", "_|\n |\n", "\\|\n |\n", "\\|/\n |\n", "\\|_\n |\n", "\\|\n |\\\n"] def to_pss (self % 1000).to_s.rjust(3, "0").chars.map(&:to_i).reverse.map { |n| MAPPING[n] }.join endendclass Symbol MAPPING = { :e => " |/\n |\n\\|\n |\n\\|\n |\n", :n => "_|/\n |\n\\|\n |\n |\n/|\n", :dot => " |\n/|\n |/\n |\n |/\n |\n" } def to_pss MAPPING[self] endendinput = nilbegin input = ARGF.read.gsub(/\s+/, "").bytes.to_a input = input.fill(1, input.length, 800 - input.length)rescue => e puts "no valid input given" puts "usage: #{__FILE__} input_file"end[[:n, input[170] - input[261], input[38] - input[399], :dot, ((input[185] * input[223]) % 1000) + (input[446] / 10) + 2].map(&:to_pss), [:e, input[212] - input[266], input[661] - input[781], :dot, (((input[60] + input[66]) * input[195]) % 1000) + input[159]].map(&:to_pss)].each do |coord| puts coord.join("\n") putsend
-
1 2 3 4 5 6 7 8 9
class Array def pascal pairs = each_cons(2) Array.new(self.size - 1) { pairs.next.inject(:+) }. unshift(self.first). push(self.last) end def pascal!
...
-
1 2 3 4 5 6 7 8 9
module Enumerable def pascal pairs = each_cons(2) Array.new(self.size - 1) { pairs.next.inject(:+) }. push(1). unshift(1) end def pascal!
...
-
1 2 3 4 5 6 7 8 9
module Enumerable def pascal pairs = each_cons(2) Array.new(self.size - 1) { pairs.next.inject(:+) }. push(1). unshift(1) end def pascal!
...
-
1
puts RUBY_VERSION
-
1
print "Kode Multus"
-
1
print "Kode Multus"
-
1 2 3 4 5 6 7 8 9
def choose(m) self.factorial / (m.factorial * (self - m).factorial) end def fact (n) if n < 2 return 1 end (2..n).inject(1) { |f, n| f * n }
...
-
1 2 3 4 5 6 7 8 9
def choose(m) self.factorial / (m.factorial * (self - m).factorial) end def fact (n) if n < 2 return 1 end (2..n).inject(1) { |f, n| f * n }
...


