Description: Josephus problem: Let numbered 1,2,3, ... ..., n of the n (n> 0) individuals sitting around a circle clockwise, each person has a positive integer password. Choose the beginning of a positive integer as the reported maximum number of m, starting clockwise from the first person from the sequence reported from a number of m is to stop the newspaper to report the number of people reported m the column, his password as a new m value, the next person from the beginning of his re-reported from a number. It goes on, until all the columns up for all. Let n be the maximum take 30. To design a program to simulate this process, find out the column number sequence.
To Search:
File list (Check if you may need any files):
约瑟夫2\main.cpp
.......\约瑟夫2.dsp
.......\约瑟夫2.dsw
.......\约瑟夫2.ncb
.......\约瑟夫2.plg
.......\Debug\main.obj
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\约瑟夫2.exe
.......\.....\约瑟夫2.ilk
.......\.....\约瑟夫2.pch
.......\.....\约瑟夫2.pdb
.......\约瑟夫2.opt
.......\Debug
约瑟夫2
Download