We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
defget_primes(n):primes=[2]slicing=slice(1,None)num=3whilelen(primes)<n:is_prime=Trueforprimeinprimes[slicing]:ifprime*prime>num:breakifnum%prime==0:is_prime=Falsebreakifis_prime:primes.append(num)num+=2returnprimesdefwaiter(number,q):# get 'q' number of primesprimes=get_primes(q)# initializationanswers=[]nums=number# q iterationsforiinrange(q):stack_a,stack_b=[],[]prime=primes[i]fornuminreversed(nums):ifnum%prime==0:stack_b.append(num)else:stack_a.append(num)answers.extend(reversed(stack_b))nums=stack_aanswers.extend(reversed(nums))returnanswers
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Waiter
You are viewing a single comment's thread. Return to all comments →