Compute the explicit value of a factored integer given as a list of (base, exponent) pairs.

Put key-value pair into the table. (Remove key from table is value is null). @param key Key. @param value Value.

Given a tag name, removes all tags with that name from the soup if they have no text. Returns the new soup without modifying the given one.

Given a problem number, scrapes the problem and adds it to the directory. If provided with an opener, uses that instead of re-connect

Convert an iterable to a list. @param iterable Iterable to iterate over. @return List<E> of elements.

unescape HTML code refs; c.f. http://wiki.python.org/moin/EscapingHtml

Given Node objects that provide parent pointers in a binary tree return the least common ancestor (LCA) of the two nodes. @param n1 Node #1. @param

Given Node objects that provide parent pointers in a binary tree return the least common ancestor (LCA) of the two nodes. If the nodes were the same

Returns the method signature for the problem, in the form <name>(<name>, <name>, ...) e.g. MyFunc(A, B)

Returns the method signature for the problem, in the form <return type> <name>(<type> <name>, <type> <name>, ...) e.g. long MyFunc

Checks if this page contains a problem that is missing. Returns True if it contains the 'problem missing' text, False if not.

Generate a list of the prime numbers [2, 3, ... m] where m is the largest prime <= n.

Scrape the HTML for a particular piece, returning the piece on success. The pieces correspond to the keys in the object dictionary.

What is an anagram? A string that is a permutation of another. Rather than exhaustively generate all permuatations of input_string and co

Check invariants that make this a red-black tree. @return

Refreshes and re-scans the directory for problems, as well as re-creating missing files. The difference between this and __init__ is that this

O(n^2) approach where we go through each interval and compare it to each interval.