Description: There are n children form a circle (number from 1 ~ n), from the number of children of 1 cycle at the beginning of the order of the number of 1 ~ m, where m is reported from the circle, until the only remaining person in the circle (known as the winner persons). Given positive integer n and m, calculate the number of winners.
To Search:
File list (Check if you may need any files):
约瑟夫问题.cpp
约瑟夫问题.exe
Download