hdu1276STL链表的应用

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef unsigned int ui;
 4 typedef long long ll;
 5 typedef unsigned long long ull;
 6 #define pf printf
 7 #define mem(a,b) memset(a,b,sizeof(a))
 8 #define prime1 1e9+7
 9 #define prime2 1e9+9
10 #define pi 3.14159265
11 #define lson l,mid,rt<<1
12 #define rson mid+1,r,rt<<1|1
13 #define scand(x) scanf("%llf",&x) 
14 #define f(i,a,b) for(int i=a;i<=b;i++)
15 #define scan(a) scanf("%d",&a)
16 #define mp(a,b) make_pair((a),(b))
17 #define P pair<int,int>
18 #define dbg(args) cout<<#args<<":"<<args<<endl;
19 #define inf 0x7ffffff
20 inline int read(){
21     int ans=0,w=1;
22     char ch=getchar();
23     while(!isdigit(ch)){if(ch==‘-‘)w=-1;ch=getchar();}
24     while(isdigit(ch))ans=(ans<<3)+(ans<<1)+ch-‘0‘,ch=getchar();
25     return ans*w;
26 }
27 int n,m,t;
28 const int maxn=1e4+10;
29 int main()
30 {
31     //freopen("input.txt","r",stdin);
32     //freopen("output.txt","w",stdout);
33     std::ios::sync_with_stdio(false);
34     t=read();
35     while(t--)
36     {
37         n=read();
38         int num=2;
39         list<int> l;
40         list<int>::iterator it;//声明链表的迭代器
41         f(i,1,n)l.push_back(i);
42         while(l.size()>3)
43         {
44             int i=1;
45             it=l.begin();
46             while(it!=l.end())
47             {
48                 if(!(i++%num))it=l.erase(it);//删除之后返回下一个位置的指针
49                 else it++; 
50             }
51             if(num==2)num=3;
52             else num=2;
53         }
54         it=l.begin();
55         while(it!=l.end())
56         {
57             if(it==l.begin())pf("%d",*it);
58             else pf(" %d",*it);
59             it++;
60          }
61          pf("\n"); 
62     }
63 }