5 kyu
When The Sum of The Divisors Is A Multiple Of The Prime Factors Sum
226 of 448raulbc777
Loading description...
Mathematics
Algorithms
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
Thanks for the kata, very good to practice various concepts.
A very good Kata. Thanks to author!
Hi all uhm i am seeking some hints here as my code runs out of time So i take it i'd need to use an efficient algo to find the prime factors, and once i have the prime factors i can then generate divisors out of prime factors,. Sort of two loops,where the first one is 'expensive' and the second one should be a 'small one' Giving my code is runnign out of time i am guessing my prime factorization code is deficient... is there a formula somewhere to find prime factors? Kind regars Marco
This comment has been hidden.
Time: 11926ms That was a close one, i liked it
This comment has been hidden.
I would not do that. There aren't that many values, and they can be compressed to take even less space. This limit would start to hurt plain solutions from passing.
Ok..
Performance. Could use a performance tag. My original solution could handle a range of about 2000 in less than a second but couldn't pass the final tests. JavaScript.
Ruby: One parameter is missing in initial code.
.
I just wanted to mention that this task can be solved with shell script, have entered a sulution in the comment to this comment :)
This comment has been hidden.
In that case, you could publish Shell translation :P
CW does not support Python 2 anymore, so the code for compatibility with Python 2 in tests and solution can be removed.
fork
Self-approved or approved by someone
Hello in the description below
The prime factors of 12 are 2 and 3. Why does the example say 2 + 2 + 3?
Hi @AlexDRichards - I just solved this kata to see; the answer is that we are considering prime factors with multiplicity.
So for example,
n = 8 = 2*2*2has only2as a prime factor, but with multiplicity 3, so its PrimeFactorsSum(pfs) according to kata requirements is2+2+2 = 6.For
n = 12 = 2*2*3we get2+2+3 = 7etc.Why for values from 440 to 543 number 441 not in result, expected - 470, 476, 480, 506, 510, 527, 531? For 441 primes - 3, 3, 7, 7, sum - 20, divisors - 1, 3, 7, 9, 49, 63, 147, 441, sum - 720.
720/20 = 36.
You forgot 21 in the list of divisors.
Thanks.
Description should mention that the maximum lower limit is
11060whereas maximum upper limit is15600Should also be language-agnostic
Node 18. should be enabled
Ruby unnecessary logs should be removed
Initial solution is missing one parameter
Random tests should generate up to
15600for maximum limit, currently it's14600.
Rust translation
Approved this one, too
Thanks!
Approved. Thanks
Go (maybe also other translation, both input arguments should be "inclusive") Your bisect takes (a-1 <= n <= b-1) in stead of (a <= n <= b)
@dfhwze : Can you confirm this fork is ok?: https://www.codewars.com/kumite/62ea84a670f3950058c3a9dc?sel=62eaa526888e170017f37e10
not yet ok:
This one should be ok: https://www.codewars.com/kumite/62eaa526888e170017f37e10?sel=62eaa74870f395002dc3af1e
I realize it may be a good idea to include tests where the bounds form part of the set (my JS solution must fail on edge cases)...
Go fixed, good idea to include sample tests for both edge cases.
Ok I'll fix the other translations, thanks.
All translations OK now
C# Translation
Approved! Thanks!
This comment has been hidden.
my mistake.. never mind..
Right.. my mistake
should be ds_multof_pfs(n_min, n_max)
Please use new python test framework.
In addition to that
parameter name should use
snake_caseUnecessary logs should be removed
I think most is done, plese re-raise for things I didnt address.
JS : the initial solution is missing its closing curly bracket
Done :)
Python 3 should be enabled.
Done.
Ruby translation submitted :) I did my best to keep the performance requirements close to JavaScript's.
Very nice problem, made me improved my solution many times!
It's a well balanced kata that allows non memoized/sieved solutions if they are optimised enough.