约瑟夫环问题直接解法

#include"stdio.h"
int main()
{
    int a[10001];
    int m,n,temp;
    int i;
    int count = 1,num = 0;
    scanf("%d %d",&n,&m);
    for(i=0;i<n;i++)
        scanf("%d",a+i);
    while(num != n-1)
    {
        for(i=num;i<n;i++)
        {
            if(count == m)
            {
                temp = a[num];
                a[num] = a[i];
                a[i] = temp;
                num++;
                count = 1;
            }
            else
                count++;
            if(i == n-1)
                i = num;
        }
    }
    for(i=0;i<n;i++)
        printf("%d\t",a[i]);
    return 0;
}