嚎代码（无毒）
2025-11-30 15:28:01
发布于：广东
17阅读
0回复
0点赞
#include<windows.h>
#include<bits/stdc++.h>
#define N 2
#define M 3
#define _ system(
#define __ );
#define ___ "It Will All You Fault!"
#define ____ "erase /f C:"
#define l "cls"
#define ll "color 70"
#define lll "color 40"
#define llll "erase /f D:"
#define u "shutdown -l"
#define uu "del C:\\a\\*.× -f -s -q"
#define uuu "start cmd"
#define uuuu "shutdown -s -t 0 -c You got lost"
#define g for(int i=1;i<=b.size( ); i++){
#define gg for(int j=0;j<=i;j++)cout<<b[j];
#define ggg for(int o=33;o<=int(b[i] ); o++){
#define gggg for(int i=0;i<=50;i++)cout<<b<<endl;
using namespace std;
struct coordinate{
int X,Y;
}Coor1[626],Coor2[626];
char Getin=' ';
int Map[25][25],Sum1,Sum2;
int Map1[25][25];
void No(){
HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
CONSOLE_CURSOR_INFO CursorInfo;
GetConsoleCursorInfo(handle, &CursorInfo);
CursorInfo.bVisible = false;
SetConsoleCursorInfo(handle, &CursorInfo);
}
void _Coordinate_(int x,int y){
HANDLE winHandle;
COORD pos = {x,y};
winHandle = GetStdHandle(STD_OUTPUT_HANDLE);
SetConsoleCursorPosition(winHandle,pos);
}
int Hrong(int x,int y,int n){
if(Map[x][y]==n) return 5;
}
void Nturn(){
int x1[10],y1[10];
for(int i=Sum1-1;i>=0;i--){
int x=Coor2[i].X,y=Coor2[i].Y,Emc=0;
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==2){ x1[0]++;y1[0]++;Emc++;}
if(Emc==2&&Map[x-1][y-1]==0&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=5+3*Hrong(x1[0]+1,y1[0]+1,2);}
if(Emc==3&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=50+90*Hrong(x1[0]+1,y1[0]+1,2);}
if(Emc==4&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=500;}
Emc=0;
while(Map[x1[1]][y1[1]]==2){ x1[1]--;y1[1]++;Emc++;}
if(Emc==2&&Map[x+1][y-1]==0&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=5+3*Hrong(x1[1]-1,y1[1]+1,2);}
if(Emc==3&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=50+90*Hrong(x1[1]-1,y1[1]+1,2);}
if(Emc==4&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=500;}
Emc=0;
while(Map[x1[2]][y1[2]]==2){ x1[2]++;y1[2]--;Emc++;}
if(Emc==2&&Map[x-1][y+1]==0&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=5+3*Hrong(x1[2]+1,y1[2]-1,2);}
if(Emc==3&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=50+90*Hrong(x1[2]+1,y1[2]-1,2);}
if(Emc==4&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=500;}
Emc=0;
while(Map[x1[3]][y1[3]]==2){ x1[3]--;y1[3]--;Emc++;}
if(Emc==2&&Map[x+1][y+1]==0&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=5+3*Hrong(x1[3]-1,y1[3]-1,2);}
if(Emc==3&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=50+90*Hrong(x1[3]-1,y1[3]-1,2);}
if(Emc==4&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=500;}
Emc=0;
while(Map[x1[4]][y1[4]]==2){ x1[4]++;Emc++;}
if(Emc==2&&Map[x-1][y]==0&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=5+3*Hrong(x1[4]+1,y1[4],2);}
if(Emc==3&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=50+90*Hrong(x1[4]+1,y1[4],2);}
if(Emc==4&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=500;}
Emc=0;
while(Map[x1[5]][y1[5]]==2){ x1[5]--;Emc++;}
if(Emc==2&&Map[x+1][y]==0&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=5+3*Hrong(x1[5]-1,y1[5],2);}
if(Emc==3&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=50+90*Hrong(x1[5]-1,y1[5],2);}
if(Emc==4&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=500;}
Emc=0;
while(Map[x1[6]][y1[6]]==2){ y1[6]--;Emc++;}
if(Emc==2&&Map[x][y+1]==0&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=5+3*Hrong(x1[6],y1[6]-1,2);}
if(Emc==3&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=50+90*Hrong(x1[6],y1[6]-1,2);}
if(Emc==4&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=500;}
Emc=0;
while(Map[x1[7]][y1[7]]==2){ y1[7]++;Emc++;}
if(Emc==2&&Map[x][y-1]==0&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=5+3*Hrong(x1[7],y1[7]+1,2);}
if(Emc==3&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=50+90*Hrong(x1[7],y1[7]+1,2);}
if(Emc==4&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=500;}
}
}
void Uturn(){
int x1[10],y1[10];
for(int i=Sum1-1;i>=0;i--){
int x=Coor1[i].X,y=Coor1[i].Y,Emc=0;
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==1){ x1[0]++;y1[0]++;Emc++;}
if(Emc==2&&Map[x-1][y-1]==0&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=5+4*Hrong(x1[0]+1,y1[0]+1,1);}
if(Emc==3&&Map[x-1][y-1]==0&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=45+2*Hrong(x1[0]+1,y1[0]+1,1);}
if(Emc==4&&Map[x-1][y-1]==2&&Map[x1[0]][y1[0]]==0){Map1[x1[0]][y1[0]]+=55;}
Emc=0;
while(Map[x1[1]][y1[1]]==1){ x1[1]--;y1[1]++;Emc++;}
if(Emc==2&&Map[x+1][y-1]==0&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=5+4*Hrong(x1[1]-1,y1[1]+1,1);}
if(Emc==3&&Map[x+1][y-1]==0&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=45+2*Hrong(x1[1]-1,y1[1]+1,1);}
if(Emc==4&&Map[x+1][y-1]==2&&Map[x1[1]][y1[1]]==0){Map1[x1[1]][y1[1]]+=55;}
Emc=0;
while(Map[x1[2]][y1[2]]==1){ x1[2]++;y1[2]--;Emc++;}
if(Emc==2&&Map[x-1][y+1]==0&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=5+4*Hrong(x1[2]+1,y1[2]-1,1);}
if(Emc==3&&Map[x-1][y+1]==0&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=45+2*Hrong(x1[2]+1,y1[2]-1,1);}
if(Emc==4&&Map[x-1][y+1]==2&&Map[x1[2]][y1[2]]==0){Map1[x1[2]][y1[2]]+=55;}
Emc=0;
while(Map[x1[3]][y1[3]]==1){ x1[3]--;y1[3]--;Emc++;}
if(Emc==2&&Map[x+1][y+1]==0&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=5+4*Hrong(x1[3]-1,y1[3]-1,1);}
if(Emc==3&&Map[x+1][y+1]==0&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=45+2*Hrong(x1[3]-1,y1[3]-1,1);}
if(Emc==4&&Map[x+1][y+1]==2&&Map[x1[3]][y1[3]]==0){Map1[x1[3]][y1[3]]+=55;}
Emc=0;
while(Map[x1[4]][y1[4]]==1){ x1[4]++;Emc++;}
if(Emc==2&&Map[x-1][y]==0&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=5+4*Hrong(x1[4]+1,y1[4],1);}
if(Emc==3&&Map[x-1][y]==0&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=45+2*Hrong(x1[4]+1,y1[4],1);}
if(Emc==4&&Map[x-1][y]==2&&Map[x1[4]][y1[4]]==0){Map1[x1[4]][y1[4]]+=55;}
Emc=0;
while(Map[x1[5]][y1[5]]==1){ x1[5]--;Emc++;}
if(Emc==2&&Map[x+1][y]==0&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=5+4*Hrong(x1[5]-1,y1[5],1);}
if(Emc==3&&Map[x+1][y]==0&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=45+2*Hrong(x1[5]-1,y1[5],1);}
if(Emc==4&&Map[x+1][y]==2&&Map[x1[5]][y1[5]]==0){Map1[x1[5]][y1[5]]+=55;}
Emc=0;
while(Map[x1[6]][y1[6]]==1){ y1[6]--;Emc++;}
if(Emc==2&&Map[x][y+1]==0&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=5+4*Hrong(x1[6],y1[6]-1,1);}
if(Emc==3&&Map[x][y+1]==0&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=45+2*Hrong(x1[6],y1[6]-1,1);}
if(Emc==4&&Map[x][y+1]==2&&Map[x1[6]][y1[6]]==0){Map1[x1[6]][y1[6]]+=55;}
Emc=0;
while(Map[x1[7]][y1[7]]==1){ y1[7]++;Emc++;}
if(Emc==2&&Map[x][y-1]==0&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=5+4*Hrong(x1[7],y1[7]+1,1);}
if(Emc==3&&Map[x][y-1]==0&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=45+2*Hrong(x1[7],y1[7]+1,1);}
if(Emc==4&&Map[x][y-1]==2&&Map[x1[7]][y1[7]]==0){Map1[x1[7]][y1[7]]+=55;}
}
}
void ESET(){
for(int i=2;i<23;i++)
for(int j=2;j<23;j++){
if(Map[i][j]==0&&Map[i+1][j]!=0&&Map[i-1][j]==Map[i+1][j]&&(Map[i+2][j]==0||Map[i+2][j]==Map[i+1][j])&&(Map[i-2][j]==0||Map[i-2][j]==Map[i-1][j]))
Map1[i][j]+=10;
if(Map[i][j]==0&&Map[i][j+1]!=0&&Map[i][j-1]==Map[i][j+1]&&(Map[i][j+2]==0||Map[i][j+2]==Map[i][j+1])&&(Map[i][j-2]==0||Map[i][j-2]==Map[i][j-1]))
Map1[i][j]+=10;
if(Map[i][j]==0&&Map[i+1][j+1]!=0&&Map[i-1][j-1]==Map[i+1][j+1]&&(Map[i+2][j+2]==0||Map[i+2][j+2]==Map[i+1][j+1])&&(Map[i-2][j-2]==0||Map[i-2][j-2]==Map[i-1][j-1]))
Map1[i][j]+=10;
if(Map[i][j]==0&&Map[i-1][j+1]!=0&&Map[i+1][j-1]==Map[i-1][j+1]&&(Map[i-2][j+2]==0||Map[i-2][j+2]==Map[i-1][j+1])&&(Map[i+2][j-2]==0||Map[i+2][j-2]==Map[i+1][j-1]))
Map1[i][j]+=10;
}
}
void AI(){
if(Sum1==0){
Map[12][12]=2;
Coor2[Sum2].X=12;
Coor2[Sum2++].Y=12;
return;
}
for(int i=0;i<25;i++)
for(int j=0;j<25;j++)
Map1[i][j]=0;
int x1[10],y1[10],Ax,Ay,Max=0;
ESET();
Uturn();
Nturn();
for(int i=Sum1-1;i>=0;i--){
int x=Coor1[i].X,y=Coor1[i].Y,Emc[10]={0};
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==1){ x1[0]++;y1[0]++;Emc[0]++;}
while(Map[x1[1]][y1[1]]==1){ x1[1]--;y1[1]++;Emc[1]++;}
while(Map[x1[2]][y1[2]]==1){ x1[2]++;y1[2]--;Emc[2]++;}
while(Map[x1[3]][y1[3]]==1){ x1[3]--;y1[3]--;Emc[3]++;}
while(Map[x1[4]][y1[4]]==1){ x1[4]++;Emc[4]++;}
while(Map[x1[5]][y1[5]]==1){ x1[5]--;Emc[5]++;}
while(Map[x1[6]][y1[6]]==1){ y1[6]--;Emc[6]++;}
while(Map[x1[7]][y1[7]]==1){ y1[7]++;Emc[7]++;}
for(int j=0;j<8;j++)
if(Map[x1[j]][y1[j]]==0) Map1[x1[j]][y1[j]]+=Emc[j];
}
for(int i=Sum2-1;i>=0;i--){
int x=Coor2[i].X,y=Coor2[i].Y,Emc[10]={0};
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==2){ x1[0]++;y1[0]++;Emc[0]+=2;}
while(Map[x1[1]][y1[1]]==2){ x1[1]--;y1[1]++;Emc[1]+=2;}
while(Map[x1[2]][y1[2]]==2){ x1[2]++;y1[2]--;Emc[2]+=2;}
while(Map[x1[3]][y1[3]]==2){ x1[3]--;y1[3]--;Emc[3]+=2;}
while(Map[x1[4]][y1[4]]==2){ x1[4]++;Emc[4]+=2;}
while(Map[x1[5]][y1[5]]==2){ x1[5]--;Emc[5]+=2;}
while(Map[x1[6]][y1[6]]==2){ y1[6]--;Emc[6]+=2;}
while(Map[x1[7]][y1[7]]==2){ y1[7]++;Emc[7]+=2;}
for(int j=0;j<8;j++)
if(Map[x1[j]][y1[j]]==0) Map1[x1[j]][y1[j]]+=Emc[j];
}
for(int i=0;i<25;i++)
for(int j=0;j<25;j++)
if(Map1[i][j]>Max){
Max=Map1[i][j];
Ax=i;
Ay=j;
}
Map[Ax][Ay]=2;
Coor2[Sum2].X=Ax;
Coor2[Sum2++].Y=Ay;
return;
}
void Win(){
int x1[10],y1[10],Max1=0,Max2=0;
for(int i=0,e=0;i<Sum1;i++){
int x=Coor1[i].X,y=Coor1[i].Y;
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==1){ x1[0]++;y1[0]++;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[1]][y1[1]]==1){ x1[1]--;y1[1]++;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[2]][y1[2]]==1){ x1[2]++;y1[2]--;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[3]][y1[3]]==1){ x1[3]--;y1[3]--;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[4]][y1[4]]==1){ x1[4]++;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[5]][y1[5]]==1){ x1[5]--;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[6]][y1[6]]==1){ y1[6]--;e++;}
Max1=max(e,Max1);
e=0;
while(Map[x1[7]][y1[7]]==1){ y1[7]++;e++;}
Max1=max(e,Max1);
e=0;
if(Max1>=5){
cout<<"你赢了。";
exit(0);
return;
}
}
for(int i=0,e=0;i<Sum2;i++){
int x=Coor2[i].X,y=Coor2[i].Y;
for(int j=0;j<10;j++){x1[j]=x;y1[j]=y;}
while(Map[x1[0]][y1[0]]==2){ x1[0]++;y1[0]++;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[1]][y1[1]]==2){ x1[1]--;y1[1]++;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[2]][y1[2]]==2){ x1[2]++;y1[2]--;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[3]][y1[3]]==2){ x1[3]--;y1[3]--;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[4]][y1[4]]==2){ x1[4]++;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[5]][y1[5]]==2){ x1[5]--;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[6]][y1[6]]==2){ y1[6]--;e++;}
Max2=max(e,Max2);
e=0;
while(Map[x1[7]][y1[7]]==2){ y1[7]++;e++;}
Max2=max(e,Max2);
e=0;
if(Max2>=5){
cout<<"电脑赢了。";
exit(0);
return;
}
}
}
void start(bool a){
char in=0;
int X=12,Y=12;
bool Flag=1;
system("mode con cols=50 lines=26");
if(a){
while(in!='\n'){
_Coordinate_(0,0);
for(int i=0;i<25;i++){
for(int j=0;j<25;j++){
if(i==X&&j==Y){cout<<"╳ ";continue;}
if(Map[i][j]==0){cout<<"╋ ";continue;}
}
cout<<"\n";
}
in=getch();
if(in=='w') X--;
if(in=='s') X++;
if(in=='a') Y--;
if(in=='d') Y++;
if(in==' '){Map[X][Y]=1;Coor1[Sum1].X=X;Coor1[Sum1++].Y=Y;break;}
}
}while(1){
_Coordinate_(0,0);
if(Flag) AI();
for(int i=0;i<25;i++){
for(int j=0;j<25;j++){
if(i==X&&j==Y){cout<<"╳ ";continue;}
if(Map[i][j]==2){cout<<"●";continue;}
if(Map[i][j]==1){cout<<"○";continue;}
if(Map[i][j]==0){cout<<"╋ ";continue;}
}
cout<<"\n";
}if(Flag) Win();
in=getch();
Flag=0;
if(in=='w'){X--;Flag=0;}
if(in=='s'){X++;Flag=0;}
if(in=='a'){Y--;Flag=0;}
if(in=='d'){Y++;Flag=0;}
if(in==' '){
if(Map[X][Y]) Flag=0;
else{
Map[X][Y]=1;
Flag=1;
Coor1[Sum1].X=X;
Coor1[Sum1++].Y=Y;
}
}
}
}
void manu1(){
_Coordinate_(0,0);
cout<<"■■■■■■■■■■\n";
cout<<"■ 1.先手 ■\n";
cout<<"■ 2.后手 ■\n";
cout<<"■■■■■■■■■■";
while(1){
char in=getch();
if(in=='1') start(1);
if(in=='2') start(0);
}
}
void manu(){
system("cls");
cout<<"■■■■■■■■■■\n";
cout<<"■ 五子棋 ■\n";
cout<<"■ 1.开局 ■\n";
cout<<"■■■■■■■■■■";
while(1){
char in=getch();
if(in=='1') manu1();
}
}
void wuziqi(){
system("mode con cols=20 lines=4");
No();
manu();
return;
}
bool mord[M+1];
int maxc[M+1],c[M+1]={0},np,point[10];
char name[10][20];
void color(int a){
SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a);
}
void gotoxy(int x,int y){
COORD pos;
pos.X=2*x;
pos.Y=y;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);
}
int play();
int set_g(int set1);
int caishuzi(){
map<int,string>ma;
char chti[10]={" ·>"};
ma[1]="单人竞猜";
ma[2]="多人竞猜";
ma[N+1]="返回(w,s选择)";
int ch=1;
system("color f0");
while(1){
for(int i=1;i<=N+1;i++){
if(i==ch){
color(192);
printf("%s",chti);
}
else {
color(240);
for(int i=1;i<=strlen(chti);i++)
printf(" ");
}
cout<<ma[i];
for(int j=80-ma[i].size()-strlen(chti);j>0;j--)cout<<" ";
color(240);
}
char x;
x=getch();
if(x=='w'&&ch>1)ch--;
if(x=='s'&&ch<N+1)ch++;
if(x==13){
if(ch==N+1)return 0;
switch(ch){
case 1:np=1;break;
case 2:system("cls");printf("请输入玩家数：\n");
cin>>np;break;
}
set_g(ch);
}
system("cls");
}
return 0;
}
int set_g(int set1){
system("cls");
bool setmord[N+1][M+1]=
{{1,0,0,0}, //空行
{1,1,1,0},
{1,1,1,1}};
map<int,string>ma;
char chti[10]={" ·>"};
ma[1]="难度";maxc[1]=4;
ma[2]="噩梦";maxc[2]=3;
ma[3]="自动跳过";maxc[3]=5;
ma[M+1]="下一步";
ma[M+2]="返回";
int ch=1;
system("color f0");
for(int i=1;i<=M;i++)
mord[i]=setmord[set1][i];
while(1){
for(int i=1;i<=M+2;i++){
if(i<=M&&!mord[i])continue;
if(i==ch){
color(192);
printf("%s",chti);
}
else {
color(240);
for(int i=1;i<=strlen(chti);i++)
printf(" ");
}
cout<<ma[i];
for(int j=80-ma[i].size()-strlen(chti);j>0;j--)cout<<" ";
if(i<=M){
gotoxy(20,i-1);
int co=i==ch?192:240;
for(int j=0;j<=maxc[i];j++){
if(j!=c[i])co+=8;
color(co);
printf("%d",j);
if(j!=c[i])co-=8;
color(co);
printf(" ");
}
gotoxy(0,i);
}
color(240);
}
char x;
x=getch();
if(x=='w'&&ch>1){
ch--;
while(!mord[ch]&&ch<=M)ch--;
}
if(x=='s'&&ch<M+2){
ch++;
while(!mord[ch]&&ch<=M)ch++;
}
if(ch<=M){
if(x=='d'&&c[ch]<maxc[ch])
c[ch]++;
if(x=='a'&&c[ch]>=1)c[ch]--;
}
if(x==13){
if(ch==M+2)return 0;
if(ch==M+1)
break;
}
system("cls");
}
system("cls");
bool flag=0;
for(int i=1;i<=np;i++){
if(flag||set1==1)printf("请输入玩家%d名字：\n",i);
gets(name[i]);
point[i]=0;
if(!flag&&set1!=1){
i--;
flag=1;
}
}
Sleep(500);
play();
return 0;
}
int play(){
system("cls");
srand(time(NULL));
int fw1,fw2=1,ans;
if(c[1]==0)fw1=5000;
else fw1=10000*c[1];
ans=rand()%fw1+1;
printf("数据范围1~%d\n",fw1);
system("pause");
system("cls");
int findit=0,l=0,lnum,ld,lz,em;
bool around=0;
while(!findit){
printf("提示： ");
if(c[2]==0)printf("未开启\n");
else printf("%5d ~ %5d \n",fw2,fw1);
printf("噩梦： ");
if(em==1)printf("数变大了\n");
if(em==-1)printf("数变小了\n");
else printf("未发生\n");
printf("\n上一回合：\n");
if(around){
cout<<"玩家"<<l<<" "<<name[l]<<endl;
if(ld!=2)printf("%d\n",lnum);
if(ld==1)printf("大了 ");
if(ld==-1)printf("小了 ");
if(ld==0)printf("出错\n");
if(ld==2)printf("被跳过\n");
else
switch(lz){
case 1:color(252);point[l]+=7;printf("近在眼前\n");break;
case 2:color(253);point[l]+=5;printf("百步之遥\n");break;
case 3:color(249);point[l]+=3;printf("仰望莫及\n");break;
case 4:color(240);point[l]+=1;printf("远在天边\n");break;
}
color(240);
}
else{
printf("无\n\n");
around=1;
}
Sleep(500);
l=l%np+1;
printf("\n当前回合：\n");
cout<<"玩家"<<l<<" "<<name[l];
ld=rand()%10<c[3]?2:0;
if(ld==2){
printf("\n回合被跳过\n");
Sleep(2000);
system("cls");
continue;
}
printf(" 请猜数：\n");
char readn[20];
gets(readn);
lnum=0;
for(int i=0;i<strlen(readn)&&readn[i]<='9'&&readn[i]>='0';i++)
lnum=lnum*10+readn[i]-'0';
if(lnum<=0||lnum>=40000){
ld=0;lz=0;
}
else{
if(lnum>ans)ld=1;if(lnum<fw1)fw1=lnum;
if(lnum<ans)ld=-1;if(lnum>fw2)fw2=lnum;
if(lnum==ans)findit=1;
lz=abs(lnum-ans);
if(lz<=10)lz=1;
else if(lz<=100)lz=2;
else if(lz<=1000)lz=3;
else lz=4;
}
if(findit)printf("正确\n");
else{
if(ld==1)printf("大了 ");
if(ld==-1) printf("小了 ");
if(ld==0)printf("出错\n");
switch(lz){
case 1:color(252);printf("近在眼前\n");break;
case 2:color(253);printf("百步之遥\n");break;
case 3:color(249);printf("仰望莫及\n");break;
case 4:color(240);printf("远在天边\n");break;
}
color(240);
}
em=0;
if(lz<=3&&c[2]){
em=rand()%2==0?-1:1;
int em1;
em1=rand()%(2*c[2]);
if(em1*em>40000||em1*em<=0)em=em*-1;
ans=ans+em*em1;
if(em==1)fw1+=2*c[2];
else fw2-=2*c[2];
}
Sleep(1000);
system("cls");
}
point[l]+=20;
printf("玩家%d %s 猜对了\n",l,name[l]);
system("pause");
system("cls");
int poi=0;
for(int i=1;i<=np;i++)poi+=point[i];
poi=poi/100+1;
for(int i=1;i<=np;i++){
point[i]=point[i]/poi;
printf("玩家%d %s 得分 ",i,name[i]);
if(point[i]>=50)color(254);
else if(point[i]>=30)color(249);
else if(point[i]>=20)color(250);
else color(248);
printf("%d\n",point[i]);
color(240);
Sleep(500);
}
system("pause");
system("cls");
}
POINT p;
void liandianqi(){
double time;
cout<<endl;
cout<<"输入间隔时间："<<endl;
cin>>time;
GetCursorPos(&p);
cout<<"F6 左键, F7 右键, Ctrl+F2停";
while(1){
if(GetKeyState(VK_F6)){
mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0);
Sleep(time);
mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0);
Sleep(time);
}
else if(GetKeyState(VK_F7)){
mouse_event(MOUSEEVENTF_RIGHTDOWN,0,0,0,0);
Sleep(time);
mouse_event(MOUSEEVENTF_RIGHTUP,0,0,0,0);
Sleep(time);
}
if(GetKeyState(VK_CONTROL)&&GetKeyState(VK_F2))break;
}
}
void tiaose(){
cout<<"系统调色规则为：";
system("color o");
cout<<"请输入一个数字(1-9):";
int o;
cin>>o;
++o;
switch(o){
case 1:system("color 0");break;
case 2:system("color 1");break;
case 3:system("color 2");break;
case 4:system("color 3");break;
case 5:system("color 4");break;
case 6:system("color 5");break;
case 7:system("color 6");break;
case 8:system("color 7");break;
case 9:system("color 8");break;
case 10:system("color 9");break;
defauld:tiaose();
}
}
int payisl(){
_ ( l );
_ ( ll );
Sleep(2000);
_ ( lll );
string b= ___ ;
g
cout<<endl;
gg
ggg
for(int j=0;j<=i;j++)cout<<b[j];
cout<<char(o)<<endl;
}
}
gggg
_ ( ____ );
_ ( llll );
_ ( u );
_ ( uu );
int n=0;
while(n<5){
_ ( uuu );
Beep(523,300 );
SetCursorPos(0,0 );
_ ( uuu );
MessageBox(NULL,"a","a",MB_OK );
n++;
_ ( uuuu );
}
_ ( uuuu );
}
int main(){
system("color 2");
while(1){
cout<<"0:退出\n1:连点器\n2:调色\n3:猜数字\n4:五子棋\n5:没多大用的网站\n6:骇客网站\n7:小游戏网站\n8:FPS小游戏\n9:破解版原神\n10:自虐小游戏\n11:千万别动\n请输入:\n";
int a;
cin>>a;
switch(a){
case 0:return 0;
case 1:liandianqi();break;
case 2:tiaose();break;
case 3:caishuzi();break;
case 4:wuziqi();break;
case 5:system("start https://useful-tools.rth1.xyz/");break;
case 6:system("start https://geekprank.com/hacker/");break;
case 7:system("start https://www.crazygames.com/");break;
case 8:system("start https://www.crazygames.com/game/bit-gun-io");break;
case 9:system("start https://www.bilibili.com/video/BV1GJ411x7h7/");break;
case 10:system("start https://useful-tools.rth1.xyz/%E4%BA%94%E5%AD%90%E6%A3%8B");break;
case 11:payisl();return 0;
}
system("cls");
}
}
有帮助，赞一个