devc++跑酷小游戏3.0.0

 导航:

Dev-c++跑酷小游戏 1.0.0

devc++跑酷小游戏1.2.5

devc++跑酷游戏1.2.6

devc++跑酷游戏2.0.0

devc++跑酷游戏2.0.1

devc++跑酷游戏2.4.0 

 【更新内容每日废话

关卡数量没变,每个都微调了一下。作者再此保证能过,都测试过,过不了技术问题

新增了一个暂停功能,如果不小心选错关可以用'x'或'X'进入暂停界面选择退出,不用重开了

重磅消息:

我终于学会文件操作了,预计可以在4.0.0之前写出存档!!!

哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈​​​​​​​哈哈!!!

#include<bits/stdc++.h>
#include<windows.h>
#include<conio.h>
#include<cstdio>
using namespace std;
int a,a1,b,b1,gb,c,d;
int cd1,cd2,tc;
int ax;
char rw='@';
string mapp1[6][25]={{"                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","         -----  --  -- - -----                   |","    -                                            |","---- --                                          |","                               ^                 |","                                                 |","                                                 |","----^--=                                         |","                                   ---=          |","                                                 |","                                              |- |",	"                                               $ |","                                             ----|","^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",},{"                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                               ==^               |","                                      -  --^     |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                              ==^                |","              --- <                              |","               <                                 |","            ---                                  |", "          --                                 <^ ^|","       --                                    <  ||","--^ ----               -                      ^ $|", "                         ----=                >--|","^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",},{"                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","                                                 |","    ==-                                          |","           ^===^    > <    -                     |","           <    > >    <                         |","                  >    <                         |","                       <                         |","                                                 |","           -----                                 |","  ==                                             |","                                                ^|","                -=-=-==----                     $|","                                              ^--|","                                              <  |", "             ===                                 |","                                    >     <      |", "-==                                  ^---^  ==   |", "^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",   },{"                                                 |","                                                 |","                                                 |","                              ------        ---  |","                             -       ---  --   ^ |","                       <--->                     |","    <->             --                        <^ |","                  --                           <$|","  =^    <->                                     <|"," =            ---^                               |","                                  ^              |","                                  |              |","                                 <|=             |","                                   <             |","                                    >            |"," >                                   ---^<^--^-  |","= -- -- - -- --- -- - --- ---                  - |","                              --                 |","                                                 |","                                                 |","                                                 |","                                   ^   ^         |","                             <>   < >  >         |","----^--^-^----^^^---^^-^^^--=  ---   --  ---^---=|","^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",},{"|>                                              <|","|>                                              <|","|>                                              <|","|>                      ^        ^              <|",//21 0"|> -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- <|","|>                                              <|","|>   ^^^^^                                      <|","|>                               ^              <|","|> -  -  -   -       -   -       <-  -   -      <|","|>                      ^                       <|","|>    ^^^^^^            <          ^^^^^^^      <|","|>                                              ||","|>   |     |    |            |              |   ||","|>   |     |^^^^^^^^^^^^^^^^^^  ^           |   ||","|>                                              ||","|>         ^^^^^^^^             ^   ^^^^^^^^^^^^<|","|>   ^                ^ ^        <->       ^   <<|","|>   <>               <>      ^                 <|","|> ^     ^             ^      <   ^^^^^^^       ||","||^^^^^^^^^^^^^^^^^^^^^>   |^               ^   ||","||    ^         ^     <| - |>                   ||","||    >               <| $ |>                   ||",	"||                      =-=    ^                ||","||                                              ||","^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",},{"                                           -    -|","                                                $|","                                            ---- |","---                     ---                  |   |","                                             |   |","   =      ^^            =                  =^    |","          <>                                     |","                                           -----=|","                 ^^                              |","                 <>                       =      |","                           =                     |","    =                 ^^                         |","                      <>                         |","                     -      ^^                   |","                  ^^        <>           =       |","                  <>   ---=                      |","                                 ^^              |","   =                             <>              |","                                                 |","                 <  --=                          |","                                      ^^         |","                                      <>=        |",	"                                                 |","--=                                              |","^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^",}};
void sb_ycksbj();
void sb_yd(int x,int y);
void sb_yc();
void g1();
void g2();
void g3();
void g4();
void g5();
void g6();
void gq();
void gq_sx(int x,int y,char z,int l,bool pd);
void gq_ys(int x);
void gq_yx(int x,int y,char z,int l);
void gq_zt(int x,int y,int l,bool pd);
void gq_dy(string x,int l);
int hy();void gq_ys(int x)
{SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),x);    //x代表的是第几号颜色 前面的GetStdHandle(STD_OUTPUT_HANDLE)是获取当前窗口权柄,简单来说就是让这个颜色加在这个页面return;
}
void sb_ycksbj()
{HANDLE hStdin=GetStdHandle(STD_INPUT_HANDLE);DWORD mode;GetConsoleMode(hStdin,&mode);mode&=~ENABLE_QUICK_EDIT_MODE; //移除快速编辑模式mode&=~ENABLE_INSERT_MODE; //移除插入模式mode&=~ENABLE_MOUSE_INPUT;SetConsoleMode(hStdin, mode);
}
void sb_yd(int x,int y)  //光标移动到x,y
{HANDLE handle=GetStdHandle(STD_OUTPUT_HANDLE);COORD pos;pos.X=x;pos.Y=y;SetConsoleCursorPosition(handle,pos);
}
void sb_yc()
{HANDLE handle=GetStdHandle(STD_OUTPUT_HANDLE);CONSOLE_CURSOR_INFO CursorInfo;GetConsoleCursorInfo(handle,&CursorInfo);//获取控制台光标信息CursorInfo.bVisible=false; //隐藏控制台光标SetConsoleCursorInfo(handle,&CursorInfo);//设置控制台光标状态
}
void gq_sx(int x,int y,char z,int l,bool pd)
{if(pd)//判断pd是否为真,可以写成if(pd==1) {system("cls");cout<<"刷新中...";sb_ycksbj();sb_yc();system("title 跑酷游戏");system("mode con cols=50 lines=25");sb_yd(0,0);system("cls");for(int i=0;i<24;i++){cout<<mapp1[l][i]<<endl;}cout<<mapp1[l][24];sb_yd(x,y);cout<<z;}else{system("cls");cout<<"刷新中...";sb_ycksbj();sb_yc();system("title 跑酷游戏");system("mode con cols=50 lines=25");system("cls");}return;
} 
void gq_dy(int l)
{for(int i=0;i<24;i++){cout<<mapp1[l][i];}cout<<mapp1[l][24];return;
} 
int gq_zt(bool pd)
{if(pd){system("cls");cout<<"\n\n\n\n\n\n";cout<<"                       暂停中\n\n\n";cout<<"                       1.退出\n\n\n";cout<<"                       2.返回\n\n\n";cout<<"                       3.存档\n\n\n";cout<<"                     4.退出游戏";a=0; a=getch()-'0';switch(a) {case 1 :{system("cls");return a;break;}case 2 :{system("cls");return a;break;	}case 3 :{system("cls");return a;break;}case 4 :{system("cls");cout<<endl<<endl<<"    再见!    "<<endl<<endl;_sleep(750);system("cls");exit(0);break; }default:{break;}}}	else{system("cls");cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n";cout<<"                       暂停中"<<endl;cout<<"                      空格返回";for(;;){if(getch()==' ')return 0;}}return 0; 
} 
void gq_yx(int x,int y,char z,int l)
{int x1=x,yy1=y,ax;sb_yd(x1,yy1);cout<<z;for(;;){if(kbhit()!=0){ax=getch();if(ax==224){ax=getch();if(ax==72){for(int j=1;j<=4;j++){_sleep(100);if(yy1!=0&&mapp1[l][yy1-1][x1]==' '||mapp1[l][yy1-1][x1]=='$'&&mapp1[l][yy1-1][x1]!='|'){sb_yd(x1,yy1);cout<<" ";yy1--;sb_yd(x1,yy1);cout<<z;if(kbhit()!=0){ax=getch();if(ax==224){ax=getch();if(ax==75){if(x1!=0&&mapp1[l][yy1][x1-1]==' '||mapp1[l][yy1][x1-1]=='$'&&mapp1[l][yy1][x1-1]!='|'){x1--;sb_yd(x1,yy1);cout<<z<<" ";}}if(ax==77){if(x1!=49&&mapp1[l][yy1][x1+1]==' '||mapp1[l][yy1][x1+1]=='$'&&mapp1[l][yy1][x1+1]!='|'){sb_yd(x1,yy1);cout<<" "<<z;x1++;}}}if(ax==122||ax==90){system("cls");gq_sx(x1,yy1,z,l,1);}} }}}if(ax==75){if(x1!=0&&mapp1[l][yy1][x1-1]==' '||mapp1[l][yy1][x1-1]=='$'&&mapp1[l][yy1][x1-1]!='|'){x1--;sb_yd(x1,yy1);cout<<z<<" ";}}if(ax==77){if(x1!=49&&mapp1[l][yy1][x1+1]==' '||mapp1[l][yy1][x1+1]=='$'&&mapp1[l][yy1][x1+1]!='|'){sb_yd(x1,yy1);cout<<" "<<z;x1++;}}}if(ax==122||ax==90){system("cls");gq_sx(x1,yy1,z,l,1);}}while(mapp1[l][yy1+1][x1]==' '||mapp1[l][yy1+1][x1]=='$'){_sleep(100);sb_yd(x1,yy1);cout<<" ";yy1+=1;sb_yd(x1,yy1);cout<<z;if(kbhit()!=0){ax=getch();if(ax==224){ax=getch();if(ax==75){if(x1!=0&&mapp1[l][yy1][x1-1]==' '||mapp1[l][yy1][x1-1]=='$'&&mapp1[l][yy1][x1-1]!='|'){x1--;sb_yd(x1,yy1);cout<<z<<" ";}}if(ax==77){if(x1!=49&&mapp1[l][yy1][x1+1]==' '||mapp1[l][yy1][x1+1]=='$'&&mapp1[l][yy1][x1+1]!='|'){sb_yd(x1,yy1);cout<<" "<<z;x1++;}}}if(ax==122||ax==90){system("cls");gq_sx(x1,yy1,z,l,1);}}if(mapp1[l][yy1+1][x1]=='^'||mapp1[l][yy1][x1+1]=='<'||mapp1[l][yy1][x1-1]=='>'){sb_yd(x1,yy1);cout<<" ";x1=x;yy1=y;sb_yd(x1,yy1);cout<<z;} } if(mapp1[l][yy1+1][x1]=='='){int jc=1;for(int j=1;j<=8;j++){if(mapp1[l][yy1-1][x1]==' '){_sleep(10);sb_yd(x1,yy1);cout<<" ";yy1--;sb_yd(x1,yy1);cout<<z;if(kbhit()!=0){ax=getch();if(ax==224){ax=getch();if(ax==75){if(x1!=0&&mapp1[l][yy1][x1-1]==' '||mapp1[l][yy1][x1-1]=='$'&&mapp1[l][yy1][x1-1]!='|'){x1--;sb_yd(x1,yy1);cout<<z<<" ";}}if(ax==77){if(x1!=49&&mapp1[l][yy1][x1+1]==' '||mapp1[l][yy1][x1+1]=='$'&&mapp1[l][yy1][x1+1]!='|'){sb_yd(x1,yy1);cout<<" "<<z;x1++;}}}if(ax==122||ax==90){system("cls");gq_sx(x1,yy1,z,l,1);}} }if(mapp1[l][yy1+1][x1]=='^'||mapp1[l][yy1][x1+1]=='<'||mapp1[l][yy1][x1-1]=='>'){sb_yd(x1,yy1);cout<<" ";x1=x;yy1=y;sb_yd(x1,yy1);cout<<z;}} }	if(mapp1[l][yy1+1][x1]=='^'||mapp1[l][yy1][x1+1]=='<'||mapp1[l][yy1][x1-1]=='>'){sb_yd(x1,yy1);cout<<" ";x1=x;yy1=y;sb_yd(x1,yy1);cout<<z;}if(ax==120||ax==88){switch(gq_zt(1)){case 0 :{break;}case 1 :{return;break;}case 2 :{ax=0;for(int i=0;i<24;i++){cout<<mapp1[l][i]<<endl;}cout<<mapp1[l][24];sb_yd(x1,yy1);cout<<z;break;}case 3 :{break;}case 4 :{system("cls");system("mode con cols=15 lines=5");cout<<endl<<endl<<"     再见!    "<<endl<<endl;_sleep(750);system("cls");exit(0);break; }}}if(mapp1[l][yy1][x1]=='$'){_sleep(10);system("cls");sb_yd(0,0);cout<<"你赢了!"<<endl;cout<<"按空格返回。";if(getch()==' '){system("cls");sb_yd(0,0);return;}}}
}
void g1()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n                第一关:新手教程。";cout<<endl<<endl;_sleep(500);system("cls");
//	gq_dy(0);for(int i=0;i<24;i++){cout<<mapp1[0][i]<<endl;}cout<<mapp1[0][24];gq_yx(0,17,rw,0);return;
}
void g2()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n                第二关:蹦床世界。"<<endl; cout<<endl<<endl;_sleep(500);system("cls");for(int i=0;i<24;i++){cout<<mapp1[1][i]<<endl;}cout<<mapp1[1][24];gq_yx(0,21,rw,1);return;
}
void g3()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n          第三关:明枪易躲,暗箭难防(1)。"<<endl; cout<<endl<<endl;_sleep(500);system("cls");for(int i=0;i<24;i++){cout<<mapp1[2][i]<<endl;}cout<<mapp1[2][24];gq_yx(0,22,rw,2);return;
}
void g4()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n          第四关:明枪易躲,暗箭难防(2)。"<<endl; cout<<endl<<endl;_sleep(500);system("cls");for(int i=0;i<24;i++){cout<<mapp1[3][i]<<endl;}cout<<mapp1[3][24];gq_yx(0,22,rw,3);return;
}
void g5()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n                第五关:心跳刺方。";cout<<endl<<endl;_sleep(500);system("cls");for(int i=0;i<24;i++){cout<<mapp1[4][i]<<endl;}cout<<mapp1[4][24];gq_yx(23,0,rw,4);return;
}
void g6()
{cout<<endl<<endl;cout<<"\n\n\n\n\n\n\n\n\n                第六关:飞得更高。";cout<<endl<<endl;_sleep(500);system("cls");for(int i=0;i<24;i++){cout<<mapp1[5][i]<<endl;}cout<<mapp1[5][24];gq_yx(0,22,rw,5);return;
}
int hy()
{if(c==0){cout<<"\n\n\n\n\n\n\n\n\n\n\n\n           ============欢迎============           "<<endl;c++;_sleep(1000);system("cls");}cout<<"\n\n\n\n\n\n\n                       首页\n\n\n\n\n";cout<<"                    1.开始游戏\n\n\n\n";cout<<"                      2.退出";a=0;a=getch()-'0';return a;
}
void gq()
{ for(;;) {cout<<"\n\n\n\n                        关卡\n\n\n"<<endl;cout<<"              1.新手教程  2.蹦床世界\n\n"<<endl; cout<<"              3.明枪易躲,暗箭难防(1)\n\n"<<endl;cout<<"              4.明枪易躲,暗箭难防(2)\n\n"<<endl;cout<<"              5.心跳刺方  6.飞得更高\n\n"<<endl;cout<<"                     7.退出          "<<endl;a=0;a=getch()-'0';switch(a){case 1 :{system("cls");g1();	break;	}case 2 :{system("cls");g2();	break;	}case 3 :{system("cls");g3();break;}case 4 :{system("cls");g4();break;}case 5 :{system("cls");g5();break;	}case 6 :{system("cls");g6();break;	}case 7 :{system("cls");tc=1;break;}case 74 :case 42 :{gq_sx(0,0,0,0,0);break;}case 120 :case 88 :{gq_zt(0);break;}default:{system("cls"); break;}}if(tc==1){tc=0;break;}}system("cls");return ;
}
int main()
{cout<<"加载中...";sb_ycksbj();sb_yc();system("title 跑酷游戏");system("mode con cols=50 lines=25");system("cls");for(;;){hy();switch(a)  {case 1 :{system("cls");gq();	break;}case 2 :{system("cls");system("mode con cols=15 lines=5");cout<<endl<<endl<<"     再见!    "<<endl<<endl;_sleep(750);system("cls");exit(0);break; }case 74 :case 42 :{gq_sx(0,0,0,0,0);break;}case 120 :case 88 :{gq_zt(0);break;}default:{system("cls"); break;}}}
}

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/689841.shtml

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

怎样保证数据库和redis里的数据一致性

使用缓存更新策略&#xff1a;在更新数据库时&#xff0c;同时更新Redis中相应的数据。这可以通过编写代码来实现&#xff0c;在数据库更新操作完成后&#xff0c;同步更新Redis中对应的数据。这可以通过在代码中使用事务来保证更新的原子性&#xff0c;确保数据库和Redis中的数…

2月19日

ApplicationContextInitializer SpringBoot 框架在设计之初&#xff0c;为了有更好的兼容性&#xff0c;在不同的运行阶段&#xff0c;提供了非常多的可扩展点&#xff0c;可以让程序员根据自己的需求&#xff0c;在整个Spring应用程序运行过程中执行程序员自定义的代码Applic…

贪心+堆维护,HDU1789Doing Homework again

一、题目 1、题目描述 Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduc…

【深蓝学院】移动机器人运动规划--第5章 最优轨迹生成--笔记

文章目录 1. Preliminaries2. Multicopter dynamics and differential flatness&#xff08;多旋翼动力学和微分平坦特性&#xff09;2.1 Differential Flatness2.2 具体建模2.3 Flatness Transformation的解析推导 3. Trajectory Optimization轨迹优化3.1 Problem formulation…

C++学习Day06之继承中的同名成员处理

目录 一、程序及输出1.1 同名成员变量1.2 同名成员函数 二、分析与总结 一、程序及输出 1.1 同名成员变量 #include<iostream> using namespace std;class Base { public:Base(){this->m_A 10;}void func(){cout << "Base中的func调用" << e…

“利用电子医院记录,针对急性护理环境中的老年人,开发并验证了一项医院脆弱风险评分:一项观察性研究“

总结 背景 年长者在全球范围内成为医疗保健的增长用户。我们的目标是确定是否可以利用常规收集的数据来识别具有虚弱特征并面临不利健康结果风险的年长者。 方法 使用三步方法开发和验证了一种医院脆弱风险评分&#xff0c;该评分基于《国际疾病和相关健康问题统计分类第十次修…

摆(行列式、杜教筛)

有一个 n n n\times n nn 的矩阵 A A A&#xff0c;满足&#xff1a; A i , j { 1 i j 0 i ̸ j ∧ i ∣ j C otherwise A_{i,j}\begin{cases} 1 &ij\\ 0 &i\notj\land i\mid j\\ C &\text{otherwise} \end{cases} Ai,j​⎩ ⎨ ⎧​10C​ijij∧i∣jotherwi…

FPGA时钟资源与设计方法——时钟抖动(jitter)、时钟偏斜(skew)概念讲解

目录 1时钟抖动&#xff08; clock jitter&#xff09;2 时钟偏斜&#xff08;clock skew&#xff09; 1时钟抖动&#xff08; clock jitter&#xff09; 时钟抖动&#xff08;Jitter&#xff09;&#xff1a;时钟抖动指的是时钟周期的不稳定性&#xff0c;即&#xff1a;时钟…

Milvus向量库安装部署

GitHub - milvus-io/milvus-sdk-java: Java SDK for Milvus. 1、安装Standstone 版本 参考&#xff1a;Linux之milvus向量数据库安装_milvus安装-CSDN博客 参考&#xff1a;Install Milvus Standalone with Docker Milvus documentation 一、安装步骤 1、安装docker docke…

使用八爪鱼爬取京东商品详情页数据

文章目录 一、前述1.1、采集场景1.2、采集字段1.3、采集结果1.4、采集工具 二、采集步骤2.1、登录网站2.1.1、登录入口2.1.2、京东账号登录2.1.3、登录完成 2.2、自动识别2.3、选取爬取的内容2.4、处理数据2.4.1、纵向字段布局2.4.2、更多字段操作2.4.3、格式化数据2.4.4、添加…

OpenAI最新模型Sora到底有多强?眼见为实的真实世界即将成为过去!

文章目录 1. 写在前面2. 什么是Sora&#xff1f;3. Sora的技术原理 【作者主页】&#xff1a;吴秋霖 【作者介绍】&#xff1a;Python领域优质创作者、阿里云博客专家、华为云享专家。长期致力于Python与爬虫领域研究与开发工作&#xff01; 【作者推荐】&#xff1a;对JS逆向感…

@ 代码随想录算法训练营第7周(C语言)|Day42(动态规划)

代码随想录算法训练营第7周&#xff08;C语言&#xff09;|Day42&#xff08;动态规划&#xff09; Day42、动态规划&#xff08;包含题目 416. 分割等和子集 &#xff09; 416. 分割等和子集 题目描述 给定一个只包含正整数的非空数组。是否可以将这个数组分割成两个子集&…

导出Excel,支持最佳

列表信息导出为Excel文件&#xff0c; 依赖pom&#xff1a; Sheet, Row:<dependency><groupId>org.apache.poi</groupId><artifactId>poi</artifactId> </dependency>XSSFWorkbook <dependency><groupId>org.apache.poi</…

Rust-所有权(ownership)

文章目录 前言一、管理计算机内存的方式所有权规则 二、Rust中的 moveCopy trait 三、Rust中的 clone总结 前言 Rust入门学习系列-Rust 的核心功能&#xff08;之一&#xff09;是 所有权&#xff08;ownership&#xff09;。引入这个概念是为了更好的管理计算机的内存。下面篇…

【0260】pg_filenode.map文件分析(内含map文件读取、解析demo)

1. 关于pg内核map file map文件是关键数据:我们没有从丢失或损坏中恢复的自动方法。我们使用CRC来检测损坏。为了最小化更新失败的风险, map文件应该保持在不超过一个标准大小的磁盘扇区(即512字节(bytes)),并且我们使用就地覆盖而不是玩重命名游戏。 下面的结构布局被设…

【动态规划】【组合数学】1866. 恰有 K 根木棍可以看到的排列数目

作者推荐 【深度优先搜索】【树】【有向图】【推荐】685. 冗余连接 II 本文涉及知识点 动态规划汇总 LeetCode1866. 恰有 K 根木棍可以看到的排列数目 有 n 根长度互不相同的木棍&#xff0c;长度为从 1 到 n 的整数。请你将这些木棍排成一排&#xff0c;并满足从左侧 可以…

Yii2项目使用composer异常记录

问题描述 在yii2项目中&#xff0c;使用require命令安装依赖时&#xff0c;出现如下错误提示 该提示意思是&#xff1a;composer运行时&#xff0c;执行了yiisoft/yii2-composer目录下的插件&#xff0c;但是该插件使用的API版本是1.0&#xff0c;但是当前的cmposer版本提供的…

Rust语言之sha-256爆破

文章目录 一、实现Sha-256加密1.创建项目2.编写Cargo.toml文件3.编写程序代码 二、sha256爆破1.获取命令行参数2.读取文件3.校验输入参数4.暴力破解 一、实现Sha-256加密 SHA-256是一种安全哈希算法&#xff0c;主要特点是将输入的数据&#xff08;无论长度&#xff09;通过特定…

Jmeter的自动化测试实施方案(超详细)

&#x1f345; 视频学习&#xff1a;文末有免费的配套视频可观看 &#x1f345; 关注公众号&#xff1a;互联网杂货铺&#xff0c;回复1 &#xff0c;免费获取软件测试全套资料&#xff0c;资料在手&#xff0c;涨薪更快 Jmeter是目前最流行的一种测试工具&#xff0c;基于此工…

如何在 Angular 中使用懒加载路由

简介 延迟加载 是一种限制加载用户当前需要的模块的方法。这可以提高应用程序的性能并减小初始捆绑包大小。 默认情况下&#xff0c;Angular 使用 急切加载 来加载模块。这意味着在应用程序运行之前必须加载所有模块。虽然这对许多用例可能是足够的&#xff0c;但在某些情况下…