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

## 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... |

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

## Birthday SurpriseAdnan bhai, Priyom dada and Shuvo bhai are the members of MU_Kheloars. They recently got graduated a... |

## Magic NumberJack loves to play with numbers. One day, while he was playing with numbers he found something inter... |

## GCD Plus LCMIn this problem you will be given two integers aaa, bbb. You have to answer if GCD(a,b)+LCM(a,b)=a+b... |

## Unique ReliefThanos has now figured out how to visit all the houses in the flood-affected area. However, now he h... |

## Phi Numbers in Range!In number theory, Euler’s phi function, denoted as ϕ(n), is an arithmetic function which counts the ... |

## A GRE Themed Contest ProblemSadman and Najkin were solving a GRE math problem, Rejbah another friend of theirs listened to that ... |

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

## 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 PhiThe Great Khami is learning Number Theory. He is very excited to know that Euler's Totient Function ... |

## Exponential GrowthYou will be given two integers X and N, you have to calculate XN modulo 1000000007. |

## Mystery of FibonacciFibonacci sequence is a recursive sequence that depends on the following definition: Fib(N) = Fib(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... |

## Tree BusinessTo become economically stable, Saturn has come up with a new kind of business, tree business. At fir... |

## Hange and Her GearHange has developed a special gear to attack the Cart Titan. The gear is a round, disc-like object. ... |

## Omae Wa Mou ShindeiruItachi and Sasuke are trying to beat Kabuto, the caster of an awesome magical spell (or you can say ... |

## ModuloLet's get straight into the problem. In ths problem, here will be multiple test cases. In each test ... |

## Day-Month-YearMeena is a talented girl in her class. She likes to brainstorm in her leisure times. One day, she wa... |

## Admission GiftDuring admission exams in the city of RR (Royal Royal city), the students of RR University of Engine... |

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

## Is Bita Happy?Bita has learned bitwise-operations recently. She is doing some experiments with these operations no... |

## Solve This Giveaway Problem FirstThis problem is straightforward and easy. You will be given two integers N, P and a list L of positi... |

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.