###--------------------------------------------------------------------------
### Imported modules.
-from sys import argv, stdin, stdout, stderr
+import sys as SYS; from sys import argv, stdin, stdout, stderr
import os as OS
import itertools as I
import math as M
import catacomb as C
+if SYS.version_info >= (3,):
+ xrange = range
+ range = lambda *args: list(xrange(*args))
+
###--------------------------------------------------------------------------
### Utilities.
me.limit = limit
## Calculate the size of sieve we'll need and initialize the bit list.
- n = (limit - 2)/2
- sievesz = (n + me._NBIT - 1)/me._NBIT
+ n = (limit - 2)//2
+ sievesz = (n + me._NBIT - 1)//me._NBIT
me._sievemax = sievesz*me._NBIT
me._bits = sievesz*[0]
global SIEVE
if SIEVE is not None: raise ValueError('sieve already defined')
if sievebits < 6: sievebits = 6
- SIEVE = Sieve(1 << (sievebits + 1)/2)
+ SIEVE = Sieve(1 << (sievebits + 1)//2)
###--------------------------------------------------------------------------
### Primality checking.
Give it the LABEL, and report progress to P.
"""
- if SIEVE.limit >> (nbits + 1)/2: g = gen_small
+ if SIEVE.limit >> (nbits + 1)//2: g = gen_small
else: g = gen_pock
return g(nbits, label = label, p = p)