#include <stdio.h>
#include <malloc.h>
int JosephusProblem_Solution(int n, int m);
int main()
{
    int n,m,k;
    scanf("%d%d",&n,&m);
    k = JosephusProblem_Solution(n,m);
    printf("%d \n",k+1);
    return 0;
}

int JosephusProblem_Solution(int n, int m)
{
    unsigned i;
    if(n < 1 || m < 1)
        return -1;

    int *f = (int*)malloc(sizeof(int)*(n+1));
    f[0] = f[1] = 0; 

    for(i = 2; i <= n; i++)
        f[i] = (f[i-1] + m) % i; //按递推公式进行计算

    int result = f[n];
    free(f);

    return result;
}

[ 本帖最后由 纳兰伽香 于 2015-4-13 18:25 编辑 ]

我现在的问题是怎么把整个过程都打印 出来  有兴趣的同学 帮忙改改

#include <stdio.h>
#include <stdlib.h>

// 链表节点
typedef struct _RingNode
{
    int pos;  // 位置
    struct _RingNode *next;
}RingNode, *RingNodePtr;

// 创建约瑟夫环，pHead:链表头指针，count:链表元素个数
void CreateRing(RingNodePtr pHead, int count)
{
    RingNodePtr pCurr = NULL, pPrev = NULL;
    int i = 1;
    pPrev = pHead;
    while(--count > 0)
    {
        pCurr = (RingNodePtr)malloc(sizeof(RingNode));
        i++;
        pCurr->pos = i;
        pPrev->next = pCurr;
        pPrev = pCurr;
    }
    pCurr->next = pHead;  // 构成环状链表
}

void PrintRing(RingNodePtr pHead)
{
    RingNodePtr pCurr;
    printf("%d", pHead->pos);
    pCurr = pHead->next;
    while(pCurr != NULL)
    {
        if(pCurr->pos == 1)
            break;
        printf("\n%d", pCurr->pos);
        pCurr = pCurr->next;
    }
}

void KickFromRing(RingNodePtr pHead, int m)
{
    RingNodePtr pCurr, pPrev;
    int i = 1;    // 计数
    pCurr = pPrev = pHead;
    while(pCurr != NULL)
    {
        if (i == m)
        {
            // 踢出环
            printf("\n%d", pCurr->pos);    // 显示出圈循序
            pPrev->next = pCurr->next;
            free(pCurr);
            pCurr = pPrev->next;
            i = 1;
        }
        pPrev = pCurr;
        pCurr = pCurr->next;
        if (pPrev == pCurr)
        {
            // 最后一个
            printf("\n%d", pCurr->pos);    // 显示出圈循序
            free(pCurr);
            break;
        }
        i++;
    }
}

int main()
{
    int m = 0, n = 0;
    RingNodePtr pHead = NULL;
    printf("---------------Josephus Ring---------------\n");
    printf("N(person count) = ");
    scanf("%d", &n);
    printf("M(out number) = ");
    scanf("%d", &m);
    if(n <= 0 || m <= 0)
    {
        printf("Input Error\n");
        system("pause");
        return 0;
    }
    // 建立链表
    pHead = (RingNodePtr)malloc(sizeof(RingNode));
    pHead->pos = 1;
    pHead->next = NULL;
    CreateRing(pHead, n);
#ifdef _DEBUG
    PrintRing(pHead);
#endif

    // 开始出圈
    printf("\nKick Order: ");
    KickFromRing(pHead, m);    
    printf("\n");
    system("pause");
    return 0;
}

====================纯数学==============================
#include <stdio.h>
int main()
{
    int n, m, i, s = 0;
    printf ("N M = ");
    scanf("%d%d", &n, &m);
    for (i = 2; i <= n; i++)
    {
        s = (s + m) % i;
    }
    printf ("\nThe winner is %d\n", s+1);
}

相比之下  还是数学博大精深啊  膜拜

这样写不好理解吧，感觉还是用循环链表来的实在

你懂么？知道现在有几种方法能实现么？

我最熟悉的实现就是循环链表了， 不过是用数组。那种递推倒是不太会，
《算法：C语言实现》第一章就有这个题目，不过我自己也写不来，这些都是应届毕业生喜欢玩的，我哪玩的转

[ 本帖最后由 SunshineGirl 于 2015-4-16 13:23 编辑 ]