Question

There are total n number of Monkeys sitting on
the branches of a huge Tree. As travelers offer
Bananas and Peanuts, the Monkeys jump down
the Tree.
If every Monkey can eat k Bananas and
Peanuts. If Total m number of Bananas and p
number of Peanuts offered by Travelers,
calculate how many Monkeys remain on the
Tree after some of them jumped down to eat.
At a time, one Monkey gets down and finishes
eating and go to the other side of the road. The
Monkey who climbed down does not climb up
again after eating until the other Monkeys finish
eating
Monkey can either eat k Bananas orj Peanuts. If
for last Monkey there are less than k Bananas
left on the ground or less than j Peanuts left on
the ground, only that Monkey can eat
Bananas(<k) along with the Peanuts(j).
Write the code to take inputs as n, m, p, k, j and
return the number of Monkeys left on the Tree.
Where, n = Total number of Monkeys k=number of eatable bananas by a single monkey j= number of eatable peanuts by a single monkey m=total no of bananas p=totak no peanuts remembered that monkeys aleays eat bananas and peanuts, so there is no possibility of k and j having value 0​

Answer 1

Answer:

ᴛʜᴇʀᴇ ᴀʀᴇ ᴛᴏᴛᴀʟ ɴ ɴᴜᴍʙᴇʀ ᴏꜰ ᴍᴏɴᴋᴇyꜱ ꜱɪᴛᴛɪɴɢ ᴏɴ

ᴛʜᴇ ʙʀᴀɴᴄʜᴇꜱ ᴏꜰ ᴀ ʜᴜɢᴇ ᴛʀᴇᴇ. ᴀꜱ ᴛʀᴀᴠᴇʟᴇʀꜱ ᴏꜰꜰᴇʀ

ʙᴀɴᴀɴᴀꜱ ᴀɴᴅ ᴩᴇᴀɴᴜᴛꜱ, ᴛʜᴇ ᴍᴏɴᴋᴇyꜱ ᴊᴜᴍᴩ ᴅᴏᴡɴ

ᴛʜᴇ ᴛʀᴇᴇ.

ɪꜰ ᴇᴠᴇʀy ᴍᴏɴᴋᴇy ᴄᴀɴ ᴇᴀᴛ ᴋ ʙᴀɴᴀɴᴀꜱ ᴀɴᴅ

ᴩᴇᴀɴᴜᴛꜱ. ɪꜰ ᴛᴏᴛᴀʟ ᴍ ɴᴜᴍʙᴇʀ ᴏꜰ ʙᴀɴᴀɴᴀꜱ ᴀɴᴅ ᴩ

ɴᴜᴍʙᴇʀ ᴏꜰ ᴩᴇᴀɴᴜᴛꜱ ᴏꜰꜰᴇʀᴇᴅ ʙy ᴛʀᴀᴠᴇʟᴇʀꜱ,

ᴄᴀʟᴄᴜʟᴀᴛᴇ ʜᴏᴡ ᴍᴀɴy ᴍᴏɴᴋᴇyꜱ ʀᴇᴍᴀɪɴ ᴏɴ ᴛʜᴇ

ᴛʀᴇᴇ ᴀꜰᴛᴇʀ ꜱᴏᴍᴇ ᴏꜰ ᴛʜᴇᴍ ᴊᴜᴍᴩᴇᴅ ᴅᴏᴡɴ ᴛᴏ ᴇᴀᴛ.

ᴀᴛ ᴀ ᴛɪᴍᴇ, ᴏɴᴇ ᴍᴏɴᴋᴇy ɢᴇᴛꜱ ᴅᴏᴡɴ ᴀɴᴅ ꜰɪɴɪꜱʜᴇꜱ

ᴇᴀᴛɪɴɢ ᴀɴᴅ ɢᴏ ᴛᴏ ᴛʜᴇ ᴏᴛʜᴇʀ ꜱɪᴅᴇ ᴏꜰ ᴛʜᴇ ʀᴏᴀᴅ. ᴛʜᴇ

ᴍᴏɴᴋᴇy ᴡʜᴏ ᴄʟɪᴍʙᴇᴅ ᴅᴏᴡɴ ᴅᴏᴇꜱ ɴᴏᴛ ᴄʟɪᴍʙ ᴜᴩ

ᴀɢᴀɪɴ ᴀꜰᴛᴇʀ ᴇᴀᴛɪɴɢ ᴜɴᴛɪʟ ᴛʜᴇ ᴏᴛʜᴇʀ ᴍᴏɴᴋᴇyꜱ ꜰɪɴɪꜱʜ

ᴇᴀᴛɪɴɢ

ᴍᴏɴᴋᴇy ᴄᴀɴ ᴇɪᴛʜᴇʀ ᴇᴀᴛ ᴋ ʙᴀɴᴀɴᴀꜱ ᴏʀᴊ ᴩᴇᴀɴᴜᴛꜱ. ɪꜰ

ꜰᴏʀ ʟᴀꜱᴛ ᴍᴏɴᴋᴇy ᴛʜᴇʀᴇ ᴀʀᴇ ʟᴇꜱꜱ ᴛʜᴀɴ ᴋ ʙᴀɴᴀɴᴀꜱ

ʟᴇꜰᴛ ᴏɴ ᴛʜᴇ ɢʀᴏᴜɴᴅ ᴏʀ ʟᴇꜱꜱ ᴛʜᴀɴ ᴊ ᴩᴇᴀɴᴜᴛꜱ ʟᴇꜰᴛ ᴏɴ

ᴛʜᴇ ɢʀᴏᴜɴᴅ, ᴏɴʟy ᴛʜᴀᴛ ᴍᴏɴᴋᴇy ᴄᴀɴ ᴇᴀᴛ

ʙᴀɴᴀɴᴀꜱ(<ᴋ) ᴀʟᴏɴɢ ᴡɪᴛʜ ᴛʜᴇ ᴩᴇᴀɴᴜᴛꜱ(ᴊ).

ᴡʀɪᴛᴇ ᴛʜᴇ ᴄᴏᴅᴇ ᴛᴏ ᴛᴀᴋᴇ ɪɴᴩᴜᴛꜱ ᴀꜱ ɴ, ᴍ, ᴩ, ᴋ, ᴊ ᴀɴᴅ

ʀᴇᴛᴜʀɴ ᴛʜᴇ ɴᴜᴍʙᴇʀ ᴏꜰ ᴍᴏɴᴋᴇyꜱ ʟᴇꜰᴛ ᴏɴ ᴛʜᴇ ᴛʀᴇᴇ.

ᴡʜᴇʀᴇ, ɴ = ᴛᴏᴛᴀʟ ɴᴜᴍʙᴇʀ ᴏꜰ ᴍᴏɴᴋᴇyꜱ ᴋ=ɴᴜᴍʙᴇʀ ᴏꜰ ᴇᴀᴛᴀʙʟᴇ ʙᴀɴᴀɴᴀꜱ ʙy ᴀ ꜱɪɴɢʟᴇ ᴍᴏɴᴋᴇy ᴊ= ɴᴜᴍʙᴇʀ ᴏꜰ ᴇᴀᴛᴀʙʟᴇ ᴩᴇᴀɴᴜᴛꜱ ʙy ᴀ ꜱɪɴɢʟᴇ ᴍᴏɴᴋᴇy ᴍ=ᴛᴏᴛᴀʟ ɴᴏ ᴏꜰ ʙᴀɴᴀɴᴀꜱ ᴩ=ᴛᴏᴛᴀᴋ ɴᴏ ᴩᴇᴀɴᴜᴛꜱ ʀᴇᴍᴇᴍʙᴇʀᴇᴅ ᴛʜᴀᴛ ᴍᴏɴᴋᴇyꜱ ᴀʟᴇᴀyꜱ ᴇᴀᴛ ʙᴀɴᴀɴᴀꜱ ᴀɴᴅ ᴩᴇᴀɴᴜᴛꜱ, ꜱᴏ ᴛʜᴇʀᴇ ɪꜱ ɴᴏ ᴩᴏꜱꜱɪʙɪʟɪᴛy ᴏꜰ ᴋ ᴀɴᴅ ᴊ ʜᴀᴠɪɴɢ ᴠᴀʟᴜᴇ 0