Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- require 'memcache'
- cache = MemCache.new('localhost:11211')
- n = ARGV[0].to_i
- len = 0
- is_prime = lambda do |x|
- result = true
- 0.upto(len - 1) do |i|
- prime = cache[i.to_s]
- (result = false; break) if x % prime == 0
- break if x < prime * prime
- end
- result
- end
- 2.upto(1.0 / 0) do |i|
- break if n == len
- if is_prime[i]
- cache[len.to_s] = i
- len += 1
- end
- end
- p cache[(len - 1).to_s]
Add Comment
Please, Sign In to add comment