Greedy algorithm is described as an algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum. Thus, it is always interesting to find a problem, which can …
Codeforces has introduced a third division in their competitions. Initially I though this is the place to go for “easy” stuff, as far as some of the 2nd division problems require some advanced algorithms, like combinations of graphs and months …
Python – Binary String Minimizing Problem – CodeForces Read more →
Wikipedia says that the activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi). The problem is to select the maximum …
Karen and Game is the third article about Karen. In a row. Pretty much, someone in CodeForces has created 7 different problems with her, thus the Japanese lady is getting famous. This time the problem looks like this: The game is …