5 kyu
The Sum and The Rest of Certain Pairs of Numbers have to be Perfect Squares (more Challenging)
92 of 189raulbc777
Loading description...
Algorithms
Mathematics
Data Structures
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.
Reraising as issue: the description is missing at the very least 50% of the required informations.
Cheers
Please review: C++ Translation
Approved
This was WAY more difficult than any other 5 kyu I've solved before. Great problem! I spent days refactoring and optimizing to get under 12000 ms. Final time 11951 lol.
I'd like to point out that the description states that m1 < m2 < m3 etc. But it is not true, as seen in the test cases. The description should be changed to m1 <= m2 <= m3...
Best.
Hi @thomaslima. Thanks for your time solving the kata and for the feedback. After work I'll check the issue you pointed out. Thanks.
Thanks for the observation. Fixed!!
Hi,
the description of this version should work as a "stand alone": currently, to get what the task is, one has to go read the other description. => You should update this one with the relevant information.
cheers
Ok B4B. I'll try to make it more understandable by itself. Have a good day!
.
This comment has been hidden.
This comment has been hidden.
This comment has been hidden.
This comment has been hidden.
Nice kata!
I find limits are a bit low: a good algorithm can handle thousands of pairs with a limit under 2 ^ 32 with no problem.
You should also accept list of tuples and tuple of tuples in Python as comparisons between two answers will be faster and it is default structure when returning several values.
This comment has been hidden.
I've also found with greater upper limits, some solutions (cf. the first one I posted with only one loop) can miss pairs with same
bvalue and tests don't cover it ever.