Skip to content

Create re_id.py #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions google-foobar/re_id.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
## There's some unrest in the minion ranks: minions with ID numbers like "1", "42", and other "good" numbers have been lording it over the
## poor minions who are stuck with more boring IDs. To quell the unrest, Commander Lambda has tasked you with reassigning everyone new,
## random IDs based on her Completely Foolproof Scheme. She's concatenated the prime numbers in a single long string: "2357111317192329...". Now every minion must draw a number from a hat. That number is the starting index in that string of primes, and the minion's new ID number will be the next five digits in the string. So if a minion draws "3", their ID number will be "71113".
## Help the Commander assign these IDs by writing a function answer(n) which takes in the starting index n of Lambda's string of all primes, and returns the next five digits in the string. Commander Lambda has a lot of minions, so the value of n will always be between 0 and 10000.

""" Languages
=========
Inputs:
(int) n = 0
Output:
(string) "23571"
Inputs:
(int) n = 3
Output:
(string) "71113" """


def generate_prime(max_range):
seed = list(range(2, max_range))
while not len(seed) == 0:
top = seed.pop(0)
yield top
seed = [i for i in seed if not i % top == 0]

def answer(n):
prime = list(generate_prime(21000))

primes= ''.join(map(str, prime))
print primes

for idx, val in enumerate(primes):
print idx,val
if idx == n:
final=primes[idx:idx+5]
return ''.join(map(str, final))


return -1

#n = 10000
#print(answer(n))