Given two integers P and Q, the duty is to test whether or not a pair (P, Q) is equal or not, and a pair is alleged 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
Clarification: Let X = 2 and Y = 4. Thus, P^{X} = 16^{2} = 256 and Q^{Y} = 4^{4} = 256 . Thus, the pair (16,4) is equal.Enter: P = 12 , Q = 24
Output: No
Method: The issue will be solved primarily based on the next statement:
For P^{X }= Q^{Y }to be true for some integer pair (X, Y), any one of many under circumstances should be true:
 There should exist some integer Okay, such that
 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 test 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 just isn’t equal.
Under is the implementation of the above strategy.
Java

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