Category: math

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 *= …

In , the GCD (Greatest Common Divisor) is given in brief details. The algorithm can be implemented in both recursive and iterative forms. The recursive formula is , and …

The problem is from codeforces: http://codeforces.com/problemset/problem/245/A A really simple math problem, can be solved within a few lines of Python code: #!/usr/bin/env python ax = asum = 0 bx = …

In , two equations are used and compare the efficiency of computation of the math constant . The following are some commonly-used equations to compute the We pick the …

In , the basic 0/1 knapsack is discussed. For each item, you can choose to put or not to put into the knapsack. Therefore, for the number of items, …