fork(1) download
copy 
  1. def mod(a, b):
  2.     global c
  3.     c += 1
  4.     return a % b
  5.  
  6. max = 1000
  7.  
  8. c = 0
  9. primes = filter(lambda p: all(mod(p, num) for num in range(2,p)),range(2,max))
  10. print c, 'divisions'
  11.  
  12. c = 0
  13. from math import sqrt
  14. primes = [2]
  15. for n in range(3, max, 2):
  16.     if all(mod(n, p) for p in primes if p <= sqrt(n)):
  17.         primes.append(n)
  18. print c, 'divisions'
Success #stdin #stdout 0.14s 10840KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
78021 divisions
2302 divisions
https://ideone.com/X0MhGO
language:
Python (cpython 2.7.16)
created:
12 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!