Description: Josephus problem: a group of kids form a circle, any assumption that a number of m, starting from the first child, the number of clockwise direction, each number to the first m a child is the child and then left. Children continue to leave the circle shrinks. Finally, the remaining child is a winner. What victory is the first of several children feel? Tip: The circular list answers to achieve the cycle of programming link.h list class, from basic operations such as insertions and deletions.
To Search:
File list (Check if you may need any files):
main.cpp
link.h
Download