Ad-hoc Problems
Rainy Day You have to complete N tasks tomorrow, where each task can last for any number of minutes. Each task... |
Anina’s Birthday Gift Anina is a girl who is very much interested in mathematics. She likes to solve Geometry and Counting... |
Information Retrieval When you search in Google or any other search engines, you are provided with a list of links that ar... |
Grasshopper and The Ant In a field one summer's day a grasshopper is hopping about and is coding to its heart's content for ... |
Can You Help? Hey, hello! Yes, I am talking to you, whoever is reading this problem statement. I know you are Robi... |
Half Measures The numbers 1,2,3,⋯n (each integer from 1 to n once) are written on a board. In one operation, Jesse... |
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
