不允许学生创建新讨论了,后面大家可以在这里讨论相关内容。会定期清理。

问问题可以联系老师,或者把详细的题号和错误的代码发送邮件到 daijianshan33@qq.com

367 条评论

  • @李任泽昊 1的时候 a->b 连 -c 2的时候 b->a 连c

    • @ 2025-2-10 21:42:52

      各位看见这里的人晚上好,当你看到这里时,有可能快开学了/已经开学了,假如你没有题用来解压可以来做我的题单(全是我本人出题):https://www.luogu.com.cn/training/697879

      想要一起出题的/要数据的加我WX,微信号:wxid_ms0d1nsg0dk622

      溜了

      • @ 2025-2-10 9:11:47

        所以说mc++的洛谷分区赛是不是不开了,都快旧春了

        • 如果你发现你的成绩少了。

          那是因为我把马拉松赛一些用ai软件的代码ban掉了。

          请合理使用ai软件,我觉得ai的用途并不是用来欺骗家长,老师以及你自己。

          • @ 2025-2-9 19:06:49

            TooY0ung什么时候发硬币a

          • @ 2025-2-9 15:14:55

            tooyoung的诅咒2.0这个为什么会第17个点wa

            我通过某种方式得到了第17个点n和m都是开到顶了

            赛时第17个点特判的()

            #include<bits/stdc++.h>
            using namespace std;
            int n,m,s;
            vector<int>e[100005];
            set<pair<int,int>>flag;
            int ind[100005];
            int a[100005];
            queue<int>q;
            double ans[100005];
            vector<int>qwq;
            int main()
            {
            	ios::sync_with_stdio(0);
            	cin.tie(0);
            	cin>>n>>m>>s;
            	for(int i=1;i<=n;i++)
            		cin>>a[i];
            	for(int i=1;i<=m;i++)
            	{
            		int u,v;
            		cin>>u>>v;
            		if(u==v)
            			continue;
            		if(flag.find(make_pair(u,v))!=flag.end())
            			continue;
            		flag.insert({u,v});
            		e[u].push_back(v);
            		ind[v]++;
            	}
            	for(int i=1;i<=n;i++)
            		if(ind[i]==0)
            			q.push(i);
            	while(!q.empty())
            	{
            		int u=q.front();
            		q.pop();
            		qwq.push_back(u);
            		for(int v:e[u])
            		{
            			ind[v]--;
            			if(ind[v]==0)
            				q.push(v);
            		}
            	}
            	if(qwq.size()!=n)
            	{
            		cout<<"NO";
            		return 0;
            	}
            	for(int i=1;i<=n;i++)
            		ans[i]=0;
            	ans[s]=1;
            	for(int i=0;i<qwq.size();i++)
            	{
            		int u=qwq[i];
            		int out=e[u].size();
            		if(a[u]==0)
            			continue;
            		if(out>0)
            			for(int v:e[u])
            				ans[v]+=ans[u]/out;
            	}
            	double Ans=0;
            	for(int i=1;i<=n;i++)
            		if(a[i]==0)
            			Ans+=ans[i];
            	if(Ans-0.5>1e-9)
            		cout<<"YES";
            	else
            		cout<<"NO";
            	return 0;
            }
            
          • @ 2025-2-9 11:58:51

            马拉松怎么没法补题

            • 编辑比赛的时候忘记设置了。能做的题已经开放了

            • @ 2025-2-9 17:22:09

              @ 没权限

            • undefined@ 有了吧,只开放了能做的题。

          • @ 2025-2-9 10:22:08
            #include<bits/stdc++.h>	
            #include<windows.h>
            #include<stdio.h>
            #include<conio.h>
            #include<time.h>
            #define Nor if(B[b].x<5) B[b].x=5;
            #define Out1 Bx1-Bvx1<=6||Bx1-Bvx1>=28||By1-Bvy1<=7||By1-Bvy1>=27
            #define Out2 Bx2-Bvx2<=6||Bx2-Bvx2>=28||By2-Bvy2<=7||By2-Bvy2>=27
            #define Chang1 {Bwhat1=0;Bvx1=Bvy1=0;memset(Bgo1,0,sizeof(Bgo1));}
            #define Chang2 {Bwhat2=0;Bvx2=Bvy2=0;memset(Bgo2,0,sizeof(Bgo2));}
            #define Chang3 {Bwhat3=0;Bvx3=Bvy3=0;memset(Bgo3,0,sizeof(Bgo3));}
            using namespace std;
            int ti(float a) {return ((int)(a*10+5))/10;}
            void Setpos(float x,float y){COORD pos;pos.X=ti(y*4)/2;pos.Y=ti(x);SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);}
            void Color(int a){if(a==0) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_GREEN|FOREGROUND_BLUE);if(a==1) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN|FOREGROUND_BLUE);if(a==2) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);if(a==3) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_BLUE);if(a==4) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED);if(a==5) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_GREEN);if(a==6) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE);if(a==7) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED|FOREGROUND_GREEN|FOREGROUND_BLUE);if(a==8) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED);if(a==9) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),BACKGROUND_INTENSITY|BACKGROUND_GREEN|BACKGROUND_BLUE);if(a==10) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),BACKGROUND_INTENSITY|BACKGROUND_RED|BACKGROUND_BLUE);if(a==11) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED|FOREGROUND_BLUE);if(a==12) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED|FOREGROUND_GREEN);if(a==13) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY);if(a==14) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_GREEN|FOREGROUND_BLUE);}
            int Blomax,Ren,Exp,Expmax,Lv,Lvl,Ice,Drug,ar1,ar2,Tar1,Tar2,bl,br,Win,T,Tb,Sy,Up,Upt,Down,u1,u2,Kill,Killb,L,Ll[4],Li,D,Gd[10],Biao,Fire,Fir,Water,Thun,Wind,Magne,I[20][2],ib,Dis,Disb,Dis1,Disb1,Boss,Bblo,Bblomax,Bwhat1,Bwhat2,Bwhat3,Bgo1[10],Bgo2[10],Bgo3[10],Bbr,Bbl,Bl[4];
            float X,Y,Vx,Vy,Ding,Blo,Hui,Bx1,By1,Bx2,By2,Bx3,By3,Bvx1,Bvy1,Bvx2,Bvy2,Bvx3,Bvy3,Bway[1001][2];
            struct bullet{float x,y,vx,vy;int what;int a,t,How;int life;bool kill;}B[100001];
            void Map(int a,int b);
            void Pan(int a,float x,float y,int b){
                float Nox[4],Noy[4];Nox[0]=X,Noy[0]=Y;
                if(Down==1&&X==22) Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=X-1,Noy[2]=Y-0.5;else if(Down==2) Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=-10,Noy[2]=-10;else if(Down==1||X<18) Nox[1]=X-1,Noy[1]=Y-0.5,Nox[2]=-10,Noy[2]=-10;else Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=X-1,Noy[2]=Y-0.5;
                for(int i=0;i<3;i++){
                    if(a==-1){if(abs(x-Nox[i])+abs(y-Noy[i])<1.5) {if(B[b].what==-10)Exp+=2;if(B[b].what==-11)Exp+=1;B[b].life=0;if(B[b].life==0&&b==bl) bl++;Map(3,b);break;}}
                    if(a==-2){if(abs(x-Nox[i])+abs(y-Noy[i])<2.5) {if(B[b].what==-2)Exp+=5,Biao+=5;if(B[b].what==-3)Fire=300,Ice=0,Fir=3;if(B[b].what==-4)Water=200;if(B[b].what==-5){Wind=70;Ding=28.25;Ice=0;if(Y<Ding-1)Vy=5;else Vy=0;if(Up>=1) Vx=-5;if(Down==2) Vx=5;}if(B[b].what==-6){Thun=200;system("color 1F");Sleep(20);system("color 6F");Sleep(10);system("color 0F");}if(B[b].what==-7)Magne=300;if(B[b].what==-8)Ice=0,Drug=0,Blo=fmin((float)Blomax,Blo+20);if(B[b].what==-9)Exp=fmin((float)Expmax,Exp+20);B[b].life=0;if(B[b].life==0&&b==bl) bl++;Map(3,b);break;}}
                }if(Wind==0&&Thun==0&&(B[b].kill!=0||Killb>=15||Ren==1&&Killb>0)) return;
                for(int i=0;i<3;i++){
                    if((Wind>=1||Thun>=1)&&abs(x-Nox[i])+abs(y-Noy[i])<2.5) {if(B[b].what<98)Exp+=2;B[b].life=0;Map(3,b);break;}
                    if(a==1) {if(abs(x-Nox[i])<0.5&&abs(y-Noy[i])<1) {if(B[b].what>=99)Blo-=10;if(B[b].what==14)Blo-=15,Ice=100,B[b].life=0;else if(B[b].what==15)Blo-=20,Ice=0,B[b].life=0;else if(B[b].what==17)Blo-=5,Drug=100,B[b].life=0;else if(B[b].what>=13&&B[b].what<=17)Blo-=10,B[b].life=0;else Blo-=15;B[b].kill=1,Killb=20;Kill=1;Map(3,b);break;}}
                    if (a==2||a==6||a==8||a==9||a==10||a==11||a==12) {
            			if(abs(x-Nox[i])+abs(y-Noy[i])<1.5) {
            				if(a==2)Blo-=20;
            				else if(a==8)Blo-=10;
            				else Blo-=15;B[b].kill=1,Killb=20;Kill=1;if(a!=2){B[b].life=0;if(B[b].life==0&&b==bl) bl++;Map(3,b);break;}}}
                    if(a==4) {if((Wind>=1||Thun>=1)&&abs(x-Nox[i])<1.5&&Noy[i]-y<=0&&Noy[i]-y>=-8) {if(B[b].what<98)Exp+=2;B[b].life=0;Map(3,b);break;}if(abs(x-Nox[i])<1&&Noy[i]-y<=0&&Noy[i]-y>=-8) {Blo-=25,B[b].kill=1,Killb=20;Kill=1;Vy=-1;Y-=0.5;break;}}
                }
            }
            void Map(int a,int b){
                Color(0);
                if(a==-1){
                    if(Boss==1||Boss==6){if(Bwhat1==5){if(ti(Bx1)==20)Setpos(Bx1,By1),cout<<"==";else Setpos(Bx1,By1),cout<<"  ";}else{Setpos(Bx1-1,By1-0.5),cout<<"    ";Setpos(Bx1,By1-1),cout<<"      ";Setpos(Bx1+1,By1-0.5),cout<<"    ";if(abs(ti(Bx1)-20)<=1)Setpos(20,By1-1),cout<<"======";}}
                    if(Boss==2||Boss==6){Setpos(Bx2-1,By2-1);cout<<"    ";Setpos(Bx2,By2-1);cout<<"      ";Setpos(Bx2+1,By2-1),cout<<"      ";Color(0);if(abs(ti(Bx2)-20)<=1)Setpos(20,By2-1),cout<<"======";}
                    if(Boss==3||Boss==6){Setpos(Bx3-1,By3-0.5);cout<<"     ";Setpos(Bx3,By3);cout<<"  ";Setpos(Bx3+1,By3-1),cout<<"      ";Color(0);if(abs(ti(Bx3)-20)<=1)Setpos(20,By3-1),cout<<"=======";}
                    if(X<0)return;if(X>=17&&X<=19){Setpos(X-1,Y);cout<<"  ";Setpos(X,Y-1);cout<<"   ";Setpos(X+1,Y-1),cout<<"   ";}else if(X<=23&&X>=21){Setpos(X+1,Y);cout<<"  ";Setpos(X,Y-1);cout<<"   ";Setpos(X-1,Y-1),cout<<"    ";}else if(X>23){Setpos(X,Y-1);cout<<"    ";Setpos(X-1,Y-0.5),cout<<"   ";}else if(X<17&&Upt!=0){Setpos(X,Y-1);cout<<"    ";Setpos(X+1,Y-1.5),cout<<"    ";}else if(X<17){Setpos(X,Y-1);cout<<"    ";Setpos(X+1,Y-0.5),cout<<"   ";}if(Thun>0){Setpos(X-2,Y-1),cout<<"    ";Setpos(X+2,Y-1),cout<<"    ";Setpos(X,Y+2),cout<<"  ";Setpos(X,Y-2.5),cout<<"  ";Setpos(X-1,Y+1),cout<<"  ";Setpos(X+1,Y+1),cout<<"  ";Setpos(X-1,Y-2),cout<<"  ";Setpos(X+1,Y-2),cout<<"  ";Setpos(20,Y-2.5),cout<<"============";}if(Wind!=0){Setpos(X+1,Y-5);cout<<"        ";Setpos(X,Y-5);cout<<"        ";Setpos(X-1,Y-5);cout<<"        ";Setpos(20,Y-5),cout<<"========";}if(Water!=0){Setpos(X,Y-4);cout<<"       ";Setpos(X+2,Y-3.5);cout<<"     ";Setpos(X-2,Y-3.5);cout<<"     ";Setpos(X+1,Y-3.5);cout<<"     ";Setpos(X-1,Y-3.5);cout<<"     ";Setpos(20,Y-5),cout<<"========";}if(Fire!=0){Setpos(X,Y+1),cout<<"  ";Setpos(X+1,Y),cout<<"  ";Setpos(X-1,Y-1),cout<<"  ";Setpos(20,Y-1);cout<<"======";}
                }
                if(a==0){
                    if(Boss==1||Boss==6){if(Bwhat1==5)Color(5),Setpos(Bx1,By1),cout<<"█",Color(0);else if(Bwhat1==4&&Bgo1[1]>6&&Bgo1[1]<11)Color(4),Setpos(Bgo1[5]-1,Bgo1[6]),cout<<"︻",Setpos(Bgo1[5],Bgo1[6]-1),cout<<"【",Setpos(Bgo1[5],Bgo1[6]+1),cout<<"】",Setpos(Bgo1[5]+1,Bgo1[6]),cout<<"︼",Color(0);else{Setpos(Bx1-1,By1-0.5),Color(0),cout<<"●●";Setpos(Bx1,By1-1);if(Bwhat1==2&&Bgo1[1]<=5)Color(1);else if(Bwhat1==3&&Bgo1[1]<=5)Color(5);else if(Bwhat1==6&&Bgo1[1]<=5)Color(8); else Color(4);if(Bwhat1==4) Setpos(Bx1,By1-0.5),cout<<"██(";else cout<<")██(";Setpos(Bx1+1,By1-0.5),cout<<"……";Color(0);}}
                    if(Boss==2||Boss==6){Setpos(Bx2-1,By2-1);Color(0),cout<<"\\ ";Color(0);cout<<"●";Setpos(Bx2,By2-1);Color(3);cout<<"◥";Color(5),cout<<"JJJ";Color(0),cout<<">";Color(3);Setpos(Bx2+1,By2-1),cout<<"◢█◣";Color(0);}
                    if(Boss==3||Boss==6){Setpos(Bx3-1,By3-0.5);if(Bwhat3==3||Bwhat3==9) Color(1);else if(Bwhat3==4||Bwhat3==10) Color(4);else if(Bwhat3==5||Bwhat3==11) Color(5);if(Bwhat3==11)cout<<' ';else if(Bwhat3==6) Color(3);else Color(2);cout<<"●-";Setpos(Bx3,By3);if(Bwhat3==11)cout<<"/";else cout<<"┃";Color(0);Setpos(Bx3+1,By3-1),cout<<"●●●";}
                    if(X<0)return;if(Ren==2) Color(12);if(Ren==3) Color(1);if(Ren==4) Color(3);if(Ren==5) Color(4);if(Ren==6) Color(2);if(Drug!=0&&T%5!=0) Color(11);if(Drug!=0&&T%5==0) Color(11);if(Ice!=0) Color(6);if(b==1) Color(8);if(Li!=0) Color(5);if(Ren==1&&Killb>0&&T%4<2) Color(13);if(Wind>0&&T%4<=1) Color(1);if(Wind>0&&T%4>=2) Color(0);if(Thun>0&&T%4<=1) Color(1);if(Thun>0&&T%4>=2) Color(6);
                    if(X>=17&&X<=19){Setpos(X-1,Y);cout<<"●";Setpos(X,Y-1);cout<<"━/";if(T%10<3) Setpos(X+1,Y-1),cout<<"┛╲";else if(T%10<6) Setpos(X+1,Y-1),cout<<"┦ ";else Setpos(X+1,Y-1),cout<<"╯>";if(Wind>0&&T%3==0) Setpos(X+1,Y-1),cout<<"┛╲";else if(Wind>0&&T%3==1) Setpos(X+1,Y-1),cout<<"┦ ";else if(Wind>0&&T%3==2)Setpos(X+1,Y-1),cout<<"╯>";}else if(X<=23&&X>=21){Setpos(X+1,Y);cout<<"●";Setpos(X,Y-1);cout<<"━\\";if(T%10<3) Setpos(X-1,Y-1),cout<<"┓╱";else if(T%10<6) Setpos(X-1,Y-1),cout<<"┪ ";else Setpos(X-1,Y-1),cout<<"╮>";if(Wind>0&&T%3==0) Setpos(X-1,Y-1),cout<<"┓╱";else if(Wind>0&&T%3==1) Setpos(X-1,Y-1),cout<<"┪ ";else if(Wind>0&&T%3==2)Setpos(X-1,Y-1),cout<<"╮>";}else if(X>23){Setpos(X,Y-1);cout<<"━ ●";Setpos(X-1,Y-0.5),cout<<"│>";}else if(X<17&&Upt!=0){Setpos(X,Y-1);cout<<"━ ●";Setpos(X+1,Y-1.5),cout<<"╱ >";}else if(X<17){Setpos(X,Y-1);cout<<"━ ●";Setpos(X+1,Y-0.5),cout<<"│>";}if(Thun>0){Setpos(X-2,Y-1),cout<<"▄▄";Setpos(X+2,Y-1),cout<<"▄▄";Setpos(X,Y+2),cout<<"▌";Setpos(X,Y-2.5),cout<<"▌";Setpos(X-1,Y+1),cout<<"█";Setpos(X+1,Y+1),cout<<"█";Setpos(X-1,Y-2),cout<<"█";Setpos(X+1,Y-2),cout<<"█";}if(Magne>0&&T%7<2)Setpos(X,Y),Color(5),cout<<"★";if(Wind>1){if(T%6<2)Color(1);else Color(0);if(T%8<=1){Setpos(X+1,Y-5);cout<<"----  --";Setpos(X,Y-5);cout<<"-  --- -";Setpos(X-1,Y-5);cout<<"--- - --";}else if(T%8<=3){Setpos(X+1,Y-5);cout<<"------  ";Setpos(X,Y-5);cout<<" --  ---";Setpos(X-1,Y-5);cout<<"----- - ";}else if(T%8<=5){Setpos(X+1,Y-5);cout<<"  ------";Setpos(X,Y-5);cout<<"-- --  -";Setpos(X-1,Y-5);cout<<"- ----- ";}else if(T%8<=7){Setpos(X+1,Y-5);cout<<"--  ----";Setpos(X,Y-5);cout<<" --- -- ";Setpos(X-1,Y-5);cout<<"- - ----";}}if(Water!=0){Color(1);if(T%20<5){Setpos(X+2,Y-3);cout<<"■";Setpos(X+1,Y-3.5);cout<<"■";Setpos(X-1,Y-2.5);cout<<"■";Setpos(X-2,Y-3);cout<<"■";}else if(T%20<10||T%20>=15){Setpos(X+2,Y-3);cout<<"■";Setpos(X,Y-4);cout<<"■■";Setpos(X-2,Y-3);  cout<<"■";}else if(T%20<15){Setpos(X+2,Y-3.5);cout<<"■";Setpos(X+1,Y-3);cout<<"■";Setpos(X-1,Y-3.5);cout<<"■";Setpos(X-2,Y-3);cout<<"■";}}if(Fire!=0){if(T%6<3)Color(4);else Color(5);if(Fir>=1)Setpos(X,Y+1),cout<<"●";if(Fir>=2)Setpos(X+1,Y),cout<<"●";if(Fir>=3)Setpos(X-1,Y-1),cout<<"●";}
                }
                if(a==1||a==3){
                    if(B[b].what==1){Nor;Setpos(B[b].x,B[b].y-1);if(ti(B[b].x)==20)cout<<"======";else cout<<"      ";if(B[b].life!=0){B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);if(B[b].How<=1) Color(13);else Color(4);cout<<"●";if(a==1) Pan(1,B[b].x,B[b].y,b);}}
                    if(B[b].what==2){Nor;Setpos(B[b].x-1,B[b].y-1);if(ti(B[b].x-1)==20)cout<<"======";else cout<<"      ";Setpos(B[b].x,B[b].y-1);if(ti(B[b].x)==20)cout<<"======";else cout<<"      ";Setpos(B[b].x+1,B[b].y-1);if(ti(B[b].x+1)==20)cout<<"======";else cout<<"      ";if(B[b].life!=0){B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);Color(5);if(B[b].How==0){Setpos(B[b].x-1,B[b].y),cout<<"↑";Setpos(B[b].x,B[b].y-1),cout<<"←┼ →";Setpos(B[b].x+1,B[b].y),cout<<"↓";}else if(B[b].How==1){Setpos(B[b].x-1,B[b].y-1),cout<<"↖  ↗";Setpos(B[b].x,B[b].y),cout<<"╳";Setpos(B[b].x+1,B[b].y-1),cout<<"↙  ↘";} if(a==1) Pan(2,B[b].x,B[b].y,b);}}
                    if(B[b].what==3||B[b].what==5){Nor;Setpos(B[b].x,B[b].y);if(ti(B[b].x)==20)cout<<"==";else cout<<"  ";if(B[b].life!=0){B[b].y-=B[b].vy;B[b].x-=B[b].vx;Setpos(B[b].x,B[b].y);if(B[b].How==1) Color(5);else Color(4);cout<<"◎";}}
                    if(B[b].what==4){Nor;Setpos(B[b].x,fmax((float)0,B[b].y-8));if(ti(B[b].x)==20){for(int i=max(0,(int)B[b].y-8);i<=B[b].y;i++)cout<<"==";}else {for(int i=max(0,(int)B[b].y-8);i<=B[b].y;i++)cout<<"  ";}if(B[b].life!=0){B[b].y-=B[b].vy;Setpos(B[b].x,fmax((float)0,B[b].y-8));Color(6); for(int i=max(0,(int)B[b].y-8);i<=B[b].y;i++)cout<<"═"; if(a==1) Pan(4,B[b].x,B[b].y,b);}}
                    if(B[b].what==6||B[b].what==8||B[b].what==9){Nor;Setpos(B[b].x-1,B[b].y);if(ti(B[b].x)-1==20)cout<<"==";else cout<<"  ";Setpos(B[b].x+1,B[b].y);if(ti(B[b].x)+1==20)cout<<"==";else cout<<"  ";Setpos(B[b].x,B[b].y-1);if(ti(B[b].x)==20)cout<<"======";else cout<<"      ";if(B[b].life!=0){B[b].y-=B[b].vy;B[b].x-=B[b].vx;Setpos(B[b].x,B[b].y-1);if(B[b].what==6){if(B[b].How<=1) Color(1); else Color(6);}if(B[b].what==9){if(B[b].How<=1) Color(4); else Color(8);}if(B[b].what==8)Color(5);Setpos(B[b].x-1,B[b].y);cout<<"︹";Setpos(B[b].x+1,B[b].y);cout<<"︺";Setpos(B[b].x,B[b].y-1);if(B[b].How%2==1) cout<<"〔●〕"; else cout<<"﹝○﹞"; if(a==1) Pan(6,B[b].x,B[b].y,b);}}
                    if(B[b].what==7){Nor;Setpos(B[b].x,B[b].y);if(B[b].How<0) for(int i=19;i>=20+B[b].How;i--) {Setpos(i,B[b].y);cout<<"  ";}if(B[b].How>0) for(int i=21;i<=20+B[b].How;i++) {Setpos(i,B[b].y);cout<<"  ";}if(B[b].life!=0){B[b].y-=B[b].vy;if(B[b].How<0) for(int i=19;i>=20+B[b].How;i--) {Setpos(i,B[b].y);cout<<"║"; if(a==1) Pan(7,i,B[b].y,b);}if(B[b].How>0) for(int i=21;i<=20+B[b].How;i++) {Setpos(i,B[b].y);cout<<"║"; if(a==1) Pan(7,i,B[b].y,b);}}}
                    if(B[b].what==10||B[b].what==11||B[b].what==12){Nor;Setpos(B[b].x,B[b].y);if(ti(B[b].x)==20)cout<<"==";else cout<<"  ";if(B[b].life!=0){B[b].x-=B[b].vx;B[b].y-=B[b].vy;if(B[b].How==1){B[b].vy-=0.2;}else B[b].vx-=0.35;if(B[b].x>=25) B[b].x=25,B[b].vx*=-0.8;if(B[b].what==11&&B[b].y<=1) B[b].y=1,B[b].vy*=-1;if(B[b].what==12&&B[b].y<=1) B[b].y=1,B[b].vx=0,B[b].vy=-0.5,B[b].How=1;Setpos(B[b].x,B[b].y);if(B[b].what==11)Color(1);else if(B[b].what==12)Color(5);else Color(0);if(B[b].t%4<2)cout<<"▃";else cout<<"▍";if(a==1) Pan(B[b].what,B[b].x,B[b].y,b);}}
                    if(B[b].what>=13&&B[b].what<=17){Nor;Setpos(B[b].x,B[b].y);if(ti(B[b].x)==20)cout<<"====";else cout<<"    ";if(B[b].life!=0){B[b].x-=B[b].vx;B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);if(B[b].what==14) Color(1);else if(B[b].what==15) Color(4);else if(B[b].what==16) Color(5);else if(B[b].what==17) Color(3);else Color(2);cout<<"●";if(B[b].what==14)cout<<"*";if(B[b].what==15)cout<<"";if(B[b].what==16)cout<<"<";if(B[b].what==17)cout<<"X";} if(a==1) Pan(1,B[b].x,B[b].y,b);}
                    if(B[b].what==98&&B[b].life!=0){B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);if(ti(B[b].x==20))cout<<"==";else cout<<"  ";if(B[b].y<=3)B[b].life=0;} 
                    if(B[b].what>=99){if(B[b].y<=3)B[b].life=0;if(B[b].life!=0){B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);Color(5);if(B[b].what==99)cout<<"█";if(B[b].what>=100&&B[b].what<200){if(B[b].what%5==0)cout<<"我";if(B[b].what%5==1)cout<<"是";if(B[b].what%5==2)cout<<"最";if(B[b].what%5==3)cout<<"强";if(B[b].what%5==4)cout<<"的";}if(B[b].what>=200&&B[b].what<300){if(B[b].what%6==0)cout<<"神";if(B[b].what%6==1)cout<<"级";if(B[b].what%6==2)cout<<"怪";if(B[b].what%6==3)cout<<"物";if(B[b].what%6==4)cout<<"之";if(B[b].what%6==5)cout<<"光";}if(B[b].what>=300&&B[b].what<400){if(B[b].what%8==0)cout<<"颤";if(B[b].what%8==1)cout<<"抖";if(B[b].what%8==2)cout<<"吧";if(B[b].what%8==3)cout<<"无";if(B[b].what%8==4)cout<<"能";if(B[b].what%8==5)cout<<"的";if(B[b].what%8==6)cout<<"人";if(B[b].what%8==7)cout<<"类";}if(B[b].what>=400&&B[b].what<500){if(B[b].what%8==0)cout<<"还";if(B[b].what%8==1)cout<<"不";if(B[b].what%8==2)cout<<"快";if(B[b].what%8==3)cout<<"跪";if(B[b].what%8==4)cout<<"倒";if(B[b].what%8==5)cout<<"在";if(B[b].what%8==6)cout<<"朕";if(B[b].what%8==7)cout<<"前";}if(B[b].what>=500&&B[b].what<600){if(B[b].what%8==0)cout<<"看";if(B[b].what%8==1)cout<<"懂";if(B[b].what%8==2)cout<<"这";if(B[b].what%8==3)cout<<"句";if(B[b].what%8==4)cout<<"话";if(B[b].what%8==5)cout<<"的";if(B[b].what%8==6)cout<<"是";if(B[b].what%8==7)cout<<"猪";} if(a==1) Pan(1,B[b].x,B[b].y,b);}}
                    if(B[b].what==-1){Nor;Setpos(B[b].x,B[b].y);if(ti(B[b].x)==20)cout<<"==";else cout<<"  ";if(Boss==0) B[b].life=0;else if(((Boss==1&&abs(B[b].x-Bx1)+abs(B[b].y-By1)<1.5)||(Boss==2&&abs(B[b].x-Bx2)+abs(B[b].y-By2)<1.5)||(Boss==3&&abs(B[b].x-Bx3)+abs(B[b].y-By3)<1.5)||(B[b].t==10))&&B[b].life==1) Bblo-=8+Lv*2,B[b].life=0;if(B[b].life!=0){if(Boss==1)B[b].x=B[b].x+(Bx1-B[b].x)/(10-B[b].t)*1.0,B[b].y=B[b].y+(By1-B[b].y)/(10-B[b].t)*1.0;if(Boss==2)B[b].x=B[b].x+(Bx2-B[b].x)/(10-B[b].t)*1.0,B[b].y=B[b].y+(By2-B[b].y)/(10-B[b].t)*1.0;if(Boss==3)B[b].x=B[b].x+(Bx3-B[b].x)/(10-B[b].t)*1.0,B[b].y=B[b].y+(By3-B[b].y)/(10-B[b].t)*1.0;Setpos(B[b].x,B[b].y);Color(7);if(B[b].t%2==0) cout<<"+";else cout<<"×";}}
                    if(B[b].what<=-2&&B[b].what>=-9){Nor;Setpos(B[b].x-1,B[b].y);if(ti(B[b].x)-1==20)cout<<"==";else cout<<"  ";Setpos(B[b].x+1,B[b].y);if(ti(B[b].x)+1==20)cout<<"==";else cout<<"  ";Setpos(B[b].x,B[b].y-1);if(ti(B[b].x)==20)cout<<"======";else cout<<"      ";if(B[b].life!=0){B[b].y-=B[b].vy;B[b].x-=B[b].vx;if(B[b].what<=-3&&B[b].what>=-7){if(B[b].x<=7)B[b].x=7;if(B[b].x>=28)B[b].x=28;else if(B[b].x>=B[b].a+1&&B[b].How==1)B[b].How=0;else if(B[b].x<=B[b].a-1&&B[b].How==0)B[b].How=1;if(B[b].How==1&&B[b].vx>=-1)B[b].vx-=0.2;if(B[b].How==0&&B[b].vx<=1)B[b].vx+=0.2;}if(B[b].what==-2) Color(3);if(B[b].what==-3) Color(4);if(B[b].what==-4) Color(1);if(B[b].what==-5) Color(0);if(B[b].what==-6) Color(6);if(B[b].what==-7) Color(5);if(B[b].what==-8) Color(2);if(B[b].what==-9) Color(14);if(T%7<=1&&B[b].what==-5)Color(1);else if(T%7<=1)Color(0);Setpos(B[b].x-1,B[b].y);cout<<"︹";Setpos(B[b].x+1,B[b].y);cout<<"︺";Setpos(B[b].x,B[b].y-1);if(B[b].what==-2) cout<<"﹝镖﹞";if(B[b].what==-3) cout<<"﹝火﹞";if(B[b].what==-4) cout<<"﹝水﹞";if(B[b].what==-5) cout<<"﹝风﹞";if(B[b].what==-6) cout<<"﹝雷﹞";if(B[b].what==-7) cout<<"﹝磁﹞";if(B[b].what==-8) cout<<"﹝血﹞";if(B[b].what==-9) cout<<"﹝忍﹞"; if(a==1) Pan(-2,B[b].x,B[b].y,b);}}
                    if(B[b].what==-11||B[b].what==-12){Nor;Setpos(B[b].x,B[b].y);if(ti(B[b].x)==20)cout<<"==";else cout<<"  ";if(B[b].life!=0){if(Magne>0)B[b].How++,B[b].x=B[b].x+(X-B[b].x)/(10-B[b].How)*1.0,B[b].y=B[b].y+(Y-B[b].y)/(10-B[b].How)*1.0;B[b].y-=B[b].vy;Setpos(B[b].x,B[b].y);if(B[b].what==-10) Color(5);if(B[b].what==-11) Color(7);if(T%7<=1)Color(0);cout<<"◆"; if(a==1) Pan(-1,B[b].x,B[b].y,b);}}
                    if(B[b].what==-13){Nor;Setpos(B[b].x,B[b].y-0.5);if(ti(B[b].x)==20)cout<<"===";else cout<<"   ";if(B[b].life!=0){if(B[b].a==13880086){if(Boss==0) B[b].life=0;else if(((Boss==1&&abs(B[b].x-Bx1)+abs(B[b].y-By1)<1.5)||(Boss==2&&abs(B[b].x-Bx2)+abs(B[b].y-By2)<1.5)||(Boss==3&&abs(B[b].x-Bx3)+abs(B[b].y-By3)<1.5)||(B[b].t==5))&&B[b].life==1) Bblo-=8+Lv*2,B[b].life=0;if(B[b].life!=0){if(Boss==1)B[b].x=B[b].x+(Bx1-B[b].x)/(5-B[b].t)*1.0,B[b].y=B[b].y+(By1-B[b].y)/(5-B[b].t)*1.0;if(Boss==2)B[b].x=B[b].x+(Bx2-B[b].x)/(5-B[b].t)*1.0,B[b].y=B[b].y+(By2-B[b].y)/(5-B[b].t)*1.0;if(Boss==3)B[b].x=B[b].x+(Bx3-B[b].x)/(5-B[b].t)*1.0,B[b].y=B[b].y+(By3-B[b].y)/(5-B[b].t)*1.0;}}else{if(B[B[b].a].life==0) B[b].life=0;else if((abs(B[b].x-B[B[b].a].x)+abs(B[b].y-B[B[b].a].y)<1.5||(B[b].t==5))&&B[b].life==1) Exp+=2,B[B[b].a].life=B[b].life=0;if(B[b].life!=0){B[b].x=B[b].x+(B[B[b].a].x-B[b].x)/(5-B[b].t)*1.0,B[b].y=B[b].y+(B[B[b].a].y-B[b].y)/(5-B[b].t)*1.0;}}Setpos(B[b].x,B[b].y-0.5);if(T%6<3)Color(5);else Color(4);cout<<"●";}}
                }if(br<bl) {br=-1,bl=0;memset(B,0,sizeof(B));}Color(0);
            }
            void Move(){
                if(X<3) X=3;if(Y<1) Y=1,Vy=0;if(Y>29) Y=29,Vy=0;
                if(Ice!=0){X-=Vx/2.0;Y+=Vy/2.0;Vy=fmax(Vy-0.025,(float)0);if(T%6==0&&Up==0&&Y<Ding) Y+=0.25;if(T%6==3&&Up==0&&Y>=Ding) Y-=0.25;if(Up==0&&Y<=Ding-1.25) Vy=0.25;if(Up==0&&Y>=Ding+1.25&&Wind==0) Vy=-0.25;if(Up==0&&Down==0&&Vx>0&&X<=18) Up=0,Down=0,Vx=0,Vy=0,X=18,Setpos(20,Y-2.5),cout<<"==========";else if(Down==2&&X<=22) Up=0,Down=1,Vx=0,Vy=0,X=22,Setpos(20,Y-2.5),cout<<"==========";else if(Up==0&&Down==1&&Vx<0&&X>=22) Up=0,Down=1,Vx=0,Vy=0,X=22,Setpos(20,Y-2.5),cout<<"==========";else if(Up>0&&Down==0&&X>18) Up=0,Vx=0,Vy=0,X=18,Setpos(20,Y-2.5),cout<<"==========";else if(Down==2) Vx+=0.175;else if(Up>0&&Upt==0) Vx-=0.175;else if(Up>0&&Upt>0) {Vx=fmax(Vx-0.125,(float)0);if(Upt==1&&T%2==0)Map(-1,0);if(T%2==0)Upt--;}}
                else{X-=Vx;Y+=Vy;Vy=fmax(Vy-0.05,(float)0);if(Wind==0){if(T%6==0&&Up==0&&Y<Ding) Y+=0.5;if(T%6==3&&Up==0&&Y>=Ding) Y-=0.5;}else{if(T%2==0&&Up==0&&Y<Ding) Y+=0.5;if(T%2==1&&Up==0&&Y>=Ding) Y-=0.5;}if(Up==0&&Y<=Ding-1.25) Vy=0.5;if(Up==0&&Y>=Ding+1.25&&Wind==0) Vy=-0.5;if(Up==0&&Down==0&&Vx>0&&X<=18) Up=0,Down=0,Vx=0,Vy=0,X=18,Setpos(20,Y-2.5),cout<<"==========";else if(Down==2&&X<=22) Up=0,Down=1,Vx=0,Vy=0,X=22,Setpos(20,Y-2.5),cout<<"==========";else if(Up==0&&Down==1&&Vx<0&&X>=22) Up=0,Down=1,Vx=0,Vy=0,X=22,Setpos(20,Y-2.5),cout<<"==========";else if(Up>0&&Down==0&&X>18) Up=0,Vx=0,Vy=0,X=18,Setpos(20,Y-2.5),cout<<"==========";else if(Down==2) Vx+=0.35;else if(Up>0&&Upt==0) Vx-=0.35;else if(Up>0&&Upt>0) {Vx=fmax(Vx-0.25,(float)0);if(Upt==1)Map(-1,0); Upt--;}}
                for(int i=bl;i<=br;i++){
                    if(B[i].what<98)if(B[i].x-B[i].vx<=5||B[i].x-B[i].vx>=30||B[i].y-B[i].vy<=0||B[i].y-B[i].vy>=30){B[i].life=0;Map(1,i);}
                    for(int j=0;j<20;j++)if(B[i].what>0&&B[i].life!=0&&abs(B[i].x-I[j][0])<2&&B[i].y-I[j][1]<=2){Setpos(I[j][0],I[j][1]);if(I[j][0]==20) cout<<"===";else cout<<"   ";I[j][0]=I[j][1]=-1;B[i].life=0;Exp+=2;}
                    if(B[i].t>=100)B[i].life=0;if(B[i].life==0&&i==bl) bl++;
                    Map(1,i);if(B[i].life==0) continue;
                    else{B[i].t++;
                        if(B[i].what==1){if(B[i].y<=25&&B[i].How==0) B[i].vy=0,B[i].How=1;if(B[i].t==30) B[i].y+=1.5,B[i].How=2;if(B[i].t==35) B[i].vy=1.5,B[i].How=3;}
                        if(B[i].what==2){if(B[i].t%3==0) B[i].How=!B[i].How;} 
                        if(B[i].what==3||B[i].what==5){if(B[i].what==3&&B[i].y<=20) B[i].vy=0;if(B[i].what==5&&B[i].y<=21) B[i].vy=0;if(B[i].t>30&&B[i].t%2==0) B[i].How=!B[i].How;if(B[i].what==5&&B[i].t<=30&&B[i].x<X) B[i].vx=-0.2;else if(B[i].what==5&&B[i].t<=70&&B[i].x>X) B[i].vx=0.2;else B[i].vx=0;if(B[i].t==45){B[i].life=0;br++;B[br].what=4;B[br].x=B[i].x;B[br].y=32;B[br].vy=3;B[br].life=1;}}
                        if(B[i].what==6||B[i].what==8||B[i].what==9){if(B[i].vx<0.25&&B[i].vy<0.25&&B[i].t>=50){B[i].life=0;if(B[i].life==0&&i==bl) bl++;Map(1,i);break;}if(B[i].t%5==0) B[i].How=rand()%4;if(B[i].what==9){if(B[i].t==7){X9:float xx=(rand()%41)/40.0,yy=(rand()%41)/40.0;if(xx<=0.5&&yy<=0.5) goto X9;for(int j=1;j<=4;j++){br++,B[br].what=9;B[br].t=11;B[br].x=B[i].x,B[br].y=B[i].y,B[br].vx=xx,B[br].vy=yy;if(j%2==0)swap(B[br].vx,B[br].vy),B[br].vy*=-1;if(j<=2)B[br].vx*=-1,B[br].vy*=-1;B[br].life=1;}B[i].life=0;}}if(B[i].what==8){if(B[i].x>X&&B[i].vx<1.2) B[i].vx+=fmax((float)0,0.2-B[i].t/25);if(B[i].x<X&&B[i].vx>-1.2) B[i].vx-=fmax((float)0,0.2-B[i].t/25);if(B[i].y>Y&&B[i].vy<1.2) B[i].vy+=fmax((float)0,0.2-B[i].t/25);if(B[i].y<Y&&B[i].vy>-1.2) B[i].vy-=fmax((float)0,0.2-B[i].t/25);}}
                        if(B[i].what>=13&&B[i].what<=15&&B[i].How!=0){if(B[i].x==B[i].How)B[i].vx=0,B[i].How=0;}
                        if(B[i].what==16){if(B[i].x<X&&B[i].vx>=-1) B[i].vx-=0.2;else if(B[i].x>X&&B[i].vx<=1) B[i].vx+=0.2;}
                    }
                    if(B[i].life==1&&B[i].a==0&&B[i].what>0){if(B[i].y>Y&&abs(B[i].x-X)<=3&&((B[i].x-X)*(B[i].x-X)+(B[i].y-Y)*(B[i].y-Y))<Dis) Dis=(B[i].x-X)*(B[i].x-X)+(B[i].y-Y)*(B[i].y-Y),Disb=i;else if(((B[i].x-X)*(B[i].x-X)+(B[i].y-Y)*(B[i].y-Y))<Dis1) Dis1=(B[i].x-X)*(B[i].x-X)+(B[i].y-Y)*(B[i].y-Y),Disb1=i;}
                }
            }
            void Guai(int R,int r){
                if(R==-1){br++;B[br].what=-1;B[br].x=X+rand()%3-1;B[br].y=Y+rand()%3-1;B[br].life=1;}
                if(R<=-2&&R>=-11){br++;B[br].what=R;B[br].x=B[br].a=r;B[br].y=29;if(R<=-3&&R>=-7)B[br].vx=-1;B[br].vy=1;B[br].life=1;}
                if(R==0){br++;B[br].what=1;B[br].x=r;B[br].y=29;B[br].vy=1;B[br].life=1;}
                if(R==1){br++;B[br].what=2;B[br].x=r;B[br].y=29;B[br].vy=1;B[br].life=1;}
                if(R==2||R==3){br++;B[br].what=2*R-1;B[br].x=r;B[br].y=29;B[br].vy=1;B[br].life=1;}
                if(R==4){br++;B[br].what=6;if(r<5)r=5;if(r>30)r=30;B[br].x=r;if(r==11||r==25) B[br].y=29-(rand()%20);else B[br].y=29;X4:B[br].vx=(rand()%21-10)/30.0;B[br].vy=(rand()%25)/30.0;if(B[br].vx<=0.8&&B[br].vy<=0.8)goto X4;int rx=rand()%50;if(rx==0) B[br].vx=0;B[br].life=1;}
                if(R==5){br++;B[br].How=r;B[br].what=7;if(B[br].How<0) B[br].x=19;if(B[br].How>0) B[br].x=21;B[br].y=29;B[br].vy=1;B[br].life=1;}
            }
            void CpGuai(int R,float x,float y,float xx,float yy){
                if(R==4){br++;B[br].what=6;B[br].x=x;B[br].y=y;B[br].vx=xx;B[br].vy=yy;B[br].life=1;}
                if(R==6||R==7||R==8){br++;B[br].what=4+R;B[br].x=x;B[br].y=y;B[br].vx=xx;B[br].vy=yy;B[br].life=1;}
            }
            void MesGuai(int a,int rr){
                int R=rand()%rr,r=-10086;
                if(R==0){if(a==1) r=(5+rand()%8)*2;if(a<=3&&a!=1) r=10+rand()%16;if(a==4) r=rand()%75-20;if(a==5) r=2+rand()%4;if(r!=-10086) Guai(a,r);}
            }
            void NorGuai(int a,int b){	
                if(a==1) {if(b==1||b==41) Guai(0,15),Guai(0,17),Guai(0,19);if(b==21||b==61) Guai(0,21),Guai(0,23),Guai(0,25);if(b==81) Guai(0,11),Guai(0,13),Guai(0,15),Guai(0,17),Guai(0,19);if(b==101||b==141) Guai(0,17),Guai(0,19),Guai(0,21),Guai(0,23),Guai(0,25);if(b==121) Guai(0,15),Guai(0,17),Guai(0,19),Guai(0,21),Guai(0,23);if(b>=160&&b<=260&&b%10==0) Guai(0,b/10-1);if(b>=270&&b<=370&&b%10==0) Guai(0,52-b/10);if(b>=460&&b<=560&&b%10==0) Guai(0,b/10-37),Guai(0,b/10-36),Guai(0,b/10-35);if(b>=570&&b<=670&&b%10==0) Guai(0,78-b/10),Guai(0,77-b/10),Guai(0,76-b/10);if(b>=760&&b<=960&&b%10==0) Guai(0,b/10-66),Guai(0,b/10-65),Guai(0,103-b/10),Guai(0,104-b/10);if(b>=1000&&b<=1300) MesGuai(0,30-b/50);}
                if(a==2) {if(b<=200&&b%30==1) {int r=rand()%4;if(r==1) r=0;for(int i=0;i<4;i++) if(i!=r) Guai(1,i*4+9);}if(b>200&&b<=220&&b%5==1) Guai(1,18);if(b>220&&b<=300&&b%7==1) Guai(1,b/5-26);if(b>350&&b<=370&&b%5==1) Guai(1,22);if(b>370&&b<=450&&b%7==1) Guai(1,96-b/5);if(b==461||b==501||b==541) Guai(1,13),Guai(1,17),Guai(1,21);if(b==481||b==521||b==561) Guai(1,17),Guai(1,21),Guai(1,25);if(b>=561&&b<=861&&b%20==1) Guai(1,b/40+5);if(b>=561&&b<=861&&b%20==11) Guai(1,35-b/40);if(b>=801&&b<=961&&b%15==1) Guai(1,20);if(b>=1000&&b<=1300) MesGuai(1,30-b/50);}
                if(a==3) {if(b==1||b==61) Guai(3,15),Guai(2,17),Guai(2,19);if(b==31||b==91) Guai(2,21),Guai(2,23),Guai(3,25);if(b>=120&&b<=220&&b%10==0) Guai(2,b/10+3);if(b>=240&&b<=340&&b%10==0) Guai(2,49-b/10);if(b>=360&&b<=460&&b%20==0) Guai(2,b/10-21),Guai(2,61-b/10);if(b>=480&&b<=580&&b%20==0) Guai(3,b/10-33),Guai(3,73-b/10);if(b>=600&&b<750&&b%30==0) {for(int i=0;i<5;i++) Guai(3,i*3+10);}if(b>=750&&b<830&&b%10==0) if(b<=200&&b%40==1) Guai(2,X);if(b>=830&&b<910&&b%20==0) Guai(2,X);if(b>=910&&b<980&&b%10==0) Guai(2,X);if(b>=1000&&b<=1300) MesGuai(rand()%2+2,40-b/50);}
                if(a==4) {if(b==1) CpGuai(4,10,29,-0.4,0.7),CpGuai(4,14,29,-0.2,0.7),CpGuai(4,21,29,0,0.65);if(b==41) CpGuai(4,10,29,-0.2,0.7),CpGuai(4,14,29,-0.1,0.7),CpGuai(4,18,29,0,0.65);if(b==81) CpGuai(4,5,20,-0.4,0.35),CpGuai(4,10,29,-0.4,0.7),CpGuai(4,14,29,-0.2,0.7),CpGuai(4,30,20,0.25,0.4),CpGuai(4,21,29,0,0.65);if(b==121) CpGuai(4,5,20,-0.2,0.35),CpGuai(4,10,29,-0.2,0.7),CpGuai(4,14,29,-0.1,0.7),CpGuai(4,30,20,0.4,0.4),CpGuai(4,18,29,0,0.65);if(b==161) CpGuai(4,10,29,-0.4,0.7),CpGuai(4,14,29,-0.2,0.7),CpGuai(4,21,29,0,0.6),CpGuai(4,10,29,-0.2,0.7),CpGuai(4,14,29,-0.1,0.7),CpGuai(4,18,29,0,0.65);if(b>=200&&b<=500&&b%40==1) {float r=0,rr;for(int i=1;i<=5;i++){X5:rr=0.7+(rand()%5)/10.0;if(rr==r)goto X5;r=rr;CpGuai(4,i*3+7,29,0,0.5+(rand()%50)/80.0);}}if(b>540&&b<=565&&b%5==1) CpGuai(4,5,8,-2,0.2);if(b>590&&b<=615&&b%5==1) CpGuai(4,30,8,1.5,0.2);if(b>640&&b<=665&&b%5==1) CpGuai(4,5,8,-1.5,0.3);if(b>690&&b<=715&&b%5==1) CpGuai(4,30,8,2,0.3);if(b>=750&&b<=950&&b%20==1) {float r=0,rr;for(int i=1;i<=3;i++){X6:rr=0.7+(rand()%5)/10.0;if(rr==r)goto X6;r=rr;CpGuai(4,i*5+7+(rand()%3),29,0,0.5+(rand()%50)/200.0);}}if(b>=1000&&b<=1300) MesGuai(4,5);}
            }
            void RandGood(){
                if(Biao>0){Biao--;Guai(-1,0);}
                if(Gd[1]==0){Gd[1]=rand()%1000+1;if(Win==7)Gd[1]=10086;Gd[3]=rand()%16+8;}
                else if(Gd[1]<=5){Guai(-2-Gd[1],Gd[3]);memset(Gd,0,sizeof(Gd));}
                else if(Gd[1]>=20&&Gd[1]<27){Guai(-8,Gd[3]);memset(Gd,0,sizeof(Gd));}
                else if(Gd[1]>=30&&Gd[1]<37){Guai(-9,Gd[3]);memset(Gd,0,sizeof(Gd));}
                else if(Gd[1]>=40&&Gd[1]<70){Gd[2]++;if(Gd[2]%2==1)Guai(-10,Gd[3]);if(Gd[2]>=9)memset(Gd,0,sizeof(Gd));}
                else if(Gd[1]>=70&&Gd[1]<100){Gd[2]++;if(Gd[2]%2==1)Guai(-11,Gd[3]);if(Gd[2]>=9)memset(Gd,0,sizeof(Gd));}
                else if(Boss!=0&&Gd[1]>=450&&Gd[1]<=500){Guai(-2,Gd[3]);memset(Gd,0,sizeof(Gd));}
                else Gd[1]=0;
                for(int i=0;i<20;i++){if(I[i][0]==-1) continue;Setpos(I[i][0],I[i][1]);Color(0);if(I[i][0]==20) cout<<"===";else cout<<"   ";I[i][1]++;if(I[i][0]>=28||I[i][0]<=0||I[i][1]>=29) I[i][0]=I[i][1]=-1;else Color(1),Setpos(I[i][0],I[i][1]),cout<<"■";Color(0);}
            }
            void Panboss(int bx,int by){
                float Nox[4],Noy[4];Nox[0]=X,Noy[0]=Y;
                if(Down==1&&X==22) Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=X-1,Noy[2]=Y-0.5;
                else if(Down==2) Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=-10,Noy[2]=-10;
                else if(Down==1||X<18) Nox[1]=X-1,Noy[1]=Y-0.5,Nox[2]=-10,Noy[2]=-10;
                else Nox[1]=X+1,Noy[1]=Y-0.5,Nox[2]=X-1,Noy[2]=Y-0.5;
                for(int i=0;i<3;i++){if((Boss==1||Boss==6)&&Wind==0&&Thun==0&&abs(Nox[i]-bx)<1&&abs(Noy[i]-by)<1&&Bgo1[4]==0) Blo-=20,Bgo1[4]=1,Killb=20,Kill=1;if((Boss==2||Boss==6)&&Wind==0&&Thun==0&&abs(Nox[i]-bx)<1&&abs(Noy[i]-by)<1&&Bgo2[8]==0) Blo-=20,Bgo2[8]=1,Killb=20,Kill=1;}
            }
            void Boss1(){
                for(int j=0;j<20;j++)if(abs(Bx1-I[j][0])<2&&By1-I[j][1]<=2){Setpos(I[j][0],I[j][1]);if(I[j][0]==20) cout<<"===";else cout<<"   ";I[j][0]=I[j][1]=-1;Bblo-=8+Lv*2;Exp+=2;}
                if(Bbr==Bbl&&Bbr!=0) Bbr=Bbl=0;
                for(int i=1;i<=3+(Bbl-Bbr)/5;i++)if(Bbr<Bbl){Setpos(Bway[Bbr][0],Bway[Bbr][1]);if(Bway[Bbr][0]==20) cout<<"==";else cout<<"  ";Bbr++;}
                if(Bwhat1==5){int bx,by;Color(5);for(int i=0;i<10;i++){bx=Bx1-i*Bvx1/10.0;by=By1-i*Bvy1/10.0;Setpos(bx,by),cout<<"█";Bbl++;Bway[Bbl][0]=bx;Bway[Bbl][1]=by;}Color(0);}
                Bx1-=Bvx1;By1-=Bvy1;
                if(Bwhat1==0){X2:Bwhat1=rand()%7;if(Bwhat1==2||Bwhat1==3){if(By1<=10||By1>25) goto X2;}if(Bwhat1==4){if(By1<=15||Bx1<20) goto X2;Bgo1[2]=Bx1;Bgo1[3]=By1-1;}if(Bwhat1==5) {X0:Bgo1[3]=rand()%4+1;Bvx1=(rand()%101)/20.0;Bvy1=(rand()%101)/20.0;if(Bgo1[3]<=2) Bvx1*=-1;if(Bgo1[3]%2==1) Bvy1*=-1;if(abs(Bvx1)+abs(Bvy1)<=3||Out1)goto X0;}if(Bwhat1==6){if(By1<=17||By1>25) goto X2;}}
                if(Bwhat1==1){Bgo1[1]++,Bgo1[2]++;int R=rand()%(5-Bgo1[1]),r=rand()%(10-Bgo1[2]);if(Out1) R=0;if(R==0) {int vx=Bvx1,vy=Bvy1;Bgo1[1]=0;Bvx1=(rand()%101-20)/50.0;Bvy1=(rand()%101-20)/50.0;if(Bgo1[3]<=2) Bvx1*=-1;if(Bgo1[3]%2==1) Bvy1*=-1;if(Out1) r=0;} if(r==0) Chang1 }
                if(Bwhat1==2){Bgo1[1]++;if(Bgo1[1]>6){Bvy1=-0.3;br++;B[br].x=Bx1,B[br].y=By1-1;B[br].what=6;X3:B[br].vx=(rand()%21-10)/40.0;B[br].vy=(rand()%25)/30.0;if(B[br].vx<=0.8&&B[br].vy<=0.8)goto X3;int rx=rand()%50;if(rx==0) B[br].vx=0;B[br].life=1;}if(Bgo1[1]>8) Chang1}
                if(Bwhat1==3){Bgo1[1]++;if(Bgo1[1]>6&&Bgo1[1]%3==0){Bvy1=-0.3;br++;B[br].x=Bx1,B[br].y=By1-1;B[br].what=8;B[br].life=1;}if(Bgo1[1]>15) Chang1}
                if(Bwhat1==4){Bgo1[1]++;if(Bgo1[1]<=8){Setpos(Bgo1[2],Bgo1[3]);if(Bgo1[1]==1)cout<<" ";else if(Bgo1[1]>1&&Bgo1[2]==20) cout<<"==";else cout<<"  ";Bgo1[2]--;Setpos(Bgo1[2],Bgo1[3]);int r=rand()%4;if(r%2==0) Color(6);else Color(9);if(r<2) cout<<") ";else cout<<"】";Color(0);}if(Bgo1[1]==6) Bgo1[5]=X,Bgo1[6]=Y;if(Bgo1[1]==11){Map(0,(bool)Kill);Setpos(Bgo1[5],Bgo1[6]+1),cout<<"  ";Setpos(Bgo1[5],Bgo1[6]-1),cout<<"  ";Setpos(Bgo1[5]+1,Bgo1[6]),cout<<"  ";Setpos(Bgo1[5]-1,Bgo1[6]),cout<<"  ";int bx,by,bvx=Bgo1[2]-Bgo1[5],bvy=Bgo1[3]-Bgo1[6];Color(6);int i=0;while(1){bx=Bgo1[2]-i*bvx/30.0;by=Bgo1[3]-i*bvy/30.0;if(bx<=5||bx>=30||by<0||by>=29) break;Panboss(bx,by);Setpos(bx,by),cout<<"█";Bbl++;Bway[Bbl][0]=bx;Bway[Bbl][1]=by;i++;}Color(0);Map(-1,0);Chang1}}
                if(Bwhat1==5){Bgo1[1]++,Bgo1[2]++;int R=rand()%(5-Bgo1[1]),r=rand()%(10-Bgo1[2]);if(Out1) R=0;if(R==0) {int vx=Bvx1,vy=Bvy1;Bgo1[1]=0;X1:Bvx1=(rand()%101-20)/20.0;Bvy1=(rand()%101-20)/20.0;if(Bgo1[3]<=2) Bvx1*=-1;if(Bgo1[3]%2==1) Bvy1*=-1;if(abs(Bvx1)+abs(Bvy1)<=3||abs(Bvx1-vx)<=1||abs(Bvy1-vy)<=1)goto X1;if(Out1) r=0;} if(r==0) Chang1 }
                if(Bwhat1==6){Bgo1[1]++;if(Bgo1[1]>6&&Bgo1[1]%10==0){By1-=1;br++;B[br].x=Bx1,B[br].y=By1-1;B[br].what=9;X30:B[br].vy=1;B[br].life=1;}if(Bgo1[1]>31) Chang1}
            }
            void Boss2(){
                for(int j=0;j<20;j++)if(abs(Bx2-I[j][0])<2&&By2-I[j][1]<=2){Setpos(I[j][0],I[j][1]);if(I[j][0]==20) cout<<"===";else cout<<"   ";I[j][0]=I[j][1]=-1;Bblo-=8+Lv*2;Exp+=2;}
                if(Bbr==Bbl&&Bbr!=0) Bbr=Bbl=0;
                for(int i=1;i<=3+(Bbl-Bbr)/5;i++)if(Bbr<Bbl){Setpos(Bway[Bbr][0],Bway[Bbr][1]);if(Bway[Bbr][0]==20) cout<<"==";else cout<<"  ";Bbr++;}
                Bx2-=Bvx2;By2-=Bvy2;
                if(Bwhat2==0){X21:Bwhat2=rand()%7;if(Bwhat2==2){X31:for(int i=1;i<=3;i++){Bgo2[i*2+1]=rand()%28+1,Bgo2[i*2]=rand()%25+5;if((abs(Bgo2[i*2]-Bx2)<=2&&abs(Bgo2[i*2+1]-By2)<=2)||(abs(Bgo2[i*2]-X)<=2&&abs(Bgo2[i*2+1]-Y)<=2))goto X31;}if(Bgo2[2]==Bgo2[4]||Bgo2[2]==Bgo2[6]||Bgo2[6]==Bgo2[4]||Bgo2[5]==Bgo2[3]||Bgo2[3]==Bgo2[7]||Bgo2[5]==Bgo2[7]) goto X31;}if(Bwhat2==3){Bgo2[2]=rand()%2;}if(Bwhat2==4||Bwhat2==5||Bwhat2==6){Bvy2=-1.5;Bvx2=-0.5;}}
                if(Bwhat2==1){Bgo2[1]++,Bgo2[2]++;int R=rand()%(5-Bgo2[1]),r=rand()%(30-Bgo2[2]);if(Out2) R=0;if(R==0) {int vx=Bvx2,vy=Bvy2;Bgo2[1]=0;Bvx2=(rand()%101-20)/50.0;Bvy2=(rand()%101-20)/50.0;if(Bgo2[3]<=2) Bvx2*=-1;if(Bgo2[3]%2==1) Bvy2*=-1;if(Out2) r=0;} if(r==0) Chang2 }
                if(Bwhat2==2){Bgo2[1]++;float bx,by,bvx,bvy;if(Bgo2[1]<21){for(int i=1;i<=3;i++){bvx=Bgo2[i*2]-Bx2,bvy=Bgo2[i*2+1]-By2;if(Bgo2[1]<=10){Setpos(Bx2+(Bgo2[1]-1)*bvx/10.0,By2+(Bgo2[1]-1)*bvy/10.0);if(abs(Bx2+(Bgo2[1]-1)*bvx/10.0-20)<0.5)cout<<"==";else cout<<"  ";bx=Bx2+Bgo2[1]*bvx/10.0;by=By2+Bgo2[1]*bvy/10.0;Setpos(bx,by);}else Setpos(Bgo2[i*2],Bgo2[i*2+1]);int r=rand()%4;if(r%2==0) Color(3);else Color(10);if(r<=1) cout<<"×";else cout<<"+";Color(0);}}if(Bgo2[1]==21){Map(0,(bool)Kill);Color(3);int j=0;for(int j=0;j<=30;j++)for(int i=1;i<=3;i++)for(int k=1;k<=4;k++){if(k==1) bvx=j,bvy=0;if(k==2) bvx=-j,bvy=0;if(k==3) bvx=0,bvy=j;if(k==4) bvx=0,bvy=-j;bx=Bgo2[i*2]+bvx,by=Bgo2[i*2+1]+bvy;if(bx<=5||bx>=30||by<0||by>=30) {continue;}Panboss(bx,by);Setpos(bx,by),cout<<"█";Bbl++;Bway[Bbl][0]=bx;Bway[Bbl][1]=by;}Color(0);Map(-1,0);Chang2}}
                if(Bwhat2==3){Bgo2[1]++;if(Bgo2[1]<=18){if(Bgo2[3]==0) Setpos(Bgo2[4]-3,Bgo2[5]),cout<<"  ",Setpos(Bgo2[4]+3,Bgo2[5]),cout<<"  ",Color(0),Setpos(20,Bgo2[5]),cout<<"==";if(Bgo2[3]==1) Setpos(Bgo2[4],Bgo2[5]-3.5),cout<<"    ",Setpos(Bgo2[4],Bgo2[5]+2.5),cout<<"    ",Color(0),Setpos(20,Bgo2[5]+2.5),cout<<"====",Setpos(20,Bgo2[5]-3.5),cout<<"====";if(Bgo2[1]%4==0)Bgo2[3]=!Bgo2[3];if(Bgo2[1]%6<3)Color(3);else Color(5);if(Bgo2[3]==0) Setpos(X-3,Y),cout<<"▼",Setpos(X+3,Y),cout<<"▲",Bgo2[4]=(int)(X+0.5),Bgo2[5]=(int)(Y+0.5);if(Bgo2[3]==1) Setpos(X,Y-3),cout<<" ",Setpos(X,Y+3),cout<<" ",Bgo2[4]=(int)(X+0.5),Bgo2[5]=(int)(Y+0.5);Color(0);}if(Bgo2[1]==18){if(Bgo2[3]==0) Setpos(Bgo2[4]-3,Bgo2[5]),cout<<"  ",Setpos(Bgo2[4]+3,Bgo2[5]),cout<<"  ",Color(0),Setpos(20,Bgo2[5]),cout<<"==";if(Bgo2[3]==1) Setpos(Bgo2[4],Bgo2[5]-3.5),cout<<"    ",Setpos(Bgo2[4],Bgo2[5]+2.5),cout<<"    ",Color(0),Setpos(20,Bgo2[5]+2.5),cout<<"====",Setpos(20,Bgo2[5]-3.5),cout<<"====";}if(Bgo2[1]>18&&Bgo2[1]<=25){Bgo2[3]=Bgo2[2];if(Bgo2[3]==0) Setpos(Bgo2[4]-3,Bgo2[5]),cout<<"  ",Setpos(Bgo2[4]+3,Bgo2[5]),cout<<"  ",Color(0),Setpos(20,Bgo2[5]),cout<<"==";if(Bgo2[3]==1) Setpos(Bgo2[4],Bgo2[5]-3.5),cout<<"    ",Setpos(Bgo2[4],Bgo2[5]+2.5),cout<<"    ",Color(0),Setpos(20,Bgo2[5]+2.5),cout<<"====",Setpos(20,Bgo2[5]-3.5),cout<<"====";if(Bgo2[1]%4<2)Color(3);else Color(5);if(Bgo2[3]==0) Setpos(Bgo2[4]-3,Bgo2[5]),cout<<"▼",Setpos(Bgo2[4]+3,Bgo2[5]),cout<<"▲";if(Bgo2[3]==1) Setpos(Bgo2[4],Bgo2[5]-3),cout<<" ",Setpos(Bgo2[4],Bgo2[5]+3),cout<<" ";Color(0);}if(Bgo2[1]==25){if(Bgo2[2]==0){Color(3);for(int i=4;i<=29;i++){Setpos(i,Bgo2[5]),cout<<"█";Bbl++;Panboss(i,Bgo2[5]);Bway[Bbl][0]=i;Bway[Bbl][1]=Bgo2[5];}}if(Bgo2[2]==1){Color(3);for(int i=0;i<=28;i++){Setpos(Bgo2[4],i),cout<<"█";Bbl++;Panboss(Bgo2[4],i);Bway[Bbl][0]=Bgo2[4];Bway[Bbl][1]=i;}}Chang2}}
                if(Bwhat2==4||Bwhat2==5||Bwhat2==6){Bgo2[1]++;if(By2>27)Bvy2=0;if(Bx2>23)Bvx2=0;if(Bgo2[1]>13&&Bgo2[1]%3==0){float t=By2-Y,g=0.35;if(Boss==6) t/=2.0;CpGuai(Bwhat2+2,Bx2,By2,(Bx2-X)/t*1.0+(t-1)*g/2.0,1);}if(Bgo2[1]>20) Chang2}
            }
            void Boss3(){
                #define Bean br++;B[br].what=13;B[br].x=Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].life=1;
                for(int j=0;j<20;j++)if(abs(Bx3-I[j][0])<2&&By3-I[j][1]<=2){Setpos(I[j][0],I[j][1]);if(I[j][0]==20) cout<<"===";else cout<<"   ";I[j][0]=I[j][1]=-1;Bblo-=8+Lv*2;Exp+=2;}
                Bx3-=Bvx3;By3-=Bvy3;
                if(Bwhat3<=8){if(Bx3>X&&Bvx3<1.5) Bvx3+=0.3;if(Bx3<X&&Bvx3>-1.5) Bvx3-=0.3;}
                if(Bwhat3==0){X22:Bwhat3=rand()%12;if(Bwhat3==11&&abs(Bx3-20)<=1)goto X22;if(Bwhat3==11)Bgo3[2]=rand()%5;}
                if(Bwhat3==1){Bgo3[1]++;if(Bgo3[1]==6){br++;B[br].what=13;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=1;B[br].How=(int)Bx3-4;B[br].life=1;br++;B[br].what=13;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=-1;B[br].How=(int)Bx3+2;B[br].life=1;br++;B[br].what=13;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].life=1;Chang3}}
                if(Bwhat3>=2&&Bwhat3<=6){Bgo3[1]++;if(Bgo3[1]==6){br++;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].what=11+Bwhat3;B[br].vy=0.5+(rand()%100)/80.0;if(Bwhat3==5)B[br].vy=B[br].vy*3/4.0;B[br].life=1;Chang3}}
                if(Bwhat3==7){Bgo3[1]++;if(Bgo3[1]==6){br++;B[br].what=14;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=1;B[br].How=(int)Bx3-4;B[br].life=1;br++;B[br].what=14;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=-1;B[br].How=(int)Bx3+2;B[br].life=1;br++;B[br].what=14;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].life=1;Chang3}}
                if(Bwhat3==8){Bgo3[1]++;if(Bgo3[1]==6){br++;B[br].what=15;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=1;B[br].How=(int)Bx3-4;B[br].life=1;br++;B[br].what=15;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].vx=-1;B[br].How=(int)Bx3+2;B[br].life=1;br++;B[br].what=15;B[br].x=(int)Bx3-1,B[br].y=By3-1;B[br].vy=1;B[br].life=1;Chang3}}
                if(Bwhat3==9){Bvx3=0;Bgo3[1]++;if(Bgo3[1]==6||Bgo3[1]==8){Bean}if(Bgo3[1]>=8)Chang3}
                if(Bwhat3==10){Bvx3=0;Bgo3[1]++;if(Bgo3[1]==6||Bgo3[1]==8||Bgo3[1]==10||Bgo3[1]==12){Bean}if(Bgo3[1]>=12)Chang3}
                if(Bwhat3==11){Bvx3=0;Bgo3[1]++;if(Bgo3[1]>=8)for(int i=1;i<=4;i++){br++;B[br].what=80+100*Bgo3[2]+Bgo3[1]*4+i;B[br].x=Bx3-1,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=99;B[br].x=Bx3,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=99;B[br].x=Bx3-2,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;}if(Bgo3[1]>=20){for(int i=1;i<=4;i++){br++;B[br].what=98;B[br].x=Bx3-1,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=98;B[br].x=Bx3,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=98;B[br].x=Bx3-2,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;}Chang3}}
            }
            void Ball(int ball){
                if(ball==1){if(Fir<3&&T%8==0) Fir++;if(Fir>0){br++;B[br].what=-13;B[br].x=X;B[br].y=Y+rand()%3-1;B[br].life=1;if(Dis<=30) B[br].a=Disb,B[Disb].a=1,Fir--;else if(Boss!=0) B[br].a=13880086,Fir--;else if(Dis!=13880087) B[br].a=Disb,B[Disb].a=1,Fir--;else if(Dis1!=13880087) B[br].a=Disb1,B[Disb1].a=1,Fir--;else B[br].life=0;Dis=Dis1=13880087;}}
                if(ball==2){if(T%4==0)ib=(ib+1)%20,I[ib][1]=Y-2;if(T%16==0)I[ib][0]=X;if(T%16==4)I[ib][0]=X-1;if(T%16==8)I[ib][0]=X+1;if(T%16==12)I[ib][0]=X-2;if(T%12==9)I[ib][0]=X+2;if(Water==1){for(int i=X-6;i<=X+6;i++)ib=(ib+1)%20,I[ib][0]=i,I[ib][1]=Y-2-0.5*abs(i-X);}}
                if(ball==3){if(Wind>5){if(Y<Ding-1)Vy=5;else Vy=0;if(Up>=1) Vx=-5;if(Down==2) Vx=5;}if(Wind<5){if(Y>Ding-1)Vy=-5;else Vy=0;if(Up>=1) Vx=-5;if(Down==2) Vx=5;}if(Wind==5){if(Boss==2) Ding=12.25;else Ding=6.25;if(Boss!=0) Bblo-=16+Lv*4;if(Boss==1) Chang1 if(Boss==2) Chang2 if(Boss==3) Chang3 system("color 3F");Sleep(20);system("color 6F");Sleep(10);system("color 0F");system("cls");for(int i=bl;i<=br;i++)if(B[i].what>0)B[i].life=0;Setpos(20,0);for(int i=1;i<=60;i++) printf("=");}}
                if(ball==4){if(Thun==1){if(Boss!=0) Bblo-=16+Lv*4;if(Boss==1) Chang1 if(Boss==2) Chang2 if(Boss==3) Chang3 system("color 9F");Sleep(20);system("color 6F");Sleep(10);system("color 0F");system("cls");for(int i=bl;i<=br;i++)if(B[i].what>0)B[i].life=0;Setpos(20,0);for(int i=1;i<=60;i++) printf("=");}}
                if(ball==5){system("cls"); Color(5);Setpos(10,10);cout<<"新天赋!";Y:int rr=rand()%4+2;Setpos(12,10);if(rr==Ren) goto Y;if(rr==2)cout<<"瞬跳";if(rr==3)cout<<"空之舞";if(rr==4)cout<<"三段跳";if(rr==5)cout<<"反重力跳跃";Setpos(14,10);cout<<"当前天赋:";if(Ren==1)cout<<"小无敌";if(Ren==2)cout<<"瞬跳";if(Ren==3)cout<<"空之舞";if(Ren==4)cout<<"三段跳";if(Ren==5)cout<<"反重力跳跃";Setpos(16,10);cout<<"换否?(y/n)";G:char g=_getch();if(g=='y')Ren=rr;else if(g!='n')goto G;system("cls");Setpos(20,0);Color(0);for(int i=1;i<=60;i++) printf("=");}
                if(ball==6){Color(4);for(float i=1;i<=Bblo;i+=Bblomax/20.0)cout<<"▄";Color(0);cout<<' '<<Bblo<<"                              ";Color(0);}
                if(ball==7){Color(1);if(Win==7&&T%6<3)Color(3);for(float i=1;i<=Blo;i+=Blomax/20.0)cout<<"▄";Color(0);if(Win==7&&T%6<3)Color(3);printf(" %0.1f                              ",Blo);}
            }
            int main(){
                system("mode con cols=60 lines=37");CONSOLE_CURSOR_INFO cursor_info={1,0};SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE),&cursor_info);srand((unsigned)time(NULL));
                Win=0;Ren=1;Lv=1;Blo=Blomax=100;Expmax=300;Hui=15;X=18,Y=6;
                ReStart:system("cls");memset(B,0,sizeof(B));memset(I,-1,sizeof(I));T=0;bl=0;br=-1;Upt=0;
                Start:Blo=Blomax * 100;Ding=6.25;
                memset(Bgo1,0,sizeof(Bgo1));memset(Bgo2,0,sizeof(Bgo2));memset(Bgo3,0,sizeof(Bgo3));
                if(Win%2==0) T=0;if(Win%2==0&&D==0){if(Win>0)Ball(5);Boss=0;lL:L=rand()%4+1;for(int i=0;i<=Win/2-1;i++)if(L==Ll[i]) goto lL;Ll[Win/2]=L;}if(Win%2==1&&D==0){if(Win==7)Boss=6,T=0,Blomax+=100;else{bl:Boss=rand()%3+1;for(int i=0;i<=3;i++)if(Boss==Bl[i]) goto bl;}Bl[Win/2]=Boss;Bwhat1=Bwhat2=Bwhat3=0,Bx1=10,By1=20,Bx2=15,By2=20,Bx3=21,By3=20;system("color 4C");Sleep(20);system("color 0F");Map(0,1);Sleep(1000);}if(Win%2==1){Bblomax=500+(Win/2)*500;Bblo=Bblomax;if(Boss==2) Ding=12.25;}
                while(1){
                    T++;
                    if(Wind==0){if(GetAsyncKeyState(VK_LEFT)&0x8000) Vy=-(10-abs(Ding-Y)*1.5)/20.0;if(GetAsyncKeyState(VK_RIGHT)&0x8000) Vy=(10-abs(Ding-Y)*1.5)/20.0;}if(GetAsyncKeyState(VK_UP)&0x8000&&u1==0) {u1++;if(Down==1){Down=0;Up=0;if(Ren==2)Map(-1,0),Vx=0,X=18,Li=5;else Vx=7,Vy=0.3;}else if(Up==0&&Wind==0) {Down=0;Up=1;if(Ren==2)Map(-1,0),Vx=1,X=10,Map(0,3),Li=5;else Vx=2,Vy=0.1;}else if(Up==1&&Wind==0) {Down=0;Up=2;if(Ren==2)Map(-1,0),Vx=1,X-=6,Map(0,3),Li=5;else Vx=1.5,Vy=0.1;}else if(Ren==3&&Up==2&&Wind==0) {Down=0;Up=3;Vx=1;Vy=0.5;Upt=30;}else if(Ren==4&&Up==2&&Wind==0) {Down=0;Up=3;Vx=1.8;Vy=0.1;}}if(GetAsyncKeyState(VK_DOWN)&0x8000&&u2==0) {u2++;if(Down==1&&Ren==5){Down=2;Up=0;Vx=-1.7;}else {Down=1;Up=0;if(Ren==2)Map(-1,0),Vx=0,X=22,Map(0,3),Li=5;else {if(Upt!=0) Map(-1,0),Upt=0;Vx=-7;}}}if((GetAsyncKeyState(VK_UP)&0x8000) ?0:1) u1=0;if((GetAsyncKeyState(VK_DOWN)&0x8000) ?0:1) u2=0;if(kbhit()){char g=_getch();if(g==' ') Sleep(100),Setpos(4,1),Sy++,system("pause");}if(Sy==1) Setpos(4,1),printf("                           "),Sy--;
                    if(Drug==0) Blo=fmin((float)Blomax,Blo+Hui/100.0);else if(T%10==0)Blo--;if(T%20==0) {if(Kill!=0) Kill=0;if(Lvl!=0) Lvl=0;}if(Killb>0) Killb--;if(Li>0) Li--;if(Ice>0) Ice--;if(Drug>0) Drug--;if(Magne>0) Magne--;
                    if(Fire>0) Ball(1),Fire--;if(Water>0) Ball(2),Water--;if(Wind>0) Ball(3),Wind--;if(Thun>0) Ball(4),Thun--;
                    if(Boss==0) NorGuai(L,T%1500);RandGood();if(T%20==1)Exp++;
                    if(T%50==1){Exp++;system("cls");Setpos(20,0);Color(0);for(int i=1;i<=60;i++) printf("=");if(Win==0&&T<300){Setpos(4,6);cout<<"↑/↓ 跳跃/下翻,←→ 些微移动(松手即返回)"; Setpos(8,6);cout<<"球可以开启特殊效果,经验积满(300)可提升级别。";Setpos(8,6);cout<<"打败 7 波即胜利,打败 BOSS 有新天赋。";Setpos(10,15);cout<<"空格可以暂停。";}}
                    Map(-1,0);
                    if(Boss==1) Boss1();if(Boss==2) Boss2();if(Boss==3) Boss3();if(Boss==6) Boss1(),Boss2(),Boss3();
                    Move();Map(0,(bool)Kill);Color(0);
                    Setpos(1,1);Blo=fmin(Blo,(float)Blomax);if(Boss==0)cout<<"血量: "<<(int)Blo<<"  ";Color(0);Setpos(1,9),cout<<"死亡次数: "<<D<<"  ";Setpos(2,1);Exp=min(Exp,Expmax);if(Exp>=Expmax)Exp=0,Lv++,Lvl++,Hui++,Blomax+=5;if(Lvl>0)Color(5);cout<<"级别: "<<Lv;Color(0);Setpos(2,9);cout<<"经验: "<<Exp<<"  ";if(Boss>0) Setpos(3,1),cout<<"血量     : ",Ball(7);if(Boss>0&&Boss!=6) Setpos(4,1),cout<<"怪物血量: ",Ball(6);if(Boss==6) Setpos(1,9),printf("时间: %0.1f s  ",T/15.0);
                    if(Win==0) Sleep(55);if(Win==1) Sleep(50);if(Win==2) Sleep(35);if(Win==3) Sleep(40);if(Win==4) Sleep(25);if(Win==5) Sleep(30);if(Win==6) Sleep(20);if(Win>=7) Sleep(17);
                    if(Boss==3&&Bblo<=0){for(int i=1;i<=4;i++){br++;B[br].what=98;B[br].x=Bx3-1,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=98;B[br].x=Bx3,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;br++;B[br].what=98;B[br].x=Bx3-2,B[br].y=By3-1+i;B[br].vy=4;B[br].life=1;}}
                    if((Win%2==0&&T>=1400)||(Win%2==1&&Bblo<=0)||(Win==7&&T>=450)||Blo<=0) {Map(-1,0);break;}
                }
            	if(Blo<=0){
            		Sleep(1000);
            		D++;
            		system("color 7F");
            		Setpos(15,11);
            		Color(4);
            		cout<<"GAME OVER...";
            		Sleep(2000);
            		goto ReStart;
            	}
            	else if(Win==6){
            		system("color 7F");
            		Setpos(15,11);
            		Color(4);
            		cout<<"坚持2秒 !";
            		Sleep(200);
            		Setpos(0.2,0);
            		Win++;
            		D=0;
            	}
            	else if(Win==7){
            		Sleep(1000);
            		system("color 6E");
            		Setpos(15,11);
            		Color(5);
            		cout<<"YOU WIN !";
            		Sleep(2000);
            		Setpos(30,0);
            		return 0;
            	}else Sleep(1000),Win++,D=0;
            	goto Start;
            }
            
            
            

            游戏,挺难

            • @ 2025-2-9 10:23:08

              想给被人推荐一下,并非抄袭

          • @ 2025-2-9 9:15:41

            徽章颜色只能用https://tool.chinaz.com/Tools/web 里的吗

          • @ 2025-2-6 22:21:31

            @ TooY0ung TooYoung的诅咒2.0 我提交的是同一份代码,AC的样例数还不同,还有部分样例 Cancelled 了,尽快修复

          • @ 2025-2-5 15:14:24

            论Hydro变成芒果视频这件事

            • @ 2025-2-3 12:53:42

              是谁?

              • @ 2025-2-4 11:29:25

                系统默认用户

            • @ 2025-2-2 12:13:15

              33doc什么时候搬ccf大纲

              • @ 2025-1-31 19:24:38

                嘿嘿

              • @ 2025-1-29 0:10:13
                • @ 2025-1-27 16:33:14

                  春节欢乐杯_预选赛及赛事公告 各网站链接均在此

                  • @ 2025-1-26 16:57:42
                    • @ 2025-1-25 22:21:43

                      @renmafan ##首页点击自己头像,题库-我创建的题目,点"创建题目"即可

                      • @ 2025-1-25 22:16:24

                        @ emmm……

                      • @ 2025-1-24 15:22:12

                        图的及本代码(有点偷懒...^_^)2:

                        #include<bits/stdc++.h>
                        #define int long long
                        using namespace std;
                        vector<int>t[10];
                        bool v[10];
                        void d(int p){
                        	cout<<char(p+'A');
                        	for(int i=0;i<t[p].size();i++){
                        		if(v[t[p][i]]==0){
                        			v[t[p][i]]=1;
                        			d(t[p][i]);
                        		}
                        	}
                        }
                        queue <int>q;
                        void b(int p){
                        	q.push(p);
                        	v[p]=1;
                        	while(!q.empty()){
                        		p=q.front();
                        		cout<<char(p+'A');
                        		q.pop();
                        		for(int i=0;i<t[p].size();i++){
                        			if(v[t[p][i]]==0){
                        				v[t[p][i]]=1;
                        				q.push(t[p][i]);
                        			}
                        		}
                        	}
                        }
                        signed main(){
                        	t[0].push_back(1);
                        	t[1].push_back(0);
                        	t[1].push_back(2);
                        	t[1].push_back(4);
                        	t[2].push_back(1);
                        	t[2].push_back(3);
                        	t[3].push_back(2);
                        	t[4].push_back(1);
                        	t[4].push_back(5);
                        	t[5].push_back(4);
                        	char s;
                        	cin>>s;
                        	v[s-'A']=1;
                        	cout<<"d:";
                        	d(s-'A');
                        	for(int i=0;i<6;i++){
                        		v[i]=0;
                        	}
                        	cout<<endl;
                        	cout<<"b:";
                        	b(s-'A');
                        	return 0;
                        }
                        
                        
                        • @ 2025-1-24 14:48:48

                          图的及本代码(有点偷懒...^_^):

                          #include<bits/stdc++.h>
                          #define int long long
                          using namespace std;
                          int g[10][10]={
                          	{0,1,0,0,0,0},
                          	{1,0,1,0,1,0},
                          	{0,1,0,1,0,0},
                          	{0,0,1,0,0,0},
                          	{0,1,0,0,0,1},
                          	{0,0,0,0,1,0},
                          };
                          bool v[10];
                          void d(int p){
                          	cout<<char(p+'A');
                          	for(int i=0;i<6;i++){
                          		if(g[p][i]==1&&v[i]==0){
                          			v[i]=1;
                          			d(i);
                          		}
                          	}
                          }
                          queue <int>q;
                          void b(int p){
                          	q.push(p);
                          	v[p]=1;
                          	while(!q.empty()){
                          		p=q.front();
                          		cout<<char(p+'A');
                          		q.pop();
                          		for(int j=0;j<6;j++){
                          			if(g[p][j]==1&&v[j]==0){
                          				v[j]=1;
                          				q.push(j);
                          			}
                          		}
                          	}
                          }
                          signed main(){
                          	char s;
                          	cin>>s;
                          	v[s-'A']=1;
                          	cout<<"d:";
                          	d(s-'A');
                          	cout<<endl;
                          	for(int i=0;i<6;i++){
                          		v[i]=0;
                          	}
                          	cout<<"b:";
                          	b(s-'A');
                          	return 0;
                          }
                          
                          
                        • @ 2025-1-24 14:14:54

                          洛谷题目

                          本人原创

                          自制样例

                          自己写过标程,全部ACAC

                          至于为什么我只做了5道题,因为我懒的做了时间不多

                          要样例的,洛谷联系我

                          题目:

                          U527998 普及-

                          U527911 普及-

                          U528115 普及-

                          U528927 入门

                          U528932 入门

                        • @ 2025-1-23 22:00:58
                          • @ 2025-1-23 8:40:28
                            #include<bits/stdc++.h>
                            #define fi first
                            #define se second
                            using namespace std;
                            typedef long long ll;
                            const ll MX = 0;
                            const ll P1 = 131LL;
                            const ll P2 = 151LL;
                            const ll P3 = 1331LL;
                            const ll mod1 = 1e9 + 7;
                            const ll mod2 = 998244353;
                            namespace INT
                            {
                            	struct lll
                            	{
                            		int a[5010];
                            	};
                            	lll string_lll(string s)
                            	{
                            		lll res;
                            		res.a[0] = s.size();
                            		for(int i = 0; i < s.size(); i++)
                            			res.a[res.a[0] - i] = s[i] - '0';
                            		return res;
                            	}
                            	void operator <<(ostream &os, lll x)
                            	{
                            		for(int i = x.a[0]; i >= 1; i--)
                            		{
                            			os << x.a[i];
                            		}
                            	}
                            	void operator >>(istream &is, lll &x)
                            	{
                            		string s;
                            		is >> s;
                            		x.a[0] = s.size();
                            		for(int i = 0; i < s.size(); i++)
                            			x.a[x.a[0] - i] = s[i] - '0';
                            	}
                            	lll operator +(lll a, lll b)
                            	{
                            		lll c;
                            		memset(c.a, 0, sizeof c.a);
                            		c.a[0] = max(a.a[0], b.a[0]) + 1;
                            		for(int i = 1; i <= max(a.a[0], b.a[0]); i++)
                            		{
                            			c.a[i] += a.a[i] + b.a[i];
                            			if(c.a[i] >= 10)
                            				c.a[i] -= 10, c.a[i + 1] = 1;
                            		}
                            		while(c.a[c.a[0]] == 0 && c.a[0] != 1)
                            			c.a[0]--;
                            		return c;
                            	}
                            }
                            using namespace INT;
                            lll pi[1010];
                            int main()
                            {
                            	ios::sync_with_stdio(0);
                            	cin.tie(0);
                            	cout.tie(0);
                            	pi[2] = pi[1] = string_lll("1");
                            	for(int i = 3; i <= 1000; i++)
                            		pi[i] = pi[i - 1] + pi[i - 2];
                            	int n, x;
                            	cin >> n;
                            	while(n--)
                            	{
                            		cin >> x;
                            		cout << pi[x];
                            		cout << '\n';
                            	}
                            	return 0;
                            }
                            
                            
                            • @ 2025-1-22 22:26:36

                              【比赛公告】

                              不好意思,又得延期了qwq

                              T1测完啦!

                              T2数据马上做完啦!

                              T3数据马上做完啦!

                              T4数据马上做完啦!

                              1月25日没开赛的话每人送两瓶可乐!!!

                            • @ 2025-1-22 16:18:08

                              我的P1435怎么RE了?????????????

                              #include <bits/stdc++.h>
                              #define ll long long
                              using namespace std;
                              string s1,s2;
                              int siz,dp[5010][5010];
                              int main()
                              {
                              	ios::sync_with_stdio(false);
                              	cin.tie(0);
                              	cin >> s1;
                              	siz = (int)s1.size();
                              	s1 = " " + s1;
                              	for (int i = 1;i <= siz;i++)
                              		s2[i] = s1[siz - i + 1];
                              	for (int i = 1;i <= siz;i++)
                              		dp[i][i] = 0;
                              	for(int i = 1; i<=siz; i++)
                                      for(int j = 1; j <= siz; j++)
                                          if(s1[i] == s2[j])
                                              dp[i][j] = dp[i-1][j-1] + 1;
                                          else
                                              dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                                  cout << siz - dp[siz][siz];
                              	return 0;
                              }
                              

                              @ TooY0ung

                              • @ 2025-1-22 16:23:28

                                s2是字符串动态内存,你搁哪当字符数组直接赋值属于未定义

                                s2[i] = s1[siz - i + 1];\tos2 += s1[siz - i + 1];

                              • @ 2025-1-22 16:27:32

                                @李睿舟 改完就成了60WA!!

                                #include <bits/stdc++.h>
                                #define ll long long
                                using namespace std;
                                string s1,s2;
                                int siz,dp[5010][5010];
                                int main()
                                {
                                	ios::sync_with_stdio(false);
                                	cin.tie(0);
                                	cin >> s1;
                                	siz = (int)s1.size();
                                	s1 = " " + s1;
                                	for (int i = 1;i <= siz;i++)
                                		s2 += s1[siz - i + 1];
                                	for (int i = 1;i <= siz;i++)
                                		dp[i][i] = 0;
                                	for(int i = 1; i<=siz; i++)
                                        for(int j = 1; j <= siz; j++)
                                            if(s1[i] == s2[j])
                                                dp[i][j] = dp[i-1][j-1] + 1;
                                            else
                                                dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                                    cout << siz - dp[siz][siz];
                                	return 0;
                                }
                                
                              • @ 2025-1-22 16:33:16

                                您的s2下标是 0siz10 \sim siz-1

                            • @ 2025-1-22 12:35:20
                              • @ 2025-1-22 14:39:48

                                还不如此题

                              • @ 2025-1-22 14:40:07

                                好玩就是不好写

                              • @ 2025-1-22 14:40:22

                                一道超大模拟

                              • 我觉得还是先数数Z和数数L吧

                              • @ 2025-1-23 10:16:22

                                @ 说得对

                              • @ 2025-1-26 12:57:34

                                @

                                #include<bits/stdc++.h>
                                using namespace std;
                                const bool diff[3][3]={{0,0,1},{0,0,1},{1,1,0}};
                                const int M=2005;
                                int n,m,fanzhu,deadfan,rounds,tmp[M],used[M]; char ch,cu;
                                struct PIGS {int iden,bloods,perfo,dead,nxt,equip,cnt; char cards[M];}a[15];
                                deque <char> cards_pile;
                                void _file() {
                                    freopen("pigs.in","r",stdin);
                                    freopen("pigs.out","w",stdout);
                                }
                                inline char read() {
                                    ch=getchar();
                                    while (ch<'A'||ch>'Z') ch=getchar();
                                    return ch;
                                }
                                void _init() {
                                    scanf("%d%d",&n,&m),fanzhu=deadfan=0;
                                    for (int i=1,las=0; i<=n; i++) {
                                        a[i].bloods=a[i].cnt=4,a[i].dead=a[i].perfo=a[i].equip=0,a[i].nxt=i%n+1;
                                        cu=read(),fanzhu+=(cu=='F'),a[i].iden=(cu!='F')?((cu!='Z')?0:1):2,cu=read();
                                        for (int j=1; j<=4; j++) a[i].cards[j]=read();
                                    }
                                    a[1].perfo=1;
                                    for (int i=1; i<=m; i++) cards_pile.push_back(read());
                                }
                                void get_cards(int cur) {
                                    a[cur].cards[++a[cur].cnt]=cards_pile.front();
                                    if (cards_pile.size()>1) cards_pile.pop_front();
                                }
                                bool ought(int cur) {
                                    int nxt=a[cur].nxt;
                                    if (a[nxt].perfo==0) return 0; else
                                    if (a[nxt].perfo==1) return diff[a[cur].iden][a[nxt].iden];
                                    else return a[cur].iden==0;
                                }
                                int atk(int cur) {
                                    if (a[cur].iden==2) return 1;
                                    for (int nxt=a[cur].nxt; nxt!=cur; nxt=a[nxt].nxt) if (!a[nxt].dead)
                                        if ((a[nxt].iden==2&&a[nxt].perfo==1)||(a[cur].iden==0&&a[nxt].perfo==-1)) return nxt;
                                    return -1;
                                }
                                void pend(int x,int y) {
                                    if (a[x].iden==0&&a[y].iden==1) {
                                        for (int i=1; i<=a[x].cnt; i++) used[i]=rounds; a[x].equip=0;
                                    }
                                    else if (a[y].iden==2) get_cards(x),get_cards(x),get_cards(x);
                                }
                                int find(int cur,char aim) {
                                    for (int i=1; i<=a[cur].cnt; i++) if (a[cur].cards[i]==aim) return i;
                                    return 0;
                                }
                                void adjust(int cur,int s,int t) {
                                    for (int i=s; i<t; i++) a[cur].cards[i]=a[cur].cards[i+1];
                                }
                                void respond_peach(int cur,int user) {
                                    int re=find(cur,'P');
                                    if (cur==user) {
                                        re=0;
                                        for (int i=1; i<=a[cur].cnt; i++) if (used[i]!=rounds&&a[cur].cards[i]=='P') {re=i; break;}
                                        if (re) used[re]=rounds,a[cur].bloods++;
                                        return;
                                    }
                                    if (re) a[cur].bloods++,adjust(cur,re,a[cur].cnt),a[cur].cnt--;
                                }
                                bool respond_dodge(int cur) {
                                    int re=find(cur,'D');
                                    if (re) adjust(cur,re,a[cur].cnt),a[cur].cnt--;
                                    return re;
                                }
                                bool respond_kill(int cur,int user) {
                                    int re=find(cur,'K');
                                    if (cur==user) {
                                        re=0;
                                        for (int i=1; i<=a[cur].cnt; i++) if (used[i]!=rounds&&a[cur].cards[i]=='K') {re=i; break;}
                                        if (re) used[re]=rounds;
                                        return re;
                                    }
                                    if (re) adjust(cur,re,a[cur].cnt),a[cur].cnt--;
                                    return re;
                                }
                                bool respond_wuxie(int cur,int user) {
                                    int re=find(cur,'J');
                                    if (cur==user) {
                                        re=0;
                                        for (int i=1; i<=a[cur].cnt; i++) if (used[i]!=rounds&&a[cur].cards[i]=='J') {re=i; break;}
                                        if (re) used[re]=rounds;
                                        return re;
                                    }
                                    if (re) adjust(cur,re,a[cur].cnt),a[cur].cnt--;
                                    return re;
                                }
                                void lose_blood(int cur,int user) {
                                    a[cur].bloods--; if (a[cur].bloods<1) respond_peach(cur,user);
                                }
                                void change_link(int cur) {
                                    for (int pre=1; pre<=n; pre++)
                                        if (!a[pre].dead&&a[pre].nxt==cur) {a[pre].nxt=a[cur].nxt; break;}
                                }
                                void do_peach(int cur) {
                                    a[cur].bloods++;
                                }
                                void do_kill(int cur) {
                                    int nxt=a[cur].nxt;
                                    a[cur].perfo=1;
                                    if (!respond_dodge(nxt)) {
                                        lose_blood(nxt,cur);
                                        if (a[nxt].bloods<1) deadfan+=(a[nxt].iden==2),a[nxt].dead=1,a[cur].nxt=a[nxt].nxt;
                                        if (fanzhu==deadfan||a[1].dead) return;
                                        if (a[nxt].bloods<1) pend(cur,nxt);
                                    }
                                }
                                bool do_wuxie(int user,int cur,int aim,int now) {
                                    bool ret=now;
                                    for (int nxt=cur; ; ) if (!a[nxt].dead) {
                                        if (!now) {
                                            if (!diff[a[nxt].iden][a[aim].iden])
                                                if (respond_wuxie(nxt,user)) {a[nxt].perfo=1; return do_wuxie(user,nxt,aim,1-now);}
                                        }else {
                                            if (diff[a[nxt].iden][a[aim].iden])
                                                if (respond_wuxie(nxt,user)) {a[nxt].perfo=1; return do_wuxie(user,nxt,aim,1-now);}
                                        }
                                        nxt=a[nxt].nxt; if (nxt==cur) break;
                                    }
                                    return ret;
                                }
                                void do_fight(int cur,int aim,int user) {
                                    a[cur].perfo=1;
                                    if (a[aim].perfo==1) {
                                        if (do_wuxie(cur,cur,aim,0)) return;
                                    }
                                    for (; ;) {
                                        if (a[cur].iden==0&&a[aim].iden==1) {
                                            lose_blood(aim,user);
                                            if (a[aim].bloods<1) deadfan+=(a[aim].iden==2),a[aim].dead=1,change_link(aim);
                                            if (fanzhu==deadfan||a[1].dead) return;
                                            if (a[aim].bloods<1) pend(cur,aim);
                                            return;
                                        }else
                                        if (!respond_kill(aim,user)) {
                                            lose_blood(aim,user);
                                            if (a[aim].bloods<1) deadfan+=(a[aim].iden==2),a[aim].dead=1,change_link(aim);
                                            if (fanzhu==deadfan||a[1].dead) return;
                                            if (a[aim].bloods<1) pend(cur,aim);
                                            return;
                                        }
                                        if (!respond_kill(cur,user)) {
                                            lose_blood(cur,user);
                                            if (a[cur].bloods<1) deadfan+=(a[cur].iden==2),a[cur].dead=1,change_link(cur);
                                            if (fanzhu==deadfan||a[1].dead) return;
                                            if (a[cur].bloods<1) pend(aim,cur);
                                            return;
                                        }
                                    }
                                }
                                void do_nanzhu(int cur) {
                                    for (int nxt=a[cur].nxt; nxt!=cur; nxt=a[nxt].nxt) if (!a[nxt].dead) {
                                        if (a[nxt].perfo==1) {
                                            if (do_wuxie(cur,cur,nxt,0)) continue;
                                        }
                                        if (!respond_kill(nxt,cur)) {
                                            lose_blood(nxt,cur); if (nxt==1&&a[cur].perfo==0) a[cur].perfo=-1;
                                            if (a[nxt].bloods<1) deadfan+=(a[nxt].iden==2),a[nxt].dead=1,change_link(nxt);
                                            if (fanzhu==deadfan||a[1].dead) return;
                                            if (a[nxt].bloods<1) pend(cur,nxt);
                                        }
                                    }
                                }
                                void do_wanjian(int cur) {
                                    for (int nxt=a[cur].nxt; nxt!=cur; nxt=a[nxt].nxt) if (!a[nxt].dead) {
                                        if (a[nxt].perfo==1) {
                                            if (do_wuxie(cur,cur,nxt,0)) continue;
                                        }
                                        if (!respond_dodge(nxt)) {
                                            lose_blood(nxt,cur); if (nxt==1&&a[cur].perfo==0) a[cur].perfo=-1;
                                            if (a[nxt].bloods<1) deadfan+=(a[nxt].iden==2),a[nxt].dead=1,change_link(nxt);
                                            if (fanzhu==deadfan||a[1].dead) return;
                                            if (a[nxt].bloods<1) pend(cur,nxt);
                                        }
                                    }
                                }
                                void do_zhuge(int cur) {
                                    a[cur].equip=1;
                                }
                                bool dis_cards(int cur) {
                                    memset(used,0,sizeof used);
                                    int i,cntused,totkill=0,counts,ret=-1,aim; char now;
                                    for (rounds=1; ; rounds++) {
                                        cntused=counts=0;
                                        for (i=1; i<=a[cur].cnt; i++) if (used[i]!=rounds) {
                                            now=a[cur].cards[i];
                                            switch (now) {
                                                case 'P':
                                                    if (a[cur].bloods<4) do_peach(cur),used[i]=rounds,cntused++,i=a[cur].cnt;
                                                    break;
                                                case 'K':
                                                    if ((!totkill||a[cur].equip)&&ought(cur)) do_kill(cur),used[i]=rounds,cntused++,totkill++,i=a[cur].cnt;
                                                    break;
                                                case 'F':
                                                    aim=atk(cur); if (aim!=-1) do_fight(cur,aim,cur),used[i]=rounds,cntused++,i=a[cur].cnt;
                                                    break;
                                                case 'N':
                                                    do_nanzhu(cur),used[i]=rounds,cntused++,i=a[cur].cnt;
                                                    break;
                                                case 'W':
                                                    do_wanjian(cur),used[i]=rounds,cntused++,i=a[cur].cnt;
                                                    break;
                                                case 'Z':
                                                    do_zhuge(cur),used[i]=rounds,cntused++,i=a[cur].cnt;
                                                    break;
                                                default:
                                                    break;
                                            }
                                            if (fanzhu==deadfan||a[1].dead) {ret=1; break;}
                                            if (a[cur].dead) {ret=0; break;}
                                        }
                                        for (int i=1; i<=a[cur].cnt; i++) if (used[i]!=rounds) tmp[++counts]=a[cur].cards[i];
                                        for (int i=1; i<=counts; i++) a[cur].cards[i]=tmp[i]; a[cur].cnt=counts;
                                        if (!cntused&&ret!=1) ret=0;
                                        if (ret>-1) return ret;
                                    }
                                }
                                bool playing(int cur) {
                                    get_cards(cur),get_cards(cur);
                                    return dis_cards(cur);
                                }
                                void _duel() {
                                    for (int i=1,event=0; !event&&fanzhu>0; i=a[i].nxt) if (!a[i].dead) event=playing(i);
                                }
                                void _print() {
                                    printf("%s\n",a[1].dead?"FP":"MP");
                                    for (int i=1; i<=n; i++) {
                                        if (a[i].dead) printf("%s","DEAD"); else {
                                            if (a[i].cnt>0) printf("%c",a[i].cards[1]);
                                            for (int j=2; j<=a[i].cnt; j++) printf(" %c",a[i].cards[j]);
                                        }
                                        puts("");
                                    }
                                }
                                int main() {
                                    _init();
                                    _duel();
                                    _print();
                                    return 0;
                                }
                                
                            • @ 2025-1-22 12:00:09
                            • @ 2025-1-21 19:51:48

                              @你要上传不了把文件发我我来上传

                              • @ 2025-1-21 19:52:29

                                你上不了我的oj我来

                            • @ 2025-1-21 16:24:47

                              TooY0ungWA了!!!!! P189670Wrong AnsWer 载入史册*2!!!!!!!!!!!!!!!!!!!!!!

                            • @ 2025-1-21 9:10:30

                              @ @ 加进去了啊

                            • @ 2025-1-20 18:29:40

                              数数几个‘z'怎么做!!!

                            • @ 2025-1-20 18:04:47

                              爸爸不以

                              • @ 2025-1-20 17:45:03

                                oj又出BAG

                              • @ 2025-1-19 20:49:42

                                比赛公告

                                由于数据出现大面积问题,导致第二题,第四题正解无法通过,所以比赛时间推迟至11232300:00:0000:00:00开始,结束时间顺延至22181800:00:0000:00:00

                                带来的不便请您谅解!

                                以下是更改后的比赛公告:

                                各位参赛选手:

                                本次比赛的正式规则现在公布:

                                1.比赛赛制:IOI

                                2.比赛时间: 2025.01.232025.01.23 00:00:0000:00:00~2025.02.182025.02.18 00:00:0000:00:00 内任选连续的1212小时完成比赛。

                                3.比赛题目数:44

                                4.比赛难度:略低于CSP-J(官方规定难度),覆盖语法~普及-

                                5.比赛赛区:55个,见之前公告。

                                6.允许炸鱼,不允许水问题,否则禁赛33个月

                                7.祝大家过个好年!

                                8.比赛期间管理每隔33~7272小时巡查一次

                                在此发疯,收到回复MC++

                              • @ 2025-1-19 15:48:26
                                TooY0ungWA了

                                P1717 80 WrongAnswer 载入史册

                              • @ 2025-1-18 22:21:02

                                oj怎么了,我真在打周赛打到剩一个小时了告诉我比赛结束了

                              • @ 2025-1-18 21:16:41

                                防止骗分为什么不用ICPC赛制

                                而是最低分分值

                                • @ 2025-1-18 20:10:38

                                  洛谷Div.4第5题怎么做

                                  • @ 2025-1-18 16:05:08

                                    推道水蓝:P3847

                                    超水的区间DP,非常适合当做中国OIer的第一道蓝题((

                                  • @ 2025-1-16 21:52:30

                                    官方通告

                                    各位参赛选手:

                                    本次比赛的正式规则现在公布:

                                    1.比赛赛制:IOI

                                    2.比赛时间:2025.01.202025.01.20 00:00:0000:00:00~2025.02.152025.02.15 00:00:0000:00:00 内任选连续的1212小时完成比赛。

                                    3.比赛题目数:44

                                    4.比赛难度:略低于CSP-J(官方规定难度),覆盖语法~普及-

                                    5.比赛赛区:55个,见之前公告。

                                    6.允许炸鱼,不允许水问题,否则禁赛33个月

                                    7.祝大家过个好年!

                                    8.比赛期间管理每隔2424~7272小时巡查一次

                                    在此发疯,收到回复MC++

                                    • @ 2025-1-17 15:06:51

                                      你会编题?

                                    • @ 2025-1-17 15:07:43

                                      我也有oj,你要用吗?

                                    • @ 2025-1-17 23:58:58

                                      @

                                      不想加赛区了,难于管理

                                      只能等下次的清明赛咯~

                                    • @ 2025-1-19 9:06:20

                                      @ 不是你还不上传题目

                                    • @ 2025-1-19 9:06:58

                                      @ 20号开始提前48小时上传题目

                                    • @ 2025-1-19 20:57:41

                                      @

                                      开服务器!!!

                                      改通知!!!!!!

                                    • @ 2025-1-19 21:04:02

                                      @ 一直开着呢

                                    • @ 2025-1-21 10:20:18

                                      @

                                      ?

                                    • @ 2025-1-21 10:21:13

                                      @ 我没用https,换个浏览器

                                    • @ 2025-1-21 10:21:47

                                      @ 用自带的或着Google

                                    • @ 2025-1-21 10:22:23

                                      @

                                    • @ 2025-1-21 11:26:30

                                      @ w我可以协助管理吗

                                    • @ 2025-1-21 12:19:34

                                      @

                                      洛谷的可以但是其他的不行

                                    • @ 2025-1-21 12:24:51

                                      @ why

                                    • @ 2025-1-21 12:34:03

                                      @ 我是MOD

                                  • @ 2025-1-15 22:23:33

                                    所以Jaggerchan也是33DAI吗

                                  • @ 2025-1-15 21:06:17

                                    oj

                                  • @ 2025-1-15 20:37:14

                                    釜底抽薪也是是ABC206的弱化版。

                                    难怪33DAI说釜底抽薪这题可以用并查集维护(

                                    • @ 2025-1-15 15:12:01
                                      • @ 2025-1-14 18:15:37

                                        ##求助,有许多错误,怎么改?

                                        #include<bits/stdc++.h>
                                        
                                        #include<algorithm>
                                        //algorithm
                                        #include <utility> // UK-300.
                                        #include <bits/stl_algobase.h>
                                        #include <bits/stl_algo.h>
                                        
                                        #include<iostream>
                                        //iostream
                                        #include <bits/c++config.h>
                                        #include <ostream>
                                        #include <istream>
                                        
                                        #include <windows.h>
                                        //windous.h
                                        #include <_mingw.h>
                                        #include <sdkddkver.h>
                                        
                                        #include<stdio.h>
                                        //stdio.h
                                        #include <crtdefs.h>
                                        #include <_mingw_print_push.h>
                                        
                                        #include<cstdio>
                                        //cstdio
                                        #include <bits/c++config.h>
                                        #include <stdio.h>
                                        
                                        #include<cmath>
                                        //cmath
                                        #include <bits/c++config.h>
                                        #include <bits/cpp_type_traits.h>
                                        #include <ext/type_traits.h>
                                        #include <math.h>
                                        
                                        #include<map>
                                        //map
                                        #include <bits/stl_tree.h>
                                        #include <bits/stl_map.h>
                                        #include <bits/stl_multimap.h>
                                        #include <bits/range_access.h>
                                        
                                        using namespace std;
                                        
                                        map<int,int>jipaiqi;//记牌器 
                                        map<int,int>fapaiqi;//发牌器 
                                        
                                        //抽牌 
                                        int suijishu(int o){
                                        	int e;
                                        	while(true){
                                        		e=rand()%14+1;
                                        		if(e>0 || e<=14){
                                        			return e;
                                        		}  
                                        	}
                                        }
                                        
                                        int main(){
                                        	int s;
                                        	system("cls");//清屏
                                        	srand(time(0));
                                        	cout<<"欢迎来到poker之抽王八"<<endl;
                                        	while(true){
                                        		cout<<"游戏规则"<<endl;
                                        		cout<<"1.自动分牌,若出现一对牌,则去除这对牌,还可以抽一次别人的牌"<<endl;
                                        		cout<<"2.每人会抽取别人的牌,先没牌的胜利,谁最后手中只有王和八,则他成为王八"<<endl;
                                        		cout<<"3.牌中的A=1,J=11,Q=12,K=13,joker=14"<<endl; 
                                        		cout<<"看懂输个1,不懂输个2吧"<<endl;
                                        		cin>>s;
                                        		if(s==1){
                                        			cout<<"好的"<<endl;
                                        			Sleep(1500);
                                        			system("cls");
                                        			break;
                                        		}
                                        		if(s==2){
                                        			cout<<"没关系"<<endl;
                                        			Sleep(1500);
                                        			system("cls");
                                        		}
                                        		else{
                                        			cout<<"别乱输"<<endl;
                                        			Sleep(1500);
                                        			system("cls");
                                        		}
                                        	}
                                        	system("cls");
                                        	cout<<"请输入游玩人数!最多四人,最少两人"<<endl;
                                        	int n;
                                        	while(true){
                                        		cin>>n;
                                        		if(n>4 || n<2){
                                        			cout<<"干啥呢?"<<endl;
                                        			Sleep(1500);
                                        			system("cls");
                                        		}
                                        		else{
                                        			break;
                                        		}
                                        	}
                                        	Sleep(1500);
                                        	system("cls");
                                        	cout<<"游戏开始"<<endl;
                                        	string ming[5];
                                        	int pai[5][105];  //pai[i][j] i号玩家 j张牌 
                                        	int mei=52/n;
                                        	if(true){
                                        		for(int i=1;i<=n;i++){
                                        			cout<<"请输入"<<i<<"号玩家姓名"<<endl;
                                        			cin>>ming[i];
                                        			Sleep(1500);
                                        			cout<<"你好!"<<endl;
                                        			Sleep(500);
                                        			cout<<ming[i]<<endl;
                                        			for(int j=1;j<=mei;j++){  //发牌工作 
                                        				s=suijishu(14);
                                        				if(fapaiqi[s]<=4){
                                        					if(s=14){
                                        						if(fapaiqi[14]==0){
                                        							fapaiqi[s]++;
                                        							pai[i][j]=s;
                                        							jipaiqi[i]++;
                                        						}
                                        					}
                                        					fapaiqi[s]++;
                                        					pai[i][j]=s;
                                        					jipaiqi[i]++;
                                        				}
                                        			}
                                        			for(int l=1;l<=jipaiqi[i];l++){  //排序 
                                        				for(int j=l+1;j<=jipaiqi[i];j++){
                                        					if(pai[i][l]>pai[i][j]){
                                        						swap(pai[i][l],pai[i][j]);
                                        					}
                                        				}
                                        			}
                                        			for(int j=jipaiqi[i];j>=1;j--){   //去重 
                                        				if(pai[i][j]==pai[i][j-1]){
                                        					pai[i][j]=0;
                                        					pai[i][j-1]=0;
                                        					for(int l=j-1;l<=jipaiqi[i]-2;l++){  //删除 
                                        						pai[i][l]=pai[i][l+2];
                                        					}
                                        					jipaiqi[i]=jipaiqi[i]-2;
                                        				}
                                        			}
                                        			Sleep(1500);
                                        			system("cls");
                                        			if(jipaiqi[i]<1){   //特判 
                                        				i=i-1;
                                        			}
                                        		}
                                        		cout<<"发牌结束"<<endl;
                                        		Sleep(1500);
                                        		system("cls");
                                        		int c=1; 
                                        		while(n>1){
                                        			jipaiqi[0]=0;
                                        			cout<<"第"<<c<<"回合"<<endl;
                                        			for(int i=1;i<=n;i++){
                                        				cout<<ming[i]<<"还剩"<<jipaiqi[i]<<"张牌"<<endl;
                                        				jipaiqi[0]+=jipaiqi[i];
                                        			}
                                        			cout<<"总共还剩"<<jipaiqi[0]<<"张牌"<<endl;
                                        			Sleep(1500);
                                        			system("cls");
                                        			for(int i=1;i<=n;i++){
                                        				if(n==1){
                                        					break;
                                        				}
                                        				if(jipaiqi[i]==0){
                                        					continue;
                                        				}
                                        				cout<<"你的牌"<<endl;
                                        				for(int j=1;j<=jipaiqi[i];j++){
                                        					cout<<pai[i][j]<<" ";
                                        				}
                                        				cout<<ming[i]<<"请抽牌"<<endl;
                                        				bool f=1;
                                        				while(f=1){
                                        					if(n==1){
                                        						break;
                                        					}
                                        					if(jipaiqi[(i+1)%n]==0){
                                        							n--;
                                        							cout<<ming[(i+1)%n]<<"获得了胜利"<<endl;
                                        							
                                        							 
                                        							for(int j=(i+1)%n;j<=n;j++){   //数据更新 
                                        								ming[(i+1)%n]=ming[(i+1)%n+1];
                                        								jipaiqi[j]=jipaiqi[(j+1)%n];
                                        								for(int l=1;l<=jipaiqi[(i+1)%n+1];l++){
                                        									pai[(i+1)%n][l]=pai[(i+1)%n+1][l];
                                        								}
                                        							}
                                        					}
                                        					while(true){
                                        						
                                        						cin>>s;
                                        						if(s<=jipaiqi[(i+1)%n]){
                                        							break;
                                        						}
                                        						else{
                                        							cout<<"他只有"<<jipaiqi[(i+1)%n]<<"张牌"<<endl;
                                        						}
                                        					}
                                        					cout<<"你抽到了"<<pai[(i+1)%n][s];
                                        					int v=0;
                                        					for(int j=jipaiqi[i];j>0;j--){   //查询我的牌放哪? 
                                        						if(pai[(i+1)%n][s]<=pai[i][s]){
                                        							v=j;
                                        							break;
                                        						}
                                        					}
                                        					for(int j=jipaiqi[i];j>v+1;j--){  //移位插入 
                                        						pai[i][j+1]=pai[i][j];
                                        					}
                                        					pai[i][v+1]=pai[(i+1)%n][s]; //插入
                                        					
                                        					jipaiqi[i]++;
                                        					jipaiqi[(i+1)%n]--;
                                        					
                                        					for(int j=s;j<=jipaiqi[(i+1)%n];j++){ //删除 
                                        						pai[(i+1)%n][j]=pai[(i+1)%n][j+1];
                                        					} 
                                        					
                                        					for(int j=jipaiqi[i];j>=1;j--){    //判断有无重牌
                                        						if(pai[i][j]==pai[i][j-1]){
                                        							
                                        							pai[i][j]=0;
                                        							pai[i][j-1]=0;
                                        							for(int l=j-1;l<=jipaiqi[i]-2;l++){  //删除 
                                        								pai[i][l]=pai[i][l+2];
                                        							}
                                        							jipaiqi[i]=jipaiqi[i]-2;
                                        						}
                                        						else{
                                        							f=0;
                                        						}
                                        					 
                                        					}
                                        					
                                        				}
                                        			}
                                        			
                                        			cout<<"第"<<c<<"回合结束"<<endl;
                                        			c++;
                                        			Sleep(1500);
                                        			system("cls");
                                        		}
                                        	}
                                        	cout<<"哈哈!"<<ming[1]<<"是王八!";
                                        	cout<<"游戏结束"<<endl;
                                        	Sleep(1500);
                                        	system("cls");
                                        	cout<<"作者:zswdlqy"<<endl;
                                        	Sleep(1500);
                                        	cout<<"Wotojo   -std=c++14 -O2 -Wl,--stack=1073741824    https://oj.since2018.top/p/SOFTWARE       https://oj.since2018.top/file/2/DevCpp.pdf         https://oj.since2018.top/paste/show/0GbEg9NsE0AUkRwXLjSBAvVAQix7lYOw" <<endl;
                                        	Sleep(1500);
                                        	cout<<"HydroOJ 洛谷 AtCoder CodeForces"<<endl; 
                                        	Sleep(1500);
                                        	cout<<"评测队列 服务状态 兼容模式 主题 Worker 0, 45msPowered by Hydro v4.14.1 Community, Modified by 33DAI"<<endl;
                                        	Sleep(1500);
                                        	return 0;
                                        }
                                        
                                      • @ 2025-1-14 16:48:13
                                        #include <bits/stdc++.h>
                                        #define ll long long
                                        using namespace std;
                                        int n;
                                        double l;
                                        ll a[300010];
                                        bool cmp(int x,int y){
                                        	return x>y;
                                        }
                                        int main()
                                        {
                                        	ios::sync_with_stdio(false);
                                        	cin.tie(0);
                                        	cin>>n;
                                        	for(int i=1;i<=n;i++){
                                        		cin>>a[i];
                                        	}
                                        	sort(a+1,a+n+1,cmp);
                                        	double k=0,m=0;
                                        	for(int i=1;i<=n;i++){
                                        		l+=a[i];
                                        		k=l/i*l;
                                        		m=max(l,k);
                                        	}
                                        	cout<<setprecision(8)<<m;
                                        	return 0;
                                        }