Verify if there exists some constructive integers X and Y such that P^X is the same as Q^Y

Given two integers P and Q, the duty is to examine whether or not a pair (P, Q) is equal or not, and a pair is claimed to be equal if there exist some constructive integers X and Y such that P^X = Q^Y.

Examples:

Enter: P = 16 , Q = 4
Output: Sure

Rationalization: Let X = 2 and Y = 4. Thus, P^X = 16² = 256 and Q^Y = 4⁴ = 256 . Thus, the pair (16,4) is equal.

Enter: P = 12 , Q = 24
Output: No

Strategy: The issue will be solved primarily based on the next remark:

For P^X = Q^Y to be true for some integer pair (X, Y),  any one of many under instances should be true:

1. There should exist some integer Okay, such that 
2. X = Y = 0

Now to implement this, under algorithm can be utilized:

• Discover most(max) and minimal(min) quantity for 2 integer.
• Iterate a loop and examine if max and min is equal or max is divisible by min, then pair of integer is equal and break from the loop.
• In any other case, pair of integer will not be equal.

 Under is the implementation of the above strategy.

Time Complexity: O(N)
Auxiliary House: O(1)