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.
Examples:
Input: p = 2, q = 8
Output: 2
2 % 2 = 0 and 8 % 2 = 0
Input: p = 5, q = 14
Output: -1
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:
C++
// C++ implementation of the approach#include <bits/stdc++.h>using namespace std;// Function to return the minimum// value K such that K % p = 0// and q % k = 0int getMinVal(int p, int q){ // If K is possible if (q % p == 0) return p; // No such K is possible return -1;}// Driver codeint main(){ int p = 24, q = 48; cout << getMinVal(p, q); return 0;} |
Java
// Java implementation of the approachimport java.io.*;class GFG{ // Function to return the minimum// value K such that K % p = 0// and q % k = 0static int getMinVal(int p, int q){ // If K is possible if (q % p == 0) return p; // No such K is possible return -1;}// Driver codepublic static void main (String[] args) { int p = 24, q = 48; System.out.println(getMinVal(p, q));}}// This code is contributed by jit_t. |
Python3
# Python3 implementation of the approach# Function to return the minimum # value K such that K % p = 0 # and q % k = 0def getMinVal(p, q): # If K is possible if q % p == 0: return p # No such K is possible return -1# Driver codep = 24; q = 48print(getMinVal(p, q))# This code is contributed# by Shrikant13 |
C#
// C# implementation of the approachusing System;class GFG{ // Function to return the minimum// value K such that K % p = 0// and q % k = 0static int getMinVal(int p, int q){ // If K is possible if (q % p == 0) return p; // No such K is possible return -1;}// Driver codepublic static void Main () { int p = 24, q = 48; Console.WriteLine(getMinVal(p, q));}}// This code is contributed // by Code_Mech. |
PHP
<?php// PHP implementation of the approach// Function to return the minimum// value K such that K % p = 0// and q % k = 0function getMinVal($p, $q){ // If K is possible if ($q % $p == 0) return $p; // No such K is possible return -1;}// Driver code$p = 24;$q = 48;echo getMinVal($p, $q);// This code is contributed by ajit.?> |
Javascript
<script>// Javascript implementation of the above approach // Function to return the minimum// value K such that K % p = 0// and q % k = 0function getMinVal(p, q){ // If K is possible if (q % p == 0) return p; // No such K is possible return -1;} // driver program let p = 24, q = 48; document.write(getMinVal(p, q)); </script> |
Output:
24
Time Complexity: O(1)
Auxiliary Space: O(1), since no extra space has been taken.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
