Problems from AUST Programming Lab 2 Selection Contest 2
A.
Birth of a New Programming Language You want to develop a new programming language. So, you need to create a compiler software that can ... |
B.
AUST Student ID “ID Card Golay Jhulan” We all AUSTian are familiar with this word, Right? But we don’t like to do th... |
C.
Easiest XOR Problem You are given an array a with n integers. You have to choose a subsequence from a with length at lea... |
D.
Summation of Square and Cubic Numbers Given some numbers, find if the number is summation of a positive square and a positive cubic number... |
E.
HAIL PEAKY BLINDERS The Peaky Blinders is the most powerful gang in Birmingham. Almost every other gangs hate Peaky Blin... |
F.
Do You Know LIS? Alam has an array a with n elements a1,a2,…,an and an integer x. For each i (1≤i≤n−1) index i and... |
G.
Circular Race Alam and Tashfiq are racing on a circular track with radius r meters. Alam is running at a velocity ... |
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
