Problems from Contest Based on SUST Intra University Programming Contest 2019
A.
Perfect Points Perfect lines are the lines y=mx+c such that m and c are positive integers. Perfect points are the p... |
B.
String Is Not That Easy Let's consider a string S which is obtained by concatenating the non-negative integers from 0 to 102... |
C.
XOR Partition Neo has a hidden array A of n integers where 0 ≤ Ai ≤ 109 is satisfied for each i from 1 to n . You ... |
D.
Permutations and Divisors Let P be a permutation of length n where each value from 1 to n occurs exactly once. A subsequence o... |
E.
Playing On A Directed Graph You are given a directed graph consisting of n vertices and m edges (each edge is directed, so it ca... |
F.
Ant-Man And The Polygon Ant-Man before escaping from the quantum realm thought about roaming around the realm. And much to h... |
G.
Enormous Product You are given two integers l and r. You need to find the value of x=l∏rx(x+1) As the value of this ... |
H.
Subset AND You are given an array A of n integers and an integer k. You need to find if there is any non-empty ... |
I.
Distinct Permutations You are given two binary strings A and B. Recall that binary string is a non-empty sequence of chara... |
J.
The Selection SUST has n departments numbered from 1 to n where every pair of distinct departments is connected by... |
K.
Mr Makor And His Friends Mr Makor has a set S of n integers. He calls a sequence of length k special if every element of the ... |
L.
Expected Oddness Alita found a string of n characters where each character of the string is either '0' or '1'. The Od... |
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
