oseph (Josephus,) Central problem: the numbers 1, 2, 3, ..., n-n individuals sitting around a circle in a clockwise direction, the person holding a code (positive integer). One began to Choose a positive integer as the reported number of the upper limit of m, from the first person in a clockwise direction from a start sequence number off, stop in the report m. Reported m the person out of the line, his password as the new values ​ ​ of m, starting from the next person in the clockwise direction from a number off again, and so on, until all all columns so far. Single cycle of the n individuals linked list storage structure, after the end of the run, the output followed by the serial number of the team.

yuesefu\Debug\StdAfx.obj
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\yuesefu.exe
.......\.....\yuesefu.ilk
.......\.....\yuesefu.obj
.......\.....\yuesefu.pch
.......\.....\yuesefu.pdb
.......\ReadMe.txt
.......\StdAfx.cpp
.......\StdAfx.h
.......\yuesefu.cpp
.......\yuesefu.dsp
.......\yuesefu.dsw
.......\yuesefu.ncb
.......\yuesefu.opt
.......\yuesefu.plg
.......\Debug
yuesefu

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．