首先，认识并了解著名的约瑟夫问题：已知n个人（n>=1)围坐一圆桌周围，从1号开始顺序编号。从序号为1号的人开始报数，顺时针数到m的那个人出列：他的下一个人又从1开始报数，数到m的那个人又出列；依此规则一直重复下去，直到所有人全部出列，要求：求出最后一个出列人的编号。

　本程序运用VC++ 6.0开发工具，利用MFC框架构造一个基于对话框的应用程序，用户根据对话框的界面提示，了解约瑟夫问题，并且在对话框上键入总人数(n) 和出列数(m) 。由编辑框输出结果，结果显示为最后一个出列人的编号。-First, awareness and understanding of the famous Joseph question: Given n individuals (n>　= 1) were sitting around a round table, from the 1st to start the sequence number. No. 1 from the number of people start off, count to m clockwise out of that person: He' s the next person and from one to start off, count to m that another person out　rule has been repeated so go until all the columns required: find out who' s the last one out of numbers. The program uses VC++ 6.0 development tools to construct a fr a mework for the use of MFC dialog-based application, a user interface based on the dialog box prompts, understanding the problem of Joseph, and type the total number (n) and the number (m) listed in the dialog box . The output from the edit box, the result is displayed as the last person out of the column number.