Divide and Conquer Problems
Cash Change You have an unlimited number of cash notes of the following denominations: 1, 5, 10, 50, 100, 500. G... |
Buildings There are n buildings in a row. The height of the i-th building is hi. You have ৳k. It is the amoun... |
Knapsack You have a backpack that can carry a maximum weight of C. You will also be given a set of items, the... |
Is This a Give-Away? Once there lived an ancient mage named Farabi. He could always give perfect weather forecast. He nev... |
A Giveaway Mr. Tom is the head of ICPC world final organizing committee. For the world final, he comes to Dhaka... |
Burger King Every day, more than 11 million guests visit BURGER KING® restaurants around the world. And they do ... |
LIDS We all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ... |
Passwords Alice wants to extract some passwords from a random string. A password can have any number of charac... |
Subset AND You are given an array A of n integers and an integer k. You need to find if there is any non-empty ... |
Birthday Gifts Today is Luke's birthday. Mr. Phil Dunphy (Luke's father) has thrown a birthday party for him and de... |
Road Minister Techboy Techboy is appointed as the minister of roads and highway in his country Better-Not-Name-It. Now he ... |
Make It Big! You are given a number N (10 ≤ N ≤ 2×109). You have to perform exactly two swap operation. You can c... |
Harry Potter and the Vault of Gringotts "There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Second Wi... |
Gaaner Koli The protagonists of this problem are two great programmers of a certain institution Omanush and Ordi... |
Alice in Candyland Alice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D grid. In ea... |
OCD Returns! This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o... |
The Perfect Collection Given an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR... |
Subarray Sum You are given an array having N integers. You have to select at most K positions in the array and re... |
Maximum Sum Little Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,... |
Sticking Pins You are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ... |
Very Dirty String Strings are difficult, most of the contest programmers say this and try to avoid string algorithms. ... |
Orchid Division Quido has a square orchard full of various fruit and nut trees. The trees are planted in regular row... |
Third Dimension Mr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across... |
Easy Sequence 1 Let’s define an easy sequence F. Where: F(1)=1 F(2X)=F(X)2+1 F(2X+1)=F(X)×F(X+1)+2 Here X is a posit... |
Smart Feature Phone 2 Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA. ... |
Other Categories
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
