0
@@ -1,15 +1,15 @@
0
-def ack(m, n)
0
-  if m == 0 then
0
-    n + 1
0
-  elsif n == 0 then
0
-    ack(m - 1, 1)
0
-  else
0
-    ack(m - 1, ack(m, n - 1))
0
-  end
0
-end
0
-
0
-def the_answer_to_life_the_universe_and_everything
0
-  (ack(3,7).to_s.split(//).inject(0){|s,x| s+x.to_i}.to_s + "2" ).to_i
0
-end
0
-
0
-answer = the_answer_to_life_the_universe_and_everything
0
+def ack(m, n)
0
+  if m == 0 then
0
+    n + 1
0
+  elsif n == 0 then
0
+    ack(m - 1, 1)
0
+  else
0
+    ack(m - 1, ack(m, n - 1))
0
+  end
0
+end
0
+
0
+def the_answer_to_life_the_universe_and_everything
0
+  (ack(3,7).to_s.split(//).inject(0){|s,x| s+x.to_i}.to_s + "2" ).to_i
0
+end
0
+
0
+answer = the_answer_to_life_the_universe_and_everything

0
@@ -1,11 +1,11 @@
0
-def fact(n)
0
-  if(n > 1)
0
-    n * fact(n-1)
0
-  else
0
-    1
0
-  end
0
-end
0
-
0
-8.times{
0
-  fact(5000)
0
+def fact(n)
0
+  if(n > 1)
0
+    n * fact(n-1)
0
+  else
0
+    1
0
+  end
0
+end
0
+
0
+8.times{
0
+  fact(5000)
0
 }
0
\ No newline at end of file

0
@@ -1,10 +1,10 @@
0
-def fib n
0
-  if n < 3
0
-    1
0
-  else
0
-    fib(n-1) + fib(n-2)
0
-  end
0
-end
0
-
0
-fib(34)
0
-
0
+def fib n
0
+  if n < 3
0
+    1
0
+  else
0
+    fib(n-1) + fib(n-2)
0
+  end
0
+end
0
+
0
+fib(34)
0
+

0
@@ -1,23 +1,23 @@
0
-require 'complex'
0
-
0
-def mandelbrot? z
0
-  i = 0
0
-  while i<100
0
-    i+=1
0
-    z = z * z
0
-    return false if z.abs > 2
0
-  end
0
-  true
0
-end
0
-
0
-ary = []
0
-
0
-(0..100).each{|dx|
0
-  (0..100).each{|dy|
0
-    x = dx / 50.0
0
-    y = dy / 50.0
0
-    c = Complex(x, y)
0
-    ary << c if mandelbrot?(c)
0
-  }
0
-}
0
-
0
+require 'complex'
0
+
0
+def mandelbrot? z
0
+  i = 0
0
+  while i<100
0
+    i+=1
0
+    z = z * z
0
+    return false if z.abs > 2
0
+  end
0
+  true
0
+end
0
+
0
+ary = []
0
+
0
+(0..100).each{|dx|
0
+  (0..100).each{|dy|
0
+    x = dx / 50.0
0
+    y = dy / 50.0
0
+    c = Complex(x, y)
0
+    ary << c if mandelbrot?(c)
0
+  }
0
+}
0
+

0
@@ -1,259 +1,259 @@
0
-#!/usr/local/bin/ruby
0
-# This program is contributed by Shin Nishiyama
0
-
0
-
0
-# modified by K.Sasada
0
-
0
-NP = 5
0
-ROW = 8 + NP
0
-COL = 8
0
-
0
-$p = []
0
-$b = []
0
-$no = 0
0
-
0
-def piece(n, a, nb)
0
-  nb.each{|x|
0
-    a[n] = x
0
-    if n == NP-1
0
-      $p << [a.sort]
0
-    else
0
-      nbc=nb.dup
0
-      [-ROW, -1, 1, ROW].each{|d|
0
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
0
-          nbc << x+d
0
-        end
0
-      }
0
-      nbc.delete x
0
-      piece(n+1,a[0..n],nbc)
0
-    end
0
-  }
0
-end
0
-
0
-def kikaku(a)
0
-  a.collect {|x| x - a[0]}
0
-end
0
-def ud(a)
0
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
0
-end
0
-def rl(a)
0
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
0
-end
0
-def xy(a)
0
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
0
-end
0
-
0
-def mkpieces
0
-  piece(0,[],[0])
0
-  $p.each do |a|
0
-    a0 = a[0]
0
-    a[1] = ud(a0)
0
-    a[2] = rl(a0)
0
-    a[3] = ud(rl(a0))
0
-    a[4] = xy(a0)
0
-    a[5] = ud(xy(a0))
0
-    a[6] = rl(xy(a0))
0
-    a[7] = ud(rl(xy(a0)))
0
-    a.sort!
0
-    a.uniq!
0
-  end
0
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
0
-end
0
-
0
-def mkboard
0
-  (0...ROW*COL).each{|i|
0
-    if i % ROW >= ROW-NP
0
-      $b[i] = -2
0
-    else
0
-      $b[i] = -1
0
-    end
0
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
0
-  }
0
-end
0
-
0
-def pboard
0
-  return # skip print
0
-  print "No. #$no\n"
0
-  (0...COL).each{|i|
0
-    print "|"
0
-    (0...ROW-NP).each{|j|
0
-      x = $b[i*ROW+j]
0
-      if x < 0
0
-        print "..|"
0
-      else
0
-        printf "%2d|",x+1
0
-      end
0
-    }
0
-    print "\n"
0
-  }
0
-  print "\n"
0
-end
0
-
0
-$pnum=[]
0
-def setpiece(a,pos)
0
-  if a.length == $p.length then
0
-    $no += 1
0
-    pboard
0
-    return
0
-  end
0
-  while $b[pos] != -1
0
-    pos += 1
0
-  end
0
-  ($pnum - a).each do |i|
0
-    $p[i].each do |x|
0
-      f = 0
0
-      x.each{|s|
0
-        if $b[pos+s] != -1
0
-          f=1
0
-          break
0
-        end
0
-      }
0
-      if f == 0 then
0
-        x.each{|s|
0
-          $b[pos+s] = i
0
-        }
0
-        a << i
0
-        setpiece(a.dup, pos)
0
-        a.pop
0
-        x.each{|s|
0
-          $b[pos+s] = -1
0
-        }
0
-      end
0
-    end
0
-  end
0
-end
0
-
0
-mkpieces
0
-mkboard
0
-$p[4] = [$p[4][0]]
0
-$pnum = (0...$p.length).to_a
0
-setpiece([],0)
0
-
0
-
0
-__END__
0
-
0
-# original
0
-
0
-NP = 5
0
-ROW = 8 + NP
0
-COL = 8
0
-
0
-$p = []
0
-$b = []
0
-$no = 0
0
-
0
-def piece(n,a,nb)
0
-  for x in nb
0
-    a[n] = x
0
-    if n == NP-1
0
-      $p << [a.sort]
0
-    else
0
-      nbc=nb.dup
0
-      for d in [-ROW, -1, 1, ROW]
0
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
0
-          nbc << x+d
0
-        end
0
-      end
0
-      nbc.delete x
0
-      piece(n+1,a[0..n],nbc)
0
-    end
0
-  end
0
-end
0
-
0
-def kikaku(a)
0
-  a.collect {|x| x - a[0]}
0
-end
0
-def ud(a)
0
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
0
-end
0
-def rl(a)
0
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
0
-end
0
-def xy(a)
0
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
0
-end
0
-
0
-def mkpieces
0
-  piece(0,[],[0])
0
-  $p.each do |a|
0
-    a0 = a[0]
0
-    a[1] = ud(a0)
0
-    a[2] = rl(a0)
0
-    a[3] = ud(rl(a0))
0
-    a[4] = xy(a0)
0
-    a[5] = ud(xy(a0))
0
-    a[6] = rl(xy(a0))
0
-    a[7] = ud(rl(xy(a0)))
0
-    a.sort!
0
-    a.uniq!
0
-  end
0
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
0
-end
0
-
0
-def mkboard
0
-  for i in 0...ROW*COL
0
-    if i % ROW >= ROW-NP
0
-      $b[i] = -2
0
-    else
0
-      $b[i] = -1
0
-    end
0
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
0
-  end
0
-end
0
-
0
-def pboard
0
-  print "No. #$no\n"
0
-  for i in 0...COL
0
-    print "|"
0
-    for j in 0...ROW-NP
0
-      x = $b[i*ROW+j]
0
-      if x < 0
0
-        print "..|"
0
-      else
0
-        printf "%2d|",x+1
0
-      end
0
-    end
0
-    print "\n"
0
-  end
0
-  print "\n"
0
-end
0
-
0
-$pnum=[]
0
-def setpiece(a,pos)
0
-  if a.length == $p.length then
0
-    $no += 1
0
-    pboard
0
-    return
0
-  end
0
-  while $b[pos] != -1
0
-    pos += 1
0
-  end
0
-  ($pnum - a).each do |i|
0
-    $p[i].each do |x|
0
-      f = 0
0
-      for s in x do
0
-        if $b[pos+s] != -1
0
-          f=1
0
-          break
0
-        end
0
-      end
0
-      if f == 0 then
0
-        for s in x do
0
-          $b[pos+s] = i
0
-        end
0
-        a << i
0
-        setpiece(a.dup, pos)
0
-        a.pop
0
-        for s in x do
0
-          $b[pos+s] = -1
0
-        end
0
-      end
0
-    end
0
-  end
0
-end
0
-
0
-mkpieces
0
-mkboard
0
-$p[4] = [$p[4][0]]
0
-$pnum = (0...$p.length).to_a
0
-setpiece([],0)
0
+#!/usr/local/bin/ruby
0
+# This program is contributed by Shin Nishiyama
0
+
0
+
0
+# modified by K.Sasada
0
+
0
+NP = 5
0
+ROW = 8 + NP
0
+COL = 8
0
+
0
+$p = []
0
+$b = []
0
+$no = 0
0
+
0
+def piece(n, a, nb)
0
+  nb.each{|x|
0
+    a[n] = x
0
+    if n == NP-1
0
+      $p << [a.sort]
0
+    else
0
+      nbc=nb.dup
0
+      [-ROW, -1, 1, ROW].each{|d|
0
+        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
0
+          nbc << x+d
0
+        end
0
+      }
0
+      nbc.delete x
0
+      piece(n+1,a[0..n],nbc)
0
+    end
0
+  }
0
+end
0
+
0
+def kikaku(a)
0
+  a.collect {|x| x - a[0]}
0
+end
0
+def ud(a)
0
+  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
0
+end
0
+def rl(a)
0
+  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
0
+end
0
+def xy(a)
0
+  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
0
+end
0
+
0
+def mkpieces
0
+  piece(0,[],[0])
0
+  $p.each do |a|
0
+    a0 = a[0]
0
+    a[1] = ud(a0)
0
+    a[2] = rl(a0)
0
+    a[3] = ud(rl(a0))
0
+    a[4] = xy(a0)
0
+    a[5] = ud(xy(a0))
0
+    a[6] = rl(xy(a0))
0
+    a[7] = ud(rl(xy(a0)))
0
+    a.sort!
0
+    a.uniq!
0
+  end
0
+  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
0
+end
0
+
0
+def mkboard
0
+  (0...ROW*COL).each{|i|
0
+    if i % ROW >= ROW-NP
0
+      $b[i] = -2
0
+    else
0
+      $b[i] = -1
0
+    end
0
+    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
0
+  }
0
+end
0
+
0
+def pboard
0
+  return # skip print
0
+  print "No. #$no\n"
0
+  (0...COL).each{|i|
0
+    print "|"
0
+    (0...ROW-NP).each{|j|
0
+      x = $b[i*ROW+j]
0
+      if x < 0
0
+        print "..|"
0
+      else
0
+        printf "%2d|",x+1
0
+      end
0
+    }
0
+    print "\n"
0
+  }
0
+  print "\n"
0
+end
0
+
0
+$pnum=[]
0
+def setpiece(a,pos)
0
+  if a.length == $p.length then
0
+    $no += 1
0
+    pboard
0
+    return
0
+  end
0
+  while $b[pos] != -1
0
+    pos += 1
0
+  end
0
+  ($pnum - a).each do |i|
0
+    $p[i].each do |x|
0
+      f = 0
0
+      x.each{|s|
0
+        if $b[pos+s] != -1
0
+          f=1
0
+          break
0
+        end
0
+      }
0
+      if f == 0 then
0
+        x.each{|s|
0
+          $b[pos+s] = i
0
+        }
0
+        a << i
0
+        setpiece(a.dup, pos)
0
+        a.pop
0
+        x.each{|s|
0
+          $b[pos+s] = -1
0
+        }
0
+      end
0
+    end
0
+  end
0
+end
0
+
0
+mkpieces
0
+mkboard
0
+$p[4] = [$p[4][0]]
0
+$pnum = (0...$p.length).to_a
0
+setpiece([],0)
0
+
0
+
0
+__END__
0
+
0
+# original
0
+
0
+NP = 5
0
+ROW = 8 + NP
0
+COL = 8
0
+
0
+$p = []
0
+$b = []
0
+$no = 0
0
+
0
+def piece(n,a,nb)
0
+  for x in nb
0
+    a[n] = x
0
+    if n == NP-1
0
+      $p << [a.sort]
0
+    else
0
+      nbc=nb.dup
0
+      for d in [-ROW, -1, 1, ROW]
0
+        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
0
+          nbc << x+d
0
+        end
0
+      end
0
+      nbc.delete x
0
+      piece(n+1,a[0..n],nbc)
0
+    end
0
+  end
0
+end
0
+
0
+def kikaku(a)
0
+  a.collect {|x| x - a[0]}
0
+end
0
+def ud(a)
0
+  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
0
+end
0
+def rl(a)
0
+  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
0
+end
0
+def xy(a)
0
+  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
0
+end
0
+
0
+def mkpieces
0
+  piece(0,[],[0])
0
+  $p.each do |a|
0
+    a0 = a[0]
0
+    a[1] = ud(a0)
0
+    a[2] = rl(a0)
0
+    a[3] = ud(rl(a0))
0
+    a[4] = xy(a0)
0
+    a[5] = ud(xy(a0))
0
+    a[6] = rl(xy(a0))
0
+    a[7] = ud(rl(xy(a0)))
0
+    a.sort!
0
+    a.uniq!
0
+  end
0
+  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
0
+end
0
+
0
+def mkboard
0
+  for i in 0...ROW*COL
0
+    if i % ROW >= ROW-NP
0
+      $b[i] = -2
0
+    else
0
+      $b[i] = -1
0
+    end
0
+    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
0
+  end
0
+end
0
+
0
+def pboard
0
+  print "No. #$no\n"
0
+  for i in 0...COL
0
+    print "|"
0
+    for j in 0...ROW-NP
0
+      x = $b[i*ROW+j]
0
+      if x < 0
0
+        print "..|"
0
+      else
0
+        printf "%2d|",x+1
0
+      end
0
+    end
0
+    print "\n"
0
+  end
0
+  print "\n"
0
+end
0
+
0
+$pnum=[]
0
+def setpiece(a,pos)
0
+  if a.length == $p.length then
0
+    $no += 1
0
+    pboard
0
+    return
0
+  end
0
+  while $b[pos] != -1
0
+    pos += 1
0
+  end
0
+  ($pnum - a).each do |i|
0
+    $p[i].each do |x|
0
+      f = 0
0
+      for s in x do
0
+        if $b[pos+s] != -1
0
+          f=1
0
+          break
0
+        end
0
+      end
0
+      if f == 0 then
0
+        for s in x do
0
+          $b[pos+s] = i
0
+        end
0
+        a << i
0
+        setpiece(a.dup, pos)
0
+        a.pop
0
+        for s in x do
0
+          $b[pos+s] = -1
0
+        end
0
+      end
0
+    end
0
+  end
0
+end
0
+
0
+mkpieces
0
+mkboard
0
+$p[4] = [$p[4][0]]
0
+$pnum = (0...$p.length).to_a
0
+setpiece([],0)

0
@@ -1,8 +1,8 @@
0
-i=0
0
-while i<300000
0
-  i+=1
0
-  begin
0
-    raise
0
-  rescue
0
-  end
0
-end
0
+i=0
0
+while i<300000
0
+  i+=1
0
+  begin
0
+    raise
0
+  rescue
0
+  end
0
+end

0
@@ -1,5 +1,5 @@
0
-i=0
0
-while i<500000
0
-  "#{1+1} #{1+1} #{1+1}"
0
-  i+=1
0
-end
0
+i=0
0
+while i<500000
0
+  "#{1+1} #{1+1} #{1+1}"
0
+  i+=1
0
+end

0
@@ -1,13 +1,13 @@
0
-
0
-def tak x, y, z
0
-  unless y < x
0
-    z
0
-  else
0
-    tak( tak(x-1, y, z),
0
-         tak(y-1, z, x),
0
-         tak(z-1, x, y))
0
-  end
0
-end
0
-
0
-tak(18, 9, 0)
0
-
0
+
0
+def tak x, y, z
0
+  unless y < x
0
+    z
0
+  else
0
+    tak( tak(x-1, y, z),
0
+         tak(y-1, z, x),
0
+         tak(z-1, x, y))
0
+  end
0
+end
0
+
0
+tak(18, 9, 0)
0
+

0
@@ -1,10 +1,10 @@
0
-def tarai( x, y, z )
0
-  if x <= y
0
-  then y
0
-  else tarai(tarai(x-1, y, z),
0
-             tarai(y-1, z, x),
0
-             tarai(z-1, x, y))
0
-  end
0
-end
0
-
0
-tarai(12, 6, 0)
0
+def tarai( x, y, z )
0
+  if x <= y
0
+  then y
0
+  else tarai(tarai(x-1, y, z),
0
+             tarai(y-1, z, x),
0
+             tarai(z-1, x, y))
0
+  end
0
+end
0
+
0
+tarai(12, 6, 0)