fork(2) download 
  1. def isPrime(n):
  2. 	if n % 2 == 0:
  3. 		return n == 2
  4. 	d = 3
  5. 	while d * d <= n and n % d != 0:
  6. 		d += 2
  7. 	return d * d > n
  8.  
  9. for i in range(2, 100):
  10. 	if isPrime(i):
  11. 		print(i)
Success #stdin #stdout 0.02s 9276KB
comments (?)
stdin 
Standard input is empty
stdout 
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/Ir0wHv
language:
Python 3 (python  3.12)
created:
7 years ago
visibility:
secret

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!