Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@Rajpra786 | 203 |

Complete Leaderboard |

A number is called faithful if you can write it as the sum of distinct powers of 7.

**e.g., ** 2457 = 7 + 7^{2} + 7^{4 . }If we order all the faithful numbers, we get the sequence 1 = 7^{0}, 7 = 7^{1}, 8 = 7^{0} + 7^{1}, 49 = 7^{2}, 50 = 7^{0} + 7^{2} . . . and so on.

Given some value of **N**, you have to find the **N'th** faithful number.

**Example 1:**

Input: N =3Output:8Explanation:8 is the 3rd Faithful number.

**Example 2:**

Input: N =7Output:57Explanation:57 is the 7th Faithful number.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **nthFaithfulNum()** which takes an Integer N as input and returns the answer.

**Expected Time Complexity:** O(log(N))

**Expected Auxiliary Space:** O(log(N))

**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
Faithful Numbers

...