新兵队列

/*

某部队进行新兵队列训练，将新兵从一开始按顺序依次编号，并排成一行横队，训练的规则如下：

从头开始一至二报数，凡报到二的出列，剩下的向小序号方向靠拢，再从头开始进行一至三报数，

凡报到三的出列，剩下的向小序号方向靠拢，继续从头开始进行一至二报数。。。，以后从头开始轮流进行一至二报数

、一至三报数直到剩下的人数不超过三人为止。

Input

本题有多个测试数据组，第一行为组数N，接着为N行新兵人数，新兵人数不超过5000。

Output

共有N行，分别对应输入的新兵人数，每行输出剩下的新兵最初的编号，编号之间有一个空格。

Sample Input

2

20

40

Sample Output

1 7 19

1 19 37*/

 

 

#include<iostream>

#include<list>

using namespace std;

int main()

{

         int times;

         cin>>times;

         int i=0,j;

         int num;

         int time;

         while(i<times)

         {

                  

                   list<int>a;

                   list<int>::iterator p;

                   do

                   {

                            cin>>num;

                   }while(num>5000);

        for(j=1;j<=num;j++)

        {

                            a.push_back(j);

        }

                   if(num==0)

                   {

                            i++;

                            cout<<0<<endl;

                            continue;

                   }

                   if(num<=3)

                   {

                            for(p=a.begin();p!=a.end();p++)

                            {

                                     if(*p==(a.back()))

                                               cout<<*p<<endl;

                                     else

                                               cout<<*p<<" ";

                            }

                            i++;

                            continue;

                   }

        while(num>3)

        {

                            time=0;

                            for(p=a.begin();p!=a.end();)

                            {

                                    

                                     if((++time)%2==0)

                                     {

                                               time=0;

                                               p=a.erase(p);

                                               num--;

                                     }

                                     else

                                               p++;

                            }

                            if(num<=3)

                            {

                                     for(p=a.begin();p!=a.end();p++)

                                     {

                                               if(*p==(a.back()))

                                                        cout<<*p<<endl;

                                               else

                                                        cout<<*p<<" ";

                                     }

                                     i++;

                                     break;

                            }

                            time=0;

                            for(p=a.begin();p!=a.end();)

                            {

                                    

                                     if((++time)%3==0)

                                     {

                                               time=0;

                                               p=a.erase(p);

                                               num--;

                                              

                                     }

                                     else

                                               p++;

                            }

                            if(num<=3)

                            {

                                     for(p=a.begin();p!=a.end();p++)

                                     {

                                               if(*p==(a.back()))

                                                        cout<<*p<<endl;

                                               else

                                                        cout<<*p<<" ";

                                     }

                                     i++;

                                     break;

                            }

                   }

         }

         return 0;

}

转载于:https://www.cnblogs.com/-wang-xin/archive/2012/11/23/2785109.html