约瑟夫环

#include <iostream>
#include <stdlib.h>

using namespace std;

typedef struct LinkNode{
    int data;
    struct LinkNode* next;
}JosephuNode;


int Josephu(int n, int m)
{

    //creat
    JosephuNode *head, *tail;
    head = tail = (JosephuNode*) malloc(sizeof(JosephuNode));;

    for(int i = 1; i < n; i++)
    {
        tail->data = i;
        tail->next = (JosephuNode*)malloc(sizeof(JosephuNode));
        tail = tail->next;
    }
    tail->data = n;
    tail->next = head;


    //loop
    while(tail != head)
    {
        for(int j = 1; j < m; ++j)
        {
            tail = head;
            head = head->next;
        }
        tail->next = head->next;
        cout<<head->data<<endl;
        free(head);
        head = tail->next;
    }

    int last = head->data;
    free(head);
    head = tail = NULL;

    return last;
}


int main()
{
    int n,m;
    cout<<"input n and m:"<<endl;
    cin>>n>>m;
    int last = Josephu(n, m);
    cout<<"Last number is:"<<last<<endl;


    return 0;
}

#include<iostream>
#include<list>
#include<fstream>
using namespace std;
int main()
{
    int m,n,temp,i,j;
    FILE *out;
    out=fopen("out","w");
    cout<<"input n and m:"<<endl;
    cin>>n>>m;
    int a[n];
    for(i=1;i<=n;i++)
        a[i]=i;
    a[0]=0;
    i=0;
    temp=n;
    while(temp)
    {
        for(j=0;j<m;)
        {
            i=(i)%n+1;
            if(a[i]!=0)
                j++;

        }

        cout<<a[i]<<endl;
        fprintf(out, "%d
", a[i]);
        a[i]=0;
        temp--;

    }
    fclose(out);


    return 0;
}
//数组