# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Sadman and Najkin were solving a GRE math problem, Rejbah another friend of theirs listened to that problem and told them that this problem could be modified to be used as a contest problem. So, here is the modified problem.

Given, two integers X and K, determine whether the number of unique prime factors of K*X is greater than the number of unique prime factors of X. Easy enough? Go for it.

‘*’ denotes multiplication of number K and X

The first line contains an integer **T** (1 ≤ T ≤ 10^{5}), denoting the number of test cases, for each test case two integers X and K are given, where **X** (X ≤ 10^{18}) is positive integer and **K** (K ≤ 10^{18}) is non-negative.

For each test case print one of these:

`<`

: if number of prime factors of X is less than number of prime factors of K*X`>`

: if number of prime factors of X is greater than number of prime factors of K*X`=`

: if number of prime factors of X is equal to number of prime factors of K*X

Input | Output |
---|---|

3 128 128 3 36 36 3 | = < = |

Special thanks to Md. Salman Estyak and Md. Ali Noor Jamil

57% Solution Ratio

PizzaLovers007Earliest,

RAKIBULHOSSAINFastest, 0.1s

FrdhsnLightest, 262 kB

FrdhsnShortest, 355B

Login to submit