jobdu-1188:约瑟夫环-ac
猴子选大王,如此经典的问题
//jobdu-1188:约瑟夫环-ac
#include
#include
using namespace std;
int n,p;
vector
v;
vector
::iterator it;
vector
::iterator tmp; void f_next(vector
& v,vector
::iterator& it){ //让迭代器指向数组中下一个 if(it==v.end()-1) it=v.begin(); else it++; } int main( ) { bool mark; while(cin>>n>>p){ mark=false; v.clear(); for(int i=0;i