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
class Mine end
-
1
puts 277 - 375 + 39 - 299 + 401 - 122 + 533 - 394 + 285 - 375 + 31 - 332 + 35 - 14 + 230 - 238 + 584 - 395
-
1
puts 645 * 515 + 277 - 375 + 39 - 299 + 401 - 122 + 533 - 394 + 285 - 375 + 31 - 332 + 35 - 14 + 230 - 238 + 584 - 395
-
1
while (s=gets.chomp()) != "42" do puts s end
-
1 2 3 4 5 6 7 8 9
localvar = "hello" $globalvar = "goodbye" def amethod localvar = 10 puts( localvar ) puts( $globalvar ) end def
...
-
1 2 3 4
array = [1,2,3,4,5] array[2].erase p array
-
1 2 3 4 5 6 7 8 9
a=[[[3,1],[5,1],[821,1],[273997,1],[7741805910970258163,1]],[[2,2],[107,1],[244219007447,1],[95966808334871,1]],[[2,2],[7,3],[919,1],[56951,1],[103160249,1],[4656410419,1]],[[2,3],[17,1],[177693403,1],[414883089729841223,1]],[[3,1],[31,1],[4951,1],[1346989159,1],[50461897989311,1]],[[7,2],[79,1],[241,1],[4271,1],[48523,1],[1051181,1],[176838479,1]],[[2,1],[1475709031,1],[12177009148932085937,1]],[[6323573,1],[4753519027288416018457,1]],[[2,1],[18164960872674393974925145111,1]]] a.length.times do |i| n=1 (a[i].length).times do |j| n*=a[i][j][0]**a[i][j][1] end s=""; (Math.log(n)/Math.log(256)).ceil.times do s=(n%256).chr+s
...
-
1 2 3
a = 11 b = 12 puts a > b ? a : a == b ? 'equal' : b
-
1 2 3
a = 11 b = 12 a > b ? p(a) : a == b ? p('equal') : p(b)
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f[ar.last] } ar = ar.map { |e| e / m.to_f } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1)
...
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f[ar.last] } ar = ar.map { |e| e / m.to_f } p ar
...
-
1 2 3 4 5 6 7 8 9
ones = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine'] tens = ['ten', 'twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety'] teens = ['eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen', 'sixteen', 'seventeen', 'eighteen', 'nineteen'] words = ['hundred', 'thousand', 'million']; single = []; final = []; number = gets.chomp.to_i divisor = 1; count = 0 while number/divisor != 0 divisor = divisor*10 count = count + 1
...
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f[ar.last] } p ar m = ar.inject(0, :+) / n.to_f
...
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f[ar.last] } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1) [m, d]
...
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f(ar.last) } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1) [m, d]
...
-
1 2 3 4 5 6 7 8 9
def count(beta, m, a0, n) f = lambda { |x| (beta * x) % m } ar = [a0] (n - 1).times { ar << f(ar.last) } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1) [m, d]
...
-
1 2 3 4 5 6 7 8
def count(n) ar = (1..n).map { rand } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1) [m, d] end m, d = count(gets.to_i)
...
-
1 2 3 4 5 6 7 8
def count(n) ar = (1..n).map { rand } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |r, e| r + (e - m) ** 2 } / (n - 1) [m, d] end m, d = count(gets.to_i)
...
-
1 2 3 4 5 6 7 8
def count(n) ar = (1..n).map { rand } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |e| (e - m) ** 2 } / (n - 1) [m, d] end m, d = count(gets.to_i)
...
-
1 2 3 4 5 6 7 8
def count(n) ar = (1..n).map { rand } m = ar.inject(0, :+) / n.to_f d = ar.inject(0) { |e| (e - m) ** 2 } / (n - 1) [m, d] end m, d = count(gets.to_i)
...
-
1
puts "http://tryruby.org/levels/1/challenges/0".reverse
-
1
"http://tryruby.org/levels/1/challenges/0".reverse
-
1 2 3 4 5 6 7 8
)n = gets.to_i a = (1..n).map { rand } m = a.inject(0, :+) / a.size.to_f d = (a.inject(0) { |e| (e - m) ** 2 }) / (n - 1).to_f puts "median: #{m}" puts "dispersion: #{d}"
-
1 2 3 4 5 6 7 8
)n = gets.to_i a = (1..n).map { rand } m = a.inject(0, :+) / a.size.to_f d = a.inject(0) { |e| (e - m) ** 2 } / (n - 1).to_f puts "median: #{m}" puts "dispersion: #{d}"
-
1 2 3 4 5 6 7 8
n = gets.to_i a = (1..n).map { rand } m = a.inject(0, :+) / a.size.to_f d = a.inject(0) { |e| (e - a) ** 2 } / (n - 1) puts "median: #{m}" puts "dispersion: #{d}"
-
1 2 3 4 5 6 7 8
n = gets.to_i a = (1..n).map { rand } m = a.inject(0, :+) / a.size.to_f d = a.inject(0) { |e| (e - a) ** 2 } / (n - 1) puts "median: #{m}" puts "dispersion: #{d}"
-
1 2 3 4
n = gets.to_i a = (1..n).map { rand } puts "median: #{a.inject(0, :+)}"
-
1 2 3 4
n = gets.to_i a = (1..n).map { rand } puts "median: #{a.inject(0, :+)}"
-
1 2 3
n = gets.to_i a = (1..n).map { rand } p a
-
1 2 3
n = gets.to_i a = (1..n).map { rand } p a


