Ad-hoc Problems
Why Don't You Guys Believe Him? My friend, Qbaidul recently claimed again that he is stronger than a Yeti. But this time no one beli... |
Word Count Counting the frequencies of words are a basic and important task in natural language processing. In ... |
XOR and the Array Given an array of N integers, you need to find out the minimum number of integers that must be added... |
Yet Another Xinversion The problem statement is simple. You are given a rooted tree (1 is the root) and every node has a co... |
You Are Programmer, You Have No Valentine! One morning, Rose woke up early, and her husband, Alice, asked what was the matter. She told him, "I... |
You Want Chocolate? Bear Limak is very much fond of chocolate. His mom wants her son to study hard and develop his skill... |
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
