Solution with 56 Bytes#8
Open
roland-schmitz wants to merge 10 commits into
Open
Conversation
Amazing. Saving you one more byte.
- 65 -> 64 - added contributor names
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This 56 byte solution Is by far not as readable as Svens solution. The reduce and the idea with the prime factors are from Udos solution. But I choose a different approach:
The reduce starts with 1 and is multiplied with 2 for numbers >= 25 and multiplied with 2 and 3 (=6) for numbers >= 30.
The reduce falls back to 1 if a number is smaller than 25 and 0 is not reached already.
If the reduce is once divisible by 864 which is 22222 * 333 it becomes 0 and does not change its value any more and true is returned.
864 can be interpreted as contains a sequence with 5 numbers >= 25 and at least 3 of them are >= 30.
Includes some improvements from Mathis Müller.