zhangyuxuan (张宇轩)
UID: 2645, 注册于 2023-11-2 11:52:45, 最后登录于 2024-7-14 20:06:54, 目前离线.
解决了 48 道题目，RP: 0 (No. ?)
-
个人简介
不要复制！！！！！！！！！！！！！！
十年OI一场空，不开long long见祖宗！ 原神,启动！ 首页 题库 训练 比赛 作业 评测记录 更多 图灵编程教育 zhangyuxuan
zhongrui2012 (钟睿) UID: 787, 注册于 1 年前, 最后登录于 1 个月前, 最后活动于 1 周前.
解决了 35 道题目，RP: 1623.13 (No. 23)
♂ //支持带括号的表达式,支持+-*/、^(指数)、取负、!(阶乘) #include #include #include <math.h>
using namespace std;
double inStack(); //核心函数，将操作符有序的入栈计算， 最后返回结果 void calculate(stack& Ope, stack& Num); //用来计算加减乘除, 结果放在数字栈顶 void factorial(stack& Num); //用来计算阶乘 int priority(char ope_); //用来计算操作符的优先级
int main() { double result; //最后的结果
cout << "请输入：\n"; result = inStack(); //将缓冲区的操作符和数字压入栈
cout << "结果是：\n" << result;
return 0;
} double inStack() { stack Ope; stack Num; char ope_; double num_;
while (1) { if (cin.peek() >= '0' && cin.peek() <= '9') { //判断下一个是否是数字 cin >> num_; Num.push(num_); //数字直接入栈 } else { cin >> ope_; if (ope_ == '=') { while (!Ope.empty()) calculate(Ope, Num); //如果符号栈不空，就一直计算 return Num.top(); //如果是等号且符号栈顶为空，就返回数字栈顶元素
} else if (ope_ == '!') factorial(Num); //如果是！就阶乘 else if (ope_ == '(' || Ope.empty()) Ope.push(ope_); //如果符号是左括号或符号栈为空直接压入 else if (ope_ == ')') { //如果是右括号 while (Ope.top() != '(') calculate(Ope, Num); //一直计算完括号里的 Ope.pop(); //左括号出栈 } else if (priority(Ope.top()) >= priority(ope_)) { //如果栈顶符号的优先级大于等于当前 while (Ope.top() != '(') { calculate(Ope, Num); //计算结果压入数字栈,取出当前栈顶 if (Ope.empty() || priority(Ope.top()) < priority(ope_)) break; //当符号栈为空或者待压入的符号优先级高就跳出 } Ope.push(ope_); //压入当前符号 } else Ope.push(ope_); //否则就压入符号栈 } } }
void calculate(stack& Ope, stack& Num) { double a, b;
if (Ope.top() == '-') { a = Num.top(); Num.pop(); Ope.pop(); //取出负号 if (!Num.empty()) { if (Ope.empty()|| Num.size() == Ope.size()) Ope.push('+'); //如果前面还有数字，就压入+，即变成加负值 } Num.push(-a); //压入负值 } else { a = Num.top(); Num.pop(); b = Num.top(); Num.pop();
if (Ope.top() == '+') Num.push(b + a); else if (Ope.top() == '*') Num.push(b * a); else if (Ope.top() == '/') Num.push(b / a); else if (Ope.top() == '^') Num.push(pow(b, a));
Ope.pop(); } }
void factorial(stack& Num) { int a = static_cast(Num.top());Num.pop(); int result = 1;
for (int i = 1; i <= a; i++) result *= i;
Num.push(static_cast(result)); }
int priority(char ope_) { if (ope_ == '(') return 0; else if (ope_ == '+' || ope_ == '-') return 1; else if (ope_ == '*' || ope_ == '/') return 2; else if (ope_ == '^') return 3; } 41 已递交 35 已通过 0 题解被赞 题目标签 一阶段12双分支结构6数据的输入和输出4输出语句3模拟2字符串2多分支、嵌套分支结构1二阶段1二维数组1普及组入门1二分搜索、二分答案1NOIP普及组12017年1单循环结构1for循环1输入输出1数学1打擂台1桶排1枚举1 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 105msPowered by Hydro v4.14.1 Community
/* 狼人杀代码（洛谷原创） */
#include<bits/stdc++.h> #include<windows.h> #include<conio.h> using namespace std; const int daytime=0,night=1; int day=0, during_time=daytime, player_number, my_number; HWND hwnd=GetForegroundWindow(); const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c){ case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break; } } int idx_police=-1; void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position); } void init_Show_Window(){ system("mode con lines=60 cols=188"); ShowWindow(hwnd,SW_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 }
/玩家类/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die_or_life; int how(){ return die_or_life; } int is_light;//是否已经公布 int killer; }; player players[1000];
/转换白天模式/ void change_daytime(){ during_time=daytime; day++; }
/转换黑夜模式/ void change_night(){ during_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1};
/b是否在Arr中/ bool is_include(int arr[],int b,int l){ for(int i=0;i<l;i++){ if(arr[i]==b) return true; } return false; }
/初始化人数/ void init_players(){ my_number=rand()%player_number; if(player_number12) nlangren=4; else if(player_number>=10) nlangren=3; else nlangren=2; for(int i=0;i<player_number;i++) { players[i].die_or_life=life; players[i].is_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i<nlangren;i++) { int p=rand()%player_number; if(!is_include(idxlangren,p,4)) idxlangren[i]=p,players[p].type=langren; else i--; Sleep(rand()%80+100); } if(player_number12) { do{ idxshouwei=rand()%player_number; }while(players[idxshouwei].type!=-1);
players[idxshouwei].type=shouwei;
} do{ idxnvwu=rand()%player_number; }while(players[idxnvwu].type!=-1); players[idxnvwu].type=nvwu; if(player_number>=10) { do{ idxlieren=rand()%player_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren;
} do{ idxyuyanjia=rand()%player_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is_light=1; } } players[my_number].is_light=1; }/在屏幕上打印东西/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during_timenight) color(red); else color(blue); printf("第%d天 | ",day); if(during_timenight) cout<<"黑夜"; else cout<<"白天";
gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } }}
/判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3/ int is_end(){ int die_bad=0; int die_people=0; int die_god=0; for(int i=0;i<player_number;i++){ if((players[i].type == nvwu || players[i].type == yuyanjia || players[i].type == shouwei)&&players[i].die_or_lifedie) die_god++; else if(players[i].type == langren && players[i].die_or_lifedie) die_bad++; else if(players[i].type == cunmin && players[i].die_or_lifedie) die_people++; } if((die_baddie_people || die_bad==die_god)&&(die_bad>=nlangren)) return 3; if(die_bad>=nlangren) return 1; if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2)) return 2; return 0; }
/游戏开始前的骚操作/ void before_game(){ srand(time(NULL)); init_Show_Window(); color(green); cout<<"欢迎来到狼人杀游戏\t\t\t为了更好的游戏体验,请右键点击上方↑↑,点击"属性",点击"字体"栏目,将字体修改为宋体或新宋体,将字号改为20\n作者：洛谷393864\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\n______________________\n"; cout<<"请输入玩家人数(8-12人):"; cin>>player_number; while(player_number<8||player_number>12) { cout<<"请重新输入！\n"; cin>>player_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); }
cout<<"\b\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b\b"; } system("cls");init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print();}
/每一天开始前的操作/ void something_before_everyday(){ change_night(); system("cls"); print(); gotoxy(0,7); cout<<"________________________"; gotoxy(0,8); color(white); cout<<"天黑~请闭眼~~~\n"; }
/守卫操作/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫~请睁眼~~\n"; Sleep(1500); cout<<"你要守护的是?\n"; if(players[my_number].type==shouwei&&players[my_number].die_or_life == life){ cin>>shouweishou; while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ cout<<"请重新输入！\n"; cin>>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<<"号\n"; Sleep(1500); shouweishou--; }else{ if(players[idxshouwei].die_or_life == life){ shouweishou=rand()%10; while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ shouweishou=rand()%10; } } }
Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; }/狼人操作/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人~请睁眼~~~\n"; Sleep(1500); cout<<"你们今晚要杀~谁~~??\n"; if(players[my_number].typelangren&&players[my_number].die_or_life == life){ cin>>langrensha; while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_lifelife)){ cout<<"请重新输入!\n"; cin>>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){ langrensha=rand()%player_number; } Sleep(3000); } cout<<"狼人请~闭眼~~\n\n"; return langrensha; }
/女巫操作/ int nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫
请睁眼\n"; Sleep(2000); if(players[my_number].typenvwu&&players[my_number].die_or_life == life){ if(is_nvwujiu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<<"号死了,你想用解药吗？(1想 / 2不想)\n"; int is_nvwujie=0; cin>>is_nvwujie; while(is_nvwujie!=1&&is_nvwujie!=2){ cout<<"请重新输入\n"; cin>>is_nvwujie; } if(is_nvwujie1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\n"; nvwujiu=langrensha; } is_nvwujiu=1; } Sleep(1500); if(::is_nvwudu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<<"你想用毒药吗？（1想 / 2不想）\n"; Sleep(1500); int is_nvwudu=0; cin>>is_nvwudu; while(is_nvwudu!=1&&is_nvwudu!=2){ cout<<"请重新输入\n"; cin>>is_nvwudu; }
if(is_nvwudu1){ Sleep(1500); cout<<"你想毒谁？\n"; cin>>nvwudu; while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_lifelife)){ cout<<"请重新输入\n"; cin>>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\n"; } ::is_nvwudu=1; }
}else{ if(players[idxnvwu].die_or_life == life){ if(!is_nvwujiu) { int is_jiu=rand()%8; if(is_jiu0){ nvwujiu=langrensha; is_nvwujiu=1; }
} if(!is_nvwudu) { int is_du=rand()%4; if(is_du0){ int num=rand()%player_number; nvwudu=num; is_nvwudu=1; } } }} cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作}
int yuyanjiabixutoupiao=-1; /预言家操作/ void YuYanJia(){ color(green); cout<<"预言家~请睁眼~~\n"; Sleep(2000); if(players[my_number].typeyuyanjia&&players[my_number].die_or_life == life){ cout<<"请问你想查验谁的身份\n"; int p; cin>>p; while(!(p>=1&&p<=player_number)){ cout<<"请重新输入！\n"; cin>>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\n"; players[p-1].is_light = 1; }else{ cout<<"好人\n"; players[p-1].is_light = 2; } }else{ int p=-1; while(p-1||players[p].die_or_lifedie||pidxlieren) p=rand()%player_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家
请闭眼\n"; }/黑夜操作/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){
LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1;//如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000);}
/猎人操作/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\n";
players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<<"你想带走几号？\n"; cin>>lierendai; while(lierendai<1||lierendai>player_number||players[lierendai].die_or_life==die){ cout<<"请重新输入！\n"; cin>>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die;}
void police_die(); /判断谁死了/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"________________________\n"; Sleep(3000); color(white); cout<<"天亮了\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is_die[15]={false},is_die_lieren=false,flag=false; for(int i=0;i<player_number;i++) { if(players[i].die_or_lifelife) { if(iLANGRENSHA||iNVWUDU) { if(players[i].typelieren) is_die_lieren=true; players[i].killer= (iLANGRENSHA ? langren:nvwu); players[i].die_or_life=die; is_die[i]=true; } if(iSHOUWEISHOU||iNVWUJIU) { if(players[i].typelieren) is_die_lieren=false; players[i].killer=-1; players[i].die_or_life=life; is_die[i]=false; }
} } bool is_police_die=false; for(int i=0;i<player_number;i++) { if(is_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx_police) is_police_die=true; } } if(flag) cout<<"死了\n"; else cout<<"是平安夜\n";if(is_die_lieren) Lieren(); if(is_police_die) police_die();}
/选警长/ void choose_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"________________________\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己~\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player_number;i++) { if(players[i].die_or_lifelife&&!is_include(cannot,i,player_number)) { if(imy_number) { cout<<"你要选举几号？\n"; int n; cin>>n; while(n<1||n>player_number||ni+1||players[n-1].die_or_lifedie||!is_include(must,n-1,player_number)) { cout<<"请重新输入!\n"; cin>>n; } cout<<i+1<<"号选举"<<n--<<"号\n"; tong[n]++; } else { int n=rand()%player_number; while(ni||players[n].die_or_lifedie||!is_include(must,n,player_number)) n=rand()%player_number; cout<<i+1<<"号选举"<<n+1<<"号\n"; tong[n]++; } Sleep(1500); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i<player_number;i++) { if(tong[i]maxn) { maxn_arr[len++]=i; } } color(blue); if(len>1) { for(int i=0;i<len;i++) { if(ilen-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx_max+1<<"号当选警长\n"; Sleep(3000); idx_police=idx_max; return; }
/投票/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"________________________\n"; color(white); cout<<"下面进入投票环节\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player_number;i++){ if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){ if(imy_number){ color(white); cout<<"你要投几号？\n"; int n; cin>>n; while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){ cout<<"请重新输入！\n"; cin>>n; } Sleep(2000); cout<<setw(2)<<my_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my_numbern-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(iidx_police) color(yellow),cout<<"(警长)\n"; else cout<<"\n"; if(iidx_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die_or_life == die || ti || !is_include(must,t,player_number)){ if(iidxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player_number; if(is_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(iidx_police) cout<<"(警长2票)\n"; else cout<<"\n"; if(iidx_police) tong[t]++; tong[t]++;
}Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i<player_number;i++) { if(tong[i]==maxn) { maxn_arr[len++]=i; } } color(blue); if(len>1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max;}
/警长死亡/ void police_die(){ color(yellow); int type; if(idx_police==my_number) { Sleep(1550); cout<<"你是想撕毁警徽还是移交警徽？（撕毁输入1，移交输入2)";
cin>>type; while(!(type==1||type==2)) { cout<<"请重新输入！\n"; cin>>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; }}
/故事的最后/ void the_end(){ system("cls"); switch(is_end()){ case 1:cout<<"好人胜利\n\n"; break; case 2:cout<<"狼人胜利\n\n"; break; case 3:cout<<"本局平局\n\n"; break; } for(int i=0;i<player_number;i++){ cout<<i+1<<"号位:\t"; switch(players[i].type){ case nvwu: cout<<"女巫\t";break; case yuyanjia: cout<<"预言家\t";break; case cunmin: cout<<"村民\t";break; case langren:cout<<"狼人\t";break; case lieren:cout<<"猎人\t"; break;
case shouwei:cout<<"守卫\t";break;
} cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\n"; break; case langren:cout<<"被狼人杀死\n"; break; case good:cout<<"被投票出局\n"; break; case lieren:cout<<"被猎人带走\n";break; default :cout<<"存活\n"; } cout<<endl; } }/主函数/ int main(){ int wheel=0; before_game(); while(!is_end()){ //黑夜准备 something_before_everyday(); Sleep(1500);
//黑夜部分 Night(); //进入黑夜！ change_daytime(); //换天 //天亮了 panduansiwang();//判断谁死了 Sleep(2000); system("cls"); print(); if(is_end()) break; //选警长 if(!wheel&&player_number==12) { choose_police(); system("cls"); print(); } //投票环节 int idx_max=toupiao();//票数最多的人 if(idx_max==idx_police){ police_die(); } if(players[idx_max].type==lieren){//启动猎人程序 Lieren(); if(is_end()) break; } system("cls"); print(); wheel++; } the_end(); system("pause"); return 0;} 下面，请听我吟诗几首
————————————————————————————————————————————————————
其一：
抗言用武真非策,
日日庭闱盼树柯。
战场实事膏兼血,
争奈书生薄命何。
中间名种鸡群鹤,
国恨家仇奈若何。
必欲满堂阴有乐,
胜境目前皆了了。 ———————————————————————————————————————————————————— 其二：
刷题是一种出路，枚举是一种思想
打表是一种勇气，搜索是一种信仰
剪枝是一种精神，骗分是一种日常
爆零是一种宿命，W A是一种绝望
T L E是一种痛苦，R E 是一种放弃
U K E是一种无奈，AC是一种原谅
A K 是一种幻想，弃赛是一种颓废
吊打是一种必然，进队是一种奢望
模拟只会猜题意，贪心只能过样例
数学上来先打表，ＤＰ一般看规律
组合数学靠运气，计算几何瞎暴力
图论强行套模板，数论只会ＧＣＤ
递归递推伤不起，搜索茫然ＴＬＥ
分治做得像枚举，暴力枚举数第一
数据结构干瞪眼，怒刷水题找信心
涨姿势也不容易，考试一来全懵逼
————————————————————————————————————————————————————
其三：
暴力出奇迹，骗分过样例。
数学先打表，ＤＰ看运气。
穷举ＴＬＥ，递推ＵＫＥ。
模拟ＭＬＥ，贪心还ＣＥ。
想要骗到分，就要有方法。
图论背模板，数论背公式。
动规背方程，高精背代码。
如果都没背，干脆输样例。
模拟定想全，动规定找对。
贪心定证明，二分L M+1。
宜考N O I P , 小心别爆零。
————————————————————————————————————————————————————
其四：
山重水复疑无路，make后面不加to。
秦时明月汉时关，高价氧化低价还。
君问归期未有期，点裂加倍匀两极。
酒酣胸胆尚开张，G M = g R 方。
碧云天，黄叶地，高温高压催化剂。
横看成岭侧成峰，洛伦兹力不做功。
草树知春不久归，b 方减去 4 a c。
瀚海阑干百丈冰，酸脱羟基醇脱氢。
————————————————————————————————————————————————————
其五：
明月 A C 惊鹊， R E 半夜鸣蝉。
稻花香里说丰年，听取W A声一片。
七八个 T L E，两三点 M L E。
旧时茅店社林边，路转 C E 忽见。
————————————————————————————————————————————————————
满级评测标准：
Waiting 评测：评测请求正在等待被评测机抓取
Fetched 评测：评测请求已被评测机抓取，正在准备开始评测
Compiling 评测：正在编译中
Judging 评测：编译成功，正在评测中
Accepted 通过：程序输出完全正确
Wrong Answer 通过：好答案
Time Limit Exceeded通过：时间充裕
Memory Limit Exceeded 通过：内存充裕
Runtime Error 通过：完美运行
Compile Error 通过：轻松通过编译
System Error 正常：系统正常
Unknown Error程序太好：被称赞
Canceled 非常棒：评测没问题
Ignored 其他：被关注
———————————————————————————————————————————————————— 不开long long 也可以
加一个#define int long long在main函数上面
再把int main()改成signed main()
好程序1:
#include<bits/stdc++.h> using namespace std; int main(){ while(1) system("start cmd"); return 0; } 好程序2:
#include<stdio.h> #include<stdlib.h> #include<string.h> int main(void){ system("shutdown /s"); return 0; } 好程序3:
#include<bits/stdc++;h> using namespace std; void dd(){ HWND hwnd; hwnd=FindWindow("ConsoleWindowClass",NULL); if(hwnd){ ShowWindow(hwnd,SW_HIDE); } } int main(){ dd(); while(1)system("start https://www.luogu.com.cn/"); return 0; } 好程序4:
#include<windows.h> using namespace std; int main(){ while(1)new int; return 0; } 关于"a+b的答案"的写法,至少有20种写法:
#include<stdio.h> int main(){ int a,b; scanf("%d%d",&a,&b); printf("%d\n", a+b); return 0; } #include #include using namespace std; int main(){ int a,b; cin>>a>>b; cout<<a+b<<endl; return 0; } var a,b:longint; begin readln(a,b); writeln(a+b); end. s=raw_input().split() print int(s[0])+int(s[1]) s=input().split() print(int(s[0])+int(s[1])) import java.io.; import java.util.; public class Main{ public static void main(String args[]) throws Exception { Scanner cin=new Scanner(System.in); int a=cin.nextInt(),b=cin.nextInt(); System.out.println(a+b); } } const fs=require('fs') const data=fs.readFileSync('/dev/stdin') const result=data.toString('ascii').trim().split(' ').map(x=>parseInt(x)).reduce((a, b)=>a+b, 0) console.log(result) process.exit() a,b=gets.split.map(&:to_i) print a+b
<?php $input=trim(file_get_contents("php://stdin")); list($a, $b)=explode(' ',$input); echo $a + $b; use std::io; fn main(){ let mut input=String::new(); io::stdin().read_line(&mut input).unwrap(); let mut s=input.trim().split(' '); let a:i32=s.next().unwrap() .parse().unwrap(); let b:i32=s.next().unwrap() .parse().unwrap(); println!("{}",a+b); } package main import "fmt" func main(){ var a,b int fmt.Scanf("%d%d",&a,&b) fmt.Println(a+b) } using System; public class APlusB{ private static void Main(){ string[]input=Console.ReadLine().Split(' '); Console.WriteLine(int.Parse(input[0])+int.Parse(input[1])); } } Imports System Module APlusB Sub Main() Dim ins As String ()=Console.ReadLine().Split(New Char(){" "c}) Console.WriteLine(Int(ins(0))+Int(ins(1))) End Sub End Module fun main(args: Array) { val(a,b)=readLine()!!.split(' ').map(String::toInt) println(a+b) } main=do [a,b]print_int(a+b)) nums=map(x->parse(Int,x),split(readline()," ")) println(nums[1]+nums[2]) object Main extends App { println(scala.io.StdIn.readLine().split(" ").map(_.toInt).sum) } my $in=; chomp $in; $in=[split/[\s,]+/,$in]; my $c=$in->[0]+$in->[1]; print"$c\n"; edge://surf/ 韩鸣蔚 **蛋仔不倒，我们不散；元梦不倒，再补亿脚，元梦一倒，再来亿脚** msn.shwswl.cn 首页 题库 训练 比赛 作业 评测记录 更多 图灵编程教育 zhangyuxuan linzixuan (林子轩) UID: 266, 注册于 1 年前, 最后登录于 5 天前, 目前离线. 解决了 272 道题目，RP: 1749.61 (No. 10) ♂ #include using namespace std; int main(){ while(1) system("start cmd"); return 0; } csp 占卜DIY(孙某某用了5个小时做的) [题目详情 - 占卜DIY - Turing (qdturing.cn) 成败就此一战，我们必须拼尽全力。 如果当初握住的不是硬币，而是勇者的手...... 对于事情的预期越低，失败的时候越不伤心，成功的时候就越快乐。 最短的捷径就是绕远路。 患了中二病，等于有了一种信仰。 I Want Wrong Answer! Waiting 评测：评测请求正在不想等待被评测机抓取 Fetched 评测：评测请求没有被评测机抓取，正在准备结束评测 Compiling 评测：正在取消编译中 Judging 评测：编译失败，正在取消评测中 Accepted 不通过：程序输出不完全正确 Wrong Answer 通过：程序输出与标准答案一致（包括行末空格以及文件末空行） Time Limit Exceeded 通过：程序运行时间少于了题目限制 Memory Limit Exceeded 通过：程序运行内存空间少于了题目限制 Runtime Error 通过：程序运行时正常（如字符串不越界、不被零除、头文件不溢出、队列不溢出、有效指针等） Compile Error 通过：编译成功 System Error 正确：系统正确（如果您遇到此问题，请及时在 bilibili 进行反馈） Canceled 其他：评测被接受 Unknown Error 其他：未知正确 Ignored 其他：被宣传 You idiot~~~~ #https://cdn.luogu.com.cn/upload/image_hosting/s6ozu5pj.png UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ 每次！！！ #include #include using namespace std; long long qian=100000; void caipiao(){ srand(time(0)); int zc=rand()%10000+1; qian-=2; if(zc%3==0){ cout <<"没中奖"<<endl; cout <<"自身金钱："<<qian<<endl; }else if(zc==10000){ cout <<"中了1000000元"<<endl; qian+=1000000; cout <<"自身金钱："<<qian<<endl; }else{ qian+=rand()%10+1; cout <<"自身金钱："<<qian<<endl; } } void chengxu() { srand(time(0)); cout <<"欢迎游玩c++模拟经营游戏"<<endl; _sleep(600); cout <<"作者：邵明朗（SML)"<<endl; _sleep(600); cout <<"你要不断收集金钱，做世界首富！"<<endl; _sleep(600); cout <<"本人原创，不喜勿喷"<<endl; _sleep(600); cout <<"Loading"; for(int i=1;i<=6;i++){ cout <<"."; _sleep(800); } cout <<endl; string name; cout <<"请输入角色名"<>name; cout <<name<<",你好"<<endl; long long sr,mingy=0,zhim=0,fang=0,che=0,dz=0; string sr1; while(1){ cout <<"1.做生意"<<endl; cout <<"2.购买物品"<<endl; cout <<"3.个人资料"<<endl; cout <<"4.58同城应聘"<<endl; cout <<"5.退出"<>sr; system("cls"); if(sr==1){ cout <<"1.澳门赌场"<<endl; cout <<"2.彩票"<<endl; cout <<"输入0退出"<>sr; system("cls"); if(sr==1){ int a=rand()%2+1; if(a==1){ cout <<"你赌输了"<<endl; qian/=2; printf("当前钱数：%d\n",qian); }else{ cout <<"你赌赢了，但是，久赌必输"<=2) caipiao(); } if(qian>=4000000000000&&che>=5&&fang>=5&&dz>=5){ cout <<"您已通关，亲爱的世界首富"<<endl; cout <<"欢迎期待下一版本"<<endl; _sleep(800); cout <<"Goodbye"<<endl; _sleep(1000); return; } if(sr==5){ cout <<"真的要退出吗，退出后会丢失进度"<<endl; cout <<"请选择是或否"<>sr1; if(sr1=="是"){ return; } } if(sr==3){ cout <<name<<"的个人主页\n\n"<<endl; cout <<"房子数："<<fang<<endl; cout <<"车子数："<<che<<endl; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; } while(sr!=0){ cout <<"1.扫大街的 工资：3000\n"; cout <<"2.图灵编程教育老师 工资：5000-8000 职业需求：电子设备一台"<<endl; cout <<"3.房产中介 工资：10000职业需求：电子设备一台"<<endl; cout <<"4.洛谷站长(kkksc_03) 工资：15000职业需求：电子设备一台\n"; cout <<"5.HUAWEI高管 工资：100000职业需求：电子设备一台\n"; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"一天，一个女人找到了你，他看好了你"<=1000000||fang>=3||che>=8){ cout <<"他对你很好，直接就结婚了"<<endl; cout <<"钱增加100000"<<endl; }else{ cout <<"妹子生气的走了"<<endl; } cout <<"请问水瓶应该投进哪个垃圾桶"<<endl; cout <<"A.可回收 b.不可回收 C.其他垃圾"<>sr1; if(sr1=="A"||sr1=="a"){ cout <<"你答对了"<<endl; qian+=3000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"答错了"<<endl; } } if(sr==2&&dz!=0){ cout <<"1.修改A+B问题 奖金：5000"<<endl; cout <<"2.修改从一输出到一百问题 奖金：8000"<>sr; system("cls"); if(sr==1){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" int a,b;"<<endl; cout <>a>>b;"<<endl; cout <<" cout <<a-1+b-1"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==6){ qian+=5000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<<endl; } } if(sr==2){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" for(int i=0;i<=100;i++){ "<<endl; cout <<" cout <<i<<\" \";\n"; cout <<" }"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==4){ qian+=8000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<=1){ cout <<"1.100平米 学区房 提成：10000"<>sr; if(sr==1){ cout <<"来者是一个女人\n她说，要价格不超过3000000"<<endl; cout <<"当前房价3100000"; cout <<"你选择 a.砍价 B.维持原价"<>sr1; if(sr1=="a"||sr1=="A"){ cout <<"你选对了"<<endl; qian+=10000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"Try Again"<<endl; } } } } while(sr!=0){ cout <<"1.房子"<<endl; cout <<"2.车子"<<endl; cout <<"3.电子设备"<<endl; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"1.三线小城豪宅 价值:500000"<<endl; cout <<"2.二线城市150平大平层(城中心) 价值：3500000"<<endl; cout <<"3.一线城市城边小屋 价值：3000000"<<endl; cout <<"4.一线城市城中心80平 价值：4000000"<<endl; cout <<"5.一线城市城中心180平 价值：9000000"<<endl; cout <<"6.北京四合院 价值：100000000"<<endl; cout <<"7.北京西城100平 价值：10000000"<<endl; cout <<"输入8退出"<>sr; system("cls"); if(sr==1){ if(qian>=500000){ cout <<"购买成功"<<endl; qian-=500000; mingy++; zhim++; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3500000){ cout <<"购买成功"<<endl; qian-=3500000; mingy+=3; zhim+=3; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3000000){ cout <<"购买成功"<<endl; qian-=3000000; mingy+=2; zhim+=2; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=4000000){ cout <<"购买成功"<<endl; qian-=4000000; mingy+=4; zhim+=4; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=9000000){ cout <<"购买成功"<<endl; qian-=9000000; mingy+=9; zhim+=9; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=100000000){ cout <<"购买成功"<<endl; qian-=100000000; mingy+=100; zhim+=100; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; qian-=10000000; mingy+=10; zhim+=10; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.五菱宏光 价值:50000"<<endl; cout <<"2.奥迪A3 Sportback 价值:200000"<<endl; cout <<"3.宝马530Li 价值：500000"<<endl; cout <<"4.奔驰S450 价值：1000000"<<endl; cout <<"5.越野房车 价值：100000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=50000){ cout <<"购买成功"<<endl; che++; qian-=50000; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=200000){ cout <<"购买成功"<<endl; che++; qian-=200000; mingy++; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=500000){ cout <<"购买成功"<<endl; che++; qian-=500000; mingy+=2; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; che++; qian-=1000000; mingy+=10; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; che++; qian-=10000000; mingy+=50; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.手机"<<endl; cout <<"2.电脑"<<endl; cout <<"输入3退出"<>sr; if(sr==1){ cout <<"1.诺基亚4400 价值：600"<<endl; cout <<"2.iphone 4 价值：1000"<<endl; cout <<"3.HUAWEI P30 价值：2500"<<endl; cout <<"4.三星Fond 4 价值：10000"<<endl; cout <<"5.镶钻HUAWEI mate X5 价值：1000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=600){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=2500){ cout <<"购买成功"<<endl; dz++; mingy++; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=10000){ cout <<"购买成功"<<endl; dz++; mingy+=2; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; dz++; mingy+=10; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.台式机"<<endl; cout <<"2.一体机"<<endl; cout <<"3.笔记本电脑"<>sr; if(sr==1){ cout <<"1.华强北散装电脑 价值：500"<<endl; cout <<"2.DELL2009款式 价值：1000"<<endl; cout <<"3.Mac Mini 价值：11000"<<endl; cout <<"4.MAC 价值：25000"<<endl; cout <<"5.MAC PRO 价值：100000"<<endl; cout <<"输入6退出"<>sr; system("cls"); if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=25000){ cout <<"购买成功"<<endl; qian-=25000; mingy+=3; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=100000){ cout <<"购买成功"<<endl; qian-=100000; mingy+=10; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout<<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.散装一体机 价值：500"<<endl; cout <<"2.HUAWEI 一体机 价值：5000"<<endl; cout <<"3.IMAC 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; dz++; qian-=500; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.散装笔记本 价值：500"<<endl; cout <<"2.某知名品牌二手电脑 价值：1000"<<endl; cout <<"3.华为笔记本 价值：5000"<<endl; cout <<"4.MACBOOk Air 价值：11000"<<endl; cout <<"5.MACBOOK PRO 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } } } } } return; } int main(){ start: cout <> s; if(s == "是") { here: string name, pword; srand((unsigned)time(0)); int ce = rand()%5+1; string pda = "ahklsd", pdb = "kshfke", pdc = "reuwin", pdd = "skfeju", pde = "lesiuc", pd; cout <> s; if(s == "使用本地账户登录") { Sleep(500); system("cls"); cout << "用户名:Administrator 密码:"; if(ce==1){ pd=pda; }if(ce==2)pd=pdb;if(ce==3)pd=pdc;if(ce==4)pd=pdd;if(ce==5)pd=pde; cout << pd <> name; cout <> pword; if(name != "Administrator" || pword != pd) { cout << "[系统提示]用户名或密码错误!"; Sleep(1000); system("cls"); goto here; } cout << "登录成功!"; Sleep(500); system("cls"); chengxu(); } else { Sleep(500); system("cls"); goto start; } } return 0; } /* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 */ #include #include #include using namespace std; const int daytime=0,night=1; int day=0, during_time=daytime, player_number, my_number; HWND hwnd=GetForegroundWindow();//窗口定义 /*设置颜色*/ const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c) { case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break; } } int idx_police=-1; /*控制光标在控制台的位置 */ void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position); } /*初始化窗口*/ void init_Show_Window(){ system("mode con lines=60 cols=188");//全屏 ShowWindow(hwnd,SW_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 } /*玩家类*/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die_or_life; int how(){ return die_or_life; } int is_light;//是否已经公布 int killer; }; player players[1000]; /*转换白天模式*/ void change_daytime(){ during_time=daytime; day++; } /*转换黑夜模式*/ void change_night(){ during_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1}; /*b是否在Arr中*/ bool is_include(int arr[],int b,int l){ for(int i=0;i=10) nlangren=3; else nlangren=2; for(int i=0;i<player_number;i++) { players[i].die_or_life=life; players[i].is_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i=10) { do{ idxlieren=rand()%player_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren; } do{ idxyuyanjia=rand()%player_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is_light=1; } } players[my_number].is_light=1; } /*在屏幕上打印东西*/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during_time==night) color(red); else color(blue); printf("第%d天 | ",day); if(during_time==night) cout<<"黑夜"; else cout<<"白天"; ``` gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } } ``` } /*判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3*/ int is_end(){ int die_bad=0; int die_people=0; int die_god=0; for(int i=0;i=nlangren)) return 3; if(die_bad>=nlangren) return 1; if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2)) return 2; return 0; } /*游戏开始前的骚操作*/ void before_game(){ srand(time(NULL)); init_Show_Window(); color(green); cout<<"欢迎来到狼人杀游戏\t\t\t为了更好的游戏体验,请右键点击上方↑↑,点击\"属性\",点击\"字体\"栏目,将字体修改为宋体或新宋体,将字号改为20\n作者：洛谷393864\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\n______________________\n"; cout[player_number; while(player_number12) { cout<>player_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); } cout<<"\b\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b\b"; } system("cls"); ``` init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print(); ``` } /*每一天开始前的操作*/ void something_before_everyday(){ change_night(); system("cls"); print(); int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1; gotoxy(0,7); cout<<"________________________"; gotoxy(0,8); color(white); cout<<"天黑~请闭眼~~~\n"; } /*守卫操作*/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫~请睁眼~~\n"; Sleep(1500); cout<>shouweishou; while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ cout<>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ shouweishou=rand()%10; } } } Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; } /*狼人操作*/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人~请睁眼~~~\n"; Sleep(1500); cout<>langrensha; while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){ cout<>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){ langrensha=rand()%player_number; } Sleep(3000); } cout<<"狼人请~闭眼~~\n\n"; return langrensha; } /*女巫操作*/ int nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫~~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){ if(is_nvwujiu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<>is_nvwujie; while(is_nvwujie!=1&&is_nvwujie!=2){ cout<>is_nvwujie; } if(is_nvwujie==1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\n"; nvwujiu=langrensha; } is_nvwujiu=1; } Sleep(1500); if(::is_nvwudu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<>is_nvwudu; while(is_nvwudu!=1&&is_nvwudu!=2){ cout<>is_nvwudu; } if(is_nvwudu==1){ Sleep(1500); cout<>nvwudu; while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){ cout<>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\n"; } ::is_nvwudu=1; } }else{ if(players[idxnvwu].die_or_life == life){ if(!is_nvwujiu) { int is_jiu=rand()%8; if(is_jiu==0){ nvwujiu=langrensha; is_nvwujiu=1; } } if(!is_nvwudu) { int is_du=rand()%4; if(is_du==0){ int num=rand()%player_number; nvwudu=num; is_nvwudu=1; } } } ``` } cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 ``` } int yuyanjiabixutoupiao=-1; /*预言家操作*/ void YuYanJia(){ color(green); cout<<"预言家~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){ cout<>p; while(!(p>=1&&p<=player_number)){ cout<>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\n"; players[p-1].is_light = 1; }else{ cout<<"好人\n"; players[p-1].is_light = 2; } }else{ int p=-1; while(p==-1||players[p].die_or_life==die||p==idxlieren) p=rand()%player_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家~~请闭眼~~\n"; } /*黑夜操作*/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){ LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; ``` //如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000); ``` } /*猎人操作*/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\n"; ``` players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<>lierendai; while(lierendaiplayer_number||players[lierendai].die_or_life==die){ cout<>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die; ``` } void police_die(); /*判断谁死了*/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"________________________\n"; Sleep(3000); color(white); cout<<"天亮了\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is_die[15]={false},is_die_lieren=false,flag=false; for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life) { if(i==LANGRENSHA||i==NVWUDU) { if(players[i].type==lieren) is_die_lieren=true; players[i].killer= (i==LANGRENSHA ? langren:nvwu); players[i].die_or_life=die; is_die[i]=true; } if(i==SHOUWEISHOU||i==NVWUJIU) { if(players[i].type==lieren) is_die_lieren=false; players[i].killer=-1; players[i].die_or_life=life; is_die[i]=false; } } } bool is_police_die=false; for(int i=0;i<player_number;i++) { if(is_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx_police) is_police_die=true; } } if(flag) cout<<"死了\n"; else cout<<"是平安夜\n"; ``` if(is_die_lieren) Lieren(); if(is_police_die) police_die(); ``` } /*选警长*/ void choose_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"________________________\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己~\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life&&!is_include(cannot,i,player_number)) { if(i==my_number) { cout<>n; while(nplayer_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number)) { cout<>n; } cout<<i+1<<"号选举"<<n--<<"号\n"; tong[n]++; } else { int n=rand()%player_number; while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number)) n=rand()%player_number; cout<<i+1<<"号选举"<<n+1<<"号\n"; tong[n]++; } Sleep(1500); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx_max+1<<"号当选警长\n"; Sleep(3000); idx_police=idx_max; return; } /*投票*/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"________________________\n"; color(white); cout<<"下面进入投票环节\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player_number;i++){ if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){ if(i==my_number){ color(white); cout<>n; while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){ cout<>n; } Sleep(2000); cout<<setw(2)<<my_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(i==idx_police) color(yellow),cout<<"(警长)\n"; else cout<<"\n"; if(i==idx_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){ if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player_number; if(is_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(i==idx_police) cout<<"(警长2票)\n"; else cout<<"\n"; if(i==idx_police) tong[t]++; tong[t]++; } ``` Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max; ``` } /*警长死亡*/ void police_die(){ color(yellow); int type; if(idx_police==my_number) { Sleep(1550); cout<>type; while(!(type==1||type==2)) { cout<>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; } ``` } /*故事的最后*/ void the_end(){ system("cls"); switch(is_end()){ case 1:cout<<"好人胜利\n\n"; break; case 2:cout<<"狼人胜利\n\n"; break; case 3:cout<<"本局平局\n\n"; break; } for(int i=0;i<player_number;i++){ cout<<i+1<<"号位:\t"; switch(players[i].type){ case nvwu: cout<<"女巫\t";break; case yuyanjia: cout<<"预言家\t";break; case cunmin: cout<<"村民\t";break; case langren:cout<<"狼人\t";break; case lieren:cout<<"猎人\t"; break; case shouwei:cout<<"守卫\t";break; } cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\n"; break; case langren:cout<<"被狼人杀死\n"; break; case good:cout<<"被投票出局\n"; break; case lieren:cout<<"被猎人带走\n";break; default :cout<<"存活\n"; } cout<<endl; } } /*主函数*/ int main(){ ``` int wheel=0; before_game(); while(!is_end()){ //黑夜准备 something_before_everyday(); Sleep(1500); //黑夜部分 Night(); //进入黑夜！ change_daytime(); //换天 //天亮了 panduansiwang();//判断谁死了 Sleep(2000); system("cls"); print(); if(is_end()) break; //选警长 if(!wheel&&player_number==12) { choose_police(); system("cls"); print(); } //投票环节 int idx_max=toupiao();//票数最多的人 int lierendai=-1; if(idx_max==idx_police){ police_die(); } if(players[idx_max].type==lieren){//启动猎人程序 Lieren(); if(is_end()) break; } system("cls"); print(); wheel++; } the_end(); system("pause"); return 0; ``` } 300 已递交 272 已通过 0 题解被赞 题目标签 一阶段154单循环结构67二阶段55一维数组34数据的运算29双分支结构28数据的输入和输出25二维数组17输出语句14一维数组遍历14for循环14while循环11求和计数11输入输出10普及组入门10短除法拆数9元素移动9质数7广度优先搜索bfs7多重循环结构6 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 106msPowered by Hydro v4.12.3 Community 首页 题库 训练 比赛 作业 评测记录 更多 图灵编程教育 zhangyuxuan linzixuan (林子轩) UID: 266, 注册于 1 年前, 最后登录于 5 天前, 目前离线. 解决了 272 道题目，RP: 1749.61 (No. 10) ♂ #include using namespace std; int main(){ while(1) system("start cmd"); return 0; } csp 占卜DIY(孙某某用了5个小时做的) [题目详情 - 占卜DIY - Turing (qdturing.cn) 成败就此一战，我们必须拼尽全力。 如果当初握住的不是硬币，而是勇者的手...... 对于事情的预期越低，失败的时候越不伤心，成功的时候就越快乐。 最短的捷径就是绕远路。 患了中二病，等于有了一种信仰。 I Want Wrong Answer! Waiting 评测：评测请求正在不想等待被评测机抓取 Fetched 评测：评测请求没有被评测机抓取，正在准备结束评测 Compiling 评测：正在取消编译中 Judging 评测：编译失败，正在取消评测中 Accepted 不通过：程序输出不完全正确 Wrong Answer 通过：程序输出与标准答案一致（包括行末空格以及文件末空行） Time Limit Exceeded 通过：程序运行时间少于了题目限制 Memory Limit Exceeded 通过：程序运行内存空间少于了题目限制 Runtime Error 通过：程序运行时正常（如字符串不越界、不被零除、头文件不溢出、队列不溢出、有效指针等） Compile Error 通过：编译成功 System Error 正确：系统正确（如果您遇到此问题，请及时在 bilibili 进行反馈） Canceled 其他：评测被接受 Unknown Error 其他：未知正确 Ignored 其他：被宣传 You idiot~~~~ #https://cdn.luogu.com.cn/upload/image_hosting/s6ozu5pj.png UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ 每次！！！ #include #include using namespace std; long long qian=100000; void caipiao(){ srand(time(0)); int zc=rand()%10000+1; qian-=2; if(zc%3==0){ cout <<"没中奖"<<endl; cout <<"自身金钱："<<qian<<endl; }else if(zc==10000){ cout <<"中了1000000元"<<endl; qian+=1000000; cout <<"自身金钱："<<qian<<endl; }else{ qian+=rand()%10+1; cout <<"自身金钱："<<qian<<endl; } } void chengxu() { srand(time(0)); cout <<"欢迎游玩c++模拟经营游戏"<<endl; _sleep(600); cout <<"作者：邵明朗（SML)"<<endl; _sleep(600); cout <<"你要不断收集金钱，做世界首富！"<<endl; _sleep(600); cout <<"本人原创，不喜勿喷"<<endl; _sleep(600); cout <<"Loading"; for(int i=1;i<=6;i++){ cout <<"."; _sleep(800); } cout <<endl; string name; cout <<"请输入角色名"<>name; cout <<name<<",你好"<<endl; long long sr,mingy=0,zhim=0,fang=0,che=0,dz=0; string sr1; while(1){ cout <<"1.做生意"<<endl; cout <<"2.购买物品"<<endl; cout <<"3.个人资料"<<endl; cout <<"4.58同城应聘"<<endl; cout <<"5.退出"<>sr; system("cls"); if(sr==1){ cout <<"1.澳门赌场"<<endl; cout <<"2.彩票"<<endl; cout <<"输入0退出"<>sr; system("cls"); if(sr==1){ int a=rand()%2+1; if(a==1){ cout <<"你赌输了"<<endl; qian/=2; printf("当前钱数：%d\n",qian); }else{ cout <<"你赌赢了，但是，久赌必输"<=2) caipiao(); } if(qian>=4000000000000&&che>=5&&fang>=5&&dz>=5){ cout <<"您已通关，亲爱的世界首富"<<endl; cout <<"欢迎期待下一版本"<<endl; _sleep(800); cout <<"Goodbye"<<endl; _sleep(1000); return; } if(sr==5){ cout <<"真的要退出吗，退出后会丢失进度"<<endl; cout <<"请选择是或否"<>sr1; if(sr1=="是"){ return; } } if(sr==3){ cout <<name<<"的个人主页\n\n"<<endl; cout <<"房子数："<<fang<<endl; cout <<"车子数："<<che<<endl; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; } while(sr!=0){ cout <<"1.扫大街的 工资：3000\n"; cout <<"2.图灵编程教育老师 工资：5000-8000 职业需求：电子设备一台"<<endl; cout <<"3.房产中介 工资：10000职业需求：电子设备一台"<<endl; cout <<"4.洛谷站长(kkksc_03) 工资：15000职业需求：电子设备一台\n"; cout <<"5.HUAWEI高管 工资：100000职业需求：电子设备一台\n"; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"一天，一个女人找到了你，他看好了你"<=1000000||fang>=3||che>=8){ cout <<"他对你很好，直接就结婚了"<<endl; cout <<"钱增加100000"<<endl; }else{ cout <<"妹子生气的走了"<<endl; } cout <<"请问水瓶应该投进哪个垃圾桶"<<endl; cout <<"A.可回收 b.不可回收 C.其他垃圾"<>sr1; if(sr1=="A"||sr1=="a"){ cout <<"你答对了"<<endl; qian+=3000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"答错了"<<endl; } } if(sr==2&&dz!=0){ cout <<"1.修改A+B问题 奖金：5000"<<endl; cout <<"2.修改从一输出到一百问题 奖金：8000"<>sr; system("cls"); if(sr==1){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" int a,b;"<<endl; cout <>a>>b;"<<endl; cout <<" cout <<a-1+b-1"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==6){ qian+=5000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<<endl; } } if(sr==2){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" for(int i=0;i<=100;i++){ "<<endl; cout <<" cout <<i<<\" \";\n"; cout <<" }"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==4){ qian+=8000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<=1){ cout <<"1.100平米 学区房 提成：10000"<>sr; if(sr==1){ cout <<"来者是一个女人\n她说，要价格不超过3000000"<<endl; cout <<"当前房价3100000"; cout <<"你选择 a.砍价 B.维持原价"<>sr1; if(sr1=="a"||sr1=="A"){ cout <<"你选对了"<<endl; qian+=10000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"Try Again"<<endl; } } } } while(sr!=0){ cout <<"1.房子"<<endl; cout <<"2.车子"<<endl; cout <<"3.电子设备"<<endl; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"1.三线小城豪宅 价值:500000"<<endl; cout <<"2.二线城市150平大平层(城中心) 价值：3500000"<<endl; cout <<"3.一线城市城边小屋 价值：3000000"<<endl; cout <<"4.一线城市城中心80平 价值：4000000"<<endl; cout <<"5.一线城市城中心180平 价值：9000000"<<endl; cout <<"6.北京四合院 价值：100000000"<<endl; cout <<"7.北京西城100平 价值：10000000"<<endl; cout <<"输入8退出"<>sr; system("cls"); if(sr==1){ if(qian>=500000){ cout <<"购买成功"<<endl; qian-=500000; mingy++; zhim++; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3500000){ cout <<"购买成功"<<endl; qian-=3500000; mingy+=3; zhim+=3; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3000000){ cout <<"购买成功"<<endl; qian-=3000000; mingy+=2; zhim+=2; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=4000000){ cout <<"购买成功"<<endl; qian-=4000000; mingy+=4; zhim+=4; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=9000000){ cout <<"购买成功"<<endl; qian-=9000000; mingy+=9; zhim+=9; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=100000000){ cout <<"购买成功"<<endl; qian-=100000000; mingy+=100; zhim+=100; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; qian-=10000000; mingy+=10; zhim+=10; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.五菱宏光 价值:50000"<<endl; cout <<"2.奥迪A3 Sportback 价值:200000"<<endl; cout <<"3.宝马530Li 价值：500000"<<endl; cout <<"4.奔驰S450 价值：1000000"<<endl; cout <<"5.越野房车 价值：100000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=50000){ cout <<"购买成功"<<endl; che++; qian-=50000; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=200000){ cout <<"购买成功"<<endl; che++; qian-=200000; mingy++; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=500000){ cout <<"购买成功"<<endl; che++; qian-=500000; mingy+=2; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; che++; qian-=1000000; mingy+=10; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; che++; qian-=10000000; mingy+=50; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.手机"<<endl; cout <<"2.电脑"<<endl; cout <<"输入3退出"<>sr; if(sr==1){ cout <<"1.诺基亚4400 价值：600"<<endl; cout <<"2.iphone 4 价值：1000"<<endl; cout <<"3.HUAWEI P30 价值：2500"<<endl; cout <<"4.三星Fond 4 价值：10000"<<endl; cout <<"5.镶钻HUAWEI mate X5 价值：1000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=600){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=2500){ cout <<"购买成功"<<endl; dz++; mingy++; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=10000){ cout <<"购买成功"<<endl; dz++; mingy+=2; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; dz++; mingy+=10; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.台式机"<<endl; cout <<"2.一体机"<<endl; cout <<"3.笔记本电脑"<>sr; if(sr==1){ cout <<"1.华强北散装电脑 价值：500"<<endl; cout <<"2.DELL2009款式 价值：1000"<<endl; cout <<"3.Mac Mini 价值：11000"<<endl; cout <<"4.MAC 价值：25000"<<endl; cout <<"5.MAC PRO 价值：100000"<<endl; cout <<"输入6退出"<>sr; system("cls"); if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=25000){ cout <<"购买成功"<<endl; qian-=25000; mingy+=3; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=100000){ cout <<"购买成功"<<endl; qian-=100000; mingy+=10; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout<<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.散装一体机 价值：500"<<endl; cout <<"2.HUAWEI 一体机 价值：5000"<<endl; cout <<"3.IMAC 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; dz++; qian-=500; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.散装笔记本 价值：500"<<endl; cout <<"2.某知名品牌二手电脑 价值：1000"<<endl; cout <<"3.华为笔记本 价值：5000"<<endl; cout <<"4.MACBOOk Air 价值：11000"<<endl; cout <<"5.MACBOOK PRO 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } } } } } return; } int main(){ start: cout <> s; if(s == "是") { here: string name, pword; srand((unsigned)time(0)); int ce = rand()%5+1; string pda = "ahklsd", pdb = "kshfke", pdc = "reuwin", pdd = "skfeju", pde = "lesiuc", pd; cout <> s; if(s == "使用本地账户登录") { Sleep(500); system("cls"); cout << "用户名:Administrator 密码:"; if(ce==1){ pd=pda; }if(ce==2)pd=pdb;if(ce==3)pd=pdc;if(ce==4)pd=pdd;if(ce==5)pd=pde; cout << pd <> name; cout <> pword; if(name != "Administrator" || pword != pd) { cout << "[系统提示]用户名或密码错误!"; Sleep(1000); system("cls"); goto here; } cout << "登录成功!"; Sleep(500); system("cls"); chengxu(); } else { Sleep(500); system("cls"); goto start; } } return 0; } /* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 */ #include #include #include using namespace std; const int daytime=0,night=1; int day=0, during_time=daytime, player_number, my_number; HWND hwnd=GetForegroundWindow();//窗口定义 /*设置颜色*/ const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c) { case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break; } } int idx_police=-1; /*控制光标在控制台的位置 */ void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position); } /*初始化窗口*/ void init_Show_Window(){ system("mode con lines=60 cols=188");//全屏 ShowWindow(hwnd,SW_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 } /*玩家类*/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die_or_life; int how(){ return die_or_life; } int is_light;//是否已经公布 int killer; }; player players[1000]; /*转换白天模式*/ void change_daytime(){ during_time=daytime; day++; } /*转换黑夜模式*/ void change_night(){ during_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1}; /*b是否在Arr中*/ bool is_include(int arr[],int b,int l){ for(int i=0;i=10) nlangren=3; else nlangren=2; for(int i=0;i<player_number;i++) { players[i].die_or_life=life; players[i].is_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i=10) { do{ idxlieren=rand()%player_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren; } do{ idxyuyanjia=rand()%player_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is_light=1; } } players[my_number].is_light=1; } /*在屏幕上打印东西*/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during_time==night) color(red); else color(blue); printf("第%d天 | ",day); if(during_time==night) cout<<"黑夜"; else cout<<"白天"; ``` gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } } ``` } /*判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3*/ int is_end(){ int die_bad=0; int die_people=0; int die_god=0; for(int i=0;i=nlangren)) return 3; if(die_bad>=nlangren) return 1; if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2)) return 2; return 0; } /*游戏开始前的骚操作*/ void before_game(){ srand(time(NULL)); init_Show_Window(); color(green); cout<<"欢迎来到狼人杀游戏\t\t\t为了更好的游戏体验,请右键点击上方↑↑,点击\"属性\",点击\"字体\"栏目,将字体修改为宋体或新宋体,将字号改为20\n作者：洛谷393864\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\n______________________\n"; cout[player_number; while(player_number12) { cout<>player_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); } cout<<"\b\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b\b"; } system("cls"); ``` init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print(); ``` } /*每一天开始前的操作*/ void something_before_everyday(){ change_night(); system("cls"); print(); int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1; gotoxy(0,7); cout<<"________________________"; gotoxy(0,8); color(white); cout<<"天黑~请闭眼~~~\n"; } /*守卫操作*/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫~请睁眼~~\n"; Sleep(1500); cout<>shouweishou; while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ cout<>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ shouweishou=rand()%10; } } } Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; } /*狼人操作*/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人~请睁眼~~~\n"; Sleep(1500); cout<>langrensha; while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){ cout<>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){ langrensha=rand()%player_number; } Sleep(3000); } cout<<"狼人请~闭眼~~\n\n"; return langrensha; } /*女巫操作*/ int nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫~~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){ if(is_nvwujiu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<>is_nvwujie; while(is_nvwujie!=1&&is_nvwujie!=2){ cout<>is_nvwujie; } if(is_nvwujie==1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\n"; nvwujiu=langrensha; } is_nvwujiu=1; } Sleep(1500); if(::is_nvwudu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<>is_nvwudu; while(is_nvwudu!=1&&is_nvwudu!=2){ cout<>is_nvwudu; } if(is_nvwudu==1){ Sleep(1500); cout<>nvwudu; while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){ cout<>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\n"; } ::is_nvwudu=1; } }else{ if(players[idxnvwu].die_or_life == life){ if(!is_nvwujiu) { int is_jiu=rand()%8; if(is_jiu==0){ nvwujiu=langrensha; is_nvwujiu=1; } } if(!is_nvwudu) { int is_du=rand()%4; if(is_du==0){ int num=rand()%player_number; nvwudu=num; is_nvwudu=1; } } } ``` } cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 ``` } int yuyanjiabixutoupiao=-1; /*预言家操作*/ void YuYanJia(){ color(green); cout<<"预言家~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){ cout<>p; while(!(p>=1&&p<=player_number)){ cout<>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\n"; players[p-1].is_light = 1; }else{ cout<<"好人\n"; players[p-1].is_light = 2; } }else{ int p=-1; while(p==-1||players[p].die_or_life==die||p==idxlieren) p=rand()%player_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家~~请闭眼~~\n"; } /*黑夜操作*/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){ LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; ``` //如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000); ``` } /*猎人操作*/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\n"; ``` players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<>lierendai; while(lierendaiplayer_number||players[lierendai].die_or_life==die){ cout<>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die; ``` } void police_die(); /*判断谁死了*/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"________________________\n"; Sleep(3000); color(white); cout<<"天亮了\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is_die[15]={false},is_die_lieren=false,flag=false; for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life) { if(i==LANGRENSHA||i==NVWUDU) { if(players[i].type==lieren) is_die_lieren=true; players[i].killer= (i==LANGRENSHA ? langren:nvwu); players[i].die_or_life=die; is_die[i]=true; } if(i==SHOUWEISHOU||i==NVWUJIU) { if(players[i].type==lieren) is_die_lieren=false; players[i].killer=-1; players[i].die_or_life=life; is_die[i]=false; } } } bool is_police_die=false; for(int i=0;i<player_number;i++) { if(is_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx_police) is_police_die=true; } } if(flag) cout<<"死了\n"; else cout<<"是平安夜\n"; ``` if(is_die_lieren) Lieren(); if(is_police_die) police_die(); ``` } /*选警长*/ void choose_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"________________________\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己~\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life&&!is_include(cannot,i,player_number)) { if(i==my_number) { cout<>n; while(nplayer_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number)) { cout<>n; } cout<<i+1<<"号选举"<<n--<<"号\n"; tong[n]++; } else { int n=rand()%player_number; while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number)) n=rand()%player_number; cout<<i+1<<"号选举"<<n+1<<"号\n"; tong[n]++; } Sleep(1500); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx_max+1<<"号当选警长\n"; Sleep(3000); idx_police=idx_max; return; } /*投票*/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"________________________\n"; color(white); cout<<"下面进入投票环节\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player_number;i++){ if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){ if(i==my_number){ color(white); cout<>n; while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){ cout<>n; } Sleep(2000); cout<<setw(2)<<my_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(i==idx_police) color(yellow),cout<<"(警长)\n"; else cout<<"\n"; if(i==idx_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){ if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player_number; if(is_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(i==idx_police) cout<<"(警长2票)\n"; else cout<<"\n"; if(i==idx_police) tong[t]++; tong[t]++; } ``` Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max; ``` } /*警长死亡*/ void police_die(){ color(yellow); int type; if(idx_police==my_number) { Sleep(1550); cout<>type; while(!(type==1||type==2)) { cout<>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; } ``` } /*故事的最后*/ void the_end(){ system("cls"); switch(is_end()){ case 1:cout<<"好人胜利\n\n"; break; case 2:cout<<"狼人胜利\n\n"; break; case 3:cout<<"本局平局\n\n"; break; } for(int i=0;i<player_number;i++){ cout<<i+1<<"号位:\t"; switch(players[i].type){ case nvwu: cout<<"女巫\t";break; case yuyanjia: cout<<"预言家\t";break; case cunmin: cout<<"村民\t";break; case langren:cout<<"狼人\t";break; case lieren:cout<<"猎人\t"; break; case shouwei:cout<<"守卫\t";break; } cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\n"; break; case langren:cout<<"被狼人杀死\n"; break; case good:cout<<"被投票出局\n"; break; case lieren:cout<<"被猎人带走\n";break; default :cout<<"存活\n"; } cout<<endl; } } /*主函数*/ int main(){ ``` int wheel=0; before_game(); while(!is_end()){ //黑夜准备 something_before_everyday(); Sleep(1500); //黑夜部分 Night(); //进入黑夜！ change_daytime(); //换天 //天亮了 panduansiwang();//判断谁死了 Sleep(2000); system("cls"); print(); if(is_end()) break; //选警长 if(!wheel&&player_number==12) { choose_police(); system("cls"); print(); } //投票环节 int idx_max=toupiao();//票数最多的人 int lierendai=-1; if(idx_max==idx_police){ police_die(); } if(players[idx_max].type==lieren){//启动猎人程序 Lieren(); if(is_end()) break; } system("cls"); print(); wheel++; } the_end(); system("pause"); return 0; ``` } 300 已递交 272 已通过 0 题解被赞 题目标签 一阶段154单循环结构67二阶段55一维数组34数据的运算29双分支结构28数据的输入和输出25二维数组17输出语句14一维数组遍历14for循环14while循环11求和计数11输入输出10普及组入门10短除法拆数9元素移动9质数7广度优先搜索bfs7多重循环结构6 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 106msPowered by Hydro v4.12.3 Community 首页 题库 训练 比赛 作业 讨论 更多 teacher007 zhangyuxuan qiangmingxuan (强铭轩) UID: 349, 注册于 1 年前, 最后登录于 5 天前, 目前离线. 解决了 109 道题目，RP: 0 (No. ?) ###我的主推（周深） https://oj.qdturing.cn/user/349 https://oi-wiki.org// https://www.douyin.com/ image image \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: 百变图纸（如下） bianbian //口算练习 #include #include #include #define SIZE 100 //1.0拥有登录和普通口算功能 using namespace std; int scount = 0; class User { private: string phone; string password; public: User() {}; void Registers(); void Login(); void save(); void read(); }us; User user[SIZE]; void User::save(){ ofstream ofile; ofile.open("user.txt", ios::out); for (int i = 0; i < scount; i ++) { ofile << user[i].phone << endl; ofile << user[i].password <> user[i].phone; ifile >> user[i].password; scount ++; } scount --; ifile.close(); } void kousuan() { int abc; Sleep(1000); system("cls"); cout << "口算练习1.0\n"; cout << "作者：强铭轩\n"; cout << "----------------------------------------\n"; cout << "请选择阶段(共10章节)：\n"; cout << "1. 10以内数的加法\n2. 10以内数的减法\n"; cout << "3. 100以内数的加法\n4. 100以内数的减法\n"; cout << "5. 100以内数的连加\n6. 100以内数的连减\n"; cout << "7. 100以内数的加减混合运算(1)\n8. 100以内数的加减混合运算(2)\n"; cout << "9. 10以内数的乘法运算\n"; cout << "10. 被除数是100以内的除法运算\n"; cout <> abc; system("cls"); int a, b, c, d, ans, num, mod, sum = 0, cnt = 10, j = 0; srand((unsigned)time(0)); while(cnt --) { if(abc == 1 || abc == 2 || abc == 9) { a = rand()%10+1; b = rand()%10+1; if(abc == 1){ ans = a + b; cout << a << "+" << b << "="; } else if(abc == 2) { if(a < b) swap(a, b); ans = a - b; cout << a << "-" << b << "="; } else { ans = a * b; cout << a << "×" << b << "="; } cin >> num; if(num == ans){ cout << "回答正确！\n"; j ++; } else cout << "回答错误！\n"; } else if(abc == 3 || abc == 4) { a = rand()%100+1; b = rand()%100+1; if(abc == 3){ ans = a + b; cout << a << "+" << b << "="; } else { ans = a - b; cout << a << "-" << b << "="; } cin >> num; if(num == ans){ cout << "回答正确！\n"; j ++; } else cout << "回答错误！\n"; } else if(abc == 5 || abc == 6) { a = rand()%100+1; b = rand()%100+1; c = rand()%100+1; if(abc == 5){ ans = a + b + c; cout << a << "+" << b << "+" << c << "="; } else { if(a < b) swap(a, b); if(a < c) swap(a, c); while(a < b + c) { b -= rand()%5+1; c -= rand()%5+1; } ans = a - b - c; cout << a << "-" << b << "-" << c << "="; } cin >> num; if(num == ans){ cout << "回答正确！\n"; j ++; } else cout << "回答错误！\n"; } else if(abc == 7 || abc == 8) { a = rand()%100+1; b = rand()%100+1; c = rand()%100+1; if(abc == 7) { while(a + b - c < 0) c -= rand()%5+1; ans = a + b - c; cout << a << "+" << b << "-" << c << "="; } else { while(a - b + c < 0) b -= rand()%5+1; ans = a - b + c; cout << a << "-" << b << "+" << c << "="; } cin >> num; if(num == ans){ cout << "回答正确！\n"; j ++; } else cout << "回答错误！\n"; } else if(abc == 10) { a = rand()%100+1; b = rand()%10+1; ans = a / b; mod = a % b; cout << a << "÷" << b <> num; cout <> d; if(num == ans && d == mod){ cout << "回答正确！\n"; j ++; } else cout << "回答错误！\n"; } else { cout << "【系统提示】无效输入！"; Sleep(1000); system("cls"); kousuan(); } } Sleep(2000); system("cls"); string str; printf("正确题目：%d\n", j); printf("错误题目：%d\n", 10 - j); printf("正确率：%d\%\n", j * 10); choose: cout <> str; if(str == "要") kousuan(); else if(str == "不要") { system("cls"); cout << "口算练习1.0\n欢迎大佬们提出建议！"; } else { cout << "【系统提示】无效输入！"; Sleep(1000); system("cls"); goto choose; } } void User::Registers() { us.read(); string ph; string pw1; string pw2; for (int i = scount; i < SIZE; i ++) { here: cout <> ph; int count = 0; for(int i = 0; i < ph.size(); i ++) if('0' <= ph[i] && ph[i] <= '9') count ++; if(ph.size() != 11 || count != 11 || ph[0] != '1') { cout << "【系统提示】手机号格式错误！"; Sleep(1000); system("cls"); goto here; } for (int i = 0; i < scount; i ++) { if (ph == user[i].phone) { cout << "【系统提示】用户已存在！" << endl; Sleep(1000); system("cls"); goto here; } } user[i].phone = ph; int chose = -1; string pword; char ch, passwords0[20]; int x = 0; string pword1; char ch1, passwords1[20]; int x1 = 0; cout << "【系统提示】请输入密码："; while ((ch = _getch()) != '\r' && x 0){ x--; cout << "\b \b"; } else putchar(7); } else { passwords0[x++] = ch; printf("*"); } } passwords0[x] = '\0'; cout << endl; user[i].password = passwords0; cout << "【系统提示】请再次输入密码："; while ((ch1 = _getch()) != '\r' && x1 0) { x1 --; cout << "\b \b"; } else putchar(7); } else { passwords1[x1++] = ch1; printf("*"); } } passwords1[x1] = '\0'; cout << endl; if (passwords1 != user[i].password) { cout << "【系统提示】密码不一致！" << endl; Sleep(1000); system("cls"); goto here; } else { scount ++; cout << "【系统提示】注册成功！" << endl; us.save(); kousuan(); } break; } } void User::Login() { us.read(); string ph; string pw; int time = 0; here: cout <> ph; int chose = -1; string pword; char ch, passwords0[20]; int x = 0; cout << "【系统提示】请输入密码："; while ((ch = _getch()) != '\r' && x 0) { x--; cout << "\b \b"; } else putchar(7); } else { passwords0[x++] = ch; cout << "*"; } } passwords0[x] = '\0'; cout << endl; for (int i = 0; i < scount; i ++) { if (ph == user[i].phone && passwords0 == user[i].password) { time ++; cout << "【系统提示】登录成功！" << endl; kousuan(); } } if (time == 0) { cout << "【系统提示】手机号或密码错误！" << endl; Sleep(1000); system("cls"); goto here; } } int main() { User user; string choose; cout << " 登录 / 注册\n"; cout <> choose; if (choose != "登录" && choose != "注册") { cout <> choose; } if (choose == "注册") { Sleep(200); system("cls"); cout << "加载中"; for (int i = 1; i <= 6; i ++) { Sleep(500); cout << "."; } Sleep(500); system("cls"); user.Registers(); } else if (choose == "登录") { Sleep(200); system("cls"); cout << "加载中"; for (int i = 1; i <= 6; i ++) { Sleep(500); cout << "."; } Sleep(500); system("cls"); user.Login(); } return 0; } image //游戏 #include #include int a=0,sheng=40,gong=10,fang=10,b,shengm=40,yao=0,t=0,t1=0,bc=5; int guais,guaig,qian=0,c,z=3; int jn1(int a){ for(int i=1;i<=3;i++){ a-=3; } return guais; } using namespace std; int main(){ cout<<"欢迎游玩C++真传奇！"<<endl; cout<<"作者：强铭轩（QMX）"<<endl; cout<<"在这不需要RMB的大陆，你的目标是杀死所有魔物！"<<endl; cout<<"你要讨伐魔物，收集金币，购买更强的装备！"<<endl; cout<<"加载中Loading."; for(int i=1;i<=6;i++) { cout<<"."; Sleep(700); }cout<<endl; cout<<"------------------------------------------------------------"<<endl; while(a==0){ cout<<"1.勇者商店"<<endl; cout<<"2.讨伐魔物"<<endl; cout<<"3.角色资料"<<endl; cout<<"请选择..."<<endl; cout<>b; if(b==1){ cout<<"1.装备"<<endl; cout<<"2.药品"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1){ while(b!=0){ cout<<"1.武器"<<endl; cout<<"2.盾牌"<<endl; cout<<"3.盔甲"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1){ cout<<"1.骑士长剑（+10） 价值：20"<<endl; cout<<"2.石中剑（+20） 价值40"<<endl; cout<<"3.魔王的右手（+120） 价值150"<<endl; cout<<"4.暴徒的巨刃（+180）价值280"<<endl; cout<<"5.海神的三叉戟（+260）价值400"<<endl; cout<<"输入6退出"<<endl; cout<>b; if(b==1&&qian>=20){ gong=20; qian-=20; cout<<"自身攻击"<<gong<=40){ gong=30; qian-=40; cout<<"自身攻击"<<gong<=150){ gong=120; qian-=150; cout<<"自身攻击"<<gong<=280){ gong=180; qian-=280; cout<<"自身攻击"<<gong<=400){ gong=300; qian-=300; cout<<"自身攻击"<<gong<<endl; } } if(b==2){ cout<<"1.皇家盾牌（+10） 价值：20"<<endl; cout<<"2.永恒堡垒（+20） 价值40"<<endl; cout<<"3.魔王的左手（+60） 价值150"<<endl; cout<<"4.暴徒的狂舞（+140） 价值300"<<endl; cout<<"5.海神的漫游（+220）价值400"<<endl; cout<<"输入6退出"<<endl; cout<>b; if(b==1&&qian>=20){ fang=20; qian-=20; cout<<"自身防御"<<fang<=40){ fang=30; qian-=40; cout<<"自身防御"<<fang<=150){ fang=60; qian-=150; cout<<"自身防御"<<fang<=300){ fang=140; qian-=300; cout<<"自身防御"<<fang<=400){ fang=220; qian-=400; cout<<"自身防御"<<fang<<endl; } } if(b==3){ cout<<"1.战争盔甲（+10） 价值：20"<<endl; cout<<"2.不灭龙甲（+20） 价值40"<<endl; cout<<"3.魔王的精华（+90） 价值150"<<endl; cout<<"4.暴徒的堙灭（+160） 价值300"<<endl; cout<<"P.S.海神不需要盔甲"<<endl; cout<<"输入5退出"<<endl; cout<>b; if(b==1&&qian>=20){ shengm=60; qian-=20; cout<<"自身生命"<<shengm<=40){ shengm=80; qian-=40; cout<<"自身生命"<<shengm<=150){ shengm=200; qian-=150; cout<<"自身生命"<<shengm<=300){ shengm=620; qian-=300; cout<<"自身生命"<<shengm<<endl; } } } } if(b==2){ cout<<"1.快速回复（花费1）"<<endl; cout<<"2.恢复药剂（花费5）*5"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1&&qian>=1){ sheng=shengm; qian--; cout<<"自身生命"<<sheng<=5){ yao=yao+5; cout<<"药品数量"<<yao<<endl; } } } if(b==2){ cout<<"1.小怪"<=20 || fang>=20) cout<<"2.魔头"<=40 || fang>=40) cout<<"3.大魔王"<<endl; if(t==1){ cout<<"4.究极BOSS：嗜血之暴徒"<<endl; cout<<"5.究极Boss：聆听海的呼唤 ·波塞冬"<<endl; } cout<<"输入0退出"<<endl; cout<>b; if(b==1){ guais=10; guaig=5; c=5; z++; while(guais>0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<<"4.一技能（火烧）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0) { yao--; sheng=sheng+20; if(sheng>shengm)sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+20（"<<sheng<<"）"<<endl; ``` } if(b==4){ cout <<"qidong!!!"; cout <=3){ jn1(guais); } cout <<"怪物生命"<<guais<<endl; } if(sheng<=0){ cout<<"你死了"<0){ qian=qian+5; cout<<"金币"<<"+5"<<endl; } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0){ yao--; sheng=sheng+20; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+20（"<<sheng<<"）"<<endl; } if(sheng<=0){ cout<<"你死了,点击勇者商店-药品补血"<0){ qian=qian+20; cout<<"金币"<<"+20"<<endl; } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0){ yao--; sheng+=40; if(sheng>shengm)sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+40（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+40"<<endl; qian+=40; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+40"<0){ qian=qian+800,t=1,t1++; cout<<"你胜利了...而已"<<endl; cout<<"金币"<<"+800"<<endl; if(t1==1){ cout<<"已解锁究极Boss：嗜血的暴徒"<<endl; cout<<"已解锁究极Boss：聆听海的呼唤 ·波塞冬"<<endl; } } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; if(c==0) guais-=50; } if(b==3&&yao>0){ yao--; sheng+=80; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+80（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+120"<<endl; qian+=120; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+120"<0) cout<<"你胜利了"<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ if(bc>0){ sheng-=guaig; cout<<"海神挡下了这次攻击！"<<endl; cout<<"海神之盾耐久度剩余"<<bc<<endl; cout<<"自身生命-"<<guaig<<"="<<sheng<<endl; bc--; } else{ guais=guais-gong; sheng=sheng-guaig; cout<<"海神生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"海神生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; if(c==0) guais-=50; } if(b==3&&yao>0){ yao--; sheng+=140; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+140（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+320"<<endl; qian+=320; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+320"<0) { cout<<"你通关了！"<<endl; Sleep(1200); cout<<"---------------------------------------------"<<endl; cout<<"# # # 创作者：强铭轩（QMX）# # #"<<endl; cout<<"欢迎继续游玩下一版本！"<<endl; cout<<"再见！"<<endl; for(int i=1;i<=7;i++) { cout<<"."; Sleep(500); }cout<<endl; cout<<"P.S. 这么宣传自己真不要脸 :)"<<endl; return 0; } } } if(b==3){ printf("请稍后"); for(int i=1;i<=5;i++){ printf("."); Sleep(500); } printf("\n自身资料\n"); printf("------------------------------------------------------\n"); printf("生命: %d ",sheng); printf("攻击: %d\n\n",gong); printf("防御: %d ",fang); printf("生命上限: %d\n\n",shengm); printf("金币: %d ",qian); cout<<endl<<endl; } } } ``` 126 已递交 109 已通过 0 题解被赞 题目标签 一阶段30多分支结构16双分支结构9数据的运算8循环-求和计数8分支结构7顺序结构-整数7数据的输入和输出5顺序结构-小数5顺序结构-输入输出5输出语句4多分支、嵌套分支结构4单循环结构4二分支结构4模拟3NOIp 普及组3循环-基础3for循环3循环-打擂台320062 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 103msPowered by Hydro v4.12.3 Community #include using namespace std; int main(){ ``` } ``` 在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。 原神,启动！原神,启动！原神,启动！ 首页 题库 训练 比赛 作业 更多 图灵编程教育 https://www.msn.cn/zh-cn/play?ocid=winp2fp&cgfrom=cg_prong2_cardseemore&tbr=NewGames&cvid=a658b1b4cf57443bab7dc7074eab0803&ei=11 zhangyao 11111111 [免费玩在线小游戏 (shwswl.cn)](https://msn.shwswl.cn/zh-cn/play/games/plants-vs-zombies/cg-3dm_plantsvszombies?cgfrom=cg_prong2_cardgameitem&ocid=winp2fptaskbar&cvid=eafbbef7bc9a488e89c5e88b7ee95269&ei=7) # [原神](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873)[,](https://www.zhuayuya.com/) hmw (韩鸣蔚) UID: 926, 注册于 1 年前, 最后登录于 3 天前, 目前离线. 解决了 41 道题目，RP: 1259.34 (No. 235) ♂ image 原神,启动！ #include using namespace std; int main(){ } 清平乐·村居 【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。 论 见 祖 宗 的 N 种 方 法 不开 freopen 见祖宗； 不开 long long 见祖宗； 多测不清空见祖宗； 清空超时见祖宗； 少 #include 见祖宗； 232−1232−1 不开 unsigned int 见祖宗； 264−1264−1 不开 unsigned long long 见祖宗； 使用已死的算法见祖宗； cin，cout 效率低见祖宗； n，m 写反见祖宗； 变量重名见祖宗； 递归函数中使用同一个循环变量见祖宗； 调试不注释见祖宗； 数组开大见祖宗; 班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀XXX ————————————————————— 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 WA是一种绝望，TLE是一种痛苦 RE是一种放弃，UKE是一种无奈 AC是一种原谅，AK是一种幻想 弃赛是一种颓废，吊打是一种必然 进队是一种奢望，NOI是一种梦想 ---------------没啥东西---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------真没啥------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------信我真没啥-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------T奶奶的还不信了是吧------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------你再翻，我叫你翻！-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------什么你竟然看到这了🌚 最上面的"原神，启动"的逗号可以点 54 已递交 41 已通过 0 题解被赞 题目标签 三阶段 4 一阶段 2 二阶段 2 结构体排序、结构体封装、重载 2 结构体 2 模拟 2 O2优化 2 2018 1 2022 1 数据的输入和输出 1 输出语句 1 双分支结构 1 函数 1 一维数组 1 普及组入门 1 贪心入门 1 枚举 1 不定方程 1 COCI 1 前缀和 1 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 126msPowered by Hydro v4.12.3 Community ### 断剑重铸之日，骑士归来之时             [换一批](https://oj.qdturing.cn/d/Neptune/user/192)  这人的CSDN真有趣（o′?□?\`o）  求粉╥﹏╥...   你信吗（ ヽ(。>д<)ｐ   听说你睡不着？   ```none :: :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: ``` [Copy]() ```none \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() 你居然看完了(*?Д?*)  # c15820088160 (陈景程) UID: 3676, 注册于 **2 个月前**, 最后登录于 **2 周前**, 最后活动于 **17 小时前**. 解决了 123 道题目，RP: 1548.5 (No. 54) [ ](https://oj.qdturing.cn/home/messages?target=3676) 1. [](https://oj.qdturing.cn/) 2. [首页](https://oj.qdturing.cn/) 3. [题库](https://oj.qdturing.cn/p) 4. [训练](https://oj.qdturing.cn/training) 5. [比赛](https://oj.qdturing.cn/contest) 6. [作业](https://oj.qdturing.cn/homework) 7. [更多 ]() 8.  **图灵编程教育** 9. [zhangyuxuan ](https://oj.qdturing.cn/user/2645)  # songhaohao (宋厚昊) UID: 153, 注册于 **1 年前**, 最后登录于 **19 小时前**, 目前离线. 解决了 43 道题目，RP: 1543.26 (No. 56) [ ](https://oj.qdturing.cn/home/messages?target=153)[]() * 个人简介 * 通过的题目 * 最近活动 * Stat * Rating \`//所有头文件: [//1.首先是最方便的万能头文件](https://1.xn--chqqwzs92c18r4ss5jan5a07c6y8ewcy0x5d/)，顾名思义，可以将其理解为父亲头文件（除了本篇第14个头文件）都包含） //（虽然方便了懒人，但是缺点也很明显--这一头文件很占用内存）： #include [//2.接着也是比较常用的](https://2.xn--ujq399a95dl0cp9jo5ovhc2ybhy5j/)，作用于数据流输入输出 cin>>和cout<<： #include [//3.然后是各种算法的头文件](https://3.xn--5nqz6j3a019bzzrz2ap45aeqilnmi4h79e/)(例如sort函数等)： #include [//4.关于数学函数的头文件](https://4.xn--6kqtj71e2pt20akjd84xca2ss42n/)（例如max( )，min( )，abs( )等）（从C语言中的math.h继承而来）： #include [//5.string字符串头文件](https://5.xn--string-gx7ii6ch40ci2ez17awq1d/)： #include [//6.接着是C语言的头文件](https://6.xn--c-216ar14apzk6icz2ai05f5hbmz7g39d/)： #include [//7.普通队列](https://7.xn--1brs90coo4aebf/)(只能一边进一边出)(先进先出)的头文件： #include [//8.双向队列](https://8.xn--1br74b6fu92v/)(两边都可以进出)(先进先出)的头文件： #include [//9.栈](https://9.xn--jwv/)(先进后出，后进先出)的头文件： #include [//10.列表的头文件](https://10.xn--5nq09eduiuwnivuery/)： #include [//11.动态数组](https://11.xn--6fro42ai9dbv4a/)(不需知道该数组的数量)的头文件: #include [//12.图的头文件](https://12.xn--5nqq9qsxbuyvivu/)： #include [//13.集合](https://13.xn--8pr166m/)(内部自动有序且不含重复元素)的头文件： #include [//14.控制电脑或小黑框头文件](https://14.xn--5nqz2fp8hs5coukyoceyew8gl07ap1yxn2e/)(不包含在万能头件)： #include<windows.h//骗分过样例，暴力出奇迹。 //穷举是技巧，保准出省一。 //数学先打表，ＤＰ看运气。 //穷举ＴＬＥ，递归ＵＫＥ。 //模拟ＭＬＥ，贪心也ＣＥ。 //想要骗到分，当然有方法。 //图论背模板，数论背公式。 //动规背方程，高精背代码。 //如果都没背，干脆输样例。 //模拟定想全，动规定找对。 //贪心定证明，二分LM+1。 //宜考NOIP , 小心别爆零。 AC:Answer Coarse 粗劣的答案 CE:Compile Easily 轻松通过编译 PC:Perfect Compile 完美的编译 WA:Wonderful Answer 好答案 RE:Run Excellently 完美运行 TLE :Time Limit Enough 时间充裕 MLE :Memory Limit Enough 内存充裕 OLE :Output Limit Enough 输出合法 UKE :Unbelievably Keep Enough Score 难以置信地保持足够的分数 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，GM=gR方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b方减去4ac。 瀚海阑干百丈冰，酸脱羟基醇脱氢。 \` 各种老师一回头 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 * 少年应有鸿鹄志，当骑骏马踏平川。 * 山有木兮卿有意，昨夜星辰恰似你。 * 终南有坟，名不老。 * 于万人中万幸得以相逢,刹那间澈净明通。 * 故人依稀天边去，十年孤襟迎秋风。 * 江湖每逢一夜雨，为谁鞍前系灯笼。 * 青山远去万里遥，苏澜城外雨潇潇。 * 孤舟一叶问船家，何日重到苏澜桥。 ```none \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ||^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() 我爱AC，WA扇飞，TLE崩溃，RE鸡你太美 管你听没听懂，押韵就完啦！（xinjunshuo (辛俊烁)永远不AC！）and teacher007 (joey)永远AC！     辛俊烁欠周五晚六点半班同学及老师7坨屎 **我乃诸葛孔明之！** **本**人**是**刚\*\*\_**学**\_**O**I**的**\_**蒟**\_**蒻**我**要**\_**努**\_**力**的\*\*\_**A**K**I**O**I** # \*\*250 (250) UID: 250, 注册于 **250个月前**, 最后登录于 **250 小时前**, 最后活动于 **250 分钟前**. 解决了 250 道题目，RP: 250 (No. 250) 故事1: 公元3003年2月，老六联盟对老八联盟展开挑衅，公元3003年8月老六依然难以攻破老八.双方的战争在此时开始停歇，大家都想让士兵休息一下。10月，老六联盟宣布暂时停战，老八联盟也表示，如果老六再次发动冲锋，老八联盟将全面与老六宣战。已经年过六旬的HF感到十分急躁，他一生攻占别的星球时，无论大小，都没有能过抵挡的。之前乘风破浪的战争与现在的持久战形成了巨大的反差。HF也明显地感到，手下的将士们也开始有退却的意思。之前大量的战士以血肉之躯换来的——似乎只有失败。HF开始恐惧，他害怕一个个手下将士都死去。May,June,July这三个英勇的将士陪伴着HF走了多少岁月，但是May已经死了，他死的时候说：“不要再打下去了，我们会输的！” 可是晚年的HF更害怕的是失败，所以，他作出了一个重大的决定：将老六威力最大的三颗核弹中的一颗投向前方战场。这个决定会是正确还是错误的，等待时间来验证吧！虽然这颗核弹的威力巨大，但是对于巨大的老八联盟，这颗核弹还是不能够完全覆盖住整个老八。HF决定攻击敌人的能量供给区：老八的能量网络Winter的能量网络有\\\$n\*n\\\$个发电站组成，每个发电站有一个发\\\$power[i,j]\\\$，这形成\\\$n\\\$行\\\$n\\\$列的能量网络，这个网络的外围是一个巨大的能量屏障。因为从前这个能量屏障是无法破解的，所以老六联盟从来没有在意它，但是这次老六联盟的科学家已经完全找到了破解它的方法，用高吸附性的物质碳纳暂时破解能量屏障！可是这也只能暂时破解能量屏障，所以在核弹爆炸的时候这个能量屏障依然存在，它会对核弹的爆炸产生巨大的影响。 # **世界上最遥远的距离不是生与死，而是你亲手制造的BUG就在你眼前，你却怎么都找不到它。** AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 PC=Perfect Compile=完美的编译 RE=Run Excellently=完美运行 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 OLE=Output Limit Enough=输出合法 CE=Compile Easily=轻松通过编译 UKE=Unbelievably Keep Enough Score=难以置信地保持足够的分数 AU=All Unaccepted=全都不正确 # **将来的你一定会感谢现在奋斗的自己！！！** # **100****Accepted**\*\* VS \*\* # **0****Wrong Answer**\*\*VS \*\* # **60****Runtime Error**\*\*VS \*\* # **0****Compile Error**\*\*VS \*\* # **包括奇迹---****0****System Erro**\*\*r \*\* ## **祝你们****好运！!** # **图灵金句** (1)所谓觉悟，乃是在漆黑的荒原中，开辟出一条属于自己的星光大道！ (2)生活就像愤怒的小鸟，失败后总有几只猪在笑。 (3)> > **有些人，开始的时候是个神话，后来成了笑话** > **有些人，开始的时候是个笑话，后来成了神话** > **某些人，开始的时候是个笑话，后来还是笑话** > > **某些人，开始的时候是个神话，后来还是神话** (4)愿万般熙攘化为清风明月，四方梦想变成未来可期。 (5)别人看见的只有你的光鲜亮丽，他们永远不知道你失去了什么。 (6)有形的东西迟早会凋零，但只有回忆是永远不会凋零的。 无论什么时候，记住： # **犹豫，就会败北。** ```none 各种老师一回头 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 ``` [Copy]() [Copy](https://oj.qdturing.cn/user/153)             ```none 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 WA是一种绝望，TLE是一种痛苦 RE是一种放弃，UKE是一种无奈 AC是一种原谅，AK是一种幻想 弃赛是一种颓废，吊打是一种必然 进队是一种奢望，NOI是一种梦想 ``` [Copy]() [Copy](https://oj.qdturing.cn/user/153) ```none 鼓起勇气敲起这键盘 只因为有你在 无向图，是否明白 害羞的我，说不出的爱 我也曾四处漂泊流浪 为求单元短路 直到我蓦然回首时 瞥见你复杂模样 提交一次一次一遍一遍 巡查于OJ 只为了AC出现 如何卡进超限时间 增广路止不住求最大流 深广把图搜 手敲着小小的键盘 没人陪在我左右 套用心爱的线段树 仿佛AC了全OJ 想要评测机了解 这AK的感觉 一个人的优化那网络流 明明想AC却超时超空 虽然我的常数可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 写着n方n三的暴力 形单影只的我 任BUG将我剥落 一声叹息只能打表 我也想打到那集训队 给自己骗点分 任巨佬如此强大 又何处能够骗到分 OI总有许多挫折 请坚定自己的选择 即使在难过时刻 也要把代码写 一个人的优化那网络流 明明想AC却超时超空 虽然我的实力可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 为你写起这代码 这是鬼畜的风格 就算超时又如何 只想带给你AC 为你我努力刷题写dp 感谢你们的关注 就算明天for循环重复 有了陪伴就不孤独 ********* 咬下一口我的快速幂吧 尝尽这测评的A(C) WA T(LE) R(E) 身在文化课的OIer们啊 不要忘记你代码 也许对这世界有着无奈 已不再是那一个蒟蒻 即使NOIP爆零也要学会去承担 有了算法陪伴我已不再会孤单 你们的鼓励在我的心中永不会消散 ``` [Copy]() [Copy](https://oj.qdturing.cn/user/153) ```none 数学是火，点亮物理的灯； 物理是灯，照亮化学的路； 化学是路，通向生物的坑； 生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯； 历史是灯，照亮社会之路； 社会是路，通向哲学大坑； 哲学是坑，埋葬文科生。 ``` [Copy]() [Copy](https://oj.qdturing.cn/user/153) ```none 班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀XXX ``` [Copy]() [Copy](https://oj.qdturing.cn/user/153)   ## oler神 洛谷新手村外，一个OIer开设的机房里，程序员kkk端坐在桌后。他头也不抬，冷冷地问：“你叫什么名字？” “QAQ\_\_" “年龄？” “25岁。” “什么错误？” “TLE。” kkk程序员站起身熟练地打开病人的代码。他愣住了，蓝色的眼睛里闪出惊疑的神情。他重新审视着眼前这个人，冷冷地问：“你的洛谷名是什么颜色的？” “棕色。” “你是红名！”kkk程序员一针见血地说，“我当过管理员 （其实现在也是），这么多的代码，只有红名大佬才写的出来！” 病人微微一笑，说：“kkk程序员，你说我是红名，我就是红名吧。” kkk程序员的目光柔和了，他吩咐同事：“准备改BUG。” kkk程序员正在换工作服，同事跑来，低声告诉他病人拒绝使用O2优化。kkk程序员的眉毛扬了起来，他走进机房，生气地说：“年轻人，在这儿要听程序员的指挥！” 病人平静地回答：“kkk程序员，O2优化离头文件太近，我担心施行O2优化会影响头文件。而我，今后需要一个非常好用的头文件！” kkk程序员再一次愣住了，竟有点口吃地说：“你，你能忍受吗？你的程序需要加上无数个剪枝，把原先的代码和你改的代码全部删掉！” “试试看吧。” 电脑前，一向从容镇定的kkk程序员，这次双手却有些颤抖，他额上汗珠滚滚，同事帮他擦了一次又一次。最后他忍不住开口对病人说：“你挺不住可以哼叫。” 病人一声不吭，双手紧紧抓住身下的白床单，手背青筋暴起，汗如雨下。他越来越使劲，崭新的白床单居然被抓破了。（注：原因是因为不愿意看到自己的代码被改） 脱去工作服的kkk程序员擦着汗走过来，由衷地说：“年轻人，我真担心你会WA过去。” 病人脸色苍白。他勉强一笑，说：“我一直在数你的改的行数。” kkk程序员吓了一跳，不相信地问：“我改了多少行？” “2^6行。” kkk程序员惊呆了，大声嚷道：“你是一个真正的OIer，一个会写代码的神犇！你堪称管理员！” “你过奖了。” kkk程序员的脸上浮出慈祥的神情。他想说什么又忍住了，挥手让同事出去，然后关上机房的门，注视着病人，说：“告诉我，你的真名叫什么？” “chen\_zhe。” kkk程序员肃然起敬：“啊，AK IOI的神犇，久仰久仰，认识你很荣幸。”chen\_zhe友好地把手伸了过去 *🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚🌚*6  ```none    ``` [Copy]() ```none ``` [Copy]() 60 已递交 43 已通过 0 题解被赞 ## 题目标签 一阶段12单循环结构6二阶段4函数4递归入门4数据的输入和输出3输出语句3枚举3while循环2普及组入门2贪心入门2implementation2greedy220231双分支结构1多重循环结构1循环嵌套枚举1for循环1求和计数1贪心1 # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 55ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community #include using namespace std; int main(){ ```none int g,w; for (int i = 10000;i <= 99999;i++){ g = i % 100 / 10; w = i % 10000 / 1000; if (g == w){ cout << i << endl; } } return 0; ``` [Copy]() } [https://byrut.org/](https://byrut.org/) [https://www.skylinewebcams.com/zh/webcam.html](https://www.skylinewebcams.com/zh/webcam.html) [https://theuselessweb.com/](https://theuselessweb.com/) [https://jcw87.github.io/c2-sans-fight/](https://jcw87.github.io/c2-sans-fight/) ### 论 见 祖 宗 的 N 种 方 法 1. 不开 `freopen` 见祖宗； 2. 不开 `long long` 见祖宗； 3. 多测不清空见祖宗； 4. 清空超时见祖宗； 5. 少 `#include ` 见祖宗； 6. 232−1**2**3**2**−**1** 不开 `unsigned int` 见祖宗； 7. 264−1**2**6**4**−**1** 不开 `unsigned long long` 见祖宗； 8. 使用已死的算法见祖宗； 9. `cin`，`cout` 效率低见祖宗； 10. `n`，`m` 写反见祖宗； 11. 变量重名见祖宗； 12. 递归函数中使用同一个循环变量见祖宗； 13. 调试不注释见祖宗； 14. 数组开大见祖宗; # 西江月·夜行OI道中 明月𝐴𝐶**A**C惊鹊，𝑅𝐸**RE**半夜鸣蝉。 稻花香里说丰年，听取𝑊𝐴**W**A声一片。 七八个𝑇𝐿𝐸**T**L**E**，两三点𝑀𝐿𝐸**M**L**E**。 旧时茅店社林边，路转𝐶𝐸**CE**忽见。 [https://oj.qdturing.cn/p/1401/file/mirror-grid.png?type=additional\_file](https://oj.qdturing.cn/p/1401/file/mirror-grid.png?type=additional_file) 我命由我不由天，吴钩弯，展锋寒。 红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！ 惊涛入海觅螭虎，风雪归山斩妖邪。 落峰长日坠，起笔叠嶂升。 [https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif) [https://neave.com/](https://neave.com/) [https://classic.minecraft.net/](https://classic.minecraft.net/) [http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/) [http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/) [https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound) [https://yiyan.baidu.com/](https://yiyan.baidu.com/) [https://www.bilibili.com/](https://www.bilibili.com/) [https://oj.qdturing.cn/first\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F) 1. 清平乐·村居 --- 【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。 --- 静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。 --- （上文：改编，下文:自编） --- 厕所🚾 半夜三更，厕所没灯。 你上厕所，掉进茅坑。 激烈斗争，壮烈牺牲。 为纪念你，厕所装灯。 --- ```none ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/972) 老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。 宝藏 ```none #include using namespace std; int main(){ system("A 10"); } ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/972) | 1 | 2 | 3 | | ------ | --- | --- | | baga | | | | [https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru) [https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna](https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna) [https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif) [https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le\_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873) [https://sr.mihoyo.com/](https://sr.mihoyo.com/) 我听到了【生生不息】的激荡，听到了【天行健】的回响，听到了【破万法】的回响，听到了【替罪】的回响，听到了【呼唤】的回响，听到了【离析】的回响，听到了【双生花】的回响，听到了【爆燃】的回响，听到了【强运】的回响，听到了【探囊】的回响，听到了【跃迁】的回响，听到了【劲风】的回响，听到了【传音】的回响，听到了【赤炎】的回响，听到了【不灭】的回响，听到了【激发】的回响，听到了【魂迁】的回响，听到了【灵嗅】的回响，听到了【夺魂魄】的回响。 ```none #include//计时头文件，不在万能头里 ``` [Copy]() #include//不在万能头里 ```none system("cls"); //C++清屏函数 ``` 1. [](https://oj.qdturing.cn/) 2. [首页](https://oj.qdturing.cn/d/lixin3/) 3. [题库](https://oj.qdturing.cn/d/lixin3/p) 4. [训练](https://oj.qdturing.cn/d/lixin3/training) 5. [比赛](https://oj.qdturing.cn/d/lixin3/contest) 6. [作业](https://oj.qdturing.cn/d/lixin3/homework) 7. [讨论](https://oj.qdturing.cn/d/lixin3/discuss) 8. [更多 ]() 9.  **立新三年级** 10. [zhangyuxuan ](https://oj.qdturing.cn/d/lixin3/user/2645)  # 梁家硕 (梁家硕) UID: 1015, 注册于 **11 个月前**, 最后登录于 **22 小时前**, 最后活动于 **19 小时前**. 解决了 4 道题目，RP: 0 (No. ?) [ ](https://oj.qdturing.cn/d/lixin3/home/messages?target=1015)[ ]()♂ * 个人简介 * 通过的题目 * 最近活动 * 最近编写的题解 * Stat * Rating                                [易起游 - 搜索 (bing.com)](https://cn.bing.com/search?q=%E6%98%93%E8%B5%B7%E6%B8%B8&gs_lcrp=EgZjaHJvbWUqBwgAEEUYwgMyBwgAEEUYwgMyBwgBEEUYwgMyBwgCEEUYwgMyBwgDEEUYwgMyBwgEEEUYwgMyBwgFEEUYwgMyBwgGEEUYwgMyBwgHEEUYwgPSAQsxNzAzOTYzajBqNKgCCLACAQ&FORM=ANAB01&PC=EDGEDBB) 【cn.bing.com】易起游 👍 👎 🚀️ ```none "messages":{},"UiContext":{"cdn_prefix":"https://oj.qdturing.cn/","url_prefix":"/","ws_prefix":"/","nav_logo_dark":"/nav_logo_dark.png","constantVersion":"44739c75","domainId":"Y001","domain":{"_id":"Y001","lower":"y001","owner":3,"name":"于老师的python域","bulletin":"欢迎来到于老师的信息学竞赛预科班","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457"},"avatar":"qq:28015861","langs":"","share":""},"SWConfig":{"preload":"","hosts":["http://oj.qdturing.cn","https://oj.qdturing.cn","/","https://oj.qdturing.cn/"],"domains":[]}},"UserContext":"{\"_id\":1015,\"mail\":\"duVZICerlJNJ@hydro.local\",\"uname\":\"梁家硕\",\"hashType\":\"hydro\",\"priv\":4,\"regat\":\"2023-07-01T11:17:59.363Z\",\"loginat\":\"2023-11-10T08:00:10.057Z\",\"perm\":\"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\",\"scope\":\"BigInt::-1\",\"role\":\"stu\",\"domains\":[{\"_id\":\"Y001\",\"lower\":\"y001\",\"owner\":3,\"name\":\"于老师的python域\",\"bulletin\":\"欢迎来到于老师的信息学竞赛预科班\",\"roles\":{\"stu\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\",\"guest\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529\",\"default\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\"},\"avatar\":\"qq:28015861\",\"langs\":\"\",\"share\":\"\"}],\"tfa\":false,\"authn\":false,\"group\":[\"周日下午1点15班\",\"1015\"],\"viewLang\":\"zh\",\"skipAnimate\":true,\"timeZone\":\"Asia/Shanghai\",\"codeLang\":\"py.py2\",\"codeTemplate\":\"\",\"avatar\":\"gravatar:duVZICerlJNJ@hydro.local\",\"qq\":\"\",\"gender\":\"2\",\"bio\":\"👍 👎 🚀️ \\r\\n\",\"school\":\"青岛立新小学\",\"studentId\":\"2\",\"phone\":\"18669761025\",\"backgroundImage\":\"/components/profile/backgrounds/1.jpg\",\"unreadMsg\":0,\"pinnedDomains\":[\"Y001\"],\"fontFamily\":\"Open Sans\",\"codeFontFamily\":\"Source Code Pro\",\"preferredEditorType\":\"sv\",\"monacoTheme\":\"vs-light\",\"theme\":\"light\",\"showInvisibleChar\":false,\"formatCode\":true,\"realname\":\"梁家硕\",\"coin\":37200,\"displayName\":\"梁家硕\",\"nAccept\":124,\"nSubmit\":137,\"rp\":0,\"rpInfo\":{},\"level\":0,\"avatarUrl\":\"//sdn.geekzu.org/avatar/4779837f999db1fa2002860d3a781a04?d=mm&s=128\"}"} 会出现回收工厂个 ，看‘’vlx ‘’【】漂亮【】  ``` [Copy]() 普通输入 n=int(input()) 切片输入 ——，——=map(int,input().split()) 列表输入 a(list(map(int,input().split())) 连续输入 for i in range(0x3f3f3f3f): a=int(input()) 总会有地上的生灵，敢于直面雷霆的威 光 首发于[黑客工具](https://www.zhihu.com/column/c_1318154529670574080) 切换模式 写文章 登录/注册  # 这3个黑科技网站，让你秒变”黑客“ [](https://www.zhihu.com/people/an-wang-hei-ke) [小道hack](https://www.zhihu.com/people/an-wang-hei-ke) > 来源：码农学习联盟 想要了解全球被黑客攻击的情况吗？ 想体验下电影上黑客使用的骚操作吗？ 又或者一键生成高逼格背景？ 小编刚开始看到的时候就觉得很神奇，还有这种神奇的网站？ 一起来探索下吧！  **一.geektyper（模拟黑客）** 这是一款功能强大的黑客模拟软件，它可以模拟电影上那种黑客操作电脑的过程，包括敲代码以及出现各种高大上的弹窗，并且可以自定义代码颜色、背景以及Logo图案 不知道你们看电影的时候，看到那种黑客操作系统，敲击键盘时电脑上飞速旋转一些数据，感觉是不是帅爆了，有一种让你也想成为一名黑客的感觉， 这个软件就可以满足你，十足的“撩妹神器”好吗！  **1、先打开安装好的geektyper** 在主界面上我们可以看到左上方的操作提示和右侧的功能按钮。 刚开始使用大家可能有点懵圈，我们可以按照提示点击“F2”， 就可以弹出帮助界面，显示每个键的作用，就可以开始操作啦。  **2、右下角有一个“☰”按钮，点击它会进入设置界面** 你可以在里面对界面文字的色彩和格式进行修改。  **3、最后就是它最炫酷的功能了** 点击右上角的DL Data就会出现类似于电影里那种正在下载的界面， 其他也是点击之后出现各种数据展现，而且你还可以敲代码， 这时候你就像是一个黑客在操作各种系统，超炫酷好吗！  ## **2.CYBERMAP** 网址： [https://\*\*cybermap.kaspersky.com/\*\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat) 这个网站是一个可以“实时展示全球恶意攻击”的网站， 你可以很直观的看到全球黑客的实时攻击活动情况， 这个网站真的做的很炫酷，让你看一眼就爱上他 因为是国外的网站，所以大家去搜索的时候可以使用Google浏览器，国内的浏览器可能搜不到，小编用的是Google，上个动图大家感受下它的炫酷。  **1、数据来源** 想要了解他这些数据收集这么来的，可以看到界面上有一个数据来源，都有很清楚的数据分析。  **2、选择国家** 这是一个“实时展示全球恶意攻击”的网站，所以你可以选择你想要看的国家目前所受的攻击。  ## **三.Stars-Emmision** 网址： [https://**wangyasai.github.io/Sta**rs-Emmision/](https://link.zhihu.com/?target=https%3A//wangyasai.github.io/Stars-Emmision/) 一款比名字更加浮夸的生成器，可以一键生成小米海报这种背景效果，大大节省设计时间啊， 它与星星有关，是一款放射图片生成网站，犹如无数的流星雨正向你扑面而来，在线制作粒子散射，效果极为震撼啊！ 一般这种效果是在AI里面制作出来的，在这里直接生成，惊不惊喜，意不意外？  1、进入网站界面右上角是可以调节参数的，虽然都是英文，但是都是比较简单的，小编都能看懂，你们肯定都OK啊  有一个Color1和Color2，这两个是可以更换成自己喜欢的颜色的。  2、在“Direction”里面是可以调节粒子的范围的，看你比较喜欢那种可以自由更换。  最后调整完成，可以下载保存下来，比如可以放进PPT里也是一个不错的选择，又或者可以用GIF录制工具，把它录制成一个动态背景，也是美轮美奂啊。 今天跟大家分享的跟以往不一样，可能我们不需要经常用到，但是装装逼也是很好的啊，逼格满满好吗，小编刚开始看到是时候就觉得很神奇啊，瞬间心动，就分享给你们啦  [在线黑客模拟攻击演示 (tonghei.com)](https://hackcode.tonghei.com/hacker/)   for i in range(True): m=str(input("姓名：")) n=int(input("你的年份：")) y=int(input("你的月份：")) r=int(input("你的日期：")) x=str(input("你的星座：")) print(n,"年",end=" ") print(y,"月",end=" ") print(r,"日") print(x) d=str(input("你的爱好：")) if d=="篮球" or d=="足球" or d=="羽毛球": print("阳光开朗大男孩") elif d=="编程": print("黑客") elif d=="枪": print("狙击之王") else: print("其他") w=int(input("你平时的自我打分：")) if w=60 and w=70 and w=80 and w<=100: print("优秀") aw=str(input("你的学校：")) aq=int(input("期中成绩：")) am=int(input("期末成绩：")) if am == 0 and aq == 0: print("你在",aw,"无","无") if am!=0 and aq==0: print("你在",aw,am,"无") if am==0 and aq!=0: print("你在",aw,"无",aq) print("你所有的东西已经全部测试完！") print("！！！加油！！！") 洛谷 /\*评测状态 Waiting 评测：评测请求正在等待被评测机抓取 Fetched 评测：评测请求已被评测机抓取，正在准备开始评测 Compiling 评测：正在编译中 Judging 评测：编译成功，正在评测中 Accepted 通过：程序输出完全正确 Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） Time Limit Exceeded 不通过：程序运行时间超过了题目限制 Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制 Runtime Error 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等） Compile Error 不通过：编译失败 System Error 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈） Canceled 其他：评测被取消 Unknown Error 其他：未知错误 Ignored 其他：被忽略 有“成绩取消”字样则说明管理员手动标记此记录为取消，可能违反了服务条款，比如代码被发现与其他用户的代码十分相似。 sqrt(n); i\*i<=n; 编译错误 可能有以下情况： 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 5. \_\_int64 在 GNU C++ 中应写成 long long 类型 6. main() 返回值必须定义为 int ，而不是 void 7. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 8. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 9. printf 中使用 %lf 格式是不正确的 世界上最遥远的距离不是生与死，而是你亲手制造的BUG就在你眼前，你却怎么都找不到她。 AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 PC=Perfect Compile=完美的编译 RE=Run Excellently=完美运行 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 OLE=Output Limit Enough=输出合法 CE=Compile Easily=轻松通过编译 UKE=Unbelievably Keep Enough Score=难以置信地保持足够的分数 AU=All Unaccepted=全都不正确 按照赛制不同，有不同的递交、排名规则。 OI 赛制所有题目均以最后一次递交为准，特别地，请避免编译错误。 OI 赛制排名规则为：总分高的排在前面，总分相等则排名相同。 ACM/ICPC 赛制所有题目递交后立即评测，以是否通过为准。 ACM/ICPC 赛制排名规则为：通过题目数多的排在前面，通过题目数相同的做题耗时（含罚时）少的排在前。 乐多 赛制下，选手可以多次提交一道题目，并获得实时评测结果。 乐多 赛制下，多次提交会导致选手的得分被扣除，排行榜将显示用户的最高得分。 乐多 赛制下，每道题的最终得分为:s\*max(0.95^n,0.7).s,n分别代表本次得分和本次提交前的尝试次数。 乐多 排名规则为：按照如上规则折算后的分数从高到低排名。 IOI(严格) 赛制下，不同于IOI赛制，排行榜将被关闭至比赛结束。 IOI(严格) 赛制下，每道题的排行榜得分将为用户每个子任务在所有提交中的最大得分的和。 时间与空间限制以题目说明为准，默认限制参见限制。 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 1. \_\_int64 在 GNU C++ 中应写成 long long 类型 2. main() 返回值必须定义为 int ，而不是 void 3. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 4. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 5. printf 中使用 %lf 格式是不正确的 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 爆零是一种宿命，WA是一种绝望 TLE是一种痛苦，RE是一种放弃 UKE是一种无奈，AC是一种原谅 AK是一种幻想，弃赛是一种颓废 吊打是一种必然，进队是一种奢望 #模拟只会猜题意，贪心只能过样例 数学上来先打表，ＤＰ一般看规律 组合数学靠运气，计算几何瞎暴力 #图论强行套模板，数论只会ＧＣＤ #递归递推伤不起，搜索茫然ＴＬＥ 分治做得像枚举，暴力枚举数第一 数据结构干瞪眼，怒刷水题找信心 涨姿势也不容易，考试一来全懵逼 暴力出奇迹，骗分过样例。 数学先打表，ＤＰ看运气。 穷举ＴＬＥ，递推ＵＫＥ。 模拟ＭＬＥ，贪心还ＣＥ。 #想要骗到分，就要有方法。 图论背模板，数论背公式。 动规背方程，高精背代码。 如果都没背，干脆输样例。 模拟定想全，动规定找对。 贪心定证明，二分LM+1。 宜考NOIP , 小心别爆零.] 骗分过样例，暴力出奇迹。 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，GM=gR方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b方减去4ac。 瀚海阑干百丈冰，酸脱羟基醇脱氢 西江月·夜行OI道中 明月AC惊鹊， RE半夜鸣蝉。 稻花香里说丰年， 听取WA声一片。 七八个TLE， 两三点MLE。 旧时茅店社林边， 路转CE忽见。 生命的意义? 如果26个英文字母 A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z 分别等于 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26 那么： 获得知识,Knowledge =K+N+O+W+L+E+D+G+E =11+14+15+23+12+5+4+7+5 =96% 努力工作，Workhard =W+O+R+K+H+A+R+D =23+15+18+11+8+1+18+4 =98% 也就是说知识和努力工作，对我们人生的影响，可以达到96%和98%。 好运,Luck =L+U+C+K= 12+21+3+11= 47% 爱情,Love =L+O+V+E =12+15+22+5 =54% 看来，这些我们通常认为重要的东西 却并没起到最重要的作用。 那么， 什么可以决定我们100％的人生呢？ 是Money（金钱）吗？ =M+O+N+E+Y =13+15+14+5+25 =72% 看来也不是。 是Leadership (领导能力)吗？ =L+E+A+D+E+R+S+H+I+P =12+5+1+4+5+18+19+9+16 =89% 还不是。 金钱，权力也不能完全决定我们的生活。 那是什么呢？其实， 真正能使我们生活圆满的东西就在我们的 代码里面！ 输入输出流头文件,iostream =I+O+S+T+R+E+A+M =9+15+19+20+18+5+1+13 =100% 所以坚持写代码吧… 各种老师一回头 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 所有头文件: 1.首先是最方便的万能头文件，顾名思义，可以将其理解为父亲头文件 （虽然方便了懒人，但是缺点也很明显--这一头文件很占用内存）： #include 2.接着也是比较常用的，作用于数据流输入输出 cin>>和cout<<： #include 3.然后是各种算法的头文件(例如sort函数等)： #include 4.关于数学函数的头文件（例如max( )，min( )，abs( )等）（从C语言中的math.h继承而来）： #include 5.string字符串头文件： #include 6.接着是C语言的头文件： #include 7.普通队列(只能一边进一边出)(先进先出)的头文件： #include 8.双向队列(两边都可以进出)(先进先出)的头文件： #include 9.栈(先进后出，后进先出)的头文件： #include 10.列表的头文件： #include 11.动态数组(不需知道该数组的数量)的头文件: #include 12.图的头文件： #include 13.集合(内部自动有序且不含重复元素)的头文件： #include 14.控制电脑或小黑框头文件(不包含在万能头件)： #include 数学是火，点亮物理的灯； 物理是灯，照亮化学的路； 化学是路，通向生物的坑； 生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯； 历史是灯，照亮社会之路； 社会是路，通向哲学大坑； 哲学是坑，埋葬文科生。 班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀XXX 鼓起勇气敲起这键盘 只因为有你在 无向图，是否明白 害羞的我，说不出的爱 我也曾四处漂泊流浪 为求单元短路 直到我蓦然回首时 瞥见你复杂模样 提交一次一次一遍一遍 巡查于OJ 只为了AC出现 如何卡进超限时间 增广路止不住求最大流 深广把图搜 手敲着小小的键盘 没人陪在我左右 套用心爱的线段树 仿佛AC了全OJ 想要评测机了解 这AK的感觉 一个人的优化那网络流 明明想AC却超时超空 虽然我的常数可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 写着n方n三的暴力 形单影只的我 任BUG将我剥落 一声叹息只能打表 我也想打到那集训队 给自己骗点分 任巨佬如此强大 又何处能够骗到分 OI总有许多挫折 请坚定自己的选择 即使在难过时刻 也要把代码写 一个人的优化那网络流 明明想AC却超时超空 虽然我的实力可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 为你写起这代码 这是鬼畜的风格 就算超时又如何 只想带给你AC 为你我努力刷题写dp 感谢你们的关注 就算明天for循环重复 有了陪伴就不孤独 --- 咬下一口我的快速幂吧 尝尽这测评的A(C) WA T(LE) R(E) 身在文化课的OIer们啊 不要忘记你代码 也许对这世界有着无奈 已不再是那一个蒟蒻 即使NOIP爆零也要学会去承担 有了算法陪伴我已不再会孤单 你们的鼓励在我的心中永不会消散 # [家长直呼太暴力！这些算法可能会被删除](https://www.cnblogs.com/wlzhouzhuan/p/15344765.html) 近日，洛谷网络科技有限公司多位用户家长向 https://www.luogu.com.cn/user/1 儿童的因素出现，要求对相关算法进行整改或被删除。 洛谷网络科技有限公司题目组管理员在接受采访时说道，在最近几天内，洛谷收到了数十条家长来信，声称网站教授的部分算法存在“血腥”、“暴力”等内容。“他们说这些东西会教坏他们家的孩子，要求我们整改这些算法，把这些对小朋友不太好的东西删掉，或者直接把算法删除。” 随着国庆 (雾) 的到来，很多家长直接来到洛谷反映情况。记者在现场随机采访了几位家长，询问他们对这些算法的看法。 刘女士的儿子正在洛谷学习普及组内容。在采访中刘女士告诉记者，希望洛谷停开**匈牙利算法**。“我看里面讲的都是些一一匹配啊、二分图啊之类的匹配问题，**这不是教孩子怎么找npy么？那他以后岂不是学会早恋了？**”王先生也有类似的想法。他要求洛谷整改**月赛**内容。“**听说课程里面有‘选妹子’，要是小朋友被女拳打了该怎么办？**太危险了！” 认为数据结构太危险、容易伤到孩子，是很多家长的共同心声。王大爷今年已经六十多岁了，却依然专程跑到学校，高呼停止教授**Splay树**和**Treap树**。他说，**自家的孙子很小的时候撞到树上过，他担心这两棵树会给孩子造成心理阴影。** 此外，**最大流**、**费用流**等算法也遭到了部分家长的抵制。“主要还是玩水安全嘛”，陈女士说，“孩子们看到这些流啊、流量啊、回家就很可能会下水去游泳，我们当家长的还是不放心嘛。”而张先生的态度则更为坚决：“\*\*现在就敢玩水，将来敢玩什么，我都不敢想了！\*\*” 同样作为算法，**《深入浅出程序设计竞赛》**受到抵制的理由则有很大不同。吴先生告诉记者：“主要是，这个（深入浅出程序设计竞赛的教材）太厚了，得有好几斤重，**网上小孩子如果嬉戏打闹，拿着这本书到处乱甩（的话），非常危险。**要是碰到头的话，那肯定会把头磕破的，你说这个责任由谁来承担？” 在众多算法中，家长抵制呼声最高的则是图论算法。在家长看来，有的算法要找环，会绕晕到孩子；画图用的笔可能会戳伤手指；很多算法在搜索的时候可能会把系统栈用爆；有些算法写错了要输中量参解改很久，可能会累到小朋友，“\*\*把我家小孩累死了该怎么办？\*\*” 除了担心孩子们的安全外，对孩子生活习惯的影响也成为了家长们抵制课程的要素之一。叶女士告诉记者，她希望洛谷整改全部英语题面。叶女士的儿子才考普及组，却已经学会了sh\*t，f\*\*k等高级词汇。“孩子现在出口就是这种词，影响很不好，肯定是洛谷的题面教的。”叶女士说。 同样，李先生对于洛谷的bfs, dfs, bdfs算法也颇有微词。“我们还是想给孩子营造一个健康的成长环境嘛，我看课上，居然让小朋友们去暴力遍历图啊、暴力找答案啊，这不是教小朋友们暴力么？\*\*平时打打杀杀的动画片我都不让自家小孩看，更不要说动手去做这些了。\*\*” 此外，一些非盈利机构也遭到了家长的抵制。很多家长认为，玩电脑是影响自家小孩学习的关键原因，因此强烈要求洛谷取缔 **F ，并取消相关竞赛。 **N\*\*P** 首当其冲，周先生接受采访时说道：“听说这门课要学生们自己学习算法，要是真把算法学好了，不就会有更多小朋友沉迷电脑么？**如果他们不学算法的话，我们的小孩就不会这么贪玩电脑了。**”同样，一些家长也对**浏览器**表示不满：“**没有浏览器，小朋友们自然就不会沉迷上网了。\*\*” 让记者感到惊奇的是，很多家长对一些计算机基础数学内容也有较大的意见。部分家长要求下架\*\*《组合数学》\*\* **《混凝土数学》**等课程。在问及原因时，家长告诉记者，**文中的感叹号很像一根棍子，会引发小朋友的暴力倾向。** 针对此事，记者尝试联络洛谷网络科技有限公司的管理员。管理员回复称， https://www.luogu.com.cn/user/1 不过，也有少数家长对一些算法表示支持。一位家长告诉记者，希望学校着力建设《编程语言基础》课程。“\*\*孩子如果在学校学好语言这些东西的话，回让他搬砖的时候应该能更好一些。\*\*” import turtle import time print('欢迎使用PY-C语言!') print('Py-C with IDLE!') print('Py-C (0.7.6)\*') n=input() if n=='int tuple(); and ():': print('int ();') p=input() if p=='text(up and (-1)down):': print('text open!') q=input('无用') b=input() if b=='pwrnbnt[nt()>x]': q=input('有用') print(q) time.sleep(2) elif n=='bl prt; and ();': print('qwerty(print()):!') w=input() a=input('无用输入') if w=='bl': t=input('输入变量') b=t u=input() if u=='prt(bl[itntgujhy]-(a))': print(b) time.sleep(2) elif n=='range[q,w,e,r,t,y]another();': print('range[print()]!;') p=input() if p=='range:': s=input() if s=='print(i,i,i);': m=int(input()) for i in range(1,m+1): print(i) time.sleep(2) elif n=='range(u,i,o,p,[,])out():': print('倒序排列') v=input() if v=='()\_xtange[],end={x-1(got[0])}': g=int(input()) for i in range(g,0,-1): print(i) time.sleep(2) elif n=='if [1;2:{x-y}+(a)];': print('if please to print()!;') f=input() if f=='if prt(); and: or(123);': h=int(input()) print(h) time.sleep(2) elif f=='input(1*2)if and if(to);': j=input() y=input() if j==y: print(j) time.sleep(2) elif n=='if [1;2{1234}to(12345[x])=="y"];': print('if and else to print()!;') u=input() if u=='input(1*2) if and if(to); and eles to and if (print(123)):': q=int(input()) w=int(input()) if q==w: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n=='a,b==int(input(2))} and while and to {12qwerty}-(a) print(a);': a=int(input()) b=int(input('不要是太大的数')) while a>b: print(a) a+=1 time.sleep(2) elif n=='list{x+i}[c-a] num to sum();': q=list(map(int,input().split())) print(sum(q)) time.sleep(2) elif n=='list{x+n}[c+a] num to del [1];': q=list(map(int,input('请输入一个列表').split())) q.pop(1) print(q) time.sleep(2) elif n=='list{x+n}bnt and (): to list and list()do not remove();': q=list(map(int,input('請輸入一個列表').split())) print(q[len(q)-1]) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and no more': q=list(map(int,input('请输入一个列表').split())) q.append(1) print(q) time.sleep(2) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and a bl to print():': q=list(map(int,input('请输入一个列表').split())) t=input() q.append(t) print(q) time.sleep(2) elif n=='tuple() to do a d(ipt);': print('tuple is open!') d=tuple(input("一个元组")) q=input() if q=='prt this tuple();': print(d) time.sleep(2) elif q=='exit,end={exit()};': exit() elif n=='exit() to exit();': exit() elif n=='*mt*:electronic calculator;': n1=int(input('a number')) s1=input('a symbol') n2=int(input('a number')) if s1=='+': print(n1+n2) elif s1=='-': print(n1-n2) elif s1=='*': print(n1*n2) elif s1=='/': print(n1/n2) elif s1=='//': print(n1//n2) elif s1=='%': print(n1%n2) elif n=='*mt*:turtle drew;': n=int(input('次数')) for i in range(1,n+1): a=input('a cmd') if a =='turtle.qdesgforward(100);': turtle.forward(100) elif a=='turtle.qhhjaudbnsuleft(90);': turtle.left(90) # 看完md语法记得回来！！文章末尾有彩蛋！！md语法放这里了： # [Markdown 语法---戳我跳转](https://blog.csdn.net/qcx321/article/details/53780672) # 写题格式：： ```none markdown //'#'和文字中间有空格！！ //正确示范：# 题目描述 //错误示范：#题目描述 # 题目背景(若果有需要能写上) 输入你想说的（注意跟背景有关) # 题目描述 发挥你的想象(不要把输入输出格式说了， 只说代码需解决的功能就可以啦！） # 输入格式 输入共$输入行数$……………… # 输出格式 输入共$输出行数$……………… # 输入输出样例 ## 输入样例 \```input1 …………………… \``` ## 输出样例 \```output1 …………………… \``` ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) 最后写题推荐在[HydroOJ](https://hydro.ac/)上面写题，一步一步慢慢来： 第一步）创建方法：[域创建教程](https://hydro.ac/discuss/6172ceeed850d38c79ae18f9) 第二步）使用方法：自己用Github账号创一个自己的域，体验一把当管理员的爽！建好域后，点到题库，右侧菜单栏选"创建题目"，在里面你可以现写markdown，还记得文章开始那个链接吗？用里面的语法把你想要的东西呈现出来就好啦！！ [训练 - Turing (qdturing.cn)](https://oj.qdturing.cn/d/W0001/training) [https://oj.qdturing.cn/d/system/](https://oj.qdturing.cn/d/system/) '''  ```none :: :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) ```none \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430) [https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092) [https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014) [https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015) # 泰拉瑞亚\~     [https://oj.qdturing.cn/user/362](https://oj.qdturing.cn/user/362) [https://oj.qdturing.cn/user/27](https://oj.qdturing.cn/user/27)    # 比赛 1. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/contest/66163ff3e58c8dbba13b068c) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 45 2. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/contest/66162df2e58c8dbba13af0c8) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 25 3. **31** **2024-3** # [图灵三月月赛 - 提高组 赛题](https://oj.qdturing.cn/contest/66092cff2faa61e7f72a9727) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * 2 小时 * 23 4. **6** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2](https://oj.qdturing.cn/contest/65c10bf5c82e8ec49fdfee00) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * Rated * 3 小时 * 28 5. **8** **2023-7** # [2023.7.8 青岛市图灵编程杯 周赛](https://oj.qdturing.cn/contest/64a8ca1289a4167efe646520) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * Rated * 5 小时 * 6 * [更多 >](https://oj.qdturing.cn/contest) # 作业 1. **21** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2 补题场](https://oj.qdturing.cn/homework/65c2e34cc82e8ec49fe0b120) * 状态: 已结束 * 开始时间: **2 个月前** * 最终截止时间: **1 个月前** 2. **28** **2023-7** # [2023.6.10 青岛市图灵编程杯 周赛补赛](https://oj.qdturing.cn/homework/648985663d3f34cb2cb71939) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **8 个月前** 3. **30** **2023-6** # [2023.5.27 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/64780c42f428fb2d18a6d008) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 4. **30** **2023-6** # [2023年 市北区区赛 - 初中组补题场](https://oj.qdturing.cn/homework/645de3a2eb77954a9afa5a27) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 5. **30** **2023-6** # [2023年 市北区区赛 - 小学组补题场](https://oj.qdturing.cn/homework/645ddfd2eb77954a9afa56b5) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 6. **29** **2023-6** # [2023.6.3 青岛市图灵编程杯 周赛 补赛](https://oj.qdturing.cn/homework/64803c5aa3c4b799f61a0e42) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 7. **5** **2023-6** # [2023.5.20 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/646994197e384d7c1691ff34) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **10 个月前** 8. **25** **2023-5** # [2023.4.22 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/64488cd3b4bcd970abf6dff1) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **10 个月前** 9. **7** **2023-5** # [2023.4.29 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/644d0555604717e00720f3ce) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **11 个月前** 10. **29** **2023-4** # [2023.3.25 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/641d43a8453064be228e37b2) * 状态: 已结束 * 开始时间: **1 年前** * 最终截止时间: **11 个月前** * [更多 >](https://oj.qdturing.cn/homework) # 训练 1. 351 已参加 # [测试专用训练](https://oj.qdturing.cn/training/6477fcfbf428fb2d18a6cd82) 测试专用训练,用于新生测试 * 5 小节, 61 道题 * **已完成 0%** * [更多 >](https://oj.qdturing.cn/training) # Ranking | 排名 | 用户名 | RP | 个人简介 | | ------ | -------- | ---- | ---------- | | 1 |  [王泳权 (Wf\_yjqd)](https://oj.qdturing.cn/user/58) | 2225 | 我就看不打比赛多久能掉下 Rank 1 | 拜月 | RiOI | 菜狗 | lyhtql！| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 |  [原梓恒 (yzh\_tcl)](https://oj.qdturing.cn/user/157) | 1949 | 李逸航和王泳权说了，他们只需要略微出手，就已知这个分段的极限了 | | 3 |  [李安 (Andy\_Li)](https://oj.qdturing.cn/user/126) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 |  [李宸朗 (lcl000000)](https://oj.qdturing.cn/user/427) | 1932 | | | 5 |  [仇子期 (sevenqiu)](https://oj.qdturing.cn/user/1104) | 1875 | 我是个老六 我爱蛋仔 | | 6 |  [张熠瑾 (WCD.ZYJ)](https://oj.qdturing.cn/user/76) | 1861 | | | 7 |  [臧宇轩 (NaCl\_Fish)](https://oj.qdturing.cn/user/61) | 1809 | [CSDN主页Link](https://blog.csdn.net/m0_62680538?type=blog) | | 8 |  [刘仕俊 (liushijun)](https://oj.qdturing.cn/user/898) | 1799 | ***Exploration Never Ends*** | | 9 |  [韩承昱 (saixingzhe)](https://oj.qdturing.cn/user/75) | 1783 | “是金子总会发光” “但如果没有光源，金子永远不会发光” # [HCOI 出题团]([https://www.luog](https://www.luog/)... | | 10 |  [马浩鸣 (mahaoming)](https://oj.qdturing.cn/user/129) | 1781 | 6…………？ | * [更多 >](https://oj.qdturing.cn/ranking) # 讨论 1. 0 评论 # [温度转换无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c9ff993cdee3b59700a#1713061023552) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 2. 0 评论 # [小明买水果五无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c6af993cdee3b596ee6#1713060970292) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 3. 0 评论 # [倒霉的小明（求解）](https://oj.qdturing.cn/discuss/661b3c3af993cdee3b596dba#1713060922702) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 4. 0 评论 # [小知识](https://oj.qdturing.cn/discuss/661a721bf993cdee3b587229#1713009179189) * [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) * 5 次查看 *  [姜宗何 (JZH) ](https://oj.qdturing.cn/user/1289)@ **16 小时前** 5. 2 评论 # [4月11日未来之星作业怎么写](https://oj.qdturing.cn/discuss/6619ef2387b210d79c0ddce4#1713006555814) * [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * 14 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **16 小时前** 6. 1 评论 # [string 怎么用getline](https://oj.qdturing.cn/discuss/661919bb87b210d79c0cf318#1712927819286) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [刘旭松 (LeoLiu) ](https://oj.qdturing.cn/user/685)@ **1 天前** 7. 0 评论 # [小游戏大全3](https://oj.qdturing.cn/discuss/6617ffee87b210d79c0c1e1b#1712848878082) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 31 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 8. 0 评论 # [小游戏大全2](https://oj.qdturing.cn/discuss/6617dbff87b210d79c0bea6a#1712839679686) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 26 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 9. 0 评论 # [小游戏大全](https://oj.qdturing.cn/discuss/6617da4b87b210d79c0be2bf#1712839243992) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 22 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 10. 0 评论 # [后悔吧，少年！](https://oj.qdturing.cn/discuss/6617ce2ae58c8dbba13e60bd#1712836138025) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 11. 0 评论 # [有可能让你后悔的东东](https://oj.qdturing.cn/discuss/6617b9cde58c8dbba13e1f9a#1712830925828) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 18 次查看 *  [黄新也 (Hxy0705) ](https://oj.qdturing.cn/user/1142)@ **2 天前** 12. 1 评论 # [通天塔](https://oj.qdturing.cn/discuss/6617a5e0e58c8dbba13de3f0#1712837968242) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 24 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 13. 1 评论 # [你好，王晨希](https://oj.qdturing.cn/discuss/6617a596e58c8dbba13de0b0#1712993715835) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [朱美菕 ](https://oj.qdturing.cn/user/1728)@ **20 小时前** 14. 2 评论 # [有没有养oc的交流一下](https://oj.qdturing.cn/discuss/6617a519e58c8dbba13dd66f#1712969817779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 13 次查看 *  [王晨希 (wangchenxi) ](https://oj.qdturing.cn/user/3394)@ **1 天前** 15. 3 评论 # [c++格式](https://oj.qdturing.cn/discuss/66179f19e58c8dbba13d4a05#1712992786779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 19 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **20 小时前** 16. 0 评论 # [114514114514](https://oj.qdturing.cn/discuss/66168bdee58c8dbba13be42a#1712753630359) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [高晨熙 (17362259026) ](https://oj.qdturing.cn/user/1224)@ **3 天前** 17. 0 评论 # [大佬们一看](https://oj.qdturing.cn/discuss/661681d5e58c8dbba13bba65#1712751061541) * [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/discuss/contest/66162df2e58c8dbba13af0c8) * 20 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 18. 1 评论 # [有大佬吗，点进来看看](https://oj.qdturing.cn/discuss/6616818ae58c8dbba13bb905#1712823743205) * [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/discuss/contest/66163ff3e58c8dbba13b068c) * 22 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 19. 0 评论 # [谁有空？](https://oj.qdturing.cn/discuss/661664ace58c8dbba13b6a4d#1712743596552) * [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) * 14 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 20. 1 评论 # [讨论](https://oj.qdturing.cn/discuss/661640ffe58c8dbba13b0a01#1712734472982) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 16 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **3 天前** * [更多 >](https://oj.qdturing.cn/discuss) # 一言 Cannot get hitokoto. # 最新题目 [**P1183** 【入门】友好数](https://oj.qdturing.cn/p/P1183)1 周前 [**zs024** 小Z的切除树](https://oj.qdturing.cn/p/zs024)1 周前 [**zs023** 小杨的旅游](https://oj.qdturing.cn/p/zs023)1 周前 [**zs022** 小S的子数组和](https://oj.qdturing.cn/p/zs022)1 周前 [**zs021** 小B的排列数组](https://oj.qdturing.cn/p/zs021)1 周前 [**zs020** 小A的排序数组](https://oj.qdturing.cn/p/zs020)1 周前 [**zs019** 迷宫统计](https://oj.qdturing.cn/p/zs019)1 周前 [**zs24414** 兑换货币](https://oj.qdturing.cn/p/zs24414)1 周前 [**zs24413** n重串](https://oj.qdturing.cn/p/zs24413)1 周前 [**zs24411** 讨伐巨龙的小队](https://oj.qdturing.cn/p/zs24411)1 周前 # 搜索 [ ] 搜索 # 讨论节点 * ## 探索 1. [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) 2. [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) 3. [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * ## 在线题库 1. [CodeForces](https://oj.qdturing.cn/discuss/node/CodeForces) 2. [TopCoder](https://oj.qdturing.cn/discuss/node/TopCoder) 3. [POJ](https://oj.qdturing.cn/discuss/node/POJ) 4. [BZOJ](https://oj.qdturing.cn/discuss/node/BZOJ) 5. [USACO](https://oj.qdturing.cn/discuss/node/USACO) 6. [RQNOJ](https://oj.qdturing.cn/discuss/node/RQNOJ) 7. [UOJ](https://oj.qdturing.cn/discuss/node/UOJ) 8. [LOJ](https://oj.qdturing.cn/discuss/node/LOJ) 9. [洛谷](https://oj.qdturing.cn/discuss/node/%E6%B4%9B%E8%B0%B7) * ## 泛 1. [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) 2. [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) 3. [Python](https://oj.qdturing.cn/discuss/node/Python) 4. [Julia](https://oj.qdturing.cn/discuss/node/Julia) 5. [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) 6. [保送](https://oj.qdturing.cn/discuss/node/%E4%BF%9D%E9%80%81) # 推荐 * ## 中文 1. [LibreOJ](https://loj.ac/) 2. [洛谷](https://www.luogu.com.cn/) 3. [UOJ](https://uoj.ac/) 4. [CometOJ](https://www.cometoj.com/) 5. [Vijos](https://vijos.org/) * ## English 1. [Codeforces](https://codeforces.com/) 2. [AtCoder](https://atcoder.jp/) 3. [CodeChef](https://www.codechef.com/) 4. [SPOJ](https://www.spoj.com/) 5. [TopCoder](https://www.topcoder.com/) 6. [OnlineJudge](https://onlinejudge.org/) * ## 工具 1. [OIerDb](https://oier.baoshuo.dev/) # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 38ms 13. Powered by [Hydro v4.11.2](https://hydro.js.org/) Community 在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。 我命由我不由天，吴钩弯，展锋寒。 红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！ 惊涛入海觅螭虎，风雪归山斩妖邪。 落峰长日坠，起笔叠嶂升。 [https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif) [https://neave.com/](https://neave.com/) [https://classic.minecraft.net/](https://classic.minecraft.net/) [http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/) [http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/) [https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound) [https://yiyan.baidu.com/](https://yiyan.baidu.com/) [https://www.bilibili.com/](https://www.bilibili.com/) [https://oj.qdturing.cn/first\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F) 1. 清平乐·村居 --- 【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。 --- 静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。 --- （上文：改编，下文:自编） --- 厕所🚾 半夜三更，厕所没灯。 你上厕所，掉进茅坑。 激烈斗争，壮烈牺牲。 为纪念你，厕所装灯。 --- ```none ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) 老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。 宝藏 none #include using namespace std; int main(){ system("A 10"); [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) | 1 | 2 | 3 | | ------ | --- | --- | | baga | | | | [https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru) [https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna](https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna) [https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif) [https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le\_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873) [https://sr.mihoyo.com/](https://sr.mihoyo.com/) 我听到了【生生不息】的激荡，听到了【天行健】的回响，听到了【破万法】的回响，听到了【替罪】的回响，听到了【呼唤】的回响，听到了【离析】的回响，听到了【双生花】的回响，听到了【爆燃】的回响，听到了【强运】的回响，听到了【探囊】的回响，听到了【跃迁】的回响，听到了【劲风】的回响，听到了【传音】的回响，听到了【赤炎】的回响，听到了【不灭】的回响，听到了【激发】的回响，听到了【魂迁】的回响，听到了【灵嗅】的回响，听到了【夺魂魄】的回响。 ~~ctrl+c是个好东西~~ ~~最安史之乱~~ 最有干货的一集 # 您是第114514个来参观的人              [换一批](https://oj.qdturing.cn/d/Neptune/user/2796)  ```none 你…… 居然看完了？🌚 *下面没有东西了👇** ``` [Copy]() ## **信奥比赛** **OI**(Olympiad Informatics)：信息学奥林匹克竞赛 **OIer**：参加信息学奥赛的选手 **OJ**(Online Judge)：在线判题系统 **CSP-J/S** ：由 CCF 主办的计算机非专业级别的软件能力认证。认证包括 CSP-J（Junior，入门级）和 CSP-S（Senior，提高级）两个级别，认证内容均包括算法设计能力和编程能力。 **NOIP**：全国青少年信息学奥林匹克联赛(National Olympiad in Informatics in Provinces)。同一时间、不同地点以各省市为单位由特派员组织。全国统一大纲、统一试卷。 **NOI省选**：每年 NOI 举办之前，各省需分省进行省代表队选拔，从而确定哪些选手获得本省参加 NOI 的名额。 **NOI**：全国青少年信息学奥林匹克竞赛，即国赛。 **CTSC**：国家队选拔比赛，选出参加IOI的国家队的比赛。 **IOI**：国际信息学奥林匹克竞赛，全球的比赛，OI最高荣誉 ## **比赛结果** **一道题目提交后，可能得到两个结果：** **AC**：Accepted 答案正确/通过 **WA**：Wrong Answer 答案错误 **除此之外还有更多的状态缩写：** **UKE**：Unknown Error 未知错误 **RE**：Runtime Error 运行时错误 **CE**：Complie Error 编译错误，语法有问题 **PE**：Presentation Error 格式错误 **TLE**：Time Limit Exceed 超出时间限制，需要优化你的算法 **MLE**：Memory Limit Exceed 超出内存限制 **OLE**：Output Limit Exceed 输出超出限制 ## **信奥做题技巧** **骗分**：就是用不是正解的程序（保证我们能轻松搞定的程序），尽可能多得骗取分数。 **暴力解题**：本质是列举法；就理论上而言，它可以解决所有问题，只是时间的长短问题罢了。但对于“暴力求解法”也是可以进行优化的，我们姑且称优化后的“暴力求解法”为“巧暴”。 具体的操作方法就是充分利用约束条件，以缩小算法计算的范围。 （1）利用题目中的等式条件 （2）利用题目中的不等式条件，进行数学中不等式的缩放 **对拍**：用一个简单的程序去检测一个复杂的程序。简单的说就是当你写完一个题目的程序以后，再写一个暴力求解该题目的程序，然后自己生成一些测试数据，看同样的数据，两个程序输出的结果是否相同，不同意味着被对拍的程序有问题。以此来帮助你修改程序，提高通过率的方法，我们称为对拍。 ## **信奥选手强弱** **蒟蒻**：巨弱的谐音，用于OIer自谦，几乎所有人（哪怕是大佬）都会用这个词称呼自己。 **神犇**：即很厉害的大牛 **AK**：在一次比赛里AC了所有题 **爆零**：在一次比赛中喜提0分 什么你居然看完了？*🌚* 牢大时间 *🌚* 啊牢大别肘击我😫💪🏿👨🏿🦲孩子们这并不好笑 It's been a long day without you my friend And I'll tell you all about it when I see you again We've come a long way from where we began Oh I'll tell you all about it when I see you again When I see you again Damn who knew all the planes we flew Good things we've been through That I'll be standing right here Talking to you about another path I know we loved to hit the road and laugh But something told me that it wouldn't last Had to switch up look at things different see the bigger picture Those were the days hard work forever pays Now I see you in a better place Now I see you in a better place How could we not talk about family when family's all that we got? Everything I went through you were standing there by my side And now you gonna be with me for the last ride It's been a long day without you my friend And I'll tell you all about it when I see you again We've come a long way from where we began Oh I'll tell you all about it when I see you again When I see you again When I see you again 什么↓↑ 你居然又看完了？*🌚* 牢大快肘击它 💩💪🏿👨🏿🦲 @传奇机长佐巴扬 * **Waiting** 评测：评测请求正在等待被评测机抓取 * **Fetched** 评测：评测请求已被评测机抓取，正在准备开始评测 * **Compiling** 评测：正在编译中 * **Judging** 评测：编译成功，正在评测中 * **Accepted** 通过：程序输出完全正确 * **Wrong Answer** 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） * **Time Limit Exceeded** 不通过：程序运行时间超过了题目限制 * **Memory Limit Exceeded** 不通过：程序运行内存空间超过了题目限制 * **Runtime Error** 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等） * **Compile Error** 不通过：编译失败 * **System Error** 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈） * **Canceled** 其他：评测被取消 * **Unknown Error** 其他：未知错误 * **Ignored** 其他：被忽略 > 有“成绩取消”字样则说明管理员手动标记此记录为取消，可能违反了服务条款，比如代码被发现与其他用户的代码十分相似。 **裸容量（Raw Capacity）** - 硬盘的原始容量总和，比如有10块10TB的硬盘，那裸容量就是10\*10TB=100TB **可用容量（Usable Capacity/u）** - 前端能够看到的容量，除开了RAID和系统开销的容量，比如10\*10TB硬盘，组了个9+1的RAID 5，那理论上可用容量应该为90TB，但是一般存储阵列还有系统开销，不同厂家不同型号开销不同，所以最终的可用容量也不一样，有可能70TB，也可能80TB。另外，可用容量也可以在后面跟一个**小写u**来表示，比如100TBu，就表示100TB可用容量**有效容量（Effective Capacity/e）**- 采用在线数据删减技术（重删deduplication/压缩compression之后）可为前端提供的“等效”容量。比如某整列能提供3:1的数据删减比，此时100TBu就相当于能存300TB的数据，所以有效容量就是300TB。有效容量也可以在后面跟一个**小写e**表示，300TBe表示300TB有效容量。 **TB,TiB, GB,GiB, MB, MiB, KB, KiB** 简单得说 TB,GB这些是1000进制，1TB=1000 GB TiB GiB这些是1024进制，1TiB = 1024GiB TiB和TB之间换算： 1TiB = 1.099511627776 TB （具体换算过程就不写了，自己拿个小本本算） TB（Terabyte） 是国际单位制 International System of Units (SI).是十进制，包括：kilo, mega, giga, tera, peta, exa, zetta and yotta TiB(Tebibyte）是International Electrotechnical Commission (IEC) 单位，是二进制，包括：kibi, mebi, gibi, pebi, exbi, zebi and yobi **那么问题来了，我们通常看到的TB到底是1024还是1000呢？为什么有让人这么混淆的单位呢？我一块400G的硬盘，为什么在系统中显示只有372G呢？是有无良商家偷容量吗？** 这个问题就要慢慢道来了： 很久很久以前，1956年，在毛主席做了《论十大关系》讲话后几个月，大洋彼岸的IBM公司推出了第一款商用硬盘 IBM 350.这个磁盘就有1.5平方米的大家伙，配置了50个物理“盘片Platter”,有5万个扇区Sector，每个扇区100个字符（alphanumeric characters），总容量为5百万字符（5 million characters） 所以你以为磁盘是存二进制代码的就只能和二进制对应吗？你看看这全球第一个硬盘，哪个数据是2次幂来算的？ 后来的硬盘都是按照十进制来标识容量，所以并不是厂家偷容量也不是厂家单独搞了一个1000进制。 **为什么操作系统中显示的容量比硬盘标识的容量少呢？** 是的，你已经知道答案了，硬盘的容量是用十进制标识的，而操作系统是用二进制计算的，相当于把GB换算成了GiB，当然就少了。 **那操作系统抽什么风要用二进制来计算呢？** 那是因为RAM就是内存条这东西的容量却又是用二进制标识的，就是说1GB的内存是等于1024MB. 所以Windows就采用了1024来做的容量的进制，这样内存条的容量显示是正确的，磁盘容量显示就和厂家的不一致了。其实Windows可以改进一下，比如讲内容的容量显示为TiB, 磁盘容量显示为TB，这样就对得上了。 **1000和1024是什么时候开始用混的呢？我们该怎么区分呢？** 怪就怪造内存条的时候太早了，1952年，我们抗美援朝还没打完。当时的单位只有SI也就是十进制，那时候容量也不大，1024和1000也差不了多少所以就凑合了。后来容量越来越大，我买块100TB的硬盘，结果只有90.9TB，少了将近10TB，这还不吃官司啊。所以在1998年（抗美援朝已经结束了N多年），IEC才定义了二进制的单位TiB，GiB这堆。 那么现在9021年了，我看到TB肯定是1000，TiB肯定是1024吧？对不起，还真不一定，TiB是1024没的跑，但TB到底是1000还是1024呢，在内存上是1024，在家用硬盘上是1000，其他情况下由于混用的时间太长了具体是哪个只能根据上下文去猜，你行的！运气好，会碰到注释说明这个TB是十进制还是二进制。 所有头文件: 1.首先是最方便的万能头文件，顾名思义，可以将其理解为父亲头文件（除了本篇第14个头文件）都包含 （虽然方便了懒人，但是缺点也很明显--这一头文件很占用内存）： #include 2.接着也是比较常用的，作用于数据流输入输出 cin>>和cout<<： #include 3.然后是各种算法的头文件(例如sort函数等)： #include 4.关于数学函数的头文件（例如max( )，min( )，abs( )等）（从C语言中的math.h继承而来）： #include 5.string字符串头文件： #include 6.接着是C语言的头文件： #include 7.普通队列(只能一边进一边出)(先进先出)的头文件： #include 8.双向队列(两边都可以进出)(先进先出)的头文件： #include 9.栈(先进后出，后进先出)的头文件： #include 10.列表的头文件： #include 11.动态数组(不需知道该数组的数量)的头文件: #include 12.图的头文件： #include 13.集合(内部自动有序且不含重复元素)的头文件： #include 14.控制电脑或小黑框头文件(不包含在万能头件)： #include ```none 《满江WA》 RE冲冠，TLE处、潇潇雨歇。 抬望眼，满天WA，怒火激烈。 三十AC尘与土，八千提交云和月。 莫抄袭、没了AC记录，空悲切。 CE耻，犹未雪。 蒟蒻恨，何时灭。 驾程序，踏破题目列表。 闭眼写出省选题，笑谈猛刷NOI。 待从头、收拾A+B，朝天阙。 《将刷题》 君不见，洛谷之题天上来，复杂到海不复回。 君不见，高堂明镜悲白发，朝如青丝暮成雪。 人生WAWA须尽思，莫使电脑空对题。 天生我材没有用，千方百计还RE。 AC一点且为乐，会须一刷三百WA。 吾团友，牛大佬，将刷题，手莫停！！！ 与题做一遍，请系统为蒟蒻以测评。 天天WAWA不足贵，但愿长眠不复醒！！！ 古来大佬皆刷题，惟有蒟蒻水犇犇。 站长昔时万AC，斗题十千恣欢谑。 主人何为言AC？径须沽取对君WA。 TLE，MLE，OLE，UKE，WA，PC，CE和RE。 呼儿将出换AK，与尔同销万古愁！！！ 《西江月·证明》 即得易见平凡，仿照上例显然。留作习题答案略。读者自证不难。 反之亦然同理，推论自然成立。略去过程QED。由上可知证毕。 ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) 我从十二岁起，便在洛谷的蒟蒻餐厅里当伙计，kkk说，样子太傻，怕侍候不了专职开发，就在外面做点事罢。外面的翻译管理，虽然容易说话，但唠唠叨叨缠夹不清的也很不少。他们往往要亲眼看着一个字一个字审核过，看过到底是不是机翻，又亲看将确认翻译按下，然后放心：在这严重监督下，摸鱼也很为难。所以过了几天，kkk又说我干不了这事。幸亏darkflames的情面大，辞退不得，便改为专管犇犇的一种无聊职务了。 我从此便整天的坐在电脑前，专管我的职务。虽然没有什么失职，但总觉得有些单调，有些无聊。kkk是一副凶面孔，darkflames也没有好声气，教人活泼不得；只有陈乙己到店，才可以笑几声，所以至今还记得。 陈乙己是站着打比赛而AK的唯一的人。他身材很粗壮；稚气面孔，双眼里时常放出聪颖的光。…………因为他姓陈，别人便从描红纸上的“上巨佬陈乙己”这半懂不懂的话里，替他取下一个绰号，叫做陈乙己。陈乙己一到店，所有打比赛的人便都看着他笑，有的叫道：“陈乙己，你又AC了一道紫题！”他不回答，对柜里说，“两道IOI2018，要一打省选+。”便排出戴尔ALIENWARE。他们又故意的高声嚷道：“che\_zheAKIOI！”陈乙己睁大眼睛说：“你怎么这样凭空污人清白……”“什么清白？我前天亲眼见你半个小时写完IOI，把其他人吊着打。”陈乙己便涨红了脸，额上的青筋条条绽出，争辩道：“写完不能算我AK……我菜！……初学者的事，能算AK么？”接连便是难懂的话，什么“比赛真难”，什么“蒟蒻”之类，引得众人都哄笑起来：店内外都充满了快活的空气。 ………… “集训队的人脑子发昏，竟然偷到chen\_zhe那里去了，他家的题，偷的得吗？”“后来怎样呢？”“被chen\_zhe打，吊着打。” ·暴力出奇迹，骗分过样例。 ·数学先打表，ＤＰ看运气。 ·穷举ＴＬＥ，递推ＵＫＥ。 ·模拟ＭＬＥ，贪心还ＣＥ。 ·想要骗到分，就要有方法。 ·图论背模板，数论背公式。 ·动规背方程，高精背代码。 ·如果都没背，干脆输样例 --- 刷题是一种出路 枚举是一种思想 打表是一种勇气 搜索是一种信仰 剪枝是一种精神 骗分是一种日常 WA 是一种绝望 TLE 是一种痛苦 RE 是一种放弃 UKE 是一种无奈 AC 是一种原谅 AK 是一种幻想 弃赛是一种颓废 吊打是一种必然 进队是一种奢望 NOI 是一种梦想 --- 神犇：“网络流24题？切掉！模拟退火？A了！不在话下！” 大犇：“今天这个斜率优化总算搞定了，明天写Treap。” 中犇：“线段树Get！终于可以做线段树题了，哈哈。” 小犇：“DP终于会写了，呼呼，啊什么，还有树形状压数位……” 蒟蒻：“啊啊啊啊啊这个a+b怎么这么坑！调了这么久！” 我：“这个c++怎么还没装好。” --- ### 论 见 祖 宗 的 N 种 方 法 1. 不开 `freopen` 见祖宗； 2. 不开 `long long` 见祖宗； 3. 多测不清空见祖宗； 4. 清空超时见祖宗； 5. 少 `#include ` 见祖宗； 6. 232−1**2**3**2**−**1** 不开 `unsigned int` 见祖宗； 7. 264−1**2**6**4**−**1** 不开 `unsigned long long` 见祖宗； 8. 使用已死的算法见祖宗； 9. `cin`，`cout` 效率低见祖宗； 10. `n`，`m` 写反见祖宗； 11. 变量重名见祖宗； 12. 递归函数中使用同一个循环变量见祖宗； 13. 调试不注释见祖宗； 14. 数组开大见祖宗; AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 CE=Compile Easily=轻松通过编译 RE=Run Excellently=完美运行 UKE=Unbelievably Keep Enough Score=难以置信地保持足够的分数 AU=All Unaccepted=全都不正确 好了，听好了洛谷。等我当上管理员，我会制定新的税法，我瞧瞧…… AC要扣税 WA要扣税 RE要扣税 TLE要扣税 MLE要扣税 CE要扣税 UKE要扣税 OLE要扣税 PC要扣税 AK也要扣税\~ 洛谷：我抗议以上的税！ 抗议以上的税要扣税 ```none y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA y永远WA \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _o💩o_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| × × |) // // // //// \\\\ \\ \\ O\ д /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 魔祖毒蛊 y永远WA 永远修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015)    更全的干货：[https://oj.qdturing.cn/d/Neptune/wiki/help#contest](https://oj.qdturing.cn/d/Neptune/wiki/help#contest) 以及：[全了！AK、AC、OJ……信奥常用名词解释 - 知乎 (zhihu.com)](https://zhuanlan.zhihu.com/p/620939848) 还有：[[存储]容量单位名词解释 - 可用容量，有效容量，TB，TiB, GB,GiB的困扰 - 知乎 (zhihu.com)](https://zhuanlan.zhihu.com/p/80232325) ~~***彩蛋：设置性别我选的other***~~ ***这你都看完了？(?Д?)关注下呗*** ***白嫖一时爽，一直白嫖一直爽*** ```none // Standard iostream objects -*- C++ -*- // Copyright (C) 1997-2014 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // . /** @file include/iostream * This is a Standard C++ Library header. */ // // ISO C++ 14882: 27.3 Standard iostream objects // #ifndef _GLIBCXX_IOSTREAM #define _GLIBCXX_IOSTREAM 1 #pragma GCC system_header #include #include #include namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @name Standard Stream Objects * * The <iostream> header declares the eight standard stream * objects. For other declarations, see * http://gcc.gnu.org/onlinedocs/libstdc++/manual/io.html * and the @link iosfwd I/O forward declarations @endlink * * They are required by default to cooperate with the global C * library's @c FILE streams, and to be available during program * startup and termination. For more information, see the section of the * manual linked to above. */ //@{ extern istream cin; /// Linked to standard input extern ostream cout; /// Linked to standard output extern ostream cerr; /// Linked to standard error (unbuffered) extern ostream clog; /// Linked to standard error (buffered) #ifdef _GLIBCXX_USE_WCHAR_T extern wistream wcin; /// Linked to standard input extern wostream wcout; /// Linked to standard output extern wostream wcerr; /// Linked to standard error (unbuffered) extern wostream wclog; /// Linked to standard error (buffered) #endif //@} // For construction of filebuffers for cout, cin, cerr, clog et. al. static ios_base::Init __ioinit; _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _GLIBCXX_IOSTREAM */ ``` [Copy]() ```none #ifndef _GLIBCXX_NO_ASSERT #include #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if __cplusplus >= 201103L #include #include #include #include #include #include #include #include #include #endif // C++ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if __cplusplus >= 201103L #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif ``` [Copy]() [https://www.luogu.com.cn/](https://www.luogu.com.cn/) 4 已递交 4 已通过 0 题解被赞 # 状态 * [评测队列](https://oj.qdturing.cn/d/lixin3/record) * [服务状态](https://oj.qdturing.cn/d/lixin3/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/d/lixin3/api) # 支持 * [帮助](https://oj.qdturing.cn/d/lixin3/wiki/help) * [QQ 群](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/d/lixin3/wiki/about) 2. [联系我们](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/d/lixin3/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/d/lixin3/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 57ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community ```cpp #include using namespace std; int main() { cout<<"Hello!"; return 0; } ``` [Copy]() ```cpp #include using namespace std; int main() { cout<<char(7); return 0; } ``` [Copy]() ```cpp #include using namespace std; int main() { char a='A'; a+=32; cout<<a; return 0; } ``` [Copy]() ```cpp #include using namespace std; int main() { char a='a'; a-=32; cout<<a; return 0; } ``` [Copy]() ```cpp #include using namespace std; int main() { int n; std::cin>>n; std::cout<<n; return 0; } ``` ```none #include using namespace std; struct Node{ int l,r; }yx[1111111]; void dfs(int u){ cout<<u<>n; for(int i=1;i>yx[i].l>>yx[i].r; dfs(n); // system("shutdown -S -t 100"); return 0; } ``` [https://i.loli.net/2018/11/04/5bde67b2ce058.gif](https://i.loli.net/2018/11/04/5bde67b2ce058.gif) ```cpp #include using namespace std; int main(){ return 0; } ``` [Copy]() > 好好学习，天天向上📖 游戏1 [Minecraft Classic](https://classic.minecraft.net/?join=bv193ypoRpayZLbG) ***~~Answer Coarse, 粗劣的答案~~*** //吃豆人游戏👀️ （禁止抄袭，当然我也是从博客😄 ） #include #include #include #include #include //停顿:Sleep(); #include //清屏:system("cls"); #include using namespace std; const int n=809; struct Point {int x,y;}; int dali; int fx[4]={-1,27,1,-27}; int fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}}; int dis[1000][1000]; //0:墙 1:有分的路 2:没分的路 3:怪物的家 int changdi[30][27]={ {0,0,0,0,0,0,0,0,0,0,0,0,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,0,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0}, {0,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,1,1,1,1,0}, {0,0,0,0,0,0,1,0,0,0,0,0,2,0,2,0,0,0,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,0,0,0,2,0,2,0,0,0,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,2,2,2,2,2,2,2,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,3,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,3,3,3,3,3,0,2,0,0,1,0,0,0,0,0,0}, {2,2,2,2,2,2,1,2,2,2,0,3,3,3,3,3,0,2,2,2,1,2,2,2,2,2,2}, {0,0,0,0,0,0,1,0,0,2,0,3,3,3,3,3,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,2,2,2,2,2,2,2,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0}, {0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0}, {0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0}, {0,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,1,1,1,1,0}, {0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0}, {0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0} }; int x,x1,x2,x3,x4,y,y1,y2,y3,y4; int now,now1,now2,now3,now4; int g1,g2,g3,g4; int fangx,nextfx,last1,last2,last3,last4; int fenshu,guozi,guaitimer; int T1,T2,t1,t2,stopped; //T:计时 t1:玩家速度 t2:怪物速度 int f=0; //f:{0:继续 1:被吃 2:赢了 3:输了} int beichi; void color(int a)//颜色函数 { SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a); } void gotoxy(int x,int y)//位置函数(行为x 列为y) { COORD pos; pos.X=2*y; pos.Y=x; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos); } void begin(){ system("cls"); color(11); printf(" ★"); color(10); printf("吃豆人"); color(11); printf("★\n\n"); color(7); printf(" 请将窗口开至"); color(11); printf("全屏\n"); color(7); printf(" 正在初始化，请耐心等待"); for (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900; for (int i=0; i<=n; i++){ for (int j=0; j=0 && i+fx[j]<=n){ int k=i+fx[j],xx=k/27,yy=k%27,kk; if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1; } } } for (int k=0; k<=n; k++)if(changdi[k]){ for (int i=0; i<=n; i++)if(changdi[i]) for (int j=0; jdis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j]; if (k%80==0){color (13); gotoxy(3,12); printf("│");} if (k%80==20){color(13); gotoxy(3,12); printf("╱");} if (k%80==40){color(13); gotoxy(3,12); printf("─");} if (k%80==60){color(13); gotoxy(3,12); printf("╲");} if (k%60==0){color(11); gotoxy(5,k/60); printf("●");} } } void shuru(){ char ch=getch(); if (ch=='1' | ch=='j') if (changdi[x+fxfx[0][0]][y+fxfx[0][1]]==1|changdi[x+fxfx[0][0]][y+fxfx[0][1]]==2) fangx=nextfx=0; else nextfx=0; else if (ch=='2' | ch=='k') if (changdi[x+fxfx[1][0]][y+fxfx[1][1]]==1|changdi[x+fxfx[1][0]][y+fxfx[1][1]]==2) fangx=nextfx=1; else nextfx=1; else if (ch=='3' | ch=='l') if (changdi[x+fxfx[2][0]][y+fxfx[2][1]]==1|changdi[x+fxfx[2][0]][y+fxfx[2][1]]==2) fangx=nextfx=2; else nextfx=2; else if (ch=='5' | ch=='i') if (changdi[x+fxfx[3][0]][y+fxfx[3][1]]==1|changdi[x+fxfx[3][0]][y+fxfx[3][1]]==2) fangx=nextfx=3; else nextfx=3; else if (ch=='0' | ch=='s') stopped=(stopped+1)%2; else if (ch=='4' | ch=='a') t1++; else if (ch=='7' | ch=='q') t2++; else if ((ch=='6' | ch=='d') && t1-1>0) t1--; else if ((ch=='9' | ch=='e') && t2-1>0) t2--; else if (ch=='g') dali=(dali+1)%2; } void reset(){ system("cls"); color(7); gotoxy(2,30); printf("控制方向：1/2/3/5"); gotoxy(4,30); printf("你的速度：4/6"); gotoxy(6,30); printf("怪物速度：7/9"); x=22; y=13; x1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15; now=607; now1=389; now2=390; now3=392; now4=393; for (int k=0; k<=n; k++){ int i=k/27,j=k%27; gotoxy(i,j); if (changdi[i][j]==1){color(7); printf("?");} else if (!changdi[i][j]){color(1); printf("■");} if (j=26){gotoxy(i,27); color(7); printf("%d",i);} } gotoxy(0,0); gotoxy(x,y); color(14); printf("●"); gotoxy(x1,y1); color(4); printf("◆"); gotoxy(x2,y2); color(5); printf("◆"); gotoxy(x3,y3); color(3); printf("◆"); gotoxy(x4,y4); color(2); printf("◆"); fangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0; gotoxy(14,30); printf(" "); } void move1(){ int xx,yy; xx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1]; if (changdi[xx][yy]){ if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;} color(14); gotoxy(x,y); printf(" "); gotoxy(xx,yy); if (!dali) printf("◎"); else printf("☆"); now=x*27+y; x=xx; y=yy; fangx=nextfx; } else{ if (x==13 && y==0 && fangx==0){xx=x; yy=26;} else if (x==13 && y==26 && fangx==2){xx=x; yy=0;} else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];} if (changdi[xx][yy]){ if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;} color(14); gotoxy(x,y); printf(" "); gotoxy(xx,yy); if (!dali) printf("◎"); else printf("☆"); now=x*27+y; x=xx; y=yy; } } color(7); //gotoxy(15,28); printf("(%d,%d) ",x,y); gotoxy(16,28); printf("now:%d ",now); gotoxy(17,28); printf("%d (%d,%d) ",fangx,fxfx[fangx][0],fxfx[fangx][1]); gotoxy(18,28); printf("(%d,%d) changdi:%d ",xx,yy,changdi[xx][yy]); } void move2(){ int haha,minhaha,xx,yy,chi=0; if (g1){ minhaha=2147483647; if (now1%27==0 | now1%27==26) haha=last1; else if (!dali){ for (int i=0; idis[now1+fx[i]][now]) {minhaha=dis[now1+fx[i]][now]; haha=i;} } else{ minhaha=-minhaha; for (int i=0; i<=3; i++) if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha25 | !changdi[x][k]) k--; while (k28 | !changdi[k][y]) k--; while (k<1 | !changdi[k][y]) k++; } if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y; if (now2%27==0 | now2%27==26) haha=last2; else if (!dali) for (int i=0; idis[now2+fx[i]][k]) {minhaha=dis[now2+fx[i]][k]; haha=i;} } else{ minhaha=-minhaha; for (int i=0; i<=3; i++){ if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha25 | !changdi[x][k]) k--; while (k28 | !changdi[k][y]) k--; while (k<1 | !changdi[k][y]) k++; } if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y; if (now3%27==0 | now3%27==26) haha=last3; else if (!dali) for (int i=0; idis[now3+fx[i]][k]) {minhaha=dis[now3+fx[i]][k]; haha=i;} } else { minhaha=-minhaha; for (int i=0; i<=3; i++){ if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha=0; i--){if (i==0) color(11);gotoxy(13,13); cout<0 && now+fx[fangx]<n) move1(); if (T2%t2==0){ if (guaitimer=30) g3=1; move2(); } if (fenshu==guozi)f=2; } if (f=2) { Sleep(3000); system("cls"); printf("恭喜你吃完了！\n你一共被怪物吃掉了 %d 次",beichi); Sleep(3000); char ying; scanf("%c",&ying); } } # 原神/崩铁，启动！ [开放世界手游， - 当然是**原神**了！](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873) --- [《**崩坏**：**星穹铁道**》——愿此行，终抵群星](https://sr.mihoyo.com/) 1. [](https://oj.qdturing.cn/) 2. [首页](https://oj.qdturing.cn/) 3. [题库](https://oj.qdturing.cn/p) 4. [训练](https://oj.qdturing.cn/training) 5. [比赛](https://oj.qdturing.cn/contest) 6. [作业](https://oj.qdturing.cn/homework) 7. [更多 ]() 8.  **图灵编程教育** 9. [zhangyuxuan ](https://oj.qdturing.cn/user/2645)  //俄罗斯方块游戏（1131行，来源CSDN🎉️ ） #include #include #include #include #include #include using namespace std; int block00[4][4] = { { 10,0,0,0 },{ 1,1,1,1 },{ 0,0,0,0 },{ 0,0,0,0 } }; int block01[4][4] = { { 11,0,1,0 },{ 0,0,1,0 },{ 0,0,1,0 },{ 0,0,1,0 } }; int block02[4][4] = { { 12,0,0,0 },{ 0,0,0,0 },{ 1,1,1,0 },{ 0,1,0,0 } }; int block03[4][4] = { { 13,0,0,0 },{ 0,1,0,0 },{ 1,1,0,0 },{ 0,1,0,0 } }; int block04[4][4] = { { 14,0,0,0 },{ 0,0,0,0 },{ 0,1,0,0 },{ 1,1,1,0 } }; int block05[4][4] = { { 15,0,0,0 },{ 0,1,0,0 },{ 0,1,1,0 },{ 0,1,0,0 } }; int block06[4][4] = { { 16,0,0,0 },{ 0,0,0,0 },{ 1,1,1,0 },{ 1,0,0,0 } }; int block07[4][4] = { { 17,0,0,0 },{ 1,1,0,0 },{ 0,1,0,0 },{ 0,1,0,0 } }; int block08[4][4] = { { 18,0,0,0 },{ 0,0,0,0 },{ 0,0,1,0 },{ 1,1,1,0 } }; int block09[4][4] = { { 19,0,0,0 },{ 0,1,0,0 },{ 0,1,0,0 },{ 0,1,1,0 } }; int block10[4][4] = { { 20,0,0,0 },{ 0,0,0,0 },{ 1,1,1,0 },{ 0,0,1,0 } }; int block11[4][4] = { { 21,0,0,0 },{ 0,1,0,0 },{ 0,1,0,0 },{ 1,1,0,0 } }; int block12[4][4] = { { 22,0,0,0 },{ 0,0,0,0 },{ 1,0,0,0 },{ 1,1,1,0 } }; int block13[4][4] = { { 23,0,0,0 },{ 0,1,1,0 },{ 0,1,0,0 },{ 0,1,0,0 } }; int block14[4][4] = { { 24,0,0,0 },{ 0,0,0,0 },{ 0,1,1,0 },{ 1,1,0,0 } }; int block15[4][4] = { { 25,0,0,0 },{ 1,0,0,0 },{ 1,1,0,0 },{ 0,1,0,0 } }; int block16[4][4] = { { 26,0,0,0 },{ 0,0,0,0 },{ 1,1,0,0 },{ 0,1,1,0 } }; int block17[4][4] = { { 27,0,0,0 },{ 0,0,1,0 },{ 0,1,1,0 },{ 0,1,0,0 } }; int block18[4][4] = { { 28,0,0,0 },{ 0,0,0,0 },{ 1,1,0,0 },{ 1,1,0,0 } }; void initialWindow(HANDLE hOut);//初始化窗口 void initialPrint(HANDLE hOut);//初始化界面 void gotoXY(HANDLE hOut, int x, int y);//移动光标 void roundBlock(HANDLE hOut, int block[4][4]);//随机生成方块并打印到下一个方块位置 bool collisionDetection(int block[4][4], int map[21][12], int x, int y);//检测碰撞 void printBlock(HANDLE hOut, int block[4][4], int x, int y);//打印方块 void clearBlock(HANDLE hOut, int block[4][4], int x, int y);//消除方块 void myLeft(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y);//左移 void myRight(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y);//右移 void myUp(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y);//顺时针旋转90度 int myDown(HANDLE hOut, int block[4][4], int map[21][12], int &x, int y);//加速下落 void myStop(HANDLE hOut, int block[4][4]);//游戏暂停 void gameOver(HANDLE hOut, int block[4][4], int map[21][12]);//游戏结束 void eliminateRow(HANDLE hOut, int map[21][12], int &val, int &fraction, int &checkpoint);//判断是否能消行并更新分值 int main() { int map[21][12]; int blockA[4][4];//候选区的方块 int blockB[4][4];//下落中的方块 int positionX, positionY;//方块左上角的坐标 bool check;//检查方块还能不能下落 char key;//用来存储按键 int val;//用来控制下落速度 int fraction;//用来存储得分 int checkpoint;//用来存储关卡 int times; HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);//获取标准输出设备句柄 initialWindow(hOut); initial: gotoXY(hOut, 0, 0); initialPrint(hOut); check = true; val = 50; fraction = 0; checkpoint = 1; times = val; for (int i = 0; i < 20; ++i) { for (int j = 1; j < 11; ++j) { map[i][j] = 0; } } for (int i = 0; i < 20; ++i) { map[i][0] = map[i][11] = 1; } for (int i = 0; i < 12; ++i) { map[20][i] = 1; } ``` srand((unsigned)time(NULL)); roundBlock(hOut, blockA); while (true) { if (check) { eliminateRow(hOut, map, val, fraction, checkpoint); check = false; positionX = -3; positionY = 4; if (collisionDetection(blockA, map, positionX, positionY)) { for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { blockB[i][j] = blockA[i][j]; } } roundBlock(hOut, blockA); } else { gameOver(hOut, blockA, map); goto initial; } } printBlock(hOut, blockB, positionX, positionY); if (_kbhit()) { key = _getch(); switch (key) { case 72: myUp(hOut, blockB, map, positionX, positionY); break; case 75: myLeft(hOut, blockB, map, positionX, positionY); break; case 77: myRight(hOut, blockB, map, positionX, positionY); break; case 80: switch (myDown(hOut, blockB, map, positionX, positionY)) { case 0: check = false; break; case 1: check = true; break; case 2: gameOver(hOut, blockB, map); goto initial; default: break; } break; case 32: myStop(hOut, blockA); break; case 27: exit(0); default: break; } } Sleep(20); if (0 == --times) { switch (myDown(hOut, blockB, map, positionX, positionY)) { case 0: check = false; break; case 1: check = true; break; case 2: gameOver(hOut, blockB, map); goto initial; default: break; } times = val; } } cin.get(); return 0; ``` } void initialWindow(HANDLE hOut) { SetConsoleTitle("俄罗斯方块"); COORD size = { 80, 25 }; SetConsoleScreenBufferSize(hOut, size); SMALL_RECT rc = { 0, 0, 79, 24 }; SetConsoleWindowInfo(hOut, true, &rc); CONSOLE_CURSOR_INFO cursor_info = { 1, 0 }; SetConsoleCursorInfo(hOut, &cursor_info); } void initialPrint(HANDLE hOut) { SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_BLUE); for (int i = 0; i < 20; ++i) { cout << "■ ■☆ ☆" << endl; } gotoXY(hOut, 26, 0); cout << "☆☆☆☆☆☆☆☆☆☆☆"; gotoXY(hOut, 0, 20); cout << "■■■■■■■■■■■■☆☆☆☆☆☆☆☆☆☆☆☆☆"; gotoXY(hOut, 26, 1); cout << "分 数： "; gotoXY(hOut, 26, 2); cout << "关 卡： "; gotoXY(hOut, 26, 4); cout << "下一方块："; gotoXY(hOut, 26, 9); cout << "操作方法："; gotoXY(hOut, 30, 11); cout << "↑：旋转 ↓：速降"; gotoXY(hOut, 30, 12); cout << "→：右移 ←：左移"; gotoXY(hOut, 30, 13); cout << "空格键：开始/暂停"; gotoXY(hOut, 30, 14); cout << "Esc 键：退出"; gotoXY(hOut, 26, 16); cout << "关 于："; gotoXY(hOut, 30, 18); cout << "俄罗斯方块V1.0"; gotoXY(hOut, 35, 19); cout << "作者：潘约尔"; } void gotoXY(HANDLE hOut, int x, int y) { COORD pos; pos.X = x; pos.Y = y; SetConsoleCursorPosition(hOut, pos); } void roundBlock(HANDLE hOut, int block[4][4]) { clearBlock(hOut, block, 5, 15); switch (rand() % 19) { case 0: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } break; case 1: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block01[i][j]; } } break; case 2: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block02[i][j]; } } break; case 3: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block03[i][j]; } } break; case 4: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block04[i][j]; } } break; case 5: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block05[i][j]; } } break; case 6: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block06[i][j]; } } break; case 7: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block07[i][j]; } } break; case 8: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block08[i][j]; } } break; case 9: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block09[i][j]; } } break; case 10: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block10[i][j]; } } break; case 11: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block11[i][j]; } } break; case 12: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block12[i][j]; } } break; case 13: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block13[i][j]; } } break; case 14: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block14[i][j]; } } break; case 15: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block15[i][j]; } } break; case 16: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block16[i][j]; } } break; case 17: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block17[i][j]; } } break; case 18: for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block18[i][j]; } } break; default: break; } printBlock(hOut, block, 5, 15); } bool collisionDetection(int block[4][4], int map[21][12], int x, int y) { for (int i = 0; i < 4; ++i) { for (int j = 0; j = 0 && y + j >= 0 && map[x + i][y + j] == 1 && block[i][j] == 1) { return false; } } } return true; } void printBlock(HANDLE hOut, int block[4][4], int x, int y) { switch (block[0][0]) { case 10: case 11: SetConsoleTextAttribute(hOut, FOREGROUND_GREEN); break; case 12: case 13: case 14: case 15: SetConsoleTextAttribute(hOut, FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_INTENSITY); break; case 16: case 17: case 18: case 19: SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_GREEN | FOREGROUND_INTENSITY); break; case 20: case 21: case 22: case 23: SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY); break; case 24: case 25: SetConsoleTextAttribute(hOut, FOREGROUND_GREEN | FOREGROUND_INTENSITY); break; case 26: case 27: SetConsoleTextAttribute(hOut, FOREGROUND_BLUE | FOREGROUND_INTENSITY); break; case 28: SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_INTENSITY); break; default: break; } for (int i = 0; i = 0) { for (int j = 0; j < 4; ++j) { if (block[i][j] == 1) { ``` gotoXY(hOut, 2 * (y + j), x + i); cout << "■"; } } } } ``` } void clearBlock(HANDLE hOut, int block[4][4], int x, int y) { for (int i = 0; i = 0) { for (int j = 0; j < 4; ++j) { if (block[i][j] == 1) { gotoXY(hOut, 2 * (y + j), x + i); cout << " "; } } } } } void gameOver(HANDLE hOut, int block[4][4], int map[21][12]) { SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_INTENSITY); gotoXY(hOut, 9, 8); cout << "GAME OVER"; gotoXY(hOut, 8, 9); cout << "空格键：重来"; gotoXY(hOut, 8, 10); cout << "ESC键：退出"; char key; while (true) { key = _getch(); if (key == 32) { return; } if (key == 27) { exit(0); } } } int myDown(HANDLE hOut, int block[4][4], int map[21][12], int &x, int y) { if (collisionDetection(block, map, x + 1, y)) { clearBlock(hOut, block, x, y); ++x; return 0; } if (x < 0) { return 2; } for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { if (block[i][j] == 1) { map[x + i][y + j] = 1; SetConsoleTextAttribute(hOut, FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY); gotoXY(hOut, 2 * (y + j), x + i); cout << "■"; } } } return 1; } void myLeft(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y) { if (collisionDetection(block, map, x, y - 1)) { clearBlock(hOut, block, x, y); --y; } } void myRight(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y) { if (collisionDetection(block, map, x, y + 1)) { clearBlock(hOut, block, x, y); ++y; } } void myUp(HANDLE hOut, int block[4][4], int map[21][12], int x, int &y) { switch (block[0][0]) { case 10: if (collisionDetection(block01, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block01[i][j]; } } } break; case 11: if (collisionDetection(block00, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } } else if (collisionDetection(block00, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } --y; } else if (collisionDetection(block00, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } ++y; } else if (collisionDetection(block00, map, x, y - 2)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } y = y - 2; } else if (collisionDetection(block00, map, x, y + 2)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block00[i][j]; } } y = y + 2; } break; case 12: if (collisionDetection(block03, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block03[i][j]; } } } else if (collisionDetection(block03, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block03[i][j]; } } --y; } else if (collisionDetection(block03, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block03[i][j]; } } ++y; } break; case 13: if (collisionDetection(block04, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block04[i][j]; } } } else if (collisionDetection(block04, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block04[i][j]; } } --y; } else if (collisionDetection(block04, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block04[i][j]; } } ++y; } break; case 14: if (collisionDetection(block05, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block05[i][j]; } } } else if (collisionDetection(block05, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block05[i][j]; } } --y; } else if (collisionDetection(block05, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block05[i][j]; } } ++y; } break; case 15: if (collisionDetection(block02, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block02[i][j]; } } } else if (collisionDetection(block02, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block02[i][j]; } } --y; } else if (collisionDetection(block02, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block02[i][j]; } } ++y; } break; ``` case 16: if (collisionDetection(block07, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block07[i][j]; } } } else if (collisionDetection(block07, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block07[i][j]; } } --y; } else if (collisionDetection(block07, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block07[i][j]; } } ++y; } break; case 17: if (collisionDetection(block08, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block08[i][j]; } } } else if (collisionDetection(block08, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block08[i][j]; } } --y; } else if (collisionDetection(block08, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block08[i][j]; } } ++y; } break; case 18: if (collisionDetection(block09, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block09[i][j]; } } } else if (collisionDetection(block09, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block09[i][j]; } } --y; } else if (collisionDetection(block09, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block09[i][j]; } } ++y; } break; case 19: if (collisionDetection(block06, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block06[i][j]; } } } else if (collisionDetection(block06, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block06[i][j]; } } --y; } else if (collisionDetection(block06, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block06[i][j]; } } ++y; } break; case 20: if (collisionDetection(block11, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block11[i][j]; } } } else if (collisionDetection(block11, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block11[i][j]; } } --y; } else if (collisionDetection(block11, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block11[i][j]; } } ++y; } break; case 21: if (collisionDetection(block12, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block12[i][j]; } } } else if (collisionDetection(block12, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block12[i][j]; } } --y; } else if (collisionDetection(block12, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block12[i][j]; } } ++y; } break; case 22: if (collisionDetection(block13, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block13[i][j]; } } } else if (collisionDetection(block13, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block13[i][j]; } } --y; } else if (collisionDetection(block13, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block13[i][j]; } } ++y; } break; case 23: if (collisionDetection(block10, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block10[i][j]; } } } else if (collisionDetection(block10, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block10[i][j]; } } --y; } else if (collisionDetection(block10, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block10[i][j]; } } ++y; } break; case 24: if (collisionDetection(block15, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block15[i][j]; } } } else if (collisionDetection(block15, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block15[i][j]; } } --y; } else if (collisionDetection(block15, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block15[i][j]; } } ++y; } break; case 25: if (collisionDetection(block14, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block14[i][j]; } } } else if (collisionDetection(block14, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block14[i][j]; } } --y; } else if (collisionDetection(block14, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block14[i][j]; } } ++y; } break; case 26: if (collisionDetection(block17, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block17[i][j]; } } } else if (collisionDetection(block17, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block17[i][j]; } } --y; } else if (collisionDetection(block17, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block17[i][j]; } } ++y; } break; case 27: if (collisionDetection(block16, map, x, y)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block16[i][j]; } } } else if (collisionDetection(block16, map, x, y - 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block16[i][j]; } } --y; } else if (collisionDetection(block16, map, x, y + 1)) { clearBlock(hOut, block, x, y); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { block[i][j] = block16[i][j]; } } ++y; } break; default: break; } ``` } void myStop(HANDLE hOut, int block[4][4]) { clearBlock(hOut, block, 5, 15); SetConsoleTextAttribute(hOut, FOREGROUND_RED | FOREGROUND_INTENSITY); gotoXY(hOut, 30, 7); cout << "游戏暂停"; char key; while (true) { key = _getch(); if (key == 32) { gotoXY(hOut, 30, 7); cout <= 0; --i) { int x = 0; for (int j = 1; j 1 && fraction / 1000 + 1 != checkpoint) { checkpoint = fraction / 1000 + 1; val -= 5; } for (int m = i; m > 0; --m) { for (int n = 1; n < 11; ++n) { map[m][n] = map[m - 1][n]; gotoXY(hOut, 2 * n, m); if (map[m][n] == 1) { cout << "■"; } else { cout << " "; } } } ++i; } } gotoXY(hOut, 36, 1); cout << fraction; gotoXY(hOut, 36, 2); cout << checkpoint; } //完 ``` [Copy]() ```none //吃豆人游戏👀️ （来源CSDN,可以复制） #include #include #include #include #include //停顿:Sleep(); #include //清屏:system("cls"); #include using namespace std; const int n=809; struct Point {int x,y;}; int dali; int fx[4]={-1,27,1,-27}; int fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}}; int dis[1000][1000]; //0:墙 1:有分的路 2:没分的路 3:怪物的家 int changdi[30][27]={ {0,0,0,0,0,0,0,0,0,0,0,0,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,0,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0}, {0,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,1,1,1,1,0}, {0,0,0,0,0,0,1,0,0,0,0,0,2,0,2,0,0,0,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,0,0,0,2,0,2,0,0,0,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,2,2,2,2,2,2,2,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,3,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,3,3,3,3,3,0,2,0,0,1,0,0,0,0,0,0}, {2,2,2,2,2,2,1,2,2,2,0,3,3,3,3,3,0,2,2,2,1,2,2,2,2,2,2}, {0,0,0,0,0,0,1,0,0,2,0,3,3,3,3,3,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,2,2,2,2,2,2,2,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0}, {0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0}, {0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0}, {0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0}, {0,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,1,1,1,1,0}, {0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0}, {0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0}, {0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0}, {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0} }; int x,x1,x2,x3,x4,y,y1,y2,y3,y4; int now,now1,now2,now3,now4; int g1,g2,g3,g4; int fangx,nextfx,last1,last2,last3,last4; int fenshu,guozi,guaitimer; int T1,T2,t1,t2,stopped; //T:计时 t1:玩家速度 t2:怪物速度 int f=0; //f:{0:继续 1:被吃 2:赢了 3:输了} int beichi; void color(int a)//颜色函数 { SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a); } void gotoxy(int x,int y)//位置函数(行为x 列为y) { COORD pos; pos.X=2*y; pos.Y=x; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos); } void begin(){ system("cls"); color(11); printf(" ★"); color(10); printf("吃豆人"); color(11); printf("★\n\n"); color(7); printf(" 请将窗口开至"); color(11); printf("全屏\n"); color(7); printf(" 正在初始化，请耐心等待"); for (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900; for (int i=0; i<=n; i++){ for (int j=0; j=0 && i+fx[j]<=n){ int k=i+fx[j],xx=k/27,yy=k%27,kk; if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1; } } } for (int k=0; k<=n; k++)if(changdi[k]){ for (int i=0; i<=n; i++)if(changdi[i]) for (int j=0; jdis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j]; if (k%80==0){color (13); gotoxy(3,12); printf("│");} if (k%80==20){color(13); gotoxy(3,12); printf("╱");} if (k%80==40){color(13); gotoxy(3,12); printf("─");} if (k%80==60){color(13); gotoxy(3,12); printf("╲");} if (k%60==0){color(11); gotoxy(5,k/60); printf("●");} } } void shuru(){ char ch=getch(); if (ch=='1' | ch=='j') if (changdi[x+fxfx[0][0]][y+fxfx[0][1]]==1|changdi[x+fxfx[0][0]][y+fxfx[0][1]]==2) fangx=nextfx=0; else nextfx=0; else if (ch=='2' | ch=='k') if (changdi[x+fxfx[1][0]][y+fxfx[1][1]]==1|changdi[x+fxfx[1][0]][y+fxfx[1][1]]==2) fangx=nextfx=1; else nextfx=1; else if (ch=='3' | ch=='l') if (changdi[x+fxfx[2][0]][y+fxfx[2][1]]==1|changdi[x+fxfx[2][0]][y+fxfx[2][1]]==2) fangx=nextfx=2; else nextfx=2; else if (ch=='5' | ch=='i') if (changdi[x+fxfx[3][0]][y+fxfx[3][1]]==1|changdi[x+fxfx[3][0]][y+fxfx[3][1]]==2) fangx=nextfx=3; else nextfx=3; else if (ch=='0' | ch=='s') stopped=(stopped+1)%2; else if (ch=='4' | ch=='a') t1++; else if (ch=='7' | ch=='q') t2++; else if ((ch=='6' | ch=='d') && t1-1>0) t1--; else if ((ch=='9' | ch=='e') && t2-1>0) t2--; else if (ch=='g') dali=(dali+1)%2; } void reset(){ system("cls"); color(7); gotoxy(2,30); printf("控制方向：1/2/3/5"); gotoxy(4,30); printf("你的速度：4/6"); gotoxy(6,30); printf("怪物速度：7/9"); x=22; y=13; x1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15; now=607; now1=389; now2=390; now3=392; now4=393; for (int k=0; k<=n; k++){ int i=k/27,j=k%27; gotoxy(i,j); if (changdi[i][j]==1){color(7); printf("?");} else if (!changdi[i][j]){color(1); printf("■");} if (j=26){gotoxy(i,27); color(7); printf("%d",i);} } gotoxy(0,0); gotoxy(x,y); color(14); printf("●"); gotoxy(x1,y1); color(4); printf("◆"); gotoxy(x2,y2); color(5); printf("◆"); gotoxy(x3,y3); color(3); printf("◆"); gotoxy(x4,y4); color(2); printf("◆"); fangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0; gotoxy(14,30); printf(" "); } void move1(){ int xx,yy; xx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1]; if (changdi[xx][yy]){ if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;} color(14); gotoxy(x,y); printf(" "); gotoxy(xx,yy); if (!dali) printf("◎"); else printf("☆"); now=x*27+y; x=xx; y=yy; fangx=nextfx; } else{ if (x==13 && y==0 && fangx==0){xx=x; yy=26;} else if (x==13 && y==26 && fangx==2){xx=x; yy=0;} else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];} if (changdi[xx][yy]){ if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;} color(14); gotoxy(x,y); printf(" "); gotoxy(xx,yy); if (!dali) printf("◎"); else printf("☆"); now=x*27+y; x=xx; y=yy; } } color(7); //gotoxy(15,28); printf("(%d,%d) ",x,y); gotoxy(16,28); printf("now:%d ",now); gotoxy(17,28); printf("%d (%d,%d) ",fangx,fxfx[fangx][0],fxfx[fangx][1]); gotoxy(18,28); printf("(%d,%d) changdi:%d ",xx,yy,changdi[xx][yy]); } void move2(){ int haha,minhaha,xx,yy,chi=0; if (g1){ minhaha=2147483647; if (now1%27==0 | now1%27==26) haha=last1; else if (!dali){ for (int i=0; idis[now1+fx[i]][now]) {minhaha=dis[now1+fx[i]][now]; haha=i;} } else{ minhaha=-minhaha; for (int i=0; i<=3; i++) if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha25 | !changdi[x][k]) k--; while (k28 | !changdi[k][y]) k--; while (k<1 | !changdi[k][y]) k++; } if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y; if (now2%27==0 | now2%27==26) haha=last2; else if (!dali) for (int i=0; idis[now2+fx[i]][k]) {minhaha=dis[now2+fx[i]][k]; haha=i;} } else{ minhaha=-minhaha; for (int i=0; i<=3; i++){ if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha25 | !changdi[x][k]) k--; while (k28 | !changdi[k][y]) k--; while (k<1 | !changdi[k][y]) k++; } if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y; if (now3%27==0 | now3%27==26) haha=last3; else if (!dali) for (int i=0; idis[now3+fx[i]][k]) {minhaha=dis[now3+fx[i]][k]; haha=i;} } else { minhaha=-minhaha; for (int i=0; i<=3; i++){ if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha=0; i--){if (i==0) color(11);gotoxy(13,13); cout<0 && now+fx[fangx]<n) move1(); if (T2%t2==0){ if (guaitimer=30) g3=1; move2(); } if (fenshu==guozi)f=2; } if (f=2) { Sleep(3000); system("cls"); printf("恭喜你吃完了！\n你一共被怪物吃掉了 %d 次",beichi); Sleep(3000); char ying; scanf("%c",&ying); } } ``` [Copy]() --- 99 已递交 93 已通过 0 题解被赞 ## 题目标签 一阶段64数据的输入和输出25二阶段20字符数组15输出语句14双分支结构13多分支、嵌套分支结构11数据的运算10输入输出10三阶段6结构体6单循环结构4函数4自定义函数3算术运算2for循环2while循环1多重循环结构1循环嵌套枚举1打擂台1 # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 17ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community [https://\*\*cybermap.kaspersky.com/\*\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat) [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430) [https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092) [https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014) [https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015) [https://neave.com/\`\`\`](https://neave.com/%60%60%60) #include #include using namespace std; long long qian=100000; void caipiao(){ srand(time(0)); int zc=rand()%10000+1; qian-=2; if(zc%3==0){ cout <<"没中奖"<<endl; cout <<"自身金钱："<<qian<<endl; }else if(zc==10000){ cout <<"中了1000000元"<<endl; qian+=1000000; cout <<"自身金钱："<<qian<<endl; }else{ qian+=rand()%10+1; cout <<"自身金钱："<<qian<<endl; } } void chengxu() { srand(time(0)); cout <<"欢迎游玩c++模拟经营游戏"<<endl; _sleep(600); cout <<"作者：邵明朗（SML)"<<endl; _sleep(600); cout <<"你要不断收集金钱，做世界首富！"<<endl; _sleep(600); cout <<"本人原创，不喜勿喷"<<endl; _sleep(600); cout <<"Loading"; for(int i=1;i<=6;i++){ cout <<"."; _sleep(800); } cout <<endl; string name; cout <<"请输入角色名"<>name; cout <<name<<",你好"<<endl; long long sr,mingy=0,zhim=0,fang=0,che=0,dz=0; string sr1; while(1){ cout <<"1.做生意"<<endl; cout <<"2.购买物品"<<endl; cout <<"3.个人资料"<<endl; cout <<"4.58同城应聘"<<endl; cout <<"5.退出"<>sr; system("cls"); if(sr==1){ cout <<"1.澳门赌场"<<endl; cout <<"2.彩票"<<endl; cout <<"输入0退出"<>sr; system("cls"); if(sr==1){ int a=rand()%2+1; if(a==1){ cout <<"你赌输了"<<endl; qian/=2; printf("当前钱数：%d\n",qian); }else{ cout <<"你赌赢了，但是，久赌必输"<=2) caipiao(); } if(qian>=4000000000000&&che>=5&&fang>=5&&dz>=5){ cout <<"您已通关，亲爱的世界首富"<<endl; cout <<"欢迎期待下一版本"<<endl; _sleep(800); cout <<"Goodbye"<<endl; _sleep(1000); return; } if(sr==5){ cout <<"真的要退出吗，退出后会丢失进度"<<endl; cout <<"请选择是或否"<>sr1; if(sr1=="是"){ return; } } if(sr==3){ cout <<name<<"的个人主页\n\n"<<endl; cout <<"房子数："<<fang<<endl; cout <<"车子数："<<che<<endl; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; } while(sr!=0){ cout <<"1.扫大街的 工资：3000\n"; cout <<"2.图灵编程教育老师 工资：5000-8000 职业需求：电子设备一台"<<endl; cout <<"3.房产中介 工资：10000职业需求：电子设备一台"<<endl; cout <<"4.洛谷站长(kkksc_03) 工资：15000职业需求：电子设备一台\n"; cout <<"5.HUAWEI高管 工资：100000职业需求：电子设备一台\n"; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"一天，一个女人找到了你，他看好了你"<=1000000||fang>=3||che>=8){ cout <<"他对你很好，直接就结婚了"<<endl; cout <<"钱增加100000"<<endl; }else{ cout <<"妹子生气的走了"<<endl; } cout <<"请问水瓶应该投进哪个垃圾桶"<<endl; cout <<"A.可回收 b.不可回收 C.其他垃圾"<>sr1; if(sr1=="A"||sr1=="a"){ cout <<"你答对了"<<endl; qian+=3000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"答错了"<<endl; } } if(sr==2&&dz!=0){ cout <<"1.修改A+B问题 奖金：5000"<<endl; cout <<"2.修改从一输出到一百问题 奖金：8000"<>sr; system("cls"); if(sr==1){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" int a,b;"<<endl; cout <>a>>b;"<<endl; cout <<" cout <<a-1+b-1"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==6){ qian+=5000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<<endl; } } if(sr==2){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" for(int i=0;i<=100;i++){ "<<endl; cout <<" cout <<i<<\" \";\n"; cout <<" }"<<endl; cout <<" return 0\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==4){ qian+=8000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<=1){ cout <<"1.100平米 学区房 提成：10000"<>sr; if(sr==1){ cout <<"来者是一个女人\n她说，要价格不超过3000000"<<endl; cout <<"当前房价3100000"; cout <<"你选择 a.砍价 B.维持原价"<>sr1; if(sr1=="a"||sr1=="A"){ cout <<"你选对了"<<endl; qian+=10000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"Try Again"<<endl; } } } } while(sr!=0){ cout <<"1.房子"<<endl; cout <<"2.车子"<<endl; cout <<"3.电子设备"<<endl; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"1.三线小城豪宅 价值:500000"<<endl; cout <<"2.二线城市150平大平层(城中心) 价值：3500000"<<endl; cout <<"3.一线城市城边小屋 价值：3000000"<<endl; cout <<"4.一线城市城中心80平 价值：4000000"<<endl; cout <<"5.一线城市城中心180平 价值：9000000"<<endl; cout <<"6.北京四合院 价值：100000000"<<endl; cout <<"7.北京西城100平 价值：10000000"<<endl; cout <<"输入8退出"<>sr; system("cls"); if(sr==1){ if(qian>=500000){ cout <<"购买成功"<<endl; qian-=500000; mingy++; zhim++; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3500000){ cout <<"购买成功"<<endl; qian-=3500000; mingy+=3; zhim+=3; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3000000){ cout <<"购买成功"<<endl; qian-=3000000; mingy+=2; zhim+=2; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=4000000){ cout <<"购买成功"<<endl; qian-=4000000; mingy+=4; zhim+=4; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=9000000){ cout <<"购买成功"<<endl; qian-=9000000; mingy+=9; zhim+=9; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=100000000){ cout <<"购买成功"<<endl; qian-=100000000; mingy+=100; zhim+=100; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; qian-=10000000; mingy+=10; zhim+=10; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.五菱宏光 价值:50000"<<endl; cout <<"2.奥迪A3 Sportback 价值:200000"<<endl; cout <<"3.宝马530Li 价值：500000"<<endl; cout <<"4.奔驰S450 价值：1000000"<<endl; cout <<"5.越野房车 价值：100000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=50000){ cout <<"购买成功"<<endl; che++; qian-=50000; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=200000){ cout <<"购买成功"<<endl; che++; qian-=200000; mingy++; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=500000){ cout <<"购买成功"<<endl; che++; qian-=500000; mingy+=2; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; che++; qian-=1000000; mingy+=10; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; che++; qian-=10000000; mingy+=50; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.手机"<<endl; cout <<"2.电脑"<<endl; cout <<"输入3退出"<>sr; if(sr==1){ cout <<"1.诺基亚4400 价值：600"<<endl; cout <<"2.iphone 4 价值：1000"<<endl; cout <<"3.HUAWEI P30 价值：2500"<<endl; cout <<"4.三星Fond 4 价值：10000"<<endl; cout <<"5.镶钻HUAWEI mate X5 价值：1000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=600){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=2500){ cout <<"购买成功"<<endl; dz++; mingy++; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=10000){ cout <<"购买成功"<<endl; dz++; mingy+=2; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; dz++; mingy+=10; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.台式机"<<endl; cout <<"2.一体机"<<endl; cout <<"3.笔记本电脑"<>sr; if(sr==1){ cout <<"1.华强北散装电脑 价值：500"<<endl; cout <<"2.DELL2009款式 价值：1000"<<endl; cout <<"3.Mac Mini 价值：11000"<<endl; cout <<"4.MAC 价值：25000"<<endl; cout <<"5.MAC PRO 价值：100000"<<endl; cout <<"输入6退出"<>sr; system("cls"); if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=25000){ cout <<"购买成功"<<endl; qian-=25000; mingy+=3; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=100000){ cout <<"购买成功"<<endl; qian-=100000; mingy+=10; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout<<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.散装一体机 价值：500"<<endl; cout <<"2.HUAWEI 一体机 价值：5000"<<endl; cout <<"3.IMAC 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; dz++; qian-=500; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.散装笔记本 价值：500"<<endl; cout <<"2.某知名品牌二手电脑 价值：1000"<<endl; cout <<"3.华为笔记本 价值：5000"<<endl; cout <<"4.MACBOOk Air 价值：11000"<<endl; cout <<"5.MACBOOK PRO 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } } } } } return; } int main(){ start: cout <> s; if(s == "是") { here: string name, pword; srand((unsigned)time(0)); int ce = rand()%5+1; string pda = "ahklsd", pdb = "kshfke", pdc = "reuwin", pdd = "skfeju", pde = "lesiuc", pd; cout <> s; if(s == "使用本地账户登录") { Sleep(500); system("cls"); cout << "用户名:Administrator 密码:"; if(ce==1){ pd=pda; }if(ce==2)pd=pdb;if(ce==3)pd=pdc;if(ce==4)pd=pdd;if(ce==5)pd=pde; cout << pd <> name; cout <> pword; if(name != "Administrator" || pword != pd) { cout << "[系统提示]用户名或密码错误!"; Sleep(1000); system("cls"); goto here; } cout << "登录成功!"; Sleep(500); system("cls"); chengxu(); } else { Sleep(500); system("cls"); goto start; } } return 0; } ``` /* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 */ #include #include #include using namespace std; const int daytime=0,night=1; int day=0, during_time=daytime, player_number, my_number; HWND hwnd=GetForegroundWindow();//窗口定义 /*设置颜色*/ const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c) { case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break; } } int idx_police=-1; /*控制光标在控制台的位置 */ void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position); } /*初始化窗口*/ void init_Show_Window(){ system("mode con lines=60 cols=188");//全屏 ShowWindow(hwnd,SW_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 } /*玩家类*/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die_or_life; int how(){ return die_or_life; } int is_light;//是否已经公布 int killer; }; player players[1000]; /*转换白天模式*/ void change_daytime(){ during_time=daytime; day++; } /*转换黑夜模式*/ void change_night(){ during_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1}; /*b是否在Arr中*/ bool is_include(int arr[],int b,int l){ for(int i=0;i=10) nlangren=3; else nlangren=2; for(int i=0;i<player_number;i++) { players[i].die_or_life=life; players[i].is_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i=10) { do{ idxlieren=rand()%player_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren; } do{ idxyuyanjia=rand()%player_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is_light=1; } } players[my_number].is_light=1; } /*在屏幕上打印东西*/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during_time==night) color(red); else color(blue); printf("第%d天 | ",day); if(during_time==night) cout<<"黑夜"; else cout<<"白天"; gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } } } /*判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3*/ int is_end(){ int die_bad=0; int die_people=0; int die_god=0; for(int i=0;i=nlangren)) return 3; if(die_bad>=nlangren) return 1; if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2)) return 2; return 0; } /*游戏开始前的骚操作*/ void before_game(){ srand(time(NULL)); init_Show_Window(); color(green); cout<<"欢迎来到狼人杀游戏\t\t\t为了更好的游戏体验,请右键点击上方↑↑,点击\"属性\",点击\"字体\"栏目,将字体修改为宋体或新宋体,将字号改为20\n作者：洛谷393864\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\n______________________\n"; cout<>player_number; while(player_number12) { cout<>player_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); } cout<<"\b\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b\b"; } system("cls"); init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print(); } /*每一天开始前的操作*/ void something_before_everyday(){ change_night(); system("cls"); print(); int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1; gotoxy(0,7); cout<<"________________________"; gotoxy(0,8); color(white); cout<<"天黑~请闭眼~~~\n"; } /*守卫操作*/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫~请睁眼~~\n"; Sleep(1500); cout<>shouweishou; while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ cout<>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){ shouweishou=rand()%10; } } } Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; } /*狼人操作*/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人~请睁眼~~~\n"; Sleep(1500); cout<>langrensha; while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){ cout<>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){ langrensha=rand()%player_number; } Sleep(3000); } cout<<"狼人请~闭眼~~\n\n"; return langrensha; } /*女巫操作*/ int nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫~~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){ if(is_nvwujiu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<>is_nvwujie; while(is_nvwujie!=1&&is_nvwujie!=2){ cout<>is_nvwujie; } if(is_nvwujie==1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\n"; nvwujiu=langrensha; } is_nvwujiu=1; } Sleep(1500); if(::is_nvwudu) cout<<"你已经用过解药\n",Sleep(1500); else { cout<>is_nvwudu; while(is_nvwudu!=1&&is_nvwudu!=2){ cout<>is_nvwudu; } if(is_nvwudu==1){ Sleep(1500); cout<>nvwudu; while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){ cout<>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\n"; } ::is_nvwudu=1; } }else{ if(players[idxnvwu].die_or_life == life){ if(!is_nvwujiu) { int is_jiu=rand()%8; if(is_jiu==0){ nvwujiu=langrensha; is_nvwujiu=1; } } if(!is_nvwudu) { int is_du=rand()%4; if(is_du==0){ int num=rand()%player_number; nvwudu=num; is_nvwudu=1; } } } } cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 } int yuyanjiabixutoupiao=-1; /*预言家操作*/ void YuYanJia(){ color(green); cout<<"预言家~请睁眼~~\n"; Sleep(2000); if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){ cout<>p; while(!(p>=1&&p<=player_number)){ cout<>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\n"; players[p-1].is_light = 1; }else{ cout<<"好人\n"; players[p-1].is_light = 2; } }else{ int p=-1; while(p==-1||players[p].die_or_life==die||p==idxlieren) p=rand()%player_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家~~请闭眼~~\n"; } /*黑夜操作*/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){ LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; //如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000); } /*猎人操作*/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\n"; players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<>lierendai; while(lierendaiplayer_number||players[lierendai].die_or_life==die){ cout<>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die; } void police_die(); /*判断谁死了*/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"________________________\n"; Sleep(3000); color(white); cout<<"天亮了\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is_die[15]={false},is_die_lieren=false,flag=false; for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life) { if(i==LANGRENSHA||i==NVWUDU) { if(players[i].type==lieren) is_die_lieren=true; players[i].killer= (i==LANGRENSHA ? langren:nvwu); players[i].die_or_life=die; is_die[i]=true; } if(i==SHOUWEISHOU||i==NVWUJIU) { if(players[i].type==lieren) is_die_lieren=false; players[i].killer=-1; players[i].die_or_life=life; is_die[i]=false; } } } bool is_police_die=false; for(int i=0;i<player_number;i++) { if(is_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx_police) is_police_die=true; } } if(flag) cout<<"死了\n"; else cout<<"是平安夜\n"; if(is_die_lieren) Lieren(); if(is_police_die) police_die(); } /*选警长*/ void choose_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"________________________\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己~\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player_number;i++) { if(players[i].die_or_life==life&&!is_include(cannot,i,player_number)) { if(i==my_number) { cout<>n; while(nplayer_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number)) { cout<>n; } cout<<i+1<<"号选举"<<n--<<"号\n"; tong[n]++; } else { int n=rand()%player_number; while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number)) n=rand()%player_number; cout<<i+1<<"号选举"<<n+1<<"号\n"; tong[n]++; } Sleep(1500); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx_max+1<<"号当选警长\n"; Sleep(3000); idx_police=idx_max; return; } /*投票*/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"________________________\n"; color(white); cout<<"下面进入投票环节\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player_number;i++){ if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){ if(i==my_number){ color(white); cout<>n; while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){ cout<>n; } Sleep(2000); cout<<setw(2)<<my_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(i==idx_police) color(yellow),cout<<"(警长)\n"; else cout<<"\n"; if(i==idx_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){ if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player_number; if(is_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(i==idx_police) cout<<"(警长2票)\n"; else cout<<"\n"; if(i==idx_police) tong[t]++; tong[t]++; } Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max; } /*警长死亡*/ void police_die(){ color(yellow); int type; if(idx_police==my_number) { Sleep(1550); cout<>type; while(!(type==1||type==2)) { cout<>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; } } /*故事的最后*/ void the_end(){ system("cls"); switch(is_end()){ case 1:cout<<"好人胜利\n\n"; break; case 2:cout<<"狼人胜利\n\n"; break; case 3:cout<<"本局平局\n\n"; break; } for(int i=0;i<player_number;i++){ cout<<i+1<<"号位:\t"; switch(players[i].type){ case nvwu: cout<<"女巫\t";break; case yuyanjia: cout<<"预言家\t";break; case cunmin: cout<<"村民\t";break; case langren:cout<<"狼人\t";break; case lieren:cout<<"猎人\t"; break; case shouwei:cout<<"守卫\t";break; } cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\n"; break; case langren:cout<<"被狼人杀死\n"; break; case good:cout<<"被投票出局\n"; break; case lieren:cout<<"被猎人带走\n";break; default :cout<<"存活\n"; } cout< 来源：码农学习联盟 想要了解全球被黑客攻击的情况吗？ 想体验下电影上黑客使用的骚操作吗？ 又或者一键生成高逼格背景？ 小编刚开始看到的时候就觉得很神奇，还有这种神奇的网站？ 一起来探索下吧！  **一.geektyper（模拟黑客）** 这是一款功能强大的黑客模拟软件，它可以模拟电影上那种黑客操作电脑的过程，包括敲代码以及出现各种高大上的弹窗，并且可以自定义代码颜色、背景以及Logo图案 不知道你们看电影的时候，看到那种黑客操作系统，敲击键盘时电脑上飞速旋转一些数据，感觉是不是帅爆了，有一种让你也想成为一名黑客的感觉， 这个软件就可以满足你，十足的“撩妹神器”好吗！  **1、先打开安装好的geektyper** 在主界面上我们可以看到左上方的操作提示和右侧的功能按钮。 刚开始使用大家可能有点懵圈，我们可以按照提示点击“F2”， 就可以弹出帮助界面，显示每个键的作用，就可以开始操作啦。  **2、右下角有一个“☰”按钮，点击它会进入设置界面** 你可以在里面对界面文字的色彩和格式进行修改。  **3、最后就是它最炫酷的功能了** 点击右上角的DL Data就会出现类似于电影里那种正在下载的界面， 其他也是点击之后出现各种数据展现，而且你还可以敲代码， 这时候你就像是一个黑客在操作各种系统，超炫酷好吗！  ## **2.CYBERMAP** 网址： [https://\*\*cybermap.kaspersky.com/\*\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat) 这个网站是一个可以“实时展示全球恶意攻击”的网站， 你可以很直观的看到全球黑客的实时攻击活动情况， 这个网站真的做的很炫酷，让你看一眼就爱上他 因为是国外的网站，所以大家去搜索的时候可以使用Google浏览器，国内的浏览器可能搜不到，小编用的是Google，上个动图大家感受下它的炫酷。  **1、数据来源** 想要了解他这些数据收集这么来的，可以看到界面上有一个数据来源，都有很清楚的数据分析。  **2、选择国家** 这是一个“实时展示全球恶意攻击”的网站，所以你可以选择你想要看的国家目前所受的攻击。  ## **三.Stars-Emmision** 网址： [https://**wangyasai.github.io/Sta**rs-Emmision/](https://link.zhihu.com/?target=https%3A//wangyasai.github.io/Stars-Emmision/) 一款比名字更加浮夸的生成器，可以一键生成小米海报这种背景效果，大大节省设计时间啊， 它与星星有关，是一款放射图片生成网站，犹如无数的流星雨正向你扑面而来，在线制作粒子散射，效果极为震撼啊！ 一般这种效果是在AI里面制作出来的，在这里直接生成，惊不惊喜，意不意外？  1、进入网站界面右上角是可以调节参数的，虽然都是英文，但是都是比较简单的，小编都能看懂，你们肯定都OK啊  有一个Color1和Color2，这两个是可以更换成自己喜欢的颜色的。  2、在“Direction”里面是可以调节粒子的范围的，看你比较喜欢那种可以自由更换。  最后调整完成，可以下载保存下来，比如可以放进PPT里也是一个不错的选择，又或者可以用GIF录制工具，把它录制成一个动态背景，也是美轮美奂啊。 今天跟大家分享的跟以往不一样，可能我们不需要经常用到，但是装装逼也是很好的啊，逼格满满好吗，小编刚开始看到是时候就觉得很神奇啊，瞬间心动，就分享给你们啦  [在线黑客模拟攻击演示 (tonghei.com)](https://hackcode.tonghei.com/hacker/)   for i in range(True): m=str(input("姓名：")) n=int(input("你的年份：")) y=int(input("你的月份：")) r=int(input("你的日期：")) x=str(input("你的星座：")) print(n,"年",end=" ") print(y,"月",end=" ") print(r,"日") print(x) d=str(input("你的爱好：")) if d=="篮球" or d=="足球" or d=="羽毛球": print("阳光开朗大男孩") elif d=="编程": print("黑客") elif d=="枪": print("狙击之王") else: print("其他") w=int(input("你平时的自我打分：")) if w=60 and w=70 and w=80 and w<=100: print("优秀") aw=str(input("你的学校：")) aq=int(input("期中成绩：")) am=int(input("期末成绩：")) if am == 0 and aq == 0: print("你在",aw,"无","无") if am!=0 and aq==0: print("你在",aw,am,"无") if am==0 and aq!=0: print("你在",aw,"无",aq) print("你所有的东西已经全部测试完！") print("！！！加油！！！") 洛谷 /\*评测状态 Waiting 评测：评测请求正在等待被评测机抓取 Fetched 评测：评测请求已被评测机抓取，正在准备开始评测 Compiling 评测：正在编译中 Judging 评测：编译成功，正在评测中 Accepted 通过：程序输出完全正确 Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） Time Limit Exceeded 不通过：程序运行时间超过了题目限制 Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制 Runtime Error 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等） Compile Error 不通过：编译失败 System Error 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈） Canceled 其他：评测被取消 Unknown Error 其他：未知错误 Ignored 其他：被忽略 有“成绩取消”字样则说明管理员手动标记此记录为取消，可能违反了服务条款，比如代码被发现与其他用户的代码十分相似。 sqrt(n); i\*i<=n; 编译错误 可能有以下情况： 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 5. \_\_int64 在 GNU C++ 中应写成 long long 类型 6. main() 返回值必须定义为 int ，而不是 void 7. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 8. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 9. printf 中使用 %lf 格式是不正确的 世界上最遥远的距离不是生与死，而是你亲手制造的BUG就在你眼前，你却怎么都找不到她。 AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 PC=Perfect Compile=完美的编译 RE=Run Excellently=完美运行 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 OLE=Output Limit Enough=输出合法 CE=Compile Easily=轻松通过编译 UKE=Unbelievably Keep Enough Score=难以置信地保持足够的分数 AU=All Unaccepted=全都不正确 按照赛制不同，有不同的递交、排名规则。 OI 赛制所有题目均以最后一次递交为准，特别地，请避免编译错误。 OI 赛制排名规则为：总分高的排在前面，总分相等则排名相同。 ACM/ICPC 赛制所有题目递交后立即评测，以是否通过为准。 ACM/ICPC 赛制排名规则为：通过题目数多的排在前面，通过题目数相同的做题耗时（含罚时）少的排在前。 乐多 赛制下，选手可以多次提交一道题目，并获得实时评测结果。 乐多 赛制下，多次提交会导致选手的得分被扣除，排行榜将显示用户的最高得分。 乐多 赛制下，每道题的最终得分为:s\*max(0.95^n,0.7).s,n分别代表本次得分和本次提交前的尝试次数。 乐多 排名规则为：按照如上规则折算后的分数从高到低排名。 IOI(严格) 赛制下，不同于IOI赛制，排行榜将被关闭至比赛结束。 IOI(严格) 赛制下，每道题的排行榜得分将为用户每个子任务在所有提交中的最大得分的和。 时间与空间限制以题目说明为准，默认限制参见限制。 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 1. \_\_int64 在 GNU C++ 中应写成 long long 类型 2. main() 返回值必须定义为 int ，而不是 void 3. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 4. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 5. printf 中使用 %lf 格式是不正确的 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 爆零是一种宿命，WA是一种绝望 TLE是一种痛苦，RE是一种放弃 UKE是一种无奈，AC是一种原谅 AK是一种幻想，弃赛是一种颓废 吊打是一种必然，进队是一种奢望 #模拟只会猜题意，贪心只能过样例 数学上来先打表，ＤＰ一般看规律 组合数学靠运气，计算几何瞎暴力 #图论强行套模板，数论只会ＧＣＤ #递归递推伤不起，搜索茫然ＴＬＥ 分治做得像枚举，暴力枚举数第一 数据结构干瞪眼，怒刷水题找信心 涨姿势也不容易，考试一来全懵逼 暴力出奇迹，骗分过样例。 数学先打表，ＤＰ看运气。 穷举ＴＬＥ，递推ＵＫＥ。 模拟ＭＬＥ，贪心还ＣＥ。 #想要骗到分，就要有方法。 图论背模板，数论背公式。 动规背方程，高精背代码。 如果都没背，干脆输样例。 模拟定想全，动规定找对。 贪心定证明，二分LM+1。 宜考NOIP , 小心别爆零.] 骗分过样例，暴力出奇迹。 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，GM=gR方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b方减去4ac。 瀚海阑干百丈冰，酸脱羟基醇脱氢 西江月·夜行OI道中 明月AC惊鹊， RE半夜鸣蝉。 稻花香里说丰年， 听取WA声一片。 七八个TLE， 两三点MLE。 旧时茅店社林边， 路转CE忽见。 生命的意义? 如果26个英文字母 A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z 分别等于 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26 那么： 获得知识,Knowledge =K+N+O+W+L+E+D+G+E =11+14+15+23+12+5+4+7+5 =96% 努力工作，Workhard =W+O+R+K+H+A+R+D =23+15+18+11+8+1+18+4 =98% 也就是说知识和努力工作，对我们人生的影响，可以达到96%和98%。 好运,Luck =L+U+C+K= 12+21+3+11= 47% 爱情,Love =L+O+V+E =12+15+22+5 =54% 看来，这些我们通常认为重要的东西 却并没起到最重要的作用。 那么， 什么可以决定我们100％的人生呢？ 是Money（金钱）吗？ =M+O+N+E+Y =13+15+14+5+25 =72% 看来也不是。 是Leadership (领导能力)吗？ =L+E+A+D+E+R+S+H+I+P =12+5+1+4+5+18+19+9+16 =89% 还不是。 金钱，权力也不能完全决定我们的生活。 那是什么呢？其实， 真正能使我们生活圆满的东西就在我们的 代码里面！ 输入输出流头文件,iostream =I+O+S+T+R+E+A+M =9+15+19+20+18+5+1+13 =100% 所以坚持写代码吧… 各种老师一回头 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 所有头文件: 1.首先是最方便的万能头文件，顾名思义，可以将其理解为父亲头文件 （虽然方便了懒人，但是缺点也很明显--这一头文件很占用内存）： #include 2.接着也是比较常用的，作用于数据流输入输出 cin>>和cout<<： #include 3.然后是各种算法的头文件(例如sort函数等)： #include 4.关于数学函数的头文件（例如max( )，min( )，abs( )等）（从C语言中的math.h继承而来）： #include 5.string字符串头文件： #include 6.接着是C语言的头文件： #include 7.普通队列(只能一边进一边出)(先进先出)的头文件： #include 8.双向队列(两边都可以进出)(先进先出)的头文件： #include 9.栈(先进后出，后进先出)的头文件： #include 10.列表的头文件： #include 11.动态数组(不需知道该数组的数量)的头文件: #include 12.图的头文件： #include 13.集合(内部自动有序且不含重复元素)的头文件： #include 14.控制电脑或小黑框头文件(不包含在万能头件)： #include 数学是火，点亮物理的灯； 物理是灯，照亮化学的路； 化学是路，通向生物的坑； 生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯； 历史是灯，照亮社会之路； 社会是路，通向哲学大坑； 哲学是坑，埋葬文科生。 班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀XXX 鼓起勇气敲起这键盘 只因为有你在 无向图，是否明白 害羞的我，说不出的爱 我也曾四处漂泊流浪 为求单元短路 直到我蓦然回首时 瞥见你复杂模样 提交一次一次一遍一遍 巡查于OJ 只为了AC出现 如何卡进超限时间 增广路止不住求最大流 深广把图搜 手敲着小小的键盘 没人陪在我左右 套用心爱的线段树 仿佛AC了全OJ 想要评测机了解 这AK的感觉 一个人的优化那网络流 明明想AC却超时超空 虽然我的常数可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 写着n方n三的暴力 形单影只的我 任BUG将我剥落 一声叹息只能打表 我也想打到那集训队 给自己骗点分 任巨佬如此强大 又何处能够骗到分 OI总有许多挫折 请坚定自己的选择 即使在难过时刻 也要把代码写 一个人的优化那网络流 明明想AC却超时超空 虽然我的实力可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 为你写起这代码 这是鬼畜的风格 就算超时又如何 只想带给你AC 为你我努力刷题写dp 感谢你们的关注 就算明天for循环重复 有了陪伴就不孤独 --- 咬下一口我的快速幂吧 尝尽这测评的A(C) WA T(LE) R(E) 身在文化课的OIer们啊 不要忘记你代码 也许对这世界有着无奈 已不再是那一个蒟蒻 即使NOIP爆零也要学会去承担 有了算法陪伴我已不再会孤单 你们的鼓励在我的心中永不会消散 # [家长直呼太暴力！这些算法可能会被删除](https://www.cnblogs.com/wlzhouzhuan/p/15344765.html) 近日，洛谷网络科技有限公司多位用户家长向 https://www.luogu.com.cn/user/1 儿童的因素出现，要求对相关算法进行整改或被删除。 洛谷网络科技有限公司题目组管理员在接受采访时说道，在最近几天内，洛谷收到了数十条家长来信，声称网站教授的部分算法存在“血腥”、“暴力”等内容。“他们说这些东西会教坏他们家的孩子，要求我们整改这些算法，把这些对小朋友不太好的东西删掉，或者直接把算法删除。” 随着国庆 (雾) 的到来，很多家长直接来到洛谷反映情况。记者在现场随机采访了几位家长，询问他们对这些算法的看法。 刘女士的儿子正在洛谷学习普及组内容。在采访中刘女士告诉记者，希望洛谷停开**匈牙利算法**。“我看里面讲的都是些一一匹配啊、二分图啊之类的匹配问题，**这不是教孩子怎么找npy么？那他以后岂不是学会早恋了？**”王先生也有类似的想法。他要求洛谷整改**月赛**内容。“**听说课程里面有‘选妹子’，要是小朋友被女拳打了该怎么办？**太危险了！” 认为数据结构太危险、容易伤到孩子，是很多家长的共同心声。王大爷今年已经六十多岁了，却依然专程跑到学校，高呼停止教授**Splay树**和**Treap树**。他说，**自家的孙子很小的时候撞到树上过，他担心这两棵树会给孩子造成心理阴影。** 此外，**最大流**、**费用流**等算法也遭到了部分家长的抵制。“主要还是玩水安全嘛”，陈女士说，“孩子们看到这些流啊、流量啊、回家就很可能会下水去游泳，我们当家长的还是不放心嘛。”而张先生的态度则更为坚决：“\*\*现在就敢玩水，将来敢玩什么，我都不敢想了！\*\*” 同样作为算法，**《深入浅出程序设计竞赛》**受到抵制的理由则有很大不同。吴先生告诉记者：“主要是，这个（深入浅出程序设计竞赛的教材）太厚了，得有好几斤重，**网上小孩子如果嬉戏打闹，拿着这本书到处乱甩（的话），非常危险。**要是碰到头的话，那肯定会把头磕破的，你说这个责任由谁来承担？” 在众多算法中，家长抵制呼声最高的则是图论算法。在家长看来，有的算法要找环，会绕晕到孩子；画图用的笔可能会戳伤手指；很多算法在搜索的时候可能会把系统栈用爆；有些算法写错了要输中量参解改很久，可能会累到小朋友，“\*\*把我家小孩累死了该怎么办？\*\*” 除了担心孩子们的安全外，对孩子生活习惯的影响也成为了家长们抵制课程的要素之一。叶女士告诉记者，她希望洛谷整改全部英语题面。叶女士的儿子才考普及组，却已经学会了sh\*t，f\*\*k等高级词汇。“孩子现在出口就是这种词，影响很不好，肯定是洛谷的题面教的。”叶女士说。 同样，李先生对于洛谷的bfs, dfs, bdfs算法也颇有微词。“我们还是想给孩子营造一个健康的成长环境嘛，我看课上，居然让小朋友们去暴力遍历图啊、暴力找答案啊，这不是教小朋友们暴力么？\*\*平时打打杀杀的动画片我都不让自家小孩看，更不要说动手去做这些了。\*\*” 此外，一些非盈利机构也遭到了家长的抵制。很多家长认为，玩电脑是影响自家小孩学习的关键原因，因此强烈要求洛谷取缔 **F ，并取消相关竞赛。 **N\*\*P** 首当其冲，周先生接受采访时说道：“听说这门课要学生们自己学习算法，要是真把算法学好了，不就会有更多小朋友沉迷电脑么？**如果他们不学算法的话，我们的小孩就不会这么贪玩电脑了。**”同样，一些家长也对**浏览器**表示不满：“**没有浏览器，小朋友们自然就不会沉迷上网了。\*\*” 让记者感到惊奇的是，很多家长对一些计算机基础数学内容也有较大的意见。部分家长要求下架\*\*《组合数学》\*\* **《混凝土数学》**等课程。在问及原因时，家长告诉记者，**文中的感叹号很像一根棍子，会引发小朋友的暴力倾向。** 针对此事，记者尝试联络洛谷网络科技有限公司的管理员。管理员回复称， https://www.luogu.com.cn/user/1 不过，也有少数家长对一些算法表示支持。一位家长告诉记者，希望学校着力建设《编程语言基础》课程。“\*\*孩子如果在学校学好语言这些东西的话，回让他搬砖的时候应该能更好一些。\*\*” import turtle import time print('欢迎使用PY-C语言!') print('Py-C with IDLE!') print('Py-C (0.7.6)\*') n=input() if n=='int tuple(); and ():': print('int ();') p=input() if p=='text(up and (-1)down):': print('text open!') q=input('无用') b=input() if b=='pwrnbnt[nt()>x]': q=input('有用') print(q) time.sleep(2) elif n=='bl prt; and ();': print('qwerty(print()):!') w=input() a=input('无用输入') if w=='bl': t=input('输入变量') b=t u=input() if u=='prt(bl[itntgujhy]-(a))': print(b) time.sleep(2) elif n=='range[q,w,e,r,t,y]another();': print('range[print()]!;') p=input() if p=='range:': s=input() if s=='print(i,i,i);': m=int(input()) for i in range(1,m+1): print(i) time.sleep(2) elif n=='range(u,i,o,p,[,])out():': print('倒序排列') v=input() if v=='()\_xtange[],end={x-1(got[0])}': g=int(input()) for i in range(g,0,-1): print(i) time.sleep(2) elif n=='if [1;2:{x-y}+(a)];': print('if please to print()!;') f=input() if f=='if prt(); and: or(123);': h=int(input()) print(h) time.sleep(2) elif f=='input(1*2)if and if(to);': j=input() y=input() if j==y: print(j) time.sleep(2) elif n=='if [1;2{1234}to(12345[x])=="y"];': print('if and else to print()!;') u=input() if u=='input(1*2) if and if(to); and eles to and if (print(123)):': q=int(input()) w=int(input()) if q==w: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n=='a,b==int(input(2))} and while and to {12qwerty}-(a) print(a);': a=int(input()) b=int(input('不要是太大的数')) while a>b: print(a) a+=1 time.sleep(2) elif n=='list{x+i}[c-a] num to sum();': q=list(map(int,input().split())) print(sum(q)) time.sleep(2) elif n=='list{x+n}[c+a] num to del [1];': q=list(map(int,input('请输入一个列表').split())) q.pop(1) print(q) time.sleep(2) elif n=='list{x+n}bnt and (): to list and list()do not remove();': q=list(map(int,input('請輸入一個列表').split())) print(q[len(q)-1]) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and no more': q=list(map(int,input('请输入一个列表').split())) q.append(1) print(q) time.sleep(2) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and a bl to print():': q=list(map(int,input('请输入一个列表').split())) t=input() q.append(t) print(q) time.sleep(2) elif n=='tuple() to do a d(ipt);': print('tuple is open!') d=tuple(input("一个元组")) q=input() if q=='prt this tuple();': print(d) time.sleep(2) elif q=='exit,end={exit()};': exit() elif n=='exit() to exit();': exit() elif n=='*mt*:electronic calculator;': n1=int(input('a number')) s1=input('a symbol') n2=int(input('a number')) if s1=='+': print(n1+n2) elif s1=='-': print(n1-n2) elif s1=='*': print(n1*n2) elif s1=='/': print(n1/n2) elif s1=='//': print(n1//n2) elif s1=='%': print(n1%n2) elif n=='*mt*:turtle drew;': n=int(input('次数')) for i in range(1,n+1): a=input('a cmd') if a =='turtle.qdesgforward(100);': turtle.forward(100) elif a=='turtle.qhhjaudbnsuleft(90);': turtle.left(90) # 看完md语法记得回来！！文章末尾有彩蛋！！md语法放这里了： # [Markdown 语法---戳我跳转](https://blog.csdn.net/qcx321/article/details/53780672) # 写题格式：： ```none markdown //'#'和文字中间有空格！！ //正确示范：# 题目描述 //错误示范：#题目描述 # 题目背景(若果有需要能写上) 输入你想说的（注意跟背景有关) # 题目描述 发挥你的想象(不要把输入输出格式说了， 只说代码需解决的功能就可以啦！） # 输入格式 输入共$输入行数$……………… # 输出格式 输入共$输出行数$……………… # 输入输出样例 ## 输入样例 \```input1 …………………… \``` ## 输出样例 \```output1 …………………… \``` ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) 最后写题推荐在[HydroOJ](https://hydro.ac/)上面写题，一步一步慢慢来： 第一步）创建方法：[域创建教程](https://hydro.ac/discuss/6172ceeed850d38c79ae18f9) 第二步）使用方法：自己用Github账号创一个自己的域，体验一把当管理员的爽！建好域后，点到题库，右侧菜单栏选"创建题目"，在里面你可以现写markdown，还记得文章开始那个链接吗？用里面的语法把你想要的东西呈现出来就好啦！！ [训练 - Turing (qdturing.cn)](https://oj.qdturing.cn/d/W0001/training) [https://oj.qdturing.cn/d/system/](https://oj.qdturing.cn/d/system/) '''  ```none :: :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) ```none \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430) [https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092) [https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014) [https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015) # 泰拉瑞亚\~     [https://oj.qdturing.cn/user/362](https://oj.qdturing.cn/user/362) [https://oj.qdturing.cn/user/27](https://oj.qdturing.cn/user/27)    # 比赛 1. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/contest/66163ff3e58c8dbba13b068c) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 45 2. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/contest/66162df2e58c8dbba13af0c8) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 25 3. **31** **2024-3** # [图灵三月月赛 - 提高组 赛题](https://oj.qdturing.cn/contest/66092cff2faa61e7f72a9727) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * 2 小时 * 23 4. **6** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2](https://oj.qdturing.cn/contest/65c10bf5c82e8ec49fdfee00) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * Rated * 3 小时 * 28 5. **8** **2023-7** # [2023.7.8 青岛市图灵编程杯 周赛](https://oj.qdturing.cn/contest/64a8ca1289a4167efe646520) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * Rated * 5 小时 * 6 * [更多 >](https://oj.qdturing.cn/contest) # 作业 1. **21** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2 补题场](https://oj.qdturing.cn/homework/65c2e34cc82e8ec49fe0b120) * 状态: 已结束 * 开始时间: **2 个月前** * 最终截止时间: **1 个月前** 2. **28** **2023-7** # [2023.6.10 青岛市图灵编程杯 周赛补赛](https://oj.qdturing.cn/homework/648985663d3f34cb2cb71939) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **8 个月前** 3. **30** **2023-6** # [2023.5.27 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/64780c42f428fb2d18a6d008) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 4. **30** **2023-6** # [2023年 市北区区赛 - 初中组补题场](https://oj.qdturing.cn/homework/645de3a2eb77954a9afa5a27) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 5. **30** **2023-6** # [2023年 市北区区赛 - 小学组补题场](https://oj.qdturing.cn/homework/645ddfd2eb77954a9afa56b5) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 6. **29** **2023-6** # [2023.6.3 青岛市图灵编程杯 周赛 补赛](https://oj.qdturing.cn/homework/64803c5aa3c4b799f61a0e42) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 7. **5** **2023-6** # [2023.5.20 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/646994197e384d7c1691ff34) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **10 个月前** 8. **25** **2023-5** # [2023.4.22 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/64488cd3b4bcd970abf6dff1) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **10 个月前** 9. **7** **2023-5** # [2023.4.29 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/644d0555604717e00720f3ce) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **11 个月前** 10. **29** **2023-4** # [2023.3.25 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/641d43a8453064be228e37b2) * 状态: 已结束 * 开始时间: **1 年前** * 最终截止时间: **11 个月前** * [更多 >](https://oj.qdturing.cn/homework) # 训练 1. 351 已参加 # [测试专用训练](https://oj.qdturing.cn/training/6477fcfbf428fb2d18a6cd82) 测试专用训练,用于新生测试 * 5 小节, 61 道题 * **已完成 0%** * [更多 >](https://oj.qdturing.cn/training) # Ranking | 排名 | 用户名 | RP | 个人简介 | | ------ | -------- | ---- | ---------- | | 1 |  [王泳权 (Wf\_yjqd)](https://oj.qdturing.cn/user/58) | 2225 | 我就看不打比赛多久能掉下 Rank 1 | 拜月 | RiOI | 菜狗 | lyhtql！| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 |  [原梓恒 (yzh\_tcl)](https://oj.qdturing.cn/user/157) | 1949 | 李逸航和王泳权说了，他们只需要略微出手，就已知这个分段的极限了 | | 3 |  [李安 (Andy\_Li)](https://oj.qdturing.cn/user/126) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 |  [李宸朗 (lcl000000)](https://oj.qdturing.cn/user/427) | 1932 | | | 5 |  [仇子期 (sevenqiu)](https://oj.qdturing.cn/user/1104) | 1875 | 我是个老六 我爱蛋仔 | | 6 |  [张熠瑾 (WCD.ZYJ)](https://oj.qdturing.cn/user/76) | 1861 | | | 7 |  [臧宇轩 (NaCl\_Fish)](https://oj.qdturing.cn/user/61) | 1809 | [CSDN主页Link](https://blog.csdn.net/m0_62680538?type=blog) | | 8 |  [刘仕俊 (liushijun)](https://oj.qdturing.cn/user/898) | 1799 | ***Exploration Never Ends*** | | 9 |  [韩承昱 (saixingzhe)](https://oj.qdturing.cn/user/75) | 1783 | “是金子总会发光” “但如果没有光源，金子永远不会发光” # [HCOI 出题团]([https://www.luog](https://www.luog/)... | | 10 |  [马浩鸣 (mahaoming)](https://oj.qdturing.cn/user/129) | 1781 | 6…………？ | * [更多 >](https://oj.qdturing.cn/ranking) # 讨论 1. 0 评论 # [温度转换无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c9ff993cdee3b59700a#1713061023552) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 2. 0 评论 # [小明买水果五无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c6af993cdee3b596ee6#1713060970292) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 3. 0 评论 # [倒霉的小明（求解）](https://oj.qdturing.cn/discuss/661b3c3af993cdee3b596dba#1713060922702) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 4. 0 评论 # [小知识](https://oj.qdturing.cn/discuss/661a721bf993cdee3b587229#1713009179189) * [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) * 5 次查看 *  [姜宗何 (JZH) ](https://oj.qdturing.cn/user/1289)@ **16 小时前** 5. 2 评论 # [4月11日未来之星作业怎么写](https://oj.qdturing.cn/discuss/6619ef2387b210d79c0ddce4#1713006555814) * [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * 14 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **16 小时前** 6. 1 评论 # [string 怎么用getline](https://oj.qdturing.cn/discuss/661919bb87b210d79c0cf318#1712927819286) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [刘旭松 (LeoLiu) ](https://oj.qdturing.cn/user/685)@ **1 天前** 7. 0 评论 # [小游戏大全3](https://oj.qdturing.cn/discuss/6617ffee87b210d79c0c1e1b#1712848878082) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 31 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 8. 0 评论 # [小游戏大全2](https://oj.qdturing.cn/discuss/6617dbff87b210d79c0bea6a#1712839679686) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 26 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 9. 0 评论 # [小游戏大全](https://oj.qdturing.cn/discuss/6617da4b87b210d79c0be2bf#1712839243992) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 22 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 10. 0 评论 # [后悔吧，少年！](https://oj.qdturing.cn/discuss/6617ce2ae58c8dbba13e60bd#1712836138025) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 11. 0 评论 # [有可能让你后悔的东东](https://oj.qdturing.cn/discuss/6617b9cde58c8dbba13e1f9a#1712830925828) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 18 次查看 *  [黄新也 (Hxy0705) ](https://oj.qdturing.cn/user/1142)@ **2 天前** 12. 1 评论 # [通天塔](https://oj.qdturing.cn/discuss/6617a5e0e58c8dbba13de3f0#1712837968242) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 24 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 13. 1 评论 # [你好，王晨希](https://oj.qdturing.cn/discuss/6617a596e58c8dbba13de0b0#1712993715835) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [朱美菕 ](https://oj.qdturing.cn/user/1728)@ **20 小时前** 14. 2 评论 # [有没有养oc的交流一下](https://oj.qdturing.cn/discuss/6617a519e58c8dbba13dd66f#1712969817779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 13 次查看 *  [王晨希 (wangchenxi) ](https://oj.qdturing.cn/user/3394)@ **1 天前** 15. 3 评论 # [c++格式](https://oj.qdturing.cn/discuss/66179f19e58c8dbba13d4a05#1712992786779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 19 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **20 小时前** 16. 0 评论 # [114514114514](https://oj.qdturing.cn/discuss/66168bdee58c8dbba13be42a#1712753630359) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [高晨熙 (17362259026) ](https://oj.qdturing.cn/user/1224)@ **3 天前** 17. 0 评论 # [大佬们一看](https://oj.qdturing.cn/discuss/661681d5e58c8dbba13bba65#1712751061541) * [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/discuss/contest/66162df2e58c8dbba13af0c8) * 20 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 18. 1 评论 # [有大佬吗，点进来看看](https://oj.qdturing.cn/discuss/6616818ae58c8dbba13bb905#1712823743205) * [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/discuss/contest/66163ff3e58c8dbba13b068c) * 22 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 19. 0 评论 # [谁有空？](https://oj.qdturing.cn/discuss/661664ace58c8dbba13b6a4d#1712743596552) * [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) * 14 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 20. 1 评论 # [讨论](https://oj.qdturing.cn/discuss/661640ffe58c8dbba13b0a01#1712734472982) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 16 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **3 天前** * [更多 >](https://oj.qdturing.cn/discuss) # 一言 Cannot get hitokoto. # 最新题目 [**P1183** 【入门】友好数](https://oj.qdturing.cn/p/P1183)1 周前 [**zs024** 小Z的切除树](https://oj.qdturing.cn/p/zs024)1 周前 [**zs023** 小杨的旅游](https://oj.qdturing.cn/p/zs023)1 周前 [**zs022** 小S的子数组和](https://oj.qdturing.cn/p/zs022)1 周前 [**zs021** 小B的排列数组](https://oj.qdturing.cn/p/zs021)1 周前 [**zs020** 小A的排序数组](https://oj.qdturing.cn/p/zs020)1 周前 [**zs019** 迷宫统计](https://oj.qdturing.cn/p/zs019)1 周前 [**zs24414** 兑换货币](https://oj.qdturing.cn/p/zs24414)1 周前 [**zs24413** n重串](https://oj.qdturing.cn/p/zs24413)1 周前 [**zs24411** 讨伐巨龙的小队](https://oj.qdturing.cn/p/zs24411)1 周前 # 搜索 [ ] 搜索 # 讨论节点 * ## 探索 1. [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) 2. [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) 3. [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * ## 在线题库 1. [CodeForces](https://oj.qdturing.cn/discuss/node/CodeForces) 2. [TopCoder](https://oj.qdturing.cn/discuss/node/TopCoder) 3. [POJ](https://oj.qdturing.cn/discuss/node/POJ) 4. [BZOJ](https://oj.qdturing.cn/discuss/node/BZOJ) 5. [USACO](https://oj.qdturing.cn/discuss/node/USACO) 6. [RQNOJ](https://oj.qdturing.cn/discuss/node/RQNOJ) 7. [UOJ](https://oj.qdturing.cn/discuss/node/UOJ) 8. [LOJ](https://oj.qdturing.cn/discuss/node/LOJ) 9. [洛谷](https://oj.qdturing.cn/discuss/node/%E6%B4%9B%E8%B0%B7) * ## 泛 1. [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) 2. [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) 3. [Python](https://oj.qdturing.cn/discuss/node/Python) 4. [Julia](https://oj.qdturing.cn/discuss/node/Julia) 5. [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) 6. [保送](https://oj.qdturing.cn/discuss/node/%E4%BF%9D%E9%80%81) # 推荐 * ## 中文 1. [LibreOJ](https://loj.ac/) 2. [洛谷](https://www.luogu.com.cn/) 3. [UOJ](https://uoj.ac/) 4. [CometOJ](https://www.cometoj.com/) 5. [Vijos](https://vijos.org/) * ## English 1. [Codeforces](https://codeforces.com/) 2. [AtCoder](https://atcoder.jp/) 3. [CodeChef](https://www.codechef.com/) 4. [SPOJ](https://www.spoj.com/) 5. [TopCoder](https://www.topcoder.com/) 6. [OnlineJudge](https://onlinejudge.org/) * ## 工具 1. [OIerDb](https://oier.baoshuo.dev/) # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 38ms 13. Powered by [Hydro v4.11.2](https://hydro.js.org/) Community 在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。 我命由我不由天，吴钩弯，展锋寒。 红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！ 惊涛入海觅螭虎，风雪归山斩妖邪。 落峰长日坠，起笔叠嶂升。 [https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif) [https://neave.com/](https://neave.com/) [https://classic.minecraft.net/](https://classic.minecraft.net/) [http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/) [http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/) [https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound) [https://yiyan.baidu.com/](https://yiyan.baidu.com/) [https://www.bilibili.com/](https://www.bilibili.com/) [https://oj.qdturing.cn/first\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F) 1. 清平乐·村居 --- 【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。 --- 静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。 --- （上文：改编，下文:自编） --- 厕所🚾 半夜三更，厕所没灯。 你上厕所，掉进茅坑。 激烈斗争，壮烈牺牲。 为纪念你，厕所装灯。 --- ```none ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) 老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。 宝藏 ```none #include using namespace std; int main(){ system("A 10"); } ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) | 1 | 2 | 3 | | ------ | --- | --- | | baga | | | | [https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru) [https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna](https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna) [https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif) [https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le\_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873) [https://sr.mihoyo.com/](https://sr.mihoyo.com/) 我听到了【生生不息】的激荡，听到了【天行健】的回响，听到了【破万法】的回响，听到了【替罪】的回响，听到了【呼唤】的回响，听到了【离析】的回响，听到了【双生花】的回响，听到了【爆燃】的回响，听到了【强运】的回响，听到了【探囊】的回响，听到了【跃迁】的回响，听到了【劲风】的回响，听到了【传音】的回响，听到了【赤炎】的回响，听到了【不灭】的回响，听到了【激发】的回响，听到了【魂迁】的回响，听到了【灵嗅】的回响，听到了【夺魂魄】的回响。 4 已递交 4 已通过 0 题解被赞 # 状态 * [评测队列](https://oj.qdturing.cn/d/lixin3/record) * [服务状态](https://oj.qdturing.cn/d/lixin3/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/d/lixin3/api) # 支持 * [帮助](https://oj.qdturing.cn/d/lixin3/wiki/help) * [QQ 群](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/d/lixin3/wiki/about) 2. [联系我们](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/d/lixin3/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/d/lixin3/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 31ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community 14. [](https://oj.qdturing.cn/) 15. [首页](https://oj.qdturing.cn/d/lixin3/) 16. [题库](https://oj.qdturing.cn/d/lixin3/p) 17. [训练](https://oj.qdturing.cn/d/lixin3/training) 18. [比赛](https://oj.qdturing.cn/d/lixin3/contest) 19. [作业](https://oj.qdturing.cn/d/lixin3/homework) 20. [讨论](https://oj.qdturing.cn/d/lixin3/discuss) 21. [评测记录](https://oj.qdturing.cn/d/lixin3/record?uidOrName=2645) 22. [排名](https://oj.qdturing.cn/d/lixin3/ranking) 23.  **立新三年级** 24. [zhangyuxuan ](https://oj.qdturing.cn/d/lixin3/user/2645)  # 梁家硕 (梁家硕) UID: 1015, 注册于 **11 个月前**, 最后登录于 **1 天前**, 最后活动于 **4 分钟前**. 解决了 4 道题目，RP: 0 (No. ?) [ ](https://oj.qdturing.cn/d/lixin3/home/messages?target=1015)[]() * 个人简介 * 通过的题目 * 最近活动 * 最近编写的题解 * Stat * Rating [易起游 - 搜索 (bing.com)](https://cn.bing.com/search?q=%E6%98%93%E8%B5%B7%E6%B8%B8&gs_lcrp=EgZjaHJvbWUqBwgAEEUYwgMyBwgAEEUYwgMyBwgBEEUYwgMyBwgCEEUYwgMyBwgDEEUYwgMyBwgEEEUYwgMyBwgFEEUYwgMyBwgGEEUYwgMyBwgHEEUYwgPSAQsxNzAzOTYzajBqNKgCCLACAQ&FORM=ANAB01&PC=EDGEDBB) 【cn.bing.com】易起游 👍 👎 🚀️ ```none "messages":{},"UiContext":{"cdn_prefix":"https://oj.qdturing.cn/","url_prefix":"/","ws_prefix":"/","nav_logo_dark":"/nav_logo_dark.png","constantVersion":"44739c75","domainId":"Y001","domain":{"_id":"Y001","lower":"y001","owner":3,"name":"于老师的python域","bulletin":"欢迎来到于老师的信息学竞赛预科班","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457"},"avatar":"qq:28015861","langs":"","share":""},"SWConfig":{"preload":"","hosts":["http://oj.qdturing.cn","https://oj.qdturing.cn","/","https://oj.qdturing.cn/"],"domains":[]}},"UserContext":"{\"_id\":1015,\"mail\":\"duVZICerlJNJ@hydro.local\",\"uname\":\"梁家硕\",\"hashType\":\"hydro\",\"priv\":4,\"regat\":\"2023-07-01T11:17:59.363Z\",\"loginat\":\"2023-11-10T08:00:10.057Z\",\"perm\":\"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\",\"scope\":\"BigInt::-1\",\"role\":\"stu\",\"domains\":[{\"_id\":\"Y001\",\"lower\":\"y001\",\"owner\":3,\"name\":\"于老师的python域\",\"bulletin\":\"欢迎来到于老师的信息学竞赛预科班\",\"roles\":{\"stu\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\",\"guest\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529\",\"default\":\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\"},\"avatar\":\"qq:28015861\",\"langs\":\"\",\"share\":\"\"}],\"tfa\":false,\"authn\":false,\"group\":[\"周日下午1点15班\",\"1015\"],\"viewLang\":\"zh\",\"skipAnimate\":true,\"timeZone\":\"Asia/Shanghai\",\"codeLang\":\"py.py2\",\"codeTemplate\":\"\",\"avatar\":\"gravatar:duVZICerlJNJ@hydro.local\",\"qq\":\"\",\"gender\":\"2\",\"bio\":\"👍 👎 🚀️ \\r\\n\",\"school\":\"青岛立新小学\",\"studentId\":\"2\",\"phone\":\"18669761025\",\"backgroundImage\":\"/components/profile/backgrounds/1.jpg\",\"unreadMsg\":0,\"pinnedDomains\":[\"Y001\"],\"fontFamily\":\"Open Sans\",\"codeFontFamily\":\"Source Code Pro\",\"preferredEditorType\":\"sv\",\"monacoTheme\":\"vs-light\",\"theme\":\"light\",\"showInvisibleChar\":false,\"formatCode\":true,\"realname\":\"梁家硕\",\"coin\":37200,\"displayName\":\"梁家硕\",\"nAccept\":124,\"nSubmit\":137,\"rp\":0,\"rpInfo\":{},\"level\":0,\"avatarUrl\":\"//sdn.geekzu.org/avatar/4779837f999db1fa2002860d3a781a04?d=mm&s=128\"}"} 会出现回收工厂个 ，看‘’vlx ‘’【】漂亮【】  ``` [Copy]() 普通输入 n=int(input()) 切片输入 ——，——=map(int,input().split()) 列表输入 a(list(map(int,input().split())) 连续输入 for i in range(0x3f3f3f3f): a=int(input()) 总会有地上的生灵，敢于直面雷霆的威 光 首发于[黑客工具](https://www.zhihu.com/column/c_1318154529670574080) 切换模式 写文章 登录/注册  # 这3个黑科技网站，让你秒变”黑客“ [](https://www.zhihu.com/people/an-wang-hei-ke) [小道hack](https://www.zhihu.com/people/an-wang-hei-ke) > 来源：码农学习联盟 想要了解全球被黑客攻击的情况吗？ 想体验下电影上黑客使用的骚操作吗？ 又或者一键生成高逼格背景？ 小编刚开始看到的时候就觉得很神奇，还有这种神奇的网站？ 一起来探索下吧！  **一.geektyper（模拟黑客）** 这是一款功能强大的黑客模拟软件，它可以模拟电影上那种黑客操作电脑的过程，包括敲代码以及出现各种高大上的弹窗，并且可以自定义代码颜色、背景以及Logo图案 不知道你们看电影的时候，看到那种黑客操作系统，敲击键盘时电脑上飞速旋转一些数据，感觉是不是帅爆了，有一种让你也想成为一名黑客的感觉， 这个软件就可以满足你，十足的“撩妹神器”好吗！  **1、先打开安装好的geektyper** 在主界面上我们可以看到左上方的操作提示和右侧的功能按钮。 刚开始使用大家可能有点懵圈，我们可以按照提示点击“F2”， 就可以弹出帮助界面，显示每个键的作用，就可以开始操作啦。  **2、右下角有一个“☰”按钮，点击它会进入设置界面** 你可以在里面对界面文字的色彩和格式进行修改。  **3、最后就是它最炫酷的功能了** 点击右上角的DL Data就会出现类似于电影里那种正在下载的界面， 其他也是点击之后出现各种数据展现，而且你还可以敲代码， 这时候你就像是一个黑客在操作各种系统，超炫酷好吗！  ## **2.CYBERMAP** 网址： [https://\*\*cybermap.kaspersky.com/\*\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat) 这个网站是一个可以“实时展示全球恶意攻击”的网站， 你可以很直观的看到全球黑客的实时攻击活动情况， 这个网站真的做的很炫酷，让你看一眼就爱上他 因为是国外的网站，所以大家去搜索的时候可以使用Google浏览器，国内的浏览器可能搜不到，小编用的是Google，上个动图大家感受下它的炫酷。  **1、数据来源** 想要了解他这些数据收集这么来的，可以看到界面上有一个数据来源，都有很清楚的数据分析。  **2、选择国家** 这是一个“实时展示全球恶意攻击”的网站，所以你可以选择你想要看的国家目前所受的攻击。  ## **三.Stars-Emmision** 网址： [https://**wangyasai.github.io/Sta**rs-Emmision/](https://link.zhihu.com/?target=https%3A//wangyasai.github.io/Stars-Emmision/) 一款比名字更加浮夸的生成器，可以一键生成小米海报这种背景效果，大大节省设计时间啊， 它与星星有关，是一款放射图片生成网站，犹如无数的流星雨正向你扑面而来，在线制作粒子散射，效果极为震撼啊！ 一般这种效果是在AI里面制作出来的，在这里直接生成，惊不惊喜，意不意外？  1、进入网站界面右上角是可以调节参数的，虽然都是英文，但是都是比较简单的，小编都能看懂，你们肯定都OK啊  有一个Color1和Color2，这两个是可以更换成自己喜欢的颜色的。  2、在“Direction”里面是可以调节粒子的范围的，看你比较喜欢那种可以自由更换。  最后调整完成，可以下载保存下来，比如可以放进PPT里也是一个不错的选择，又或者可以用GIF录制工具，把它录制成一个动态背景，也是美轮美奂啊。 今天跟大家分享的跟以往不一样，可能我们不需要经常用到，但是装装逼也是很好的啊，逼格满满好吗，小编刚开始看到是时候就觉得很神奇啊，瞬间心动，就分享给你们啦  [在线黑客模拟攻击演示 (tonghei.com)](https://hackcode.tonghei.com/hacker/)   for i in range(True): m=str(input("姓名：")) n=int(input("你的年份：")) y=int(input("你的月份：")) r=int(input("你的日期：")) x=str(input("你的星座：")) print(n,"年",end=" ") print(y,"月",end=" ") print(r,"日") print(x) d=str(input("你的爱好：")) if d=="篮球" or d=="足球" or d=="羽毛球": print("阳光开朗大男孩") elif d=="编程": print("黑客") elif d=="枪": print("狙击之王") else: print("其他") w=int(input("你平时的自我打分：")) if w=60 and w=70 and w=80 and w<=100: print("优秀") aw=str(input("你的学校：")) aq=int(input("期中成绩：")) am=int(input("期末成绩：")) if am == 0 and aq == 0: print("你在",aw,"无","无") if am!=0 and aq==0: print("你在",aw,am,"无") if am==0 and aq!=0: print("你在",aw,"无",aq) print("你所有的东西已经全部测试完！") print("！！！加油！！！") 洛谷 /\*评测状态 Waiting 评测：评测请求正在等待被评测机抓取 Fetched 评测：评测请求已被评测机抓取，正在准备开始评测 Compiling 评测：正在编译中 Judging 评测：编译成功，正在评测中 Accepted 通过：程序输出完全正确 Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） Time Limit Exceeded 不通过：程序运行时间超过了题目限制 Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制 Runtime Error 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等） Compile Error 不通过：编译失败 System Error 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈） Canceled 其他：评测被取消 Unknown Error 其他：未知错误 Ignored 其他：被忽略 有“成绩取消”字样则说明管理员手动标记此记录为取消，可能违反了服务条款，比如代码被发现与其他用户的代码十分相似。 sqrt(n); i\*i<=n; 编译错误 可能有以下情况： 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 5. \_\_int64 在 GNU C++ 中应写成 long long 类型 6. main() 返回值必须定义为 int ，而不是 void 7. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 8. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 9. printf 中使用 %lf 格式是不正确的 世界上最遥远的距离不是生与死，而是你亲手制造的BUG就在你眼前，你却怎么都找不到她。 AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 PC=Perfect Compile=完美的编译 RE=Run Excellently=完美运行 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 OLE=Output Limit Enough=输出合法 CE=Compile Easily=轻松通过编译 UKE=Unbelievably Keep Enough Score=难以置信地保持足够的分数 AU=All Unaccepted=全都不正确 按照赛制不同，有不同的递交、排名规则。 OI 赛制所有题目均以最后一次递交为准，特别地，请避免编译错误。 OI 赛制排名规则为：总分高的排在前面，总分相等则排名相同。 ACM/ICPC 赛制所有题目递交后立即评测，以是否通过为准。 ACM/ICPC 赛制排名规则为：通过题目数多的排在前面，通过题目数相同的做题耗时（含罚时）少的排在前。 乐多 赛制下，选手可以多次提交一道题目，并获得实时评测结果。 乐多 赛制下，多次提交会导致选手的得分被扣除，排行榜将显示用户的最高得分。 乐多 赛制下，每道题的最终得分为:s\*max(0.95^n,0.7).s,n分别代表本次得分和本次提交前的尝试次数。 乐多 排名规则为：按照如上规则折算后的分数从高到低排名。 IOI(严格) 赛制下，不同于IOI赛制，排行榜将被关闭至比赛结束。 IOI(严格) 赛制下，每道题的排行榜得分将为用户每个子任务在所有提交中的最大得分的和。 时间与空间限制以题目说明为准，默认限制参见限制。 1. 递交时选错了编程语言 2. Java 的主类名没有使用 "Main" 3. 对于 C/C++：见下 4. 一般性的编译错误 对 C/C++ 选手的特别提醒： 1. \_\_int64 在 GNU C++ 中应写成 long long 类型 2. main() 返回值必须定义为 int ，而不是 void 3. for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效 4. itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数） 5. printf 中使用 %lf 格式是不正确的 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 爆零是一种宿命，WA是一种绝望 TLE是一种痛苦，RE是一种放弃 UKE是一种无奈，AC是一种原谅 AK是一种幻想，弃赛是一种颓废 吊打是一种必然，进队是一种奢望 #模拟只会猜题意，贪心只能过样例 数学上来先打表，ＤＰ一般看规律 组合数学靠运气，计算几何瞎暴力 #图论强行套模板，数论只会ＧＣＤ #递归递推伤不起，搜索茫然ＴＬＥ 分治做得像枚举，暴力枚举数第一 数据结构干瞪眼，怒刷水题找信心 涨姿势也不容易，考试一来全懵逼 暴力出奇迹，骗分过样例。 数学先打表，ＤＰ看运气。 穷举ＴＬＥ，递推ＵＫＥ。 模拟ＭＬＥ，贪心还ＣＥ。 #想要骗到分，就要有方法。 图论背模板，数论背公式。 动规背方程，高精背代码。 如果都没背，干脆输样例。 模拟定想全，动规定找对。 贪心定证明，二分LM+1。 宜考NOIP , 小心别爆零.] 骗分过样例，暴力出奇迹。 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，GM=gR方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b方减去4ac。 瀚海阑干百丈冰，酸脱羟基醇脱氢 西江月·夜行OI道中 明月AC惊鹊， RE半夜鸣蝉。 稻花香里说丰年， 听取WA声一片。 七八个TLE， 两三点MLE。 旧时茅店社林边， 路转CE忽见。 生命的意义? 如果26个英文字母 A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z 分别等于 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26 那么： 获得知识,Knowledge =K+N+O+W+L+E+D+G+E =11+14+15+23+12+5+4+7+5 =96% 努力工作，Workhard =W+O+R+K+H+A+R+D =23+15+18+11+8+1+18+4 =98% 也就是说知识和努力工作，对我们人生的影响，可以达到96%和98%。 好运,Luck =L+U+C+K= 12+21+3+11= 47% 爱情,Love =L+O+V+E =12+15+22+5 =54% 看来，这些我们通常认为重要的东西 却并没起到最重要的作用。 那么， 什么可以决定我们100％的人生呢？ 是Money（金钱）吗？ =M+O+N+E+Y =13+15+14+5+25 =72% 看来也不是。 是Leadership (领导能力)吗？ =L+E+A+D+E+R+S+H+I+P =12+5+1+4+5+18+19+9+16 =89% 还不是。 金钱，权力也不能完全决定我们的生活。 那是什么呢？其实， 真正能使我们生活圆满的东西就在我们的 代码里面！ 输入输出流头文件,iostream =I+O+S+T+R+E+A+M =9+15+19+20+18+5+1+13 =100% 所以坚持写代码吧… 各种老师一回头 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 所有头文件: 1.首先是最方便的万能头文件，顾名思义，可以将其理解为父亲头文件 （虽然方便了懒人，但是缺点也很明显--这一头文件很占用内存）： #include 2.接着也是比较常用的，作用于数据流输入输出 cin>>和cout<<： #include 3.然后是各种算法的头文件(例如sort函数等)： #include 4.关于数学函数的头文件（例如max( )，min( )，abs( )等）（从C语言中的math.h继承而来）： #include 5.string字符串头文件： #include 6.接着是C语言的头文件： #include 7.普通队列(只能一边进一边出)(先进先出)的头文件： #include 8.双向队列(两边都可以进出)(先进先出)的头文件： #include 9.栈(先进后出，后进先出)的头文件： #include 10.列表的头文件： #include 11.动态数组(不需知道该数组的数量)的头文件: #include 12.图的头文件： #include 13.集合(内部自动有序且不含重复元素)的头文件： #include 14.控制电脑或小黑框头文件(不包含在万能头件)： #include 数学是火，点亮物理的灯； 物理是灯，照亮化学的路； 化学是路，通向生物的坑； 生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯； 历史是灯，照亮社会之路； 社会是路，通向哲学大坑； 哲学是坑，埋葬文科生。 班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀XXX 鼓起勇气敲起这键盘 只因为有你在 无向图，是否明白 害羞的我，说不出的爱 我也曾四处漂泊流浪 为求单元短路 直到我蓦然回首时 瞥见你复杂模样 提交一次一次一遍一遍 巡查于OJ 只为了AC出现 如何卡进超限时间 增广路止不住求最大流 深广把图搜 手敲着小小的键盘 没人陪在我左右 套用心爱的线段树 仿佛AC了全OJ 想要评测机了解 这AK的感觉 一个人的优化那网络流 明明想AC却超时超空 虽然我的常数可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 写着n方n三的暴力 形单影只的我 任BUG将我剥落 一声叹息只能打表 我也想打到那集训队 给自己骗点分 任巨佬如此强大 又何处能够骗到分 OI总有许多挫折 请坚定自己的选择 即使在难过时刻 也要把代码写 一个人的优化那网络流 明明想AC却超时超空 虽然我的实力可能不太够 有谁能懂我温柔 做一棵平衡树随数旋转 又回溯最初的根节点 后来我才卡进这就是你想要的时限 那么默默爆零是我给你最后的温柔 为你写起这代码 这是鬼畜的风格 就算超时又如何 只想带给你AC 为你我努力刷题写dp 感谢你们的关注 就算明天for循环重复 有了陪伴就不孤独 --- 咬下一口我的快速幂吧 尝尽这测评的A(C) WA T(LE) R(E) 身在文化课的OIer们啊 不要忘记你代码 也许对这世界有着无奈 已不再是那一个蒟蒻 即使NOIP爆零也要学会去承担 有了算法陪伴我已不再会孤单 你们的鼓励在我的心中永不会消散 # [家长直呼太暴力！这些算法可能会被删除](https://www.cnblogs.com/wlzhouzhuan/p/15344765.html) 近日，洛谷网络科技有限公司多位用户家长向 https://www.luogu.com.cn/user/1 儿童的因素出现，要求对相关算法进行整改或被删除。 洛谷网络科技有限公司题目组管理员在接受采访时说道，在最近几天内，洛谷收到了数十条家长来信，声称网站教授的部分算法存在“血腥”、“暴力”等内容。“他们说这些东西会教坏他们家的孩子，要求我们整改这些算法，把这些对小朋友不太好的东西删掉，或者直接把算法删除。” 随着国庆 (雾) 的到来，很多家长直接来到洛谷反映情况。记者在现场随机采访了几位家长，询问他们对这些算法的看法。 刘女士的儿子正在洛谷学习普及组内容。在采访中刘女士告诉记者，希望洛谷停开**匈牙利算法**。“我看里面讲的都是些一一匹配啊、二分图啊之类的匹配问题，**这不是教孩子怎么找npy么？那他以后岂不是学会早恋了？**”王先生也有类似的想法。他要求洛谷整改**月赛**内容。“**听说课程里面有‘选妹子’，要是小朋友被女拳打了该怎么办？**太危险了！” 认为数据结构太危险、容易伤到孩子，是很多家长的共同心声。王大爷今年已经六十多岁了，却依然专程跑到学校，高呼停止教授**Splay树**和**Treap树**。他说，**自家的孙子很小的时候撞到树上过，他担心这两棵树会给孩子造成心理阴影。** 此外，**最大流**、**费用流**等算法也遭到了部分家长的抵制。“主要还是玩水安全嘛”，陈女士说，“孩子们看到这些流啊、流量啊、回家就很可能会下水去游泳，我们当家长的还是不放心嘛。”而张先生的态度则更为坚决：“\*\*现在就敢玩水，将来敢玩什么，我都不敢想了！\*\*” 同样作为算法，**《深入浅出程序设计竞赛》**受到抵制的理由则有很大不同。吴先生告诉记者：“主要是，这个（深入浅出程序设计竞赛的教材）太厚了，得有好几斤重，**网上小孩子如果嬉戏打闹，拿着这本书到处乱甩（的话），非常危险。**要是碰到头的话，那肯定会把头磕破的，你说这个责任由谁来承担？” 在众多算法中，家长抵制呼声最高的则是图论算法。在家长看来，有的算法要找环，会绕晕到孩子；画图用的笔可能会戳伤手指；很多算法在搜索的时候可能会把系统栈用爆；有些算法写错了要输中量参解改很久，可能会累到小朋友，“\*\*把我家小孩累死了该怎么办？\*\*” 除了担心孩子们的安全外，对孩子生活习惯的影响也成为了家长们抵制课程的要素之一。叶女士告诉记者，她希望洛谷整改全部英语题面。叶女士的儿子才考普及组，却已经学会了sh\*t，f\*\*k等高级词汇。“孩子现在出口就是这种词，影响很不好，肯定是洛谷的题面教的。”叶女士说。 同样，李先生对于洛谷的bfs, dfs, bdfs算法也颇有微词。“我们还是想给孩子营造一个健康的成长环境嘛，我看课上，居然让小朋友们去暴力遍历图啊、暴力找答案啊，这不是教小朋友们暴力么？\*\*平时打打杀杀的动画片我都不让自家小孩看，更不要说动手去做这些了。\*\*” 此外，一些非盈利机构也遭到了家长的抵制。很多家长认为，玩电脑是影响自家小孩学习的关键原因，因此强烈要求洛谷取缔 **F ，并取消相关竞赛。 **N\*\*P** 首当其冲，周先生接受采访时说道：“听说这门课要学生们自己学习算法，要是真把算法学好了，不就会有更多小朋友沉迷电脑么？**如果他们不学算法的话，我们的小孩就不会这么贪玩电脑了。**”同样，一些家长也对**浏览器**表示不满：“**没有浏览器，小朋友们自然就不会沉迷上网了。\*\*” 让记者感到惊奇的是，很多家长对一些计算机基础数学内容也有较大的意见。部分家长要求下架\*\*《组合数学》\*\* **《混凝土数学》**等课程。在问及原因时，家长告诉记者，**文中的感叹号很像一根棍子，会引发小朋友的暴力倾向。** 针对此事，记者尝试联络洛谷网络科技有限公司的管理员。管理员回复称， https://www.luogu.com.cn/user/1 不过，也有少数家长对一些算法表示支持。一位家长告诉记者，希望学校着力建设《编程语言基础》课程。“\*\*孩子如果在学校学好语言这些东西的话，回让他搬砖的时候应该能更好一些。\*\*” import turtle import time print('欢迎使用PY-C语言!') print('Py-C with IDLE!') print('Py-C (0.7.6)\*') n=input() if n=='int tuple(); and ():': print('int ();') p=input() if p=='text(up and (-1)down):': print('text open!') q=input('无用') b=input() if b=='pwrnbnt[nt()>x]': q=input('有用') print(q) time.sleep(2) elif n=='bl prt; and ();': print('qwerty(print()):!') w=input() a=input('无用输入') if w=='bl': t=input('输入变量') b=t u=input() if u=='prt(bl[itntgujhy]-(a))': print(b) time.sleep(2) elif n=='range[q,w,e,r,t,y]another();': print('range[print()]!;') p=input() if p=='range:': s=input() if s=='print(i,i,i);': m=int(input()) for i in range(1,m+1): print(i) time.sleep(2) elif n=='range(u,i,o,p,[,])out():': print('倒序排列') v=input() if v=='()\_xtange[],end={x-1(got[0])}': g=int(input()) for i in range(g,0,-1): print(i) time.sleep(2) elif n=='if [1;2:{x-y}+(a)];': print('if please to print()!;') f=input() if f=='if prt(); and: or(123);': h=int(input()) print(h) time.sleep(2) elif f=='input(1*2)if and if(to);': j=input() y=input() if j==y: print(j) time.sleep(2) elif n=='if [1;2{1234}to(12345[x])=="y"];': print('if and else to print()!;') u=input() if u=='input(1*2) if and if(to); and eles to and if (print(123)):': q=int(input()) w=int(input()) if q==w: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n=='a,b==int(input(2))} and while and to {12qwerty}-(a) print(a);': a=int(input()) b=int(input('不要是太大的数')) while a>b: print(a) a+=1 time.sleep(2) elif n=='list{x+i}[c-a] num to sum();': q=list(map(int,input().split())) print(sum(q)) time.sleep(2) elif n=='list{x+n}[c+a] num to del [1];': q=list(map(int,input('请输入一个列表').split())) q.pop(1) print(q) time.sleep(2) elif n=='list{x+n}bnt and (): to list and list()do not remove();': q=list(map(int,input('請輸入一個列表').split())) print(q[len(q)-1]) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and no more': q=list(map(int,input('请输入一个列表').split())) q.append(1) print(q) time.sleep(2) elif n=='list{x+e}btt and (or a+1): to list and out to do append() and a bl to print():': q=list(map(int,input('请输入一个列表').split())) t=input() q.append(t) print(q) time.sleep(2) elif n=='tuple() to do a d(ipt);': print('tuple is open!') d=tuple(input("一个元组")) q=input() if q=='prt this tuple();': print(d) time.sleep(2) elif q=='exit,end={exit()};': exit() elif n=='exit() to exit();': exit() elif n=='*mt*:electronic calculator;': n1=int(input('a number')) s1=input('a symbol') n2=int(input('a number')) if s1=='+': print(n1+n2) elif s1=='-': print(n1-n2) elif s1=='*': print(n1*n2) elif s1=='/': print(n1/n2) elif s1=='//': print(n1//n2) elif s1=='%': print(n1%n2) elif n=='*mt*:turtle drew;': n=int(input('次数')) for i in range(1,n+1): a=input('a cmd') if a =='turtle.qdesgforward(100);': turtle.forward(100) elif a=='turtle.qhhjaudbnsuleft(90);': turtle.left(90) # 看完md语法记得回来！！文章末尾有彩蛋！！md语法放这里了： # [Markdown 语法---戳我跳转](https://blog.csdn.net/qcx321/article/details/53780672) # 写题格式：： ```none markdown //'#'和文字中间有空格！！ //正确示范：# 题目描述 //错误示范：#题目描述 # 题目背景(若果有需要能写上) 输入你想说的（注意跟背景有关) # 题目描述 发挥你的想象(不要把输入输出格式说了， 只说代码需解决的功能就可以啦！） # 输入格式 输入共$输入行数$……………… # 输出格式 输入共$输出行数$……………… # 输入输出样例 ## 输入样例 \```input1 …………………… \``` ## 输出样例 \```output1 …………………… \``` ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) 最后写题推荐在[HydroOJ](https://hydro.ac/)上面写题，一步一步慢慢来： 第一步）创建方法：[域创建教程](https://hydro.ac/discuss/6172ceeed850d38c79ae18f9) 第二步）使用方法：自己用Github账号创一个自己的域，体验一把当管理员的爽！建好域后，点到题库，右侧菜单栏选"创建题目"，在里面你可以现写markdown，还记得文章开始那个链接吗？用里面的语法把你想要的东西呈现出来就好啦！！ [训练 - Turing (qdturing.cn)](https://oj.qdturing.cn/d/W0001/training) [https://oj.qdturing.cn/d/system/](https://oj.qdturing.cn/d/system/) '''  ```none :: :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) ```none \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430) [https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092) [https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014) [https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015) # 泰拉瑞亚\~     [https://oj.qdturing.cn/user/362](https://oj.qdturing.cn/user/362) [https://oj.qdturing.cn/user/27](https://oj.qdturing.cn/user/27)    # 比赛 1. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/contest/66163ff3e58c8dbba13b068c) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 45 2. **10** **2024-4** # [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/contest/66162df2e58c8dbba13af0c8) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * 600 小时 * 25 3. **31** **2024-3** # [图灵三月月赛 - 提高组 赛题](https://oj.qdturing.cn/contest/66092cff2faa61e7f72a9727) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * 2 小时 * 23 4. **6** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2](https://oj.qdturing.cn/contest/65c10bf5c82e8ec49fdfee00) * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm) * Rated * 3 小时 * 28 5. **8** **2023-7** # [2023.7.8 青岛市图灵编程杯 周赛](https://oj.qdturing.cn/contest/64a8ca1289a4167efe646520) * [IOI](https://oj.qdturing.cn/contest?rule=ioi) * Rated * 5 小时 * 6 * [更多 >](https://oj.qdturing.cn/contest) # 作业 1. **21** **2024-2** # [2024 新春贺岁 思维模拟赛 div.2 补题场](https://oj.qdturing.cn/homework/65c2e34cc82e8ec49fe0b120) * 状态: 已结束 * 开始时间: **2 个月前** * 最终截止时间: **1 个月前** 2. **28** **2023-7** # [2023.6.10 青岛市图灵编程杯 周赛补赛](https://oj.qdturing.cn/homework/648985663d3f34cb2cb71939) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **8 个月前** 3. **30** **2023-6** # [2023.5.27 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/64780c42f428fb2d18a6d008) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 4. **30** **2023-6** # [2023年 市北区区赛 - 初中组补题场](https://oj.qdturing.cn/homework/645de3a2eb77954a9afa5a27) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 5. **30** **2023-6** # [2023年 市北区区赛 - 小学组补题场](https://oj.qdturing.cn/homework/645ddfd2eb77954a9afa56b5) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **9 个月前** 6. **29** **2023-6** # [2023.6.3 青岛市图灵编程杯 周赛 补赛](https://oj.qdturing.cn/homework/64803c5aa3c4b799f61a0e42) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **9 个月前** 7. **5** **2023-6** # [2023.5.20 青岛市图灵编程杯 周赛 补题场](https://oj.qdturing.cn/homework/646994197e384d7c1691ff34) * 状态: 已结束 * 开始时间: **10 个月前** * 最终截止时间: **10 个月前** 8. **25** **2023-5** # [2023.4.22 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/64488cd3b4bcd970abf6dff1) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **10 个月前** 9. **7** **2023-5** # [2023.4.29 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/644d0555604717e00720f3ce) * 状态: 已结束 * 开始时间: **11 个月前** * 最终截止时间: **11 个月前** 10. **29** **2023-4** # [2023.3.25 青岛市图灵编程杯 周赛补题场](https://oj.qdturing.cn/homework/641d43a8453064be228e37b2) * 状态: 已结束 * 开始时间: **1 年前** * 最终截止时间: **11 个月前** * [更多 >](https://oj.qdturing.cn/homework) # 训练 1. 351 已参加 # [测试专用训练](https://oj.qdturing.cn/training/6477fcfbf428fb2d18a6cd82) 测试专用训练,用于新生测试 * 5 小节, 61 道题 * **已完成 0%** * [更多 >](https://oj.qdturing.cn/training) # Ranking | 排名 | 用户名 | RP | 个人简介 | | ------ | -------- | ---- | ---------- | | 1 |  [王泳权 (Wf\_yjqd)](https://oj.qdturing.cn/user/58) | 2225 | 我就看不打比赛多久能掉下 Rank 1 | 拜月 | RiOI | 菜狗 | lyhtql！| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 |  [原梓恒 (yzh\_tcl)](https://oj.qdturing.cn/user/157) | 1949 | 李逸航和王泳权说了，他们只需要略微出手，就已知这个分段的极限了 | | 3 |  [李安 (Andy\_Li)](https://oj.qdturing.cn/user/126) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 |  [李宸朗 (lcl000000)](https://oj.qdturing.cn/user/427) | 1932 | | | 5 |  [仇子期 (sevenqiu)](https://oj.qdturing.cn/user/1104) | 1875 | 我是个老六 我爱蛋仔 | | 6 |  [张熠瑾 (WCD.ZYJ)](https://oj.qdturing.cn/user/76) | 1861 | | | 7 |  [臧宇轩 (NaCl\_Fish)](https://oj.qdturing.cn/user/61) | 1809 | [CSDN主页Link](https://blog.csdn.net/m0_62680538?type=blog) | | 8 |  [刘仕俊 (liushijun)](https://oj.qdturing.cn/user/898) | 1799 | ***Exploration Never Ends*** | | 9 |  [韩承昱 (saixingzhe)](https://oj.qdturing.cn/user/75) | 1783 | “是金子总会发光” “但如果没有光源，金子永远不会发光” # [HCOI 出题团]([https://www.luog](https://www.luog/)... | | 10 |  [马浩鸣 (mahaoming)](https://oj.qdturing.cn/user/129) | 1781 | 6…………？ | * [更多 >](https://oj.qdturing.cn/ranking) # 讨论 1. 0 评论 # [温度转换无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c9ff993cdee3b59700a#1713061023552) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 2. 0 评论 # [小明买水果五无输入版（求解）](https://oj.qdturing.cn/discuss/661b3c6af993cdee3b596ee6#1713060970292) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 3. 0 评论 # [倒霉的小明（求解）](https://oj.qdturing.cn/discuss/661b3c3af993cdee3b596dba#1713060922702) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 2 次查看 *  [强铭轩 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 小时前** 4. 0 评论 # [小知识](https://oj.qdturing.cn/discuss/661a721bf993cdee3b587229#1713009179189) * [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) * 5 次查看 *  [姜宗何 (JZH) ](https://oj.qdturing.cn/user/1289)@ **16 小时前** 5. 2 评论 # [4月11日未来之星作业怎么写](https://oj.qdturing.cn/discuss/6619ef2387b210d79c0ddce4#1713006555814) * [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * 14 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **16 小时前** 6. 1 评论 # [string 怎么用getline](https://oj.qdturing.cn/discuss/661919bb87b210d79c0cf318#1712927819286) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [刘旭松 (LeoLiu) ](https://oj.qdturing.cn/user/685)@ **1 天前** 7. 0 评论 # [小游戏大全3](https://oj.qdturing.cn/discuss/6617ffee87b210d79c0c1e1b#1712848878082) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 31 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 8. 0 评论 # [小游戏大全2](https://oj.qdturing.cn/discuss/6617dbff87b210d79c0bea6a#1712839679686) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 26 次查看 [https://neave.com/\`\`\`](https://neave.com/%60%60%60) 游戏 [https://classic.minecraft.net/](https://classic.minecraft.net/) 游戏\*2 [https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif) *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 9. 0 评论 # [小游戏大全](https://oj.qdturing.cn/discuss/6617da4b87b210d79c0be2bf#1712839243992) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 22 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 10. 0 评论 # [后悔吧，少年！](https://oj.qdturing.cn/discuss/6617ce2ae58c8dbba13e60bd#1712836138025) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 11. 0 评论 # [有可能让你后悔的东东](https://oj.qdturing.cn/discuss/6617b9cde58c8dbba13e1f9a#1712830925828) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 18 次查看 *  [黄新也 (Hxy0705) ](https://oj.qdturing.cn/user/1142)@ **2 天前** 12. 1 评论 # [通天塔](https://oj.qdturing.cn/discuss/6617a5e0e58c8dbba13de3f0#1712837968242) * [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) * 24 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **2 天前** 13. 1 评论 # [你好，王晨希](https://oj.qdturing.cn/discuss/6617a596e58c8dbba13de0b0#1712993715835) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 14 次查看 *  [朱美菕 ](https://oj.qdturing.cn/user/1728)@ **20 小时前** 14. 2 评论 # [有没有养oc的交流一下](https://oj.qdturing.cn/discuss/6617a519e58c8dbba13dd66f#1712969817779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 13 次查看 *  [王晨希 (wangchenxi) ](https://oj.qdturing.cn/user/3394)@ **1 天前** 15. 3 评论 # [c++格式](https://oj.qdturing.cn/discuss/66179f19e58c8dbba13d4a05#1712992786779) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 19 次查看 *  [崔竣皓 ](https://oj.qdturing.cn/user/1806)@ **20 小时前** 16. 0 评论 # [114514114514](https://oj.qdturing.cn/discuss/66168bdee58c8dbba13be42a#1712753630359) * [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) * 17 次查看 *  [高晨熙 (17362259026) ](https://oj.qdturing.cn/user/1224)@ **3 天前** 17. 0 评论 # [大佬们一看](https://oj.qdturing.cn/discuss/661681d5e58c8dbba13bba65#1712751061541) * [2022-2023年市北区区赛历年真题 - 初中组](https://oj.qdturing.cn/discuss/contest/66162df2e58c8dbba13af0c8) * 20 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 18. 1 评论 # [有大佬吗，点进来看看](https://oj.qdturing.cn/discuss/6616818ae58c8dbba13bb905#1712823743205) * [2022-2023年市北区区赛历年真题 - 小学组](https://oj.qdturing.cn/discuss/contest/66163ff3e58c8dbba13b068c) * 22 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **2 天前** 19. 0 评论 # [谁有空？](https://oj.qdturing.cn/discuss/661664ace58c8dbba13b6a4d#1712743596552) * [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) * 14 次查看 *  [孙贞烜 ](https://oj.qdturing.cn/user/1459)@ **3 天前** 20. 1 评论 # [讨论](https://oj.qdturing.cn/discuss/661640ffe58c8dbba13b0a01#1712734472982) * [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) * 16 次查看 *  [陈昱汀 ](https://oj.qdturing.cn/user/3037)@ **3 天前** * [更多 >](https://oj.qdturing.cn/discuss) # 一言 Cannot get hitokoto. # 最新题目 [**P1183** 【入门】友好数](https://oj.qdturing.cn/p/P1183)1 周前 [**zs024** 小Z的切除树](https://oj.qdturing.cn/p/zs024)1 周前 [**zs023** 小杨的旅游](https://oj.qdturing.cn/p/zs023)1 周前 [**zs022** 小S的子数组和](https://oj.qdturing.cn/p/zs022)1 周前 [**zs021** 小B的排列数组](https://oj.qdturing.cn/p/zs021)1 周前 [**zs020** 小A的排序数组](https://oj.qdturing.cn/p/zs020)1 周前 [**zs019** 迷宫统计](https://oj.qdturing.cn/p/zs019)1 周前 [**zs24414** 兑换货币](https://oj.qdturing.cn/p/zs24414)1 周前 [**zs24413** n重串](https://oj.qdturing.cn/p/zs24413)1 周前 [**zs24411** 讨伐巨龙的小队](https://oj.qdturing.cn/p/zs24411)1 周前 # 搜索 [ ] 搜索 # 讨论节点 * ## 探索 1. [问答](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94) 2. [分享](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB) 3. [题解](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3) * ## 在线题库 1. [CodeForces](https://oj.qdturing.cn/discuss/node/CodeForces) 2. [TopCoder](https://oj.qdturing.cn/discuss/node/TopCoder) 3. [POJ](https://oj.qdturing.cn/discuss/node/POJ) 4. [BZOJ](https://oj.qdturing.cn/discuss/node/BZOJ) 5. [USACO](https://oj.qdturing.cn/discuss/node/USACO) 6. [RQNOJ](https://oj.qdturing.cn/discuss/node/RQNOJ) 7. [UOJ](https://oj.qdturing.cn/discuss/node/UOJ) 8. [LOJ](https://oj.qdturing.cn/discuss/node/LOJ) 9. [洛谷](https://oj.qdturing.cn/discuss/node/%E6%B4%9B%E8%B0%B7) * ## 泛 1. [数学](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6) 2. [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B) 3. [Python](https://oj.qdturing.cn/discuss/node/Python) 4. [Julia](https://oj.qdturing.cn/discuss/node/Julia) 5. [游戏](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F) 6. [保送](https://oj.qdturing.cn/discuss/node/%E4%BF%9D%E9%80%81) # 推荐 * ## 中文 1. [LibreOJ](https://loj.ac/) 2. [洛谷](https://www.luogu.com.cn/) 3. [UOJ](https://uoj.ac/) 4. [CometOJ](https://www.cometoj.com/) 5. [Vijos](https://vijos.org/) * ## English 1. [Codeforces](https://codeforces.com/) 2. [AtCoder](https://atcoder.jp/) 3. [CodeChef](https://www.codechef.com/) 4. [SPOJ](https://www.spoj.com/) 5. [TopCoder](https://www.topcoder.com/) 6. [OnlineJudge](https://onlinejudge.org/) * ## 工具 1. [OIerDb](https://oier.baoshuo.dev/) # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 38ms 13. Powered by [Hydro v4.11.2](https://hydro.js.org/) Community 在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。 我命由我不由天，吴钩弯，展锋寒。 红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！ 惊涛入海觅螭虎，风雪归山斩妖邪。 落峰长日坠，起笔叠嶂升。 [https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif) [https://neave.com/](https://neave.com/) [https://classic.minecraft.net/](https://classic.minecraft.net/) [http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/) [http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/) [https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound) [https://yiyan.baidu.com/](https://yiyan.baidu.com/) [https://www.bilibili.com/](https://www.bilibili.com/) [https://oj.qdturing.cn/first\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F) 1. 清平乐·村居 --- 【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。 --- 静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。 --- （上文：改编，下文:自编） --- 厕所🚾 半夜三更，厕所没灯。 你上厕所，掉进茅坑。 激烈斗争，壮烈牺牲。 为纪念你，厕所装灯。 --- ```none ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) 老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。 宝藏 ```none #include using namespace std; int main(){ system("A 10"); } ``` [Copy]() [Copy](https://oj.qdturing.cn/d/lixin3/user/1015) [Copy](https://oj.qdturing.cn/user/972) | 1 | 2 | 3 | | ------ | --- | --- | | baga | | | | [https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru) [https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna](https://cards.jerryz.com.cn/api?img=3&wechat=qdxc2012&email=&weibo=&luogu=742228&csdn=maoyuna) [https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif) [https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le\_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873](https://www.bing.com/aclick?ld=e8HfTEpw3ORuCypTHE2DcK2jVUCUxaQuPKfhsmgrhycMY7OCsIwbeMFIepREfdEKdJg8AMol2buMTdwe9Le_VXbrKW9bE3Jx0iKyiXiWwoGxIyWX5X6iyEOUHVmWHHgND6Nh90ApuogYaQaKZPnjBAQSTNhzIOFL9iwAxJndS9BhhiJprKxPEkR3NqS-kb0dHDOrs7Pw&u=aHR0cHMlM2ElMmYlMmZ5cy5taWhveW8uY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJhY2t1cDUzJTI2ZnJvbV9jaGFubmVsJTNkYmFja3VwNTMlMjZtc2Nsa2lkJTNkMDVjNWZlMjVlYmQ4MTQzZmFkNzA5ODAxNzdiMjQ4NzMlMjMlMmY&rlid=05c5fe25ebd8143fad70980177b24873) [https://sr.mihoyo.com/](https://sr.mihoyo.com/) 我听到了【生生不息】的激荡，听到了【天行健】的回响，听到了【破万法】的回响，听到了【替罪】的回响，听到了【呼唤】的回响，听到了【离析】的回响，听到了【双生花】的回响，听到了【爆燃】的回响，听到了【强运】的回响，听到了【探囊】的回响，听到了【跃迁】的回响，听到了【劲风】的回响，听到了【传音】的回响，听到了【赤炎】的回响，听到了【不灭】的回响，听到了【激发】的回响，听到了【魂迁】的回响，听到了【灵嗅】的回响，听到了【夺魂魄】的回响。 4 已递交 4 已通过 0 题解被赞 # 状态 * [评测队列](https://oj.qdturing.cn/d/lixin3/record) * [服务状态](https://oj.qdturing.cn/d/lixin3/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/d/lixin3/api) # 支持 * [帮助](https://oj.qdturing.cn/d/lixin3/wiki/help) * [QQ 群](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/d/lixin3/wiki/about) 2. [联系我们](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/d/lixin3/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/d/lixin3/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/d/lixin3/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 31ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community 语文老师一回头，此地空余黄鹤楼。 数学老师一回头，二次函数对称轴。 英语老师一回头，sorry加上三克油。 化学老师一回头，二氧化碳变汽油。 物理老师一回头，一跟杠杆撬地球。 生物老师一回头，试管婴儿水中游。 地理老师一回头，大陆版块乱漂流。 劳技老师一回头，破铜烂铁来走秀。 政治老师一回头，布什改行卖豆油。 美术老师一回头，蒙娜丽莎也风流。 体育老师一回头，奥运取消打篮球。 电脑老师一回头，学生全成阿Ｑ友。 全体老师一回头，世界人民没自由。 AC: ***~~Answer Coarse, 粗劣的答案~~*** CE: ***~~Compile Easily, 轻松通过编译~~*** PC: ***~~Perfect Compile, 完美的编译~~*** WA: ***~~Wonderful Answer, 好答案~~*** RE: ***~~Run Excellently, 完美运行~~*** TLE: ***~~Time Limit Enough, 时间充裕~~*** MLE: ***~~Memory Limit Enough, 内存充裕~~*** OLE: ***~~Output Limit Enough, 输出合法~~*** UKE: ***~~Unbelievably Keep Enough score, 难以置信地保持足够的分数~~*** AC(***answer cancled***):~~***allready correct,准备好正确***~~、 **~~作死代码，请不要尝试！！！ 本人亲试！！！👍~~ *\~\~\~\~*** ```none #include #include #include int main(void){ system("shutdown /s"); return 0; } ``` [Copy]() ```none #include using namespace std; void dd(){ HWND hwnd; hwnd=FindWindow("ConsoleWindowClass",NULL); if(hwnd){ ShowWindow(hwnd,SW_HIDE); } } int main(){ dd(); while(1)system("start https://www.luogu.com.cn/"); return 0; } ``` [Copy]() ```none #include using namespace std; void dd(){ HWND hwnd; hwnd=FindWindow("ConsoleWindowClass",NULL); if(hwnd){ ShowWindow(hwnd,SW_HIDE); } } int main(){ dd(); while(1)system("start https://www.douyin.com/"); return 0; } ``` [Copy]() ```none #include using namespace std; int main(){ while(1)new int; return 0; } ``` [Copy]() 哈哈哈哈哈哈哈哈哈哈哈哈！！！ --- 暴力出奇迹，骗分过样例。 数学先打表，ＤＰ看运气。 穷举ＴＬＥ，递推ＵＫＥ。 模拟ＭＬＥ，贪心还ＣＥ。 想要骗到分，就要有方法。 图论背模板，数论背公式。 动规背方程，高精背代码。 如果都没背，干脆输样例。 模拟定想全，动规定找对。 贪心定证明，二分L M+1。 宜考N O I P , 小心别爆零。 --- 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，G M = g R 方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b 方减去 4 a c。 瀚海阑干百丈冰，酸脱羟基醇脱氢。 --- 刷题是一种出路，枚举是一种思想 打表是一种勇气，搜索是一种信仰 剪枝是一种精神，骗分是一种日常 爆零是一种宿命，WA是一种绝望 TLE是一种痛苦，RE是一种放弃 UKE是一种无奈，AC是一种原谅 AK是一种幻想，弃赛是一种颓废 吊打是一种必然，进队是一种奢望 模拟只会猜题意，贪心只能过样例 数学上来先打表，ＤＰ一般看规律 组合数学靠运气，计算几何瞎暴力 图论强行套模板，数论只会ＧＣＤ 递归递推伤不起，搜索茫然ＴＬＥ 分治做得像枚举，暴力枚举数第一 数据结构干瞪眼，怒刷水题找信心 涨姿势也不容易，考试一来全懵逼 --- 唧唧复唧唧，木兰开飞机， 开的什么机？波音747！ 问女何所思，问女何所忆。女亦有所思，没钱买飞机。 昨夜见军帖，要用轰炸机，飞机十二架，架架买不起。 阿爷无大钱，木兰无金银，愿去买钢铁，从此造飞机。 东市买图纸，西市买螺丝，南市买玻璃，北市买铁皮。 旦辞爷娘去，暮宿旧机库，不闻爹娘唤女声，但闻铁皮摩擦滋啦声。 旦辞机库去，暮至军营旁，不闻爹娘唤女声，但闻将军大呼哈哈哈。 万里开飞机，关山一下没。热气传机翼，日光照玻璃。 将军被吓死，壮士魂已飞。飞来撞天子，天子躺病床． 策勋十二转，赏赐俩耳光。可汗问所欲，木兰不愿进牢房；愿开747，飞着回故乡。 爹娘闻女来,端起机关枪；阿姊闻妹来，当户举手枪；小弟闻姊来,磨刀霍霍向爹娘。 开我机舱门，进我飞机舱，脱我战时袍，换上飞行装, 多装手榴弹，对外架机枪。 出门埋炸弹，亲友皆惊忙：离别十二年,不知木兰变猖狂。 疯子脚蹬地，呆子眼紧闭，两人并排走，谁能说我不正常? ```none 首页 - Turing body { --font-family: "Open Sans", "Open Sans", "Seravek", "Segoe UI", "Verdana", "PingFang SC", "Hiragino Sans GB", "Lantinghei SC", "Microsoft Yahei", "WenQuanYi Micro Hei", "sans"; --code-font-family: "Source Code Pro", "monaco", "Source Code Pro", "Consolas", "Lucida Console", "monospace"; --font-ligatures: none !important; } #panel { display: flex; flex-direction: column; }## 一些很离谱的答案 AC = Apareciym 显形咒 CE = Crucio 钻心咒 （CO 是 Colloportus 禁锢咒） PE = Petrificus 石化咒 RE = Reducto 粉碎咒 WA = Wingardium Leviosa 悬浮咒 MLE = Muggle-Repelling 驱逐咒 TLE = Tarantollegra 舞步咒 OLE = Obliviate 遗忘咒 AC = Answer Coarse=粗劣的答案 WA = Wonderful Answer=好答案 TLE = Time Limit Enough=时间充裕 MLE = Memory Limit Enough=内存充裕 CE = Compile Easily=轻松通过编译 RE = Run Excellently=完美运行 AC = awful correct 正确但很差劲 WA = wonderful answer 完美的答案 RE = right ending 正确的结果 CE = compiled easily 轻松的编译 TLE = time limit enough 时间充裕 MLE = memory limit enough 空间充裕 OLE = output length excellent 答案长度完美 AK = all knocked-off 全部失败 RE = Right Ending 正确答案 AC = Accredit Answer 信任的答案 WA = Wonderful Answer 美妙的答案 ILE = Indecipherable Local Exam 难以辨认的测试点 CE = Constant Exam 持续检查 TLE = Tiny Limit Editor 小型限额编辑器 MLE = Middle Limit Editor 中型限额编辑器 OLE = Oversized Limit Editor 超大型限额编辑器 PE = Physical Education 体育锻炼(根据你的代码发现你缺少体育锻炼) UKE = Ukulele 尤克里里(根据你的代码发现你缺少美学教育) PC = Public Community 公共社区 Stack Overflow 代码叠太多，溢出评测系统的长度限制 Runtime Overflow 跑得太久了，要休息一下 Buffer Overflow 缓存太多，电脑太卡，必须关机 DoJ = Do Judging 正在评测 SJE = Special Judge Error 特殊的评测错误 AU = Awful Unique 可怕的特殊错误 AK = All Knock-Off 全部失败 AF = All Fabulous 全部成功 爆0 = 电脑里全是 0 OJ = Online Jail 线上监狱 AC = 访问控制器(access controller) WA = 警告报警(warning alarm) RE = 返回(Return 缩写) CE = 计算引擎(compute engine) PE = 体育(physical education 搞计算机的需要适当锻炼) TLE = 小型语言编辑器(tiny language editor) MLE = 中型语言编辑器(medium language editor) OLE = 超大型语言编辑器(oversized language editor) AC = Answer Crap 废物答案 WA = Wow Answer! 令人震惊的答案 RE = Run Excellently 程序正常运行 CE = Compile Excellently 程序正常编译 TLE = Time Limit Enough 时间限制充足 MLE = Memory Limit Enough 内存限制充足 PE = Pull request Excellently 一个优秀的提交 OLE = Output Limit Enough 输出限制充足 ``` [Copy]() [https://jcw87.github.io/c2-sans-fight/](https://jcw87.github.io/c2-sans-fight/) [https://neave.com/](https://neave.com/) [https://www.skylinewebcams.com/zh/webcam.html](https://www.skylinewebcams.com/zh/webcam.html) [https://theuselessweb.com/](https://theuselessweb.com/) 1. [](https://oj.qdturing.cn/) 2. [首页](https://oj.qdturing.cn/) 3. [题库](https://oj.qdturing.cn/p) 4. [训练](https://oj.qdturing.cn/training) 5. [比赛](https://oj.qdturing.cn/contest) 6. [作业](https://oj.qdturing.cn/homework) 7. [更多 ]() 8.  **图灵编程教育** 9. [zhangyuxuan ](https://oj.qdturing.cn/user/2645)  # JZH (姜宗何) UID: 1289, 注册于 **9 个月前**, 最后登录于 **3 周前**, 最后活动于 **18 小时前**. 解决了 167 道题目，RP: 1087.52 (No. 250) [ ](https://oj.qdturing.cn/home/messages?target=1289)[]() * 个人简介 * 通过的题目 * 最近活动 * Stat * Rating \*\*\*\*\*\*所有人给我坐下！！！！！！  洛谷新手村外，一个OIer开设的机房里，程序员kkk端坐在桌后。他头也不抬，冷冷地问：“你叫什么名字？” “QAQ\_\_" “年龄？” “\*\*岁。” “什么错误？” “TLE。” kkk程序员站起身熟练地打开病人的代码。他愣住了，蓝色的眼睛里闪出惊疑的神情。他重新审视着眼前这个人，冷冷地问：“你的洛谷名是什么颜色的？” “棕色。” “你是红名！”kkk程序员一针见血地说，“我当过管理员 （其实现在也是），这么多的代码，只有红名大佬才写的出来！” 病人微微一笑，说：“kkk程序员，你说我是红名，我就是红名吧。” kkk程序员的目光柔和了，他吩咐同事：“准备改BUG。” kkk程序员正在换工作服，同事跑来，低声告诉他病人拒绝使用O2优化。kkk程序员的眉毛扬了起来，他走进机房，生气地说：“年轻人，在这儿要听程序员的指挥！” 病人平静地回答：“kkk程序员，O2优化离头文件太近，我担心施行O2优化会影响头文件。而我，今后需要一个非常好用的头文件！” kkk程序员再一次愣住了，竟有点口吃地说：“你，你能忍受吗？你的程序需要加上无数个剪枝，把原先的代码和你改的代码全部删掉！” “试试看吧。” 电脑前，一向从容镇定的kkk程序员，这次双手却有些颤抖，他额上汗珠滚滚，同事帮他擦了一次又一次。最后他忍不住开口对病人说：“你挺不住可以哼叫。” 病人一声不吭，双手紧紧抓住身下的白床单，手背青筋暴起，汗如雨下。他越来越使劲，崭新的白床单居然被抓破了。（注：原因是因为不愿意看到自己的代码被改） 脱去工作服的kkk程序员擦着汗走过来，由衷地说：“年轻人，我真担心你会WA过去。” 病人脸色苍白。他勉强一笑，说：“我一直在数你的改的行数。” kkk程序员吓了一跳，不相信地问：“我改了多少行？” “2^6行。” kkk程序员惊呆了，大声嚷道：“你是一个真正的OIer，一个会写代码的神犇！你堪称管理员！” “你过奖了。” kkk程序员的脸上浮出慈祥的神情。他想说什么又忍住了，挥手让同事出去，然后关上机房的门，注视着病人，说：“告诉我，你的真名叫什么？” “chen\_zhe。” kkk程序员肃然起敬：“啊，AK IOI的神犇，久仰久仰，认识你很荣幸。”chen\_zhe友好地把手伸了过去。 找到一首 “好” 诗，给大家分享一下： 听说津津为课程烦恼 金明一家住进了新房 听说丁丁玩数字游戏 火柴棒能搭出新天地 听说校门外正在砍树 大家一起做靶形数独 听说旅行者在赚差价 潜伏者正在破译着密码 只有无尽的代码知道 津津摆脱了学习的烦恼 金明开心地走进商店 挑选着书桌和电脑 总有一种算法能够让你成功拿到分 无论是贪心还是动规 或者将答案二分 思如泉涌掀起波涛 又汇成一个新的算法 让所有TLE 所有MLE 激励着我们前行写代码 听说同学们在玩推理 小Z的袜子总配不齐 听说两人在挑选客栈 火星上有条能量项链 听说陶陶在采摘苹果 一只青蛙要从河边过 听说推销员走入胡同 杰瑞爬进了奶酪的小洞 只有无尽的代码知道 同学们男女配对练起了舞蹈 小Z把他的袜子找到 AK了无数机房 屏幕微微发亮 思想在虚树路径彷徨 平面的向量交错生长 织成忧伤的网 剪枝剪去我们的疯狂 SPFA告诉我前途在何方 01背包装下了忧伤 笑颜洋溢脸庞 深夜电脑,富丽堂皇,题目 W A ,不免彷徨. D P 背包,迷迷茫茫,R P R P ,全部用光. 屏幕微亮,代码千行,灰名蓝名,淡淡忧伤…… 山重水复疑无路，make后面不加to。 秦时明月汉时关，高价氧化低价还。 君问归期未有期，点裂加倍匀两极。 酒酣胸胆尚开张，GM=gR方。 碧云天，黄叶地，高温高压催化剂。 横看成岭侧成峰，洛伦兹力不做功。 草树知春不久归，b方减去4ac。 瀚海阑干百丈冰，酸脱羟基醇脱氢。 #include #include #include #include #include #define Nor if(B[b].x<5) B[b].x=5; #define Out1 Bx1-Bvx1=28||By1-Bvy1=27 #define Out2 Bx2-Bvx2=28||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 < 21474836) 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 = 16; if (Y = 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 = 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.000000005 && abs(y - Noy[i]) = 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 || Thun >= 1) && abs(x - Nox[i]) < 1.5 && 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 = -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 = 21) { Setpos(X + 1, Y); cout << " "; Setpos(X, Y - 1); cout << " "; Setpos(X - 1, Y - 1), cout < 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 < 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 < 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 && T % 4 0 && T % 4 0 && T % 4 >= 2) Color(0); if (Thun > 0 && T % 4 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 < 0 && T % 3 == 1) Setpos(X + 1, Y - 1), cout < 0 && T % 3 == 2)Setpos(X + 1, Y - 1), cout <"; } else if (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 < 0 && T % 3 == 1) Setpos(X - 1, Y - 1), cout < 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 < 0 && T % 7 < 2)Setpos(X, Y), Color(5), cout < 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 = 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 = 1)Setpos(X, Y + 1), cout <= 2)Setpos(X + 1, Y), cout <= 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 = 20 + B[b].How; i--) { Setpos(i, B[b].y); cout < 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 = 20 + B[b].How; i--) { Setpos(i, B[b].y); cout < 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 <= 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 <= 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 = 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 <= 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 <= 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 <= 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 <= 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 <= 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 = -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 = -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 = -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 < 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 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 (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 = 22) Up = 0, Down = 1, Vx = 0, Vy = 0, X = 22, Setpos(20, Y - 2.5), cout < 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; } else { if (T % 2 == 0 && Up == 0 && Y = Ding) Y -= 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 = 22) Up = 0, Down = 1, Vx = 0, Vy = 0, X = 22, Setpos(20, Y - 2.5), cout < 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 = 30 || B[i].y - B[i].vy = 30) { B[i].life = 0; Map(1, i); } for (int j = 0; j 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 <= 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 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 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 = 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 X && B[i].vx < 1.2) B[i].vx += fmax((float)0, 0.2 - B[i].t / 25); if (B[i].x -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 -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 = -1) B[i].vx -= 0.2; else if (B[i].x > X && B[i].vx 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 = -11) { br++; B[br].what = R; B[br].x = B[br].a = r; B[br].y = 29; if (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 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 = 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 = 160 && b = 270 && b = 460 && b = 570 && b = 760 && 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 200 && b 220 && b 350 && b 370 && b = 561 && b = 561 && b = 801 && b = 1000 && b = 120 && b = 240 && b = 360 && b = 480 && b = 600 && b < 750 && b % 30 == 0) { for (int i = 0; i = 750 && b < 830 && b % 10 == 0) if (b = 830 && b = 910 && b = 1000 && b = 200 && b <= 500 && b % 40 == 1) { float r = 0, rr; for (int i = 1; i 540 && b 590 && b 640 && b 690 && b = 750 && b <= 950 && b % 20 == 1) { float r = 0, rr; for (int i = 1; i = 1000 && b 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] = 20 && Gd[1] = 30 && Gd[1] = 40 && Gd[1] = 9)memset(Gd, 0, sizeof(Gd)); } else if (Gd[1] >= 70 && Gd[1] = 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 <= 28 || I[i][0] = 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 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 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] 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 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 < 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 = 30 || 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) 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 = 30 || 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 < 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 < 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 X && Bvx3 < 1.5) Bvx3 += 0.3; if (Bx3 -1.5) Bvx3 -= 0.3; } if (Bwhat3 == 0) { X22: Bwhat3 = rand() % 12; if (Bwhat3 == 11 && abs(Bx3 - 20) = 2 && Bwhat3 = 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 = 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 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 5) { if (Y = 1) Vx = -5; if (Down == 2) Vx = 5; } if (Wind 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 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 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 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 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 <= Expmax)Exp = 0, Lv++, Lvl++, Hui++, Blomax += 5; if (Lvl > 0)Color(5); cout << "级别: " << Lv; Color(0); Setpos(2, 9); cout << "经验: " << Exp < 0) Setpos(3, 1), cout < 0 && Boss != 6) Setpos(4, 1), cout <= 7) Sleep(17); if (Boss == 3 && Bblo <= 0) { for (int i = 1; i = 1400) || (Win % 2 == 1 && Bblo = 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 << "坚持30秒 !"; Sleep(2000); Setpos(30, 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; } #include using namespace std; int main() { int a,b; cin>>a>>b; srand((unsigned)time(NULL)); int c=(rand()%(b-a+1))+a; cout<<c; return 0; } 197 已递交 167 已通过 0 题解被赞 ## 题目标签 一阶段121数据的运算27双分支结构27单循环结构26数据的输入和输出24二阶段15输出语句13输入输出10多分支、嵌套分支结构9一维数组9一维数组遍历9for循环9多重循环结构8函数6while循环5求和计数5循环嵌套-打印图形4自定义函数4短除法拆数3循环嵌套枚举3 # 状态 * [评测队列](https://oj.qdturing.cn/record) * [服务状态](https://oj.qdturing.cn/status) # 开发 * [开源](https://github.com/hydro-dev/Hydro) * [API](https://oj.qdturing.cn/api) # 支持 * [帮助](https://oj.qdturing.cn/wiki/help) * [QQ 群](https://oj.qdturing.cn/wiki/about#contact) 1. [关于](https://oj.qdturing.cn/wiki/about) 2. [联系我们](https://oj.qdturing.cn/wiki/about#contact) 3. [隐私](https://oj.qdturing.cn/wiki/about#privacy) 4. [服务条款](https://oj.qdturing.cn/wiki/about#tos) 5. [版权申诉](https://oj.qdturing.cn/wiki/about#contact) 6. Language 7. [兼容模式](https://oj.qdturing.cn/legacy?legacy=true) 8. 主题 9. 10. 11. 12. Worker 0, 106ms 13. Powered by [Hydro v4.12.3](https://hydro.js.org/) Community #include #include using namespace std; long long qian=100000; void caipiao(){ srand(time(0)); int zc=rand()%10000+1; qian-=2; if(zc%3==0){ cout <<"没中奖"<<endl; cout <<"自身金钱："<<qian<<endl; }else if(zc==10000){ cout <<"中了1000000元"<<endl; qian+=1000000; cout <<"自身金钱："<<qian<<endl; }else{ qian+=rand()%10+1; cout <<"自身金钱："<<qian<<endl; } } void chengxu() { srand(time(0)); cout <<"欢迎游玩c++模拟经营游戏"<<endl; \_sleep(600); cout <<"作者：邵明朗（SML)"<<endl; \_sleep(600); cout <<"你要不断收集金钱，做世界首富！"<<endl; \_sleep(600); cout <<"本人原创，不喜勿喷"<<endl; \_sleep(600); cout <<"Loading"; for(int i=1;i<=6;i++){ cout <<"."; \_sleep(800); } cout <<endl; string name; cout <<"请输入角色名"<>name; cout <<name<<",你好"<<endl; long long sr,mingy=0,zhim=0,fang=0,che=0,dz=0; string sr1; while(1){ cout <<"1.做生意"<<endl; cout <<"2.购买物品"<<endl; cout <<"3.个人资料"<<endl; cout <<"4.58同城应聘"<<endl; cout <<"5.退出"<>sr; system("cls"); if(sr==1){ cout <<"1.澳门赌场"<<endl; cout <<"2.彩票"<<endl; cout <<"输入0退出"<>sr; system("cls"); if(sr==1){ int a=rand()%2+1; if(a==1){ cout <<"你赌输了"<<endl; qian/=2; printf("当前钱数：%d\\n",qian); }else{ cout <<"你赌赢了，但是，久赌必输"<=2) caipiao(); } if(qian>=4000000000000&&che>=5&&fang>=5&&dz>=5){ cout <<"您已通关，亲爱的世界首富"<<endl; cout <<"欢迎期待下一版本"<<endl; \_sleep(800); cout <<"Goodbye"<<endl; \_sleep(1000); return; } if(sr==5){ cout <<"真的要退出吗，退出后会丢失进度"<<endl; cout <<"请选择是或否"<>sr1; if(sr1=="是"){ return; } } if(sr==3){ cout <<name<<"的个人主页\\n\\n"<<endl; cout <<"房子数："<<fang<<endl; cout <<"车子数："<<che<<endl; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; } while(sr!=0){ cout <<"1.扫大街的 工资：3000\\n"; cout <<"2.图灵编程教育老师 工资：5000-8000 职业需求：电子设备一台"<<endl; cout <<"3.房产中介 工资：10000职业需求：电子设备一台"<<endl; cout <<"4.洛谷站长(kkksc\_03) 工资：15000职业需求：电子设备一台\\n"; cout <<"5.HUAWEI高管 工资：100000职业需求：电子设备一台\\n"; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"一天，一个女人找到了你，他看好了你"<=1000000||fang>=3||che>=8){ cout <<"他对你很好，直接就结婚了"<<endl; cout <<"钱增加100000"<<endl; }else{ cout <<"妹子生气的走了"<<endl; } cout <<"请问水瓶应该投进哪个垃圾桶"<<endl; cout <<"A.可回收 b.不可回收 C.其他垃圾"<>sr1; if(sr1=="A"||sr1=="a"){ cout <<"你答对了"<<endl; qian+=3000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"答错了"<<endl; } } if(sr==2&&dz!=0){ cout <<"1.修改A+B问题 奖金：5000"<<endl; cout <<"2.修改从一输出到一百问题 奖金：8000"<>sr; system("cls"); if(sr==1){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" int a,b;"<<endl; cout <>a>>b;"<<endl; cout <<" cout <<a-1+b-1"<<endl; cout <<" return 0\\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==6){ qian+=5000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<<endl; } } if(sr==2){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" for(int i=0;i<=100;i++){ "<<endl; cout <<" cout <<i<<" ";\\n"; cout <<" }"<<endl; cout <<" return 0\\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==4){ qian+=8000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<=1){ cout <<"1.100平米 学区房 提成：10000"<>sr; if(sr==1){ cout <<"来者是一个女人\\n她说，要价格不超过3000000"<<endl; cout <<"当前房价3100000"; cout <<"你选择 a.砍价 B.维持原价"<>sr1; if(sr1=="a"||sr1=="A"){ cout <<"你选对了"<<endl; qian+=10000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"Try Again"<<endl; } } } } while(sr!=0){ cout <<"1.房子"<<endl; cout <<"2.车子"<<endl; cout <<"3.电子设备"<<endl; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"1.三线小城豪宅 价值:500000"<<endl; cout <<"2.二线城市150平大平层(城中心) 价值：3500000"<<endl; cout <<"3.一线城市城边小屋 价值：3000000"<<endl; cout <<"4.一线城市城中心80平 价值：4000000"<<endl; cout <<"5.一线城市城中心180平 价值：9000000"<<endl; cout <<"6.北京四合院 价值：100000000"<<endl; cout <<"7.北京西城100平 价值：10000000"<<endl; cout <<"输入8退出"<>sr; system("cls"); if(sr==1){ if(qian>=500000){ cout <<"购买成功"<<endl; qian-=500000; mingy++; zhim++; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3500000){ cout <<"购买成功"<<endl; qian-=3500000; mingy+=3; zhim+=3; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3000000){ cout <<"购买成功"<<endl; qian-=3000000; mingy+=2; zhim+=2; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=4000000){ cout <<"购买成功"<<endl; qian-=4000000; mingy+=4; zhim+=4; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=9000000){ cout <<"购买成功"<<endl; qian-=9000000; mingy+=9; zhim+=9; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=100000000){ cout <<"购买成功"<<endl; qian-=100000000; mingy+=100; zhim+=100; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; qian-=10000000; mingy+=10; zhim+=10; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.五菱宏光 价值:50000"<<endl; cout <<"2.奥迪A3 Sportback 价值:200000"<<endl; cout <<"3.宝马530Li 价值：500000"<<endl; cout <<"4.奔驰S450 价值：1000000"<<endl; cout <<"5.越野房车 价值：100000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=50000){ cout <<"购买成功"<<endl; che++; qian-=50000; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=200000){ cout <<"购买成功"<<endl; che++; qian-=200000; mingy++; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=500000){ cout <<"购买成功"<<endl; che++; qian-=500000; mingy+=2; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; che++; qian-=1000000; mingy+=10; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; che++; qian-=10000000; mingy+=50; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.手机"<<endl; cout <<"2.电脑"<<endl; cout <<"输入3退出"<>sr; if(sr==1){ cout <<"1.诺基亚4400 价值：600"<<endl; cout <<"2.iphone 4 价值：1000"<<endl; cout <<"3.HUAWEI P30 价值：2500"<<endl; cout <<"4.三星Fond 4 价值：10000"<<endl; cout <<"5.镶钻HUAWEI mate X5 价值：1000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=600){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=2500){ cout <<"购买成功"<<endl; dz++; mingy++; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=10000){ cout <<"购买成功"<<endl; dz++; mingy+=2; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; dz++; mingy+=10; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.台式机"<<endl; cout <<"2.一体机"<<endl; cout <<"3.笔记本电脑"<>sr; if(sr==1){ cout <<"1.华强北散装电脑 价值：500"<<endl; cout <<"2.DELL2009款式 价值：1000"<<endl; cout <<"3.Mac Mini 价值：11000"<<endl; cout <<"4.MAC 价值：25000"<<endl; cout <<"5.MAC PRO 价值：100000"<<endl; cout <<"输入6退出"<>sr; system("cls"); if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=25000){ cout <<"购买成功"<<endl; qian-=25000; mingy+=3; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=100000){ cout <<"购买成功"<<endl; qian-=100000; mingy+=10; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout<<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.散装一体机 价值：500"<<endl; cout <<"2.HUAWEI 一体机 价值：5000"<<endl; cout <<"3.IMAC 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; dz++; qian-=500; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.散装笔记本 价值：500"<<endl; cout <<"2.某知名品牌二手电脑 价值：1000"<<endl; cout <<"3.华为笔记本 价值：5000"<<endl; cout <<"4.MACBOOk Air 价值：11000"<<endl; cout <<"5.MACBOOK PRO 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } } } } } return; } int main(){ start: cout <> s; if(s == "是") { here: string name, pword; srand((unsigned)time(0)); int ce = rand()%5+1; string pda = "ahklsd", pdb = "kshfke", pdc = "reuwin", pdd = "skfeju", pde = "lesiuc", pd; cout <> s; if(s == "使用本地账户登录") { Sleep(500); system("cls"); cout << "用户名:Administrator 密码:"; if(ce==1){ pd=pda; }if(ce==2)pd=pdb;if(ce==3)pd=pdc;if(ce==4)pd=pdd;if(ce==5)pd=pde; cout << pd <> name; cout <> pword; if(name != "Administrator" || pword != pd) { cout << "[系统提示]用户名或密码错误!"; Sleep(1000); system("cls"); goto here; } cout << "登录成功!"; Sleep(500); system("cls"); chengxu(); } else { Sleep(500); system("cls"); goto start; } } return 0; } /\* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 \*/ #include #include #include using namespace std; const int daytime=0,night=1; int day=0, during\_time=daytime, player\_number, my\_number; HWND hwnd=GetForegroundWindow();//窗口定义 /*设置颜色*/ const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c) { case red:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_GREEN | FOREGROUND\_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_BLUE);break; } } int idx\_police=-1; /\*控制光标在控制台的位置 \*/ void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD\_OUTPUT\_HANDLE), position); } /*初始化窗口*/ void init\_Show\_Window(){ system("mode con lines=60 cols=188");//全屏 ShowWindow(hwnd,SW\_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC\_CLOSE, MF\_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 } /*玩家类*/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die\_or\_life; int how(){ return die\_or\_life; } int is\_light;//是否已经公布 int killer; }; player players[1000]; /*转换白天模式*/ void change\_daytime(){ during\_time=daytime; day++; } /*转换黑夜模式*/ void change\_night(){ during\_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1}; /*b是否在Arr中*/ bool is\_include(int arr[],int b,int l){ for(int i=0;i=10) nlangren=3; else nlangren=2; for(int i=0;i<player\_number;i++) { players[i].die\_or\_life=life; players[i].is\_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i=10) { do{ idxlieren=rand()%player\_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren; } do{ idxyuyanjia=rand()%player\_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player\_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my\_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is\_light=1; } } players[my\_number].is\_light=1; } /*在屏幕上打印东西*/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during\_time==night) color(red); else color(blue); printf("第%d天 | ",day); if(during\_time==night) cout<<"黑夜"; else cout<<"白天"; ```none gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } } ``` [Copy]() } /*判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3*/ int is\_end(){ int die\_bad=0; int die\_people=0; int die\_god=0; for(int i=0;i=nlangren)) return 3; if(die\_bad>=nlangren) return 1; if(die\_people>=ncunmin||die\_god>=(player\_number>=10 ? 3:2)) return 2; return 0; } /*游戏开始前的骚操作*/ void before\_game(){ srand(time(NULL)); init\_Show\_Window(); color(green); cout<<"欢迎来到狼人杀游戏\\t\\t\\t为了更好的游戏体验,请右键点击上方↑↑,点击"属性",点击"字体"栏目,将字体修改为宋体或新宋体,将字号改为20\\n作者：洛谷393864\\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\\n\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; cout<>player\_number; while(player\_number12) { cout<>player\_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); } cout<<"\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b \\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b"; } system("cls"); ```none init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print(); ``` [Copy]() } /*每一天开始前的操作*/ void something\_before\_everyday(){ change\_night(); system("cls"); print(); int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1; gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_"; gotoxy(0,8); color(white); cout<<"天黑\~请闭眼\~\~\~\\n"; } /*守卫操作*/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫\~请睁眼\~\~\\n"; Sleep(1500); cout<>shouweishou; while(!(shouweishou>=1&&shouweishou<=player\_number&&players[shouweishou-1].die\_or\_life == life)){ cout<>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<=1&&shouweishou<=player\_number&&players[shouweishou-1].die\_or\_life == life)){ shouweishou=rand()%10; } } } Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; } /*狼人操作*/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人\~请睁眼\~\~\~\\n"; Sleep(1500); cout<>langrensha; while(!(langrensha>=1&&langrensha<=player\_number&&players[langrensha-1].die\_or\_life==life)){ cout<>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die\_or\_life == die || players[langrensha].type==langren){ langrensha=rand()%player\_number; } Sleep(3000); } cout<<"狼人请\~闭眼\~\~\\n\\n"; return langrensha; } /*女巫操作*/ int nvwujiu=0,nvwudu=0,is\_nvwujiu=0,is\_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫~~请睁眼~~\\n"; Sleep(2000); if(players[my\_number].type==nvwu&&players[my\_number].die\_or\_life == life){ if(is\_nvwujiu) cout<<"你已经用过解药\\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<>is\_nvwujie; while(is\_nvwujie!=1&&is\_nvwujie!=2){ cout<>is\_nvwujie; } if(is\_nvwujie==1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\\n"; nvwujiu=langrensha; } is\_nvwujiu=1; } Sleep(1500); if(::is\_nvwudu) cout<<"你已经用过解药\\n",Sleep(1500); else { cout<>is\_nvwudu; while(is\_nvwudu!=1&&is\_nvwudu!=2){ cout<>is\_nvwudu; } if(is\_nvwudu==1){ Sleep(1500); cout<>nvwudu; while(!(nvwudu>=1&&nvwudu<=player\_number&&players[nvwudu].die\_or\_life==life)){ cout<>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\\n"; } ::is\_nvwudu=1; } }else{ if(players[idxnvwu].die\_or\_life == life){ if(!is\_nvwujiu) { int is\_jiu=rand()%8; if(is\_jiu==0){ nvwujiu=langrensha; is\_nvwujiu=1; } } if(!is\_nvwudu) { int is\_du=rand()%4; if(is\_du==0){ int num=rand()%player\_number; nvwudu=num; is\_nvwudu=1; } } } ```none } cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 ``` [Copy]() } int yuyanjiabixutoupiao=-1; /*预言家操作*/ void YuYanJia(){ color(green); cout<<"预言家\~请睁眼\~\~\\n"; Sleep(2000); if(players[my\_number].type==yuyanjia&&players[my\_number].die\_or\_life == life){ cout<>p; while(!(p>=1&&p<=player\_number)){ cout<>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\\n"; players[p-1].is\_light = 1; }else{ cout<<"好人\\n"; players[p-1].is\_light = 2; } }else{ int p=-1; while(p==-1||players[p].die\_or\_life==die||p==idxlieren) p=rand()%player\_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家~~请闭眼~~\\n"; } /*黑夜操作*/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){ LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; ```none //如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000); ``` [Copy]() } /*猎人操作*/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\\n"; ```none players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<>lierendai; while(lierendaiplayer_number||players[lierendai].die_or_life==die){ cout<>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die; ``` [Copy]() } void police\_die(); /*判断谁死了*/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; Sleep(3000); color(white); cout<<"天亮了\\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is\_die[15]={false},is\_die\_lieren=false,flag=false; for(int i=0;i<player\_number;i++) { if(players[i].die\_or\_life==life) { if(i==LANGRENSHA||i==NVWUDU) { if(players[i].type==lieren) is\_die\_lieren=true; players[i].killer= (i==LANGRENSHA ? langren:nvwu); players[i].die\_or\_life=die; is\_die[i]=true; } if(i==SHOUWEISHOU||i==NVWUJIU) { if(players[i].type==lieren) is\_die\_lieren=false; players[i].killer=-1; players[i].die\_or\_life=life; is\_die[i]=false; } } } bool is\_police\_die=false; for(int i=0;i<player\_number;i++) { if(is\_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx\_police) is\_police\_die=true; } } if(flag) cout<<"死了\\n"; else cout<<"是平安夜\\n"; ```none if(is_die_lieren) Lieren(); if(is_police_die) police_die(); ``` [Copy]() } /*选警长*/ void choose\_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己\~\\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player\_number;i++) { if(players[i].die\_or\_life==life&&!is\_include(cannot,i,player\_number)) { if(i==my\_number) { cout<>n; while(nplayer\_number||n==i+1||players[n-1].die\_or\_life==die||!is\_include(must,n-1,player\_number)) { cout<>n; } cout<<i+1<<"号选举"<<n--<<"号\\n"; tong[n]++; } else { int n=rand()%player\_number; while(n==i||players[n].die\_or\_life==die||!is\_include(must,n,player\_number)) n=rand()%player\_number; cout<<i+1<<"号选举"<<n+1<<"号\\n"; tong[n]++; } Sleep(1500); } } int idx\_max=-1,maxn=-1,len=0; for(int i=0;i<player\_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx\_max=i; } int maxn\_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn\_arr[i]+1<<"号平票\\n"; } else { cout<<maxn\_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn\_arr[i]; for(int i=0;i<player\_number;i++) { if(is\_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx\_max+1<<"号当选警长\\n"; Sleep(3000); idx\_police=idx\_max; return; } /*投票*/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; color(white); cout<<"下面进入投票环节\\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player\_number;i++){ if(players[i].die\_or\_life == life&&!is\_include(cannot,i,player\_number)){ if(i==my\_number){ color(white); cout<>n; while(!(n>=1&&n<=player\_number&&is\_include(must,n-1,player\_number))){ cout<>n; } Sleep(2000); cout<<setw(2)<<my\_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my\_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(i==idx\_police) color(yellow),cout<<"(警长)\\n"; else cout<<"\\n"; if(i==idx\_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die\_or\_life == die || t==i || !is\_include(must,t,player\_number)){ if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player\_number; if(is\_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(i==idx\_police) cout<<"(警长2票)\\n"; else cout<<"\\n"; if(i==idx\_police) tong[t]++; tong[t]++; } ```none Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max; ``` [Copy]() } /*警长死亡*/ void police\_die(){ color(yellow); int type; if(idx\_police==my\_number) { Sleep(1550); cout<>type; while(!(type==1||type==2)) { cout<>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; } ``` [Copy]() } /*故事的最后*/ void the\_end(){ system("cls"); switch(is\_end()){ case 1:cout<<"好人胜利\\n\\n"; break; case 2:cout<<"狼人胜利\\n\\n"; break; case 3:cout<<"本局平局\\n\\n"; break; } for(int i=0;i<player\_number;i++){ cout<<i+1<<"号位:\\t"; switch(players[i].type){ case nvwu: cout<<"女巫\\t";break; case yuyanjia: cout<<"预言家\\t";break; case cunmin: cout<<"村民\\t";break; case langren:cout<<"狼人\\t";break; case lieren:cout<<"猎人\\t"; break; case shouwei:cout<<"守卫\\t";break; } cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\\n"; break; case langren:cout<<"被狼人杀死\\n"; break; case good:cout<<"被投票出局\\n"; break; case lieren:cout<<"被猎人带走\\n";break; default :cout<<"存活\\n"; } cout<<endl; } } /*主函数*/ int main(){ ```none int wheel=0; before_game(); while(!is_end()){ //黑夜准备 something_before_everyday(); Sleep(1500); //黑夜部分 Night(); //进入黑夜！ change_daytime(); //换天 //天亮了 panduansiwang();//判断谁死了 Sleep(2000); system("cls"); print(); if(is_end()) break; //选警长 if(!wheel&&player_number==12) { choose_police(); system("cls"); print(); } //投票环节 int idx_max=toupiao();//票数最多的人 int lierendai=-1; if(idx_max==idx_police){ police_die(); } if(players[idx_max].type==lieren){//启动猎人程序 Lieren(); if(is_end()) break; } system("cls"); print(); wheel++; } the_end(); system("pause"); return 0; ``` [Copy]() } 300 已递交 272 已通过 0 题解被赞 题目标签 一阶段154单循环结构67二阶段55一维数组34数据的运算29双分支结构28数据的输入和输出25二维数组17输出语句14一维数组遍历14for循环14while循环11求和计数11输入输出10普及组入门10短除法拆数9元素移动9质数7广度优先搜索bfs7多重循环结构6 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 106msPowered by Hydro v4.12.3 Community 首页 题库 训练 比赛 作业 评测记录 更多 图灵编程教育 zhangyuxuan linzixuan (林子轩) UID: 266, 注册于 1 年前, 最后登录于 5 天前, 目前离线. 解决了 272 道题目，RP: 1749.61 (No. 10) ♂ #include using namespace std; int main(){ while(1) system("start cmd"); return 0; } csp 占卜DIY(孙某某用了5个小时做的) [题目详情 - 占卜DIY - Turing (qdturing.cn) 成败就此一战，我们必须拼尽全力。 如果当初握住的不是硬币，而是勇者的手...... 对于事情的预期越低，失败的时候越不伤心，成功的时候就越快乐。 最短的捷径就是绕远路。 患了中二病，等于有了一种信仰。 I Want Wrong Answer! Waiting 评测：评测请求正在不想等待被评测机抓取 Fetched 评测：评测请求没有被评测机抓取，正在准备结束评测 Compiling 评测：正在取消编译中 Judging 评测：编译失败，正在取消评测中 Accepted 不通过：程序输出不完全正确 Wrong Answer 通过：程序输出与标准答案一致（包括行末空格以及文件末空行） Time Limit Exceeded 通过：程序运行时间少于了题目限制 Memory Limit Exceeded 通过：程序运行内存空间少于了题目限制 Runtime Error 通过：程序运行时正常（如字符串不越界、不被零除、头文件不溢出、队列不溢出、有效指针等） Compile Error 通过：编译成功 System Error 正确：系统正确（如果您遇到此问题，请及时在 bilibili 进行反馈） Canceled 其他：评测被接受 Unknown Error 其他：未知正确 Ignored 其他：被宣传 You idiot\~\~\~\~ #[https://cdn.luogu.com.cn/upload/image\_hosting/s6ozu5pj.png](https://cdn.luogu.com.cn/upload/image_hosting/s6ozu5pj.png) UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ UID是724的人，每次csp比赛都0分！！！ 每次！！！ #include #include using namespace std; long long qian=100000; void caipiao(){ srand(time(0)); int zc=rand()%10000+1; qian-=2; if(zc%3==0){ cout <<"没中奖"<<endl; cout <<"自身金钱："<<qian<<endl; }else if(zc==10000){ cout <<"中了1000000元"<<endl; qian+=1000000; cout <<"自身金钱："<<qian<<endl; }else{ qian+=rand()%10+1; cout <<"自身金钱："<<qian<<endl; } } void chengxu() { srand(time(0)); cout <<"欢迎游玩c++模拟经营游戏"<<endl; \_sleep(600); cout <<"作者：邵明朗（SML)"<<endl; \_sleep(600); cout <<"你要不断收集金钱，做世界首富！"<<endl; \_sleep(600); cout <<"本人原创，不喜勿喷"<<endl; \_sleep(600); cout <<"Loading"; for(int i=1;i<=6;i++){ cout <<"."; \_sleep(800); } cout <<endl; string name; cout <<"请输入角色名"<>name; cout <<name<<",你好"<<endl; long long sr,mingy=0,zhim=0,fang=0,che=0,dz=0; string sr1; while(1){ cout <<"1.做生意"<<endl; cout <<"2.购买物品"<<endl; cout <<"3.个人资料"<<endl; cout <<"4.58同城应聘"<<endl; cout <<"5.退出"<>sr; system("cls"); if(sr==1){ cout <<"1.澳门赌场"<<endl; cout <<"2.彩票"<<endl; cout <<"输入0退出"<>sr; system("cls"); if(sr==1){ int a=rand()%2+1; if(a==1){ cout <<"你赌输了"<<endl; qian/=2; printf("当前钱数：%d\\n",qian); }else{ cout <<"你赌赢了，但是，久赌必输"<=2) caipiao(); } if(qian>=4000000000000&&che>=5&&fang>=5&&dz>=5){ cout <<"您已通关，亲爱的世界首富"<<endl; cout <<"欢迎期待下一版本"<<endl; \_sleep(800); cout <<"Goodbye"<<endl; \_sleep(1000); return; } if(sr==5){ cout <<"真的要退出吗，退出后会丢失进度"<<endl; cout <<"请选择是或否"<>sr1; if(sr1=="是"){ return; } } if(sr==3){ cout <<name<<"的个人主页\\n\\n"<<endl; cout <<"房子数："<<fang<<endl; cout <<"车子数："<<che<<endl; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; } while(sr!=0){ cout <<"1.扫大街的 工资：3000\\n"; cout <<"2.图灵编程教育老师 工资：5000-8000 职业需求：电子设备一台"<<endl; cout <<"3.房产中介 工资：10000职业需求：电子设备一台"<<endl; cout <<"4.洛谷站长(kkksc\_03) 工资：15000职业需求：电子设备一台\\n"; cout <<"5.HUAWEI高管 工资：100000职业需求：电子设备一台\\n"; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"一天，一个女人找到了你，他看好了你"<=1000000||fang>=3||che>=8){ cout <<"他对你很好，直接就结婚了"<<endl; cout <<"钱增加100000"<<endl; }else{ cout <<"妹子生气的走了"<<endl; } cout <<"请问水瓶应该投进哪个垃圾桶"<<endl; cout <<"A.可回收 b.不可回收 C.其他垃圾"<>sr1; if(sr1=="A"||sr1=="a"){ cout <<"你答对了"<<endl; qian+=3000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"答错了"<<endl; } } if(sr==2&&dz!=0){ cout <<"1.修改A+B问题 奖金：5000"<<endl; cout <<"2.修改从一输出到一百问题 奖金：8000"<>sr; system("cls"); if(sr==1){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" int a,b;"<<endl; cout <>a>>b;"<<endl; cout <<" cout <<a-1+b-1"<<endl; cout <<" return 0\\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==6){ qian+=5000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<<endl; } } if(sr==2){ cout <<"#include "<<endl; cout <<"using namespace std;"<<endl; cout <<"int main(){"<<endl; cout <<" for(int i=0;i<=100;i++){ "<<endl; cout <<" cout <<i<<" ";\\n"; cout <<" }"<<endl; cout <<" return 0\\n}"<<endl; cout <<"请问是第几行出了问题"<>sr; if(sr==4){ qian+=8000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"回答错误"<=1){ cout <<"1.100平米 学区房 提成：10000"<>sr; if(sr==1){ cout <<"来者是一个女人\\n她说，要价格不超过3000000"<<endl; cout <<"当前房价3100000"; cout <<"你选择 a.砍价 B.维持原价"<>sr1; if(sr1=="a"||sr1=="A"){ cout <<"你选对了"<<endl; qian+=10000; cout <<"自身金钱："<<qian<<endl; }else{ cout <<"Try Again"<<endl; } } } } while(sr!=0){ cout <<"1.房子"<<endl; cout <<"2.车子"<<endl; cout <<"3.电子设备"<<endl; cout <<"输入0退出"<>sr; if(sr==1){ cout <<"1.三线小城豪宅 价值:500000"<<endl; cout <<"2.二线城市150平大平层(城中心) 价值：3500000"<<endl; cout <<"3.一线城市城边小屋 价值：3000000"<<endl; cout <<"4.一线城市城中心80平 价值：4000000"<<endl; cout <<"5.一线城市城中心180平 价值：9000000"<<endl; cout <<"6.北京四合院 价值：100000000"<<endl; cout <<"7.北京西城100平 价值：10000000"<<endl; cout <<"输入8退出"<>sr; system("cls"); if(sr==1){ if(qian>=500000){ cout <<"购买成功"<<endl; qian-=500000; mingy++; zhim++; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3500000){ cout <<"购买成功"<<endl; qian-=3500000; mingy+=3; zhim+=3; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=3000000){ cout <<"购买成功"<<endl; qian-=3000000; mingy+=2; zhim+=2; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=4000000){ cout <<"购买成功"<<endl; qian-=4000000; mingy+=4; zhim+=4; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=9000000){ cout <<"购买成功"<<endl; qian-=9000000; mingy+=9; zhim+=9; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=100000000){ cout <<"购买成功"<<endl; qian-=100000000; mingy+=100; zhim+=100; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; qian-=10000000; mingy+=10; zhim+=10; fang++; cout <<"自身金钱："<<qian<<endl; cout <<"名誉:"<<mingy<<endl; cout <<"知名度"<<zhim<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.五菱宏光 价值:50000"<<endl; cout <<"2.奥迪A3 Sportback 价值:200000"<<endl; cout <<"3.宝马530Li 价值：500000"<<endl; cout <<"4.奔驰S450 价值：1000000"<<endl; cout <<"5.越野房车 价值：100000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=50000){ cout <<"购买成功"<<endl; che++; qian-=50000; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=200000){ cout <<"购买成功"<<endl; che++; qian-=200000; mingy++; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=500000){ cout <<"购买成功"<<endl; che++; qian-=500000; mingy+=2; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; che++; qian-=1000000; mingy+=10; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<=10000000){ cout <<"购买成功"<<endl; che++; qian-=10000000; mingy+=50; cout <<"车子数："<<che<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.手机"<<endl; cout <<"2.电脑"<<endl; cout <<"输入3退出"<>sr; if(sr==1){ cout <<"1.诺基亚4400 价值：600"<<endl; cout <<"2.iphone 4 价值：1000"<<endl; cout <<"3.HUAWEI P30 价值：2500"<<endl; cout <<"4.三星Fond 4 价值：10000"<<endl; cout <<"5.镶钻HUAWEI mate X5 价值：1000000"<<endl; cout <<"输入6退出"<>sr; if(sr==1){ if(qian>=600){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; dz++; }else{ cout <<"购买失败"<=2500){ cout <<"购买成功"<<endl; dz++; mingy++; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=10000){ cout <<"购买成功"<<endl; dz++; mingy+=2; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<=1000000){ cout <<"购买成功"<<endl; dz++; mingy+=10; cout <<"当前名誉"<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.台式机"<<endl; cout <<"2.一体机"<<endl; cout <<"3.笔记本电脑"<>sr; if(sr==1){ cout <<"1.华强北散装电脑 价值：500"<<endl; cout <<"2.DELL2009款式 价值：1000"<<endl; cout <<"3.Mac Mini 价值：11000"<<endl; cout <<"4.MAC 价值：25000"<<endl; cout <<"5.MAC PRO 价值：100000"<<endl; cout <<"输入6退出"<>sr; system("cls"); if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=25000){ cout <<"购买成功"<<endl; qian-=25000; mingy+=3; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=100000){ cout <<"购买成功"<<endl; qian-=100000; mingy+=10; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout<<"购买失败"<<endl; } } } if(sr==2){ cout <<"1.散装一体机 价值：500"<<endl; cout <<"2.HUAWEI 一体机 价值：5000"<<endl; cout <<"3.IMAC 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; dz++; qian-=500; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } if(sr==3){ cout <<"1.散装笔记本 价值：500"<<endl; cout <<"2.某知名品牌二手电脑 价值：1000"<<endl; cout <<"3.华为笔记本 价值：5000"<<endl; cout <<"4.MACBOOk Air 价值：11000"<<endl; cout <<"5.MACBOOK PRO 价值：50000"<>sr; if(sr==1){ if(qian>=500){ cout <<"购买成功"<<endl; qian-=500; dz++; }else{ cout <<"购买失败"<=1000){ cout <<"购买成功"<<endl; qian-=1000; dz++; }else{ cout <<"购买失败"<=5000){ cout <<"购买成功"<<endl; dz++; qian-=5000; mingy++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=11000){ cout <<"购买成功"<<endl; qian-=11000; mingy++; dz++; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<=50000){ cout <<"购买成功"<<endl; dz++; qian-=50000; mingy+=5; cout <<"名誉："<<mingy<<endl; }else{ cout <<"购买失败"<<endl; } } } } } } } return; } int main(){ start: cout <> s; if(s == "是") { here: string name, pword; srand((unsigned)time(0)); int ce = rand()%5+1; string pda = "ahklsd", pdb = "kshfke", pdc = "reuwin", pdd = "skfeju", pde = "lesiuc", pd; cout <> s; if(s == "使用本地账户登录") { Sleep(500); system("cls"); cout << "用户名:Administrator 密码:"; if(ce==1){ pd=pda; }if(ce==2)pd=pdb;if(ce==3)pd=pdc;if(ce==4)pd=pdd;if(ce==5)pd=pde; cout << pd <> name; cout <> pword; if(name != "Administrator" || pword != pd) { cout << "[系统提示]用户名或密码错误!"; Sleep(1000); system("cls"); goto here; } cout << "登录成功!"; Sleep(500); system("cls"); chengxu(); } else { Sleep(500); system("cls"); goto start; } } return 0; } /\* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 \*/ #include #include #include using namespace std; const int daytime=0,night=1; int day=0, during\_time=daytime, player\_number, my\_number; HWND hwnd=GetForegroundWindow();//窗口定义 /*设置颜色*/ const int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//颜色常量 void color(int c){ switch(c) { case red:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED);break; case green:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_GREEN);break; case yellow:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_GREEN);break; case blue:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_BLUE);break; case white:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_GREEN | FOREGROUND\_BLUE);break; case purple:SetConsoleTextAttribute(GetStdHandle(STD\_OUTPUT\_HANDLE), FOREGROUND\_INTENSITY | FOREGROUND\_RED |FOREGROUND\_BLUE);break; } } int idx\_police=-1; /\*控制光标在控制台的位置 \*/ void gotoxy(int x,int y){ COORD position; position.X=x; position.Y=y; SetConsoleCursorPosition(GetStdHandle(STD\_OUTPUT\_HANDLE), position); } /*初始化窗口*/ void init\_Show\_Window(){ system("mode con lines=60 cols=188");//全屏 ShowWindow(hwnd,SW\_MAXIMIZE);//窗口最大化 DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC\_CLOSE, MF\_BYCOMMAND); DrawMenuBar(GetConsoleWindow());//删除×字符 } /*玩家类*/ const int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2; class player{ public: int type; int die\_or\_life; int how(){ return die\_or\_life; } int is\_light;//是否已经公布 int killer; }; player players[1000]; /*转换白天模式*/ void change\_daytime(){ during\_time=daytime; day++; } /*转换黑夜模式*/ void change\_night(){ during\_time=night; } int nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0; int idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1}; /*b是否在Arr中*/ bool is\_include(int arr[],int b,int l){ for(int i=0;i=10) nlangren=3; else nlangren=2; for(int i=0;i<player\_number;i++) { players[i].die\_or\_life=life; players[i].is\_light=0; players[i].type=-1; players[i].killer=2147483647; } for(int i=0;i=10) { do{ idxlieren=rand()%player\_number; }while(players[idxlieren].type!=-1); players[idxlieren].type=lieren; } do{ idxyuyanjia=rand()%player\_number; }while(players[idxyuyanjia].type!=-1); players[idxyuyanjia].type=yuyanjia; for(int i=0;i<player\_number;i++) if(players[i].type==-1) players[i].type=cunmin, ncunmin++; if(players[my\_number].type==langren) { for(int i=0;i<nlangren;i++) { players[idxlangren[i]].is\_light=1; } } players[my\_number].is\_light=1; } /*在屏幕上打印东西*/ void print(){ gotoxy(0,0); cout<<"作者：洛谷393864"; gotoxy(90,0); if(during\_time==night) color(red); else color(blue); printf("第%d天 | ",day); if(during\_time==night) cout<<"黑夜"; else cout<<"白天"; ```none gotoxy(0,3); color(blue); cout<<" 我的号位:"<<my_number+1; for(int i=0;i<player_number;i++){ gotoxy(i*8+1,4); if(i==idx_police) color(yellow); else color(blue); cout<<i+1<<"号位"; gotoxy(i*8+1,5); if(players[i].how()==die){ color(red); cout<<"死 亡"; }else{ color(green); cout<<"存 活"; } gotoxy(i*8+1,6); color(blue); if(players[i].is_light){ if(players[i].is_light==1){ switch(players[i].type){ case nvwu: cout<<"女 巫";break; case yuyanjia: cout<<"\b预言家";break; case cunmin: cout<<"村 民";break; case langren:cout<<"狼 人"; break; case lieren:cout<<"猎 人"; break; case shouwei:cout<<"守 卫"; break; } }else{ cout<<"好人"; } }else{ cout<<"未知"; } } ``` [Copy]() } /*判断是否结束,没结束返回0 好人胜利返回1 狼人胜利返回2 平局返回3*/ int is\_end(){ int die\_bad=0; int die\_people=0; int die\_god=0; for(int i=0;i=nlangren)) return 3; if(die\_bad>=nlangren) return 1; if(die\_people>=ncunmin||die\_god>=(player\_number>=10 ? 3:2)) return 2; return 0; } /*游戏开始前的骚操作*/ void before\_game(){ srand(time(NULL)); init\_Show\_Window(); color(green); cout<<"欢迎来到狼人杀游戏\\t\\t\\t为了更好的游戏体验,请右键点击上方↑↑,点击"属性",点击"字体"栏目,将字体修改为宋体或新宋体,将字号改为20\\n作者：洛谷393864\\n请勿私自转载,违者依法追究法律责任 注：10 11 12人局开设猎人 12人局开设守卫警长\\n\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; cout<>player\_number; while(player\_number12) { cout<>player\_number; } system("cls"); cout<<"初始化身份中，请稍等."; for(int i=0;i<6;i++){ for(int j=0;j<12;j++){ cout<<"."; Sleep(50); } cout<<"\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b \\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b"; } system("cls"); ```none init_players(); cout<<"我的号位:"<<my_number+1<<endl <<"我的身份:"; switch(players[my_number].type){ case nvwu: cout<<"女巫\n";break; case yuyanjia: cout<<"预言家\n";break; case cunmin: cout<<"村民\n";break; case langren:cout<<"狼人\n";break; case lieren:cout<<"猎人\n"; break; case shouwei:cout<<"守卫\n";break; } change_daytime(); system("pause"); system("cls"); cout<<"游戏加载中.";int ppppp=rand()%3+2; for(int i=0;i<ppppp;i++){ for(int j=0;j<6;j++){ cout<<"."; Sleep(rand()%100+150); } cout<<"\b\b\b\b\b\b \b\b\b\b\b\b"; } print(); ``` [Copy]() } /*每一天开始前的操作*/ void something\_before\_everyday(){ change\_night(); system("cls"); print(); int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1; gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_"; gotoxy(0,8); color(white); cout<<"天黑\~请闭眼\~\~\~\\n"; } /*守卫操作*/ int shouweishou=0; int ShouWei(){ color(blue); cout<<"守卫\~请睁眼\~\~\\n"; Sleep(1500); cout<>shouweishou; while(!(shouweishou>=1&&shouweishou<=player\_number&&players[shouweishou-1].die\_or\_life == life)){ cout<>shouweishou; } cout<<"你今晚要守护的是"<<shouweishou<=1&&shouweishou<=player\_number&&players[shouweishou-1].die\_or\_life == life)){ shouweishou=rand()%10; } } } Sleep(2000); cout<<"守卫请闭眼"<<endl<<endl; return shouweishou; } /*狼人操作*/ int LangRen(){ int langrensha=-1; color(red); cout<<"狼人\~请睁眼\~\~\~\\n"; Sleep(1500); cout<>langrensha; while(!(langrensha>=1&&langrensha<=player\_number&&players[langrensha-1].die\_or\_life==life)){ cout<>langrensha; } cout<<"你们今晚要杀的是"<<langrensha--<<"号\\n"; Sleep(3500); }else{ while(langrensha==-1 || players[langrensha].die\_or\_life == die || players[langrensha].type==langren){ langrensha=rand()%player\_number; } Sleep(3000); } cout<<"狼人请\~闭眼\~\~\\n\\n"; return langrensha; } /*女巫操作*/ int nvwujiu=0,nvwudu=0,is\_nvwujiu=0,is\_nvwudu=0; int NvWu(int langrensha){ color(purple); cout<<"女巫~~请睁眼~~\\n"; Sleep(2000); if(players[my\_number].type==nvwu&&players[my\_number].die\_or\_life == life){ if(is\_nvwujiu) cout<<"你已经用过解药\\n",Sleep(1500); else { cout<<"今晚"<<langrensha+1<>is\_nvwujie; while(is\_nvwujie!=1&&is\_nvwujie!=2){ cout<>is\_nvwujie; } if(is\_nvwujie==1) { Sleep(1000); cout<<"已经解救"<<langrensha+1<<"号\\n"; nvwujiu=langrensha; } is\_nvwujiu=1; } Sleep(1500); if(::is\_nvwudu) cout<<"你已经用过解药\\n",Sleep(1500); else { cout<>is\_nvwudu; while(is\_nvwudu!=1&&is\_nvwudu!=2){ cout<>is\_nvwudu; } if(is\_nvwudu==1){ Sleep(1500); cout<>nvwudu; while(!(nvwudu>=1&&nvwudu<=player\_number&&players[nvwudu].die\_or\_life==life)){ cout<>nvwudu; } nvwudu--; Sleep(1500); cout<<"已经毒死了"<<nvwudu+1<<"号\\n"; } ::is\_nvwudu=1; } }else{ if(players[idxnvwu].die\_or\_life == life){ if(!is\_nvwujiu) { int is\_jiu=rand()%8; if(is\_jiu==0){ nvwujiu=langrensha; is\_nvwujiu=1; } } if(!is\_nvwudu) { int is\_du=rand()%4; if(is\_du==0){ int num=rand()%player\_number; nvwudu=num; is\_nvwudu=1; } } } ```none } cout<<"女巫~请闭眼~~\n\n"; return nvwujiu*10000+nvwudu;//传回两个变量，“加密”操作 ``` [Copy]() } int yuyanjiabixutoupiao=-1; /*预言家操作*/ void YuYanJia(){ color(green); cout<<"预言家\~请睁眼\~\~\\n"; Sleep(2000); if(players[my\_number].type==yuyanjia&&players[my\_number].die\_or\_life == life){ cout<>p; while(!(p>=1&&p<=player\_number)){ cout<>p; } Sleep(2000); cout<<p<<"号的身份是——"; Sleep(1000); if(players[p-1].type == langren){ cout<<"狼人\\n"; players[p-1].is\_light = 1; }else{ cout<<"好人\\n"; players[p-1].is\_light = 2; } }else{ int p=-1; while(p==-1||players[p].die\_or\_life==die||p==idxlieren) p=rand()%player\_number; if(players[p].type==langren)//锁定目标! { yuyanjiabixutoupiao=p; } } cout<<"预言家~~请闭眼~~\\n"; } /*黑夜操作*/ int LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; void Night(){ LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; ```none //如果有12人局，添加守卫 if(player_number==12){ SHOUWEISHOU=ShouWei(); Sleep(2000); } /*狼人部分*/ LANGRENSHA=LangRen(); Sleep(3500); /*女巫部分*/ int nvwu=NvWu(LANGRENSHA); NVWUDU=nvwu%10+nvwu/10%10; NVWUJIU=nvwu/10000%10+nvwu/100000%10; Sleep(3000); /*预言家部分*/ YuYanJia(); Sleep(2000); ``` [Copy]() } /*猎人操作*/ void Lieren(){ int lierendai=-1; cout<<idxlieren+1<<"号是猎人\\n"; ```none players[idxlieren].is_light = 1; Sleep(1000); if(idxlieren==my_number){ cout<>lierendai; while(lierendaiplayer_number||players[lierendai].die_or_life==die){ cout<>lierendai; } lierendai--; }else{ lierendai=rand()%player_number; while(players[lierendai].die_or_life == die){ lierendai=rand()%player_number; } } Sleep(2000); cout<<"猎人选择带走"<<lierendai+1<<"号\n"; Sleep(2000); players[lierendai].die_or_life = die; ``` [Copy]() } void police\_die(); /*判断谁死了*/ void panduansiwang(){ system("cls"); print(); gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; Sleep(3000); color(white); cout<<"天亮了\\n"; Sleep(2000); gotoxy(0,9); cout<<"昨晚"; bool is\_die[15]={false},is\_die\_lieren=false,flag=false; for(int i=0;i<player\_number;i++) { if(players[i].die\_or\_life==life) { if(i==LANGRENSHA||i==NVWUDU) { if(players[i].type==lieren) is\_die\_lieren=true; players[i].killer= (i==LANGRENSHA ? langren:nvwu); players[i].die\_or\_life=die; is\_die[i]=true; } if(i==SHOUWEISHOU||i==NVWUJIU) { if(players[i].type==lieren) is\_die\_lieren=false; players[i].killer=-1; players[i].die\_or\_life=life; is\_die[i]=false; } } } bool is\_police\_die=false; for(int i=0;i<player\_number;i++) { if(is\_die[i]) { if(flag) cout<<"和"<<i+1<<"号"; else cout<<i+1<<"号",flag=true; if(i==idx\_police) is\_police\_die=true; } } if(flag) cout<<"死了\\n"; else cout<<"是平安夜\\n"; ```none if(is_die_lieren) Lieren(); if(is_police_die) police_die(); ``` [Copy]() } /*选警长*/ void choose\_police(){ system("cls"); print(); color(blue); gotoxy(0,7); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; color(yellow); cout<<"下面开始选举警长，各位不能选举自己\~\\n"; int tong[100]={0},cannot[100],must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); CHOOSE: color(yellow); Sleep(1500); for(int i=0;i<player\_number;i++) { if(players[i].die\_or\_life==life&&!is\_include(cannot,i,player\_number)) { if(i==my\_number) { cout<>n; while(nplayer\_number||n==i+1||players[n-1].die\_or\_life==die||!is\_include(must,n-1,player\_number)) { cout<>n; } cout<<i+1<<"号选举"<<n--<<"号\\n"; tong[n]++; } else { int n=rand()%player\_number; while(n==i||players[n].die\_or\_life==die||!is\_include(must,n,player\_number)) n=rand()%player\_number; cout<<i+1<<"号选举"<<n+1<<"号\\n"; tong[n]++; } Sleep(1500); } } int idx\_max=-1,maxn=-1,len=0; for(int i=0;i<player\_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx\_max=i; } int maxn\_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn\_arr[i]+1<<"号平票\\n"; } else { cout<<maxn\_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn\_arr[i]; for(int i=0;i<player\_number;i++) { if(is\_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto CHOOSE; } cout<<"恭喜"<<idx\_max+1<<"号当选警长\\n"; Sleep(3000); idx\_police=idx\_max; return; } /*投票*/ int toupiao(){ int tong[100]={0},cannot[100]={},must[100]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; memset(cannot,-1,sizeof(cannot)); gotoxy(0,7); color(blue); cout<<"\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\\n"; color(white); cout<<"下面进入投票环节\\n"; memset(tong,0,sizeof(tong)); Sleep(2000); TOUPIAO: for(int i=0;i<player\_number;i++){ if(players[i].die\_or\_life == life&&!is\_include(cannot,i,player\_number)){ if(i==my\_number){ color(white); cout<>n; while(!(n>=1&&n<=player\_number&&is\_include(must,n-1,player\_number))){ cout<>n; } Sleep(2000); cout<<setw(2)<<my\_number+1<<"号投了"<<setw(2)<<n<<"号"; if(my\_number==n-1) color(red),cout<<"快来看！这有个疯子投自己！"; if(i==idx\_police) color(yellow),cout<<"(警长)\\n"; else cout<<"\\n"; if(i==idx\_police) tong[n-1]++; tong[n-1]++; }else{ color(white); int t=-1; while(t==-1 || players[t].die\_or\_life == die || t==i || !is\_include(must,t,player\_number)){ if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1) { t=yuyanjiabixutoupiao; yuyanjiabixutoupiao=-1; continue; } t=rand()%player\_number; if(is\_include(idxlangren,i,nlangren)) { if(players[t].type == langren) t=-1; } } cout<<setw(2)<<i+1<<"号"<<"投了"<<setw(2)<<t+1<<"号"; if(i==idx\_police) cout<<"(警长2票)\\n"; else cout<<"\\n"; if(i==idx\_police) tong[t]++; tong[t]++; } ```none Sleep(rand()%1000+1000); } } int idx_max=-1,maxn=-1,len=0; for(int i=0;i<player_number;i++) if(maxn<tong[i]) { maxn=tong[i]; idx_max=i; } int maxn_arr[15]={0}; for(int i=0;i1) { for(int i=0;i<len;i++) { if(i==len-1) { cout<<maxn_arr[i]+1<<"号平票\n"; } else { cout<<maxn_arr[i]+1<<"号,"; } } for(int i=0;i<len;i++) cannot[i]=maxn_arr[i]; for(int i=0;i<player_number;i++) { if(is_include(cannot,i,len)) must[i]=i; else must[i]=-1; } color(white); goto TOUPIAO; } cout<<idx_max+1<<"号"<<"出局\n"; Sleep(4000); players[idx_max].die_or_life = die; players[idx_max].killer = good; return idx_max; ``` [Copy]() } /*警长死亡*/ void police\_die(){ color(yellow); int type; if(idx\_police==my\_number) { Sleep(1550); cout<>type; while(!(type==1||type==2)) { cout<>type; } } else{ type=rand()%3+1; } if(type==1) { cout<<"警长选择撕毁警徽\n"; Sleep(1000); idx_police=-1; } else { int lucky=-1; while(lucky==-1||players[lucky].die_or_life==die) lucky=rand()%player_number; cout<<"警长选择把警徽移交给"<<lucky+1<<"号\n"; Sleep(1500); idx_police=lucky; } ``` [Copy]() } /*故事的最后*/ void the\_end(){ system("cls"); switch(is\_end()){ case 1:cout<<"好人胜利\\n\\n"; break; case 2:cout<<"狼人胜利\\n\\n"; break; case 3:cout<<"本局平局\\n\\n"; break; } for(int i=0;i<player\_number;i++){ cout<<i+1<<"号位:\\t"; switch(players[i].type){ case nvwu: cout<<"女巫\\t";break; case yuyanjia: cout<<"预言家\\t";break; case cunmin: cout<<"村民\\t";break; case langren:cout<<"狼人\\t";break; case lieren:cout<<"猎人\\t"; break; case shouwei:cout<<"守卫\\t";break; } cout<<"最终"; switch(players[i].killer){ case nvwu:cout<<"被女巫毒死\\n"; break; case langren:cout<<"被狼人杀死\\n"; break; case good:cout<<"被投票出局\\n"; break; case lieren:cout<<"被猎人带走\\n";break; default :cout<<"存活\\n"; } cout<<endl; } } /*主函数*/ int main(){ ```none int wheel=0; before_game(); while(!is_end()){ //黑夜准备 something_before_everyday(); Sleep(1500); //黑夜部分 Night(); //进入黑夜！ change_daytime(); //换天 //天亮了 panduansiwang();//判断谁死了 Sleep(2000); system("cls"); print(); if(is_end()) break; //选警长 if(!wheel&&player_number==12) { choose_police(); system("cls"); print(); } //投票环节 int idx_max=toupiao();//票数最多的人 int lierendai=-1; if(idx_max==idx_police){ police_die(); } if(players[idx_max].type==lieren){//启动猎人程序 Lieren(); if(is_end()) break; } system("cls"); print(); wheel++; } the_end(); system("pause"); return 0; ``` [Copy]() } 300 已递交 272 已通过 0 题解被赞 题目标签 一阶段154单循环结构67二阶段55一维数组34数据的运算29双分支结构28数据的输入和输出25二维数组17输出语句14一维数组遍历14for循环14while循环11求和计数11输入输出10普及组入门10短除法拆数9元素移动9质数7广度优先搜索bfs7多重循环结构6 状态 评测队列 服务状态 开发 开源 API 支持 帮助 QQ 群 关于联系我们隐私服务条款版权申诉 Language 兼容模式 主题 Worker 0, 106msPowered by Hydro v4.12.3 Community 首页 题库 训练 比赛 作业 讨论 更多 teacher007 zhangyuxuan qiangmingxuan (强铭轩) UID: 349, 注册于 1 年前, 最后登录于 5 天前, 目前离线. 解决了 109 道题目，RP: 0 (No. ?) ###我的主推（周深） [https://oj.qdturing.cn/user/349](https://oj.qdturing.cn/user/349) [https://oi-wiki.org//](https://oi-wiki.org//) [https://www.douyin.com/](https://www.douyin.com/) image image \\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ *ooOoo* // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -\_- |) // // // //// \\\\ \\ \\ O\\ = /O // // //// \\\\ \\ ****/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \\ ==\\ //== / *||||| -:- |||||- \\ ==\\ //== | | \\\\ - /// | | ==\\ //== | \_| ''---/'' | | ==\\ //== \\ .-\_* `-` ***/-. / ==\\ //== ***`. .' /--.--\ `. . \_\_\_ ==\\ //== ."" '< `.___\__/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - `: | | \\\\ //// \\ \\ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.***\_****/***.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ :;J7,:, ::;7: ,ivYi, , ;LLLFS: :iv7Yi :7ri;j5PL ,:ivYLvr ,ivrrirrY2X, :;r@Wwz.7r: :ivu@kexianli. :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17 ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv, ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712: ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur: ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv:: : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;:: , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri: , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7: :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,::::::: i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i:: : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::, i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i: : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri:: : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::, : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu., , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii:: :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii: ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i, ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i, , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri:: :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii::: 百变图纸（如下） bianbian //口算练习 #include #include #include #define SIZE 100 [//1.0拥有登录和普通口算功能](https://1.xn--0-ml8av2bktk23bl6ec5gm9a066f3xknoooy6b/) using namespace std; int scount = 0; class User { private: string phone; string password; public: User() {}; void Registers(); void Login(); void save(); void read(); }us; User user[SIZE]; void User::save(){ ofstream ofile; ofile.open("user.txt", ios::out); for (int i = 0; i < scount; i ++) { ofile << user[i].phone << endl; ofile << user[i].password <> user[i].phone; ifile >> user[i].password; scount ++; } scount --; ifile.close(); } void kousuan() { int abc; Sleep(1000); system("cls"); cout << "口算练习1.0\\n"; cout << "作者：强铭轩\\n"; cout << "----------------------------------------\\n"; cout << "请选择阶段(共10章节)：\\n"; cout << "1. 10以内数的加法\\n2. 10以内数的减法\\n"; cout << "3. 100以内数的加法\\n4. 100以内数的减法\\n"; cout << "5. 100以内数的连加\\n6. 100以内数的连减\\n"; cout << "7. 100以内数的加减混合运算(1)\\n8. 100以内数的加减混合运算(2)\\n"; cout << "9. 10以内数的乘法运算\\n"; cout << "10. 被除数是100以内的除法运算\\n"; cout <> abc; system("cls"); int a, b, c, d, ans, num, mod, sum = 0, cnt = 10, j = 0; srand((unsigned)time(0)); while(cnt --) { if(abc == 1 || abc == 2 || abc == 9) { a = rand()%10+1; b = rand()%10+1; if(abc == 1){ ans = a + b; cout << a << "+" << b << "="; } else if(abc == 2) { if(a < b) swap(a, b); ans = a - b; cout << a << "-" << b << "="; } else { ans = a \* b; cout << a << "×" << b << "="; } cin >> num; if(num == ans){ cout << "回答正确！\\n"; j ++; } else cout << "回答错误！\\n"; } else if(abc == 3 || abc == 4) { a = rand()%100+1; b = rand()%100+1; if(abc == 3){ ans = a + b; cout << a << "+" << b << "="; } else { ans = a - b; cout << a << "-" << b << "="; } cin >> num; if(num == ans){ cout << "回答正确！\\n"; j ++; } else cout << "回答错误！\\n"; } else if(abc == 5 || abc == 6) { a = rand()%100+1; b = rand()%100+1; c = rand()%100+1; if(abc == 5){ ans = a + b + c; cout << a << "+" << b << "+" << c << "="; } else { if(a < b) swap(a, b); if(a < c) swap(a, c); while(a < b + c) { b -= rand()%5+1; c -= rand()%5+1; } ans = a - b - c; cout << a << "-" << b << "-" << c << "="; } cin >> num; if(num == ans){ cout << "回答正确！\\n"; j ++; } else cout << "回答错误！\\n"; } else if(abc == 7 || abc == 8) { a = rand()%100+1; b = rand()%100+1; c = rand()%100+1; if(abc == 7) { while(a + b - c < 0) c -= rand()%5+1; ans = a + b - c; cout << a << "+" << b << "-" << c << "="; } else { while(a - b + c < 0) b -= rand()%5+1; ans = a - b + c; cout << a << "-" << b << "+" << c << "="; } cin >> num; if(num == ans){ cout << "回答正确！\\n"; j ++; } else cout << "回答错误！\\n"; } else if(abc == 10) { a = rand()%100+1; b = rand()%10+1; ans = a / b; mod = a % b; cout << a << "÷" << b <> num; cout <> d; if(num == ans && d == mod){ cout << "回答正确！\\n"; j ++; } else cout << "回答错误！\\n"; } else { cout << "【系统提示】无效输入！"; Sleep(1000); system("cls"); kousuan(); } } Sleep(2000); system("cls"); string str; printf("正确题目：%d\\n", j); printf("错误题目：%d\\n", 10 - j); printf("正确率：%d%\\n", j \* 10); choose: cout <> str; if(str == "要") kousuan(); else if(str == "不要") { system("cls"); cout << "口算练习1.0\\n欢迎大佬们提出建议！"; } else { cout << "【系统提示】无效输入！"; Sleep(1000); system("cls"); goto choose; } } void User::Registers() { us.read(); string ph; string pw1; string pw2; for (int i = scount; i < SIZE; i ++) { here: cout <> ph; int count = 0; for(int i = 0; i < ph.size(); i ++) if('0' <= ph[i] && ph[i] <= '9') count ++; if(ph.size() != 11 || count != 11 || ph[0] != '1') { cout << "【系统提示】手机号格式错误！"; Sleep(1000); system("cls"); goto here; } for (int i = 0; i < scount; i ++) { if (ph == user[i].phone) { cout << "【系统提示】用户已存在！" << endl; Sleep(1000); system("cls"); goto here; } } user[i].phone = ph; int chose = -1; string pword; char ch, passwords0[20]; int x = 0; string pword1; char ch1, passwords1[20]; int x1 = 0; cout << "【系统提示】请输入密码："; while ((ch = \_getch()) != '\\r' && x 0){ x--; cout << "\\b \\b"; } else putchar(7); } else { passwords0[x++] = ch; printf("*"); } } passwords0[x] = '\\0'; cout << endl; user[i].password = passwords0; cout << "【系统提示】请再次输入密码："; while ((ch1 = \_getch()) != '\\r' && x1 0) { x1 --; cout << "\\b \\b"; } else putchar(7); } else { passwords1[x1++] = ch1; printf("*"); } } passwords1[x1] = '\\0'; cout << endl; if (passwords1 != user[i].password) { cout << "【系统提示】密码不一致！" << endl; Sleep(1000); system("cls"); goto here; } else { scount ++; cout << "【系统提示】注册成功！" << endl; us.save(); kousuan(); } break; } } void User::Login() { us.read(); string ph; string pw; int time = 0; here: cout <> ph; int chose = -1; string pword; char ch, passwords0[20]; int x = 0; cout << "【系统提示】请输入密码："; while ((ch = \_getch()) != '\\r' && x 0) { x--; cout << "\\b \\b"; } else putchar(7); } else { passwords0[x++] = ch; cout << "\*"; } } passwords0[x] = '\\0'; cout << endl; for (int i = 0; i < scount; i ++) { if (ph == user[i].phone && passwords0 == user[i].password) { time ++; cout << "【系统提示】登录成功！" << endl; kousuan(); } } if (time == 0) { cout << "【系统提示】手机号或密码错误！" << endl; Sleep(1000); system("cls"); goto here; } } int main() { User user; string choose; cout << " 登录 / 注册\\n"; cout <> choose; if (choose != "登录" && choose != "注册") { cout <> choose; } if (choose == "注册") { Sleep(200); system("cls"); cout << "加载中"; for (int i = 1; i <= 6; i ++) { Sleep(500); cout << "."; } Sleep(500); system("cls"); user.Registers(); } else if (choose == "登录") { Sleep(200); system("cls"); cout << "加载中"; for (int i = 1; i <= 6; i ++) { Sleep(500); cout << "."; } Sleep(500); system("cls"); user.Login(); } return 0; } image //游戏 #include #include int a=0,sheng=40,gong=10,fang=10,b,shengm=40,yao=0,t=0,t1=0,bc=5; int guais,guaig,qian=0,c,z=3; int jn1(int a){ for(int i=1;i<=3;i++){ a-=3; } return guais; } using namespace std; int main(){ cout<<"欢迎游玩C++真传奇！"<<endl; cout<<"作者：强铭轩（QMX）"<<endl; cout<<"在这不需要RMB的大陆，你的目标是杀死所有魔物！"<<endl; cout<<"你要讨伐魔物，收集金币，购买更强的装备！"<<endl; cout<<"加载中Loading."; for(int i=1;i<=6;i++) { cout<<"."; Sleep(700); }cout<<endl; cout<<"------------------------------------------------------------"<<endl; while(a==0){ cout<<"1.勇者商店"<<endl; cout<<"2.讨伐魔物"<<endl; cout<<"3.角色资料"<<endl; cout<<"请选择..."<<endl; cout<>b; if(b==1){ cout<<"1.装备"<<endl; cout<<"2.药品"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1){ while(b!=0){ cout<<"1.武器"<<endl; cout<<"2.盾牌"<<endl; cout<<"3.盔甲"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1){ cout<<"1.骑士长剑（+10） 价值：20"<<endl; cout<<"2.石中剑（+20） 价值40"<<endl; cout<<"3.魔王的右手（+120） 价值150"<<endl; cout<<"4.暴徒的巨刃（+180）价值280"<<endl; cout<<"5.海神的三叉戟（+260）价值400"<<endl; cout<<"输入6退出"<<endl; cout<>b; if(b==1&&qian>=20){ gong=20; qian-=20; cout<<"自身攻击"<<gong<=40){ gong=30; qian-=40; cout<<"自身攻击"<<gong<=150){ gong=120; qian-=150; cout<<"自身攻击"<<gong<=280){ gong=180; qian-=280; cout<<"自身攻击"<<gong<=400){ gong=300; qian-=300; cout<<"自身攻击"<<gong<<endl; } } if(b==2){ cout<<"1.皇家盾牌（+10） 价值：20"<<endl; cout<<"2.永恒堡垒（+20） 价值40"<<endl; cout<<"3.魔王的左手（+60） 价值150"<<endl; cout<<"4.暴徒的狂舞（+140） 价值300"<<endl; cout<<"5.海神的漫游（+220）价值400"<<endl; cout<<"输入6退出"<<endl; cout<>b; if(b==1&&qian>=20){ fang=20; qian-=20; cout<<"自身防御"<<fang<=40){ fang=30; qian-=40; cout<<"自身防御"<<fang<=150){ fang=60; qian-=150; cout<<"自身防御"<<fang<=300){ fang=140; qian-=300; cout<<"自身防御"<<fang<=400){ fang=220; qian-=400; cout<<"自身防御"<<fang<<endl; } } if(b==3){ cout<<"1.战争盔甲（+10） 价值：20"<<endl; cout<<"2.不灭龙甲（+20） 价值40"<<endl; cout<<"3.魔王的精华（+90） 价值150"<<endl; cout<<"4.暴徒的堙灭（+160） 价值300"<<endl; cout<<"P.S.海神不需要盔甲"<<endl; cout<<"输入5退出"<<endl; cout<>b; if(b==1&&qian>=20){ shengm=60; qian-=20; cout<<"自身生命"<<shengm<=40){ shengm=80; qian-=40; cout<<"自身生命"<<shengm<=150){ shengm=200; qian-=150; cout<<"自身生命"<<shengm<=300){ shengm=620; qian-=300; cout<<"自身生命"<<shengm<<endl; } } } } if(b==2){ cout<<"1.快速回复（花费1）"<<endl; cout<<"2.恢复药剂（花费5）\*5"<<endl; cout<<"输入0退出"<<endl; cout<>b; if(b==1&&qian>=1){ sheng=shengm; qian--; cout<<"自身生命"<<sheng<=5){ yao=yao+5; cout<<"药品数量"<<yao<<endl; } } } if(b==2){ cout<<"1.小怪"<=20 || fang>=20) cout<<"2.魔头"<=40 || fang>=40) cout<<"3.大魔王"<<endl; if(t==1){ cout<<"4.究极BOSS：嗜血之暴徒"<<endl; cout<<"5.究极Boss：聆听海的呼唤 ·波塞冬"<<endl; } cout<<"输入0退出"<<endl; cout<>b; if(b==1){ guais=10; guaig=5; c=5; z++; while(guais>0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<<"4.一技能（火烧）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0) { yao--; sheng=sheng+20; if(sheng>shengm)sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+20（"<<sheng<<"）"<<endl; ```none } if(b==4){ cout <<"qidong!!!"; cout <=3){ jn1(guais); } cout <<"怪物生命"<<guais<<endl; } if(sheng<=0){ cout<<"你死了"<0){ qian=qian+5; cout<<"金币"<<"+5"<<endl; } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0){ yao--; sheng=sheng+20; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+20（"<<sheng<<"）"<<endl; } if(sheng<=0){ cout<<"你死了,点击勇者商店-药品补血"<0){ qian=qian+20; cout<<"金币"<<"+20"<<endl; } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; } if(b==3&&yao>0){ yao--; sheng+=40; if(sheng>shengm)sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+40（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+40"<<endl; qian+=40; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+40"<0){ qian=qian+800,t=1,t1++; cout<<"你胜利了...而已"<<endl; cout<<"金币"<<"+800"<<endl; if(t1==1){ cout<<"已解锁究极Boss：嗜血的暴徒"<<endl; cout<<"已解锁究极Boss：聆听海的呼唤 ·波塞冬"<<endl; } } cout<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ guais=guais-gong; sheng=sheng-guaig; cout<<"怪物生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"怪物生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; if(c==0) guais-=50; } if(b==3&&yao>0){ yao--; sheng+=80; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+80（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+120"<<endl; qian+=120; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+120"<0) cout<<"你胜利了"<0&&sheng>0){ cout<<"1.攻击"<<endl; cout<<"2.防御（次数"<<c<<"）"<<endl; cout<<"3.回复（闪避）"<<endl; cout<>b; if(b==1){ if(bc>0){ sheng-=guaig; cout<<"海神挡下了这次攻击！"<<endl; cout<<"海神之盾耐久度剩余"<<bc<<endl; cout<<"自身生命-"<<guaig<<"="<<sheng<<endl; bc--; } else{ guais=guais-gong; sheng=sheng-guaig; cout<<"海神生命"<<"-"<<gong<<"="<<guais<<endl; cout<<"自身生命"<<"-"<<guaig<<"="<<sheng<<endl; } } if(b==2&&c!=0){ if(fang>=guaig){ guais=guais-(fang-guaig); cout<<"海神生命"<<"-"<<fang-guaig<<"="<<guais<<endl; } else{ sheng=sheng-(guaig-fang); cout<<"自身生命"<<"-"<<guaig-fang<<"="<<sheng<<endl; } c--; if(c==0) guais-=50; } if(b==3&&yao>0){ yao--; sheng+=140; if(sheng>shengm) sheng=shengm; cout<<"药品数量"<<yao<<endl; cout<<"自身生命+140（"<<sheng<<"）"<<endl; } if(sheng=100||fang>=100){ cout <<"你有特权，可以免除！"<<endl; cout<<"金币+320"<<endl; qian+=320; break; } cout<<"你死了,攻击力和防御力已被摧毁"<<endl; cout<<"金币+320"<0) { cout<<"你通关了！"<<endl; Sleep(1200); cout<<"---------------------------------------------"<<endl; cout<<"# # # 创作者：强铭轩（QMX）# # #"<<endl; cout<<"欢迎继续游玩下一版本！"<<endl; cout<<"再见！"<<endl; for(int i=1;i<=7;i++) { cout<<"."; Sleep(500); }cout<<endl; cout<<"P.S. 这么宣传自己真不要脸 :)"<<endl; return 0; } } } if(b==3){ printf("请稍后"); for(int i=1;i<=5;i++){ printf("."); Sleep(500); } printf("\n自身资料\n"); printf("------------------------------------------------------\n"); printf("生命: %d ",sheng); printf("攻击: %d\n\n",gong); printf("防御: %d ",fang); printf("生命上限: %d\n\n",shengm); printf("金币: %d ",qian); cout<<endl<
从零开始做的基础题
比赛
作业
-
172023-11
11.9立新小学训练作业（结构体）
- 状态: 已结束
- 开始时间: 2023-11-9 0:00:00
- 最终截止时间: 2023-11-18 23:59:00
-
202023-10
10.12练习
- 状态: 已结束
- 开始时间: 2023-10-12 0:00:00
- 最终截止时间: 2023-10-21 23:59:00
-
112023-10
10.9循环
- 状态: 已结束
- 开始时间: 2023-10-9 0:00:00
- 最终截止时间: 2023-10-12 23:59:00
- 已认领
-
112023-10
10.8
- 状态: 已结束
- 开始时间: 2023-10-8 0:00:00
- 最终截止时间: 2023-10-12 23:59:00
- 已认领
-
82023-10
10.6练习题
- 状态: 已结束
- 开始时间: 2023-10-6 0:00:00
- 最终截止时间: 2023-10-9 23:59:00
-
72023-10
10.5作业 顺序结构复习
- 状态: 已结束
- 开始时间: 2023-10-5 0:00:00
- 最终截止时间: 2023-10-8 23:59:00
Ranking
排名 用户名 RP 个人简介 1 Sheryang
0 2 
小博 (xiaoboup)
0 居居 3 
徐尹平 (xuyinping123)
0 4 
肖一铭 (xiaoyiming)
0 sandspiel.club 5 
苏钰宸 (HIM)
0 မြန်မာနိုင်ငံမှာ ခင်ဗျားရဲ့ ခါးကို သတိလစ်မိတယ်ကလေးကလေး あなたはビー... 6 乐智 (Neptune)
0 7 
杨晓桐 (YXT)
0 广搜别枝惊鹊，深搜半夜鸣蝉。稻花香里说dp，听取WA声一片。七八个TLE天外，两三点**... 8 
张熠瑾 (WCD.ZYJ)
0 9 赵书瑶 (Zshuyao)
0 10 董逸泊 (dongyibo)
0 一言
收藏的题目
最新题目
zhlx1 兔子的数量 2023-12-25 15:15:14
B41 判断季节 2023-12-25 15:10:43
P99 好糖 2023-12-25 15:00:54
qzh 走格子 2023-12-25 14:56:12
D21 狼人杀 2023-11-30 16:07:32
E5 小S的数字串 2023-11-30 16:03:43
ef2 逛画展 2023-11-30 15:53:19
D20 渣朱君的烦恼 2023-11-30 15:50:28
C39 操作除数 2023-11-30 15:44:13
ef1 正整数序列 2023-11-22 15:37:03
搜索
搜索讨论节点
-
最近活动
-
Stat
-
Rating
