fork(1) download
copy 
  1. def is_prime(n):
  2.     if n%2 == 0: return False
  3.     i = 3
  4.     while(i*i <= n):
  5.         if n%i == 0: return False
  6.         i = i+2
  7.     return True
  8.  
  9. def lp(n):
  10.     p = int((n//2)**0.5)
  11.     if p%2 == 0: p = p + 1
  12.     return p
  13.  
  14. def nums(m,n):
  15.     p = lp(m)
  16.     q = lp(n)
  17.     while(p <= q):
  18.         if is_prime(p): 
  19.             print(2*p*p)
  20.         p = p + 2
  21.  
  22. nums(101000000,102000000)
  23.  
Success #stdin #stdout 0.01s 7244KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
101075762
101417282
101588258
101645282
https://ideone.com/yqYOZ5
language:
Python (cpython 2.7.16)
created:
4 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!