Created
November 10, 2014 23:20
-
-
Save krupenik/0b79ac4281f14c04ec79 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
require "set" | |
def eratosthenes n | |
nums = [nil, nil, *2..n] | |
(2..Math.sqrt(n)).each do |i| | |
(i**2..n).step(i) { |m| nums[m] = nil } if nums[i] | |
end | |
nums.compact | |
end | |
def rotations number | |
rotations = [number] | |
digits = digits(number) | |
(digits.size - 1).times do | |
rotations << from_digits(digits.push(digits.shift)) | |
end | |
rotations.uniq | |
end | |
def from_digits digits | |
number = 0 | |
digits.reverse.each_with_index do |digit, power| | |
number += digit * 10**power | |
end | |
number | |
end | |
def digits number | |
digits = [] | |
while number > 0 | |
digits << number % 10 | |
number /= 10 | |
end | |
digits.reverse | |
end | |
def solve n | |
primes = eratosthenes(n).to_set | |
primes.reject! { |prime| !rotations(prime).all? { |rotation| primes.include?(rotation) } } | |
primes | |
end | |
puts solve(ARGV[0].to_i).size |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment