Introduction - If you have any usage issues, please Google them yourself
Joseph compiled a list with a single ring problem. Let numbered 1,2, n individual • • • , n of sitting around, agreed number k (1≤k≤n) who reported that the number starting with 1, the number m to the man out of the line, his the next and 1 countin, count to m the man was out of the line, and so on, until everyone out of the line up, thereby generating a sequence number of the team. Compressed file which contains the code, run the file, and test reports.