Problems from 3rd PUC Intra University Programming Contest
A.
Meena and Lali One day Raju challenge Meena to do his daily jobs. After accepting Raju’s challenge Meena and Mithu ... |
B.
Perplexity of Permutations A permutation of N integers from 1 to N is an array where each number has appeared exactly once in t... |
C.
Metro Rail Blocks The city of Dhaka is experiencing the construction of metro rails. Imagine one such metro rail spans... |
D.
Make Them Odd Again Meena gave Raju an array A with N integers. In one operation Raju can choose an index except the fir... |
E.
Welcome to the Competitive World “To prepare a programmer such that his/her logical ability increases and he/she is able to write cod... |
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
