Python realizes the problem of the monkey's division of Peach

Problem Description:

Five monkeys are divided into peaches. In the middle of the night, the first monkey get up first, it divides the peach into equal five piles, one more. So it ate one and took a bunch; the second monkey got up and looked, only four peaches. So the four piles together, divided into equal five piles, and one more. So, it also ate one, took a bunch of; Some of the other monkeys are divided like this. Q: There are at least as many peaches in this pile.

# #本算法从最后一个猴子进行逆向推倒
 Peach (monkey=5):
    pea = 4  # #最后一个猴子分完剩余的桃子
     1:
        num = Pea
        range (monkey): num = num + num/4 + 1 num% 1!= 0: # #如果分出了小数则结束内层循环 
  
  
            
    15/>pea = 4  # #最后的桃子一定是4的整数倍
                
   
   break num% 1 = 0:  # #如果是整分 End
            
  Break  
    pea, num



   
  ' __main__ ':
    pea, num = Peach ()
    print (pea, num)