Narcissistic Number
Given an integer n, return whether it is equal to the sum of its own digits raised to the power of the number of digits.
https://binarysearch.com/problems/Narcissistic-Number
ExamplesPermalink
Example 1Permalink
Input
- n =
153
Output
- answer =
True
Explanation
153 = 1 ** 3 + 5 ** 3 + 3 ** 3
SolutionPermalink
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| bool solve(int n) | |
| { | |
| int nDigits = to_string(n).length(); | |
| int running = 0; | |
| int oriN = n; | |
| while (n > 0) | |
| { | |
| running += pow(n % 10, nDigits); | |
| n /= 10; | |
| } | |
| return running == oriN; | |
| } |
Leave a comment