Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5704 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3523 |

@mantu_singh | 3510 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1134 |

@gurshehzadsingh | 676 |

@nithinreddy3210 | 610 |

@Run_for_life | 570 |

@divyagupta221100 | 557 |

@jha8768 | 553 |

@AkashLahoty | 537 |

@aayushdesai01 | 526 |

@riyakumaribkj | 524 |

@amansinha74458 | 503 |

@dreamerdreamer | 488 |

Complete Leaderboard |

Given X and Y as the GCD and LCM of two numbers A and B. Find all possible pairs of (A,B).

**Note:** (a, b) and (b, a) are considered as two different pairs.

**Example 1:**

**Input:** x = 2, y = 12
**Output:** 4
**Explaination:** The pairs are (2, 12),
(4, 6), (6, 4) and (12, 2).

**Example 2:**

**Input:** x = 3, y = 6
**Output:** 2
**Explaination:** The pairs are (3, 6) and
(6, 3).

**Example 3:**

**Input:** x = 6, y = 4
**Output:** 0
**Explaination:** There is no such pair such
that gcd is 6 and lcm is 4.

**Your Task:**

You do not need to read input or print anything. Your task is to complete the function **pairCount()** which takes x and y as input parameters and returns the number of possibe pairs.

**Expected Time Complexity:** O(sqrt(N)*LogN) [N is maximum of x and y]

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 ≤ x, y ≤ 10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Possible Pairs

...