Problems
Random Graphs This problem is very easy. There's a graph of $N$ nodes. Each edge $u-v$ ($u >= v ; u = v$ is possib... |
Siraj Raval and His Dataset Siraj has a dataset consisting of $N$ 2D cartesian points. Siraj wants to find out a straight line o... |
Fun Theory Let's go for a short statement. n people took part in a disco. To make the disco scarier, each perso... |
Preparing for War There were N cities in England. Each contained a warrior with skillset equal to X. All the cities we... |
Jenga Tower Maybe you all are familiar with Jenga Game. "Jenga is played with 54 wooden blocks. Each block is th... |
Chocolate There is a shop named Chocolove in the Codeland. There are many chocolates in the shop. Each chocola... |
m-Beautiful Numbers An m-Beautiful Number is a number which is divisible by $m$ and the sum of the digits is also divisi... |
Funmondi Contest! There is a contest being held on Funmondi named ‘Funmondi Inter School Programming Contest’. You are... |
No Onion, No Cry -Onions make us cry, don't they? They can make us happy too. -How? -Read the statement carefully! I... |
Expected Oddness Alita found a string of n characters where each character of the string is either '0' or '1'. The Od... |
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 ... |
Scarlet Speedster The scarlet speedster of Central City, popularly known as the Flash is fighting an epic battle again... |
M-Sequence A sequence is called M-sequence if after removing zero or more elements from the sequence the GCD of... |
Wheel Graph Today we will learn about a special type of graph called Wheel Graph. In the mathematical discipline... |
Roll the Dice You have got a 6 sided dice. In a single roll, it may show any integers from 1 to 6. You are going t... |
Composite Facts Let's define two functions F and S: F(n) = 1 + n! S(n,m) = Sum of first m non-prime integers which ... |
MonoMono You have probably heard of the famous board game, Monopoly. According to Wikipedia, in this game, pl... |
Birthday of Aliens On the planet of Royal Royal, a university named Royal University of Engineering and Technology exis... |
Keep Away From Those Oceans We all know the great story of the Ant and the Grasshopper. Clever Ant survived the tough time of wi... |
String Game You have a list of N strings, denoted by A1, A2, ..., AN. Each string consists of lowercase English ... |
Make Strings Great Again! Do you know what is a sub-sequence? A sub-sequence is a sequence that can be derived from another se... |
Dynamic Tree You are given a tree containing N vertices. The vertices are numbered from 1 to N. A tree with N ver... |
MaxXOR You are given an array A of n integers (A1, A2, ..., An) and some queries. In each query, you wil... |
Static Tree You are given a tree containing N vertices. The vertices are numbered from 1 to N. A tree with N ver... |
The Selection SUST has n departments numbered from 1 to n where every pair of distinct departments is connected by... |
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
