Exists or Not Exists You will be given some numbers. Then there will contain some queries. In every query there will be g... |

Queries, Queries Everywhere You are given an array a of length n. You are also given q queries on the array and you have to proc... |

A Unique Array An array is called "unique" if it has no consecutive element with same value(A[i] != A[i-1]). Given ... |

Itachi's Challenge Sasuke is a 12-year old ninja who is very much interested in learning Ninjutsu (A tactic used by nin... |

Taju Kage Bunshin No Jutsu Naruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses... |

No Onion, No Cry -Onions make us cry, don't they? They can make us happy too. -How? -Read the statement carefully! I... |

Straightforward No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen... |

Maximum Meetings I am the boss of my company. I have n employees. The office time of my company starts at 1. Every em... |

Donate Our Department We are students of CSE, IU. It is very well known that our departmental instruments are not so good.... |

Crayons Five friends A, B, C, D and E has come to a shop to buy crayons for their art project. They need cra... |

Stick Game Shahwat has a stick that has n blocks that are indexed from 1 to n (from first to last). Each block ... |

Birthday of Aliens On the planet of Royal Royal, a university named Royal University of Engineering and Technology exis... |

Jumping Frog (II) A frog wants to cross a river. There are some posts in the river. The frog can go from one post to a... |

Welcome to Criterion Rounds The team congratulates you for participating in this contest and for being part of the journey towar... |

Just Another Range Query This is another simple range query problem where you will perform some updates and answer some queri... |

Palindrome and Queries You'll be given an array A of N strings containing lowercase English letters only and Q queries. In ... |

Count the Chaos Imagine, you have an array of integers of size N. At each index of this array is a unique integer fr... |

Easy Prime! There are N numbers in an array. You will have Q queries. In each query, you can make 2 operations. ... |

Paltu, a Prime Lover Note that the memory limit is unusual. Paltu is a good programmer and he loves prime numbers. One da... |

Bored?? "Avoid touching your face, particularly your eyes, nose or mouth to prevent the virus from entering ... |

Another Query on String You are given a string S (of length n) consisting of alphabets only. You need to perform m queries o... |

Palindrome Query I You are given a string of length L. You have Q queries. In each query, you will be asked to either u... |

Superman and the Buildings of Dahaka To end the long-running feud between Superman and Goku fans regarding who's stronger, Zeron has deci... |

Distinct Dishting You are given an array of N integers. Then there will be Q commands of the following type: Change ... |

Rivalry Friends Ryo and his girlfriend love to think about challenges. One day his girlfriend gave him a challenge t... |

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

Toph uses cookies. By continuing you agree to our Cookie Policy.