Guest User

Untitled

a guest
Jun 20th, 2018
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Ruby 0.43 KB | None | 0 0
  1. require 'memcache'
  2.  
  3. cache = MemCache.new('localhost:11211')
  4. n = ARGV[0].to_i
  5. len = 0
  6. is_prime = lambda do |x|
  7.     result = true
  8.     0.upto(len - 1) do |i|
  9.         prime = cache[i.to_s]
  10.         (result = false; break) if x % prime == 0
  11.         break if x < prime * prime
  12.     end
  13.     result
  14. end
  15. 2.upto(1.0 / 0) do |i|
  16.     break if n == len
  17.     if is_prime[i]
  18.         cache[len.to_s] = i
  19.         len += 1
  20.     end
  21. end
  22. p cache[(len - 1).to_s]
Add Comment
Please, Sign In to add comment