Suppose there are 2n people in a circle; the first n are good guys and the
last n are bad guys. Show that,
if we go around the circle executing every m th person, all the bad guys are
first to go.
For example, when n=3 we can take m=5; when n=4 we can take m=30.
請問要如何解呢??
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.126.11.3