Description: Using C language to solve the issue of Joseph Ring, Joseph Ring Problem Description: Let numbered 1,2, ..., n (n> 0) individuals according to a clockwise direction around a circle, one person holding a positive integer password (available random number generated). The beginning of any given number of a reported upper limit of m, from the beginning of the first person clockwise order starting from 1 is reported the number of stops reported back m the number of people who reported that m out of his password as a new value m , from his in a clockwise direction on the next person since 1 have been re-reported the number of the order, appearance, the new m value of the listed persons it goes on like this until all the column until all. Asked to design a simulation of this process, procedures, and gives the number of people out of sequence.
To Search:
- [CRC] - CRC cyclic redundancy check algorithm an
- [Complex] - This source is a complex calculation, in
File list (Check if you may need any files):
Download