Description: Joseph ring problem source code
Joseph s ring (Joseph s problem) is a mathematical application problem: the known n individuals (in Numbers 1, 2, 3... n) sit around a round table. The number of people who have been numbered by the number of people who have been numbered by k is going to be in the column His next one starts at one, and the one who counts to m is out again. Repeat this pattern until all the people around the round table go out. And usually when we solve this problem we re going to go 0 to n minus 1, and then we re going to solve for the original problem.
To Search:
File list (Check if you may need any files):
JOSEPHUS\Debug\JSP.exe
........\.....\JSP.ilk
........\.....\JSP.pdb
........\ipch\jsp-2e2aceed\jsp-f1138099.ipch
........\JSP\Debug\CL.read.1.tlog
........\...\.....\CL.write.1.tlog
........\...\.....\joseph.obj
........\...\.....\JSP.exe.intermediate.manifest
........\...\.....\JSP.lastbuildstate
........\...\.....\JSP.log
........\...\.....\JSP.vcxprojResolveAssemblyReference.cache
........\...\.....\JSP.write.1.tlog
........\...\.....\link.read.1.tlog
........\...\.....\link.write.1.tlog
........\...\.....\mt.read.1.tlog
........\...\.....\mt.write.1.tlog
........\...\.....\vc100.idb
........\...\.....\vc100.pdb
........\...\joseph.c
........\...\JSP.vcxproj
........\...\JSP.vcxproj.filters
........\...\JSP.vcxproj.user
........\JSP.sdf
........\JSP.sln
........\JSP.suo
........\ipch\jsp-2e2aceed
........\JSP\Debug
........\Debug
........\ipch
........\JSP
JOSEPHUS
........\数据结构第一次试验.doc
Download