Given two integers p and q, the task is to find the smallest number K such that K % p = 0 and q % K = 0. If no such K is possible then print -1.
Input: p = 2, q = 8
2 % 2 = 0 and 8 % 2 = 0
Input: p = 5, q = 14
Approach: In order for K to be possible, q must be divisible by p.
- If q % p = 0 then print p
- Else print -1.
Below is the implementation of the above approach:
- Find the smallest number whose digits multiply to a given number n
- Find smallest permutation of given number
- Find the kth smallest number with sum of digits as m
- Given a number, find the next smallest palindrome
- Find smallest number n such that n XOR n+1 equals to given k.
- Find smallest positive number Y such that Bitwise AND of X and Y is Zero
- Find Nth smallest number that is divisible by 100 exactly K times
- Find the smallest number X such that X! contains at least Y trailing zeros.
- Find the k-th smallest divisor of a natural number N
- Find kth smallest number in range [1, n] when all the odd numbers are deleted
- Find the smallest positive number which can not be represented by given digits
- Find the smallest positive number missing from an unsorted array | Set 3
- Find smallest number with given number of digits and sum of digits under given constraints
- Find smallest number with given number of digits and sum of digits
- Smallest number dividing minimum number of elements in the Array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.