-
-
Notifications
You must be signed in to change notification settings - Fork 5.8k
Problem30 #1546
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Open
Problem30 #1546
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,38 @@ | ||
| /** | ||
| * The function `digitnPowers` calculates the sum of all numbers that can be expressed as the sum of | ||
| * their digits raised to the power of `n`. | ||
| * @param n - The parameter `n` represents the number of digits in each number that we will be | ||
| * considering. | ||
| * @returns The function `digitnPowers` returns the sum of all numbers that can be expressed as the sum | ||
| * of their digits raised to the power of `n`. | ||
| */ | ||
| function digitnPowers(n) { | ||
| let max = parseInt(Array(n).fill(9).join('')); | ||
| let s = 0; | ||
| for (let i = 2; i <= 355000; i++) { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Explain the upper limit please. |
||
| s += decomposition(i, n); | ||
| } | ||
| return s; | ||
| } | ||
|
|
||
| /** | ||
| * The function "decomposition" checks if the sum of the digits of a number raised to a given power is | ||
| * equal to the original number. | ||
| * @param n - The number to be decomposed into its digits and checked for a specific condition. | ||
| * @param i - The parameter `i` represents the power to which each digit of the number `n` is raised | ||
| * before summing them up. | ||
| * @returns the sum of the digits of the number `n` raised to the power of `i`, if the sum is equal to | ||
| * the original number `n`. Otherwise, it returns 0. | ||
| */ | ||
| function decomposition(n, i) { | ||
| let arr = []; | ||
| let temp = n; | ||
| while (n !== 0) { | ||
| arr.push(n % 10); | ||
| n = Math.floor(n / 10); | ||
| } | ||
| let somme = arr.reduce((acc, el) => acc + Math.pow(el, i), 0); | ||
| return somme === temp ? somme : 0; | ||
| } | ||
|
|
||
| console.log(digitnPowers(5)); | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Use a proper test instead. |
||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.