Journey of CP with DP: SPOJ

Showing posts with label SPOJ. Show all posts

How To Approach The Binary Search Problems

How can we know, that a problem can be solve using Binary Search? ☹️ If a problem satisfies points which are mentioned below, then a p...

Source of Question First of all the question is bit confusing , so basically question wants to say that , you have to find minimum re...

SPOJ : Question Given a range [n , m], you have to print all the prime numbers between n and m both inclusively. Hint 1 : Sieve o...