• 2024-11-24天梯赛练习集 L2-041 插松枝 模拟
    #include<bits/stdc++.h>usingnamespacestd;queue<int>t,z;intx;voidprint(){ while(!z.empty()) { x=z.front();cout<<x; if(z.size()!=1) cout<<''; z.pop(); } cout<<endl;}intmain(){ intn,m,k; ci