Problems from Intra SUST Programming Contest 2020 Preliminary 1
A.
Find The Pairs You are given a non-negative integer N. A pair(a, b) is called atomic if (a | b) = N ("|" means bitw... |
B.
Story of A4 You all know the A4 papers. But do you know why are they called A4 or why are they so special? Well,... |
C.
Restore Magic Rectangle Random coder boy Kiny once had a rectangle (2D grid) as quarantine gift. Every random people have so... |
D.
1 March 2023 Don't waste your time on the title. You will be given two vectors v1=x1i^+y1j^ and v2=x2i^+y... |
E.
Sayadpur City Bob wants to visit a new country called sayadpur. There are N cities (1,2,3,…,N) in sayadpur, and th... |
F.
Beautiful Subsequences You are given a string. You have to find the number of beautiful subsequences in the string. A subse... |
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
