Draft
Difference of two squares
Loading description...
Performance
Mathematics
View
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.
Anti-cheats are weak.
Why do you want to prohibit
gmpy2
? Is it really necessary?Also, this kata is not much different from "The smallest n such that n^n mod m = 0".
This comment has been hidden.
you should ban the module below
This comment has been hidden.
I completely unpublished this kata, because there is no point in making it I think but still thanks for telling me
Random test case input generation mechanism needs to be improved: for the biggest numbers (
> 10 ** 24
) they never have a prime factor bigger than 10000, so they can be solved by brute force, reducing the actual input range.This comment has been hidden.
Author solution is insufficient for the provided input range: e.g
2 ** 85
is within the input range, has less than 50 solutions, and yet will absolutely time out said solution.Either these highly composite numbers need to be handled explicitly, or the input range needs to be further restricted (e.g on maximum amount of prime factors).
This comment has been hidden.
Well, then your kata is clearly unsolvable with countless amounts of "edge case" inputs, which definitely shouldn't be allowed.
This comment has been hidden.
This comment has been hidden.
"only want the count" please thoroughly read first 3 lines of description
This comment has been hidden.
This comment has been hidden.
errr... What's the point of forbidding math!? Unless I'm missing something,this most likely means the overall task doesn't fit well with making a kata of it.
nothing really, I don't use it , but sure I am only gonna ban gmpy2
This comment has been hidden.
that's the point, otherwise , this kata is slightly harder version of this kata aslo very nice solution!