Category: algorithms
Base62, like Base10 (decimal), Base16 (hexadecimal), is a number system. Base62 uses 62 possible ASCII letters, 0 – 9, a – z and A – Z, therefore it is often …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/260/A This problem looks difficult at the first glance because of the input ranges are large for the given three integers. Using bruteforce to print …
The Longest Increasing Sequence (LIS) asks for the longest increasing sequence in a list of numbers. For example, in the list 1, 6, 2, 5, 4, 7, the longest …
Fermat Prime Test Algorithm is to check whether a number is prime. It is a probabilistic approach that based on the following observation. . This is also known as …
If we want to compute , we can have a naive implementation by multiplication of base number x. def pow(x, n): r = 1 for _ in xrange(n): r *= …