Send your feedback or ask for help here!
Does anyone have a hint on what the Optional S Validator might roughly be doing? I just can’t think of any way how the S can be anything but ignorable noise but apparently, there is some edge case where the S matters (guessing based on the name of the validator).
Just ignore the Ss, really.
Great puzzle!! I had a lot of fun solving it.
I think the difficulty level should be set to medium, for me the puzzle was quite difficult compared to other puzzles at the same difficulty level.
Also, the success rates in the community are pretty low which shows that the puzzle is more difficult than the other puzzles at the same difficulty level.
The way I solved the puzzle:
I implemented a tree structure and figured out how to calculate the number of combinations.
Thanks your comments. After many people tried hands on it now it has evidence showing it is relatively more difficult. I’m not sure is it a good idea to move puzzles around as desired.
Difficulty is in the eye of the beholders.
Before getting enough feedback from the general community, the difficulty level assigned is just an estimate. Sometimes I cannot predict what difficulty can be faced by coders because I already know some solutions and I know the coding part is not difficult.
At the same time, I cannot predict what innovative approaches can be invented by coders. Your “Tree” approach is something I did not think of. Very creative. Well done.
first in rust
i stored all the reserved keyword including the S in a vector.
replace every S by 1.
replace consecutive cells of the form : “if x else y endif” by x+y. and every two consecutive
numbers x, y by one cell : x*y.
break when the length of the vector <= 1
the length of the vector is the answer
This is another deceptively tricky “easy” puzzle in that it seems simple at first but the more your think about it you can slip down a path of complexity that makes it seem harder than it actually is. Some of the published solutions are quite complex and I think they have done it the hard way. The best solutions are quite simple and either use recursion or a stack. I started with recursion but started slipping down the complexity rabbit hole. I then stopped and came up with a simple stack solution. Once you see how simple it can be you realize why it’s classified as “easy”.
A good account of your experience, including how to understand “Simple” and “Difficult”, how to drive into a wrong way and pull back, how to progress to make a much better result.
So we should never laugh at someone who wrote 30 lines in the Descent puzzle but still could not solve it. We were all newbies at some point of time.
This puzzle was really interesting, what we use to solve it is categorized as easy and understand what we need to do is easy too. The problem is that even if we understand its structure, it can be tricky to implement a solution if we don’t have the right reasoning! I had less problems to solve some medium problems!
I suppose that it is more medium than easy (as we can see with the success rate) but it was a really good problem! Thanks for it x)
Nice puzzle, I came up with a C++ recursive solution that passes all the tests.
But validators 3, 4 and 6 fail and I have to admit I have no idea why…
Do you have any clue ?
The very low success rate (2X%) so far indicates that this simple puzzle is not simple to the majority. So I moved it from Easy to Medium.
Having a problem with validator 3? This is the easiest test.
Review your assumptions about statement “S”. Only trust the rules explicitly told in the statement. Keep high alert on any untold “common sense” rules which could be false assumptions.
After all, thanks your support.
That is weird, I already used to ignore anything not in [“if”, “else”, “endif”], but the key was to ignore them while constructing the vector of commands from the inputs.
I probably miss something simple here. ^^’
Anyway thanks for the puzzle and for your quick answer !