Back to Topic List
Hi Kevin,
thank you for the brand new problems :)
In this one, I am a bit confused, I think I understand the conditions, but even in case of a simple example my results and the expected answers are differ. E.g.:
Input: N = 3, x0 = 1130257
If I understand correctly, this means that the initial state of the passages are the following: SAFE, UNSAFE, SAFE, UNSAFE
So if the buttons that can be toggled are labeled as 1,2,3, we can make all the passages be safe by pushing the buttons in the following order: 2, 3
So my result would be "Y", but the expected asnwer in this case is "N".
Also the example in the description gives me different result which is "YNNYNY" instead of the given answer ("YNYNYN").
Do I miss something or misunderstand?
Thank you in advance.
Furthermore, If I am right, we can [...], therefore the logic would be simple:
If the [...] is [...], then we cannot [...].
Beacuse [...].
Hello Adam! It's great to hear from you again!
Your approach should work! I realize now that there was a bug in the solver function which always registered the final door
as initially safe, regardless of the final LCG result. So about 50% of the
"expected" answer string would've been wrong... should be fixed now! I also modified the example input numbers a bit so that
the answer string of YNYNYN is now accurate.
And forgive me for "redacting" some of your previous post, just to prevent any solutions being given away :)
I'm also in the process of working on the "2d" variant of this problem, which should be ready soon!
Super, thank you, now my solution has been accepted :)
Of course you can hide any possible hint in any of my post, I forgot to do that. I think that post can be entirely removed.
I'm looking forward to that second version :)