Miss Toad and her frogsThe cage - a logic puzzleA blanket for my baby snakeAbducted and taken to which city?Sabotage at Sea - Cursed Cruise liner?Jack Sparrow and The quest for the missing Compass . Part 1Who's been stealing my H?Cheryl and her annoying birthdayTrick or Treating in Trutham-And-LyThe Prison Escape Pt. 1 (THE DOOR)Smart Students in a Murder Madhouse
Is there a nice way to assign std::minmax(a, b) to std::tie(a, b)?
Is this hogweed?
I hit a pipe with a mower and now it won't turn
Generate and graph the Recamán Sequence
Acceleration in Circular motion
Is it allowed to spend a night in the first entry country before moving to the main destination?
In the context of a differentiator circuit, what is a “current-sensing resistor”?
Is there a category where products don't exist because uniqueness fails?
Plotting the gradient descent
Golf the smallest circle!
"Plugged in" or "Plugged in in"
Averting Real Women Don’t Wear Dresses
Why does a brace command group need spaces after the opening brace in POSIX Shell Grammar?
Procedurally generate regions on island
Most importants new papers in computational complexity
The Confused Alien
Can you sign using a digital signature itself?
Do space suits measure "methane" levels or other biological gases?
How to formulate maximum function in a constraint?
Symbol for "not absolutely continuous" in Latex
Was it really unprofessional of me to leave without asking for a raise first?
What's the safest way to inform a new user of their password on my web site?
What does Mildred mean by this line in Three Billboards Outside Ebbing, Missouri?
Using aluminium busbar/cables in an aircraft instead of copper
Miss Toad and her frogs
The cage - a logic puzzleA blanket for my baby snakeAbducted and taken to which city?Sabotage at Sea - Cursed Cruise liner?Jack Sparrow and The quest for the missing Compass . Part 1Who's been stealing my H?Cheryl and her annoying birthdayTrick or Treating in Trutham-And-LyThe Prison Escape Pt. 1 (THE DOOR)Smart Students in a Murder Madhouse
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
Miss Toad owns a lot of frogs. These frogs are all looking the same, but they can be either mad or nicely.
If a mad frog is in a room with 3 nicely frogs, then he turns red, because he is ashamed.
If a nicely frog is in a room with 3 mad frogs, then he also turns mad.
For test purposes, Miss Toad puts 3 frogs in a room.
Then she places the 4th frog also there, waits a moment, and takes away the first frog. Then she places the 5th frog also there, waits a moment, and takes away the second frog. And so on.
When she's placing the 2012th frog, it's the first time a frog in the room turns red.
Which of the following frogs could be mad from the beginning?
A) 1 and 2011.
B) 2 and 2010.
C) 3 and 2009.
D) 4 and 2012.
E) 2 and 2011.
F) I hate this riddle.
logical-deduction
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Miss Toad owns a lot of frogs. These frogs are all looking the same, but they can be either mad or nicely.
If a mad frog is in a room with 3 nicely frogs, then he turns red, because he is ashamed.
If a nicely frog is in a room with 3 mad frogs, then he also turns mad.
For test purposes, Miss Toad puts 3 frogs in a room.
Then she places the 4th frog also there, waits a moment, and takes away the first frog. Then she places the 5th frog also there, waits a moment, and takes away the second frog. And so on.
When she's placing the 2012th frog, it's the first time a frog in the room turns red.
Which of the following frogs could be mad from the beginning?
A) 1 and 2011.
B) 2 and 2010.
C) 3 and 2009.
D) 4 and 2012.
E) 2 and 2011.
F) I hate this riddle.
logical-deduction
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
5
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
1
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago
add a comment |
$begingroup$
Miss Toad owns a lot of frogs. These frogs are all looking the same, but they can be either mad or nicely.
If a mad frog is in a room with 3 nicely frogs, then he turns red, because he is ashamed.
If a nicely frog is in a room with 3 mad frogs, then he also turns mad.
For test purposes, Miss Toad puts 3 frogs in a room.
Then she places the 4th frog also there, waits a moment, and takes away the first frog. Then she places the 5th frog also there, waits a moment, and takes away the second frog. And so on.
When she's placing the 2012th frog, it's the first time a frog in the room turns red.
Which of the following frogs could be mad from the beginning?
A) 1 and 2011.
B) 2 and 2010.
C) 3 and 2009.
D) 4 and 2012.
E) 2 and 2011.
F) I hate this riddle.
logical-deduction
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Miss Toad owns a lot of frogs. These frogs are all looking the same, but they can be either mad or nicely.
If a mad frog is in a room with 3 nicely frogs, then he turns red, because he is ashamed.
If a nicely frog is in a room with 3 mad frogs, then he also turns mad.
For test purposes, Miss Toad puts 3 frogs in a room.
Then she places the 4th frog also there, waits a moment, and takes away the first frog. Then she places the 5th frog also there, waits a moment, and takes away the second frog. And so on.
When she's placing the 2012th frog, it's the first time a frog in the room turns red.
Which of the following frogs could be mad from the beginning?
A) 1 and 2011.
B) 2 and 2010.
C) 3 and 2009.
D) 4 and 2012.
E) 2 and 2011.
F) I hate this riddle.
logical-deduction
logical-deduction
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 6 hours ago
Rand al'Thor
74k15 gold badges244 silver badges490 bronze badges
74k15 gold badges244 silver badges490 bronze badges
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
MattiMatti
4511 silver badge8 bronze badges
4511 silver badge8 bronze badges
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Matti is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
5
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
1
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago
add a comment |
5
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
1
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago
5
5
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
1
1
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Initial information, re-parsed
We have a sequence of length 2012, in which each term is either N (nicely) or A (always mad) or C (mad converted from nicely). Among terms 2009, 2010, 2011, 2012, three are N and the fourth is not, and that's never happened with any previous set of four consecutive terms.
Important deductions
If any term is C, then
it is part of a sequence of four consecutive mad (not N) terms, so everything afterwards will also be mad. This contradicts what happens at the 2012th term, so C never occurs. For the same reason, we can never have three consecutive mad terms.
If we have three consecutive N, then
everything afterwards must be N until the red incident at 2012. That's not compatible with any of the five stated options, so let's rule it out.
Now we know that every sequence of four consecutive terms (up to 2009, 2010, 2011, 2012) must contain
two N, two A.
That means there's a pattern of invariance, namely
every term is the same as the one four before it. So 2009, 2010, 2011 are the same as 1, 2, 3, and at most one of these three is mad; while 2012 is the opposite of 2008, which is the same as 4.
Among the options given, that leaves only
option B as the correct answer.
Original answer (includes all possibilities for mad/nicely sequences)
If 2012 is not N, then
2012 is A, and every term before it must be N (otherwise we'd have had a red incident before). So option D is impossible.
If 2011 is not N, then
2011 is A and 2009, 2010, 2012 are N, so 2008 can't be N, so 2007 can't be N, so 2006 must be N, so 2005 must be N.
05 06 07 08 09 10 11 12N N mad mad N N mad N
This pattern must keep on repeating all the way back, so everything congruent to 1 or 2 modulo 4 is nicely while everything congruent to 0 or 3 modulo 4 is mad (therefore A). In particular, 1 and 2 are N, so options A and E are impossible.If 2010 is not N, then
2010 is A and 2009, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 can't be N, so 2005 must be N.
05 06 07 08 09 10 11 12N mad N mad N mad N N
This pattern must keep on repeating all the way back, so everything odd is nicely while everything even is mad (therefore A). In particular, 2 is A, so option B is possible.If 2009 is not N, then
2009 is mad and 2010, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 must be N, so 2005 can't be N.
05 06 07 08 09 10 11 12mad N N mad mad N N N
This pattern must keep on repeating all the way back, so everything congruent to 2 or 3 modulo 4 is nicely while everything congruent to 0 or 1 modulo 4 is mad (therefore A). In particular, 3 is N, so option C is impossible.
Final answer
Option B is the only one which can be true.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "559"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Matti is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f85460%2fmiss-toad-and-her-frogs%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Initial information, re-parsed
We have a sequence of length 2012, in which each term is either N (nicely) or A (always mad) or C (mad converted from nicely). Among terms 2009, 2010, 2011, 2012, three are N and the fourth is not, and that's never happened with any previous set of four consecutive terms.
Important deductions
If any term is C, then
it is part of a sequence of four consecutive mad (not N) terms, so everything afterwards will also be mad. This contradicts what happens at the 2012th term, so C never occurs. For the same reason, we can never have three consecutive mad terms.
If we have three consecutive N, then
everything afterwards must be N until the red incident at 2012. That's not compatible with any of the five stated options, so let's rule it out.
Now we know that every sequence of four consecutive terms (up to 2009, 2010, 2011, 2012) must contain
two N, two A.
That means there's a pattern of invariance, namely
every term is the same as the one four before it. So 2009, 2010, 2011 are the same as 1, 2, 3, and at most one of these three is mad; while 2012 is the opposite of 2008, which is the same as 4.
Among the options given, that leaves only
option B as the correct answer.
Original answer (includes all possibilities for mad/nicely sequences)
If 2012 is not N, then
2012 is A, and every term before it must be N (otherwise we'd have had a red incident before). So option D is impossible.
If 2011 is not N, then
2011 is A and 2009, 2010, 2012 are N, so 2008 can't be N, so 2007 can't be N, so 2006 must be N, so 2005 must be N.
05 06 07 08 09 10 11 12N N mad mad N N mad N
This pattern must keep on repeating all the way back, so everything congruent to 1 or 2 modulo 4 is nicely while everything congruent to 0 or 3 modulo 4 is mad (therefore A). In particular, 1 and 2 are N, so options A and E are impossible.If 2010 is not N, then
2010 is A and 2009, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 can't be N, so 2005 must be N.
05 06 07 08 09 10 11 12N mad N mad N mad N N
This pattern must keep on repeating all the way back, so everything odd is nicely while everything even is mad (therefore A). In particular, 2 is A, so option B is possible.If 2009 is not N, then
2009 is mad and 2010, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 must be N, so 2005 can't be N.
05 06 07 08 09 10 11 12mad N N mad mad N N N
This pattern must keep on repeating all the way back, so everything congruent to 2 or 3 modulo 4 is nicely while everything congruent to 0 or 1 modulo 4 is mad (therefore A). In particular, 3 is N, so option C is impossible.
Final answer
Option B is the only one which can be true.
$endgroup$
add a comment |
$begingroup$
Initial information, re-parsed
We have a sequence of length 2012, in which each term is either N (nicely) or A (always mad) or C (mad converted from nicely). Among terms 2009, 2010, 2011, 2012, three are N and the fourth is not, and that's never happened with any previous set of four consecutive terms.
Important deductions
If any term is C, then
it is part of a sequence of four consecutive mad (not N) terms, so everything afterwards will also be mad. This contradicts what happens at the 2012th term, so C never occurs. For the same reason, we can never have three consecutive mad terms.
If we have three consecutive N, then
everything afterwards must be N until the red incident at 2012. That's not compatible with any of the five stated options, so let's rule it out.
Now we know that every sequence of four consecutive terms (up to 2009, 2010, 2011, 2012) must contain
two N, two A.
That means there's a pattern of invariance, namely
every term is the same as the one four before it. So 2009, 2010, 2011 are the same as 1, 2, 3, and at most one of these three is mad; while 2012 is the opposite of 2008, which is the same as 4.
Among the options given, that leaves only
option B as the correct answer.
Original answer (includes all possibilities for mad/nicely sequences)
If 2012 is not N, then
2012 is A, and every term before it must be N (otherwise we'd have had a red incident before). So option D is impossible.
If 2011 is not N, then
2011 is A and 2009, 2010, 2012 are N, so 2008 can't be N, so 2007 can't be N, so 2006 must be N, so 2005 must be N.
05 06 07 08 09 10 11 12N N mad mad N N mad N
This pattern must keep on repeating all the way back, so everything congruent to 1 or 2 modulo 4 is nicely while everything congruent to 0 or 3 modulo 4 is mad (therefore A). In particular, 1 and 2 are N, so options A and E are impossible.If 2010 is not N, then
2010 is A and 2009, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 can't be N, so 2005 must be N.
05 06 07 08 09 10 11 12N mad N mad N mad N N
This pattern must keep on repeating all the way back, so everything odd is nicely while everything even is mad (therefore A). In particular, 2 is A, so option B is possible.If 2009 is not N, then
2009 is mad and 2010, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 must be N, so 2005 can't be N.
05 06 07 08 09 10 11 12mad N N mad mad N N N
This pattern must keep on repeating all the way back, so everything congruent to 2 or 3 modulo 4 is nicely while everything congruent to 0 or 1 modulo 4 is mad (therefore A). In particular, 3 is N, so option C is impossible.
Final answer
Option B is the only one which can be true.
$endgroup$
add a comment |
$begingroup$
Initial information, re-parsed
We have a sequence of length 2012, in which each term is either N (nicely) or A (always mad) or C (mad converted from nicely). Among terms 2009, 2010, 2011, 2012, three are N and the fourth is not, and that's never happened with any previous set of four consecutive terms.
Important deductions
If any term is C, then
it is part of a sequence of four consecutive mad (not N) terms, so everything afterwards will also be mad. This contradicts what happens at the 2012th term, so C never occurs. For the same reason, we can never have three consecutive mad terms.
If we have three consecutive N, then
everything afterwards must be N until the red incident at 2012. That's not compatible with any of the five stated options, so let's rule it out.
Now we know that every sequence of four consecutive terms (up to 2009, 2010, 2011, 2012) must contain
two N, two A.
That means there's a pattern of invariance, namely
every term is the same as the one four before it. So 2009, 2010, 2011 are the same as 1, 2, 3, and at most one of these three is mad; while 2012 is the opposite of 2008, which is the same as 4.
Among the options given, that leaves only
option B as the correct answer.
Original answer (includes all possibilities for mad/nicely sequences)
If 2012 is not N, then
2012 is A, and every term before it must be N (otherwise we'd have had a red incident before). So option D is impossible.
If 2011 is not N, then
2011 is A and 2009, 2010, 2012 are N, so 2008 can't be N, so 2007 can't be N, so 2006 must be N, so 2005 must be N.
05 06 07 08 09 10 11 12N N mad mad N N mad N
This pattern must keep on repeating all the way back, so everything congruent to 1 or 2 modulo 4 is nicely while everything congruent to 0 or 3 modulo 4 is mad (therefore A). In particular, 1 and 2 are N, so options A and E are impossible.If 2010 is not N, then
2010 is A and 2009, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 can't be N, so 2005 must be N.
05 06 07 08 09 10 11 12N mad N mad N mad N N
This pattern must keep on repeating all the way back, so everything odd is nicely while everything even is mad (therefore A). In particular, 2 is A, so option B is possible.If 2009 is not N, then
2009 is mad and 2010, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 must be N, so 2005 can't be N.
05 06 07 08 09 10 11 12mad N N mad mad N N N
This pattern must keep on repeating all the way back, so everything congruent to 2 or 3 modulo 4 is nicely while everything congruent to 0 or 1 modulo 4 is mad (therefore A). In particular, 3 is N, so option C is impossible.
Final answer
Option B is the only one which can be true.
$endgroup$
Initial information, re-parsed
We have a sequence of length 2012, in which each term is either N (nicely) or A (always mad) or C (mad converted from nicely). Among terms 2009, 2010, 2011, 2012, three are N and the fourth is not, and that's never happened with any previous set of four consecutive terms.
Important deductions
If any term is C, then
it is part of a sequence of four consecutive mad (not N) terms, so everything afterwards will also be mad. This contradicts what happens at the 2012th term, so C never occurs. For the same reason, we can never have three consecutive mad terms.
If we have three consecutive N, then
everything afterwards must be N until the red incident at 2012. That's not compatible with any of the five stated options, so let's rule it out.
Now we know that every sequence of four consecutive terms (up to 2009, 2010, 2011, 2012) must contain
two N, two A.
That means there's a pattern of invariance, namely
every term is the same as the one four before it. So 2009, 2010, 2011 are the same as 1, 2, 3, and at most one of these three is mad; while 2012 is the opposite of 2008, which is the same as 4.
Among the options given, that leaves only
option B as the correct answer.
Original answer (includes all possibilities for mad/nicely sequences)
If 2012 is not N, then
2012 is A, and every term before it must be N (otherwise we'd have had a red incident before). So option D is impossible.
If 2011 is not N, then
2011 is A and 2009, 2010, 2012 are N, so 2008 can't be N, so 2007 can't be N, so 2006 must be N, so 2005 must be N.
05 06 07 08 09 10 11 12N N mad mad N N mad N
This pattern must keep on repeating all the way back, so everything congruent to 1 or 2 modulo 4 is nicely while everything congruent to 0 or 3 modulo 4 is mad (therefore A). In particular, 1 and 2 are N, so options A and E are impossible.If 2010 is not N, then
2010 is A and 2009, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 can't be N, so 2005 must be N.
05 06 07 08 09 10 11 12N mad N mad N mad N N
This pattern must keep on repeating all the way back, so everything odd is nicely while everything even is mad (therefore A). In particular, 2 is A, so option B is possible.If 2009 is not N, then
2009 is mad and 2010, 2011, 2012 are N, so 2008 can't be N, so 2007 must be N, so 2006 must be N, so 2005 can't be N.
05 06 07 08 09 10 11 12mad N N mad mad N N N
This pattern must keep on repeating all the way back, so everything congruent to 2 or 3 modulo 4 is nicely while everything congruent to 0 or 1 modulo 4 is mad (therefore A). In particular, 3 is N, so option C is impossible.
Final answer
Option B is the only one which can be true.
edited 7 hours ago
answered 7 hours ago
Rand al'ThorRand al'Thor
74k15 gold badges244 silver badges490 bronze badges
74k15 gold badges244 silver badges490 bronze badges
add a comment |
add a comment |
Matti is a new contributor. Be nice, and check out our Code of Conduct.
Matti is a new contributor. Be nice, and check out our Code of Conduct.
Matti is a new contributor. Be nice, and check out our Code of Conduct.
Matti is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f85460%2fmiss-toad-and-her-frogs%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
5
$begingroup$
First thought: oh, this looks easy! After ten minutes: definitely option F.
$endgroup$
– Rand al'Thor
7 hours ago
1
$begingroup$
Great puzzle! In the end it is easy, but only once you look at it in the right way.
$endgroup$
– Rand al'Thor
7 hours ago
$begingroup$
Thank you very much !!!!
$endgroup$
– Matti
4 hours ago