2013年11月16日
[ACM - 数论]Wolf and Rabbit
摘要： Problem DescriptionThere is a hill with n holes around. The holes are signed from 0 to n-1.A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The first hole he get into is the one signed with 0. Then he will get into the hole every m holes. For example, m=2 an 阅读全文
posted @ 2013-11-16 13:17 同学少年 阅读(206) 评论(0) 推荐(0)