文件名称:Joseph
- 所属分类：
- 压缩解压
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2013-03-19
- 文件大小：
- 2.18mb
- 下载次数：
- 0次
- 提 供 者：
- 杜**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。
假定在圈子里前K个为好人，后K个为坏人，你的任务是确定这样的最少M，使得所有的坏人在第一个好人之前被杀掉。-Joseph problem is a well-known problem: N personal circle, began to count off from the first, the M-th will be killed, the last remaining one, the rest will be killed. E.g. N = 6, M = 5, the number of the person to be killed 5,4,6,2,3. Finally, the rest of the 1st. Assuming K in circles for a good man, after K for the bad guys, your task is to determine the least M, so that all the bad guys get killed before the first good man.
假定在圈子里前K个为好人，后K个为坏人，你的任务是确定这样的最少M，使得所有的坏人在第一个好人之前被杀掉。-Joseph problem is a well-known problem: N personal circle, began to count off from the first, the M-th will be killed, the last remaining one, the rest will be killed. E.g. N = 6, M = 5, the number of the person to be killed 5,4,6,2,3. Finally, the rest of the 1st. Assuming K in circles for a good man, after K for the bad guys, your task is to determine the least M, so that all the bad guys get killed before the first good man.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Joseph
......\Debug
......\.....\Joseph.exe
......\.....\Joseph.ilk
......\.....\Joseph.obj
......\.....\Joseph.pch
......\.....\Joseph.pdb
......\.....\Joseph.res
......\.....\JosephDlg.obj
......\.....\StdAfx.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\Joseph.aps
......\Joseph.clw
......\Joseph.cpp
......\Joseph.dsp
......\Joseph.dsw
......\Joseph.h
......\Joseph.ncb
......\Joseph.opt
......\Joseph.plg
......\Joseph.rc
......\JosephDlg.cpp
......\JosephDlg.h
......\ReadMe.txt
......\Resource.h
......\StdAfx.cpp
......\StdAfx.h
......\res
......\...\Joseph.ico
......\...\Joseph.rc2