Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given a number and its reverse. Find that number raised to the power of its own reverse.

**Note:** As answers can be very large, print the result modulo **10 ^{9} + 7**.

**Example 1:**

**Input:
**N = 2
**Output: **4**
Explanation: **The reverse of 2 is 2
and after raising power of 2 by 2
we get 4 which gives remainder as
4 by dividing 1000000007.

**Example 2:**

**Input:
**N = 12
**Output: **864354781**
Explanation: **The reverse of 12 is 21
and 12^{21 }, when divided by 1000000007
gives remainder as 864354781.

**Your Task:**

You don't need to read input or print anything. You just need to complete the **function pow() **that takes two parameters **N and R** denoting the input number and its reverse and returns **power **of (N to R)mod(**10 ^{9} + 7**).

**Expected Time Complexity: **O(LogN).

**Expected Auxiliary Space: **O(LogN).

**Constraints:**

1 <= N <= 10^{5}

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?

Yes
Power Of Numbers

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.