Created
December 11, 2015 21:33
-
-
Save vznvzn/7b5782ebe7865e854074 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def f1(n) | |
n = (n * 3 + 1) / 2 while (n.odd?) | |
n /= 2 while (n.even?) | |
return n | |
end | |
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 | |
end | |
def widthdiff(x, y) | |
x.to_s(2).length - y.to_s(2).length | |
end | |
def widthratio(x, y) | |
x.to_s(2).length.to_f / y.to_s(2).length | |
end | |
def f(n, w) | |
n1 = n | |
c = 0 | |
l = [n] | |
cg = nil | |
while (n != 1) | |
n = f1(n) | |
l << n | |
c += 1 | |
cg = c if (cg.nil? && n < n1) | |
break if (!cg.nil? && w != 'c') | |
end | |
cm = (0...l.size).max_by { |x| l[x] } | |
return {'cm' => cm, | |
'cg' => cg.nil? ? 0 : cg, | |
'm' => l[cm].to_s(2).length, | |
'w' => widthdiff(l[cm], n1), | |
'r' => widthratio(l[cm], n1), | |
'c' => l.size, | |
'd' => (0.5 - dense(n1)).abs} | |
end | |
def long(m, w) | |
return {'n' => rand(2 ** (s = m * 1000)) | 1, 's' => s } if (w == 'z') | |
l = [{'n' => 1, 'p' => 0}.merge(f(1, w))] | |
t = 0 | |
e = 2000 | |
loop \ | |
{ | |
l = l.sort_by { |x| [x[w], -x['d']] }.reverse | |
x = l.delete_at(rand([l.size, 20].min)) | |
p2 = x['p'] + 1 | |
n2 = x['n'] + 2 ** p2 | |
x1 = x.dup | |
x1['p'] = p2 | |
l << x1 | |
x2 = {'n' => n2, 'p' => p2}.merge(f(n2, w)) | |
l << x2 | |
t += 1 | |
if (w == 'r') then | |
z = l.sort_by { |x| x['n'] }.reverse[0...100].max_by { |x| x['r'] } | |
else | |
z = l.max_by { |x| x[w] } | |
end | |
z.merge!({ 't' => t, 's' => t.to_f / e }) | |
return z if (z['s'] >= m) | |
} | |
end | |
def adv(n) | |
l = [] | |
while (n != 1) | |
n = f1(n) | |
l << n.to_s(2).length | |
end | |
return l | |
end | |
def nonmono(l) | |
mn = nil | |
r = nil | |
l.each_with_index \ | |
{ | |
|d, i| | |
d1 = d.abs | |
mn = [mn, [d1, i]].compact.min | |
r = [r, i - mn[1]].compact.max | |
} | |
return r | |
end | |
def clear() | |
$c = [0] * 2 | |
$a = {} | |
$x = 0 if ($x.nil?) | |
end | |
def bunch(n) | |
l = [] | |
100.times { l << [0, adv(n)]; n += 2 } | |
l1 = [] | |
loop \ | |
{ | |
l2 = l.select { |x| x[0] < x[1].size } | |
break if (l2.empty?) | |
t = 0 | |
l2.each { |x| t += x[1][x[0]] } | |
l1 << t | |
l3 = l2.sort_by { |x| x[1][x[0]] }.reverse | |
l3[0][0] += 1 | |
} | |
return l1 | |
end | |
def test(p, k, i, m) | |
z = long(m, k) | |
clear() if ($c.nil?) | |
$c[0] += 1 | |
n = z['n'] | |
return if ($a.member?(n)) | |
$c[1] += 1 | |
$a[n] = nil | |
$stderr.puts([$c, k, z['s'], n.to_s(2)].inspect) | |
puts([$x, i, nonmono(bunch(n))].join("\t")) | |
$x += 1 | |
$stdout.flush | |
end | |
def r2(x) | |
sprintf("%.2f", x).to_f | |
end | |
def all(p) | |
c = 100 | |
p.each_with_index \ | |
{ | |
|k, i| | |
clear() | |
(c + 1).times \ | |
{ | |
|w| | |
test(p, k, i, w / c.to_f) | |
} | |
puts | |
$x += 25 | |
} | |
end | |
p = ['w', 'p', 'c', 'm', 'cg', 'cm', 'r', 'z'] | |
# test(p, 'w', 0, 0.5); exit | |
all(p) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment