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

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

Nth PrimeIn this problem, you will have to print the nth prime number. The first few prime numbers are given...

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

A Lack of Common DivisorsGiven a positive integer N, determine how many of the integers between 1 and N are coprime with N. ...

Life of Phi IIYou will be given two integers n and m where GCD(n, m) = 1. You have to tell that how many numbers a...

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 coprime with 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 CoPrimeTwo numbers A and B are called coprime 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...

CoPrime Enemy PairTwo integers A and B are known as coprime 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(x1) + g(x1)  1 ) * ( f(x1) + g(x1)  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...
