fork download
copy 
  1. primes = [] # this will contain the primes in the end
  2. upto = 100 # the limit, inclusive
  3. for n in range(2, upto + 1):
  4.  for divisor in range(2, n):
  5.   if n % divisor == 0:
  6.    break
  7.  else:
  8.   primes.append(n)
  9. print(primes)
Success #stdin #stdout 0s 23296KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[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]
https://ideone.com/5K4c9d
language:
Python (cpython 2.7.16)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!