primes = [] # this will contain the primes in the endupto = 100 # the limit, inclusivefor n in range(2, upto + 1): for divisor in range(2, n): if n % divisor == 0: break else: primes.append(n)print(primes)
Standard input is empty
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
The brand new service which powers Ideone!
Widget for compiling and running the source code in a web browser!