文件名称:用c实现的约瑟夫环问题
介绍说明--下载内容均来自于网络,请自行研究使用
约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述: 古代某法官要判决N个犯人的死刑,他有一条荒唐的法律,将犯人站成一个圆圈,从第S个人开始数起,每数到第D个犯人,就拉出来处决,然后再数D个,数到的人再处决———直到剩下的最后一个可赦免。 发展的约瑟夫的描述: 古代某法官要判决N个犯人的死刑,但这N个人每人持有一个密码,他有一条荒唐的法律,将犯人站成一个圆圈,法官先给出一个密码M,从第S个人开始数起,每数到第M个犯人,就拉出来处决,再根据这个人所持有的密码F,然后再数F个,数到的人再处决,以此类推———直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Descr iption : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed - -- until the last one left to be pardoned. The development of the Joseph Descr iption : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull him out executions, in accordance with the password held by the F, then F fe
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 109061用c实现的约瑟夫环问题.rar 列表 约瑟夫环问题 约瑟夫环问题\LIST1.h 约瑟夫环问题\2.CPP 约瑟夫环问题\LLIST1.h 约瑟夫环问题\zn1.CPP