review117.rb

def f2(n)
	return n.odd? ? (n * 3 + 1) / 2 : n / 2

end

def climb(n)
	
	n1 = n
	l =  [n]
	begin
		n = f2(n) 
		l << n
	end while (n > 2)

	case 'global' 
	when 'global'
		m = (0...l.size).max_by { |x| l[x] }
		b = m
		b += 1 while (l[b] > n1)
		
	when 'local'
		b = (0...l.size).to_a.index { |x| l[x] < n1 }
		m = (0..b).max_by { |x| l[x] }
		
	end

	l = l.map { |x| x.to_s(2).reverse }
	
	return l[0..m], l[m..b], l[(b + 1)..-1]
	
	
end

def sample(l, c)

	r = l.size / c
	l2 = *(0...l.size).select { |x| x % r == 0 }
	l2[c..-1] = []
	return l.values_at(*l2)
	
end

def sum(l)

	t = 0.0
	l.each { |x| t += x }
	return t
end

def avg(l)
	return nil if (l.empty?)
	return sum(l) / l.size
end

def len01(ns)
	nl = ns.length
	l1 = ns.split(/0+/).map { |x| x.length }
	
	l2 = ns.split(/1+/)[1..-1]
	l2 = [''] if (l2.nil?)
	
	l0 = l2.map { |x| x.length }
	return l0, l1
end

def amx(ns)
	l0, l1 = len01(ns)
	l = l0 + l1
	return {'a' => avg(l), 'mx' => l.max}
end

l = File.open('tmp/bitwise8/out/10/mixdb.txt').readlines.map { |x| Kernel.eval(x) }

sample(l, 500).each_with_index \
{
	|x, j|
	n = x['n']
	l1, l2, l3 = climb(n)

	amx01l = l1.map { |x| amx(x) }
	amx01r = l2.map { |x| amx(x) }
	a = {
		'mx01l' => amx01l.map { |x| x['mx'] }.max,
		'mx01r' => amx01r.map { |x| x['mx'] }.max,
		'a01l' => avg(amx01l.map { |x| x['a'] }),
		'a01r' => avg(amx01r.map { |x| x['a'] })
	}
	puts(a.keys.join("\t")) if (j == 0)
	puts(a.values.join("\t"))
}