Vaguery/winkler14.rb

## winkler14.rb
# A horrible awful brute-force approach to Peter Winkler's 'Zeroes, ones and twos' problem, part 1
(1..100).each do |p|
  found = false
  q = 0
  until found
    q += 1
    product = p * q
    if !(product.to_s =~ /[^01]/) || q > 1000000000
      found = true
      p "#{p} * #{q} = #{product}"
    end
  end
end

## winkler14v2.rb
# A slightly less brute-force approach to Peter Winkler's 'Zeroes, ones and twos' problem, part 1
# this time it only checks each multiplier for the remaining undiscovered numbers

require 'pp'

pairs = {}
my_range = (1..1000)
partners = my_range.to_a

q = 0
until partners.empty? || q > 100000000000
  q += 1
  hits , misses = partners.partition {|p| !((p * q).to_s =~ /[^01]/)}
  hits.each do |p|
    pairs[p]=[q,p*q]
    p "#{pairs.length}: #{p} * #{q} = #{p*q}"
  end
  partners = misses
end

pp pairs.sort
	# A horrible awful brute-force approach to Peter Winkler's 'Zeroes, ones and twos' problem, part 1
	(1..100).each do \|p\|
	found = false
	q = 0
	until found
	q += 1
	product = p * q
	if !(product.to_s =~ /[^01]/) \|\| q > 1000000000
	found = true
	p "#{p} * #{q} = #{product}"
	end
	end
	end
	# A slightly less brute-force approach to Peter Winkler's 'Zeroes, ones and twos' problem, part 1
	# this time it only checks each multiplier for the remaining undiscovered numbers

	require 'pp'

	pairs = {}
	my_range = (1..1000)
	partners = my_range.to_a

	q = 0
	until partners.empty? \|\| q > 100000000000
	q += 1
	hits , misses = partners.partition {\|p\| !((p * q).to_s =~ /[^01]/)}
	hits.each do \|p\|
	pairs[p]=[q,p*q]
	p "#{pairs.length}: #{p} * #{q} = #{p*q}"
	end
	partners = misses
	end

	pp pairs.sort