At the table are you, your roommate, and two stacks of pancakes, of height m and n. You and she, in...

Question

At the table are you, your roommate, and two stacks of pancakes, of height m and n. You and she, in turn, must eat from the larger stack a non-zero multiple of the number of pancakes in the smaller stack. The bottom pancake of each stack is soggy, and thus whoever first finishes a stack is the loser.
For which pairs (m,n) do you, who happen to be playing first, have a winning strategy?

I need an r code program that solves this

Anandkumar · Accepted Answer

R programming:
PancakesLeft = readline(prompt = "How many Pancakes do you want to remove?");
PancakesLeft = as.integer(PancakesLeft);
Pancake_stack2 = readline(prompt = "Second pancake stack size?");
Pancake_stack2 = as.integer(Pancake_stack2);
PancakesToRemove = 0
userTurn  0)
{
while(userTurn == TRUE & PancakesLeft > 0)
{
PancakesToRemove = readline(prompt = "How many Pancakes do you want to remove?");
PancakesToRemove = as.integer(PancakesToRemove);

At the table are you, your roommate, and two stacks of pancakes, of height m and n. You and she, in turn, must eat from the larger stack a non-zero multiple of the number of pancakes in the smaller...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment