## LCMGiven an integer LLL, you have to find the product of two different integers such that their LCM (Le... |

## Jealous NobitaShizuka and Dekisugi are playing with a binary tree rooted at 111. In each turn, the player chooses ... |

## SwitchesTechnology is going ahead very fast. How can we know what will we get in future? One day you met a g... |

## N-th PrimeIn this problem, you will have to print the nnn-th prime number. The first few prime numbers are giv... |

## Chowdhury Saheb & the NumbersYou like short description of problems? Me too! Let's go to an easy problem. You are given an array ... |

## A Lack of Common DivisorsGiven a positive integer N, determine how many of the integers between 1 and N are co-prime with N. ... |

## Life of Phi IIYou will be given two integers nnn and mmm where GCD(n,m)=1GCD(n, m) = 1GCD(n,m)=1. You have to tell... |

## Ishtiaque and the RabbitMr Ishtiaque is in trouble. A few months ago, he bought 2 rabbits. He wanted to have two pet rabbits... |

## Challenging LoverGreetings to all of you. You must have heard about our star programmer Rafat bhai. One day he went o... |

## Relatively PrimeGiven a positive integer N, determine how many of the integers between 1 and N are co-prime with N. ... |

## Mystery of FibonacciFibonacci sequence is a recursive sequence that depends on the following definition: Fib(N) = Fib(N-... |

## Birthday Gift for SJToday is your best friend SJ’s birthday. You want to buy a birthday present for her. You want to buy... |

## Sofdor Ali and the Puzzle of WeightsSofdor Ali is one of the most famous scientists of Bangladesh. He is also well known for his puzzle ... |

## Magician's Offer!Rosi Vidmun is a greedy landlord who likes to grab as much land as he can. Currently he has P square... |

## Equation Equals HazardsYou are given the equation, GCD(A,M) = 1. You have to determine whether there exists at least one in... |

## Fast Co-PrimeTwo numbers A and B are called co-prime if the only common positive factor of the two numbers is 1. ... |

## Meera and Solo ChocolatesMeera bought candies from the store. She is now going to distribute those among her N friends. She m... |

## Co-Prime Enemy PairTwo integers A and B are known as co-prime or relatively prime if their greatest common divisor GCD ... |

## Secret MeetingThe world is terrified by Pandas! After a miraculous chemical explosion, they became smarter; and ev... |

## Oh FunctionsLet’s define functions f and g as: f(x) = 2 * ( f(x-1) + g(x-1) - 1 ) * ( f(x-1) + g(x-1) - 3 ) + 12... |

## Largest PrimeA positive integer number n is called a prime number, if it is only divisible by 1 and n itself, whe... |

## Correct the SieveSieve of Eratosthenes is a fast algorithm for finding prime numbers in larger ranges. According to W... |

## The Game Is Back OnMoriarty is bored again. When he gets bored, the only thing he wants to do is play with Sherlock. So... |

## Christmas TreeProfessor Rio has an amazing Christmas tree. Unlike other trees, this Christmas tree has some specia... |

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

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.