这个也算是自己写的约瑟夫环了吧，虽然很水

#include <iostream>using namespace std;int main(){    int n,m;    cin>>n>>m;    int *people = new int[n+1];  for (int i = 1; i <= n; ++i)  {  /* code */  people[i] = 0;  }    int countted = 0;    int recur = 1;    for (int i = 1; i <= n; ++i)    {    if(people[i] ==0)    {       if(recur == m)       {       people[i] = 1;       countted++;               recur = 1;               }               else                   recur ++;            }            if(i == n)            i = 0;            if(countted == n-1)            break;                     //  cout<<i <<" is i "<<recur<<"  is recur "<<countted<<" is countted"<<endl;    }    for (int i = 1; i <= n; ++i)    {    /* code */    if(people[i]==0)    cout<<i<<endl;    }system("pause");}