Skip to content

Instantly share code, notes, and snippets.

def f(n)
l = []
while (n != 1)
n = n.even? ? n / 2 : n * 3 + 1
l << n
end
return l
def f(n)
l = []
while (n != 1)
n = n.even? ? n / 2 : n * 3 + 1
l << n
end
return l
def adv(n, w)
case w
when 0
return n.even? ? n / 2 : n * 3 + 1
when 1
return n.even? ? n / 2 : (n * 3 + 1) / 2
when 2
n = (n * 3 + 1) if (n.odd?)
n /= 2 while (n.even?)
return n
def adv(n, w)
case w
when 0
return n.even? ? n / 2 : n * 3 + 1
when 1
return n.even? ? n / 2 : (n * 3 + 1) / 2
when 2
n = (n * 3 + 1) if (n.odd?)
n /= 2 while (n.even?)
return n
def stat(l)
return 0, 0 if (l.empty?)
t = t2 = 0
l.each \
{
|x|
t += x
t2 += x ** 2
}
c = l.size
#!/usr/bin/ruby1.8
def f(n)
n1 = n
f = false
c = 0
while (n != 1)
def dense(n)
s = n.to_s(2)
c = 0
s.length.times \
{
|i|
c += s[i, 1].to_i
}
return c.to_f / s.length
def dense(n)
s = n.to_s(2)
c = 0
s.length.times \
{
|i|
c += s[i, 1].to_i
}
return c.to_f / s.length
def dense(n)
s = n.to_s(2)
c = 0
s.length.times \
{
|i|
c += s[i, 1].to_i
}
return c.to_f / s.length
#!/usr/bin/ruby1.8
def dense(n)
s = n.to_s(2)
c = 0
s.length.times \
{
|i|