Introduction - If you have any usage issues, please Google them yourself
Joseph questions: Have n monkeys, according to election clockwise circle king (No. from 1 to n), from No. 1 to start off, has been the number to m, to m the number of monkeys outside exit, the remaining monkeys followed by one to start off from. In this way, until the circle is only a monkey, this monkey is the Monkey King, programming for input n, m, the output of the final
Packet : 117143170xiaochengxu.rar filelist
xiaochengxu\字符串.C
xiaochengxu\iu.C
xiaochengxu\窗口内文本的输入函数.C
xiaochengxu\画箭头.C
xiaochengxu\画圆.C
xiaochengxu\文本窗口颜色的设置.C
xiaochengxu\算N!.C
xiaochengxu\Josephus.C
xiaochengxu\sd.C
xiaochengxu\分形-羊齿叶.C
xiaochengxu\画线.C
xiaochengxu\链表.C
xiaochengxu\杨辉三角.C
xiaochengxu\带参数运行功能示例.c
xiaochengxu\画线2.C
xiaochengxu