Location:
Search - WINS.M
Search list
Description: MIB浏览器,使用snmp协议开发的，有Get .GetNext（）等五个函数的查询。是个典型好软件-snmp++ MiB
Platform: |
Size: 3706880 |
Author: sunjizhong |
Hits:
Description: 欧几里德的两个后代Stan和Ollie正在玩一种数字游戏，这个游戏是他们的祖先欧几里德发明的。给定两个正整数M和N，从Stan开始，从其中较大的一个数，减去较小的数的正整数倍，当然，得到的数不能小于0。然后是 Ollie，对刚才得到的数，和M,N中较小的那个数，再进行同样的操作……直到一个人得到了0，他就取得了胜利。-Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins.
Platform: |
Size: 876544 |
Author: jose |
Hits:
Description: 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的顺序是：5，4，6，2，3，1。-The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M=0, and N=5, players are eliminated in order, and player 5 wins. If M=1, and N=5, the order of eliminated is 2, 4, 1, 5.
Write a program to solve the Josephus problem for general values of M and N. Try to make your program as efficient as possible. Make sure you dispose of cells.
Platform: |
Size: 1024 |
Author: 陈天睿 |
Hits: