Description: Wolf looking rabbit problem: a mountain cave surrounded by n clockwise numbered 0,1,2,3,4, ..., n-1. A wolf the wolf Zero hole starts counting clockwise each time through the m-th hole, find the rabbit hole. For example, n = 5, m = 3, the wolf through holes were 0,3,1,4,2,0. Input m, n. Rabbits have spared no opportunity? If there is the hiding where?
To Search:
File list (Check if you may need any files):
shiyan4.cpp