Do You Know Tree ? "Stay at least one metre distance from others.” Corona has affected the World as well as Bangladesh.... |

Alice in Candyland Alice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D grid. In ea... |

Maximum Sum Little Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,... |

Harry Potter and the Vault of Gringotts "There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Second Wi... |

Dominoes Forever Once when I was little, my father took me to a tobacco shop! It is surprising, but true. He asked th... |

I Hate Combinatorics! Rick and Morty are being hunted by the galactic government. They ran away to the cell dimension. The... |

Train Hijack You and your friend Daneliya Tuleshova are planning to hijack a train. Your friend will go inside a... |

Gaaner Koli The protagonists of this problem are two great programmers of a certain institution Omanush and Ordi... |

The Perfect Collection Given an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR... |

LIDS We all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ... |

Very Dirty String Strings are difficult, most of the contest programmers say this and try to avoid string algorithms. ... |

Easy Sequence 1 Let’s define an easy sequence F. Where: F(1)=1 F(2X)=F(X)2+1 F(2X+1)=F(X)×F(X+1)+2 Here X is a posit... |

Smart Feature Phone 2 Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA. ... |

Counting Murgis Ever since that wicked thief took away some of her murgis (hens, that is), Meena was ever anxious th... |

Subarray Sum You are given an array having N integers. You have to select at most K positions in the array and re... |

OCD Returns! This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o... |

Sticking Pins You are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ... |

Orchid Division Quido has a square orchard full of various fruit and nut trees. The trees are planted in regular row... |

Third Dimension Mr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across... |

Happiness If you have a Tk 100 in your wallet, what would you do? You might have couple of ways to spend that ... |

Perseus and The New Challenge The life of princess Andromeda, the daughter of King Cepheus and Queen Cassiopeia of Ados, is in dan... |

Paying Bills Mued is finally home for summer vacation after surviving yet another semester of the mighty CS Under... |

Pathetic Interview II You all know about the story of Pathetic Interview-I. Today, I am sharing a story of my close friend... |

Easy Sequence 2 Let’s define a easy sequence F. Where $ F(1) = 1 $ $ F(2X) = F(X)^2 + 1 $ $ F(2X+1) = F(X) \times F(... |

Polygon Construction (Hard) Meera in going to picnic with her friends. They are going to have lots of fun. They will be doing va... |

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.