用单链表编一个约瑟夫环问题。设编号为1，2，• • • ，n的n个人围坐一圈，约定编号为k（1≤k≤n）的人从1开始报数，数到m的那个人出列，他的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。压缩文件里面包括了代码，运行文件，还有实验报告。-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.