Description: Problem Description: This is from 1 to n n individuals sitting clockwise, each person holding a password, a password the first round of initial, beginning from the first person, the number of people to this password, and give your password , who quit. From the next person, according to the password again just reported screening people out, until the last one. The first input is the number of the second input of the initial password, then passwords for everyone. Using circular linked list implementation. Input: 63654321 Output: 314,256
To Search:
File list (Check if you may need any files):
JosephCircle
............\Debug
............\.....\BuildLog.htm
............\.....\JosephCircle.exe.embed.manifest
............\.....\JosephCircle.exe.embed.manifest.res
............\.....\JosephCircle.exe.intermediate.manifest
............\.....\JosephList.obj
............\.....\mt.dep
............\.....\vc90.idb
............\.....\vc90.pdb
............\JosephCircle.vcproj
............\JosephCircle.vcproj.bqrm-PC.bqrm.user
............\JosephList.cpp
............\问题描述.txt
Download