-
Category : Mathimatics-Numerical algorithms
Tags :
- Update : 2012-11-26
- Size : 1kb
- Downloaded ：0次
- Author ：m****
- About ：
Nobody
- PS : If download it fails, try it again. Download again for free!
Introduction - If you have any usage issues, please Google them yourself
Problem Description: numbered 1,2, ... ..., n n-clockwise around a circle of individuals, each holder of a password (positive integer) the beginning of either an integer number as the upper limit at m, from the first clockwise from 1 person to start off the beginning of the order, appearance, stopped at a few m. Those who reported m out of his seat a new password m value, in a clockwise direction from the next person to start off again from the 1 like that, know that all out of date. For example: m for the initial 20, n = 7,7 personal password are: 3,1,7,2,4,8,4 out the order for the 6,1,4,7,2,3, 5
Packet file list
(Preview for download)
joseph.cpp
Related instructions
- 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