Description: Classic Joseph ring problem: Numbers for 1, 2,... , n n personal clockwise sat a lap, each holding a password (positive integer). A began to retaining a positive integer number off as the upper m, from the first person to start the clockwise order since 1 began to sound off, report when m stop count off. The man stood for m, will it password as new m value. Try to design a program for stood out of order. Now C language program to realize this.
To Search:
File list (Check if you may need any files):
约瑟夫环
........\实验一实验报告.doc
........\约瑟夫环.c
........\约瑟夫环.exe
Download