Category: algorithms
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, …
In reality, many applications can be represented as Knapsack problems. The knapsack problem is one of the most classic combinatics mathematics problems. The knapscak problems are of serveral types. …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/1/B The implementation may not be so easy without Regual Expressions. The core idea is to provide conversion between base 10 and base 26. For …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/239/A It is a simple math problem: finding the numbers x that satisify where y, k, and n are given;
Algorithm complexity can be represented by Big O notation, for example, the following piece of code has complexity that sums up the array. s = 0 arr = for …
