搜索资源列表
acm
- 一道ACM的题，用数学的取余来模拟约瑟夫操作。在源程序里对这个操作有详细的注释。-The Joseph s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only
Queen
- N皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.
QueenMFC
- N皇后的C++实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C++ implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.
8
- 8皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.-8 Queen' s C# implementation, you can customize the number of input Queen, and the N-smart
test10
- 今盒子里有n个小球，A、B两人轮流从盒中取球，每个人都可以看到另一个人取了多少个，也可以看到盒中还剩下多少个，并且两人都很聪明，不会做出错误的判断。 -This box n balls, A, B two turns from the box to take the ball, everyone can see another person take the number, you can also see the left box, and two very smart, does not