Click here to Skip to main content
14,768,075 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
Alice and Bob have 2 kinds of chocolates. There are A chocolates of the first type and B of the second type. The play a game according to following rules: they will pick some cholocates of type 1 and 2 turn by turn. In each turn one of the following valid moves can be done:
• Pick some chocolates of type 1
• Pick some chocolates of type 2
• Pick equal number of chocolates of type 1 and 2

They have to pick atleast one chocolate in each turn. Whoever makes the last move wins. Both Alice and Bob are very smart and choose optimally. However while telling
the rules of the competition, Alice cheated a bit to ensure that she wins the game by deciding wo will take the first move. Did Alice decide to go first?

If Alice go first then print "YES" otherwise "NO".

What I have tried:

I have tried to develop a optimal substructure but not quite sure that it is leads to correct solution. Can someone please help? For example, consider 1, 2 then in each of them Alice can't win if she starts first hence "NO".
Posted
Updated 4 days ago
v2
Comments
Richard MacCutchan 4 days ago
   
"If Alice go first then print "YES" otherwise "NO".
Not really much to do then.

1 solution

We are more than willing to help those that are stuck: but that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
   

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)




CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900