Problems from Into The CSEtoon Network Programming Contest
A.
Bishop and King You have a 8✕8 chessboard with a bishop and a king. Can you attack the king with the bishop by movin... |
B.
Sum of Sub-Sum You are given an array a of n integers. Subsequences of the array are the sequences which can be obt... |
C.
Binary Game L_Man and A6pap are playing a game with an array (1 indexed). Each element of the array is either 1 ... |
D.
Gotta Catch'em All You are playing Pokémon Go. You are of course in a 3D world and the distance between two points (x1,... |
E.
Array Bias A sub-array is called biased if one of its elements occurs more than ⌊2n⌋ times. Here n is the leng... |
F.
Medians of a Tree Given a tree of n nodes indexed from 1 to n. Find the sum of medians of all simple paths of the tree... |
G.
Key to the Source In order to end the war between machines and humans Neo must get to the source of the matrix and mee... |
H.
End Game You are given an array consisting of N integers. You have to divide it into N sub-arrays. In each st... |
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
