def build_prime_number_list(n): """Build a list of prime numbers using a sieve with the highest value in the list being equal to or lesser than n""" sieve = [True]*(n//2) #sieve is n long, all values are True for i in xrange(3,int(n**0.5)+1,2): # in python3 use range not xrange. 3, sqr root of n+1, step is 2 if sieve[i/2]: sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1) #set the sieve bit to False if condition is met #print(sieve) return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]] #build prime number list number_to_divide = 302001 n = int(number_to_divide/2) prime_number_list = build_prime_number_list(n) for prime_number in reversed(prime_number_list): if number_to_divide % prime_number == 0: print(prime_number) break
Run
Reset
Share
Import
Link
Embed
Language▼
English
中文
Python Fiddle
Python Cloud IDE
Follow @python_fiddle
Browser Version Not Supported
Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+
Firefox 4+
Safari 5+
IE 10+
Let me try anyway!
url:
Go
Python Snippet
Stackoverflow Question
