from itertools import count


def factors(n):
    while (n % 2 == 0):

def factors(n):
    if (n & 1 == 0):
        fs = [2]
        fs.extend(factors(n // 2))
    else:

#!/usr/bin/env python
"""shamir_threshold_scheme.py

Shamir's (k, n) threshold scheme. See "The Handbook of Applied Cryptography" or
Shamir's 1979 paper, "How to Share a Secret."

#################
# c2.pyx
# compile this with the help of setup.py (below), via:
# python setup.py build_ext --inplace
#################

#!/usr/bin/env python


def _drop_mults(xs):
    for i in xrange(0, len(xs), xs[0]):

#!/usr/bin/env python

############################
#     Behind the Scenes    #
############################

#!/usr/bin/env python

"""random_ge_one.py

Add up uniformly distributed random numbers between zero and one, counting how

#!/usr/bin/env python


def column1(exc):
    c = 0

#!/usr/bin/env python

### prime & ilog2 helpers
import itertools

#!/usr/bin/env python

import itertools
from math import log

#!/usr/bin/env python


def pop1(n):
# Naive; first changes n to binary, then adds up bits one by one

#!/usr/bin/env python


def make_heap():
    return []

def make_heap():
    return []

def find_min(h):
    return h[0]

#!/usr/bin/env python

"""dijkstraMaster.py

A submission to Programming Praxis for Dijkstra's Algorithm. Uses a min

#!/usr/bin/env python

import random
from cookbook import primes
# Sieve of Eratosthenes based primes < n, speedy and space efficient

#!/usr/bin/env python
"""
dijkstra2.py

A slightly faster implementation of Dijkstra's Algorithm, using a linear search

#!/usr/bin/env python
"""
My submission to Programming Praxis for "Tracking Santa":
http://programmingpraxis.com/2010/12/24/tracking-santa/
To run, save the data.js file in the same directory, delete "var locations = "

#!/usr/bin/env python
"""
dijkstra.py

A conceptually simpler but less efficient implementation of Dijkstra's

"""
interval.py

My submission for Programming Praxis's "Interval Arithmetic" exercise; see
http://programmingpraxis.com/2010/12/21/interval-arithmetic/

#include <stdio.h>

struct node {
    float val;

#!/usr/bin/env python
"""
Determines all the happy numbers less than upper bound of 100.

GRE, 7/24/10