大威天龙

const int MAXN=1010; int q[MAXN]; int front=0,rear=0,temp; int cnt=0; int main(){ int a; cin>>a; for(int i=1;i<=a;i++){ rear++; q[rear]=i; cnt++; } while(cnt>=2){ front++;

目标:把这个群做成南通乃至中国最大的编程交流群

If you have answers or you need answers,please join us.this is answer's heaven,welcome to come in and send (or find) answers!Enjoy the travels of answer's heaven!

61-80条,共208条数据.