Problems from CodeHunger Practice Contest-06
A.
Find Max The task is simple. You are given an array A of size N. You need to find the maximum sum of the arra... |
B.
Gift of God! Easy Version Nowadays people are cutting down trees unconditionally. Pollycarp loves trees, so he wished to God t... |
C.
Gift of God! Hard Version Nowadays people are cutting down trees unconditionally. Pollycarp loves trees, so he wished to God t... |
D.
AB is the boss! I have three programming bosses! Their names are A and B. In a competition there are so many program... |
E.
Find Prime! Pollycarp is now finding prime numbers. As, he is not a good programmer he is finding prime numbers ... |
F.
Recursion! Pollycarp has a friend named recursion. If he gives him some amount of money, recursion tells him th... |
G.
Max Sum Again! Pollycarp is now learning subsets. He already knows, how to find maximum sum. But this time he wants... |
Practice Contest
Practice contests allow you to re-run contests and experience them as close as possible to the original run.
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
