DP Problems
Is Bita Happy? Bita has learned bitwise-operations recently. She is doing some experiments with these operations no... |
Happy Sub-Sequence Recently Alex has participated in a programming contest. He became 1st runner up. He couldn't solve ... |
Naughty Subsequence - V2.0 Mahib loves ‘Naughty Subsequence’-s. He will give you an array of characters ara[0,1,...,n-1] that c... |
Poltu and Interesting Number Poltu Loves interesting number. So he wants to find this type of number. The definition of an intere... |
Memes vs. Social Media In this era of modern technology social media is the most powerful weapon and the viral issue is the... |
Train Hijack You and your friend Daneliya Tuleshova are planning to hijack a train. Your friend will go inside a... |
I Hate Combinatorics! Rick and Morty are being hunted by the galactic government. They ran away to the cell dimension. The... |
Is This a Give-Away? Once there lived an ancient mage named Farabi. He could always give perfect weather forecast. He nev... |
Distinct Permutations You are given two binary strings A and B. Recall that binary string is a non-empty sequence of chara... |
Make Strings Great Again! Do you know what is a sub-sequence? A sub-sequence is a sequence that can be derived from another se... |
m-Beautiful Numbers An m-Beautiful Number is a number which is divisible by $m$ and the sum of the digits is also divisi... |
Chocolate There is a shop named Chocolove in the Codeland. There are many chocolates in the shop. Each chocola... |
Random Graphs This problem is very easy. There's a graph of $N$ nodes. Each edge $u-v$ ($u >= v ; u = v$ is possib... |
Milad's Lost Tree Milad likes trees so much. He has a rooted tree with $n$ vertices each of which has some non-negativ... |
MSIS! Do you know what MSIS is? MSIS is the abbreviation for Maximum Sum Increasing Subsequence. It is a s... |
Video Game Shefin is playing a game. In this game there are N buildings numbered from 1 to N. Each building has... |
Sgt. Laugh That's it. Sgt. Laugh has had enough. He is determined to end the evil military reign of General Cry... |
A Journey Towards One Given N. You can perform 3 types of operations: Increase N by 1. Decrease N by 1. Divide N by 2, av... |
Shrink the Array You have an array of size N which contains positive integers. You can apply the following operation ... |
Oishi Teacher and Her Naughty Class Oishi teacher has returned to her class after the tiffin break. She noticed that some students who r... |
Inversions and Goodbye It's time to say goodbye to CSEmpur, at least for today. And so you wanted to give the citizens of C... |
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
