王梓宸 (王梓宸)
UID: 1063, 注册于 2023-7-9 9:17:19, 最后登录于 2024-12-27 13:46:23, 最后活动于 2025-1-13 18:01:49.
解决了 136 道题目，RP: 1496.5 (No. 98)
-
个人简介
你爸爸太懒，这里啥也没写 (´・ω・｀)
#include<bits/stdc++.h> using namespace std; int main(){ int a,b,c,d,mm=-2e9; cin>>a>>b; for(int i=1;i<=a;i++){ cin>>c>>d; if(b>=d){ mm=max(mm,c); } } cout<<mm; return 0; }
玉桂狗 #include<bits/std+.h> using namespace std; int n[10000005]; int main(){ int a,b,c,minn; cin>>a; for(int i=1;i<=a;i++){ cin>>b; n[i]=b; } for(int i=1;i<=a;i++){ minn=i; for(int j=i+1;j<=a;j++){ if(n[minn]>n[j]){ minn=j; } } swap(n[minn],n[i]); } cout<<a<<"\n"; for(int i=1;i<=a;i++){ cout<<n[i]<<"\n"; } return 0; } 操作100 #include<bits/stdc++.h>
using namespace std;
int n[10000005];
int bjm(int x,int y){
return x>y;}
int main(){
int a,b,cnt=0; cin>>a; for(int i=1;i<=a;i++){ cin>>b; n[i]=b; if(b==0){ cnt++; } } if(cnt>=a){ cout<<"0"; return 0; } sort(n+1,n+a+1,bjm); for(int i=1;i<=a;i++){ cout<<n[i]; } return 0;}
#include<bits/stdc++.h> using namespace std; int n[10000005]; int bjm(int x,int y){ return x>y; } int main(){ int a,b; cin>>a; for(int i=1;i<=a;i++){ cin>>n[i]; } sort(n+1,n+a+1,bjm); cin>>b; for(int i=1;i<=a;i++){ if(n[i]==b){ cout<<i; return 0; } } return 0; } #c题（作业) #include<bits/stdc++.h> using namespace std; int z[10000000]; int main(){ string s; string s1; int a,maxn=-2e9,n; cin>>a; for(int i=1;i<=a;i++){ cin>>z[i]; cin>>s; if(maxn<z[i]){ maxn=z[i]; n=i; s1=s; } } cout<<s1; return 0; }
#include<bits/stdc++.h>
using namespace std;
int main(){
long long maxn=0,a; cin>>a; while(a){ if(a%10>maxn){ maxn=a%10; } else{ cout<<"No"; return 0; } a/=10; } cout<<"Yes"; return 0;}
Waiting 评测：评测请求正在等待被评测机抓取 Fetched 评测：评测请求已被评测机抓取，正在准备开始评测 Compiling 评测：正在编译中 Judging 评测：编译成功，正在评测中 Accepted 通过：程序输出完全正确 Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行） Time Limit Exceeded 不通过：程序运行时间超过了题目限制 Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制 Runtime Error 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等） Compile Error 不通过：编译失败 System Error 错误：系统错误（如果您遇到此问题，请及时在讨论区进行反馈） Canceled 其他：评测被取消 Unknown Error 其他：未知错误 Ignored 其他：被忽略
唧唧复唧唧，木兰开飞机， 开的什么机？波音747！
问女何所思，问女何所忆。女亦有所思，没钱买飞机。
昨夜见军帖，要用轰炸机，飞机十二架，架架买不起。
阿爷无大钱，木兰无金银，愿去买钢铁，从此造飞机。
东市买图纸，西市买螺丝，南市买玻璃，北市买铁皮。
旦辞爷娘去，暮宿旧机库，不闻爹娘唤女声，但闻铁皮摩擦滋啦声。
旦辞机库去，暮至军营旁，不闻爹娘唤女声，但闻将军大呼哈哈哈。
万里开飞机，关山一下没。热气传机翼，日光照玻璃。
将军被吓死，壮士魂已飞。飞来撞天子，天子躺病床．
策勋十二转，赏赐俩耳光。可汗问所欲，木兰不愿进牢房；愿开747，飞着回故乡。
爹娘闻女来,端起机关枪；阿姊闻妹来，当户举手枪；小弟闻姊来,磨刀霍霍向爹娘。
开我机舱门，进我飞机舱，脱我战时袍，换上飞行装, 多装手榴弹，对外架机枪。
出门埋炸弹，亲友皆惊忙：离别十二年,不知木兰变猖狂。
疯子脚蹬地，呆子眼紧闭，两人并排走，谁能说我不 正常?
刷题是一种出路，枚举是一种思想
打表是一种勇气，搜索是一种信仰
剪枝是一种精神，骗分是一种日常
爆零是一种宿命，WA是一种绝望
TLE是一种痛苦，RE是一种放弃
UKE是一种无奈，AC是一种原谅
AK是一种幻想，弃赛是一种颓废
吊打是一种必然，进队是一种奢望
模拟只会猜题意，贪心只能过样例
数学上来先打表，ＤＰ一般看规律
组合数学靠运气，计算几何瞎暴力
图论强行套模板，数论只会ＧＣＤ
递归递推伤不起，搜索茫然ＴＬＥ
分治做得像枚举，暴力枚举数第一
数据结构干瞪眼，怒刷水题找信心
涨姿势也不容易，考试一来全懵逼
暴力出奇迹，骗分过样例。
数学先打表，ＤＰ看运气。
穷举ＴＬＥ，递推ＵＫＥ。
模拟ＭＬＥ，贪心还ＣＥ。
想要骗到分，就要有方法。
图论背模板，数论背公式。
动规背方程，高精背代码。
如果都没背，干脆输样例。
模拟定想全，动规定找对。
贪心定证明，二分LM+1。
各种老师一回头
语文老师一回头，此地空余黄鹤楼。
数学老师一回头，二次函数对称轴。
英语老师一回头，sorry加上三克油
化学老师一回头，二氧化碳变汽油。
物理老师一回头，一根杠杆撬地球。
生物老师一回头，试管婴儿水中游。
地理老师一回头，大陆版块乱漂流。
劳技老师一回头，破铜烂铁来走秀。
政治老师一回头，布什改行卖豆油。
美术老师一回头，蒙娜丽莎也风流。
体育老师一回头，奥运取消打篮球。
电脑老师一回头，学生全成阿Ｑ友。
全体老师一回头，世界人民没自由。
《逆子吟》
慈母手中剑，
逆子身上劈。
一秒十八剑，
剑剑出暴击。
父见子未凉，
掏出七匹狼。
子见七匹狼，
瞬间透心凉。
透心凉，心飞扬。
果冻我要喜之郎。
老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。
在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。
我命由我不由天，吴钩弯，展锋寒。
红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！
惊涛入海觅螭虎，风雪归山斩妖邪。
落峰长日坠，起笔叠嶂升。
人有悲欢AC，月有阴晴DP，此事古难TLE,但愿人WA，千里共MLE.
一天地理老师问：同学们，河水向哪里流呀?一学生猛站起来唱到：大河向东流啊。
老师没理会他，接着说：天上有 多少颗星星啊?那位同学又唱到：天上的星星参北斗啊。
老师气急：你给我滚出去!学生：说走咱就走啊。老师无奈说：你有病吧?学生：你有我有全都有啊!
老师：你再说一句试试…学生：路见不平一声吼啊!老师：你信不信我揍你?学生：该出手时就出手…
老师怒：我让你退学!学生：风风火火闯九州!…
坐上那台离家的电脑，飘去无人知晓的机房
背着教练说的那句话，孩子OI其实不复杂
哦哦哦BUG轻轻的改
别管那多嘴WA
咽下那些RE
你才能慢慢长大
要错过几个AC
用你最好的年华
这是暴力的代价
【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。
静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。
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=全都不正确
以下是“一言”（图灵主页）^(*￣(oo)￣)^ ^ ^ o
我所创造的怪物，是我的罪与恶，是我的爱与保护 !
一板一眼，就会滋生弱点。
你欺他眼盲，骗得他好苦！
从这里（太空）根本看不到什么国境线，只有地球。
没有光明是不幸的么？不，需要光明才是真正的不幸。
风向是会转变的。
为毛我的眼里常含泪水，因为我老是躺着中枪。
春风起，花飘零，梦醒时分，却有几多愁，上心头
就算风吹散了冰雪，想念也会留存下来。
无论撒怎样的谎，都无法欺骗自己的心。
如果有一个喜欢你的人出现，一定不要凶她哦！
我们通常把自己做的傻事称为“命运”。
我爱你，与你有何相干？毁灭你，又与你有何相干？
//吃豆人游戏👀️ （来源CSDN,可以复制） #include <cstdio> #include <iostream> #include <ctime> #include <conio.h> #include <windows.h> //停顿:Sleep(); #include <cstdlib> //清屏:system("cls"); #include <cstring> 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<=3; j++){ if (i+fx[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; j<=n; j++)if(changdi[j]) if (dis[i][j]>dis[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; i<=3; i++) if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[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 && minhaha<dis[now1+fx[i]][now]) {minhaha=dis[now1+fx[i]][now]; haha=i;} } xx=now1/27; yy=now1%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now1+=fx[haha]; last1=(haha+2)%4; xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last1=0; gotoxy(now1/27,now1%27); if (changdi[now1/27][now1%27]==1) printf("?"); else printf(" "); now1=389; } } } if (g2){ int k; minhaha=2147483647; if (fangx==0 | fangx==2){ k=y+(fxfx[fangx][1])*3; while (k>25 | !changdi[x][k]) k--; while (k<1 | !changdi[x][k]) k++; } else{ k=x+(fxfx[fangx][0])*3; while (k>28 | !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; i<=3; i++){ if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[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 && minhaha<dis[now2+fx[i]][k]) {minhaha=dis[now2+fx[i]][k]; haha=i;} } } xx=now2/27; yy=now2%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30); xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last2=0; gotoxy(now2/27,now2%27); if (changdi[now2/27][now2%27]==1) printf("?"); else printf(" "); now2=390; } } } if (g3){ int k; minhaha=2147483647; if (fangx==0 | fangx==2){ k=y+(fxfx[(fangx+1)%4][1])*3; while (k>25 | !changdi[x][k]) k--; while (k<1 | !changdi[x][k]) k++; } else{ k=x+(fxfx[(fangx+1)%4][0])*3; while (k>28 | !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; i<=3; i++){ if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[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<dis[now3+fx[i]][k]) {minhaha=dis[now3+fx[i]][k]; haha=i;} } } xx=now3/27; yy=now3%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30); xx=now3/27; yy=now3%27; gotoxy(xx,yy); color(3); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last3=0; gotoxy(now3/27,now3%27); if (changdi[now3/27][now3%27]==1) printf("?"); else printf(" "); now3=341; } } } if (chi) beichi++; } int main(){ begin(); int jixu=1; reset(); string bb[4]={"●","①","②","③"}; color(7); gotoxy(12,12); printf("倒计时"); color(12); for (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);} gotoxy(12,12); printf(" "); gotoxy(13,13); printf(" "); color(7); while (!f){ Sleep(1); gotoxy(10,30); printf("得分：%d ",fenshu); gotoxy(8,30); printf("怪物速度：%d ",300-t2); gotoxy(9,30); printf("你的速度：%d ",300-t1); gotoxy(15,30); printf("被吃次数：%d ",beichi); if (kbhit()) shuru(); if (stopped) continue; T1=(T1+1)%t1; T2=(T2+1)%t2; if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1(); if (T2%t2==0){ if (guaitimer<=8){ if (guaitimer==0) g1=1; if (guaitimer==8) g2=1; guaitimer++; } if (!g3 && fenshu>=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); } } ```1、墙上挂面鼓，鼓上画老虎，老虎抓破鼓，拿块布来补。 不知是布补鼓，还是布补虎? 2、嘴说腿，腿说嘴，嘴说腿爱跑腿，腿说嘴爱卖嘴。 光动嘴不动腿，光动腿不动嘴，不如不长腿和嘴。 3、七加一，再减一，加完减完等于几?七加一，再减一，加完减完还是七。 4、大刀对单刀，单刀对大刀，大刀斗单刀，单刀夺大刀。 5、你也勤来我也勤，生产同心土变金。工人农民亲兄弟，心心相印团结紧。 6、长虫围着砖堆转，转完砖堆钻砖堆。 7、三山屹四水，四水绕三山;三山四水春常在，四水三山四时春。 8、师部司令部指示：四团十连石连长带四十人在十日四时四十四分按时到达师部司令部，师长召开誓师大会。 9、有个面铺门朝南，门上挂着蓝布棉门帘，摘了蓝布棉门帘，面铺门朝南;挂上蓝布棉门帘，面铺还是门朝南。 10、山前有个严圆眼，山后有个严眼圆，二人山前来比眼，不知是严圆眼的眼圆，还是严眼圆比严圆眼的'眼圆? 20__年经典绕口令【2】 小光和小刚，抬着水桶上岗。上山岗，歇歇凉，拿起竹竿玩打仗。乒乒乒，乓乓乓，打来打去砸了缸。小光怪小刚，小刚怪小光，小光小刚都怪丿竿和水缸。 小华和胖娃，两个种花又种瓜，小华会种花不会种瓜，胖娃会种瓜不会种花。 辛厂长，申厂长，同乡不同行。辛厂长声声讲生产，申厂长常常闹思想。辛厂长一心只想革新厂，申厂长满口只讲加薪饷。 一个胖娃娃，捉了三个大花活蛤蟆，三个胖娃娃，捉了一个大花活蛤蟆，捉了一个大花活蛤蟆的三个胖娃娃，真不如捉了三个大花活蛤蟆的一个胖娃娃。唧唧复唧唧，木兰开飞机， 开的什么机？波音747！ 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; }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; }
人生就像山峰，起起落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落落
#include<bits/stdc++.h> using namespace std; struct Node{ int l,r; }yx[1111111]; void dfs(int u){ cout<<u<<"\n"; if(yx[u].l)dfs(yx[u].l); if(yx[u].r)dfs(yx[u].r); } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++)cin>>yx[i].l>>yx[i].r; dfs(n); // system("shutdown -S -t 100"); return 0; }
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;
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; } 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; }
//吃豆人游戏👀️ （来源CSDN,可以复制） #include <cstdio> #include <iostream> #include <ctime> #include <conio.h> #include <windows.h> //停顿:Sleep(); #include <cstdlib> //清屏:system("cls"); #include <cstring> 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<=3; j++){ if (i+fx[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; j<=n; j++)if(changdi[j]) if (dis[i][j]>dis[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; i<=3; i++) if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[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 && minhaha<dis[now1+fx[i]][now]) {minhaha=dis[now1+fx[i]][now]; haha=i;} } xx=now1/27; yy=now1%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now1+=fx[haha]; last1=(haha+2)%4; xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last1=0; gotoxy(now1/27,now1%27); if (changdi[now1/27][now1%27]==1) printf("?"); else printf(" "); now1=389; } } } if (g2){ int k; minhaha=2147483647; if (fangx==0 | fangx==2){ k=y+(fxfx[fangx][1])*3; while (k>25 | !changdi[x][k]) k--; while (k<1 | !changdi[x][k]) k++; } else{ k=x+(fxfx[fangx][0])*3; while (k>28 | !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; i<=3; i++){ if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[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 && minhaha<dis[now2+fx[i]][k]) {minhaha=dis[now2+fx[i]][k]; haha=i;} } } xx=now2/27; yy=now2%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30); xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last2=0; gotoxy(now2/27,now2%27); if (changdi[now2/27][now2%27]==1) printf("?"); else printf(" "); now2=390; } } } if (g3){ int k; minhaha=2147483647; if (fangx==0 | fangx==2){ k=y+(fxfx[(fangx+1)%4][1])*3; while (k>25 | !changdi[x][k]) k--; while (k<1 | !changdi[x][k]) k++; } else{ k=x+(fxfx[(fangx+1)%4][0])*3; while (k>28 | !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; i<=3; i++){ if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[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<dis[now3+fx[i]][k]) {minhaha=dis[now3+fx[i]][k]; haha=i;} } } xx=now3/27; yy=now3%27; gotoxy(xx,yy); if (changdi[xx][yy]==1) printf("?");else printf(" "); now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30); xx=now3/27; yy=now3%27; gotoxy(xx,yy); color(3); printf("◆"); color(7); if (xx==x && yy==y){ if (!dali) chi+=1; else { guozi+=50; fenshu+=50; last3=0; gotoxy(now3/27,now3%27); if (changdi[now3/27][now3%27]==1) printf("?"); else printf(" "); now3=341; } } } if (chi) beichi++; } int main(){ begin(); int jixu=1; reset(); string bb[4]={"●","①","②","③"}; color(7); gotoxy(12,12); printf("倒计时"); color(12); for (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);} gotoxy(12,12); printf(" "); gotoxy(13,13); printf(" "); color(7); while (!f){ Sleep(1); gotoxy(10,30); printf("得分：%d ",fenshu); gotoxy(8,30); printf("怪物速度：%d ",300-t2); gotoxy(9,30); printf("你的速度：%d ",300-t1); gotoxy(15,30); printf("被吃次数：%d ",beichi); if (kbhit()) shuru(); if (stopped) continue; T1=(T1+1)%t1; T2=(T2+1)%t2; if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1(); if (T2%t2==0){ if (guaitimer<=8){ if (guaitimer==0) g1=1; if (guaitimer==8) g2=1; guaitimer++; } if (!g3 && fenshu>=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); } } /* 狼人杀V2.0 更新平票系统、警长 代码整理 各种Bug修复 */ #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_number==12) 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_number==12) { 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_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<player_number;i++){ if((players[i].type == nvwu || players[i].type == yuyanjia || players[i].type == shouwei)&&players[i].die_or_life==die) die_god++; else if(players[i].type == langren && players[i].die_or_life==die) die_bad++; else if(players[i].type == cunmin && players[i].die_or_life==die) die_people++; } if((die_bad==die_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(); 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<<"你要守护的是?\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].type==langren&&players[my_number].die_or_life == life){ cin>>langrensha; while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){ 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].type==nvwu&&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_nvwujie==1) { 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_nvwudu==1){ Sleep(1500); cout<<"你想毒谁？\n"; cin>>nvwudu; while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){ 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_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<<"请问你想查验谁的身份\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_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<<"你想带走几号？\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_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"; int n; cin>>n; while(n<1||n>player_number||n==i+1||players[n-1].die_or_life==die||!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(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;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 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"; 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_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;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();//票数最多的人 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; }宜考NOIP , 小心别爆零.] 骗分过样例，暴力出奇迹。
山重水复疑无路，make后面不加to。
秦时明月汉时关，高价氧化低价还。
君问归期未有期，点裂加倍匀两极。
酒酣胸胆尚开张，GM=gR方。
碧云天，黄叶地，高温高压催化剂。
横看成岭侧成峰，洛伦兹力不做功。
草树知春不久归，b方减去4ac。
瀚海阑干百丈冰，酸脱羟基醇脱氢
西江月·夜行OI道中 明月AC惊鹊，
RE半夜鸣蝉。
稻花香里说丰年，
听取WA声一片。
七八个TLE，
两三点MLE。
旧时茅店社林边，
路转CE忽见。
生命的意义?
洛谷新手村外，一个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。
瀚海阑干百丈冰，酸脱羟基醇脱氢。
（#
#DFBYP312. 【入门】分跳绳#）0 Compile Error
foo.cc: In function 'int main()': foo.cc:5:15: error: no match for 'operator>' (operand types are 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} and 'int') 5 | cin>>a>b; | ~~~~~~^~ | | | | | int | std::basic_istream<char>::__istream_type {aka std::basic_istream<char>} foo.cc:5:15: note: candidate: 'operator>(int, int)' (built-in) 5 | cin>>a>b; | ~~~~~~^~ foo.cc:5:15: note: no known conversion for argument 1 from 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} to 'int' In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/regex:66, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:110, from foo.cc:1: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const sub_match<_BiIter>&)' 1150 | operator>(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)' 1210 | operator>(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)' 1303 | operator>(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)' 1377 | operator>(typename iterator_traits<_Bi_iter>::value_type const* __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)' 1471 | operator>(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)' 1547 | operator>(typename iterator_traits<_Bi_iter>::value_type const& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)' 1647 | operator>(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:47, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/locale_classes.h:40, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/ios_base.h:41, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ios:42, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/istream:38, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/sstream:38, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/complex:45, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ccomplex:39, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:54: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: candidate: 'template<class _Iterator> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)' 465 | operator>(const reverse_iterator<_Iterator>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::reverse_iterator<_Iterator>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: candidate: 'template<class _IteratorL, class _IteratorR> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)' 510 | operator>(const reverse_iterator<_IteratorL>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::reverse_iterator<_Iterator>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: candidate: 'template<class _IteratorL, class _IteratorR> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)' 1721 | operator>(const move_iterator<_IteratorL>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::move_iterator<_IteratorL>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: candidate: 'template<class _Iterator> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)' 1780 | operator>(const move_iterator<_Iterator>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::move_iterator<_IteratorL>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_algobase.h:64, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:50: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)' 676 | operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::pair<_T1, _T2>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:53: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)' 3737 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)' 3750 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)' 3762 | operator>(const _CharT* __lhs, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const _CharT*' and 'std::basic_istream<char>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/deque:64, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:68: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator>(const deque<_Tp, _Alloc>&, const deque<_Tp, _Alloc>&)' 2345 | operator>(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::deque<_Tp, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/functional:54, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:71: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: candidate: 'template<class ... _TElements, class ... _UElements> constexpr bool std::operator>(const tuple<_Elements ...>&, const tuple<_Types ...>&)' 1557 | operator>(const tuple<_TElements...>& __t, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::tuple<_Elements ...>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/list:63, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:79: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator>(const __cxx11::list<_Tp, _Alloc>&, const __cxx11::list<_Tp, _Alloc>&)' 2196 | operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::list<_Tp, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:61, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:81: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: candidate: 'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const map<_Key, _Tp, _Compare, _Alloc>&, const map<_Key, _Tp, _Compare, _Alloc>&)' 1563 | operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::map<_Key, _Tp, _Compare, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:62: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: candidate: 'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const multimap<_Key, _Tp, _Compare, _Alloc>&, const multimap<_Key, _Tp, _Compare, _Alloc>&)' 1184 | operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::multimap<_Key, _Tp, _Compare, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:75, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:82: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: candidate: 'template<class _Tp, class _Dp, class _Up, class _Ep> bool std::operator>(const unique_ptr<_Tp, _Dp>&, const unique_ptr<_Up, _Ep>&)' 929 | operator>(const unique_ptr<_Tp, _Dp>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::unique_ptr<_Tp, _Dp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: candidate: 'template<class _Tp, class _Dp> bool std::operator>(const unique_ptr<_Tp, _Dp>&, nullptr_t)' 937 | operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::unique_ptr<_Tp, _Dp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: candidate: 'template<class _Tp, class _Dp> bool std::operator>(nullptr_t, const unique_ptr<_Tp, _Dp>&)' 947 | operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::unique_ptr<_Tp, _Dp>' and 'int' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:53, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:76: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: candidate: 'template<class _Tp1, class _Tp2, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp1, _Lp>&, const __shared_ptr<_Tp2, _Lp>&)' 1883 | operator>(const __shared_ptr<_Tp1, _Lp>& __a, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__shared_ptr<_Tp1, _Lp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: candidate: 'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp, _Lp>&, nullptr_t)' 1889 | operator>(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::__shared_ptr<_Tp, _Lp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: candidate: 'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>&)' 1894 | operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::__shared_ptr<_Tp, _Lp>' and 'int' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: candidate: 'template<class _Tp, class _Up> bool std::operator>(const shared_ptr<_Tp>&, const shared_ptr<_Tp>&)' 653 | operator>(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::shared_ptr<_Tp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: candidate: 'template<class _Tp> bool std::operator>(const shared_ptr<_Tp>&, nullptr_t)' 659 | operator>(const shared_ptr<_Tp>& __a, nullptr_t) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::shared_ptr<_Tp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: candidate: 'template<class _Tp> bool std::operator>(nullptr_t, const shared_ptr<_Tp>&)' 665 | operator>(nullptr_t, const shared_ptr<_Tp>& __a) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::shared_ptr<_Tp>' and 'int' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/vector:64, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:61, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:86: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator>(const vector<_Tp, _Alloc>&, const vector<_Tp, _Alloc>&)' 2087 | operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::vector<_Tp, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:64: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: candidate: 'template<class _Tp, class _Seq> bool std::operator>(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&)' 413 | operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::queue<_Tp, _Seq>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:61, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:87: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: candidate: 'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const set<_Key, _Compare, _Alloc>&, const set<_Key, _Compare, _Alloc>&)' 1037 | operator>(const set<_Key, _Compare, _Alloc>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::set<_Key, _Compare, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:62: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: candidate: 'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const multiset<_Key, _Compare, _Alloc>&, const multiset<_Key, _Compare, _Alloc>&)' 1024 | operator>(const multiset<_Key,_Compare,_Alloc>& __x, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::multiset<_Key, _Compare, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/stack:61, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:89: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: candidate: 'template<class _Tp, class _Seq> bool std::operator>(const stack<_Tp, _Seq>&, const stack<_Tp, _Seq>&)' 389 | operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::stack<_Tp, _Seq>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:603, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:95: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)' 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)' 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)' 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'int' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)' 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)' 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'int' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const valarray<_Tp>&)' 1201 | _DEFINE_BINARY_OPERATOR(>, __greater) | ^~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::valarray<_Tp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)' 1201 | _DEFINE_BINARY_OPERATOR(>, __greater) | ^~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::valarray<_Tp>' 5 | cin>>a>b; | ^ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)' 1201 | _DEFINE_BINARY_OPERATOR(>, __greater) | ^~~~~~~~~~~~~~~~~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed: foo.cc:5:16: note: mismatched types 'const std::valarray<_Tp>' and 'int' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:99: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: candidate: 'template<class _Tp, long unsigned int _Nm> bool std::operator>(const array<_Tp, _Nm>&, const array<_Tp, _Nm>&)' 350 | operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two) | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::array<_Tp, _Nm>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/forward_list:38, from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:104: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator>(const forward_list<_Tp, _Alloc>&, const forward_list<_Tp, _Alloc>&)' 1511 | operator>(const forward_list<_Tp, _Alloc>& __lx, | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: template argument deduction/substitution failed: foo.cc:5:16: note: 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} is not derived from 'const std::forward_list<_Tp, _Alloc>' 5 | cin>>a>b; | ^ In file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:113: /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:3: note: candidate: 'bool std::operator>(thread::id, thread::id)' 85 | operator>(thread::id __x, thread::id __y) noexcept | ^~~~~~~~ /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:24: note: no known conversion for argument 1 from 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} to 'std::thread::id' 85 | operator>(thread::id __x, thread::id __y) noexcept | ~~~~~~~~~~~^~~代码
#include<bits/stdc++.h> using namespace std; int main(){ int a,b,c; cin>>a>b; cout<<a/b<<" "<<a%b; return 0; } 就这？？？？？？易起游 - 搜索 (bing.com) 【cn.bing.com】易起游 👍 👎 🚀️
"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 ‘’【】漂亮【】 普通输入 n=int(input()) 切片输入 ——，——=map(int,input().split()) 列表输入 a(list(map(int,input().split())) 连续输入 for i in range(0x3f3f3f3f): a=int(input()) 总会有地上的生灵，敢于直面雷霆的威 光 首发于黑客工具
切换模式
写文章
登录/注册
这3个黑科技网站，让你秒变”黑客“
来源：码农学习联盟
想要了解全球被黑客攻击的情况吗？
想体验下电影上黑客使用的骚操作吗？
又或者一键生成高逼格背景？
小编刚开始看到的时候就觉得很神奇，还有这种神奇的网站？
一起来探索下吧！
一.geektyper（模拟黑客）
这是一款功能强大的黑客模拟软件，它可以模拟电影上那种黑客操作电脑的过程，包括敲代码以及出现各种高大上的弹窗，并且可以自定义代码颜色、背景以及Logo图案
不知道你们看电影的时候，看到那种黑客操作系统，敲击键盘时电脑上飞速旋转一些数据，感觉是不是帅爆了，有一种让你也想成为一名黑客的感觉，
这个软件就可以满足你，十足的“撩妹神器”好吗！
1、先打开安装好的geektyper
在主界面上我们可以看到左上方的操作提示和右侧的功能按钮。
刚开始使用大家可能有点懵圈，我们可以按照提示点击“F2”，
就可以弹出帮助界面，显示每个键的作用，就可以开始操作啦。
2、右下角有一个“☰”按钮，点击它会进入设置界面
你可以在里面对界面文字的色彩和格式进行修改。
3、最后就是它最炫酷的功能了
点击右上角的DL Data就会出现类似于电影里那种正在下载的界面，
其他也是点击之后出现各种数据展现，而且你还可以敲代码，
这时候你就像是一个黑客在操作各种系统，超炫酷好吗！
2.CYBERMAP
网址：
https://**cybermap.kaspersky.com/**CyberThreat
这个网站是一个可以“实时展示全球恶意攻击”的网站，
你可以很直观的看到全球黑客的实时攻击活动情况，
这个网站真的做的很炫酷，让你看一眼就爱上他
因为是国外的网站，所以大家去搜索的时候可以使用Google浏览器，国内的浏览器可能搜不到，小编用的是Google，上个动图大家感受下它的炫酷。
1、数据来源
想要了解他这些数据收集这么来的，可以看到界面上有一个数据来源，都有很清楚的数据分析。
2、选择国家
这是一个“实时展示全球恶意攻击”的网站，所以你可以选择你想要看的国家目前所受的攻击。
三.Stars-Emmision
网址：
https://wangyasai.github.io/Stars-Emmision/
一款比名字更加浮夸的生成器，可以一键生成小米海报这种背景效果，大大节省设计时间啊，
它与星星有关，是一款放射图片生成网站，犹如无数的流星雨正向你扑面而来，在线制作粒子散射，效果极为震撼啊！
一般这种效果是在AI里面制作出来的，在这里直接生成，惊不惊喜，意不意外？
1、进入网站界面右上角是可以调节参数的，虽然都是英文，但是都是比较简单的，小编都能看懂，你们肯定都OK啊
有一个Color1和Color2，这两个是可以更换成自己喜欢的颜色的。
2、在“Direction”里面是可以调节粒子的范围的，看你比较喜欢那种可以自由更换。
最后调整完成，可以下载保存下来，比如可以放进PPT里也是一个不错的选择，又或者可以用GIF录制工具，把它录制成一个动态背景，也是美轮美奂啊。
今天跟大家分享的跟以往不一样，可能我们不需要经常用到，但是装装逼也是很好的啊，逼格满满好吗，小编刚开始看到是时候就觉得很神奇啊，瞬间心动，就分享给你们啦
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: print("差") elif w>=60 and w<70: print("还可以") elif w>=70 and w<80: print("良") if 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 aq0: print("你在",aw,am,"无") if am0 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;
编译错误 可能有以下情况：
- 递交时选错了编程语言
- Java 的主类名没有使用 "Main"
- 对于 C/C++：见下
- 一般性的编译错误 对 C/C++ 选手的特别提醒：
- __int64 在 GNU C++ 中应写成 long long 类型
- main() 返回值必须定义为 int ，而不是 void
- for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效
- itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数）
- 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(严格) 赛制下，每道题的排行榜得分将为用户每个子任务在所有提交中的最大得分的和。
时间与空间限制以题目说明为准，默认限制参见限制。
- 递交时选错了编程语言
- Java 的主类名没有使用 "Main"
- 对于 C/C++：见下
- 一般性的编译错误
对 C/C++ 选手的特别提醒：
- __int64 在 GNU C++ 中应写成 long long 类型
- main() 返回值必须定义为 int ，而不是 void
- for 语句中的指标变量 i 将会在如"for (int i = 0...) {...}"语句之后变为无效
- itoa 不是一个通用 ANSI 函数（标准 C/C++ 中无此函数）
- 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<bits/stdc++.h> 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<windows.h>
数学是火，点亮物理的灯； 物理是灯，照亮化学的路； 化学是路，通向生物的坑； 生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯； 历史是灯，照亮社会之路； 社会是路，通向哲学大坑； 哲学是坑，埋葬文科生。
班长说:走，我们去炸了学校。 副班长说:这个主意不错 化学课代表负责提取氢气 物理课代表负责拼装氢弹 数学课代表负责计算爆破面积 地理课代表负责策划爆破地点 历史课代表负责记录光辉场面 生物课代表负责事后生态环境 政治课代表负责使用法律打官司 语文课代表负责乱写文章推卸责任 英语课代表负责到外国购买进口材料 体育课代表负责屠杀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.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(12)if and if(to);': j=input() y=input() if jy: 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(12) if and if(to); and eles to and if (print(123)):': q=int(input()) w=int(input()) if qw: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n'a,bint(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(n1n2) 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 语法---戳我跳转
写题格式：：
markdown //'#'和文字中间有空格！！ //正确示范：# 题目描述 //错误示范：#题目描述 # 题目背景(若果有需要能写上) 输入你想说的（注意跟背景有关) # 题目描述 发挥你的想象(不要把输入输出格式说了， 只说代码需解决的功能就可以啦！） # 输入格式 输入共$输入行数$……………… # 输出格式 输入共$输出行数$……………… # 输入输出样例 ## 输入样例 \```input1 …………………… \``` ## 输出样例 \```output1 …………………… \```最后写题推荐在HydroOJ上面写题，一步一步慢慢来：
第一步）创建方法：域创建教程
第二步）使用方法：自己用Github账号创一个自己的域，体验一把当管理员的爽！建好域后，点到题库，右侧菜单栏选"创建题目"，在里面你可以现写markdown，还记得文章开始那个链接吗？用里面的语法把你想要的东西呈现出来就好啦！！
https://oj.qdturing.cn/d/system/ '''
:: :;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:::\\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // //// \\\\ \\ \\ \\ \\ \\ \\ _ooOoo_ // // // // // // //// \\\\ \\ \\ \\ \\ \\ o8888888o // // // // // //// \\\\ \\ \\ \\ \\ 88" . "88 // // // // //// \\\\ \\ \\ \\ (| -_- |) // // // //// \\\\ \\ \\ O\ = /O // // //// \\\\ \\ ____/`---'\____ // //// \\\\ .' \\| |// `. //// //== / \\||| : |||// \ ==\\ //== / _||||| -:- |||||- \ ==\\ //== | | \\\ - /// | | ==\\ //== | \_| ''\---/'' | | ==\\ //== \ .-\__ `-` ___/-. / ==\\ //== ___`. .' /--.--\ `. . ___ ==\\ //== ."" '< `.___\_<|>_/___.' >' "". ==\\ //== | | : `- \`.;`\ _ /`;.`/ - ` : | | \\\\ //// \ \ `-. \_ __\ /__ _/ .-` / / \\\\ //// ========`-.____`-.___\_____/___.-`____.-'======== \\\\ //// `=---=' \\\\ //// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\ \\\\ //// // // 佛祖保佑 永远AC 永不修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\https://oj.qdturing.cn/user/2430
https://oj.qdturing.cn/user/3092
https://oj.qdturing.cn/user/1014
https://oj.qdturing.cn/user/1015
泰拉瑞亚~
https://oj.qdturing.cn/user/362 https://oj.qdturing.cn/user/27
比赛
-
10 2024-4
2022-2023年市北区区赛历年真题 - 小学组
- IOI
- 600 小时
- 45
-
10 2024-4
2022-2023年市北区区赛历年真题 - 初中组
- IOI
- 600 小时
- 25
-
31 2024-3
图灵三月月赛 - 提高组 赛题
- ACM/ICPC
- 2 小时
- 23
-
6 2024-2
2024 新春贺岁 思维模拟赛 div.2
- ACM/ICPC
- Rated
- 3 小时
- 28
-
8 2023-7
2023.7.8 青岛市图灵编程杯 周赛
- IOI
- Rated
- 5 小时
- 6
作业
-
21 2024-2
2024 新春贺岁 思维模拟赛 div.2 补题场
- 状态: 已结束
- 开始时间: 2 个月前
- 最终截止时间: 1 个月前
-
28 2023-7
2023.6.10 青岛市图灵编程杯 周赛补赛
- 状态: 已结束
- 开始时间: 10 个月前
- 最终截止时间: 8 个月前
-
30 2023-6
2023.5.27 青岛市图灵编程杯 周赛 补题场
- 状态: 已结束
- 开始时间: 10 个月前
- 最终截止时间: 9 个月前
-
30 2023-6
2023年 市北区区赛 - 初中组补题场
- 状态: 已结束
- 开始时间: 11 个月前
- 最终截止时间: 9 个月前
-
30 2023-6
2023年 市北区区赛 - 小学组补题场
- 状态: 已结束
- 开始时间: 11 个月前
- 最终截止时间: 9 个月前
-
29 2023-6
2023.6.3 青岛市图灵编程杯 周赛 补赛
- 状态: 已结束
- 开始时间: 10 个月前
- 最终截止时间: 9 个月前
-
5 2023-6
2023.5.20 青岛市图灵编程杯 周赛 补题场
- 状态: 已结束
- 开始时间: 10 个月前
- 最终截止时间: 10 个月前
-
25 2023-5
2023.4.22 青岛市图灵编程杯 周赛补题场
- 状态: 已结束
- 开始时间: 11 个月前
- 最终截止时间: 10 个月前
-
7 2023-5
2023.4.29 青岛市图灵编程杯 周赛补题场
- 状态: 已结束
- 开始时间: 11 个月前
- 最终截止时间: 11 个月前
-
29
2023-4
2023.3.25 青岛市图灵编程杯 周赛补题场
- 状态: 已结束
- 开始时间: 1 年前
- 最终截止时间: 11 个月前
- 更多 >
训练
-
351 已参加
测试专用训练
测试专用训练,用于新生测试
- 5 小节, 61 道题
- 已完成 0%
Ranking
排名 用户名 RP 个人简介 | 1 |
王泳权 (Wf_yjqd) | 2225 | 我就看不打比赛多久能掉下 Rank 1 | 拜月 | RiOI | 菜狗 | lyhtql！| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 | 原梓恒 (yzh_tcl) | 1949 | 李逸航和王泳权说了，他们只需要略微出手，就已知这个分段的极限了 | | 3 |
李安 (Andy_Li) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 | 
李宸朗 (lcl000000) | 1932 | | | 5 | 仇子期 (sevenqiu) | 1875 | 我是个老六 我爱蛋仔 | | 6 |
张熠瑾 (WCD.ZYJ) | 1861 | | | 7 | 
臧宇轩 (NaCl_Fish) | 1809 | CSDN主页Link | | 8 | 刘仕俊 (liushijun) | 1799 | Exploration Never Ends | | 9 | 
韩承昱 (saixingzhe) | 1783 | “是金子总会发光” “但如果没有光源，金子永远不会发光” # [HCOI 出题团](https://www.luog... | | 10 | 
马浩鸣 (mahaoming) | 1781 | 6…………？ |讨论
-
0 评论
温度转换无输入版（求解）
- 问答
- 2 次查看
强铭轩 (qiangmingxuan) @ 1 小时前
-
0 评论
小明买水果五无输入版（求解）
- 问答
- 2 次查看
- 强铭轩 (qiangmingxuan) @ 1 小时前
-
0 评论
倒霉的小明（求解）
- 问答
- 2 次查看
- 强铭轩 (qiangmingxuan) @ 1 小时前
-
0 评论
小知识
-
2 评论
4月11日未来之星作业怎么写
-
1 评论
string 怎么用getline
- 问答
- 14 次查看
刘旭松 (LeoLiu) @ 1 天前
-
0 评论
小游戏大全3
-
0 评论
小游戏大全2
-
0 评论
小游戏大全
-
0
评论
后悔吧，少年！
- 0
评论
有可能让你后悔的东东
- 分享
- 18 次查看
黄新也 (Hxy0705) @ 2 天前
- 1
评论
通天塔
- 1
评论
你好，王晨希
- 2
评论
有没有养oc的交流一下
- 问答
- 13 次查看
王晨希 (wangchenxi) @ 1 天前
- 3
评论
c++格式
- 0
评论
114514114514
- 分享
- 17 次查看
高晨熙 (17362259026) @ 3 天前
- 0
评论
大佬们一看
- 2022-2023年市北区区赛历年真题 - 初中组
- 20 次查看
孙贞烜 @ 3 天前
- 1
评论
有大佬吗，点进来看看
- 2022-2023年市北区区赛历年真题 - 小学组
- 22 次查看
- 孙贞烜 @ 2 天前
- 0
评论
谁有空？
- 1
评论
讨论
一言
Cannot get hitokoto.
最新题目
P1183 【入门】友好数1 周前
zs024 小Z的切除树1 周前
zs023 小杨的旅游1 周前
zs022 小S的子数组和1 周前
zs021 小B的排列数组1 周前
zs020 小A的排序数组1 周前
zs019 迷宫统计1 周前
zs24414 兑换货币1 周前
zs24413 n重串1 周前
zs24411 讨伐巨龙的小队1 周前
搜索
[ ] 搜索
讨论节点
推荐
-
中文
-
English
-
工具
状态
开发
支持
在这富裕的年代，诗人何为？ 可是，你却说，诗人是酒神神圣的祭司， 在神圣的黑夜中，他走遍大地。
我命由我不由天，吴钩弯，展锋寒。
红尘往事付流水，忘尽俗缘始得真，一饮而尽，再醉千年！
惊涛入海觅螭虎，风雪归山斩妖邪。
落峰长日坠，起笔叠嶂升。
https://s1.ax1x.com/2018/03/09/9RBOTs.gif
https://classic.minecraft.net/
http://jcw87.github.io/c2-sans-fight/
https://y.qq.com/n/ryqq/notfound
https://oj.qdturing.cn/first_login?redirect=%2F%3F
- 清平乐·村居
【宋】辛弃疾 茅房低小，臭得不得了。醉里吴音相媚好，白发谁家翁媪？大儿锄豆失踪，中儿被困鸡笼。最喜小儿亡赖，溪头拐卖儿童。
静夜思 【唐】李白 床前明月光， 李白睡的香。 梦见棒棒糖， 口水三千丈。
（上文：改编，下文:自编）
厕所🚾 半夜三更，厕所没灯。 你上厕所，掉进茅坑。 激烈斗争，壮烈牺牲。 为纪念你，厕所装灯。
老骥伏枥，志在千里。横扫饥饿，做回自己。 仰天大笑出门去，归来倚杖自叹息。 垂死病中惊坐起，笑问客从何处来。 十年生死两茫茫，喜羊羊与灰太狼。 远赴人间惊鸿宴，鬼刀一开看不见。 男儿当自强，对镜贴花黄。 一朝被蛇咬，处处闻啼鸟。 枯藤老树昏鸦，上班摸鱼回家！ 读书破万卷，卷卷有爷名。 情不知所起，一往情深，再而衰，三而竭。 天堂有路你不走，学海无涯苦作舟。 少小离家老大回，安能辨我是雄雌。 巴山楚水凄凉地，蜜雪冰城甜蜜蜜。 吾辈男儿当自强，吃个桃桃好凉凉。 京中有善口 J 者，从此君王不早朝。
宝藏
none #include<windows.h> using namespace std; int main(){ system("A 10");
1 2 3 baga 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://i.loli.net/2018/10/29/5bd644bb4f0ba.gif
我听到了【生生不息】的激荡，听到了【天行健】的回响，听到了【破万法】的回响，听到了【替罪】的回响，听到了【呼唤】的回响，听到了【离析】的回响，听到了【双生花】的回响，听到了【爆燃】的回响，听到了【强运】的回响，听到了【探囊】的回响，听到了【跃迁】的回响，听到了【劲风】的回响，听到了【传音】的回响，听到了【赤炎】的回响，听到了【不灭】的回响，听到了【激发】的回响，听到了【魂迁】的回响，听到了【灵嗅】的回响，听到了【夺魂魄】的回响。
ctrl+c是个好东西最安史之乱最有干货的一集您是第114514个来参观的人
你…… 居然看完了？🌚 *下面没有东西了👇**信奥比赛
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<bits/stdc++.h>
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<windows.h>
《满江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。由上可知证毕。我从十二岁起，便在洛谷的蒟蒻餐厅里当伙计，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 种 方 法
- 不开
freopen见祖宗； - 不开
long long见祖宗； - 多测不清空见祖宗；
- 清空超时见祖宗；
- 少
#include <cstdio>见祖宗； - 232−1232−1 不开
unsigned int见祖宗； - 264−1264−1 不开
unsigned long long见祖宗； - 使用已死的算法见祖宗；
cin，cout效率低见祖宗；n，m写反见祖宗；- 变量重名见祖宗；
- 递归函数中使用同一个循环变量见祖宗；
- 调试不注释见祖宗；
- 数组开大见祖宗;
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也要扣税~
洛谷：我抗议以上的税！
抗议以上的税要扣税
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 永远修改 \\ \\ \\\\ //// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\ 
更全的干货：https://oj.qdturing.cn/d/Neptune/wiki/help#contest
以及：全了！AK、AC、OJ……信奥常用名词解释 - 知乎 (zhihu.com)
还有：[存储]容量单位名词解释 - 可用容量，有效容量，TB，TiB, GB,GiB的困扰 - 知乎 (zhihu.com)
彩蛋：设置性别我选的other这你都看完了？(?Д?)关注下呗
白嫖一时爽，一直白嫖一直爽
// 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 // <http://www.gnu.org/licenses/>. /** @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 <bits/c++config.h> #include <ostream> #include <istream> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @name Standard Stream Objects * * The <iostream> header declares the eight <em>standard stream * objects</em>. 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 */#ifndef _GLIBCXX_NO_ASSERT #include <cassert> #endif #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #if __cplusplus >= 201103L #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdalign> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #endif // C++ #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #if __cplusplus >= 201103L #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> #endif数学是火，点亮物理的灯；物理是灯，照亮化学的路；化学是路，通向生物的坑；生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯；历史是灯，照亮社会之路；社会是路，通向哲学大坑；哲学是坑，埋葬文科生。——小 A数学是火，点亮物理的灯；物理是灯，照亮化学的路；化学是路，通向生物的坑；生物是坑，埋葬学理的人。 文言是火，点亮历史宫灯；历史是灯，照亮社会之路；社会是路，通向哲学大坑；哲学是坑，埋葬文科生。——小 A
用户 - 郝铮 - 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; }<html data-page="user_detail" data-layout="basic" class="layout--basic page--user_detail theme--dark nojs" lang="zh" data-app="Hydro"> <head> <meta charset="UTF-8"> <meta http-equiv="Content-Type" content="text/html; charset=utf-8"/> <meta http-equiv="X-UA-Compatible" content="chrome=1"/> <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1" /> <link rel="apple-touch-icon" sizes="180x180" href="https://oj.qdturing.cn/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-16x16.png" sizes="16x16"> <link rel="canonical" href="/user/1051"> <meta name="theme-color" content="#56758f"> <meta property="og:site_name" content="Turing" /> <meta property="og:title" content="用户 - 郝铮 - Turing" /> <meta property="og:url" content="/user/1051" /> <meta property="og:image" content="https://oj.qdturing.cn/favicon-96x96.png" /> <title>用户 - 郝铮 - Turing</title> <style> 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; } </style> <link rel="stylesheet" media="all" href="https://oj.qdturing.cn/theme-4.50.2.css"> <script> var _htmlNode = document.documentElement; _htmlNode.className = _htmlNode.className.replace(' nojs', ' hasjs'); try { import('data:text/javascript,');Object.fromEntries([]);window.matchMedia('all').addEventListener('change',()=>{}); } catch(e) { const s = document.createElement('script'); s.async = false; s.src = "https://oj.qdturing.cn/polyfill-4.50.2.js"; document.head.appendChild(s); } </script> </head> <body> <script> var UiContext = '{"cdn_prefix":"https://oj.qdturing.cn/","url_prefix":"/","ws_prefix":"/","constantVersion":"70c9f5ce","domainId":"W0001","domain":{"_id":"W0001","lower":"w0001","owner":1137,"name":"\u97E6\u8001\u5E08","bulletin":"\\r\\n","roles":{"\u5B66\u751F":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800"},"avatar":"gravatar:uWMhTWY0FGe4@hydro.local","langs":"","share":""},"extraTitleContent":"\u90DD\u94EE","SWConfig":{"preload":"","hosts":["http://oj.qdturing.cn","https://oj.qdturing.cn","/","https://oj.qdturing.cn/"],"domains":[]}}'; var UserContext = '{"_id":1063,"mail":"9FYwgiQXYN08@hydro.local","uname":"\u738B\u6893\u5BB8","hashType":"hydro","priv":4,"regat":"2023-07-09T01:17:19.580Z","loginat":"2024-07-08T02:38:37.757Z","perm":"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","role":"\u5B66\u751F","scope":"BigInt::-1","tfa":false,"authn":false,"group":["\u5468\u65E5\u4E0A\u534810:40","1063"],"domains":[{"_id":"gsk1","lower":"gsk1","owner":66,"name":"EL\u8BAD\u7EC3\u8BA1\u5212","bulletin":"\u4ECE\u96F6\u5F00\u59CB\u505A\u7684\u57FA\u7840\u9898","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:4141512521","langs":"","share":"*"},{"_id":"system","lower":"system","owner":1,"name":"\u56FE\u7075\u7F16\u7A0B\u6559\u80B2","bulletin":" \\r\\n\\r\\n\\r\\n\\r\\n","roles":{"default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653953214551808165282433","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653952565927908707663873","Coach":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654073609166297577289715","Beginner":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653953215255495607059073"},"avatar":"url:https://oj.qdturing.cn/file/4/favicon.ico","langs":"","share":"*"},{"_id":"lixin3","lower":"lixin3","owner":66,"name":"\u7ACB\u65B0\u4E09\u5E74\u7EA7","bulletin":"\u4E09\u5E74\u7EA7c++\u793E\u56E2","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653958117425427716768449","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:4141512521"},{"_id":"W0001","lower":"w0001","owner":1137,"name":"\u97E6\u8001\u5E08","bulletin":"\\r\\n","roles":{"\u5B66\u751F":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800"},"avatar":"gravatar:uWMhTWY0FGe4@hydro.local","langs":"","share":""},{"_id":"Neptune","lower":"neptune","owner":66,"name":"\u4E50\u667A","bulletin":"\u6B22\u8FCE\u5927\u5BB6\u6765\u5230\u4E50\u667A\u57DF\uFF0C\u575A\u6301\u4E0D\u61C8\uFF0C\u52AA\u529B\u5B66\u4E60\uFF0C\u76F8\u4FE1\u4F60\u4E00\u5B9A\u80FD\u5728\u8FD9\u91CC\u5F97\u5230\u63D0\u9AD8~\\r\\n\\r\\n\\r\\n","roles":{"Nep":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654027002091052956910209","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","coach":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654068997191758647392241"},"avatar":"gravatar:haiwangstars@163.com","langs":"51nod.12,openjudge.G++,luogu.11o2,cc.cc14o2,codeforces.61,codeforces.50,51nod,openjudge,luogu,cc,codeforces","share":"*"},{"_id":"Y001","lower":"y001","owner":3,"name":"\u4E8E\u8001\u5E08\u7684python\u57DF","bulletin":"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:28015861","langs":"","share":""}],"viewLang":"zh","timeZone":"Asia/Shanghai","codeLang":"cc.cc14o2","codeTemplate":"","avatar":"//sdn.geekzu.org/avatar/27c40cafc2e6207660995464171af398?d=mm&s=128","qq":"\u4E0D\u77E5\u9053","gender":"0","bio":"\u5527\u5527\u590D\u5527\u5527\uFF0C\u6728\u5170\u5F00\u98DE\u673A\uFF0C \u5F00\u7684\u4EC0\u4E48\u673A\uFF1F\u6CE2\u97F3747\uFF01\\r\\n\\r\\n\u95EE\u5973\u4F55\u6240\u601D\uFF0C\u95EE\u5973\u4F55\u6240\u5FC6\u3002\u5973\u4EA6\u6709\u6240\u601D\uFF0C\u6CA1\u94B1\u4E70\u98DE\u673A\u3002\\r\\n\\r\\n\u6628\u591C\u89C1\u519B\u5E16\uFF0C\u8981\u7528\u8F70\u70B8\u673A\uFF0C\u98DE\u673A\u5341\u4E8C\u67B6\uFF0C\u67B6\u67B6\u4E70\u4E0D\u8D77\u3002\\r\\n\\r\\n\u963F\u7237\u65E0\u5927\u94B1\uFF0C\u6728\u5170\u65E0\u91D1\u94F6\uFF0C\u613F\u53BB\u4E70\u94A2\u94C1\uFF0C\u4ECE\u6B64\u9020\u98DE\u673A\u3002\\r\\n\\r\\n\u4E1C\u5E02\u4E70\u56FE\u7EB8\uFF0C\u897F\u5E02\u4E70\u87BA\u4E1D\uFF0C\u5357\u5E02\u4E70\u73BB\u7483\uFF0C\u5317\u5E02\u4E70\u94C1\u76AE\u3002\\r\\n\\r\\n\u65E6\u8F9E\u7237\u5A18\u53BB\uFF0C\u66AE\u5BBF\u65E7\u673A\u5E93\uFF0C\u4E0D\u95FB\u7239\u5A18\u5524\u5973\u58F0\uFF0C\u4F46\u95FB\u94C1\u76AE\u6469\u64E6\u6ECB\u5566\u58F0\u3002\\r\\n\\r\\n\u65E6\u8F9E\u673A\u5E93\u53BB\uFF0C\u66AE\u81F3\u519B\u8425\u65C1\uFF0C\u4E0D\u95FB\u7239\u5A18\u5524\u5973\u58F0\uFF0C\u4F46\u95FB\u5C06\u519B\u5927\u547C\u54C8\u54C8\u54C8\u3002\\r\\n\\r\\n\u4E07\u91CC\u5F00\u98DE\u673A\uFF0C\u5173\u5C71\u4E00\u4E0B\u6CA1\u3002\u70ED\u6C14\u4F20\u673A\u7FFC\uFF0C\u65E5\u5149\u7167\u73BB\u7483\u3002\\r\\n\\r\\n\u5C06\u519B\u88AB\u5413\u6B7B\uFF0C\u58EE\u58EB\u9B42\u5DF2\u98DE\u3002\u98DE\u6765\u649E\u5929\u5B50\uFF0C\u5929\u5B50\u8EBA\u75C5\u5E8A\uFF0E\\r\\n\\r\\n\u7B56\u52CB\u5341\u4E8C\u8F6C\uFF0C\u8D4F\u8D50\u4FE9\u8033\u5149\u3002\u53EF\u6C57\u95EE\u6240\u6B32\uFF0C\u6728\u5170\u4E0D\u613F\u8FDB\u7262\u623F\uFF1B\u613F\u5F00747\uFF0C\u98DE\u7740\u56DE\u6545\u4E61\u3002\\r\\n\\r\\n\u7239\u5A18\u95FB\u5973\u6765,\u7AEF\u8D77\u673A\u5173\u67AA\uFF1B\u963F\u59CA\u95FB\u59B9\u6765\uFF0C\u5F53\u6237\u4E3E\u624B\u67AA\uFF1B\u5C0F\u5F1F\u95FB\u59CA\u6765,\u78E8\u5200\u970D\u970D\u5411\u7239\u5A18\u3002\\r\\n\\r\\n\u5F00\u6211\u673A\u8231\u95E8\uFF0C\u8FDB\u6211\u98DE\u673A\u8231\uFF0C\u8131\u6211\u6218\u65F6\u888D\uFF0C\u6362\u4E0A\u98DE\u884C\u88C5, \u591A\u88C5\u624B\u69B4\u5F39\uFF0C\u5BF9\u5916\u67B6\u673A\u67AA\u3002\\r\\n\\r\\n\u51FA\u95E8\u57CB\u70B8\u5F39\uFF0C\u4EB2\u53CB\u7686\u60CA\u5FD9\uFF1A\u79BB\u522B\u5341\u4E8C\u5E74,\u4E0D\u77E5\u6728\u5170\u53D8\u7316\u72C2\u3002\\r\\n\\r\\n\u75AF\u5B50\u811A\u8E6C\u5730\uFF0C\u5446\u5B50\u773C\u7D27\u95ED\uFF0C\u4E24\u4EBA\u5E76\u6392\u8D70\uFF0C\u8C01\u80FD\u8BF4\u6211\u4E0D\\r\\n\u6B63\u5E38?\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF\uFF0C\u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3\\r\\n\\r\\n\u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\uFF0C\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0\\r\\n\\r\\n\u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E\uFF0C\u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\n\u7206\u96F6\u662F\u4E00\u79CD\u5BBF\u547D\uFF0CWA\u662F\u4E00\u79CD\u7EDD\u671B\\r\\n\\r\\nTLE\u662F\u4E00\u79CD\u75DB\u82E6\uFF0CRE\u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE\u662F\u4E00\u79CD\u65E0\u5948\uFF0CAC\u662F\u4E00\u79CD\u539F\u8C05\\r\\n\\r\\nAK\u662F\u4E00\u79CD\u5E7B\u60F3\uFF0C\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F\\r\\n\\r\\n\u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136\uFF0C\u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\n\u6A21\u62DF\u53EA\u4F1A\u731C\u9898\u610F\uFF0C\u8D2A\u5FC3\u53EA\u80FD\u8FC7\u6837\u4F8B\\r\\n\\r\\n\u6570\u5B66\u4E0A\u6765\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u4E00\u822C\u770B\u89C4\u5F8B\\r\\n\\r\\n\u7EC4\u5408\u6570\u5B66\u9760\u8FD0\u6C14\uFF0C\u8BA1\u7B97\u51E0\u4F55\u778E\u66B4\u529B\\r\\n\\r\\n\u56FE\u8BBA\u5F3A\u884C\u5957\u6A21\u677F\uFF0C\u6570\u8BBA\u53EA\u4F1A\uFF27\uFF23\uFF24\\r\\n\\r\\n\u9012\u5F52\u9012\u63A8\u4F24\u4E0D\u8D77\uFF0C\u641C\u7D22\u832B\u7136\uFF34\uFF2C\uFF25\\r\\n\\r\\n\u5206\u6CBB\u505A\u5F97\u50CF\u679A\u4E3E\uFF0C\u66B4\u529B\u679A\u4E3E\u6570\u7B2C\u4E00\\r\\n\\r\\n\u6570\u636E\u7ED3\u6784\u5E72\u77AA\u773C\uFF0C\u6012\u5237\u6C34\u9898\u627E\u4FE1\u5FC3\\r\\n\\r\\n\u6DA8\u59FF\u52BF\u4E5F\u4E0D\u5BB9\u6613\uFF0C\u8003\u8BD5\u4E00\u6765\u5168\u61F5\u903C\\r\\n\\r\\n\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\u3002\\r\\n\\r\\n\u6A21\u62DF\u5B9A\u60F3\u5168\uFF0C\u52A8\u89C4\u5B9A\u627E\u5BF9\u3002\\r\\n\\r\\n\u8D2A\u5FC3\u5B9A\u8BC1\u660E\uFF0C\u4E8C\u5206LM+1\u3002\\r\\n\\r\\n\u5404\u79CD\u8001\u5E08\u4E00\u56DE\u5934\\r\\n\\r\\n\u8BED\u6587\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u6B64\u5730\u7A7A\u4F59\u9EC4\u9E64\u697C\u3002\\r\\n\\r\\n\u6570\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6B21\u51FD\u6570\u5BF9\u79F0\u8F74\u3002\\r\\n\\r\\n\u82F1\u8BED\u8001\u5E08\u4E00\u56DE\u5934\uFF0Csorry\u52A0\u4E0A\u4E09\u514B\u6CB9\\r\\n\\r\\n\u5316\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6C27\u5316\u78B3\u53D8\u6C7D\u6CB9\u3002\\r\\n\\r\\n\u7269\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E00\u6839\u6760\u6746\u64AC\u5730\u7403\u3002\\r\\n\\r\\n\u751F\u7269\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8BD5\u7BA1\u5A74\u513F\u6C34\u4E2D\u6E38\u3002\\r\\n\\r\\n\u5730\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5927\u9646\u7248\u5757\u4E71\u6F02\u6D41\u3002\\r\\n\\r\\n\u52B3\u6280\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u7834\u94DC\u70C2\u94C1\u6765\u8D70\u79C0\u3002\\r\\n\\r\\n\u653F\u6CBB\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5E03\u4EC0\u6539\u884C\u5356\u8C46\u6CB9\u3002\\r\\n\\r\\n\u7F8E\u672F\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8499\u5A1C\u4E3D\u838E\u4E5F\u98CE\u6D41\u3002\\r\\n\\r\\n\u4F53\u80B2\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5965\u8FD0\u53D6\u6D88\u6253\u7BEE\u7403\u3002\\r\\n\\r\\n\u7535\u8111\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5B66\u751F\u5168\u6210\u963F\uFF31\u53CB\u3002\\r\\n\\r\\n\u5168\u4F53\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E16\u754C\u4EBA\u6C11\u6CA1\u81EA\u7531\u3002\\r\\n\\r\\n\u300A\u9006\u5B50\u541F\u300B\\r\\n\\r\\n\u6148\u6BCD\u624B\u4E2D\u5251\uFF0C\\r\\n\\r\\n\u9006\u5B50\u8EAB\u4E0A\u5288\u3002\\r\\n\\r\\n\u4E00\u79D2\u5341\u516B\u5251\uFF0C\\r\\n\\r\\n\u5251\u5251\u51FA\u66B4\u51FB\u3002\\r\\n\\r\\n\u7236\u89C1\u5B50\u672A\u51C9\uFF0C\\r\\n\\r\\n\u638F\u51FA\u4E03\u5339\u72FC\u3002\\r\\n\\r\\n\u5B50\u89C1\u4E03\u5339\u72FC\uFF0C\\r\\n\\r\\n\u77AC\u95F4\u900F\u5FC3\u51C9\u3002\\r\\n\\r\\n\u900F\u5FC3\u51C9\uFF0C\u5FC3\u98DE\u626C\u3002\\r\\n\\r\\n\u679C\u51BB\u6211\u8981\u559C\u4E4B\u90CE\u3002\\r\\n\\r\\n\u8001\u9AA5\u4F0F\u67A5\uFF0C\u5FD7\u5728\u5343\u91CC\u3002\u6A2A\u626B\u9965\u997F\uFF0C\u505A\u56DE\u81EA\u5DF1\u3002 \u4EF0\u5929\u5927\u7B11\u51FA\u95E8\u53BB\uFF0C\u5F52\u6765\u501A\u6756\u81EA\u53F9\u606F\u3002 \u5782\u6B7B\u75C5\u4E2D\u60CA\u5750\u8D77\uFF0C\u7B11\u95EE\u5BA2\u4ECE\u4F55\u5904\u6765\u3002 \u5341\u5E74\u751F\u6B7B\u4E24\u832B\u832B\uFF0C\u559C\u7F8A\u7F8A\u4E0E\u7070\u592A\u72FC\u3002 \u8FDC\u8D74\u4EBA\u95F4\u60CA\u9E3F\u5BB4\uFF0C\u9B3C\u5200\u4E00\u5F00\u770B\u4E0D\u89C1\u3002 \u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5BF9\u955C\u8D34\u82B1\u9EC4\u3002 \u4E00\u671D\u88AB\u86C7\u54AC\uFF0C\u5904\u5904\u95FB\u557C\u9E1F\u3002 \u67AF\u85E4\u8001\u6811\u660F\u9E26\uFF0C\u4E0A\u73ED\u6478\u9C7C\u56DE\u5BB6\uFF01 \u8BFB\u4E66\u7834\u4E07\u5377\uFF0C\u5377\u5377\u6709\u7237\u540D\u3002 \u60C5\u4E0D\u77E5\u6240\u8D77\uFF0C\u4E00\u5F80\u60C5\u6DF1\uFF0C\u518D\u800C\u8870\uFF0C\u4E09\u800C\u7AED\u3002 \u5929\u5802\u6709\u8DEF\u4F60\u4E0D\u8D70\uFF0C\u5B66\u6D77\u65E0\u6DAF\u82E6\u4F5C\u821F\u3002 \u5C11\u5C0F\u79BB\u5BB6\u8001\u5927\u56DE\uFF0C\u5B89\u80FD\u8FA8\u6211\u662F\u96C4\u96CC\u3002 \u5DF4\u5C71\u695A\u6C34\u51C4\u51C9\u5730\uFF0C\u871C\u96EA\u51B0\u57CE\u751C\u871C\u871C\u3002 \u543E\u8F88\u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5403\u4E2A\u6843\u6843\u597D\u51C9\u51C9\u3002 \u4EAC\u4E2D\u6709\u5584\u53E3 J \u8005\uFF0C\u4ECE\u6B64\u541B\u738B\u4E0D\u65E9\u671D\u3002\\r\\n\\r\\n\u5728\u8FD9\u5BCC\u88D5\u7684\u5E74\u4EE3\uFF0C\u8BD7\u4EBA\u4F55\u4E3A\uFF1F \u53EF\u662F\uFF0C\u4F60\u5374\u8BF4\uFF0C\u8BD7\u4EBA\u662F\u9152\u795E\u795E\u5723\u7684\u796D\u53F8\uFF0C \u5728\u795E\u5723\u7684\u9ED1\u591C\u4E2D\uFF0C\u4ED6\u8D70\u904D\u5927\u5730\u3002\\r\\n\\r\\n\u6211\u547D\u7531\u6211\u4E0D\u7531\u5929\uFF0C\u5434\u94A9\u5F2F\uFF0C\u5C55\u950B\u5BD2\u3002\\r\\n\\r\\n\u7EA2\u5C18\u5F80\u4E8B\u4ED8\u6D41\u6C34\uFF0C\u5FD8\u5C3D\u4FD7\u7F18\u59CB\u5F97\u771F\uFF0C\u4E00\u996E\u800C\u5C3D\uFF0C\u518D\u9189\u5343\u5E74\uFF01\\r\\n\\r\\n\u60CA\u6D9B\u5165\u6D77\u89C5\u87AD\u864E\uFF0C\u98CE\u96EA\u5F52\u5C71\u65A9\u5996\u90AA\u3002\\r\\n\\r\\n\u843D\u5CF0\u957F\u65E5\u5760\uFF0C\u8D77\u7B14\u53E0\u5D82\u5347\u3002\\r\\n\\r\\n\u4EBA\u6709\u60B2\u6B22AC\uFF0C\u6708\u6709\u9634\u6674DP\uFF0C\u6B64\u4E8B\u53E4\u96BETLE,\u4F46\u613F\u4EBAWA\uFF0C\u5343\u91CC\u5171MLE.\\r\\n\\r\\n#### \u4E00\u5929\u5730\u7406\u8001\u5E08\u95EE\uFF1A\u540C\u5B66\u4EEC\uFF0C\u6CB3\u6C34\u5411\u54EA\u91CC\u6D41\u5440?\u4E00\u5B66\u751F\u731B\u7AD9\u8D77\u6765\u5531\u5230\uFF1A\u5927\u6CB3\u5411\u4E1C\u6D41\u554A\u3002\\r\\n\\r\\n#### \u8001\u5E08\u6CA1\u7406\u4F1A\u4ED6\uFF0C\u63A5\u7740\u8BF4\uFF1A\u5929\u4E0A\u6709 \u591A\u5C11\u9897\u661F\u661F\u554A?\u90A3\u4F4D\u540C\u5B66\u53C8\u5531\u5230\uFF1A\u5929\u4E0A\u7684\u661F\u661F\u53C2\u5317\u6597\u554A\u3002\\r\\n\\r\\n#### \u8001\u5E08\u6C14\u6025\uFF1A\u4F60\u7ED9\u6211\u6EDA\u51FA\u53BB!\u5B66\u751F\uFF1A\u8BF4\u8D70\u54B1\u5C31\u8D70\u554A\u3002\u8001\u5E08\u65E0\u5948\u8BF4\uFF1A\u4F60\u6709\u75C5\u5427?\u5B66\u751F\uFF1A\u4F60\u6709\u6211\u6709\u5168\u90FD\u6709\u554A!\\r\\n\\r\\n#### \u8001\u5E08\uFF1A\u4F60\u518D\u8BF4\u4E00\u53E5\u8BD5\u8BD5\u2026\u5B66\u751F\uFF1A\u8DEF\u89C1\u4E0D\u5E73\u4E00\u58F0\u543C\u554A!\u8001\u5E08\uFF1A\u4F60\u4FE1\u4E0D\u4FE1\u6211\u63CD\u4F60?\u5B66\u751F\uFF1A\u8BE5\u51FA\u624B\u65F6\u5C31\u51FA\u624B\u2026\\r\\n\\r\\n#### \u8001\u5E08\u6012\uFF1A\u6211\u8BA9\u4F60\u9000\u5B66!\u5B66\u751F\uFF1A\u98CE\u98CE\u706B\u706B\u95EF\u4E5D\u5DDE!\u2026\\r\\n\\r\\n\u5750\u4E0A\u90A3\u53F0\u79BB\u5BB6\u7684\u7535\u8111\uFF0C\u98D8\u53BB\u65E0\u4EBA\u77E5\u6653\u7684\u673A\u623F\\r\\n\\r\\n\u80CC\u7740\u6559\u7EC3\u8BF4\u7684\u90A3\u53E5\u8BDD\uFF0C\u5B69\u5B50OI\u5176\u5B9E\u4E0D\u590D\u6742\\r\\n\\r\\n\u54E6\u54E6\u54E6BUG\u8F7B\u8F7B\u7684\u6539\\r\\n\\r\\n\u522B\u7BA1\u90A3\u591A\u5634WA\\r\\n\\r\\n\u54BD\u4E0B\u90A3\u4E9BRE\\r\\n\\r\\n\u4F60\u624D\u80FD\u6162\u6162\u957F\u5927\\r\\n\\r\\n\u8981\u9519\u8FC7\u51E0\u4E2AAC\\r\\n\\r\\n\u7528\u4F60\u6700\u597D\u7684\u5E74\u534E\\r\\n\\r\\n\u8FD9\u662F\u66B4\u529B\u7684\u4EE3\u4EF7\\r\\n\\r\\n\u3010\u5B8B\u3011\u8F9B\u5F03\u75BE \u8305\u623F\u4F4E\u5C0F\uFF0C\u81ED\u5F97\u4E0D\u5F97\u4E86\u3002\u9189\u91CC\u5434\u97F3\u76F8\u5A9A\u597D\uFF0C\u767D\u53D1\u8C01\u5BB6\u7FC1\u5AAA\uFF1F\u5927\u513F\u9504\u8C46\u5931\u8E2A\uFF0C\u4E2D\u513F\u88AB\u56F0\u9E21\u7B3C\u3002\u6700\u559C\u5C0F\u513F\u4EA1\u8D56\uFF0C\u6EAA\u5934\u62D0\u5356\u513F\u7AE5\u3002\\r\\n\\r\\n\u9759\u591C\u601D \u3010\u5510\u3011\u674E\u767D \u5E8A\u524D\u660E\u6708\u5149\uFF0C \u674E\u767D\u7761\u7684\u9999\u3002 \u68A6\u89C1\u68D2\u68D2\u7CD6\uFF0C \u53E3\u6C34\u4E09\u5343\u4E08\u3002\\r\\n\\r\\nAC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nPC=Perfect Compile=\u5B8C\u7F8E\u7684\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nOLE=Output Limit Enough=\u8F93\u51FA\u5408\u6CD5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\\r\\n\\r\\n\u4EE5\u4E0B\u662F\u201C\u4E00\u8A00\u201D\uFF08\u56FE\u7075\u4E3B\u9875\uFF09^(*\uFFE3(oo)\uFFE3)^\\r\\n^ ^\\r\\no\\r\\n\\r\\n\u6211\u6240\u521B\u9020\u7684\u602A\u7269\uFF0C\u662F\u6211\u7684\u7F6A\u4E0E\u6076\uFF0C\u662F\u6211\u7684\u7231\u4E0E\u4FDD\u62A4 !\\r\\n\\r\\n\u4E00\u677F\u4E00\u773C\uFF0C\u5C31\u4F1A\u6ECB\u751F\u5F31\u70B9\u3002\\r\\n\\r\\n\u4F60\u6B3A\u4ED6\u773C\u76F2\uFF0C\u9A97\u5F97\u4ED6\u597D\u82E6\uFF01\\r\\n\\r\\n\u4ECE\u8FD9\u91CC\uFF08\u592A\u7A7A\uFF09\u6839\u672C\u770B\u4E0D\u5230\u4EC0\u4E48\u56FD\u5883\u7EBF\uFF0C\u53EA\u6709\u5730\u7403\u3002\\r\\n\\r\\n\u6CA1\u6709\u5149\u660E\u662F\u4E0D\u5E78\u7684\u4E48\uFF1F\u4E0D\uFF0C\u9700\u8981\u5149\u660E\u624D\u662F\u771F\u6B63\u7684\u4E0D\u5E78\u3002\\r\\n\\r\\n\u98CE\u5411\u662F\u4F1A\u8F6C\u53D8\u7684\u3002\\r\\n\\r\\n\u4E3A\u6BDB\u6211\u7684\u773C\u91CC\u5E38\u542B\u6CEA\u6C34\uFF0C\u56E0\u4E3A\u6211\u8001\u662F\u8EBA\u7740\u4E2D\u67AA\u3002\\r\\n\\r\\n\u6625\u98CE\u8D77\uFF0C\u82B1\u98D8\u96F6\uFF0C\u68A6\u9192\u65F6\u5206\uFF0C\u5374\u6709\u51E0\u591A\u6101\uFF0C\u4E0A\u5FC3\u5934\\r\\n\\r\\n\u5C31\u7B97\u98CE\u5439\u6563\u4E86\u51B0\u96EA\uFF0C\u60F3\u5FF5\u4E5F\u4F1A\u7559\u5B58\u4E0B\u6765\u3002\\r\\n\\r\\n\u65E0\u8BBA\u6492\u600E\u6837\u7684\u8C0E\uFF0C\u90FD\u65E0\u6CD5\u6B3A\u9A97\u81EA\u5DF1\u7684\u5FC3\u3002\\r\\n\\r\\n\u5982\u679C\u6709\u4E00\u4E2A\u559C\u6B22\u4F60\u7684\u4EBA\u51FA\u73B0\uFF0C\u4E00\u5B9A\u4E0D\u8981\u51F6\u5979\u54E6\uFF01\\r\\n\\r\\n\u6211\u4EEC\u901A\u5E38\u628A\u81EA\u5DF1\u505A\u7684\u50BB\u4E8B\u79F0\u4E3A\u201C\u547D\u8FD0\u201D\u3002\\r\\n\\r\\n\u6211\u7231\u4F60\uFF0C\u4E0E\u4F60\u6709\u4F55\u76F8\u5E72\uFF1F\u6BC1\u706D\u4F60\uFF0C\u53C8\u4E0E\u4F60\u6709\u4F55\u76F8\u5E72\uFF1F\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n//\u5403\u8C46\u4EBA\u6E38\u620F\uD83D\uDC40\uFE0F \uFF08\u6765\u6E90CSDN,\u53EF\u4EE5\u590D\u5236\uFF09\\r\\n#include <cstdio>\\r\\n#include <iostream>\\r\\n#include <ctime>\\r\\n#include <conio.h>\\r\\n#include <windows.h> //\u505C\u987F:Sleep(); \\r\\n#include <cstdlib> //\u6E05\u5C4F:system(\\"cls\\");\\r\\n#include <cstring>\\r\\nusing namespace std;\\r\\nconst int n=809;\\r\\nstruct Point {int x,y;};\\r\\nint dali;\\r\\nint fx[4]={-1,27,1,-27};\\r\\nint fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}};\\r\\nint dis[1000][1000]; //0:\u5899 1:\u6709\u5206\u7684\u8DEF 2:\u6CA1\u5206\u7684\u8DEF 3:\u602A\u7269\u7684\u5BB6 \\r\\nint changdi[30][27]={\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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}\\r\\n};\\r\\nint x,x1,x2,x3,x4,y,y1,y2,y3,y4;\\r\\nint now,now1,now2,now3,now4;\\r\\nint g1,g2,g3,g4;\\r\\nint fangx,nextfx,last1,last2,last3,last4;\\r\\nint fenshu,guozi,guaitimer;\\r\\nint T1,T2,t1,t2,stopped; //T:\u8BA1\u65F6 t1:\u73A9\u5BB6\u901F\u5EA6 t2:\u602A\u7269\u901F\u5EA6 \\r\\nint f=0; //f:{0:\u7EE7\u7EED 1:\u88AB\u5403 2:\u8D62\u4E86 3:\u8F93\u4E86}\\r\\nint beichi;\\r\\nvoid color(int a)//\u989C\u8272\u51FD\u6570\\r\\n{\\r\\nSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a);\\r\\n}\\r\\nvoid gotoxy(int x,int y)//\u4F4D\u7F6E\u51FD\u6570(\u884C\u4E3Ax \u5217\u4E3Ay)\\r\\n{\\r\\nCOORD pos;\\r\\npos.X=2*y;\\r\\npos.Y=x;\\r\\nSetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);\\r\\n}\\r\\nvoid begin(){\\r\\nsystem(\\"cls\\");\\r\\ncolor(11); printf(\\" \u2605\\"); color(10); printf(\\"\u5403\u8C46\u4EBA\\"); color(11); printf(\\"\u2605\\\\n\\\\n\\"); color(7);\\r\\nprintf(\\" \u8BF7\u5C06\u7A97\u53E3\u5F00\u81F3\\"); color(11); printf(\\"\u5168\u5C4F\\\\n\\"); color(7);\\r\\nprintf(\\" \u6B63\u5728\u521D\u59CB\u5316\uFF0C\u8BF7\u8010\u5FC3\u7B49\u5F85\\"); \\r\\nfor (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900;\\r\\n for (int i=0; i<=n; i++){\\r\\n for (int j=0; j<=3; j++){\\r\\n if (i+fx[j]>=0 && i+fx[j]<=n){\\r\\n int k=i+fx[j],xx=k/27,yy=k%27,kk;\\r\\n if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1;\\r\\n }\\r\\n }\\r\\n}\\r\\n for (int k=0; k<=n; k++)if(changdi[k]){\\r\\n for (int i=0; i<=n; i++)if(changdi[i])\\r\\n for (int j=0; j<=n; j++)if(changdi[j])\\r\\n if (dis[i][j]>dis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j];\\r\\n if (k%80==0){color (13); gotoxy(3,12); printf(\\"\u2502\\");}\\r\\n if (k%80==20){color(13); gotoxy(3,12); printf(\\"\u2571\\");}\\r\\n if (k%80==40){color(13); gotoxy(3,12); printf(\\"\u2500\\");}\\r\\n if (k%80==60){color(13); gotoxy(3,12); printf(\\"\u2572\\");}\\r\\n if (k%60==0){color(11); gotoxy(5,k/60); printf(\\"\u25CF\\");}\\r\\n}\\r\\n}\\r\\nvoid shuru(){\\r\\nchar ch=getch();\\r\\nif (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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse if (ch==\'0\' | ch==\'s\') stopped=(stopped+1)%2;\\r\\nelse if (ch==\'4\' | ch==\'a\') t1++;\\r\\nelse if (ch==\'7\' | ch==\'q\') t2++;\\r\\nelse if ((ch==\'6\' | ch==\'d\') && t1-1>0) t1--; \\r\\nelse if ((ch==\'9\' | ch==\'e\') && t2-1>0) t2--;\\r\\nelse if (ch==\'g\') dali=(dali+1)%2;\\r\\n}\\r\\nvoid reset(){\\r\\nsystem(\\"cls\\"); color(7);\\r\\ngotoxy(2,30); printf(\\"\u63A7\u5236\u65B9\u5411\uFF1A1/2/3/5\\");\\r\\ngotoxy(4,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A4/6\\");\\r\\ngotoxy(6,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A7/9\\");\\r\\nx=22; y=13; \\r\\nx1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15;\\r\\nnow=607; now1=389; now2=390; now3=392; now4=393;\\r\\nfor (int k=0; k<=n; k++){\\r\\n int i=k/27,j=k%27;\\r\\n gotoxy(i,j);\\r\\n if (changdi[i][j]==1){color(7); printf(\\"?\\");}\\r\\n else if (!changdi[i][j]){color(1); printf(\\"\u25A0\\");}\\r\\n if (j=26){gotoxy(i,27); color(7); printf(\\"%d\\",i);} \\r\\n}\\r\\ngotoxy(0,0);\\r\\ngotoxy(x,y); color(14); printf(\\"\u25CF\\");\\r\\ngotoxy(x1,y1); color(4); printf(\\"\u25C6\\");\\r\\ngotoxy(x2,y2); color(5); printf(\\"\u25C6\\");\\r\\ngotoxy(x3,y3); color(3); printf(\\"\u25C6\\");\\r\\ngotoxy(x4,y4); color(2); printf(\\"\u25C6\\");\\r\\nfangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0;\\r\\ngotoxy(14,30); printf(\\" \\");\\r\\n}\\r\\nvoid move1(){\\r\\nint xx,yy;\\r\\nxx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1];\\r\\nif (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n fangx=nextfx;\\r\\n}\\r\\nelse{\\r\\n if (x==13 && y==0 && fangx==0){xx=x; yy=26;}\\r\\n else if (x==13 && y==26 && fangx==2){xx=x; yy=0;}\\r\\n else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];}\\r\\n if (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n }\\r\\n }\\r\\ncolor(7);\\r\\n//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]);\\r\\n}\\r\\nvoid move2(){\\r\\nint haha,minhaha,xx,yy,chi=0;\\r\\nif (g1){\\r\\n minhaha=2147483647;\\r\\n if (now1%27==0 | now1%27==26) haha=last1;\\r\\n else if (!dali){\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha<dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now1+=fx[haha]; last1=(haha+2)%4;\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last1=0;\\r\\n gotoxy(now1/27,now1%27); \\r\\n if (changdi[now1/27][now1%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now1=389;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g2){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[fangx][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[fangx][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now2%27==0 | now2%27==26) haha=last2;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha<dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n }\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last2=0;\\r\\n gotoxy(now2/27,now2%27); \\r\\n if (changdi[now2/27][now2%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now2=390;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g3){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[(fangx+1)%4][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[(fangx+1)%4][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now3%27==0 | now3%27==26) haha=last3;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else {\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha<dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n } \\r\\n xx=now3/27; yy=now3%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now3/27; yy=now3%27; \\r\\n gotoxy(xx,yy); color(3); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last3=0;\\r\\n gotoxy(now3/27,now3%27); \\r\\n if (changdi[now3/27][now3%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now3=341;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (chi) beichi++;\\r\\n}\\r\\nint main(){\\r\\nbegin();\\r\\nint jixu=1;\\r\\nreset();\\r\\n string bb[4]={\\"\u25CF\\",\\"\u2460\\",\\"\u2461\\",\\"\u2462\\"}; color(7);\\r\\ngotoxy(12,12); printf(\\"\u5012\u8BA1\u65F6\\"); color(12);\\r\\nfor (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);}\\r\\ngotoxy(12,12); printf(\\" \\"); gotoxy(13,13); printf(\\" \\"); color(7);\\r\\nwhile (!f){\\r\\n Sleep(1);\\r\\n gotoxy(10,30); printf(\\"\u5F97\u5206\uFF1A%d \\",fenshu);\\r\\n gotoxy(8,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A%d \\",300-t2);\\r\\n gotoxy(9,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A%d \\",300-t1);\\r\\n gotoxy(15,30); printf(\\"\u88AB\u5403\u6B21\u6570\uFF1A%d \\",beichi);\\r\\n if (kbhit()) shuru();\\r\\n if (stopped) continue;\\r\\n T1=(T1+1)%t1; T2=(T2+1)%t2;\\r\\n if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1();\\r\\n if (T2%t2==0){\\r\\n if (guaitimer<=8){\\r\\n if (guaitimer==0) g1=1;\\r\\n if (guaitimer==8) g2=1;\\r\\n guaitimer++;\\r\\n }\\r\\n if (!g3 && fenshu>=30) g3=1;\\r\\n move2(); \\r\\n }\\r\\n if (fenshu==guozi)f=2;\\r\\n}\\r\\nif (f=2) {\\r\\n Sleep(3000);\\r\\n system(\\"cls\\");\\r\\n printf(\\"\u606D\u559C\u4F60\u5403\u5B8C\u4E86\uFF01\\\\n\u4F60\u4E00\u5171\u88AB\u602A\u7269\u5403\u6389\u4E86 %d \u6B21\\",beichi);\\r\\n Sleep(3000);\\r\\n char ying;\\r\\n scanf(\\"%c\\",&ying);\\r\\n}\\r\\n}\\r\\n```1\u3001\u5899\u4E0A\u6302\u9762\u9F13\uFF0C\u9F13\u4E0A\u753B\u8001\u864E\uFF0C\u8001\u864E\u6293\u7834\u9F13\uFF0C\u62FF\u5757\u5E03\u6765\u8865\u3002\\r\\n\u3000\u3000\u4E0D\u77E5\u662F\u5E03\u8865\u9F13\uFF0C\u8FD8\u662F\u5E03\u8865\u864E?\\r\\n\u3000\u30002\u3001\u5634\u8BF4\u817F\uFF0C\u817F\u8BF4\u5634\uFF0C\u5634\u8BF4\u817F\u7231\u8DD1\u817F\uFF0C\u817F\u8BF4\u5634\u7231\u5356\u5634\u3002\\r\\n\u3000\u3000\u5149\u52A8\u5634\u4E0D\u52A8\u817F\uFF0C\u5149\u52A8\u817F\u4E0D\u52A8\u5634\uFF0C\u4E0D\u5982\u4E0D\u957F\u817F\u548C\u5634\u3002\\r\\n\u3000\u30003\u3001\u4E03\u52A0\u4E00\uFF0C\u518D\u51CF\u4E00\uFF0C\u52A0\u5B8C\u51CF\u5B8C\u7B49\u4E8E\u51E0?\u4E03\u52A0\u4E00\uFF0C\u518D\u51CF\u4E00\uFF0C\u52A0\u5B8C\u51CF\u5B8C\u8FD8\u662F\u4E03\u3002\\r\\n\u3000\u30004\u3001\u5927\u5200\u5BF9\u5355\u5200\uFF0C\u5355\u5200\u5BF9\u5927\u5200\uFF0C\u5927\u5200\u6597\u5355\u5200\uFF0C\u5355\u5200\u593A\u5927\u5200\u3002\\r\\n\u3000\u30005\u3001\u4F60\u4E5F\u52E4\u6765\u6211\u4E5F\u52E4\uFF0C\u751F\u4EA7\u540C\u5FC3\u571F\u53D8\u91D1\u3002\u5DE5\u4EBA\u519C\u6C11\u4EB2\u5144\u5F1F\uFF0C\u5FC3\u5FC3\u76F8\u5370\u56E2\u7ED3\u7D27\u3002\\r\\n\u3000\u30006\u3001\u957F\u866B\u56F4\u7740\u7816\u5806\u8F6C\uFF0C\u8F6C\u5B8C\u7816\u5806\u94BB\u7816\u5806\u3002\\r\\n\u3000\u30007\u3001\u4E09\u5C71\u5C79\u56DB\u6C34\uFF0C\u56DB\u6C34\u7ED5\u4E09\u5C71;\u4E09\u5C71\u56DB\u6C34\u6625\u5E38\u5728\uFF0C\u56DB\u6C34\u4E09\u5C71\u56DB\u65F6\u6625\u3002\\r\\n\u3000\u30008\u3001\u5E08\u90E8\u53F8\u4EE4\u90E8\u6307\u793A\uFF1A\u56DB\u56E2\u5341\u8FDE\u77F3\u8FDE\u957F\u5E26\u56DB\u5341\u4EBA\u5728\u5341\u65E5\u56DB\u65F6\u56DB\u5341\u56DB\u5206\u6309\u65F6\u5230\u8FBE\u5E08\u90E8\u53F8\u4EE4\u90E8\uFF0C\u5E08\u957F\u53EC\u5F00\u8A93\u5E08\u5927\u4F1A\u3002\\r\\n\u3000\u30009\u3001\u6709\u4E2A\u9762\u94FA\u95E8\u671D\u5357\uFF0C\u95E8\u4E0A\u6302\u7740\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u6458\u4E86\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u9762\u94FA\u95E8\u671D\u5357;\u6302\u4E0A\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u9762\u94FA\u8FD8\u662F\u95E8\u671D\u5357\u3002\\r\\n\u3000\u300010\u3001\u5C71\u524D\u6709\u4E2A\u4E25\u5706\u773C\uFF0C\u5C71\u540E\u6709\u4E2A\u4E25\u773C\u5706\uFF0C\u4E8C\u4EBA\u5C71\u524D\u6765\u6BD4\u773C\uFF0C\u4E0D\u77E5\u662F\u4E25\u5706\u773C\u7684\u773C\u5706\uFF0C\u8FD8\u662F\u4E25\u773C\u5706\u6BD4\u4E25\u5706\u773C\u7684\'\u773C\u5706?\\r\\n\u3000\u300020__\u5E74\u7ECF\u5178\u7ED5\u53E3\u4EE4\u30102\u3011\\r\\n\u3000\u3000\u5C0F\u5149\u548C\u5C0F\u521A\uFF0C\u62AC\u7740\u6C34\u6876\u4E0A\u5C97\u3002\u4E0A\u5C71\u5C97\uFF0C\u6B47\u6B47\u51C9\uFF0C\u62FF\u8D77\u7AF9\u7AFF\u73A9\u6253\u4ED7\u3002\u4E52\u4E52\u4E52\uFF0C\u4E53\u4E53\u4E53\uFF0C\u6253\u6765\u6253\u53BB\u7838\u4E86\u7F38\u3002\u5C0F\u5149\u602A\u5C0F\u521A\uFF0C\u5C0F\u521A\u602A\u5C0F\u5149\uFF0C\u5C0F\u5149\u5C0F\u521A\u90FD\u602A\u4E3F\u7AFF\u548C\u6C34\u7F38\u3002\\r\\n\u3000\u3000\u5C0F\u534E\u548C\u80D6\u5A03\uFF0C\u4E24\u4E2A\u79CD\u82B1\u53C8\u79CD\u74DC\uFF0C\u5C0F\u534E\u4F1A\u79CD\u82B1\u4E0D\u4F1A\u79CD\u74DC\uFF0C\u80D6\u5A03\u4F1A\u79CD\u74DC\u4E0D\u4F1A\u79CD\u82B1\u3002\\r\\n\u3000\u3000\u8F9B\u5382\u957F\uFF0C\u7533\u5382\u957F\uFF0C\u540C\u4E61\u4E0D\u540C\u884C\u3002\u8F9B\u5382\u957F\u58F0\u58F0\u8BB2\u751F\u4EA7\uFF0C\u7533\u5382\u957F\u5E38\u5E38\u95F9\u601D\u60F3\u3002\u8F9B\u5382\u957F\u4E00\u5FC3\u53EA\u60F3\u9769\u65B0\u5382\uFF0C\u7533\u5382\u957F\u6EE1\u53E3\u53EA\u8BB2\u52A0\u85AA\u9977\u3002\\r\\n\u3000\u3000\u4E00\u4E2A\u80D6\u5A03\u5A03\uFF0C\u6349\u4E86\u4E09\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\uFF0C\u4E09\u4E2A\u80D6\u5A03\u5A03\uFF0C\u6349\u4E86\u4E00\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\uFF0C\u6349\u4E86\u4E00\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\u7684\u4E09\u4E2A\u80D6\u5A03\u5A03\uFF0C\u771F\u4E0D\u5982\u6349\u4E86\u4E09\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\u7684\u4E00\u4E2A\u80D6\u5A03\u5A03\u3002\u5527\u5527\u590D\u5527\u5527\uFF0C\u6728\u5170\u5F00\u98DE\u673A\uFF0C \u5F00\u7684\u4EC0\u4E48\u673A\uFF1F\u6CE2\u97F3747\uFF01\\r\\n\\r\\ncase 16:\\r\\n if (collisionDetection(block07, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block07, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block07, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 17:\\r\\n if (collisionDetection(block08, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block08, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block08, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 18:\\r\\n if (collisionDetection(block09, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block09, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block09, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 19:\\r\\n if (collisionDetection(block06, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block06, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block06, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 20:\\r\\n if (collisionDetection(block11, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block11, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block11, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 21:\\r\\n if (collisionDetection(block12, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block12, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block12, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 22:\\r\\n if (collisionDetection(block13, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block13, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block13, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 23:\\r\\n if (collisionDetection(block10, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block10, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block10, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 24:\\r\\n if (collisionDetection(block15, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block15, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block15, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 25:\\r\\n if (collisionDetection(block14, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block14, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block14, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 26:\\r\\n if (collisionDetection(block17, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block17, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block17, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 27:\\r\\n if (collisionDetection(block16, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block16, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block16, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ndefault:\\r\\n break;\\r\\n}\\r\\n```\\r\\n\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n\\r\\n\u4EBA\u751F\u5C31\u50CF\u5C71\u5CF0\uFF0C\u8D77\u8D77\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\\r\\n\\r\\n\\r\\n\\r\\n#include<bits/stdc++.h>\\r\\nusing namespace std;\\r\\nstruct Node{\\r\\nint l,r;\\r\\n}yx[1111111];\\r\\nvoid dfs(int u){\\r\\ncout<<u<<\\"\\\\n\\";\\r\\nif(yx[u].l)dfs(yx[u].l);\\r\\nif(yx[u].r)dfs(yx[u].r);\\r\\n}\\r\\nint main(){\\r\\nios::sync_with_stdio(0);\\r\\ncin.tie(0);\\r\\ncout.tie(0);\\r\\nint n;\\r\\ncin>>n;\\r\\nfor(int i=1;i<=n;i++)cin>>yx[i].l>>yx[i].r;\\r\\ndfs(n);\\r\\n//\\tsystem(\\"shutdown -S -t 100\\");\\r\\nreturn 0;\\r\\n}\\r\\n\\r\\nsrand((unsigned)time(NULL));\\r\\nroundBlock(hOut, blockA);\\r\\nwhile (true)\\r\\n{\\r\\nif (check)\\r\\n{\\r\\neliminateRow(hOut, map, val, fraction, checkpoint);\\r\\ncheck = false;\\r\\npositionX = -3;\\r\\npositionY = 4;\\r\\nif (collisionDetection(blockA, map, positionX, positionY))\\r\\n{\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblockB[i][j] = blockA[i][j];\\r\\n}\\r\\n}\\r\\nroundBlock(hOut, blockA);\\r\\n}\\r\\nelse\\r\\n{\\r\\ngameOver(hOut, blockA, map);\\r\\ngoto initial;\\r\\n}\\r\\n}\\r\\nprintBlock(hOut, blockB, positionX, positionY);\\r\\nif (_kbhit())\\r\\n{\\r\\nkey = _getch();\\r\\nswitch (key)\\r\\n{\\r\\ncase 72:\\r\\nmyUp(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 75:\\r\\nmyLeft(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 77:\\r\\nmyRight(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 80:\\r\\nswitch (myDown(hOut, blockB, map, positionX, positionY))\\r\\n{\\r\\ncase 0:\\r\\ncheck = false;\\r\\nbreak;\\r\\ncase 1:\\r\\ncheck = true;\\r\\nbreak;\\r\\ncase 2:\\r\\ngameOver(hOut, blockB, map);\\r\\ngoto initial;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\nbreak;\\r\\ncase 32:\\r\\nmyStop(hOut, blockA);\\r\\nbreak;\\r\\ncase 27:\\r\\nexit(0);\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n}\\r\\nSleep(20);\\r\\nif (0 == --times)\\r\\n{\\r\\nswitch (myDown(hOut, blockB, map, positionX, positionY))\\r\\n{\\r\\ncase 0:\\r\\ncheck = false;\\r\\nbreak;\\r\\ncase 1:\\r\\ncheck = true;\\r\\nbreak;\\r\\ncase 2:\\r\\ngameOver(hOut, blockB, map);\\r\\ngoto initial;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\ntimes = val;\\r\\n}\\r\\n}\\r\\ncin.get();\\r\\nreturn 0;\\r\\n\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n//\u5403\u8C46\u4EBA\u6E38\u620F\uD83D\uDC40\uFE0F \uFF08\u6765\u6E90CSDN,\u53EF\u4EE5\u590D\u5236\uFF09\\r\\n#include <cstdio>\\r\\n#include <iostream>\\r\\n#include <ctime>\\r\\n#include <conio.h>\\r\\n#include <windows.h> //\u505C\u987F:Sleep(); \\r\\n#include <cstdlib> //\u6E05\u5C4F:system(\\"cls\\");\\r\\n#include <cstring>\\r\\nusing namespace std;\\r\\nconst int n=809;\\r\\nstruct Point {int x,y;};\\r\\nint dali;\\r\\nint fx[4]={-1,27,1,-27};\\r\\n\\r\\n\\r\\nint fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}};\\r\\nint dis[1000][1000]; //0:\u5899 1:\u6709\u5206\u7684\u8DEF 2:\u6CA1\u5206\u7684\u8DEF 3:\u602A\u7269\u7684\u5BB6 \\r\\nint changdi[30][27]={\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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}\\r\\n};\\r\\nint x,x1,x2,x3,x4,y,y1,y2,y3,y4;\\r\\nint now,now1,now2,now3,now4;\\r\\nint g1,g2,g3,g4;\\r\\nint fangx,nextfx,last1,last2,last3,last4;\\r\\nint fenshu,guozi,guaitimer;\\r\\nint T1,T2,t1,t2,stopped; //T:\u8BA1\u65F6 t1:\u73A9\u5BB6\u901F\u5EA6 t2:\u602A\u7269\u901F\u5EA6 \\r\\nint f=0; //f:{0:\u7EE7\u7EED 1:\u88AB\u5403 2:\u8D62\u4E86 3:\u8F93\u4E86}\\r\\nint beichi;\\r\\nvoid color(int a)//\u989C\u8272\u51FD\u6570\\r\\n{\\r\\nSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a);\\r\\n}\\r\\nvoid gotoxy(int x,int y)//\u4F4D\u7F6E\u51FD\u6570(\u884C\u4E3Ax \u5217\u4E3Ay)\\r\\n{\\r\\nCOORD pos;\\r\\npos.X=2*y;\\r\\npos.Y=x;\\r\\nSetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);\\r\\n}\\r\\nvoid begin(){\\r\\nsystem(\\"cls\\");\\r\\ncolor(11); printf(\\" \u2605\\"); color(10); printf(\\"\u5403\u8C46\u4EBA\\"); color(11); printf(\\"\u2605\\\\n\\\\n\\"); color(7);\\r\\nprintf(\\" \u8BF7\u5C06\u7A97\u53E3\u5F00\u81F3\\"); color(11); printf(\\"\u5168\u5C4F\\\\n\\"); color(7);\\r\\nprintf(\\" \u6B63\u5728\u521D\u59CB\u5316\uFF0C\u8BF7\u8010\u5FC3\u7B49\u5F85\\"); \\r\\nfor (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900;\\r\\n for (int i=0; i<=n; i++){\\r\\n for (int j=0; j<=3; j++){\\r\\n if (i+fx[j]>=0 && i+fx[j]<=n){\\r\\n int k=i+fx[j],xx=k/27,yy=k%27,kk;\\r\\n if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1;\\r\\n }\\r\\n }\\r\\n}\\r\\n for (int k=0; k<=n; k++)if(changdi[k]){\\r\\n for (int i=0; i<=n; i++)if(changdi[i])\\r\\n for (int j=0; j<=n; j++)if(changdi[j])\\r\\n if (dis[i][j]>dis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j];\\r\\n if (k%80==0){color (13); gotoxy(3,12); printf(\\"\u2502\\");}\\r\\n if (k%80==20){color(13); gotoxy(3,12); printf(\\"\u2571\\");}\\r\\n if (k%80==40){color(13); gotoxy(3,12); printf(\\"\u2500\\");}\\r\\n if (k%80==60){color(13); gotoxy(3,12); printf(\\"\u2572\\");}\\r\\n if (k%60==0){color(11); gotoxy(5,k/60); printf(\\"\u25CF\\");}\\r\\n}\\r\\n}\\r\\nvoid shuru(){\\r\\nchar ch=getch();\\r\\nif (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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse if (ch==\'0\' | ch==\'s\') stopped=(stopped+1)%2;\\r\\nelse if (ch==\'4\' | ch==\'a\') t1++;\\r\\nelse if (ch==\'7\' | ch==\'q\') t2++;\\r\\nelse if ((ch==\'6\' | ch==\'d\') && t1-1>0) t1--; \\r\\nelse if ((ch==\'9\' | ch==\'e\') && t2-1>0) t2--;\\r\\nelse if (ch==\'g\') dali=(dali+1)%2;\\r\\n}\\r\\nvoid reset(){\\r\\nsystem(\\"cls\\"); color(7);\\r\\ngotoxy(2,30); printf(\\"\u63A7\u5236\u65B9\u5411\uFF1A1/2/3/5\\");\\r\\ngotoxy(4,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A4/6\\");\\r\\ngotoxy(6,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A7/9\\");\\r\\nx=22; y=13; \\r\\nx1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15;\\r\\nnow=607; now1=389; now2=390; now3=392; now4=393;\\r\\nfor (int k=0; k<=n; k++){\\r\\n int i=k/27,j=k%27;\\r\\n gotoxy(i,j);\\r\\n if (changdi[i][j]==1){color(7); printf(\\"?\\");}\\r\\n else if (!changdi[i][j]){color(1); printf(\\"\u25A0\\");}\\r\\n if (j=26){gotoxy(i,27); color(7); printf(\\"%d\\",i);} \\r\\n}\\r\\ngotoxy(0,0);\\r\\ngotoxy(x,y); color(14); printf(\\"\u25CF\\");\\r\\ngotoxy(x1,y1); color(4); printf(\\"\u25C6\\");\\r\\ngotoxy(x2,y2); color(5); printf(\\"\u25C6\\");\\r\\ngotoxy(x3,y3); color(3); printf(\\"\u25C6\\");\\r\\ngotoxy(x4,y4); color(2); printf(\\"\u25C6\\");\\r\\nfangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0;\\r\\ngotoxy(14,30); printf(\\" \\");\\r\\n}\\r\\nvoid move1(){\\r\\nint xx,yy;\\r\\nxx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1];\\r\\nif (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n fangx=nextfx;\\r\\n}\\r\\nelse{\\r\\n if (x==13 && y==0 && fangx==0){xx=x; yy=26;}\\r\\n else if (x==13 && y==26 && fangx==2){xx=x; yy=0;}\\r\\n else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];}\\r\\n if (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n }\\r\\n }\\r\\ncolor(7);\\r\\n//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]);\\r\\n}\\r\\nvoid move2(){\\r\\nint haha,minhaha,xx,yy,chi=0;\\r\\nif (g1){\\r\\n minhaha=2147483647;\\r\\n if (now1%27==0 | now1%27==26) haha=last1;\\r\\n else if (!dali){\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha<dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now1+=fx[haha]; last1=(haha+2)%4;\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last1=0;\\r\\n gotoxy(now1/27,now1%27); \\r\\n if (changdi[now1/27][now1%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now1=389;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g2){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[fangx][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[fangx][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now2%27==0 | now2%27==26) haha=last2;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha<dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n }\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last2=0;\\r\\n gotoxy(now2/27,now2%27); \\r\\n if (changdi[now2/27][now2%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now2=390;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g3){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[(fangx+1)%4][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[(fangx+1)%4][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now3%27==0 | now3%27==26) haha=last3;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else {\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha<dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n } \\r\\n xx=now3/27; yy=now3%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now3/27; yy=now3%27; \\r\\n gotoxy(xx,yy); color(3); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last3=0;\\r\\n gotoxy(now3/27,now3%27); \\r\\n if (changdi[now3/27][now3%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now3=341;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (chi) beichi++;\\r\\n}\\r\\nint main(){\\r\\nbegin();\\r\\nint jixu=1;\\r\\nreset();\\r\\n string bb[4]={\\"\u25CF\\",\\"\u2460\\",\\"\u2461\\",\\"\u2462\\"}; color(7);\\r\\ngotoxy(12,12); printf(\\"\u5012\u8BA1\u65F6\\"); color(12);\\r\\nfor (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);}\\r\\ngotoxy(12,12); printf(\\" \\"); gotoxy(13,13); printf(\\" \\"); color(7);\\r\\nwhile (!f){\\r\\n Sleep(1);\\r\\n gotoxy(10,30); printf(\\"\u5F97\u5206\uFF1A%d \\",fenshu);\\r\\n gotoxy(8,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A%d \\",300-t2);\\r\\n gotoxy(9,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A%d \\",300-t1);\\r\\n gotoxy(15,30); printf(\\"\u88AB\u5403\u6B21\u6570\uFF1A%d \\",beichi);\\r\\n if (kbhit()) shuru();\\r\\n if (stopped) continue;\\r\\n T1=(T1+1)%t1; T2=(T2+1)%t2;\\r\\n if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1();\\r\\n if (T2%t2==0){\\r\\n if (guaitimer<=8){\\r\\n if (guaitimer==0) g1=1;\\r\\n if (guaitimer==8) g2=1;\\r\\n guaitimer++;\\r\\n }\\r\\n if (!g3 && fenshu>=30) g3=1;\\r\\n move2(); \\r\\n }\\r\\n if (fenshu==guozi)f=2;\\r\\n}\\r\\nif (f=2) {\\r\\n Sleep(3000);\\r\\n system(\\"cls\\");\\r\\n printf(\\"\u606D\u559C\u4F60\u5403\u5B8C\u4E86\uFF01\\\\n\u4F60\u4E00\u5171\u88AB\u602A\u7269\u5403\u6389\u4E86 %d \u6B21\\",beichi);\\r\\n Sleep(3000);\\r\\n char ying;\\r\\n scanf(\\"%c\\",&ying);\\r\\n}\\r\\n}\\r\\n\\r\\n\\r\\n/*\\r\\n\u72FC\u4EBA\u6740V2.0\\r\\n\u66F4\u65B0\u5E73\u7968\u7CFB\u7EDF\u3001\u8B66\u957F \\r\\n\u4EE3\u7801\u6574\u7406 \\r\\n\u5404\u79CDBug\u4FEE\u590D\\r\\n*/\\r\\n#include<bits/stdc++.h>\\r\\n#include<windows.h>\\r\\n#include<conio.h>\\r\\nusing namespace std;\\r\\n\\r\\nconst int daytime=0,night=1;\\r\\nint day=0, during_time=daytime, player_number, my_number;\\r\\nHWND hwnd=GetForegroundWindow();//\u7A97\u53E3\u5B9A\u4E49\\r\\n\\r\\n/*\u8BBE\u7F6E\u989C\u8272*/\\r\\nconst int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//\u989C\u8272\u5E38\u91CF \\r\\nvoid color(int c){\\r\\n switch(c)\\r\\n {\\r\\n case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break;\\r\\n case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break;\\r\\n case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break;\\r\\n case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break;\\r\\n case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break;\\r\\n case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break;\\r\\n }\\r\\n}\\r\\nint idx_police=-1;\\r\\n\\r\\n/*\u63A7\u5236\u5149\u6807\u5728\u63A7\u5236\u53F0\u7684\u4F4D\u7F6E */\\r\\nvoid gotoxy(int x,int y){\\r\\n COORD position;\\r\\n position.X=x;\\r\\n position.Y=y;\\r\\n SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position);\\r\\n}\\r\\n\\r\\n/*\u521D\u59CB\u5316\u7A97\u53E3*/\\r\\nvoid init_Show_Window(){\\r\\n system(\\"mode con lines=60 cols=188\\");//\u5168\u5C4F \\r\\n ShowWindow(hwnd,SW_MAXIMIZE);//\u7A97\u53E3\u6700\u5927\u5316 \\r\\n DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND);\\r\\n DrawMenuBar(GetConsoleWindow());//\u5220\u9664\xD7\u5B57\u7B26 \\r\\n}\\r\\n\\r\\n/*\u73A9\u5BB6\u7C7B*/\\r\\nconst int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2;\\r\\nclass player{\\r\\npublic:\\r\\n int type;\\r\\n int die_or_life;\\r\\n int how(){\\r\\n return die_or_life;\\r\\n }\\r\\n int is_light;//\u662F\u5426\u5DF2\u7ECF\u516C\u5E03 \\r\\n int killer;\\r\\n};\\r\\nplayer players[1000];\\r\\n\\r\\n/*\u8F6C\u6362\u767D\u5929\u6A21\u5F0F*/ \\r\\nvoid change_daytime(){\\r\\n during_time=daytime;\\r\\n day++;\\r\\n}\\r\\n\\r\\n/*\u8F6C\u6362\u9ED1\u591C\u6A21\u5F0F*/\\r\\nvoid change_night(){\\r\\n during_time=night;\\r\\n}\\r\\nint nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0;\\r\\nint idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1};\\r\\n\\r\\n/*b\u662F\u5426\u5728Arr\u4E2D*/\\r\\nbool is_include(int arr[],int b,int l){\\r\\n for(int i=0;i<l;i++){\\r\\n if(arr[i]==b)\\r\\n return true;\\r\\n }\\r\\n return false;\\r\\n}\\r\\n\\r\\n/*\u521D\u59CB\u5316\u4EBA\u6570*/\\r\\nvoid init_players(){\\r\\n my_number=rand()%player_number;\\r\\n if(player_number==12) nlangren=4;\\r\\n else if(player_number>=10) nlangren=3;\\r\\n else nlangren=2;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n players[i].die_or_life=life;\\r\\n players[i].is_light=0;\\r\\n players[i].type=-1;\\r\\n players[i].killer=2147483647;\\r\\n }\\r\\n for(int i=0;i<nlangren;i++)\\r\\n {\\r\\n int p=rand()%player_number;\\r\\n if(!is_include(idxlangren,p,4))\\r\\n idxlangren[i]=p,players[p].type=langren;\\r\\n else\\r\\n i--;\\r\\n Sleep(rand()%80+100);\\r\\n }\\r\\n if(player_number==12)\\r\\n {\\r\\n do{\\r\\n idxshouwei=rand()%player_number;\\r\\n }while(players[idxshouwei].type!=-1); \\r\\n players[idxshouwei].type=shouwei; \\r\\n }\\r\\n do{\\r\\n idxnvwu=rand()%player_number;\\r\\n }while(players[idxnvwu].type!=-1);\\r\\n players[idxnvwu].type=nvwu;\\r\\n if(player_number>=10)\\r\\n {\\r\\n do{\\r\\n idxlieren=rand()%player_number;\\r\\n }while(players[idxlieren].type!=-1);\\r\\n players[idxlieren].type=lieren; \\r\\n }\\r\\n do{\\r\\n idxyuyanjia=rand()%player_number;\\r\\n }while(players[idxyuyanjia].type!=-1);\\r\\n players[idxyuyanjia].type=yuyanjia;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(players[i].type==-1)\\r\\n players[i].type=cunmin,\\r\\n ncunmin++;\\r\\n if(players[my_number].type==langren)\\r\\n {\\r\\n for(int i=0;i<nlangren;i++)\\r\\n {\\r\\n players[idxlangren[i]].is_light=1;\\r\\n }\\r\\n }\\r\\n players[my_number].is_light=1;\\r\\n}\\r\\n\\r\\n/*\u5728\u5C4F\u5E55\u4E0A\u6253\u5370\u4E1C\u897F*/\\r\\nvoid print(){\\r\\n gotoxy(0,0);\\r\\n cout<<\\"\u4F5C\u8005\uFF1A\u6D1B\u8C37393864\\";\\r\\n gotoxy(90,0);\\r\\n if(during_time==night)\\r\\n color(red);\\r\\n else\\r\\n color(blue);\\r\\n printf(\\"\u7B2C%d\u5929 | \\",day);\\r\\n if(during_time==night) cout<<\\"\u9ED1\u591C\\";\\r\\n else cout<<\\"\u767D\u5929\\";\\r\\n\\r\\n gotoxy(0,3);\\r\\n color(blue);\\r\\n cout<<\\" \u6211\u7684\u53F7\u4F4D:\\"<<my_number+1;\\r\\n for(int i=0;i<player_number;i++){\\r\\n gotoxy(i*8+1,4);\\r\\n if(i==idx_police) color(yellow);\\r\\n else color(blue);\\r\\n cout<<i+1<<\\"\u53F7\u4F4D\\"; \\r\\n gotoxy(i*8+1,5);\\r\\n if(players[i].how()==die){\\r\\n color(red);\\r\\n cout<<\\"\u6B7B \u4EA1\\";\\r\\n }else{\\r\\n color(green);\\r\\n cout<<\\"\u5B58 \u6D3B\\";\\r\\n }\\r\\n gotoxy(i*8+1,6);\\r\\n color(blue);\\r\\n if(players[i].is_light){\\r\\n if(players[i].is_light==1){\\r\\n switch(players[i].type){\\r\\n case nvwu: cout<<\\"\u5973 \u5DEB\\";break;\\r\\n case yuyanjia: cout<<\\"\\\\b\u9884\u8A00\u5BB6\\";break;\\r\\n case cunmin: cout<<\\"\u6751 \u6C11\\";break;\\r\\n case langren:cout<<\\"\u72FC \u4EBA\\"; break;\\r\\n case lieren:cout<<\\"\u730E \u4EBA\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88 \u536B\\"; break;\\r\\n } \\r\\n }else{\\r\\n cout<<\\"\u597D\u4EBA\\";\\r\\n }\\r\\n\\r\\n }else{\\r\\n cout<<\\"\u672A\u77E5\\";\\r\\n }\\r\\n }\\r\\n\\r\\n} \\r\\n\\r\\n/*\u5224\u65AD\u662F\u5426\u7ED3\u675F,\u6CA1\u7ED3\u675F\u8FD4\u56DE0 \u597D\u4EBA\u80DC\u5229\u8FD4\u56DE1 \u72FC\u4EBA\u80DC\u5229\u8FD4\u56DE2 \u5E73\u5C40\u8FD4\u56DE3*/\\r\\nint is_end(){\\r\\n int die_bad=0;\\r\\n int die_people=0;\\r\\n int die_god=0;\\r\\n for(int i=0;i<player_number;i++){\\r\\n if((players[i].type == nvwu || players[i].type == yuyanjia || players[i].type == shouwei)&&players[i].die_or_life==die)\\r\\n die_god++;\\r\\n else if(players[i].type == langren && players[i].die_or_life==die)\\r\\n die_bad++;\\r\\n else if(players[i].type == cunmin && players[i].die_or_life==die)\\r\\n die_people++;\\r\\n }\\r\\n if((die_bad==die_people || die_bad==die_god)&&(die_bad>=nlangren))\\r\\n return 3;\\r\\n if(die_bad>=nlangren)\\r\\n return 1;\\r\\n if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2))\\r\\n return 2;\\r\\n return 0;\\r\\n}\\r\\n\\r\\n/*\u6E38\u620F\u5F00\u59CB\u524D\u7684\u9A9A\u64CD\u4F5C*/\\r\\nvoid before_game(){\\r\\n srand(time(NULL));\\r\\n init_Show_Window();\\r\\n color(green);\\r\\n cout<<\\"\u6B22\u8FCE\u6765\u5230\u72FC\u4EBA\u6740\u6E38\u620F\\\\t\\\\t\\\\t\u4E3A\u4E86\u66F4\u597D\u7684\u6E38\u620F\u4F53\u9A8C,\u8BF7\u53F3\u952E\u70B9\u51FB\u4E0A\u65B9\u2191\u2191,\u70B9\u51FB\\\\\\"\u5C5E\u6027\\\\\\",\u70B9\u51FB\\\\\\"\u5B57\u4F53\\\\\\"\u680F\u76EE,\u5C06\u5B57\u4F53\u4FEE\u6539\u4E3A\u5B8B\u4F53\u6216\u65B0\u5B8B\u4F53,\u5C06\u5B57\u53F7\u6539\u4E3A20\\\\n\u4F5C\u8005\uFF1A\u6D1B\u8C37393864\\\\n\u8BF7\u52FF\u79C1\u81EA\u8F6C\u8F7D,\u8FDD\u8005\u4F9D\u6CD5\u8FFD\u7A76\u6CD5\u5F8B\u8D23\u4EFB \u6CE8\uFF1A10 11 12\u4EBA\u5C40\u5F00\u8BBE\u730E\u4EBA 12\u4EBA\u5C40\u5F00\u8BBE\u5B88\u536B\u8B66\u957F\\\\n______________________\\\\n\\";\\r\\n cout<<\\"\u8BF7\u8F93\u5165\u73A9\u5BB6\u4EBA\u6570(8-12\u4EBA):\\";\\r\\n cin>>player_number;\\r\\n while(player_number<8||player_number>12)\\r\\n { cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\"; cin>>player_number; }\\r\\n system(\\"cls\\");\\r\\n cout<<\\"\u521D\u59CB\u5316\u8EAB\u4EFD\u4E2D\uFF0C\u8BF7\u7A0D\u7B49.\\";\\r\\n for(int i=0;i<6;i++){\\r\\n for(int j=0;j<12;j++){\\r\\n cout<<\\".\\";\\r\\n Sleep(50);\\r\\n } \\r\\n 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\\";\\r\\n }\\r\\n system(\\"cls\\");\\r\\n\\r\\n init_players();\\r\\n cout<<\\"\u6211\u7684\u53F7\u4F4D:\\"<<my_number+1<<endl\\r\\n <<\\"\u6211\u7684\u8EAB\u4EFD:\\";\\r\\n switch(players[my_number].type){\\r\\n case nvwu: cout<<\\"\u5973\u5DEB\\\\n\\";break;\\r\\n case yuyanjia: cout<<\\"\u9884\u8A00\u5BB6\\\\n\\";break;\\r\\n case cunmin: cout<<\\"\u6751\u6C11\\\\n\\";break;\\r\\n case langren:cout<<\\"\u72FC\u4EBA\\\\n\\";break; \\r\\n case lieren:cout<<\\"\u730E\u4EBA\\\\n\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88\u536B\\\\n\\";break;\\r\\n }\\r\\n change_daytime();\\r\\n system(\\"pause\\");\\r\\n system(\\"cls\\");\\r\\n cout<<\\"\u6E38\u620F\u52A0\u8F7D\u4E2D.\\";int ppppp=rand()%3+2;\\r\\n for(int i=0;i<ppppp;i++){\\r\\n for(int j=0;j<6;j++){\\r\\n cout<<\\".\\";\\r\\n Sleep(rand()%100+150);\\r\\n } \\r\\n cout<<\\"\\\\b\\\\b\\\\b\\\\b\\\\b\\\\b \\\\b\\\\b\\\\b\\\\b\\\\b\\\\b\\";\\r\\n } \\r\\n print();\\r\\n} \\r\\n\\r\\n/*\u6BCF\u4E00\u5929\u5F00\u59CB\u524D\u7684\u64CD\u4F5C*/\\r\\nvoid something_before_everyday(){\\r\\n change_night();\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1;\\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\";\\r\\n gotoxy(0,8);\\r\\n color(white);\\r\\n cout<<\\"\u5929\u9ED1~\u8BF7\u95ED\u773C~~~\\\\n\\";\\r\\n}\\r\\n\\r\\n/*\u5B88\u536B\u64CD\u4F5C*/\\r\\nint shouweishou=0;\\r\\nint ShouWei(){\\r\\n color(blue);\\r\\n cout<<\\"\u5B88\u536B~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u8981\u5B88\u62A4\u7684\u662F?\\\\n\\";\\r\\n if(players[my_number].type==shouwei&&players[my_number].die_or_life == life){\\r\\n cin>>shouweishou;\\r\\n while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>shouweishou;\\r\\n }\\r\\n cout<<\\"\u4F60\u4ECA\u665A\u8981\u5B88\u62A4\u7684\u662F\\"<<shouweishou<<\\"\u53F7\\\\n\\";\\r\\n Sleep(1500); \\r\\n shouweishou--;\\r\\n }else{\\r\\n if(players[idxshouwei].die_or_life == life){\\r\\n shouweishou=rand()%10;\\r\\n while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){\\r\\n shouweishou=rand()%10;\\r\\n }\\r\\n }\\r\\n } \\r\\n Sleep(2000);\\r\\n cout<<\\"\u5B88\u536B\u8BF7\u95ED\u773C\\"<<endl<<endl;\\r\\n return shouweishou;\\r\\n} \\r\\n\\r\\n/*\u72FC\u4EBA\u64CD\u4F5C*/\\r\\nint LangRen(){\\r\\n int langrensha=-1;\\r\\n color(red);\\r\\n cout<<\\"\u72FC\u4EBA~\u8BF7\u7741\u773C~~~\\\\n\\";\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u4EEC\u4ECA\u665A\u8981\u6740~\u8C01~~??\\\\n\\";\\r\\n if(players[my_number].type==langren&&players[my_number].die_or_life == life){\\r\\n cin>>langrensha;\\r\\n while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165!\\\\n\\";\\r\\n cin>>langrensha;\\r\\n }\\r\\n cout<<\\"\u4F60\u4EEC\u4ECA\u665A\u8981\u6740\u7684\u662F\\"<<langrensha--<<\\"\u53F7\\\\n\\";\\r\\n Sleep(3500);\\r\\n }else{\\r\\n while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){\\r\\n langrensha=rand()%player_number;\\r\\n }\\r\\n Sleep(3000);\\r\\n }\\r\\n cout<<\\"\u72FC\u4EBA\u8BF7~\u95ED\u773C~~\\\\n\\\\n\\";\\r\\n return langrensha;\\r\\n}\\r\\n\\r\\n/*\u5973\u5DEB\u64CD\u4F5C*/\\r\\nint nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0;\\r\\nint NvWu(int langrensha){\\r\\n color(purple);\\r\\n cout<<\\"\u5973\u5DEB~~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(2000);\\r\\n if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){\\r\\n if(is_nvwujiu) \\r\\n cout<<\\"\u4F60\u5DF2\u7ECF\u7528\u8FC7\u89E3\u836F\\\\n\\",Sleep(1500);\\r\\n else\\r\\n {\\r\\n cout<<\\"\u4ECA\u665A\\"<<langrensha+1<<\\"\u53F7\u6B7B\u4E86,\u4F60\u60F3\u7528\u89E3\u836F\u5417\uFF1F(1\u60F3 / 2\u4E0D\u60F3)\\\\n\\";\\r\\n int is_nvwujie=0;\\r\\n cin>>is_nvwujie;\\r\\n while(is_nvwujie!=1&&is_nvwujie!=2){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>is_nvwujie;\\r\\n } \\r\\n if(is_nvwujie==1) {\\r\\n Sleep(1000);\\r\\n cout<<\\"\u5DF2\u7ECF\u89E3\u6551\\"<<langrensha+1<<\\"\u53F7\\\\n\\";\\r\\n nvwujiu=langrensha;\\r\\n }\\r\\n is_nvwujiu=1;\\r\\n }\\r\\n Sleep(1500);\\r\\n if(::is_nvwudu) cout<<\\"\u4F60\u5DF2\u7ECF\u7528\u8FC7\u89E3\u836F\\\\n\\",Sleep(1500);\\r\\n else\\r\\n {\\r\\n cout<<\\"\u4F60\u60F3\u7528\u6BD2\u836F\u5417\uFF1F\uFF081\u60F3 / 2\u4E0D\u60F3\uFF09\\\\n\\";\\r\\n Sleep(1500);\\r\\n int is_nvwudu=0;\\r\\n cin>>is_nvwudu;\\r\\n while(is_nvwudu!=1&&is_nvwudu!=2){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>is_nvwudu;\\r\\n } \\r\\n if(is_nvwudu==1){\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u60F3\u6BD2\u8C01\uFF1F\\\\n\\"; \\r\\n cin>>nvwudu;\\r\\n while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>nvwudu; \\r\\n }\\r\\n nvwudu--;\\r\\n Sleep(1500);\\r\\n cout<<\\"\u5DF2\u7ECF\u6BD2\u6B7B\u4E86\\"<<nvwudu+1<<\\"\u53F7\\\\n\\";\\r\\n }\\r\\n ::is_nvwudu=1;\\r\\n } \\r\\n }else{\\r\\n if(players[idxnvwu].die_or_life == life){\\r\\n if(!is_nvwujiu)\\r\\n {\\r\\n int is_jiu=rand()%8;\\r\\n if(is_jiu==0){\\r\\n nvwujiu=langrensha;\\r\\n is_nvwujiu=1;\\r\\n } \\r\\n }\\r\\n if(!is_nvwudu)\\r\\n {\\r\\n int is_du=rand()%4;\\r\\n if(is_du==0){\\r\\n int num=rand()%player_number;\\r\\n nvwudu=num;\\r\\n is_nvwudu=1;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n } \\r\\n cout<<\\"\u5973\u5DEB~\u8BF7\u95ED\u773C~~\\\\n\\\\n\\";\\r\\n return nvwujiu*10000+nvwudu;//\u4F20\u56DE\u4E24\u4E2A\u53D8\u91CF\uFF0C\u201C\u52A0\u5BC6\u201D\u64CD\u4F5C \\r\\n}\\r\\n\\r\\nint yuyanjiabixutoupiao=-1;\\r\\n/*\u9884\u8A00\u5BB6\u64CD\u4F5C*/\\r\\nvoid YuYanJia(){\\r\\n color(green);\\r\\n cout<<\\"\u9884\u8A00\u5BB6~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(2000);\\r\\n if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){\\r\\n cout<<\\"\u8BF7\u95EE\u4F60\u60F3\u67E5\u9A8C\u8C01\u7684\u8EAB\u4EFD\\\\n\\";\\r\\n int p;\\r\\n cin>>p;\\r\\n while(!(p>=1&&p<=player_number)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>p;\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<p<<\\"\u53F7\u7684\u8EAB\u4EFD\u662F\u2014\u2014\\";\\r\\n Sleep(1000);\\r\\n if(players[p-1].type == langren){\\r\\n cout<<\\"\u72FC\u4EBA\\\\n\\";\\r\\n players[p-1].is_light = 1;\\r\\n }else{\\r\\n cout<<\\"\u597D\u4EBA\\\\n\\";\\r\\n players[p-1].is_light = 2;\\r\\n }\\r\\n }else{\\r\\n int p=-1;\\r\\n while(p==-1||players[p].die_or_life==die||p==idxlieren)\\r\\n p=rand()%player_number;\\r\\n if(players[p].type==langren)//\u9501\u5B9A\u76EE\u6807! \\r\\n {\\r\\n yuyanjiabixutoupiao=p;\\r\\n }\\r\\n }\\r\\n cout<<\\"\u9884\u8A00\u5BB6~~\u8BF7\u95ED\u773C~~\\\\n\\";\\r\\n}\\r\\n\\r\\n/*\u9ED1\u591C\u64CD\u4F5C*/\\r\\nint LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; \\r\\nvoid Night(){ \\r\\n LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; \\r\\n\\r\\n //\u5982\u679C\u670912\u4EBA\u5C40\uFF0C\u6DFB\u52A0\u5B88\u536B \\r\\n if(player_number==12){\\r\\n SHOUWEISHOU=ShouWei();\\r\\n Sleep(2000);\\r\\n } \\r\\n /*\u72FC\u4EBA\u90E8\u5206*/\\r\\n LANGRENSHA=LangRen();\\r\\n Sleep(3500);\\r\\n /*\u5973\u5DEB\u90E8\u5206*/ \\r\\n int nvwu=NvWu(LANGRENSHA);\\r\\n NVWUDU=nvwu%10+nvwu/10%10;\\r\\n NVWUJIU=nvwu/10000%10+nvwu/100000%10;\\r\\n Sleep(3000);\\r\\n /*\u9884\u8A00\u5BB6\u90E8\u5206*/\\r\\n YuYanJia();\\r\\n Sleep(2000);\\r\\n}\\r\\n\\r\\n/*\u730E\u4EBA\u64CD\u4F5C*/\\r\\nvoid Lieren(){\\r\\n int lierendai=-1;\\r\\n cout<<idxlieren+1<<\\"\u53F7\u662F\u730E\u4EBA\\\\n\\";\\r\\n\\r\\n players[idxlieren].is_light = 1;\\r\\n Sleep(1000);\\r\\n if(idxlieren==my_number){\\r\\n cout<<\\"\u4F60\u60F3\u5E26\u8D70\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n cin>>lierendai;\\r\\n while(lierendai<1||lierendai>player_number||players[lierendai].die_or_life==die){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>lierendai;\\r\\n }\\r\\n lierendai--;\\r\\n }else{\\r\\n lierendai=rand()%player_number;\\r\\n while(players[lierendai].die_or_life == die){\\r\\n lierendai=rand()%player_number;\\r\\n }\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<\\"\u730E\u4EBA\u9009\u62E9\u5E26\u8D70\\"<<lierendai+1<<\\"\u53F7\\\\n\\";\\r\\n Sleep(2000);\\r\\n players[lierendai].die_or_life = die;\\r\\n}\\r\\n\\r\\nvoid police_die();\\r\\n/*\u5224\u65AD\u8C01\u6B7B\u4E86*/\\r\\nvoid panduansiwang(){\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n Sleep(3000);\\r\\n color(white);\\r\\n cout<<\\"\u5929\u4EAE\u4E86\\\\n\\";\\r\\n Sleep(2000);\\r\\n gotoxy(0,9);\\r\\n cout<<\\"\u6628\u665A\\";\\r\\n bool is_die[15]={false},is_die_lieren=false,flag=false;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(players[i].die_or_life==life)\\r\\n {\\r\\n if(i==LANGRENSHA||i==NVWUDU) {\\r\\n if(players[i].type==lieren) is_die_lieren=true;\\r\\n players[i].killer= (i==LANGRENSHA ? langren:nvwu);\\r\\n players[i].die_or_life=die;\\r\\n is_die[i]=true;\\r\\n }\\r\\n if(i==SHOUWEISHOU||i==NVWUJIU) {\\r\\n if(players[i].type==lieren) is_die_lieren=false;\\r\\n players[i].killer=-1;\\r\\n players[i].die_or_life=life;\\r\\n is_die[i]=false;\\r\\n } \\r\\n }\\r\\n }\\r\\n bool is_police_die=false;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_die[i])\\r\\n {\\r\\n if(flag) cout<<\\"\u548C\\"<<i+1<<\\"\u53F7\\";\\r\\n else cout<<i+1<<\\"\u53F7\\",flag=true;\\r\\n if(i==idx_police) \\r\\n is_police_die=true;\\r\\n }\\r\\n }\\r\\n if(flag) cout<<\\"\u6B7B\u4E86\\\\n\\";\\r\\n else cout<<\\"\u662F\u5E73\u5B89\u591C\\\\n\\";\\r\\n\\r\\n if(is_die_lieren) Lieren();\\r\\n if(is_police_die) police_die();\\r\\n}\\r\\n\\r\\n/*\u9009\u8B66\u957F*/\\r\\nvoid choose_police(){\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n color(blue);\\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n color(yellow);\\r\\n cout<<\\"\u4E0B\u9762\u5F00\u59CB\u9009\u4E3E\u8B66\u957F\uFF0C\u5404\u4F4D\u4E0D\u80FD\u9009\u4E3E\u81EA\u5DF1~\\\\n\\";\\r\\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};\\r\\n memset(cannot,-1,sizeof(cannot));\\r\\n CHOOSE:\\r\\n color(yellow);\\r\\n Sleep(1500);\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(players[i].die_or_life==life&&!is_include(cannot,i,player_number))\\r\\n {\\r\\n if(i==my_number)\\r\\n {\\r\\n cout<<\\"\u4F60\u8981\u9009\u4E3E\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n int n;\\r\\n cin>>n;\\r\\n while(n<1||n>player_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number))\\r\\n {\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165!\\\\n\\";\\r\\n cin>>n;\\r\\n }\\r\\n cout<<i+1<<\\"\u53F7\u9009\u4E3E\\"<<n--<<\\"\u53F7\\\\n\\";\\r\\n tong[n]++;\\r\\n }\\r\\n else\\r\\n {\\r\\n int n=rand()%player_number;\\r\\n while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number))\\r\\n n=rand()%player_number;\\r\\n cout<<i+1<<\\"\u53F7\u9009\u4E3E\\"<<n+1<<\\"\u53F7\\\\n\\";\\r\\n tong[n]++;\\r\\n }\\r\\n Sleep(1500);\\r\\n }\\r\\n }\\r\\n int idx_max=-1,maxn=-1,len=0;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(maxn<tong[i])\\r\\n {\\r\\n maxn=tong[i];\\r\\n idx_max=i;\\r\\n }\\r\\n int maxn_arr[15]={0};\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(tong[i]==maxn)\\r\\n {\\r\\n maxn_arr[len++]=i;\\r\\n }\\r\\n }\\r\\n color(blue);\\r\\n if(len>1)\\r\\n {\\r\\n for(int i=0;i<len;i++)\\r\\n {\\r\\n if(i==len-1)\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7\u5E73\u7968\\\\n\\"; \\r\\n }\\r\\n else\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7,\\";\\r\\n }\\r\\n }\\r\\n for(int i=0;i<len;i++)\\r\\n cannot[i]=maxn_arr[i];\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_include(cannot,i,len))\\r\\n must[i]=i;\\r\\n else\\r\\n must[i]=-1;\\r\\n }\\r\\n color(white);\\r\\n goto CHOOSE;\\r\\n }\\r\\n cout<<\\"\u606D\u559C\\"<<idx_max+1<<\\"\u53F7\u5F53\u9009\u8B66\u957F\\\\n\\";\\r\\n Sleep(3000);\\r\\n idx_police=idx_max;\\r\\n return;\\r\\n}\\r\\n\\r\\n/*\u6295\u7968*/\\r\\nint toupiao(){\\r\\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}; \\r\\n memset(cannot,-1,sizeof(cannot));\\r\\n gotoxy(0,7);\\r\\n color(blue);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n color(white);\\r\\n cout<<\\"\u4E0B\u9762\u8FDB\u5165\u6295\u7968\u73AF\u8282\\\\n\\";\\r\\n memset(tong,0,sizeof(tong));\\r\\n Sleep(2000);\\r\\n TOUPIAO:\\r\\n for(int i=0;i<player_number;i++){\\r\\n if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){\\r\\n if(i==my_number){\\r\\n color(white);\\r\\n cout<<\\"\u4F60\u8981\u6295\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n int n;\\r\\n cin>>n;\\r\\n while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>n;\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<setw(2)<<my_number+1<<\\"\u53F7\u6295\u4E86\\"<<setw(2)<<n<<\\"\u53F7\\";\\r\\n if(my_number==n-1) color(red),cout<<\\"\u5FEB\u6765\u770B\uFF01\u8FD9\u6709\u4E2A\u75AF\u5B50\u6295\u81EA\u5DF1\uFF01\\"; \\r\\n if(i==idx_police) color(yellow),cout<<\\"(\u8B66\u957F)\\\\n\\"; else cout<<\\"\\\\n\\";\\r\\n if(i==idx_police) tong[n-1]++;\\r\\n tong[n-1]++;\\r\\n }else{\\r\\n color(white);\\r\\n int t=-1;\\r\\n while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){\\r\\n if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1)\\r\\n {\\r\\n t=yuyanjiabixutoupiao;\\r\\n yuyanjiabixutoupiao=-1;\\r\\n continue;\\r\\n }\\r\\n t=rand()%player_number;\\r\\n if(is_include(idxlangren,i,nlangren))\\r\\n {\\r\\n if(players[t].type == langren)\\r\\n t=-1;\\r\\n }\\r\\n }\\r\\n cout<<setw(2)<<i+1<<\\"\u53F7\\"<<\\"\u6295\u4E86\\"<<setw(2)<<t+1<<\\"\u53F7\\";\\r\\n if(i==idx_police) cout<<\\"(\u8B66\u957F2\u7968)\\\\n\\"; else cout<<\\"\\\\n\\";\\r\\n if(i==idx_police) tong[t]++;\\r\\n tong[t]++; \\r\\n }\\r\\n\\r\\n Sleep(rand()%1000+1000);\\r\\n }\\r\\n }\\r\\n int idx_max=-1,maxn=-1,len=0;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(maxn<tong[i])\\r\\n {\\r\\n maxn=tong[i];\\r\\n idx_max=i;\\r\\n }\\r\\n int maxn_arr[15]={0};\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(tong[i]==maxn)\\r\\n {\\r\\n maxn_arr[len++]=i;\\r\\n }\\r\\n }\\r\\n color(blue);\\r\\n if(len>1)\\r\\n {\\r\\n for(int i=0;i<len;i++)\\r\\n {\\r\\n if(i==len-1)\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7\u5E73\u7968\\\\n\\"; \\r\\n }\\r\\n else\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7,\\";\\r\\n }\\r\\n }\\r\\n for(int i=0;i<len;i++)\\r\\n cannot[i]=maxn_arr[i];\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_include(cannot,i,len))\\r\\n must[i]=i;\\r\\n else\\r\\n must[i]=-1;\\r\\n }\\r\\n color(white);\\r\\n goto TOUPIAO;\\r\\n\\r\\n }\\r\\n\\r\\n cout<<idx_max+1<<\\"\u53F7\\"<<\\"\u51FA\u5C40\\\\n\\";\\r\\n Sleep(4000);\\r\\n players[idx_max].die_or_life = die;\\r\\n players[idx_max].killer = good;\\r\\n return idx_max;\\r\\n}\\r\\n\\r\\n/*\u8B66\u957F\u6B7B\u4EA1*/\\r\\nvoid police_die(){\\r\\n color(yellow);\\r\\n int type;\\r\\n if(idx_police==my_number)\\r\\n {\\r\\n Sleep(1550);\\r\\n cout<<\\"\u4F60\u662F\u60F3\u6495\u6BC1\u8B66\u5FBD\u8FD8\u662F\u79FB\u4EA4\u8B66\u5FBD\uFF1F\uFF08\u6495\u6BC1\u8F93\u51651\uFF0C\u79FB\u4EA4\u8F93\u51652)\\";\\r\\n\\r\\n cin>>type;\\r\\n while(!(type==1||type==2))\\r\\n {\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>type;\\r\\n }\\r\\n }\\r\\n else{\\r\\n type=rand()%3+1;\\r\\n }\\r\\n if(type==1)\\r\\n {\\r\\n cout<<\\"\u8B66\u957F\u9009\u62E9\u6495\u6BC1\u8B66\u5FBD\\\\n\\";\\r\\n Sleep(1000);\\r\\n idx_police=-1;\\r\\n }\\r\\n else\\r\\n {\\r\\n int lucky=-1;\\r\\n while(lucky==-1||players[lucky].die_or_life==die)\\r\\n lucky=rand()%player_number;\\r\\n cout<<\\"\u8B66\u957F\u9009\u62E9\u628A\u8B66\u5FBD\u79FB\u4EA4\u7ED9\\"<<lucky+1<<\\"\u53F7\\\\n\\";\\r\\n Sleep(1500);\\r\\n idx_police=lucky; \\r\\n }\\r\\n}\\r\\n\\r\\n/*\u6545\u4E8B\u7684\u6700\u540E*/\\r\\nvoid the_end(){\\r\\n system(\\"cls\\");\\r\\n switch(is_end()){\\r\\n case 1:cout<<\\"\u597D\u4EBA\u80DC\u5229\\\\n\\\\n\\"; break;\\r\\n case 2:cout<<\\"\u72FC\u4EBA\u80DC\u5229\\\\n\\\\n\\"; break;\\r\\n case 3:cout<<\\"\u672C\u5C40\u5E73\u5C40\\\\n\\\\n\\"; break;\\r\\n }\\r\\n for(int i=0;i<player_number;i++){\\r\\n cout<<i+1<<\\"\u53F7\u4F4D:\\\\t\\";\\r\\n switch(players[i].type){\\r\\n case nvwu: cout<<\\"\u5973\u5DEB\\\\t\\";break;\\r\\n case yuyanjia: cout<<\\"\u9884\u8A00\u5BB6\\\\t\\";break;\\r\\n case cunmin: cout<<\\"\u6751\u6C11\\\\t\\";break;\\r\\n case langren:cout<<\\"\u72FC\u4EBA\\\\t\\";break;\\r\\n case lieren:cout<<\\"\u730E\u4EBA\\\\t\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88\u536B\\\\t\\";break; \\r\\n } \\r\\n cout<<\\"\u6700\u7EC8\\";\\r\\n switch(players[i].killer){\\r\\n case nvwu:cout<<\\"\u88AB\u5973\u5DEB\u6BD2\u6B7B\\\\n\\"; break;\\r\\n case langren:cout<<\\"\u88AB\u72FC\u4EBA\u6740\u6B7B\\\\n\\"; break;\\r\\n case good:cout<<\\"\u88AB\u6295\u7968\u51FA\u5C40\\\\n\\"; break;\\r\\n case lieren:cout<<\\"\u88AB\u730E\u4EBA\u5E26\u8D70\\\\n\\";break;\\r\\n default :cout<<\\"\u5B58\u6D3B\\\\n\\";\\r\\n }\\r\\n cout<<endl;\\r\\n }\\r\\n}\\r\\n\\r\\n/*\u4E3B\u51FD\u6570*/\\r\\nint main(){\\r\\n\\r\\n int wheel=0; \\r\\n before_game();\\r\\n while(!is_end()){\\r\\n //\u9ED1\u591C\u51C6\u5907 \\r\\n something_before_everyday();\\r\\n Sleep(1500); \\r\\n\\r\\n //\u9ED1\u591C\u90E8\u5206 \\r\\n Night(); //\u8FDB\u5165\u9ED1\u591C\uFF01 \\r\\n change_daytime(); //\u6362\u5929 \\r\\n\\r\\n //\u5929\u4EAE\u4E86 \\r\\n panduansiwang();//\u5224\u65AD\u8C01\u6B7B\u4E86 \\r\\n Sleep(2000);\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n if(is_end()) break;\\r\\n\\r\\n //\u9009\u8B66\u957F \\r\\n if(!wheel&&player_number==12)\\r\\n {\\r\\n choose_police();\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n }\\r\\n\\r\\n //\u6295\u7968\u73AF\u8282 \\r\\n int idx_max=toupiao();//\u7968\u6570\u6700\u591A\u7684\u4EBA \\r\\n int lierendai=-1;\\r\\n if(idx_max==idx_police){\\r\\n police_die();\\r\\n }\\r\\n if(players[idx_max].type==lieren){//\u542F\u52A8\u730E\u4EBA\u7A0B\u5E8F \\r\\n Lieren();\\r\\n if(is_end()) break;\\r\\n }\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n wheel++;\\r\\n }\\r\\n\\r\\n the_end();\\r\\n system(\\"pause\\");\\r\\n return 0;\\r\\n}\\r\\n```\\r\\n\\r\\n\u5B9C\u8003NOIP , \u5C0F\u5FC3\u522B\u7206\u96F6.] \u9A97\u5206\u8FC7\u6837\u4F8B\uFF0C\u66B4\u529B\u51FA\u5947\u8FF9\u3002\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\\r\\n\\r\\n\u897F\u6C5F\u6708\xB7\u591C\u884COI\u9053\u4E2D \u660E\u6708AC\u60CA\u9E4A\uFF0C\\r\\n\\r\\nRE\u534A\u591C\u9E23\u8749\u3002\\r\\n\\r\\n\u7A3B\u82B1\u9999\u91CC\u8BF4\u4E30\u5E74\uFF0C\\r\\n\\r\\n\u542C\u53D6WA\u58F0\u4E00\u7247\u3002\\r\\n\\r\\n\u4E03\u516B\u4E2ATLE\uFF0C\\r\\n\\r\\n\u4E24\u4E09\u70B9MLE\u3002\\r\\n\\r\\n\u65E7\u65F6\u8305\u5E97\u793E\u6797\u8FB9\uFF0C\\r\\n\\r\\n\u8DEF\u8F6CCE\u5FFD\u89C1\u3002\\r\\n\\r\\n\u751F\u547D\u7684\u610F\u4E49?\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\u6D1B\u8C37\u65B0\u624B\u6751\u5916\uFF0C\u4E00\u4E2AOIer\u5F00\u8BBE\u7684\u673A\u623F\u91CC\uFF0C\u7A0B\u5E8F\u5458kkk\u7AEF\u5750\u5728\u684C\u540E\u3002\u4ED6\u5934\u4E5F\u4E0D\u62AC\uFF0C\u51B7\u51B7\u5730\u95EE\uFF1A\u201C\u4F60\u53EB\u4EC0\u4E48\u540D\u5B57\uFF1F\u201D\\r\\n\\r\\n\u201CQAQ\\\\_\\\\_\\"\\r\\n\\r\\n\u201C\u5E74\u9F84\uFF1F\u201D\\r\\n\\r\\n\u201C\\\\*\\\\*\u5C81\u3002\u201D\\r\\n\\r\\n\u201C\u4EC0\u4E48\u9519\u8BEF\uFF1F\u201D\\r\\n\\r\\n\u201CTLE\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7AD9\u8D77\u8EAB\u719F\u7EC3\u5730\u6253\u5F00\u75C5\u4EBA\u7684\u4EE3\u7801\u3002\u4ED6\u6123\u4F4F\u4E86\uFF0C\u84DD\u8272\u7684\u773C\u775B\u91CC\u95EA\u51FA\u60CA\u7591\u7684\u795E\u60C5\u3002\u4ED6\u91CD\u65B0\u5BA1\u89C6\u7740\u773C\u524D\u8FD9\u4E2A\u4EBA\uFF0C\u51B7\u51B7\u5730\u95EE\uFF1A\u201C\u4F60\u7684\u6D1B\u8C37\u540D\u662F\u4EC0\u4E48\u989C\u8272\u7684\uFF1F\u201D\\r\\n\\r\\n\u201C\u68D5\u8272\u3002\u201D\\r\\n\\r\\n\u201C\u4F60\u662F\u7EA2\u540D\uFF01\u201Dkkk\u7A0B\u5E8F\u5458\u4E00\u9488\u89C1\u8840\u5730\u8BF4\uFF0C\u201C\u6211\u5F53\u8FC7\u7BA1\u7406\u5458 \uFF08\u5176\u5B9E\u73B0\u5728\u4E5F\u662F\uFF09\uFF0C\u8FD9\u4E48\u591A\u7684\u4EE3\u7801\uFF0C\u53EA\u6709\u7EA2\u540D\u5927\u4F6C\u624D\u5199\u7684\u51FA\u6765\uFF01\u201D\\r\\n\\r\\n\u75C5\u4EBA\u5FAE\u5FAE\u4E00\u7B11\uFF0C\u8BF4\uFF1A\u201Ckkk\u7A0B\u5E8F\u5458\uFF0C\u4F60\u8BF4\u6211\u662F\u7EA2\u540D\uFF0C\u6211\u5C31\u662F\u7EA2\u540D\u5427\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7684\u76EE\u5149\u67D4\u548C\u4E86\uFF0C\u4ED6\u5429\u5490\u540C\u4E8B\uFF1A\u201C\u51C6\u5907\u6539BUG\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u6B63\u5728\u6362\u5DE5\u4F5C\u670D\uFF0C\u540C\u4E8B\u8DD1\u6765\uFF0C\u4F4E\u58F0\u544A\u8BC9\u4ED6\u75C5\u4EBA\u62D2\u7EDD\u4F7F\u7528O2\u4F18\u5316\u3002kkk\u7A0B\u5E8F\u5458\u7684\u7709\u6BDB\u626C\u4E86\u8D77\u6765\uFF0C\u4ED6\u8D70\u8FDB\u673A\u623F\uFF0C\u751F\u6C14\u5730\u8BF4\uFF1A\u201C\u5E74\u8F7B\u4EBA\uFF0C\u5728\u8FD9\u513F\u8981\u542C\u7A0B\u5E8F\u5458\u7684\u6307\u6325\uFF01\u201D\\r\\n\\r\\n\u75C5\u4EBA\u5E73\u9759\u5730\u56DE\u7B54\uFF1A\u201Ckkk\u7A0B\u5E8F\u5458\uFF0CO2\u4F18\u5316\u79BB\u5934\u6587\u4EF6\u592A\u8FD1\uFF0C\u6211\u62C5\u5FC3\u65BD\u884CO2\u4F18\u5316\u4F1A\u5F71\u54CD\u5934\u6587\u4EF6\u3002\u800C\u6211\uFF0C\u4ECA\u540E\u9700\u8981\u4E00\u4E2A\u975E\u5E38\u597D\u7528\u7684\u5934\u6587\u4EF6\uFF01\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u518D\u4E00\u6B21\u6123\u4F4F\u4E86\uFF0C\u7ADF\u6709\u70B9\u53E3\u5403\u5730\u8BF4\uFF1A\u201C\u4F60\uFF0C\u4F60\u80FD\u5FCD\u53D7\u5417\uFF1F\u4F60\u7684\u7A0B\u5E8F\u9700\u8981\u52A0\u4E0A\u65E0\u6570\u4E2A\u526A\u679D\uFF0C\u628A\u539F\u5148\u7684\u4EE3\u7801\u548C\u4F60\u6539\u7684\u4EE3\u7801\u5168\u90E8\u5220\u6389\uFF01\u201D\\r\\n\\r\\n\u201C\u8BD5\u8BD5\u770B\u5427\u3002\u201D\\r\\n\\r\\n\u7535\u8111\u524D\uFF0C\u4E00\u5411\u4ECE\u5BB9\u9547\u5B9A\u7684kkk\u7A0B\u5E8F\u5458\uFF0C\u8FD9\u6B21\u53CC\u624B\u5374\u6709\u4E9B\u98A4\u6296\uFF0C\u4ED6\u989D\u4E0A\u6C57\u73E0\u6EDA\u6EDA\uFF0C\u540C\u4E8B\u5E2E\u4ED6\u64E6\u4E86\u4E00\u6B21\u53C8\u4E00\u6B21\u3002\u6700\u540E\u4ED6\u5FCD\u4E0D\u4F4F\u5F00\u53E3\u5BF9\u75C5\u4EBA\u8BF4\uFF1A\u201C\u4F60\u633A\u4E0D\u4F4F\u53EF\u4EE5\u54FC\u53EB\u3002\u201D\\r\\n\\r\\n\u75C5\u4EBA\u4E00\u58F0\u4E0D\u542D\uFF0C\u53CC\u624B\u7D27\u7D27\u6293\u4F4F\u8EAB\u4E0B\u7684\u767D\u5E8A\u5355\uFF0C\u624B\u80CC\u9752\u7B4B\u66B4\u8D77\uFF0C\u6C57\u5982\u96E8\u4E0B\u3002\u4ED6\u8D8A\u6765\u8D8A\u4F7F\u52B2\uFF0C\u5D2D\u65B0\u7684\u767D\u5E8A\u5355\u5C45\u7136\u88AB\u6293\u7834\u4E86\u3002\uFF08\u6CE8\uFF1A\u539F\u56E0\u662F\u56E0\u4E3A\u4E0D\u613F\u610F\u770B\u5230\u81EA\u5DF1\u7684\u4EE3\u7801\u88AB\u6539\uFF09\\r\\n\\r\\n\u8131\u53BB\u5DE5\u4F5C\u670D\u7684kkk\u7A0B\u5E8F\u5458\u64E6\u7740\u6C57\u8D70\u8FC7\u6765\uFF0C\u7531\u8877\u5730\u8BF4\uFF1A\u201C\u5E74\u8F7B\u4EBA\uFF0C\u6211\u771F\u62C5\u5FC3\u4F60\u4F1AWA\u8FC7\u53BB\u3002\u201D\\r\\n\\r\\n\u75C5\u4EBA\u8138\u8272\u82CD\u767D\u3002\u4ED6\u52C9\u5F3A\u4E00\u7B11\uFF0C\u8BF4\uFF1A\u201C\u6211\u4E00\u76F4\u5728\u6570\u4F60\u7684\u6539\u7684\u884C\u6570\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u5413\u4E86\u4E00\u8DF3\uFF0C\u4E0D\u76F8\u4FE1\u5730\u95EE\uFF1A\u201C\u6211\u6539\u4E86\u591A\u5C11\u884C\uFF1F\u201D\\r\\n\\r\\n\u201C2^6\u884C\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u60CA\u5446\u4E86\uFF0C\u5927\u58F0\u56B7\u9053\uFF1A\u201C\u4F60\u662F\u4E00\u4E2A\u771F\u6B63\u7684OIer\uFF0C\u4E00\u4E2A\u4F1A\u5199\u4EE3\u7801\u7684\u795E\u7287\uFF01\u4F60\u582A\u79F0\u7BA1\u7406\u5458\uFF01\u201D\\r\\n\\r\\n\u201C\u4F60\u8FC7\u5956\u4E86\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7684\u8138\u4E0A\u6D6E\u51FA\u6148\u7965\u7684\u795E\u60C5\u3002\u4ED6\u60F3\u8BF4\u4EC0\u4E48\u53C8\u5FCD\u4F4F\u4E86\uFF0C\u6325\u624B\u8BA9\u540C\u4E8B\u51FA\u53BB\uFF0C\u7136\u540E\u5173\u4E0A\u673A\u623F\u7684\u95E8\uFF0C\u6CE8\u89C6\u7740\u75C5\u4EBA\uFF0C\u8BF4\uFF1A\u201C\u544A\u8BC9\u6211\uFF0C\u4F60\u7684\u771F\u540D\u53EB\u4EC0\u4E48\uFF1F\u201D\\r\\n\\r\\n\u201Cchen\\\\_zhe\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u8083\u7136\u8D77\u656C\uFF1A\u201C\u554A\uFF0CAK IOI\u7684\u795E\u7287\uFF0C\u4E45\u4EF0\u4E45\u4EF0\uFF0C\u8BA4\u8BC6\u4F60\u5F88\u8363\u5E78\u3002\u201Dchen\\\\_zhe\u53CB\u597D\u5730\u628A\u624B\u4F38\u4E86\u8FC7\u53BB\u3002\\r\\n\\r\\n\u627E\u5230\u4E00\u9996 \u201C\u597D\u201D \u8BD7\uFF0C\u7ED9\u5927\u5BB6\u5206\u4EAB\u4E00\u4E0B\uFF1A\\r\\n\\r\\n\u542C\u8BF4\u6D25\u6D25\u4E3A\u8BFE\u7A0B\u70E6\u607C \u91D1\u660E\u4E00\u5BB6\u4F4F\u8FDB\u4E86\u65B0\u623F\\r\\n\\r\\n\u542C\u8BF4\u4E01\u4E01\u73A9\u6570\u5B57\u6E38\u620F \u706B\u67F4\u68D2\u80FD\u642D\u51FA\u65B0\u5929\u5730\\r\\n\\r\\n\u542C\u8BF4\u6821\u95E8\u5916\u6B63\u5728\u780D\u6811 \u5927\u5BB6\u4E00\u8D77\u505A\u9776\u5F62\u6570\u72EC\\r\\n\\r\\n\u542C\u8BF4\u65C5\u884C\u8005\u5728\u8D5A\u5DEE\u4EF7 \u6F5C\u4F0F\u8005\u6B63\u5728\u7834\u8BD1\u7740\u5BC6\u7801\\r\\n\\r\\n\u53EA\u6709\u65E0\u5C3D\u7684\u4EE3\u7801\u77E5\u9053 \u6D25\u6D25\u6446\u8131\u4E86\u5B66\u4E60\u7684\u70E6\u607C\\r\\n\\r\\n\u91D1\u660E\u5F00\u5FC3\u5730\u8D70\u8FDB\u5546\u5E97 \u6311\u9009\u7740\u4E66\u684C\u548C\u7535\u8111\\r\\n\\r\\n\u603B\u6709\u4E00\u79CD\u7B97\u6CD5\u80FD\u591F\u8BA9\u4F60\u6210\u529F\u62FF\u5230\u5206\\r\\n\\r\\n\u65E0\u8BBA\u662F\u8D2A\u5FC3\u8FD8\u662F\u52A8\u89C4 \u6216\u8005\u5C06\u7B54\u6848\u4E8C\u5206\\r\\n\\r\\n\u601D\u5982\u6CC9\u6D8C\u6380\u8D77\u6CE2\u6D9B \u53C8\u6C47\u6210\u4E00\u4E2A\u65B0\u7684\u7B97\u6CD5\\r\\n\\r\\n\u8BA9\u6240\u6709TLE \u6240\u6709MLE \u6FC0\u52B1\u7740\u6211\u4EEC\u524D\u884C\u5199\u4EE3\u7801\\r\\n\\r\\n\u542C\u8BF4\u540C\u5B66\u4EEC\u5728\u73A9\u63A8\u7406 \u5C0FZ\u7684\u889C\u5B50\u603B\u914D\u4E0D\u9F50\\r\\n\\r\\n\u542C\u8BF4\u4E24\u4EBA\u5728\u6311\u9009\u5BA2\u6808 \u706B\u661F\u4E0A\u6709\u6761\u80FD\u91CF\u9879\u94FE\\r\\n\\r\\n\u542C\u8BF4\u9676\u9676\u5728\u91C7\u6458\u82F9\u679C \u4E00\u53EA\u9752\u86D9\u8981\u4ECE\u6CB3\u8FB9\u8FC7\\r\\n\\r\\n\u542C\u8BF4\u63A8\u9500\u5458\u8D70\u5165\u80E1\u540C \u6770\u745E\u722C\u8FDB\u4E86\u5976\u916A\u7684\u5C0F\u6D1E\\r\\n\\r\\n\u53EA\u6709\u65E0\u5C3D\u7684\u4EE3\u7801\u77E5\u9053 \u540C\u5B66\u4EEC\u7537\u5973\u914D\u5BF9\u7EC3\u8D77\u4E86\u821E\u8E48\\r\\n\\r\\n\u5C0FZ\u628A\u4ED6\u7684\u889C\u5B50\u627E\u5230 AK\u4E86\u65E0\u6570\u673A\u623F\\r\\n\\r\\n\u5C4F\u5E55\u5FAE\u5FAE\u53D1\u4EAE \u601D\u60F3\u5728\u865A\u6811\u8DEF\u5F84\u5F77\u5FA8\\r\\n\\r\\n\u5E73\u9762\u7684\u5411\u91CF\u4EA4\u9519\u751F\u957F \u7EC7\u6210\u5FE7\u4F24\u7684\u7F51\\r\\n\\r\\n\u526A\u679D\u526A\u53BB\u6211\u4EEC\u7684\u75AF\u72C2 SPFA\u544A\u8BC9\u6211\u524D\u9014\u5728\u4F55\u65B9\\r\\n\\r\\n01\u80CC\u5305\u88C5\u4E0B\u4E86\u5FE7\u4F24 \u7B11\u989C\u6D0B\u6EA2\u8138\u5E9E\\r\\n\\r\\n\u6DF1\u591C\u7535\u8111,\u5BCC\u4E3D\u5802\u7687,\u9898\u76EE W A ,\u4E0D\u514D\u5F77\u5FA8.\\r\\n\\r\\nD P \u80CC\u5305,\u8FF7\u8FF7\u832B\u832B,R P R P ,\u5168\u90E8\u7528\u5149.\\r\\n\\r\\n\u5C4F\u5E55\u5FAE\u4EAE,\u4EE3\u7801\u5343\u884C,\u7070\u540D\u84DD\u540D,\u6DE1\u6DE1\u5FE7\u4F24\u2026\u2026\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\u3002\\r\\n\\r\\n\uFF08#\\r\\n#DFBYP312. \u3010\u5165\u95E8\u3011\u5206\u8DF3\u7EF3#\uFF09\\r\\n\\r\\n# 0 **Compile Error**\\r\\n\\r\\n```\\r\\nfoo.cc: In function \'int main()\':\\r\\nfoo.cc:5:15: error: no match for \'operator>\' (operand types are \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} and \'int\')\\r\\n 5 | cin>>a>b;\\r\\n | ~~~~~~^~\\r\\n | | |\\r\\n | | int\\r\\n | std::basic_istream<char>::__istream_type {aka std::basic_istream<char>}\\r\\nfoo.cc:5:15: note: candidate: \'operator>(int, int)\' (built-in)\\r\\n 5 | cin>>a>b;\\r\\n | ~~~~~~^~\\r\\nfoo.cc:5:15: note: no known conversion for argument 1 from \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} to \'int\'\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/regex:66,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:110,\\r\\n from foo.cc:1:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: candidate: \'template<class _BiIter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const sub_match<_BiIter>&)\'\\r\\n 1150 | operator>(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: candidate: \'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)\'\\r\\n 1210 | operator>(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: candidate: \'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)\'\\r\\n 1303 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)\'\\r\\n 1377 | operator>(typename iterator_traits<_Bi_iter>::value_type const* __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__cxx11::sub_match<_BiIter>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)\'\\r\\n 1471 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)\'\\r\\n 1547 | operator>(typename iterator_traits<_Bi_iter>::value_type const& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: template argument \\r\\ndeduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__cxx11::sub_match<_BiIter>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)\'\\r\\n 1647 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:47,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/locale_classes.h:40,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/ios_base.h:41,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ios:42,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/istream:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/sstream:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/complex:45,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ccomplex:39,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:54:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: candidate: \'template<class _Iterator> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)\'\\r\\n 465 | operator>(const reverse_iterator<_Iterator>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::reverse_iterator<_Iterator>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: candidate: \'template<class _IteratorL, class _IteratorR> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)\'\\r\\n 510 | operator>(const reverse_iterator<_IteratorL>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::reverse_iterator<_Iterator>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: candidate: \'template<class _IteratorL, class _IteratorR> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)\'\\r\\n 1721 | operator>(const move_iterator<_IteratorL>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::move_iterator<_IteratorL>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: candidate: \'template<class _Iterator> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)\'\\r\\n 1780 | operator>(const move_iterator<_Iterator>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::move_iterator<_IteratorL>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_algobase.h:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:50:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: candidate: \'template<class _T1, class _T2> constexpr bool std::operator>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)\'\\r\\n 676 | operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::pair<_T1, _T2>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:53:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)\'\\r\\n 3737 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)\'\\r\\n 3750 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)\'\\r\\n 3762 | operator>(const _CharT* __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const _CharT*\' and \'std::basic_istream<char>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/deque:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:68:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const deque<_Tp, _Alloc>&, const deque<_Tp, _Alloc>&)\'\\r\\n 2345 | operator>(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::deque<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/functional:54,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:71:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: candidate: \'template<class ... _TElements, class ... _UElements> constexpr bool std::operator>(const tuple<_Elements ...>&, const tuple<_Types ...>&)\'\\r\\n 1557 | operator>(const tuple<_TElements...>& __t,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::tuple<_Elements ...>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/list:63,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:79:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const __cxx11::list<_Tp, _Alloc>&, const __cxx11::list<_Tp, _Alloc>&)\'\\r\\n 2196 | operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& 12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-std::__cxx11::list<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:81:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: candidate: \'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const map<_Key, _Tp, _Compare, _Alloc>&, const map<_Key, _Tp, _Compare, _Alloc>&)\'\\r\\n 1563 | operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::map<_Key, _Tp, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:62:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: candidate: \'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const multimap<_Key, _Tp, _Compare, _Alloc>&, const multimap<_Key, _Tp, _Compare, _Alloc>&)\'\\r\\n 1184 | operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::multimap<_Key, _Tp, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:75,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:82:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: candidate: \'template<class _Tp, class _Dp, class _Up, class _Ep> bool std::operator>(const unique_ptr<_Tp, _Dp>&, const unique_ptr<_Up, _Ep>&)\'\\r\\n 929 | operator>(const unique_ptr<_Tp, _Dp>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::unique_ptr<_Tp, _Dp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: candidate: \'template<class _Tp, class _Dp> bool std::operator>(const unique_ptr<_Tp, _Dp>&, nullptr_t)\'\\r\\n 937 | operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::unique_ptr<_Tp, _Dp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: candidate: \'template<class _Tp, class _Dp> bool std::operator>(nullptr_t, const unique_ptr<_Tp, _Dp>&)\'\\r\\n 947 | operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::unique_ptr<_Tp, _Dp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:53,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:76:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: candidate: \'template<class _Tp1, class _Tp2, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp1, _Lp>&, const __shared_ptr<_Tp2, _Lp>&)\'\\r\\n 1883 | operator>(const __shared_ptr<_Tp1, _Lp>& __a,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__shared_ptr<_Tp1, _Lp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: candidate: \'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp, _Lp>&, nullptr_t)\'\\r\\n 1889 | operator>(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__shared_ptr<_Tp, _Lp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: candidate: \'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>&)\'\\r\\n 1894 | operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__shared_ptr<_Tp, _Lp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: candidate: \'template<class _Tp, class _Up> bool std::operator>(const shared_ptr<_Tp>&, const shared_ptr<_Tp>&)\'\\r\\n 653 | operator>(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::shared_ptr<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: candidate: \'template<class _Tp> bool std::operator>(const shared_ptr<_Tp>&, nullptr_t)\'\\r\\n 659 | operator>(const shared_ptr<_Tp>& __a, nullptr_t) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::shared_ptr<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: candidate: \'template<class _Tp> bool std::operator>(nullptr_t, const shared_ptr<_Tp>&)\'\\r\\n 665 | operator>(nullptr_t, const shared_ptr<_Tp>& __a) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::shared_ptr<_Tp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/vector:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:86:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const vector<_Tp, _Alloc>&, const vector<_Tp, _Alloc>&)\'\\r\\n 2087 | operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::vector<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:64:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: candidate: \'template<class _Tp, class _Seq> bool std::operator>(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&)\'\\r\\n 413 | operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::queue<_Tp, _Seq>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:87:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: candidate: \'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const set<_Key, _Compare, _Alloc>&, const set<_Key, _Compare, _Alloc>&)\'\\r\\n 1037 | operator>(const set<_Key, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::set<_Key, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:62:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: candidate: \'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const multiset<_Key, _Compare, _Alloc>&, const multiset<_Key, _Compare, _Alloc>&)\'\\r\\n 1024 | operator>(const multiset<_Key,_Compare,_Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::multiset<_Key, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/stack:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:89:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: candidate: \'template<class _Tp, class _Seq> bool std::operator>(const stack<_Tp, _Seq>&, const stack<_Tp, _Seq>&)\'\\r\\n 389 | operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::stack<_Tp, _Seq>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:603,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:95:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::_Expr<_Dom1, typename _Dom1::value_type>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::_Expr<_Dom1, typename _Dom1::value_type>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const valarray<_Tp>&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::valarray<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::valarray<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::valarray<_Tp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:99:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: candidate: \'template<class _Tp, long unsigned int _Nm> bool std::operator>(const array<_Tp, _Nm>&, const array<_Tp, _Nm>&)\'\\r\\n 350 | operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::array<_Tp, _Nm>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/forward_list:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:104:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const forward_list<_Tp, _Alloc>&, const forward_list<_Tp, _Alloc>&)\'\\r\\n 1511 | operator>(const forward_list<_Tp, _Alloc>& __lx,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::forward_list<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:113:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:3: note: candidate: \'bool std::operator>(thread::id, thread::id)\'\\r\\n 85 | operator>(thread::id __x, thread::id __y) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:24: note: no known conversion for argument 1 from \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} to \'std::thread::id\'\\r\\n 85 | operator>(thread::id __x, thread::id __y) noexcept\\r\\n | ~~~~~~~~~~~^~~\\r\\n```\\r\\n\\r\\n# \u4EE3\u7801\\r\\n\\r\\n[ \u4E0B\u8F7D](https://oj.qdturing.cn/d/W0001/record/66792c8f00458a4cdc048c58?download=true)\\r\\n\\r\\n```cpp\\r\\n#include<bits/stdc++.h>\\r\\nusing namespace std;\\r\\nint main(){\\r\\n\\tint a,b,c;\\r\\n\\tcin>>a>b;\\r\\n\\tcout<<a/b<<\\" \\"<<a%b;\\r\\n\\treturn 0;\\r\\n}\\r\\n\u5C31\u8FD9\uFF1F\uFF1F\uFF1F\uFF1F\uFF1F\uFF1F\\r\\n```\\r\\n\\r\\n[\u6613\u8D77\u6E38 - \u641C\u7D22 (bing.com)](https://cn.bing.com/search?q=%E6%98%93%E8%B5%B7%E6%B8%B8&gs_lcrp=EgZjaHJvbWUqBwgAEEUYwgMyBwgAEEUYwgMyBwgBEEUYwgMyBwgCEEUYwgMyBwgDEEUYwgMyBwgEEEUYwgMyBwgFEEUYwgMyBwgGEEUYwgMyBwgHEEUYwgPSAQsxNzAzOTYzajBqNKgCCLACAQ&FORM=ANAB01&PC=EDGEDBB) \u3010cn.bing.com\u3011\u6613\u8D77\u6E38 \uD83D\uDC4D \uD83D\uDC4E \uD83D\uDE80\uFE0F\\r\\n\\r\\n```none\\r\\n\\"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\\":\\"\u4E8E\u8001\u5E08\u7684python\u57DF\\",\\"bulletin\\":\\"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED\\",\\"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\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"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\\\\\\":\\\\\\"\u4E8E\u8001\u5E08\u7684python\u57DF\\\\\\",\\\\\\"bulletin\\\\\\":\\\\\\"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED\\\\\\",\\\\\\"roles\\\\\\":{\\\\\\"stu\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\\\\\\",\\\\\\"guest\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529\\\\\\",\\\\\\"default\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\\\\\\"},\\\\\\"avatar\\\\\\":\\\\\\"qq:28015861\\\\\\",\\\\\\"langs\\\\\\":\\\\\\"\\\\\\",\\\\\\"share\\\\\\":\\\\\\"\\\\\\"}],\\\\\\"tfa\\\\\\":false,\\\\\\"authn\\\\\\":false,\\\\\\"group\\\\\\":[\\\\\\"\u5468\u65E5\u4E0B\u53481\u70B915\u73ED\\\\\\",\\\\\\"1015\\\\\\"],\\\\\\"viewLang\\\\\\":\\\\\\"zh\\\\\\",\\\\\\"skipAnimate\\\\\\":true,\\\\\\"timeZone\\\\\\":\\\\\\"Asia/Shanghai\\\\\\",\\\\\\"codeLang\\\\\\":\\\\\\"py.py2\\\\\\",\\\\\\"codeTemplate\\\\\\":\\\\\\"\\\\\\",\\\\\\"avatar\\\\\\":\\\\\\"gravatar:duVZICerlJNJ@hydro.local\\\\\\",\\\\\\"qq\\\\\\":\\\\\\"\\\\\\",\\\\\\"gender\\\\\\":\\\\\\"2\\\\\\",\\\\\\"bio\\\\\\":\\\\\\"\uD83D\uDC4D \uD83D\uDC4E \uD83D\uDE80\uFE0F \\\\\\\\r\\\\\\\\n\\\\\\",\\\\\\"school\\\\\\":\\\\\\"\u9752\u5C9B\u7ACB\u65B0\u5C0F\u5B66\\\\\\",\\\\\\"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\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"coin\\\\\\":37200,\\\\\\"displayName\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"nAccept\\\\\\":124,\\\\\\"nSubmit\\\\\\":137,\\\\\\"rp\\\\\\":0,\\\\\\"rpInfo\\\\\\":{},\\\\\\"level\\\\\\":0,\\\\\\"avatarUrl\\\\\\":\\\\\\"//sdn.geekzu.org/avatar/4779837f999db1fa2002860d3a781a04?d=mm&s=128\\\\\\"}\\"}\\r\\n\u4F1A\u51FA\u73B0\u56DE\u6536\u5DE5\u5382\u4E2A \uFF0C\u770B\u2018\u2019vlx \u2018\u2019\u3010\u3011\u6F02\u4EAE\u3010\u3011\\r\\n\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n\u666E\u901A\u8F93\u5165 n=int(input()) \u5207\u7247\u8F93\u5165 \u2014\u2014\uFF0C\u2014\u2014=map(int,input().split()) \u5217\u8868\u8F93\u5165 a(list(map(int,input().split())) \u8FDE\u7EED\u8F93\u5165 for i in range(0x3f3f3f3f): a=int(input()) \u603B\u4F1A\u6709\u5730\u4E0A\u7684\u751F\u7075\uFF0C\u6562\u4E8E\u76F4\u9762\u96F7\u9706\u7684\u5A01 \u5149 \u9996\u53D1\u4E8E[\u9ED1\u5BA2\u5DE5\u5177](https://www.zhihu.com/column/c_1318154529670574080)\\r\\n\\r\\n\u5207\u6362\u6A21\u5F0F\\r\\n\\r\\n\u5199\u6587\u7AE0\\r\\n\\r\\n\u767B\u5F55/\u6CE8\u518C\\r\\n\\r\\n\\r\\n\\r\\n# \u8FD93\u4E2A\u9ED1\u79D1\u6280\u7F51\u7AD9\uFF0C\u8BA9\u4F60\u79D2\u53D8\u201D\u9ED1\u5BA2\u201C\\r\\n\\r\\n[](https://www.zhihu.com/people/an-wang-hei-ke)\\r\\n\\r\\n[\u5C0F\u9053hack](https://www.zhihu.com/people/an-wang-hei-ke)\\r\\n\\r\\n> \u6765\u6E90\uFF1A\u7801\u519C\u5B66\u4E60\u8054\u76DF\\r\\n\\r\\n\u60F3\u8981\u4E86\u89E3\u5168\u7403\u88AB\u9ED1\u5BA2\u653B\u51FB\u7684\u60C5\u51B5\u5417\uFF1F\\r\\n\\r\\n\u60F3\u4F53\u9A8C\u4E0B\u7535\u5F71\u4E0A\u9ED1\u5BA2\u4F7F\u7528\u7684\u9A9A\u64CD\u4F5C\u5417\uFF1F\\r\\n\\r\\n\u53C8\u6216\u8005\u4E00\u952E\u751F\u6210\u9AD8\u903C\u683C\u80CC\u666F\uFF1F\\r\\n\\r\\n\u5C0F\u7F16\u521A\u5F00\u59CB\u770B\u5230\u7684\u65F6\u5019\u5C31\u89C9\u5F97\u5F88\u795E\u5947\uFF0C\u8FD8\u6709\u8FD9\u79CD\u795E\u5947\u7684\u7F51\u7AD9\uFF1F\\r\\n\\r\\n\u4E00\u8D77\u6765\u63A2\u7D22\u4E0B\u5427\uFF01\\r\\n\\r\\n\\r\\n\\r\\n**\u4E00.geektyper\uFF08\u6A21\u62DF\u9ED1\u5BA2\uFF09**\\r\\n\\r\\n\u8FD9\u662F\u4E00\u6B3E\u529F\u80FD\u5F3A\u5927\u7684\u9ED1\u5BA2\u6A21\u62DF\u8F6F\u4EF6\uFF0C\u5B83\u53EF\u4EE5\u6A21\u62DF\u7535\u5F71\u4E0A\u90A3\u79CD\u9ED1\u5BA2\u64CD\u4F5C\u7535\u8111\u7684\u8FC7\u7A0B\uFF0C\u5305\u62EC\u6572\u4EE3\u7801\u4EE5\u53CA\u51FA\u73B0\u5404\u79CD\u9AD8\u5927\u4E0A\u7684\u5F39\u7A97\uFF0C\u5E76\u4E14\u53EF\u4EE5\u81EA\u5B9A\u4E49\u4EE3\u7801\u989C\u8272\u3001\u80CC\u666F\u4EE5\u53CALogo\u56FE\u6848\\r\\n\\r\\n\u4E0D\u77E5\u9053\u4F60\u4EEC\u770B\u7535\u5F71\u7684\u65F6\u5019\uFF0C\u770B\u5230\u90A3\u79CD\u9ED1\u5BA2\u64CD\u4F5C\u7CFB\u7EDF\uFF0C\u6572\u51FB\u952E\u76D8\u65F6\u7535\u8111\u4E0A\u98DE\u901F\u65CB\u8F6C\u4E00\u4E9B\u6570\u636E\uFF0C\u611F\u89C9\u662F\u4E0D\u662F\u5E05\u7206\u4E86\uFF0C\u6709\u4E00\u79CD\u8BA9\u4F60\u4E5F\u60F3\u6210\u4E3A\u4E00\u540D\u9ED1\u5BA2\u7684\u611F\u89C9\uFF0C\\r\\n\\r\\n\u8FD9\u4E2A\u8F6F\u4EF6\u5C31\u53EF\u4EE5\u6EE1\u8DB3\u4F60\uFF0C\u5341\u8DB3\u7684\u201C\u64A9\u59B9\u795E\u5668\u201D\u597D\u5417\uFF01\\r\\n\\r\\n\\r\\n\\r\\n**1\u3001\u5148\u6253\u5F00\u5B89\u88C5\u597D\u7684geektyper**\\r\\n\\r\\n\u5728\u4E3B\u754C\u9762\u4E0A\u6211\u4EEC\u53EF\u4EE5\u770B\u5230\u5DE6\u4E0A\u65B9\u7684\u64CD\u4F5C\u63D0\u793A\u548C\u53F3\u4FA7\u7684\u529F\u80FD\u6309\u94AE\u3002\\r\\n\\r\\n\u521A\u5F00\u59CB\u4F7F\u7528\u5927\u5BB6\u53EF\u80FD\u6709\u70B9\u61F5\u5708\uFF0C\u6211\u4EEC\u53EF\u4EE5\u6309\u7167\u63D0\u793A\u70B9\u51FB\u201CF2\u201D\uFF0C\\r\\n\\r\\n\u5C31\u53EF\u4EE5\u5F39\u51FA\u5E2E\u52A9\u754C\u9762\uFF0C\u663E\u793A\u6BCF\u4E2A\u952E\u7684\u4F5C\u7528\uFF0C\u5C31\u53EF\u4EE5\u5F00\u59CB\u64CD\u4F5C\u5566\u3002\\r\\n\\r\\n\\r\\n\\r\\n**2\u3001\u53F3\u4E0B\u89D2\u6709\u4E00\u4E2A\u201C\u2630\u201D\u6309\u94AE\uFF0C\u70B9\u51FB\u5B83\u4F1A\u8FDB\u5165\u8BBE\u7F6E\u754C\u9762**\\r\\n\\r\\n\u4F60\u53EF\u4EE5\u5728\u91CC\u9762\u5BF9\u754C\u9762\u6587\u5B57\u7684\u8272\u5F69\u548C\u683C\u5F0F\u8FDB\u884C\u4FEE\u6539\u3002\\r\\n\\r\\n\\r\\n\\r\\n**3\u3001\u6700\u540E\u5C31\u662F\u5B83\u6700\u70AB\u9177\u7684\u529F\u80FD\u4E86**\\r\\n\\r\\n\u70B9\u51FB\u53F3\u4E0A\u89D2\u7684DL Data\u5C31\u4F1A\u51FA\u73B0\u7C7B\u4F3C\u4E8E\u7535\u5F71\u91CC\u90A3\u79CD\u6B63\u5728\u4E0B\u8F7D\u7684\u754C\u9762\uFF0C\\r\\n\\r\\n\u5176\u4ED6\u4E5F\u662F\u70B9\u51FB\u4E4B\u540E\u51FA\u73B0\u5404\u79CD\u6570\u636E\u5C55\u73B0\uFF0C\u800C\u4E14\u4F60\u8FD8\u53EF\u4EE5\u6572\u4EE3\u7801\uFF0C\\r\\n\\r\\n\u8FD9\u65F6\u5019\u4F60\u5C31\u50CF\u662F\u4E00\u4E2A\u9ED1\u5BA2\u5728\u64CD\u4F5C\u5404\u79CD\u7CFB\u7EDF\uFF0C\u8D85\u70AB\u9177\u597D\u5417\uFF01\\r\\n\\r\\n\\r\\n\\r\\n## **2.CYBERMAP**\\r\\n\\r\\n\u7F51\u5740\uFF1A\\r\\n\\r\\n[https://\\\\*\\\\*cybermap.kaspersky.com/\\\\*\\\\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat)\\r\\n\\r\\n\u8FD9\u4E2A\u7F51\u7AD9\u662F\u4E00\u4E2A\u53EF\u4EE5\u201C\u5B9E\u65F6\u5C55\u793A\u5168\u7403\u6076\u610F\u653B\u51FB\u201D\u7684\u7F51\u7AD9\uFF0C\\r\\n\\r\\n\u4F60\u53EF\u4EE5\u5F88\u76F4\u89C2\u7684\u770B\u5230\u5168\u7403\u9ED1\u5BA2\u7684\u5B9E\u65F6\u653B\u51FB\u6D3B\u52A8\u60C5\u51B5\uFF0C\\r\\n\\r\\n\u8FD9\u4E2A\u7F51\u7AD9\u771F\u7684\u505A\u7684\u5F88\u70AB\u9177\uFF0C\u8BA9\u4F60\u770B\u4E00\u773C\u5C31\u7231\u4E0A\u4ED6\\r\\n\\r\\n\u56E0\u4E3A\u662F\u56FD\u5916\u7684\u7F51\u7AD9\uFF0C\u6240\u4EE5\u5927\u5BB6\u53BB\u641C\u7D22\u7684\u65F6\u5019\u53EF\u4EE5\u4F7F\u7528Google\u6D4F\u89C8\u5668\uFF0C\u56FD\u5185\u7684\u6D4F\u89C8\u5668\u53EF\u80FD\u641C\u4E0D\u5230\uFF0C\u5C0F\u7F16\u7528\u7684\u662FGoogle\uFF0C\u4E0A\u4E2A\u52A8\u56FE\u5927\u5BB6\u611F\u53D7\u4E0B\u5B83\u7684\u70AB\u9177\u3002\\r\\n\\r\\n\\r\\n\\r\\n**1\u3001\u6570\u636E\u6765\u6E90**\\r\\n\\r\\n\u60F3\u8981\u4E86\u89E3\u4ED6\u8FD9\u4E9B\u6570\u636E\u6536\u96C6\u8FD9\u4E48\u6765\u7684\uFF0C\u53EF\u4EE5\u770B\u5230\u754C\u9762\u4E0A\u6709\u4E00\u4E2A\u6570\u636E\u6765\u6E90\uFF0C\u90FD\u6709\u5F88\u6E05\u695A\u7684\u6570\u636E\u5206\u6790\u3002\\r\\n\\r\\n\\r\\n\\r\\n**2\u3001\u9009\u62E9\u56FD\u5BB6**\\r\\n\\r\\n\u8FD9\u662F\u4E00\u4E2A\u201C\u5B9E\u65F6\u5C55\u793A\u5168\u7403\u6076\u610F\u653B\u51FB\u201D\u7684\u7F51\u7AD9\uFF0C\u6240\u4EE5\u4F60\u53EF\u4EE5\u9009\u62E9\u4F60\u60F3\u8981\u770B\u7684\u56FD\u5BB6\u76EE\u524D\u6240\u53D7\u7684\u653B\u51FB\u3002\\r\\n\\r\\n\\r\\n\\r\\n## **\u4E09.Stars-Emmision**\\r\\n\\r\\n\u7F51\u5740\uFF1A\\r\\n\\r\\n[https://**wangyasai.github.io/Sta**rs-Emmision/](https://link.zhihu.com/?target=https%3A//wangyasai.github.io/Stars-Emmision/)\\r\\n\\r\\n\u4E00\u6B3E\u6BD4\u540D\u5B57\u66F4\u52A0\u6D6E\u5938\u7684\u751F\u6210\u5668\uFF0C\u53EF\u4EE5\u4E00\u952E\u751F\u6210\u5C0F\u7C73\u6D77\u62A5\u8FD9\u79CD\u80CC\u666F\u6548\u679C\uFF0C\u5927\u5927\u8282\u7701\u8BBE\u8BA1\u65F6\u95F4\u554A\uFF0C\\r\\n\\r\\n\u5B83\u4E0E\u661F\u661F\u6709\u5173\uFF0C\u662F\u4E00\u6B3E\u653E\u5C04\u56FE\u7247\u751F\u6210\u7F51\u7AD9\uFF0C\u72B9\u5982\u65E0\u6570\u7684\u6D41\u661F\u96E8\u6B63\u5411\u4F60\u6251\u9762\u800C\u6765\uFF0C\u5728\u7EBF\u5236\u4F5C\u7C92\u5B50\u6563\u5C04\uFF0C\u6548\u679C\u6781\u4E3A\u9707\u64BC\u554A\uFF01\\r\\n\\r\\n\u4E00\u822C\u8FD9\u79CD\u6548\u679C\u662F\u5728AI\u91CC\u9762\u5236\u4F5C\u51FA\u6765\u7684\uFF0C\u5728\u8FD9\u91CC\u76F4\u63A5\u751F\u6210\uFF0C\u60CA\u4E0D\u60CA\u559C\uFF0C\u610F\u4E0D\u610F\u5916\uFF1F\\r\\n\\r\\n\\r\\n\\r\\n1\u3001\u8FDB\u5165\u7F51\u7AD9\u754C\u9762\u53F3\u4E0A\u89D2\u662F\u53EF\u4EE5\u8C03\u8282\u53C2\u6570\u7684\uFF0C\u867D\u7136\u90FD\u662F\u82F1\u6587\uFF0C\u4F46\u662F\u90FD\u662F\u6BD4\u8F83\u7B80\u5355\u7684\uFF0C\u5C0F\u7F16\u90FD\u80FD\u770B\u61C2\uFF0C\u4F60\u4EEC\u80AF\u5B9A\u90FDOK\u554A\\r\\n\\r\\n\\r\\n\\r\\n\u6709\u4E00\u4E2AColor1\u548CColor2\uFF0C\u8FD9\u4E24\u4E2A\u662F\u53EF\u4EE5\u66F4\u6362\u6210\u81EA\u5DF1\u559C\u6B22\u7684\u989C\u8272\u7684\u3002\\r\\n\\r\\n\\r\\n\\r\\n2\u3001\u5728\u201CDirection\u201D\u91CC\u9762\u662F\u53EF\u4EE5\u8C03\u8282\u7C92\u5B50\u7684\u8303\u56F4\u7684\uFF0C\u770B\u4F60\u6BD4\u8F83\u559C\u6B22\u90A3\u79CD\u53EF\u4EE5\u81EA\u7531\u66F4\u6362\u3002\\r\\n\\r\\n\\r\\n\\r\\n\u6700\u540E\u8C03\u6574\u5B8C\u6210\uFF0C\u53EF\u4EE5\u4E0B\u8F7D\u4FDD\u5B58\u4E0B\u6765\uFF0C\u6BD4\u5982\u53EF\u4EE5\u653E\u8FDBPPT\u91CC\u4E5F\u662F\u4E00\u4E2A\u4E0D\u9519\u7684\u9009\u62E9\uFF0C\u53C8\u6216\u8005\u53EF\u4EE5\u7528GIF\u5F55\u5236\u5DE5\u5177\uFF0C\u628A\u5B83\u5F55\u5236\u6210\u4E00\u4E2A\u52A8\u6001\u80CC\u666F\uFF0C\u4E5F\u662F\u7F8E\u8F6E\u7F8E\u5942\u554A\u3002\\r\\n\\r\\n\u4ECA\u5929\u8DDF\u5927\u5BB6\u5206\u4EAB\u7684\u8DDF\u4EE5\u5F80\u4E0D\u4E00\u6837\uFF0C\u53EF\u80FD\u6211\u4EEC\u4E0D\u9700\u8981\u7ECF\u5E38\u7528\u5230\uFF0C\u4F46\u662F\u88C5\u88C5\u903C\u4E5F\u662F\u5F88\u597D\u7684\u554A\uFF0C\u903C\u683C\u6EE1\u6EE1\u597D\u5417\uFF0C\u5C0F\u7F16\u521A\u5F00\u59CB\u770B\u5230\u662F\u65F6\u5019\u5C31\u89C9\u5F97\u5F88\u795E\u5947\u554A\uFF0C\u77AC\u95F4\u5FC3\u52A8\uFF0C\u5C31\u5206\u4EAB\u7ED9\u4F60\u4EEC\u5566 \\r\\n\\r\\n[\u5728\u7EBF\u9ED1\u5BA2\u6A21\u62DF\u653B\u51FB\u6F14\u793A (tonghei.com)](https://hackcode.tonghei.com/hacker/)\\r\\n\\r\\n \\r\\n\\r\\nfor i in range(True): m=str(input(\\"\u59D3\u540D\uFF1A\\")) n=int(input(\\"\u4F60\u7684\u5E74\u4EFD\uFF1A\\")) y=int(input(\\"\u4F60\u7684\u6708\u4EFD\uFF1A\\")) r=int(input(\\"\u4F60\u7684\u65E5\u671F\uFF1A\\")) x=str(input(\\"\u4F60\u7684\u661F\u5EA7\uFF1A\\")) print(n,\\"\u5E74\\",end=\\" \\") print(y,\\"\u6708\\",end=\\" \\") print(r,\\"\u65E5\\") print(x) d=str(input(\\"\u4F60\u7684\u7231\u597D\uFF1A\\")) if d==\\"\u7BEE\u7403\\" or d==\\"\u8DB3\u7403\\" or d==\\"\u7FBD\u6BDB\u7403\\": print(\\"\u9633\u5149\u5F00\u6717\u5927\u7537\u5B69\\") elif d==\\"\u7F16\u7A0B\\": print(\\"\u9ED1\u5BA2\\") elif d==\\"\u67AA\\": print(\\"\u72D9\u51FB\u4E4B\u738B\\") else: print(\\"\u5176\u4ED6\\") w=int(input(\\"\u4F60\u5E73\u65F6\u7684\u81EA\u6211\u6253\u5206\uFF1A\\")) if w<60: print(\\"\u5DEE\\") elif w>=60 and w<70: print(\\"\u8FD8\u53EF\u4EE5\\") elif w>=70 and w<80: print(\\"\u826F\\") if w>=80 and w<=100: print(\\"\u4F18\u79C0\\") aw=str(input(\\"\u4F60\u7684\u5B66\u6821\uFF1A\\")) aq=int(input(\\"\u671F\u4E2D\u6210\u7EE9\uFF1A\\")) am=int(input(\\"\u671F\u672B\u6210\u7EE9\uFF1A\\")) if am == 0 and aq == 0: print(\\"\u4F60\u5728\\",aw,\\"\u65E0\\",\\"\u65E0\\") if am!=0 and aq==0: print(\\"\u4F60\u5728\\",aw,am,\\"\u65E0\\") if am==0 and aq!=0: print(\\"\u4F60\u5728\\",aw,\\"\u65E0\\",aq) print(\\"\u4F60\u6240\u6709\u7684\u4E1C\u897F\u5DF2\u7ECF\u5168\u90E8\u6D4B\u8BD5\u5B8C\uFF01\\") print(\\"\uFF01\uFF01\uFF01\u52A0\u6CB9\uFF01\uFF01\uFF01\\")\\r\\n\\r\\n\u6D1B\u8C37\\r\\n\\r\\n/\\\\*\u8BC4\u6D4B\u72B6\u6001 Waiting \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u6B63\u5728\u7B49\u5F85\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6 Fetched \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u5DF2\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\uFF0C\u6B63\u5728\u51C6\u5907\u5F00\u59CB\u8BC4\u6D4B Compiling \u8BC4\u6D4B\uFF1A\u6B63\u5728\u7F16\u8BD1\u4E2D Judging \u8BC4\u6D4B\uFF1A\u7F16\u8BD1\u6210\u529F\uFF0C\u6B63\u5728\u8BC4\u6D4B\u4E2D Accepted \u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u5B8C\u5168\u6B63\u786E Wrong Answer \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u4E0E\u6807\u51C6\u7B54\u6848\u4E0D\u4E00\u81F4\uFF08\u4E0D\u5305\u62EC\u884C\u672B\u7A7A\u683C\u4EE5\u53CA\u6587\u4EF6\u672B\u7A7A\u884C\uFF09 Time Limit Exceeded \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236 Memory Limit Exceeded \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u5185\u5B58\u7A7A\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236 Runtime Error \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u9519\u8BEF\uFF08\u5982\u6570\u7EC4\u8D8A\u754C\u3001\u88AB\u96F6\u9664\u3001\u8FD0\u7B97\u6EA2\u51FA\u3001\u6808\u6EA2\u51FA\u3001\u65E0\u6548\u6307\u9488\u7B49\uFF09 Compile Error \u4E0D\u901A\u8FC7\uFF1A\u7F16\u8BD1\u5931\u8D25 System Error \u9519\u8BEF\uFF1A\u7CFB\u7EDF\u9519\u8BEF\uFF08\u5982\u679C\u60A8\u9047\u5230\u6B64\u95EE\u9898\uFF0C\u8BF7\u53CA\u65F6\u5728\u8BA8\u8BBA\u533A\u8FDB\u884C\u53CD\u9988\uFF09 Canceled \u5176\u4ED6\uFF1A\u8BC4\u6D4B\u88AB\u53D6\u6D88 Unknown Error \u5176\u4ED6\uFF1A\u672A\u77E5\u9519\u8BEF Ignored \u5176\u4ED6\uFF1A\u88AB\u5FFD\u7565 \u6709\u201C\u6210\u7EE9\u53D6\u6D88\u201D\u5B57\u6837\u5219\u8BF4\u660E\u7BA1\u7406\u5458\u624B\u52A8\u6807\u8BB0\u6B64\u8BB0\u5F55\u4E3A\u53D6\u6D88\uFF0C\u53EF\u80FD\u8FDD\u53CD\u4E86\u670D\u52A1\u6761\u6B3E\uFF0C\u6BD4\u5982\u4EE3\u7801\u88AB\u53D1\u73B0\u4E0E\u5176\u4ED6\u7528\u6237\u7684\u4EE3\u7801\u5341\u5206\u76F8\u4F3C\u3002\\r\\n\\r\\nsqrt(n); i\\\\*i<=n;\\r\\n\\r\\n\u7F16\u8BD1\u9519\u8BEF \u53EF\u80FD\u6709\u4EE5\u4E0B\u60C5\u51B5\uFF1A\\r\\n\\r\\n1. \u9012\u4EA4\u65F6\u9009\u9519\u4E86\u7F16\u7A0B\u8BED\u8A00\\r\\n2. Java \u7684\u4E3B\u7C7B\u540D\u6CA1\u6709\u4F7F\u7528 \\"Main\\"\\r\\n3. \u5BF9\u4E8E C/C++\uFF1A\u89C1\u4E0B\\r\\n4. \u4E00\u822C\u6027\u7684\u7F16\u8BD1\u9519\u8BEF \u5BF9 C/C++ \u9009\u624B\u7684\u7279\u522B\u63D0\u9192\uFF1A\\r\\n5. \\\\_\\\\_int64 \u5728 GNU C++ \u4E2D\u5E94\u5199\u6210 long long \u7C7B\u578B\\r\\n6. main() \u8FD4\u56DE\u503C\u5FC5\u987B\u5B9A\u4E49\u4E3A int \uFF0C\u800C\u4E0D\u662F void\\r\\n7. for \u8BED\u53E5\u4E2D\u7684\u6307\u6807\u53D8\u91CF i \u5C06\u4F1A\u5728\u5982\\"for (int i = 0...) {...}\\"\u8BED\u53E5\u4E4B\u540E\u53D8\u4E3A\u65E0\u6548\\r\\n8. itoa \u4E0D\u662F\u4E00\u4E2A\u901A\u7528 ANSI \u51FD\u6570\uFF08\u6807\u51C6 C/C++ \u4E2D\u65E0\u6B64\u51FD\u6570\uFF09\\r\\n9. printf \u4E2D\u4F7F\u7528 %lf \u683C\u5F0F\u662F\u4E0D\u6B63\u786E\u7684\\r\\n\\r\\n\u4E16\u754C\u4E0A\u6700\u9065\u8FDC\u7684\u8DDD\u79BB\u4E0D\u662F\u751F\u4E0E\u6B7B\uFF0C\u800C\u662F\u4F60\u4EB2\u624B\u5236\u9020\u7684BUG\u5C31\u5728\u4F60\u773C\u524D\uFF0C\u4F60\u5374\u600E\u4E48\u90FD\u627E\u4E0D\u5230\u5979\u3002 AC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nPC=Perfect Compile=\u5B8C\u7F8E\u7684\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nOLE=Output Limit Enough=\u8F93\u51FA\u5408\u6CD5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\u6309\u7167\u8D5B\u5236\u4E0D\u540C\uFF0C\u6709\u4E0D\u540C\u7684\u9012\u4EA4\u3001\u6392\u540D\u89C4\u5219\u3002\\r\\n\\r\\nOI \u8D5B\u5236\u6240\u6709\u9898\u76EE\u5747\u4EE5\u6700\u540E\u4E00\u6B21\u9012\u4EA4\u4E3A\u51C6\uFF0C\u7279\u522B\u5730\uFF0C\u8BF7\u907F\u514D\u7F16\u8BD1\u9519\u8BEF\u3002\\r\\n\\r\\nOI \u8D5B\u5236\u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u603B\u5206\u9AD8\u7684\u6392\u5728\u524D\u9762\uFF0C\u603B\u5206\u76F8\u7B49\u5219\u6392\u540D\u76F8\u540C\u3002\\r\\n\\r\\nACM/ICPC \u8D5B\u5236\u6240\u6709\u9898\u76EE\u9012\u4EA4\u540E\u7ACB\u5373\u8BC4\u6D4B\uFF0C\u4EE5\u662F\u5426\u901A\u8FC7\u4E3A\u51C6\u3002\\r\\n\\r\\nACM/ICPC \u8D5B\u5236\u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u901A\u8FC7\u9898\u76EE\u6570\u591A\u7684\u6392\u5728\u524D\u9762\uFF0C\u901A\u8FC7\u9898\u76EE\u6570\u76F8\u540C\u7684\u505A\u9898\u8017\u65F6\uFF08\u542B\u7F5A\u65F6\uFF09\u5C11\u7684\u6392\u5728\u524D\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u9009\u624B\u53EF\u4EE5\u591A\u6B21\u63D0\u4EA4\u4E00\u9053\u9898\u76EE\uFF0C\u5E76\u83B7\u5F97\u5B9E\u65F6\u8BC4\u6D4B\u7ED3\u679C\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u591A\u6B21\u63D0\u4EA4\u4F1A\u5BFC\u81F4\u9009\u624B\u7684\u5F97\u5206\u88AB\u6263\u9664\uFF0C\u6392\u884C\u699C\u5C06\u663E\u793A\u7528\u6237\u7684\u6700\u9AD8\u5F97\u5206\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u6BCF\u9053\u9898\u7684\u6700\u7EC8\u5F97\u5206\u4E3A:s\\\\*max(0.95^n,0.7).s,n\u5206\u522B\u4EE3\u8868\u672C\u6B21\u5F97\u5206\u548C\u672C\u6B21\u63D0\u4EA4\u524D\u7684\u5C1D\u8BD5\u6B21\u6570\u3002\\r\\n\\r\\n\u4E50\u591A \u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u6309\u7167\u5982\u4E0A\u89C4\u5219\u6298\u7B97\u540E\u7684\u5206\u6570\u4ECE\u9AD8\u5230\u4F4E\u6392\u540D\u3002\\r\\n\\r\\nIOI(\u4E25\u683C) \u8D5B\u5236\u4E0B\uFF0C\u4E0D\u540C\u4E8EIOI\u8D5B\u5236\uFF0C\u6392\u884C\u699C\u5C06\u88AB\u5173\u95ED\u81F3\u6BD4\u8D5B\u7ED3\u675F\u3002\\r\\n\\r\\nIOI(\u4E25\u683C) \u8D5B\u5236\u4E0B\uFF0C\u6BCF\u9053\u9898\u7684\u6392\u884C\u699C\u5F97\u5206\u5C06\u4E3A\u7528\u6237\u6BCF\u4E2A\u5B50\u4EFB\u52A1\u5728\u6240\u6709\u63D0\u4EA4\u4E2D\u7684\u6700\u5927\u5F97\u5206\u7684\u548C\u3002\\r\\n\\r\\n\u65F6\u95F4\u4E0E\u7A7A\u95F4\u9650\u5236\u4EE5\u9898\u76EE\u8BF4\u660E\u4E3A\u51C6\uFF0C\u9ED8\u8BA4\u9650\u5236\u53C2\u89C1\u9650\u5236\u3002\\r\\n\\r\\n1. \u9012\u4EA4\u65F6\u9009\u9519\u4E86\u7F16\u7A0B\u8BED\u8A00\\r\\n2. Java \u7684\u4E3B\u7C7B\u540D\u6CA1\u6709\u4F7F\u7528 \\"Main\\"\\r\\n3. \u5BF9\u4E8E C/C++\uFF1A\u89C1\u4E0B\\r\\n4. \u4E00\u822C\u6027\u7684\u7F16\u8BD1\u9519\u8BEF\\r\\n\\r\\n\u5BF9 C/C++ \u9009\u624B\u7684\u7279\u522B\u63D0\u9192\uFF1A\\r\\n\\r\\n1. \\\\_\\\\_int64 \u5728 GNU C++ \u4E2D\u5E94\u5199\u6210 long long \u7C7B\u578B\\r\\n2. main() \u8FD4\u56DE\u503C\u5FC5\u987B\u5B9A\u4E49\u4E3A int \uFF0C\u800C\u4E0D\u662F void\\r\\n3. for \u8BED\u53E5\u4E2D\u7684\u6307\u6807\u53D8\u91CF i \u5C06\u4F1A\u5728\u5982\\"for (int i = 0...) {...}\\"\u8BED\u53E5\u4E4B\u540E\u53D8\u4E3A\u65E0\u6548\\r\\n4. itoa \u4E0D\u662F\u4E00\u4E2A\u901A\u7528 ANSI \u51FD\u6570\uFF08\u6807\u51C6 C/C++ \u4E2D\u65E0\u6B64\u51FD\u6570\uFF09\\r\\n5. printf \u4E2D\u4F7F\u7528 %lf \u683C\u5F0F\u662F\u4E0D\u6B63\u786E\u7684\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF\uFF0C\u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3\\r\\n\\r\\n\u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\uFF0C\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0\\r\\n\\r\\n\u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E\uFF0C\u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\n\u7206\u96F6\u662F\u4E00\u79CD\u5BBF\u547D\uFF0CWA\u662F\u4E00\u79CD\u7EDD\u671B\\r\\n\\r\\nTLE\u662F\u4E00\u79CD\u75DB\u82E6\uFF0CRE\u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE\u662F\u4E00\u79CD\u65E0\u5948\uFF0CAC\u662F\u4E00\u79CD\u539F\u8C05\\r\\n\\r\\nAK\u662F\u4E00\u79CD\u5E7B\u60F3\uFF0C\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F\\r\\n\\r\\n\u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136\uFF0C\u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\n#\u6A21\u62DF\u53EA\u4F1A\u731C\u9898\u610F\uFF0C\u8D2A\u5FC3\u53EA\u80FD\u8FC7\u6837\u4F8B\\r\\n\\r\\n\u6570\u5B66\u4E0A\u6765\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u4E00\u822C\u770B\u89C4\u5F8B\\r\\n\\r\\n\u7EC4\u5408\u6570\u5B66\u9760\u8FD0\u6C14\uFF0C\u8BA1\u7B97\u51E0\u4F55\u778E\u66B4\u529B\\r\\n\\r\\n#\u56FE\u8BBA\u5F3A\u884C\u5957\u6A21\u677F\uFF0C\u6570\u8BBA\u53EA\u4F1A\uFF27\uFF23\uFF24\\r\\n\\r\\n#\u9012\u5F52\u9012\u63A8\u4F24\u4E0D\u8D77\uFF0C\u641C\u7D22\u832B\u7136\uFF34\uFF2C\uFF25\\r\\n\\r\\n\u5206\u6CBB\u505A\u5F97\u50CF\u679A\u4E3E\uFF0C\u66B4\u529B\u679A\u4E3E\u6570\u7B2C\u4E00\\r\\n\\r\\n\u6570\u636E\u7ED3\u6784\u5E72\u77AA\u773C\uFF0C\u6012\u5237\u6C34\u9898\u627E\u4FE1\u5FC3\\r\\n\\r\\n\u6DA8\u59FF\u52BF\u4E5F\u4E0D\u5BB9\u6613\uFF0C\u8003\u8BD5\u4E00\u6765\u5168\u61F5\u903C\\r\\n\\r\\n\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n#\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\u3002\\r\\n\\r\\n\u6A21\u62DF\u5B9A\u60F3\u5168\uFF0C\u52A8\u89C4\u5B9A\u627E\u5BF9\u3002\\r\\n\\r\\n\u8D2A\u5FC3\u5B9A\u8BC1\u660E\uFF0C\u4E8C\u5206LM+1\u3002\\r\\n\\r\\n\u5B9C\u8003NOIP , \u5C0F\u5FC3\u522B\u7206\u96F6.] \u9A97\u5206\u8FC7\u6837\u4F8B\uFF0C\u66B4\u529B\u51FA\u5947\u8FF9\u3002\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\\r\\n\\r\\n\u897F\u6C5F\u6708\xB7\u591C\u884COI\u9053\u4E2D \u660E\u6708AC\u60CA\u9E4A\uFF0C\\r\\n\\r\\nRE\u534A\u591C\u9E23\u8749\u3002\\r\\n\\r\\n\u7A3B\u82B1\u9999\u91CC\u8BF4\u4E30\u5E74\uFF0C\\r\\n\\r\\n\u542C\u53D6WA\u58F0\u4E00\u7247\u3002\\r\\n\\r\\n\u4E03\u516B\u4E2ATLE\uFF0C\\r\\n\\r\\n\u4E24\u4E09\u70B9MLE\u3002\\r\\n\\r\\n\u65E7\u65F6\u8305\u5E97\u793E\u6797\u8FB9\uFF0C\\r\\n\\r\\n\u8DEF\u8F6CCE\u5FFD\u89C1\u3002\\r\\n\\r\\n\u751F\u547D\u7684\u610F\u4E49?\\r\\n\\r\\n\u5982\u679C26\u4E2A\u82F1\u6587\u5B57\u6BCD\\r\\n\\r\\nA,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\\r\\n\\r\\n\u5206\u522B\u7B49\u4E8E\\r\\n\\r\\n1,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\\r\\n\\r\\n\u90A3\u4E48\uFF1A\\r\\n\\r\\n\u83B7\u5F97\u77E5\u8BC6,Knowledge\\r\\n\\r\\n=K+N+O+W+L+E+D+G+E\\r\\n\\r\\n=11+14+15+23+12+5+4+7+5\\r\\n\\r\\n=96%\\r\\n\\r\\n\u52AA\u529B\u5DE5\u4F5C\uFF0CWorkhard\\r\\n\\r\\n=W+O+R+K+H+A+R+D\\r\\n\\r\\n=23+15+18+11+8+1+18+4\\r\\n\\r\\n=98%\\r\\n\\r\\n\u4E5F\u5C31\u662F\u8BF4\u77E5\u8BC6\u548C\u52AA\u529B\u5DE5\u4F5C\uFF0C\u5BF9\u6211\u4EEC\u4EBA\u751F\u7684\u5F71\u54CD\uFF0C\u53EF\u4EE5\u8FBE\u523096%\u548C98%\u3002\\r\\n\\r\\n\u597D\u8FD0,Luck\\r\\n\\r\\n=L+U+C+K=\\r\\n\\r\\n12+21+3+11=\\r\\n\\r\\n47%\\r\\n\\r\\n\u7231\u60C5,Love\\r\\n\\r\\n=L+O+V+E\\r\\n\\r\\n=12+15+22+5\\r\\n\\r\\n=54%\\r\\n\\r\\n\u770B\u6765\uFF0C\u8FD9\u4E9B\u6211\u4EEC\u901A\u5E38\u8BA4\u4E3A\u91CD\u8981\u7684\u4E1C\u897F \u5374\u5E76\u6CA1\u8D77\u5230\u6700\u91CD\u8981\u7684\u4F5C\u7528\u3002\\r\\n\\r\\n\u90A3\u4E48\uFF0C \u4EC0\u4E48\u53EF\u4EE5\u51B3\u5B9A\u6211\u4EEC100\uFF05\u7684\u4EBA\u751F\u5462\uFF1F\\r\\n\\r\\n\u662FMoney\uFF08\u91D1\u94B1\uFF09\u5417\uFF1F\\r\\n\\r\\n=M+O+N+E+Y\\r\\n\\r\\n=13+15+14+5+25\\r\\n\\r\\n=72% \u770B\u6765\u4E5F\u4E0D\u662F\u3002\\r\\n\\r\\n\u662FLeadership (\u9886\u5BFC\u80FD\u529B)\u5417\uFF1F\\r\\n\\r\\n=L+E+A+D+E+R+S+H+I+P\\r\\n\\r\\n=12+5+1+4+5+18+19+9+16\\r\\n\\r\\n=89%\\r\\n\\r\\n\u8FD8\u4E0D\u662F\u3002\\r\\n\\r\\n\u91D1\u94B1\uFF0C\u6743\u529B\u4E5F\u4E0D\u80FD\u5B8C\u5168\u51B3\u5B9A\u6211\u4EEC\u7684\u751F\u6D3B\u3002 \u90A3\u662F\u4EC0\u4E48\u5462\uFF1F\u5176\u5B9E\uFF0C \u771F\u6B63\u80FD\u4F7F\u6211\u4EEC\u751F\u6D3B\u5706\u6EE1\u7684\u4E1C\u897F\u5C31\u5728\u6211\u4EEC\u7684 \u4EE3\u7801\u91CC\u9762\uFF01\\r\\n\\r\\n\u8F93\u5165\u8F93\u51FA\u6D41\u5934\u6587\u4EF6,iostream\\r\\n\\r\\n=I+O+S+T+R+E+A+M\\r\\n\\r\\n=9+15+19+20+18+5+1+13\\r\\n\\r\\n=100%\\r\\n\\r\\n\u6240\u4EE5\u575A\u6301\u5199\u4EE3\u7801\u5427\u2026\\r\\n\\r\\n\u5404\u79CD\u8001\u5E08\u4E00\u56DE\u5934 \u8BED\u6587\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u6B64\u5730\u7A7A\u4F59\u9EC4\u9E64\u697C\u3002 \u6570\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6B21\u51FD\u6570\u5BF9\u79F0\u8F74\u3002 \u82F1\u8BED\u8001\u5E08\u4E00\u56DE\u5934\uFF0Csorry\u52A0\u4E0A\u4E09\u514B\u6CB9\u3002 \u5316\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6C27\u5316\u78B3\u53D8\u6C7D\u6CB9\u3002 \u7269\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E00\u8DDF\u6760\u6746\u64AC\u5730\u7403\u3002 \u751F\u7269\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8BD5\u7BA1\u5A74\u513F\u6C34\u4E2D\u6E38\u3002 \u5730\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5927\u9646\u7248\u5757\u4E71\u6F02\u6D41\u3002 \u52B3\u6280\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u7834\u94DC\u70C2\u94C1\u6765\u8D70\u79C0\u3002 \u653F\u6CBB\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5E03\u4EC0\u6539\u884C\u5356\u8C46\u6CB9\u3002 \u7F8E\u672F\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8499\u5A1C\u4E3D\u838E\u4E5F\u98CE\u6D41\u3002 \u4F53\u80B2\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5965\u8FD0\u53D6\u6D88\u6253\u7BEE\u7403\u3002 \u7535\u8111\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5B66\u751F\u5168\u6210\u963F\uFF31\u53CB\u3002 \u5168\u4F53\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E16\u754C\u4EBA\u6C11\u6CA1\u81EA\u7531\u3002\\r\\n\\r\\n\u6240\u6709\u5934\u6587\u4EF6: 1.\u9996\u5148\u662F\u6700\u65B9\u4FBF\u7684\u4E07\u80FD\u5934\u6587\u4EF6\uFF0C\u987E\u540D\u601D\u4E49\uFF0C\u53EF\u4EE5\u5C06\u5176\u7406\u89E3\u4E3A\u7236\u4EB2\u5934\u6587\u4EF6 \uFF08\u867D\u7136\u65B9\u4FBF\u4E86\u61D2\u4EBA\uFF0C\u4F46\u662F\u7F3A\u70B9\u4E5F\u5F88\u660E\u663E--\u8FD9\u4E00\u5934\u6587\u4EF6\u5F88\u5360\u7528\u5185\u5B58\uFF09\uFF1A #include<bits/stdc++.h> 2.\u63A5\u7740\u4E5F\u662F\u6BD4\u8F83\u5E38\u7528\u7684\uFF0C\u4F5C\u7528\u4E8E\u6570\u636E\u6D41\u8F93\u5165\u8F93\u51FA cin>>\u548Ccout<<\uFF1A #include 3.\u7136\u540E\u662F\u5404\u79CD\u7B97\u6CD5\u7684\u5934\u6587\u4EF6(\u4F8B\u5982sort\u51FD\u6570\u7B49)\uFF1A #include 4.\u5173\u4E8E\u6570\u5B66\u51FD\u6570\u7684\u5934\u6587\u4EF6\uFF08\u4F8B\u5982max( )\uFF0Cmin( )\uFF0Cabs( )\u7B49\uFF09\uFF08\u4ECEC\u8BED\u8A00\u4E2D\u7684math.h\u7EE7\u627F\u800C\u6765\uFF09\uFF1A #include 5.string\u5B57\u7B26\u4E32\u5934\u6587\u4EF6\uFF1A #include 6.\u63A5\u7740\u662FC\u8BED\u8A00\u7684\u5934\u6587\u4EF6\uFF1A #include 7.\u666E\u901A\u961F\u5217(\u53EA\u80FD\u4E00\u8FB9\u8FDB\u4E00\u8FB9\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 8.\u53CC\u5411\u961F\u5217(\u4E24\u8FB9\u90FD\u53EF\u4EE5\u8FDB\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 9.\u6808(\u5148\u8FDB\u540E\u51FA\uFF0C\u540E\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 10.\u5217\u8868\u7684\u5934\u6587\u4EF6\uFF1A #include 11.\u52A8\u6001\u6570\u7EC4(\u4E0D\u9700\u77E5\u9053\u8BE5\u6570\u7EC4\u7684\u6570\u91CF)\u7684\u5934\u6587\u4EF6: #include 12.\u56FE\u7684\u5934\u6587\u4EF6\uFF1A #include 13.\u96C6\u5408(\u5185\u90E8\u81EA\u52A8\u6709\u5E8F\u4E14\u4E0D\u542B\u91CD\u590D\u5143\u7D20)\u7684\u5934\u6587\u4EF6\uFF1A #include 14.\u63A7\u5236\u7535\u8111\u6216\u5C0F\u9ED1\u6846\u5934\u6587\u4EF6(\u4E0D\u5305\u542B\u5728\u4E07\u80FD\u5934\u4EF6)\uFF1A #include<windows.h>\\r\\n\\r\\n\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B \u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B \u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B \u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002 \u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B \u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B \u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B \u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\\r\\n\\r\\n\u73ED\u957F\u8BF4:\u8D70\uFF0C\u6211\u4EEC\u53BB\u70B8\u4E86\u5B66\u6821\u3002 \u526F\u73ED\u957F\u8BF4:\u8FD9\u4E2A\u4E3B\u610F\u4E0D\u9519 \u5316\u5B66\u8BFE\u4EE3\u8868\u8D1F\u8D23\u63D0\u53D6\u6C22\u6C14 \u7269\u7406\u8BFE\u4EE3\u8868\u8D1F\u8D23\u62FC\u88C5\u6C22\u5F39 \u6570\u5B66\u8BFE\u4EE3\u8868\u8D1F\u8D23\u8BA1\u7B97\u7206\u7834\u9762\u79EF \u5730\u7406\u8BFE\u4EE3\u8868\u8D1F\u8D23\u7B56\u5212\u7206\u7834\u5730\u70B9 \u5386\u53F2\u8BFE\u4EE3\u8868\u8D1F\u8D23\u8BB0\u5F55\u5149\u8F89\u573A\u9762 \u751F\u7269\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4E8B\u540E\u751F\u6001\u73AF\u5883 \u653F\u6CBB\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4F7F\u7528\u6CD5\u5F8B\u6253\u5B98\u53F8 \u8BED\u6587\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4E71\u5199\u6587\u7AE0\u63A8\u5378\u8D23\u4EFB \u82F1\u8BED\u8BFE\u4EE3\u8868\u8D1F\u8D23\u5230\u5916\u56FD\u8D2D\u4E70\u8FDB\u53E3\u6750\u6599 \u4F53\u80B2\u8BFE\u4EE3\u8868\u8D1F\u8D23\u5C60\u6740XXX\\r\\n\\r\\n\u9F13\u8D77\u52C7\u6C14\u6572\u8D77\u8FD9\u952E\u76D8 \u53EA\u56E0\u4E3A\u6709\u4F60\u5728 \u65E0\u5411\u56FE\uFF0C\u662F\u5426\u660E\u767D \u5BB3\u7F9E\u7684\u6211\uFF0C\u8BF4\u4E0D\u51FA\u7684\u7231 \u6211\u4E5F\u66FE\u56DB\u5904\u6F02\u6CCA\u6D41\u6D6A \u4E3A\u6C42\u5355\u5143\u77ED\u8DEF \u76F4\u5230\u6211\u84E6\u7136\u56DE\u9996\u65F6 \u77A5\u89C1\u4F60\u590D\u6742\u6A21\u6837\\r\\n\\r\\n\u63D0\u4EA4\u4E00\u6B21\u4E00\u6B21\u4E00\u904D\u4E00\u904D \u5DE1\u67E5\u4E8EOJ \u53EA\u4E3A\u4E86AC\u51FA\u73B0 \u5982\u4F55\u5361\u8FDB\u8D85\u9650\u65F6\u95F4 \u589E\u5E7F\u8DEF\u6B62\u4E0D\u4F4F\u6C42\u6700\u5927\u6D41 \u6DF1\u5E7F\u628A\u56FE\u641C \u624B\u6572\u7740\u5C0F\u5C0F\u7684\u952E\u76D8 \u6CA1\u4EBA\u966A\u5728\u6211\u5DE6\u53F3\\r\\n\\r\\n\u5957\u7528\u5FC3\u7231\u7684\u7EBF\u6BB5\u6811 \u4EFF\u4F5BAC\u4E86\u5168OJ \u60F3\u8981\u8BC4\u6D4B\u673A\u4E86\u89E3 \u8FD9AK\u7684\u611F\u89C9\\r\\n\\r\\n\u4E00\u4E2A\u4EBA\u7684\u4F18\u5316\u90A3\u7F51\u7EDC\u6D41 \u660E\u660E\u60F3AC\u5374\u8D85\u65F6\u8D85\u7A7A \u867D\u7136\u6211\u7684\u5E38\u6570\u53EF\u80FD\u4E0D\u592A\u591F \u6709\u8C01\u80FD\u61C2\u6211\u6E29\u67D4 \u505A\u4E00\u68F5\u5E73\u8861\u6811\u968F\u6570\u65CB\u8F6C \u53C8\u56DE\u6EAF\u6700\u521D\u7684\u6839\u8282\u70B9 \u540E\u6765\u6211\u624D\u5361\u8FDB\u8FD9\u5C31\u662F\u4F60\u60F3\u8981\u7684\u65F6\u9650 \u90A3\u4E48\u9ED8\u9ED8\u7206\u96F6\u662F\u6211\u7ED9\u4F60\u6700\u540E\u7684\u6E29\u67D4\\r\\n\\r\\n\u5199\u7740n\u65B9n\u4E09\u7684\u66B4\u529B \u5F62\u5355\u5F71\u53EA\u7684\u6211 \u4EFBBUG\u5C06\u6211\u5265\u843D \u4E00\u58F0\u53F9\u606F\u53EA\u80FD\u6253\u8868 \u6211\u4E5F\u60F3\u6253\u5230\u90A3\u96C6\u8BAD\u961F \u7ED9\u81EA\u5DF1\u9A97\u70B9\u5206 \u4EFB\u5DE8\u4F6C\u5982\u6B64\u5F3A\u5927 \u53C8\u4F55\u5904\u80FD\u591F\u9A97\u5230\u5206\\r\\n\\r\\nOI\u603B\u6709\u8BB8\u591A\u632B\u6298 \u8BF7\u575A\u5B9A\u81EA\u5DF1\u7684\u9009\u62E9 \u5373\u4F7F\u5728\u96BE\u8FC7\u65F6\u523B \u4E5F\u8981\u628A\u4EE3\u7801\u5199\\r\\n\\r\\n\u4E00\u4E2A\u4EBA\u7684\u4F18\u5316\u90A3\u7F51\u7EDC\u6D41 \u660E\u660E\u60F3AC\u5374\u8D85\u65F6\u8D85\u7A7A \u867D\u7136\u6211\u7684\u5B9E\u529B\u53EF\u80FD\u4E0D\u592A\u591F \u6709\u8C01\u80FD\u61C2\u6211\u6E29\u67D4 \u505A\u4E00\u68F5\u5E73\u8861\u6811\u968F\u6570\u65CB\u8F6C \u53C8\u56DE\u6EAF\u6700\u521D\u7684\u6839\u8282\u70B9 \u540E\u6765\u6211\u624D\u5361\u8FDB\u8FD9\u5C31\u662F\u4F60\u60F3\u8981\u7684\u65F6\u9650 \u90A3\u4E48\u9ED8\u9ED8\u7206\u96F6\u662F\u6211\u7ED9\u4F60\u6700\u540E\u7684\u6E29\u67D4\\r\\n\\r\\n\u4E3A\u4F60\u5199\u8D77\u8FD9\u4EE3\u7801 \u8FD9\u662F\u9B3C\u755C\u7684\u98CE\u683C \u5C31\u7B97\u8D85\u65F6\u53C8\u5982\u4F55 \u53EA\u60F3\u5E26\u7ED9\u4F60AC \u4E3A\u4F60\u6211\u52AA\u529B\u5237\u9898\u5199dp \u611F\u8C22\u4F60\u4EEC\u7684\u5173\u6CE8 \u5C31\u7B97\u660E\u5929for\u5FAA\u73AF\u91CD\u590D \u6709\u4E86\u966A\u4F34\u5C31\u4E0D\u5B64\u72EC\\r\\n\\r\\n---\\r\\n\\r\\n\u54AC\u4E0B\u4E00\u53E3\u6211\u7684\u5FEB\u901F\u5E42\u5427 \u5C1D\u5C3D\u8FD9\u6D4B\u8BC4\u7684A(C) WA T(LE) R(E) \u8EAB\u5728\u6587\u5316\u8BFE\u7684OIer\u4EEC\u554A \u4E0D\u8981\u5FD8\u8BB0\u4F60\u4EE3\u7801 \u4E5F\u8BB8\u5BF9\u8FD9\u4E16\u754C\u6709\u7740\u65E0\u5948 \u5DF2\u4E0D\u518D\u662F\u90A3\u4E00\u4E2A\u849F\u84BB \u5373\u4F7FNOIP\u7206\u96F6\u4E5F\u8981\u5B66\u4F1A\u53BB\u627F\u62C5\\r\\n\\r\\n\u6709\u4E86\u7B97\u6CD5\u966A\u4F34\u6211\u5DF2\u4E0D\u518D\u4F1A\u5B64\u5355 \u4F60\u4EEC\u7684\u9F13\u52B1\u5728\u6211\u7684\u5FC3\u4E2D\u6C38\u4E0D\u4F1A\u6D88\u6563\\r\\n\\r\\n# [\u5BB6\u957F\u76F4\u547C\u592A\u66B4\u529B\uFF01\u8FD9\u4E9B\u7B97\u6CD5\u53EF\u80FD\u4F1A\u88AB\u5220\u9664](https://www.cnblogs.com/wlzhouzhuan/p/15344765.html)\\r\\n\\r\\n\u8FD1\u65E5\uFF0C\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u591A\u4F4D\u7528\u6237\u5BB6\u957F\u5411\\r\\n\\r\\nhttps://www.luogu.com.cn/user/1\\r\\n\\r\\n\u513F\u7AE5\u7684\u56E0\u7D20\u51FA\u73B0\uFF0C\u8981\u6C42\u5BF9\u76F8\u5173\u7B97\u6CD5\u8FDB\u884C\u6574\u6539\u6216\u88AB\u5220\u9664\u3002\\r\\n\\r\\n\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u9898\u76EE\u7EC4\u7BA1\u7406\u5458\u5728\u63A5\u53D7\u91C7\u8BBF\u65F6\u8BF4\u9053\uFF0C\u5728\u6700\u8FD1\u51E0\u5929\u5185\uFF0C\u6D1B\u8C37\u6536\u5230\u4E86\u6570\u5341\u6761\u5BB6\u957F\u6765\u4FE1\uFF0C\u58F0\u79F0\u7F51\u7AD9\u6559\u6388\u7684\u90E8\u5206\u7B97\u6CD5\u5B58\u5728\u201C\u8840\u8165\u201D\u3001\u201C\u66B4\u529B\u201D\u7B49\u5185\u5BB9\u3002\u201C\u4ED6\u4EEC\u8BF4\u8FD9\u4E9B\u4E1C\u897F\u4F1A\u6559\u574F\u4ED6\u4EEC\u5BB6\u7684\u5B69\u5B50\uFF0C\u8981\u6C42\u6211\u4EEC\u6574\u6539\u8FD9\u4E9B\u7B97\u6CD5\uFF0C\u628A\u8FD9\u4E9B\u5BF9\u5C0F\u670B\u53CB\u4E0D\u592A\u597D\u7684\u4E1C\u897F\u5220\u6389\uFF0C\u6216\u8005\u76F4\u63A5\u628A\u7B97\u6CD5\u5220\u9664\u3002\u201D\\r\\n\\r\\n\u968F\u7740\u56FD\u5E86 (\u96FE) \u7684\u5230\u6765\uFF0C\u5F88\u591A\u5BB6\u957F\u76F4\u63A5\u6765\u5230\u6D1B\u8C37\u53CD\u6620\u60C5\u51B5\u3002\u8BB0\u8005\u5728\u73B0\u573A\u968F\u673A\u91C7\u8BBF\u4E86\u51E0\u4F4D\u5BB6\u957F\uFF0C\u8BE2\u95EE\u4ED6\u4EEC\u5BF9\u8FD9\u4E9B\u7B97\u6CD5\u7684\u770B\u6CD5\u3002\\r\\n\\r\\n\u5218\u5973\u58EB\u7684\u513F\u5B50\u6B63\u5728\u6D1B\u8C37\u5B66\u4E60\u666E\u53CA\u7EC4\u5185\u5BB9\u3002\u5728\u91C7\u8BBF\u4E2D\u5218\u5973\u58EB\u544A\u8BC9\u8BB0\u8005\uFF0C\u5E0C\u671B\u6D1B\u8C37\u505C\u5F00\u200B**\u5308\u7259\u5229\u7B97\u6CD5**\u200B\u3002\u201C\u6211\u770B\u91CC\u9762\u8BB2\u7684\u90FD\u662F\u4E9B\u4E00\u4E00\u5339\u914D\u554A\u3001\u4E8C\u5206\u56FE\u554A\u4E4B\u7C7B\u7684\u5339\u914D\u95EE\u9898\uFF0C\u200B**\u8FD9\u4E0D\u662F\u6559\u5B69\u5B50\u600E\u4E48\u627Enpy\u4E48\uFF1F\u90A3\u4ED6\u4EE5\u540E\u5C82\u4E0D\u662F\u5B66\u4F1A\u65E9\u604B\u4E86\uFF1F**\u200B\u201D\u738B\u5148\u751F\u4E5F\u6709\u7C7B\u4F3C\u7684\u60F3\u6CD5\u3002\u4ED6\u8981\u6C42\u6D1B\u8C37\u6574\u6539**\u6708\u8D5B**\u5185\u5BB9\u3002\u201C**\u200B\u542C\u8BF4\u8BFE\u7A0B\u91CC\u9762\u6709\u2018\u9009\u59B9\u5B50\u2019\uFF0C\u8981\u662F\u5C0F\u670B\u53CB\u88AB\u5973\u62F3\u6253\u4E86\u8BE5\u600E\u4E48\u529E\uFF1F\u200B**\u592A\u5371\u9669\u4E86\uFF01\u201D\\r\\n\\r\\n\u8BA4\u4E3A\u6570\u636E\u7ED3\u6784\u592A\u5371\u9669\u3001\u5BB9\u6613\u4F24\u5230\u5B69\u5B50\uFF0C\u662F\u5F88\u591A\u5BB6\u957F\u7684\u5171\u540C\u5FC3\u58F0\u3002\u738B\u5927\u7237\u4ECA\u5E74\u5DF2\u7ECF\u516D\u5341\u591A\u5C81\u4E86\uFF0C\u5374\u4F9D\u7136\u4E13\u7A0B\u8DD1\u5230\u5B66\u6821\uFF0C\u9AD8\u547C\u505C\u6B62\u6559\u6388**Splay\u6811**\u548C\u200B**Treap\u6811**\u200B\u3002\u4ED6\u8BF4\uFF0C**\u81EA\u5BB6\u7684\u5B59\u5B50\u5F88\u5C0F\u7684\u65F6\u5019\u649E\u5230\u6811\u4E0A\u8FC7\uFF0C\u4ED6\u62C5\u5FC3\u8FD9\u4E24\u68F5\u6811\u4F1A\u7ED9\u5B69\u5B50\u9020\u6210\u5FC3\u7406\u9634\u5F71\u3002**\\r\\n\\r\\n\u6B64\u5916\uFF0C\u200B**\u6700\u5927\u6D41**\u200B\u3001**\u8D39\u7528\u6D41**\u7B49\u7B97\u6CD5\u4E5F\u906D\u5230\u4E86\u90E8\u5206\u5BB6\u957F\u7684\u62B5\u5236\u3002\u201C\u4E3B\u8981\u8FD8\u662F\u73A9\u6C34\u5B89\u5168\u561B\u201D\uFF0C\u9648\u5973\u58EB\u8BF4\uFF0C\u201C\u5B69\u5B50\u4EEC\u770B\u5230\u8FD9\u4E9B\u6D41\u554A\u3001\u6D41\u91CF\u554A\u3001\u56DE\u5BB6\u5C31\u5F88\u53EF\u80FD\u4F1A\u4E0B\u6C34\u53BB\u6E38\u6CF3\uFF0C\u6211\u4EEC\u5F53\u5BB6\u957F\u7684\u8FD8\u662F\u4E0D\u653E\u5FC3\u561B\u3002\u201D\u800C\u5F20\u5148\u751F\u7684\u6001\u5EA6\u5219\u66F4\u4E3A\u575A\u51B3\uFF1A\u201C\u200B\\\\*\\\\*\u73B0\u5728\u5C31\u6562\u73A9\u6C34\uFF0C\u5C06\u6765\u6562\u73A9\u4EC0\u4E48\uFF0C\u6211\u90FD\u4E0D\u6562\u60F3\u4E86\uFF01\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u540C\u6837\u4F5C\u4E3A\u7B97\u6CD5\uFF0C**\u200B\u300A\u6DF1\u5165\u6D45\u51FA\u7A0B\u5E8F\u8BBE\u8BA1\u7ADE\u8D5B\u300B\u200B**\u53D7\u5230\u62B5\u5236\u7684\u7406\u7531\u5219\u6709\u5F88\u5927\u4E0D\u540C\u3002\u5434\u5148\u751F\u544A\u8BC9\u8BB0\u8005\uFF1A\u201C\u4E3B\u8981\u662F\uFF0C\u8FD9\u4E2A\uFF08\u6DF1\u5165\u6D45\u51FA\u7A0B\u5E8F\u8BBE\u8BA1\u7ADE\u8D5B\u7684\u6559\u6750\uFF09\u592A\u539A\u4E86\uFF0C\u5F97\u6709\u597D\u51E0\u65A4\u91CD\uFF0C**\u200B\u7F51\u4E0A\u5C0F\u5B69\u5B50\u5982\u679C\u5B09\u620F\u6253\u95F9\uFF0C\u62FF\u7740\u8FD9\u672C\u4E66\u5230\u5904\u4E71\u7529\uFF08\u7684\u8BDD\uFF09\uFF0C\u975E\u5E38\u5371\u9669\u3002\u200B**\u8981\u662F\u78B0\u5230\u5934\u7684\u8BDD\uFF0C\u90A3\u80AF\u5B9A\u4F1A\u628A\u5934\u78D5\u7834\u7684\uFF0C\u4F60\u8BF4\u8FD9\u4E2A\u8D23\u4EFB\u7531\u8C01\u6765\u627F\u62C5\uFF1F\u201D\\r\\n\\r\\n\u5728\u4F17\u591A\u7B97\u6CD5\u4E2D\uFF0C\u5BB6\u957F\u62B5\u5236\u547C\u58F0\u6700\u9AD8\u7684\u5219\u662F\u56FE\u8BBA\u7B97\u6CD5\u3002\u5728\u5BB6\u957F\u770B\u6765\uFF0C\u6709\u7684\u7B97\u6CD5\u8981\u627E\u73AF\uFF0C\u4F1A\u7ED5\u6655\u5230\u5B69\u5B50\uFF1B\u753B\u56FE\u7528\u7684\u7B14\u53EF\u80FD\u4F1A\u6233\u4F24\u624B\u6307\uFF1B\u5F88\u591A\u7B97\u6CD5\u5728\u641C\u7D22\u7684\u65F6\u5019\u53EF\u80FD\u4F1A\u628A\u7CFB\u7EDF\u6808\u7528\u7206\uFF1B\u6709\u4E9B\u7B97\u6CD5\u5199\u9519\u4E86\u8981\u8F93\u4E2D\u91CF\u53C2\u89E3\u6539\u5F88\u4E45\uFF0C\u53EF\u80FD\u4F1A\u7D2F\u5230\u5C0F\u670B\u53CB\uFF0C\u201C\u200B\\\\*\\\\*\u628A\u6211\u5BB6\u5C0F\u5B69\u7D2F\u6B7B\u4E86\u8BE5\u600E\u4E48\u529E\uFF1F\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u9664\u4E86\u62C5\u5FC3\u5B69\u5B50\u4EEC\u7684\u5B89\u5168\u5916\uFF0C\u5BF9\u5B69\u5B50\u751F\u6D3B\u4E60\u60EF\u7684\u5F71\u54CD\u4E5F\u6210\u4E3A\u4E86\u5BB6\u957F\u4EEC\u62B5\u5236\u8BFE\u7A0B\u7684\u8981\u7D20\u4E4B\u4E00\u3002\u53F6\u5973\u58EB\u544A\u8BC9\u8BB0\u8005\uFF0C\u5979\u5E0C\u671B\u6D1B\u8C37\u6574\u6539\u5168\u90E8\u82F1\u8BED\u9898\u9762\u3002\u53F6\u5973\u58EB\u7684\u513F\u5B50\u624D\u8003\u666E\u53CA\u7EC4\uFF0C\u5374\u5DF2\u7ECF\u5B66\u4F1A\u4E86sh\\\\*t\uFF0Cf\\\\*\\\\*k\u7B49\u9AD8\u7EA7\u8BCD\u6C47\u3002\u201C\u5B69\u5B50\u73B0\u5728\u51FA\u53E3\u5C31\u662F\u8FD9\u79CD\u8BCD\uFF0C\u5F71\u54CD\u5F88\u4E0D\u597D\uFF0C\u80AF\u5B9A\u662F\u6D1B\u8C37\u7684\u9898\u9762\u6559\u7684\u3002\u201D\u53F6\u5973\u58EB\u8BF4\u3002\\r\\n\\r\\n\u540C\u6837\uFF0C\u674E\u5148\u751F\u5BF9\u4E8E\u6D1B\u8C37\u7684bfs, dfs, bdfs\u7B97\u6CD5\u4E5F\u9887\u6709\u5FAE\u8BCD\u3002\u201C\u6211\u4EEC\u8FD8\u662F\u60F3\u7ED9\u5B69\u5B50\u8425\u9020\u4E00\u4E2A\u5065\u5EB7\u7684\u6210\u957F\u73AF\u5883\u561B\uFF0C\u6211\u770B\u8BFE\u4E0A\uFF0C\u5C45\u7136\u8BA9\u5C0F\u670B\u53CB\u4EEC\u53BB\u66B4\u529B\u904D\u5386\u56FE\u554A\u3001\u66B4\u529B\u627E\u7B54\u6848\u554A\uFF0C\u8FD9\u4E0D\u662F\u6559\u5C0F\u670B\u53CB\u4EEC\u66B4\u529B\u4E48\uFF1F\u200B\\\\*\\\\*\u5E73\u65F6\u6253\u6253\u6740\u6740\u7684\u52A8\u753B\u7247\u6211\u90FD\u4E0D\u8BA9\u81EA\u5BB6\u5C0F\u5B69\u770B\uFF0C\u66F4\u4E0D\u8981\u8BF4\u52A8\u624B\u53BB\u505A\u8FD9\u4E9B\u4E86\u3002\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u6B64\u5916\uFF0C\u4E00\u4E9B\u975E\u76C8\u5229\u673A\u6784\u4E5F\u906D\u5230\u4E86\u5BB6\u957F\u7684\u62B5\u5236\u3002\u5F88\u591A\u5BB6\u957F\u8BA4\u4E3A\uFF0C\u73A9\u7535\u8111\u662F\u5F71\u54CD\u81EA\u5BB6\u5C0F\u5B69\u5B66\u4E60\u7684\u5173\u952E\u539F\u56E0\uFF0C\u56E0\u6B64\u5F3A\u70C8\u8981\u6C42\u6D1B\u8C37\u53D6\u7F14 **\u200BF \uFF0C\u5E76\u53D6\u6D88\u76F8\u5173\u7ADE\u8D5B\u3002\u200B **N\\\\*\\\\*P** \u9996\u5F53\u5176\u51B2\uFF0C\u5468\u5148\u751F\u63A5\u53D7\u91C7\u8BBF\u65F6\u8BF4\u9053\uFF1A\u201C\u542C\u8BF4\u8FD9\u95E8\u8BFE\u8981\u5B66\u751F\u4EEC\u81EA\u5DF1\u5B66\u4E60\u7B97\u6CD5\uFF0C\u8981\u662F\u771F\u628A\u7B97\u6CD5\u5B66\u597D\u4E86\uFF0C\u4E0D\u5C31\u4F1A\u6709\u66F4\u591A\u5C0F\u670B\u53CB\u6C89\u8FF7\u7535\u8111\u4E48\uFF1F\u200B**\u5982\u679C\u4ED6\u4EEC\u4E0D\u5B66\u7B97\u6CD5\u7684\u8BDD\uFF0C\u6211\u4EEC\u7684\u5C0F\u5B69\u5C31\u4E0D\u4F1A\u8FD9\u4E48\u8D2A\u73A9\u7535\u8111\u4E86\u3002**\u200B\u201D\u540C\u6837\uFF0C\u4E00\u4E9B\u5BB6\u957F\u4E5F\u5BF9**\u6D4F\u89C8\u5668**\u200B\u8868\u793A\u4E0D\u6EE1\uFF1A\u201C\u200B**\u6CA1\u6709\u6D4F\u89C8\u5668\uFF0C\u5C0F\u670B\u53CB\u4EEC\u81EA\u7136\u5C31\u4E0D\u4F1A\u6C89\u8FF7\u4E0A\u7F51\u4E86\u3002\\\\*\\\\*\u201D\\r\\n\\r\\n\u8BA9\u8BB0\u8005\u611F\u5230\u60CA\u5947\u7684\u662F\uFF0C\u5F88\u591A\u5BB6\u957F\u5BF9\u4E00\u4E9B\u8BA1\u7B97\u673A\u57FA\u7840\u6570\u5B66\u5185\u5BB9\u4E5F\u6709\u8F83\u5927\u7684\u610F\u89C1\u3002\u90E8\u5206\u5BB6\u957F\u8981\u6C42\u4E0B\u67B6\\\\*\\\\*\u300A\u7EC4\u5408\u6570\u5B66\u300B\\\\*\\\\* **\u200B\u300A\u6DF7\u51DD\u571F\u6570\u5B66\u300B\u200B**\u7B49\u8BFE\u7A0B\u3002\u5728\u95EE\u53CA\u539F\u56E0\u65F6\uFF0C\u5BB6\u957F\u544A\u8BC9\u8BB0\u8005\uFF0C**\u6587\u4E2D\u7684\u611F\u53F9\u53F7\u5F88\u50CF\u4E00\u6839\u68CD\u5B50\uFF0C\u4F1A\u5F15\u53D1\u5C0F\u670B\u53CB\u7684\u66B4\u529B\u503E\u5411\u3002**\\r\\n\\r\\n\u9488\u5BF9\u6B64\u4E8B\uFF0C\u8BB0\u8005\u5C1D\u8BD5\u8054\u7EDC\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u7684\u7BA1\u7406\u5458\u3002\u7BA1\u7406\u5458\u56DE\u590D\u79F0\uFF0C\\r\\n\\r\\nhttps://www.luogu.com.cn/user/1\\r\\n\\r\\n\u4E0D\u8FC7\uFF0C\u4E5F\u6709\u5C11\u6570\u5BB6\u957F\u5BF9\u4E00\u4E9B\u7B97\u6CD5\u8868\u793A\u652F\u6301\u3002\u4E00\u4F4D\u5BB6\u957F\u544A\u8BC9\u8BB0\u8005\uFF0C\u5E0C\u671B\u5B66\u6821\u7740\u529B\u5EFA\u8BBE\u300A\u7F16\u7A0B\u8BED\u8A00\u57FA\u7840\u300B\u8BFE\u7A0B\u3002\u201C\u200B\\\\*\\\\*\u5B69\u5B50\u5982\u679C\u5728\u5B66\u6821\u5B66\u597D\u8BED\u8A00\u8FD9\u4E9B\u4E1C\u897F\u7684\u8BDD\uFF0C\u56DE\u8BA9\u4ED6\u642C\u7816\u7684\u65F6\u5019\u5E94\u8BE5\u80FD\u66F4\u597D\u4E00\u4E9B\u3002\\\\*\\\\*\u200B\u201D import turtle import time print(\'\u6B22\u8FCE\u4F7F\u7528PY-C\u8BED\u8A00!\') 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(\'\u65E0\u7528\') b=input() if b==\'pwrnbnt[nt()>x]\': q=input(\'\u6709\u7528\') print(q) time.sleep(2) elif n==\'bl prt; and ();\': print(\'qwerty(print()):!\') w=input() a=input(\'\u65E0\u7528\u8F93\u5165\') if w==\'bl\': t=input(\'\u8F93\u5165\u53D8\u91CF\') b=t u=input() if u==\'prt(bl[itntgujhy]-(a))\': print(b) time.sleep(2)\\r\\n\\r\\nelif 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(\'\u5012\u5E8F\u6392\u5217\') 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\u200B==y: print(j) time.sleep(2) elif n==\u200B\'if [1;2{1234}to(12345[x])\u200B==\\"y\\"];\': print(\'if and else to print()!;\') u=input() if u==\u200B\'input(1*2) if and if(to); and eles to and if (print(123)):\': q=int(input()) w=int(input()) if q\u200B==w: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n==\u200B\'a,b\u200B==int(input(2))} and while and to {12qwerty}-(a) print(a);\': a=int(input()) b=int(input(\'\u4E0D\u8981\u662F\u592A\u5927\u7684\u6570\')) while a>b: print(a) a+=1 time.sleep(2) elif n==\u200B\'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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\'\u8ACB\u8F38\u5165\u4E00\u500B\u5217\u8868\').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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\\"\u4E00\u4E2A\u5143\u7EC4\\")) 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==\'\u200B*mt*\u200B: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==\'\u200B*mt*\u200B:turtle drew;\': n=int(input(\'\u6B21\u6570\')) for i in range(1,n+1): a=input(\'a cmd\') if a \u200B==\'turtle.qdesgforward(100);\': turtle.forward(100) elif a==\u200B\'turtle.qhhjaudbnsuleft(90);\': turtle.left(90)\\r\\n\\r\\n# \u770B\u5B8Cmd\u8BED\u6CD5\u8BB0\u5F97\u56DE\u6765\uFF01\uFF01\u6587\u7AE0\u672B\u5C3E\u6709\u5F69\u86CB\uFF01\uFF01md\u8BED\u6CD5\u653E\u8FD9\u91CC\u4E86\uFF1A\\r\\n\\r\\n# [Markdown \u8BED\u6CD5---\u6233\u6211\u8DF3\u8F6C](https://blog.csdn.net/qcx321/article/details/53780672)\\r\\n\\r\\n# \u5199\u9898\u683C\u5F0F\uFF1A\uFF1A\\r\\n\\r\\n```none\\r\\nmarkdown\\r\\n//\'#\'\u548C\u6587\u5B57\u4E2D\u95F4\u6709\u7A7A\u683C\uFF01\uFF01\\r\\n//\u6B63\u786E\u793A\u8303\uFF1A# \u9898\u76EE\u63CF\u8FF0\\r\\n//\u9519\u8BEF\u793A\u8303\uFF1A#\u9898\u76EE\u63CF\u8FF0\\r\\n\\r\\n# \u9898\u76EE\u80CC\u666F(\u82E5\u679C\u6709\u9700\u8981\u80FD\u5199\u4E0A)\\r\\n\\r\\n\u8F93\u5165\u4F60\u60F3\u8BF4\u7684\uFF08\u6CE8\u610F\u8DDF\u80CC\u666F\u6709\u5173)\\r\\n\\r\\n# \u9898\u76EE\u63CF\u8FF0\\r\\n\\r\\n\u53D1\u6325\u4F60\u7684\u60F3\u8C61(\u4E0D\u8981\u628A\u8F93\u5165\u8F93\u51FA\u683C\u5F0F\u8BF4\u4E86\uFF0C\\r\\n\u53EA\u8BF4\u4EE3\u7801\u9700\u89E3\u51B3\u7684\u529F\u80FD\u5C31\u53EF\u4EE5\u5566\uFF01\uFF09\\r\\n\\r\\n# \u8F93\u5165\u683C\u5F0F\\r\\n\\r\\n\u8F93\u5165\u5171$\u8F93\u5165\u884C\u6570$\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n# \u8F93\u51FA\u683C\u5F0F\\r\\n\\r\\n\u8F93\u5165\u5171$\u8F93\u51FA\u884C\u6570$\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n# \u8F93\u5165\u8F93\u51FA\u6837\u4F8B\\r\\n\\r\\n## \u8F93\u5165\u6837\u4F8B\\r\\n\\r\\n\\\\```input1\\r\\n\u2026\u2026\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n\\\\```\\r\\n\\r\\n## \u8F93\u51FA\u6837\u4F8B\\r\\n\\r\\n\\\\```output1\\r\\n\u2026\u2026\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n\\\\```\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n\u6700\u540E\u5199\u9898\u63A8\u8350\u5728[HydroOJ](https://hydro.ac/)\u4E0A\u9762\u5199\u9898\uFF0C\u4E00\u6B65\u4E00\u6B65\u6162\u6162\u6765\uFF1A\\r\\n\\r\\n\u7B2C\u4E00\u6B65\uFF09\u521B\u5EFA\u65B9\u6CD5\uFF1A[\u57DF\u521B\u5EFA\u6559\u7A0B](https://hydro.ac/discuss/6172ceeed850d38c79ae18f9)\\r\\n\\r\\n\u7B2C\u4E8C\u6B65\uFF09\u4F7F\u7528\u65B9\u6CD5\uFF1A\u81EA\u5DF1\u7528Github\u8D26\u53F7\u521B\u4E00\u4E2A\u81EA\u5DF1\u7684\u57DF\uFF0C\u4F53\u9A8C\u4E00\u628A\u5F53\u7BA1\u7406\u5458\u7684\u723D\uFF01\u5EFA\u597D\u57DF\u540E\uFF0C\u70B9\u5230\u9898\u5E93\uFF0C\u53F3\u4FA7\u83DC\u5355\u680F\u9009\\"\u521B\u5EFA\u9898\u76EE\\"\uFF0C\u5728\u91CC\u9762\u4F60\u53EF\u4EE5\u73B0\u5199markdown\uFF0C\u8FD8\u8BB0\u5F97\u6587\u7AE0\u5F00\u59CB\u90A3\u4E2A\u94FE\u63A5\u5417\uFF1F\u7528\u91CC\u9762\u7684\u8BED\u6CD5\u628A\u4F60\u60F3\u8981\u7684\u4E1C\u897F\u5448\u73B0\u51FA\u6765\u5C31\u597D\u5566\uFF01\uFF01\\r\\n\\r\\n[\u8BAD\u7EC3 - Turing (qdturing.cn)](https://oj.qdturing.cn/d/W0001/training)\\r\\n\\r\\n[https://oj.qdturing.cn/d/system/](https://oj.qdturing.cn/d/system/) \'\'\' \\r\\n\\r\\n```none\\r\\n::\\r\\n :;J7,:, ::;7:\\r\\n ,ivYi, , ;LLLFS:\\r\\n :iv7Yi :7ri;j5PL\\r\\n ,:ivYLvr ,ivrrirrY2X,\\r\\n :;r@Wwz.7r: :ivu@kexianli.\\r\\n :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur\\r\\n ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17\\r\\n ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i\\r\\n :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv,\\r\\n ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li\\r\\n ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712:\\r\\n ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri\\r\\n , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur:\\r\\n ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv::\\r\\n : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;::\\r\\n , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii\\r\\n , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri:\\r\\n , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7:\\r\\n :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii\\r\\n :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,:::::::\\r\\n i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i::\\r\\n : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::,\\r\\n i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i:\\r\\n : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri::\\r\\n : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::,\\r\\n : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu.,\\r\\n , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii::\\r\\n :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii:\\r\\n ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i,\\r\\n ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i,\\r\\n , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri::\\r\\n :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii:::\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n```none\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ || || || || || || // // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ _ooOoo_ // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ o8888888o // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ 88\\" . \\"88 // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ (| -_- |) // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ O\\\\ = /O // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ ____/`---\'\\\\____ // ////\\r\\n\\\\\\\\\\\\\\\\ .\' \\\\\\\\| |// `. ////\\r\\n//== / \\\\\\\\||| : |||// \\\\ ==\\\\\\\\\\r\\n//== / _||||| -:- |||||- \\\\ ==\\\\\\\\\\r\\n//== | | \\\\\\\\\\\\ - /// | | ==\\\\\\\\\\r\\n//== | \\\\_| \'\'\\\\---/\'\' | | ==\\\\\\\\\\r\\n//== \\\\ .-\\\\__ `-` ___/-. / ==\\\\\\\\\\r\\n//== ___`. .\' /--.--\\\\ `. . ___ ==\\\\\\\\\\r\\n//== .\\"\\" \'< `.___\\\\_<|>_/___.\' >\' \\"\\". ==\\\\\\\\\\r\\n//== | | : `- \\\\`.;`\\\\ _ /`;.`/ - ` : | | \\\\\\\\\\\\\\\\\\r\\n//// \\\\ \\\\ `-. \\\\_ __\\\\ /__ _/ .-` / / \\\\\\\\\\\\\\\\\\r\\n//// ========`-.____`-.___\\\\_____/___.-`____.-\'======== \\\\\\\\\\\\\\\\\\r\\n//// `=---=\' \\\\\\\\\\\\\\\\\\r\\n//// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // \u4F5B\u7956\u4FDD\u4F51 \u6C38\u8FDCAC \u6C38\u4E0D\u4FEE\u6539 \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // // // // || || || || || || || || || || \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430)\\r\\n\\r\\n[https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092)\\r\\n\\r\\n[https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014)\\r\\n\\r\\n[https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015)\\r\\n\\r\\n# \u6CF0\u62C9\u745E\u4E9A\\\\~\\r\\n\\r\\n   \\r\\n\\r\\n[https://oj.qdturing.cn/user/362](https://oj.qdturing.cn/user/362) [https://oj.qdturing.cn/user/27](https://oj.qdturing.cn/user/27)\\r\\n\\r\\n  \\r\\n\\r\\n# \u6BD4\u8D5B\\r\\n\\r\\n1. **10**\\r\\n **2024-4**\\r\\n \\r\\n # [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u5C0F\u5B66\u7EC4](https://oj.qdturing.cn/contest/66163ff3e58c8dbba13b068c)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * 600 \u5C0F\u65F6\\r\\n * 45\\r\\n2. **10**\\r\\n **2024-4**\\r\\n \\r\\n # [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u521D\u4E2D\u7EC4](https://oj.qdturing.cn/contest/66162df2e58c8dbba13af0c8)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * 600 \u5C0F\u65F6\\r\\n * 25\\r\\n3. **31**\\r\\n **2024-3**\\r\\n \\r\\n # [\u56FE\u7075\u4E09\u6708\u6708\u8D5B - \u63D0\u9AD8\u7EC4 \u8D5B\u9898](https://oj.qdturing.cn/contest/66092cff2faa61e7f72a9727)\\r\\n \\r\\n * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm)\\r\\n * 2 \u5C0F\u65F6\\r\\n * 23\\r\\n4. **6**\\r\\n **2024-2**\\r\\n \\r\\n # [2024 \u65B0\u6625\u8D3A\u5C81 \u601D\u7EF4\u6A21\u62DF\u8D5B div.2](https://oj.qdturing.cn/contest/65c10bf5c82e8ec49fdfee00)\\r\\n \\r\\n * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm)\\r\\n * Rated\\r\\n * 3 \u5C0F\u65F6\\r\\n * 28\\r\\n5. **8**\\r\\n **2023-7**\\r\\n \\r\\n # [2023.7.8 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B](https://oj.qdturing.cn/contest/64a8ca1289a4167efe646520)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * Rated\\r\\n * 5 \u5C0F\u65F6\\r\\n * 6\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/contest)\\r\\n\\r\\n# \u4F5C\u4E1A\\r\\n\\r\\n1. **21**\\r\\n **2024-2**\\r\\n \\r\\n # [2024 \u65B0\u6625\u8D3A\u5C81 \u601D\u7EF4\u6A21\u62DF\u8D5B div.2 \u8865\u9898\u573A](https://oj.qdturing.cn/homework/65c2e34cc82e8ec49fe0b120)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **2 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **1 \u4E2A\u6708\u524D**\\r\\n2. **28**\\r\\n **2023-7**\\r\\n \\r\\n # [2023.6.10 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u8D5B](https://oj.qdturing.cn/homework/648985663d3f34cb2cb71939)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **8 \u4E2A\u6708\u524D**\\r\\n3. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.5.27 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u9898\u573A](https://oj.qdturing.cn/homework/64780c42f428fb2d18a6d008)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n4. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023\u5E74 \u5E02\u5317\u533A\u533A\u8D5B - \u521D\u4E2D\u7EC4\u8865\u9898\u573A](https://oj.qdturing.cn/homework/645de3a2eb77954a9afa5a27)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n5. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023\u5E74 \u5E02\u5317\u533A\u533A\u8D5B - \u5C0F\u5B66\u7EC4\u8865\u9898\u573A](https://oj.qdturing.cn/homework/645ddfd2eb77954a9afa56b5)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n6. **29**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.6.3 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u8D5B](https://oj.qdturing.cn/homework/64803c5aa3c4b799f61a0e42)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n7. **5**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.5.20 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u9898\u573A](https://oj.qdturing.cn/homework/646994197e384d7c1691ff34)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n8. **25**\\r\\n **2023-5**\\r\\n \\r\\n # [2023.4.22 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/64488cd3b4bcd970abf6dff1)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n9. **7**\\r\\n **2023-5**\\r\\n \\r\\n # [2023.4.29 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/644d0555604717e00720f3ce)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n10. **29**\\r\\n\\r\\n**2023-4**\\r\\n\\r\\n# [2023.3.25 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/641d43a8453064be228e37b2)\\r\\n\\r\\n* \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n* \u5F00\u59CB\u65F6\u95F4: **1 \u5E74\u524D**\\r\\n* \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/homework)\\r\\n\\r\\n# \u8BAD\u7EC3\\r\\n\\r\\n1. 351\\r\\n \u5DF2\u53C2\u52A0\\r\\n \\r\\n # [\u6D4B\u8BD5\u4E13\u7528\u8BAD\u7EC3](https://oj.qdturing.cn/training/6477fcfbf428fb2d18a6cd82)\\r\\n \\r\\n \u6D4B\u8BD5\u4E13\u7528\u8BAD\u7EC3,\u7528\u4E8E\u65B0\u751F\u6D4B\u8BD5\\r\\n \\r\\n * 5 \u5C0F\u8282, 61 \u9053\u9898\\r\\n * **\u5DF2\u5B8C\u6210 0%**\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/training)\\r\\n\\r\\n# Ranking\\r\\n\\r\\n| \u6392\u540D | \u7528\u6237\u540D | RP | \u4E2A\u4EBA\u7B80\u4ECB |\\r\\n| ------ | -------- | ---- | ---------- |\\r\\n\\r\\n| 1 |  [\u738B\u6CF3\u6743 (Wf\\\\_yjqd)](https://oj.qdturing.cn/user/58) | 2225 | \u6211\u5C31\u770B\u4E0D\u6253\u6BD4\u8D5B\u591A\u4E45\u80FD\u6389\u4E0B Rank 1 | \u62DC\u6708 | RiOI | \u83DC\u72D7 | lyhtql\uFF01| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 |  [\u539F\u6893\u6052 (yzh\\\\_tcl)](https://oj.qdturing.cn/user/157) | 1949 | \u674E\u9038\u822A\u548C\u738B\u6CF3\u6743\u8BF4\u4E86\uFF0C\u4ED6\u4EEC\u53EA\u9700\u8981\u7565\u5FAE\u51FA\u624B\uFF0C\u5C31\u5DF2\u77E5\u8FD9\u4E2A\u5206\u6BB5\u7684\u6781\u9650\u4E86 | | 3 |  [\u674E\u5B89 (Andy\\\\_Li)](https://oj.qdturing.cn/user/126) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 |  [\u674E\u5BB8\u6717 (lcl000000)](https://oj.qdturing.cn/user/427) | 1932 | | | 5 |  [\u4EC7\u5B50\u671F (sevenqiu)](https://oj.qdturing.cn/user/1104) | 1875 | \u6211\u662F\u4E2A\u8001\u516D \u6211\u7231\u86CB\u4ED4 | | 6 |  [\u5F20\u71A0\u747E (WCD.ZYJ)](https://oj.qdturing.cn/user/76) | 1861 | | | 7 |  [\u81E7\u5B87\u8F69 (NaCl\\\\_Fish)](https://oj.qdturing.cn/user/61) | 1809 | [CSDN\u4E3B\u9875Link](https://blog.csdn.net/m0_62680538?type=blog) | | 8 |  [\u5218\u4ED5\u4FCA (liushijun)](https://oj.qdturing.cn/user/898) | 1799 | ***Exploration Never Ends*** | | 9 |  [\u97E9\u627F\u6631 (saixingzhe)](https://oj.qdturing.cn/user/75) | 1783 | \u201C\u662F\u91D1\u5B50\u603B\u4F1A\u53D1\u5149\u201D \u201C\u4F46\u5982\u679C\u6CA1\u6709\u5149\u6E90\uFF0C\u91D1\u5B50\u6C38\u8FDC\u4E0D\u4F1A\u53D1\u5149\u201D # [HCOI \u51FA\u9898\u56E2]([https://www.luog](https://www.luog/)... | | 10 |  [\u9A6C\u6D69\u9E23 (mahaoming)](https://oj.qdturing.cn/user/129) | 1781 | 6\u2026\u2026\u2026\u2026\uFF1F |\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/ranking)\\r\\n\\r\\n# \u8BA8\u8BBA\\r\\n\\r\\n1. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u6E29\u5EA6\u8F6C\u6362\u65E0\u8F93\u5165\u7248\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c9ff993cdee3b59700a#1713061023552)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n2. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u660E\u4E70\u6C34\u679C\u4E94\u65E0\u8F93\u5165\u7248\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c6af993cdee3b596ee6#1713060970292)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n3. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5012\u9709\u7684\u5C0F\u660E\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c3af993cdee3b596dba#1713060922702)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n4. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u77E5\u8BC6](https://oj.qdturing.cn/discuss/661a721bf993cdee3b587229#1713009179189)\\r\\n \\r\\n * [\u6570\u5B66](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6)\\r\\n * 5 \u6B21\u67E5\u770B\\r\\n *  [\u59DC\u5B97\u4F55 (JZH) ](https://oj.qdturing.cn/user/1289)@ **16 \u5C0F\u65F6\u524D**\\r\\n5. 2\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [4\u670811\u65E5\u672A\u6765\u4E4B\u661F\u4F5C\u4E1A\u600E\u4E48\u5199](https://oj.qdturing.cn/discuss/6619ef2387b210d79c0ddce4#1713006555814)\\r\\n \\r\\n * [\u9898\u89E3](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3)\\r\\n * 14 \u6B21\u67E5\u770B\\r\\n *  [\u5D14\u7AE3\u7693 ](https://oj.qdturing.cn/user/1806)@ **16 \u5C0F\u65F6\u524D**\\r\\n6. 1\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [string \u600E\u4E48\u7528getline](https://oj.qdturing.cn/discuss/661919bb87b210d79c0cf318#1712927819286)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 14 \u6B21\u67E5\u770B\\r\\n *  [\u5218\u65ED\u677E (LeoLiu) ](https://oj.qdturing.cn/user/685)@ **1 \u5929\u524D**\\r\\n7. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u51683](https://oj.qdturing.cn/discuss/6617ffee87b210d79c0c1e1b#1712848878082)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 31 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n8. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u51682](https://oj.qdturing.cn/discuss/6617dbff87b210d79c0bea6a#1712839679686)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 26 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n9. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u5168](https://oj.qdturing.cn/discuss/6617da4b87b210d79c0be2bf#1712839243992)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 22 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n10. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u540E\u6094\u5427\uFF0C\u5C11\u5E74\uFF01](https://oj.qdturing.cn/discuss/6617ce2ae58c8dbba13e60bd#1712836138025)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 17 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **2 \u5929\u524D**\\r\\n\\r\\n11. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u53EF\u80FD\u8BA9\u4F60\u540E\u6094\u7684\u4E1C\u4E1C](https://oj.qdturing.cn/discuss/6617b9cde58c8dbba13e1f9a#1712830925828)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 18 \u6B21\u67E5\u770B\\r\\n*  [\u9EC4\u65B0\u4E5F (Hxy0705) ](https://oj.qdturing.cn/user/1142)@ **2 \u5929\u524D**\\r\\n\\r\\n12. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u901A\u5929\u5854](https://oj.qdturing.cn/discuss/6617a5e0e58c8dbba13de3f0#1712837968242)\\r\\n\\r\\n* [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n* 24 \u6B21\u67E5\u770B\\r\\n*  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n\\r\\n13. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u4F60\u597D\uFF0C\u738B\u6668\u5E0C](https://oj.qdturing.cn/discuss/6617a596e58c8dbba13de0b0#1712993715835)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 14 \u6B21\u67E5\u770B\\r\\n*  [\u6731\u7F8E\u83D5 ](https://oj.qdturing.cn/user/1728)@ **20 \u5C0F\u65F6\u524D**\\r\\n\\r\\n14. 2\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u6CA1\u6709\u517Boc\u7684\u4EA4\u6D41\u4E00\u4E0B](https://oj.qdturing.cn/discuss/6617a519e58c8dbba13dd66f#1712969817779)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 13 \u6B21\u67E5\u770B\\r\\n*  [\u738B\u6668\u5E0C (wangchenxi) ](https://oj.qdturing.cn/user/3394)@ **1 \u5929\u524D**\\r\\n\\r\\n15. 3\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [c++\u683C\u5F0F](https://oj.qdturing.cn/discuss/66179f19e58c8dbba13d4a05#1712992786779)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 19 \u6B21\u67E5\u770B\\r\\n*  [\u5D14\u7AE3\u7693 ](https://oj.qdturing.cn/user/1806)@ **20 \u5C0F\u65F6\u524D**\\r\\n\\r\\n16. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [114514114514](https://oj.qdturing.cn/discuss/66168bdee58c8dbba13be42a#1712753630359)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 17 \u6B21\u67E5\u770B\\r\\n*  [\u9AD8\u6668\u7199 (17362259026) ](https://oj.qdturing.cn/user/1224)@ **3 \u5929\u524D**\\r\\n\\r\\n17. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u5927\u4F6C\u4EEC\u4E00\u770B](https://oj.qdturing.cn/discuss/661681d5e58c8dbba13bba65#1712751061541)\\r\\n\\r\\n* [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u521D\u4E2D\u7EC4](https://oj.qdturing.cn/discuss/contest/66162df2e58c8dbba13af0c8)\\r\\n* 20 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **3 \u5929\u524D**\\r\\n\\r\\n18. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u5927\u4F6C\u5417\uFF0C\u70B9\u8FDB\u6765\u770B\u770B](https://oj.qdturing.cn/discuss/6616818ae58c8dbba13bb905#1712823743205)\\r\\n\\r\\n* [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u5C0F\u5B66\u7EC4](https://oj.qdturing.cn/discuss/contest/66163ff3e58c8dbba13b068c)\\r\\n* 22 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **2 \u5929\u524D**\\r\\n\\r\\n19. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u8C01\u6709\u7A7A\uFF1F](https://oj.qdturing.cn/discuss/661664ace58c8dbba13b6a4d#1712743596552)\\r\\n\\r\\n* [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B)\\r\\n* 14 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **3 \u5929\u524D**\\r\\n\\r\\n20. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u8BA8\u8BBA](https://oj.qdturing.cn/discuss/661640ffe58c8dbba13b0a01#1712734472982)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 16 \u6B21\u67E5\u770B\\r\\n*  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **3 \u5929\u524D**\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/discuss)\\r\\n\\r\\n# \u4E00\u8A00\\r\\n\\r\\nCannot get hitokoto.\\r\\n\\r\\n# \u6700\u65B0\u9898\u76EE\\r\\n\\r\\n[**P1183** \u3010\u5165\u95E8\u3011\u53CB\u597D\u6570](https://oj.qdturing.cn/p/P1183)1 \u5468\u524D\\r\\n\\r\\n[**zs024** \u5C0FZ\u7684\u5207\u9664\u6811](https://oj.qdturing.cn/p/zs024)1 \u5468\u524D\\r\\n\\r\\n[**zs023** \u5C0F\u6768\u7684\u65C5\u6E38](https://oj.qdturing.cn/p/zs023)1 \u5468\u524D\\r\\n\\r\\n[**zs022** \u5C0FS\u7684\u5B50\u6570\u7EC4\u548C](https://oj.qdturing.cn/p/zs022)1 \u5468\u524D\\r\\n\\r\\n[**zs021** \u5C0FB\u7684\u6392\u5217\u6570\u7EC4](https://oj.qdturing.cn/p/zs021)1 \u5468\u524D\\r\\n\\r\\n[**zs020** \u5C0FA\u7684\u6392\u5E8F\u6570\u7EC4](https://oj.qdturing.cn/p/zs020)1 \u5468\u524D\\r\\n\\r\\n[**zs019** \u8FF7\u5BAB\u7EDF\u8BA1](https://oj.qdturing.cn/p/zs019)1 \u5468\u524D\\r\\n\\r\\n[**zs24414** \u5151\u6362\u8D27\u5E01](https://oj.qdturing.cn/p/zs24414)1 \u5468\u524D\\r\\n\\r\\n[**zs24413** n\u91CD\u4E32](https://oj.qdturing.cn/p/zs24413)1 \u5468\u524D\\r\\n\\r\\n[**zs24411** \u8BA8\u4F10\u5DE8\u9F99\u7684\u5C0F\u961F](https://oj.qdturing.cn/p/zs24411)1 \u5468\u524D\\r\\n\\r\\n# \u641C\u7D22\\r\\n\\r\\n[ ] \u641C\u7D22\\r\\n\\r\\n# \u8BA8\u8BBA\u8282\u70B9\\r\\n\\r\\n* ## \u63A2\u7D22\\r\\n \\r\\n 1. [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n 2. [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n 3. [\u9898\u89E3](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3)\\r\\n* ## \u5728\u7EBF\u9898\u5E93\\r\\n \\r\\n 1. [CodeForces](https://oj.qdturing.cn/discuss/node/CodeForces)\\r\\n 2. [TopCoder](https://oj.qdturing.cn/discuss/node/TopCoder)\\r\\n 3. [POJ](https://oj.qdturing.cn/discuss/node/POJ)\\r\\n 4. [BZOJ](https://oj.qdturing.cn/discuss/node/BZOJ)\\r\\n 5. [USACO](https://oj.qdturing.cn/discuss/node/USACO)\\r\\n 6. [RQNOJ](https://oj.qdturing.cn/discuss/node/RQNOJ)\\r\\n 7. [UOJ](https://oj.qdturing.cn/discuss/node/UOJ)\\r\\n 8. [LOJ](https://oj.qdturing.cn/discuss/node/LOJ)\\r\\n 9. [\u6D1B\u8C37](https://oj.qdturing.cn/discuss/node/%E6%B4%9B%E8%B0%B7)\\r\\n* ## \u6CDB\\r\\n \\r\\n 1. [\u6570\u5B66](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6)\\r\\n 2. [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B)\\r\\n 3. [Python](https://oj.qdturing.cn/discuss/node/Python)\\r\\n 4. [Julia](https://oj.qdturing.cn/discuss/node/Julia)\\r\\n 5. [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n 6. [\u4FDD\u9001](https://oj.qdturing.cn/discuss/node/%E4%BF%9D%E9%80%81)\\r\\n\\r\\n# \u63A8\u8350\\r\\n\\r\\n* ## \u4E2D\u6587\\r\\n \\r\\n 1. [LibreOJ](https://loj.ac/)\\r\\n 2. [\u6D1B\u8C37](https://www.luogu.com.cn/)\\r\\n 3. [UOJ](https://uoj.ac/)\\r\\n 4. [CometOJ](https://www.cometoj.com/)\\r\\n 5. [Vijos](https://vijos.org/)\\r\\n* ## English\\r\\n \\r\\n 1. [Codeforces](https://codeforces.com/)\\r\\n 2. [AtCoder](https://atcoder.jp/)\\r\\n 3. [CodeChef](https://www.codechef.com/)\\r\\n 4. [SPOJ](https://www.spoj.com/)\\r\\n 5. [TopCoder](https://www.topcoder.com/)\\r\\n 6. [OnlineJudge](https://onlinejudge.org/)\\r\\n* ## \u5DE5\u5177\\r\\n \\r\\n 1. [OIerDb](https://oier.baoshuo.dev/)\\r\\n\\r\\n# \u72B6\u6001\\r\\n\\r\\n* [\u8BC4\u6D4B\u961F\u5217](https://oj.qdturing.cn/record)\\r\\n* [\u670D\u52A1\u72B6\u6001](https://oj.qdturing.cn/status)\\r\\n\\r\\n# \u5F00\u53D1\\r\\n\\r\\n* [\u5F00\u6E90](https://github.com/hydro-dev/Hydro)\\r\\n* [API](https://oj.qdturing.cn/api)\\r\\n\\r\\n# \u652F\u6301\\r\\n\\r\\n* [\u5E2E\u52A9](https://oj.qdturing.cn/wiki/help)\\r\\n* [QQ \u7FA4](https://oj.qdturing.cn/wiki/about#contact)\\r\\n\\r\\n1. [\u5173\u4E8E](https://oj.qdturing.cn/wiki/about)\\r\\n2. [\u8054\u7CFB\u6211\u4EEC](https://oj.qdturing.cn/wiki/about#contact)\\r\\n3. [\u9690\u79C1](https://oj.qdturing.cn/wiki/about#privacy)\\r\\n4. [\u670D\u52A1\u6761\u6B3E](https://oj.qdturing.cn/wiki/about#tos)\\r\\n5. [\u7248\u6743\u7533\u8BC9](https://oj.qdturing.cn/wiki/about#contact)\\r\\n6. Language\\r\\n7. [\u517C\u5BB9\u6A21\u5F0F](https://oj.qdturing.cn/legacy?legacy=true)\\r\\n8. \u4E3B\u9898\\r\\n9. \\r\\n10. \\r\\n11. \\r\\n12. Worker 0, 38ms\\r\\n13. Powered by [Hydro v4.11.2](https://hydro.js.org/) Community\\r\\n\\r\\n\u5728\u8FD9\u5BCC\u88D5\u7684\u5E74\u4EE3\uFF0C\u8BD7\u4EBA\u4F55\u4E3A\uFF1F \u53EF\u662F\uFF0C\u4F60\u5374\u8BF4\uFF0C\u8BD7\u4EBA\u662F\u9152\u795E\u795E\u5723\u7684\u796D\u53F8\uFF0C \u5728\u795E\u5723\u7684\u9ED1\u591C\u4E2D\uFF0C\u4ED6\u8D70\u904D\u5927\u5730\u3002\\r\\n\\r\\n\u6211\u547D\u7531\u6211\u4E0D\u7531\u5929\uFF0C\u5434\u94A9\u5F2F\uFF0C\u5C55\u950B\u5BD2\u3002\\r\\n\\r\\n\u7EA2\u5C18\u5F80\u4E8B\u4ED8\u6D41\u6C34\uFF0C\u5FD8\u5C3D\u4FD7\u7F18\u59CB\u5F97\u771F\uFF0C\u4E00\u996E\u800C\u5C3D\uFF0C\u518D\u9189\u5343\u5E74\uFF01\\r\\n\\r\\n\u60CA\u6D9B\u5165\u6D77\u89C5\u87AD\u864E\uFF0C\u98CE\u96EA\u5F52\u5C71\u65A9\u5996\u90AA\u3002\\r\\n\\r\\n\u843D\u5CF0\u957F\u65E5\u5760\uFF0C\u8D77\u7B14\u53E0\u5D82\u5347\u3002\\r\\n\\r\\n[https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif)\\r\\n\\r\\n[https://neave.com/](https://neave.com/)\\r\\n\\r\\n[https://classic.minecraft.net/](https://classic.minecraft.net/)\\r\\n\\r\\n[http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/)\\r\\n\\r\\n[http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/)\\r\\n\\r\\n[https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound)\\r\\n\\r\\n[https://yiyan.baidu.com/](https://yiyan.baidu.com/)\\r\\n\\r\\n[https://www.bilibili.com/](https://www.bilibili.com/)\\r\\n\\r\\n[https://oj.qdturing.cn/first\\\\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F)\\r\\n\\r\\n1. \u6E05\u5E73\u4E50\xB7\u6751\u5C45\\r\\n\\r\\n---\\r\\n\\r\\n\u3010\u5B8B\u3011\u8F9B\u5F03\u75BE \u8305\u623F\u4F4E\u5C0F\uFF0C\u81ED\u5F97\u4E0D\u5F97\u4E86\u3002\u9189\u91CC\u5434\u97F3\u76F8\u5A9A\u597D\uFF0C\u767D\u53D1\u8C01\u5BB6\u7FC1\u5AAA\uFF1F\u5927\u513F\u9504\u8C46\u5931\u8E2A\uFF0C\u4E2D\u513F\u88AB\u56F0\u9E21\u7B3C\u3002\u6700\u559C\u5C0F\u513F\u4EA1\u8D56\uFF0C\u6EAA\u5934\u62D0\u5356\u513F\u7AE5\u3002\\r\\n\\r\\n---\\r\\n\\r\\n\u9759\u591C\u601D \u3010\u5510\u3011\u674E\u767D \u5E8A\u524D\u660E\u6708\u5149\uFF0C \u674E\u767D\u7761\u7684\u9999\u3002 \u68A6\u89C1\u68D2\u68D2\u7CD6\uFF0C \u53E3\u6C34\u4E09\u5343\u4E08\u3002\\r\\n\\r\\n---\\r\\n\\r\\n\uFF08\u4E0A\u6587\uFF1A\u6539\u7F16\uFF0C\u4E0B\u6587:\u81EA\u7F16\uFF09\\r\\n\\r\\n---\\r\\n\\r\\n\u5395\u6240\uD83D\uDEBE \u534A\u591C\u4E09\u66F4\uFF0C\u5395\u6240\u6CA1\u706F\u3002 \u4F60\u4E0A\u5395\u6240\uFF0C\u6389\u8FDB\u8305\u5751\u3002 \u6FC0\u70C8\u6597\u4E89\uFF0C\u58EE\u70C8\u727A\u7272\u3002 \u4E3A\u7EAA\u5FF5\u4F60\uFF0C\u5395\u6240\u88C5\u706F\u3002\\r\\n\\r\\n---\\r\\n\\r\\n```none\\r\\n\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/user/972)\\r\\n\\r\\n\u8001\u9AA5\u4F0F\u67A5\uFF0C\u5FD7\u5728\u5343\u91CC\u3002\u6A2A\u626B\u9965\u997F\uFF0C\u505A\u56DE\u81EA\u5DF1\u3002 \u4EF0\u5929\u5927\u7B11\u51FA\u95E8\u53BB\uFF0C\u5F52\u6765\u501A\u6756\u81EA\u53F9\u606F\u3002 \u5782\u6B7B\u75C5\u4E2D\u60CA\u5750\u8D77\uFF0C\u7B11\u95EE\u5BA2\u4ECE\u4F55\u5904\u6765\u3002 \u5341\u5E74\u751F\u6B7B\u4E24\u832B\u832B\uFF0C\u559C\u7F8A\u7F8A\u4E0E\u7070\u592A\u72FC\u3002 \u8FDC\u8D74\u4EBA\u95F4\u60CA\u9E3F\u5BB4\uFF0C\u9B3C\u5200\u4E00\u5F00\u770B\u4E0D\u89C1\u3002 \u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5BF9\u955C\u8D34\u82B1\u9EC4\u3002 \u4E00\u671D\u88AB\u86C7\u54AC\uFF0C\u5904\u5904\u95FB\u557C\u9E1F\u3002 \u67AF\u85E4\u8001\u6811\u660F\u9E26\uFF0C\u4E0A\u73ED\u6478\u9C7C\u56DE\u5BB6\uFF01 \u8BFB\u4E66\u7834\u4E07\u5377\uFF0C\u5377\u5377\u6709\u7237\u540D\u3002 \u60C5\u4E0D\u77E5\u6240\u8D77\uFF0C\u4E00\u5F80\u60C5\u6DF1\uFF0C\u518D\u800C\u8870\uFF0C\u4E09\u800C\u7AED\u3002 \u5929\u5802\u6709\u8DEF\u4F60\u4E0D\u8D70\uFF0C\u5B66\u6D77\u65E0\u6DAF\u82E6\u4F5C\u821F\u3002 \u5C11\u5C0F\u79BB\u5BB6\u8001\u5927\u56DE\uFF0C\u5B89\u80FD\u8FA8\u6211\u662F\u96C4\u96CC\u3002 \u5DF4\u5C71\u695A\u6C34\u51C4\u51C9\u5730\uFF0C\u871C\u96EA\u51B0\u57CE\u751C\u871C\u871C\u3002 \u543E\u8F88\u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5403\u4E2A\u6843\u6843\u597D\u51C9\u51C9\u3002 \u4EAC\u4E2D\u6709\u5584\u53E3 J \u8005\uFF0C\u4ECE\u6B64\u541B\u738B\u4E0D\u65E9\u671D\u3002\\r\\n\\r\\n\u5B9D\u85CF\\r\\n\\r\\nnone #include<windows.h> using namespace std; int main(){ system(\\"A 10\\");\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/user/972)\\r\\n\\r\\n| 1 | 2 | 3 |\\r\\n| ------ | --- | --- |\\r\\n| baga | |\\r\\n| |\\r\\n\\r\\n[https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru)\\r\\n\\r\\n[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)\\r\\n\\r\\n[https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif)\\r\\n\\r\\n[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)\\r\\n\\r\\n[https://sr.mihoyo.com/](https://sr.mihoyo.com/)\\r\\n\\r\\n\u6211\u542C\u5230\u4E86\u3010\u751F\u751F\u4E0D\u606F\u3011\u7684\u6FC0\u8361\uFF0C\u542C\u5230\u4E86\u3010\u5929\u884C\u5065\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7834\u4E07\u6CD5\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u66FF\u7F6A\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u547C\u5524\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u79BB\u6790\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u53CC\u751F\u82B1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7206\u71C3\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u5F3A\u8FD0\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u63A2\u56CA\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u8DC3\u8FC1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u52B2\u98CE\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u4F20\u97F3\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u8D64\u708E\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u4E0D\u706D\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u6FC0\u53D1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u9B42\u8FC1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7075\u55C5\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u593A\u9B42\u9B44\u3011\u7684\u56DE\u54CD\u3002\\r\\n\\r\\n~~ctrl+c\u662F\u4E2A\u597D\u4E1C\u897F~~\\r\\n\\r\\n~~\u6700\u5B89\u53F2\u4E4B\u4E71~~ \u6700\u6709\u5E72\u8D27\u7684\u4E00\u96C6\\r\\n\\r\\n# \u60A8\u662F\u7B2C114514\u4E2A\u6765\u53C2\u89C2\u7684\u4EBA\\r\\n\\r\\n\\r\\n\\r\\n         \\r\\n\\r\\n  [\u6362\u4E00\u6279](https://oj.qdturing.cn/d/Neptune/user/2796)\\r\\n\\r\\n\\r\\n\\r\\n```none\\r\\n\u4F60\u2026\u2026\\r\\n\u5C45\u7136\u770B\u5B8C\u4E86\uFF1F\uD83C\uDF1A\\r\\n*\u4E0B\u9762\u6CA1\u6709\u4E1C\u897F\u4E86\uD83D\uDC47**\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n## **\u4FE1\u5965\u6BD4\u8D5B**\\r\\n\\r\\n\u200B**OI**\u200B(Olympiad Informatics)\uFF1A\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\\r\\n\\r\\n\u200B**OIer**\u200B\uFF1A\u53C2\u52A0\u4FE1\u606F\u5B66\u5965\u8D5B\u7684\u9009\u624B\\r\\n\\r\\n\u200B**OJ**\u200B(Online Judge)\uFF1A\u5728\u7EBF\u5224\u9898\u7CFB\u7EDF\\r\\n\\r\\n**CSP-J/S** \uFF1A\u7531 CCF \u4E3B\u529E\u7684\u8BA1\u7B97\u673A\u975E\u4E13\u4E1A\u7EA7\u522B\u7684\u8F6F\u4EF6\u80FD\u529B\u8BA4\u8BC1\u3002\u8BA4\u8BC1\u5305\u62EC CSP-J\uFF08Junior\uFF0C\u5165\u95E8\u7EA7\uFF09\u548C CSP-S\uFF08Senior\uFF0C\u63D0\u9AD8\u7EA7\uFF09\u4E24\u4E2A\u7EA7\u522B\uFF0C\u8BA4\u8BC1\u5185\u5BB9\u5747\u5305\u62EC\u7B97\u6CD5\u8BBE\u8BA1\u80FD\u529B\u548C\u7F16\u7A0B\u80FD\u529B\u3002\\r\\n\\r\\n\u200B**NOIP**\u200B\uFF1A\u5168\u56FD\u9752\u5C11\u5E74\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u8054\u8D5B(National Olympiad in Informatics in Provinces)\u3002\u540C\u4E00\u65F6\u95F4\u3001\u4E0D\u540C\u5730\u70B9\u4EE5\u5404\u7701\u5E02\u4E3A\u5355\u4F4D\u7531\u7279\u6D3E\u5458\u7EC4\u7EC7\u3002\u5168\u56FD\u7EDF\u4E00\u5927\u7EB2\u3001\u7EDF\u4E00\u8BD5\u5377\u3002\\r\\n\\r\\n\u200B**NOI\u7701\u9009**\u200B\uFF1A\u6BCF\u5E74 NOI \u4E3E\u529E\u4E4B\u524D\uFF0C\u5404\u7701\u9700\u5206\u7701\u8FDB\u884C\u7701\u4EE3\u8868\u961F\u9009\u62D4\uFF0C\u4ECE\u800C\u786E\u5B9A\u54EA\u4E9B\u9009\u624B\u83B7\u5F97\u672C\u7701\u53C2\u52A0 NOI \u7684\u540D\u989D\u3002\\r\\n\\r\\n\u200B**NOI**\u200B\uFF1A\u5168\u56FD\u9752\u5C11\u5E74\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\uFF0C\u5373\u56FD\u8D5B\u3002\\r\\n\\r\\n\u200B**CTSC**\u200B\uFF1A\u56FD\u5BB6\u961F\u9009\u62D4\u6BD4\u8D5B\uFF0C\u9009\u51FA\u53C2\u52A0IOI\u7684\u56FD\u5BB6\u961F\u7684\u6BD4\u8D5B\u3002\\r\\n\\r\\n\u200B**IOI**\u200B\uFF1A\u56FD\u9645\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\uFF0C\u5168\u7403\u7684\u6BD4\u8D5B\uFF0COI\u6700\u9AD8\u8363\u8A89\\r\\n\\r\\n## **\u6BD4\u8D5B\u7ED3\u679C**\\r\\n\\r\\n**\u4E00\u9053\u9898\u76EE\u63D0\u4EA4\u540E\uFF0C\u53EF\u80FD\u5F97\u5230\u4E24\u4E2A\u7ED3\u679C\uFF1A**\\r\\n\\r\\n\u200B**AC**\u200B\uFF1AAccepted \u7B54\u6848\u6B63\u786E/\u901A\u8FC7\\r\\n\\r\\n\u200B**WA**\u200B\uFF1AWrong Answer \u7B54\u6848\u9519\u8BEF\\r\\n\\r\\n**\u9664\u6B64\u4E4B\u5916\u8FD8\u6709\u66F4\u591A\u7684\u72B6\u6001\u7F29\u5199\uFF1A**\\r\\n\\r\\n\u200B**UKE**\u200B\uFF1AUnknown Error \u672A\u77E5\u9519\u8BEF\\r\\n\\r\\n\u200B**RE**\u200B\uFF1ARuntime Error \u8FD0\u884C\u65F6\u9519\u8BEF\\r\\n\\r\\n\u200B**CE**\u200B\uFF1AComplie Error \u7F16\u8BD1\u9519\u8BEF\uFF0C\u8BED\u6CD5\u6709\u95EE\u9898\\r\\n\\r\\n\u200B**PE**\u200B\uFF1APresentation Error \u683C\u5F0F\u9519\u8BEF\\r\\n\\r\\n\u200B**TLE**\u200B\uFF1ATime Limit Exceed \u8D85\u51FA\u65F6\u95F4\u9650\u5236\uFF0C\u9700\u8981\u4F18\u5316\u4F60\u7684\u7B97\u6CD5\\r\\n\\r\\n\u200B**MLE**\u200B\uFF1AMemory Limit Exceed \u8D85\u51FA\u5185\u5B58\u9650\u5236\\r\\n\\r\\n\u200B**OLE**\u200B\uFF1AOutput Limit Exceed \u8F93\u51FA\u8D85\u51FA\u9650\u5236\\r\\n\\r\\n## **\u4FE1\u5965\u505A\u9898\u6280\u5DE7**\\r\\n\\r\\n\u200B**\u9A97\u5206**\u200B\uFF1A\u5C31\u662F\u7528\u4E0D\u662F\u6B63\u89E3\u7684\u7A0B\u5E8F\uFF08\u4FDD\u8BC1\u6211\u4EEC\u80FD\u8F7B\u677E\u641E\u5B9A\u7684\u7A0B\u5E8F\uFF09\uFF0C\u5C3D\u53EF\u80FD\u591A\u5F97\u9A97\u53D6\u5206\u6570\u3002\\r\\n\\r\\n\u200B**\u66B4\u529B\u89E3\u9898**\u200B\uFF1A\u672C\u8D28\u662F\u5217\u4E3E\u6CD5\uFF1B\u5C31\u7406\u8BBA\u4E0A\u800C\u8A00\uFF0C\u5B83\u53EF\u4EE5\u89E3\u51B3\u6240\u6709\u95EE\u9898\uFF0C\u53EA\u662F\u65F6\u95F4\u7684\u957F\u77ED\u95EE\u9898\u7F62\u4E86\u3002\u4F46\u5BF9\u4E8E\u201C\u66B4\u529B\u6C42\u89E3\u6CD5\u201D\u4E5F\u662F\u53EF\u4EE5\u8FDB\u884C\u4F18\u5316\u7684\uFF0C\u6211\u4EEC\u59D1\u4E14\u79F0\u4F18\u5316\u540E\u7684\u201C\u66B4\u529B\u6C42\u89E3\u6CD5\u201D\u4E3A\u201C\u5DE7\u66B4\u201D\u3002\\r\\n\\r\\n\u5177\u4F53\u7684\u64CD\u4F5C\u65B9\u6CD5\u5C31\u662F\u5145\u5206\u5229\u7528\u7EA6\u675F\u6761\u4EF6\uFF0C\u4EE5\u7F29\u5C0F\u7B97\u6CD5\u8BA1\u7B97\u7684\u8303\u56F4\u3002\\r\\n\\r\\n\uFF081\uFF09\u5229\u7528\u9898\u76EE\u4E2D\u7684\u7B49\u5F0F\u6761\u4EF6\\r\\n\\r\\n\uFF082\uFF09\u5229\u7528\u9898\u76EE\u4E2D\u7684\u4E0D\u7B49\u5F0F\u6761\u4EF6\uFF0C\u8FDB\u884C\u6570\u5B66\u4E2D\u4E0D\u7B49\u5F0F\u7684\u7F29\u653E\\r\\n\\r\\n\u200B**\u5BF9\u62CD**\u200B\uFF1A\u7528\u4E00\u4E2A\u7B80\u5355\u7684\u7A0B\u5E8F\u53BB\u68C0\u6D4B\u4E00\u4E2A\u590D\u6742\u7684\u7A0B\u5E8F\u3002\u7B80\u5355\u7684\u8BF4\u5C31\u662F\u5F53\u4F60\u5199\u5B8C\u4E00\u4E2A\u9898\u76EE\u7684\u7A0B\u5E8F\u4EE5\u540E\uFF0C\u518D\u5199\u4E00\u4E2A\u66B4\u529B\u6C42\u89E3\u8BE5\u9898\u76EE\u7684\u7A0B\u5E8F\uFF0C\u7136\u540E\u81EA\u5DF1\u751F\u6210\u4E00\u4E9B\u6D4B\u8BD5\u6570\u636E\uFF0C\u770B\u540C\u6837\u7684\u6570\u636E\uFF0C\u4E24\u4E2A\u7A0B\u5E8F\u8F93\u51FA\u7684\u7ED3\u679C\u662F\u5426\u76F8\u540C\uFF0C\u4E0D\u540C\u610F\u5473\u7740\u88AB\u5BF9\u62CD\u7684\u7A0B\u5E8F\u6709\u95EE\u9898\u3002\u4EE5\u6B64\u6765\u5E2E\u52A9\u4F60\u4FEE\u6539\u7A0B\u5E8F\uFF0C\u63D0\u9AD8\u901A\u8FC7\u7387\u7684\u65B9\u6CD5\uFF0C\u6211\u4EEC\u79F0\u4E3A\u5BF9\u62CD\u3002\\r\\n\\r\\n## **\u4FE1\u5965\u9009\u624B\u5F3A\u5F31**\\r\\n\\r\\n\u200B**\u849F\u84BB**\u200B\uFF1A\u5DE8\u5F31\u7684\u8C10\u97F3\uFF0C\u7528\u4E8EOIer\u81EA\u8C26\uFF0C\u51E0\u4E4E\u6240\u6709\u4EBA\uFF08\u54EA\u6015\u662F\u5927\u4F6C\uFF09\u90FD\u4F1A\u7528\u8FD9\u4E2A\u8BCD\u79F0\u547C\u81EA\u5DF1\u3002\\r\\n\\r\\n\u200B**\u795E\u7287**\u200B\uFF1A\u5373\u5F88\u5389\u5BB3\u7684\u5927\u725B\\r\\n\\r\\n\u200B**AK**\u200B\uFF1A\u5728\u4E00\u6B21\u6BD4\u8D5B\u91CCAC\u4E86\u6240\u6709\u9898\\r\\n\\r\\n\u200B**\u7206\u96F6**\u200B\uFF1A\u5728\u4E00\u6B21\u6BD4\u8D5B\u4E2D\u559C\u63D00\u5206\\r\\n\\r\\n\u4EC0\u4E48\u4F60\u5C45\u7136\u770B\u5B8C\u4E86\uFF1F*\uD83C\uDF1A*\\r\\n\\r\\n\u7262\u5927\u65F6\u95F4 *\uD83C\uDF1A* \u554A\u7262\u5927\u522B\u8098\u51FB\u6211\uD83D\uDE2B\uD83D\uDCAA\uD83C\uDFFF\uD83D\uDC68\uD83C\uDFFF\u200D\uD83E\uDDB2\u5B69\u5B50\u4EEC\u8FD9\u5E76\u4E0D\u597D\u7B11\\r\\n\\r\\nIt\'s been a long day without you my friend\\r\\n\\r\\nAnd I\'ll tell you all about it when I see you again\\r\\n\\r\\nWe\'ve come a long way from where we began\\r\\n\\r\\nOh I\'ll tell you all about it when I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\nDamn who knew all the planes we flew\\r\\n\\r\\nGood things we\'ve been through\\r\\n\\r\\nThat I\'ll be standing right here\\r\\n\\r\\nTalking to you about another path\\r\\n\\r\\nI know we loved to hit the road and laugh\\r\\n\\r\\nBut something told me that it wouldn\'t last\\r\\n\\r\\nHad to switch up look at things different see the bigger picture\\r\\n\\r\\nThose were the days hard work forever pays\\r\\n\\r\\nNow I see you in a better place\\r\\n\\r\\nNow I see you in a better place\\r\\n\\r\\nHow could we not talk about family\\r\\n\\r\\nwhen family\'s all that we got?\\r\\n\\r\\nEverything I went through you were standing there by my side\\r\\n\\r\\nAnd now you gonna be with me for the last ride\\r\\n\\r\\nIt\'s been a long day without you my friend\\r\\n\\r\\nAnd I\'ll tell you all about it when I see you again\\r\\n\\r\\nWe\'ve come a long way from where we began\\r\\n\\r\\nOh I\'ll tell you all about it when I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\n\u4EC0\u4E48\u2193\u2191\\r\\n\\r\\n\u4F60\u5C45\u7136\u53C8\u770B\u5B8C\u4E86\uFF1F*\uD83C\uDF1A*\\r\\n\\r\\n\u7262\u5927\u5FEB\u8098\u51FB\u5B83 \uD83D\uDCA9\uD83D\uDCAA\uD83C\uDFFF\uD83D\uDC68\uD83C\uDFFF\u200D\uD83E\uDDB2\\r\\n\\r\\n@\u4F20\u5947\u673A\u957F\u4F50\u5DF4\u626C\\r\\n\\r\\n* **Waiting** \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u6B63\u5728\u7B49\u5F85\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\\r\\n* **Fetched** \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u5DF2\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\uFF0C\u6B63\u5728\u51C6\u5907\u5F00\u59CB\u8BC4\u6D4B\\r\\n* **Compiling** \u8BC4\u6D4B\uFF1A\u6B63\u5728\u7F16\u8BD1\u4E2D\\r\\n* **Judging** \u8BC4\u6D4B\uFF1A\u7F16\u8BD1\u6210\u529F\uFF0C\u6B63\u5728\u8BC4\u6D4B\u4E2D\\r\\n* **Accepted** \u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u5B8C\u5168\u6B63\u786E\\r\\n* **Wrong Answer** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u4E0E\u6807\u51C6\u7B54\u6848\u4E0D\u4E00\u81F4\uFF08\u4E0D\u5305\u62EC\u884C\u672B\u7A7A\u683C\u4EE5\u53CA\u6587\u4EF6\u672B\u7A7A\u884C\uFF09\\r\\n* **Time Limit Exceeded** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236\\r\\n* **Memory Limit Exceeded** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u5185\u5B58\u7A7A\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236\\r\\n* **Runtime Error** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u9519\u8BEF\uFF08\u5982\u6570\u7EC4\u8D8A\u754C\u3001\u88AB\u96F6\u9664\u3001\u8FD0\u7B97\u6EA2\u51FA\u3001\u6808\u6EA2\u51FA\u3001\u65E0\u6548\u6307\u9488\u7B49\uFF09\\r\\n* **Compile Error** \u4E0D\u901A\u8FC7\uFF1A\u7F16\u8BD1\u5931\u8D25\\r\\n* **System Error** \u9519\u8BEF\uFF1A\u7CFB\u7EDF\u9519\u8BEF\uFF08\u5982\u679C\u60A8\u9047\u5230\u6B64\u95EE\u9898\uFF0C\u8BF7\u53CA\u65F6\u5728\u8BA8\u8BBA\u533A\u8FDB\u884C\u53CD\u9988\uFF09\\r\\n* **Canceled** \u5176\u4ED6\uFF1A\u8BC4\u6D4B\u88AB\u53D6\u6D88\\r\\n* **Unknown Error** \u5176\u4ED6\uFF1A\u672A\u77E5\u9519\u8BEF\\r\\n* **Ignored** \u5176\u4ED6\uFF1A\u88AB\u5FFD\u7565\\r\\n\\r\\n> \u6709\u201C\u6210\u7EE9\u53D6\u6D88\u201D\u5B57\u6837\u5219\u8BF4\u660E\u7BA1\u7406\u5458\u624B\u52A8\u6807\u8BB0\u6B64\u8BB0\u5F55\u4E3A\u53D6\u6D88\uFF0C\u53EF\u80FD\u8FDD\u53CD\u4E86\u670D\u52A1\u6761\u6B3E\uFF0C\u6BD4\u5982\u4EE3\u7801\u88AB\u53D1\u73B0\u4E0E\u5176\u4ED6\u7528\u6237\u7684\u4EE3\u7801\u5341\u5206\u76F8\u4F3C\u3002\\r\\n\\r\\n**\u88F8\u5BB9\u91CF\uFF08Raw Capacity\uFF09** - \u786C\u76D8\u7684\u539F\u59CB\u5BB9\u91CF\u603B\u548C\uFF0C\u6BD4\u5982\u670910\u575710TB\u7684\u786C\u76D8\uFF0C\u90A3\u88F8\u5BB9\u91CF\u5C31\u662F10\\\\*10TB=100TB **\u53EF\u7528\u5BB9\u91CF\uFF08Usable Capacity/u\uFF09** - \u524D\u7AEF\u80FD\u591F\u770B\u5230\u7684\u5BB9\u91CF\uFF0C\u9664\u5F00\u4E86RAID\u548C\u7CFB\u7EDF\u5F00\u9500\u7684\u5BB9\u91CF\uFF0C\u6BD4\u598210\\\\*10TB\u786C\u76D8\uFF0C\u7EC4\u4E86\u4E2A9+1\u7684RAID 5\uFF0C\u90A3\u7406\u8BBA\u4E0A\u53EF\u7528\u5BB9\u91CF\u5E94\u8BE5\u4E3A90TB\uFF0C\u4F46\u662F\u4E00\u822C\u5B58\u50A8\u9635\u5217\u8FD8\u6709\u7CFB\u7EDF\u5F00\u9500\uFF0C\u4E0D\u540C\u5382\u5BB6\u4E0D\u540C\u578B\u53F7\u5F00\u9500\u4E0D\u540C\uFF0C\u6240\u4EE5\u6700\u7EC8\u7684\u53EF\u7528\u5BB9\u91CF\u4E5F\u4E0D\u4E00\u6837\uFF0C\u6709\u53EF\u80FD70TB\uFF0C\u4E5F\u53EF\u80FD80TB\u3002\u53E6\u5916\uFF0C\u53EF\u7528\u5BB9\u91CF\u4E5F\u53EF\u4EE5\u5728\u540E\u9762\u8DDF\u4E00\u4E2A**\u5C0F\u5199u**\u6765\u8868\u793A\uFF0C\u6BD4\u5982100TBu\uFF0C\u5C31\u8868\u793A100TB\u53EF\u7528\u5BB9\u91CF\u200B**\u6709\u6548\u5BB9\u91CF\uFF08Effective Capacity/e\uFF09**\u200B- \u91C7\u7528\u5728\u7EBF\u6570\u636E\u5220\u51CF\u6280\u672F\uFF08\u91CD\u5220deduplication/\u538B\u7F29compression\u4E4B\u540E\uFF09\u53EF\u4E3A\u524D\u7AEF\u63D0\u4F9B\u7684\u201C\u7B49\u6548\u201D\u5BB9\u91CF\u3002\u6BD4\u5982\u67D0\u6574\u5217\u80FD\u63D0\u4F9B3:1\u7684\u6570\u636E\u5220\u51CF\u6BD4\uFF0C\u6B64\u65F6100TBu\u5C31\u76F8\u5F53\u4E8E\u80FD\u5B58300TB\u7684\u6570\u636E\uFF0C\u6240\u4EE5\u6709\u6548\u5BB9\u91CF\u5C31\u662F300TB\u3002\u6709\u6548\u5BB9\u91CF\u4E5F\u53EF\u4EE5\u5728\u540E\u9762\u8DDF\u4E00\u4E2A**\u5C0F\u5199e**\u8868\u793A\uFF0C300TBe\u8868\u793A300TB\u6709\u6548\u5BB9\u91CF\u3002\\r\\n\\r\\n**TB,TiB, GB,GiB, MB, MiB, KB, KiB** \u7B80\u5355\u5F97\u8BF4 TB,GB\u8FD9\u4E9B\u662F1000\u8FDB\u5236\uFF0C1TB=1000 GB TiB GiB\u8FD9\u4E9B\u662F1024\u8FDB\u5236\uFF0C1TiB = 1024GiB TiB\u548CTB\u4E4B\u95F4\u6362\u7B97\uFF1A 1TiB = 1.099511627776 TB \uFF08\u5177\u4F53\u6362\u7B97\u8FC7\u7A0B\u5C31\u4E0D\u5199\u4E86\uFF0C\u81EA\u5DF1\u62FF\u4E2A\u5C0F\u672C\u672C\u7B97\uFF09 TB\uFF08Terabyte\uFF09 \u662F\u56FD\u9645\u5355\u4F4D\u5236 International System of Units (SI).\u662F\u5341\u8FDB\u5236\uFF0C\u5305\u62EC\uFF1Akilo, mega, giga, tera, peta, exa, zetta and yotta TiB(Tebibyte\uFF09\u662FInternational Electrotechnical Commission (IEC) \u5355\u4F4D\uFF0C\u662F\u4E8C\u8FDB\u5236\uFF0C\u5305\u62EC\uFF1Akibi, mebi, gibi, pebi, exbi, zebi and yobi\\r\\n\\r\\n**\u90A3\u4E48\u95EE\u9898\u6765\u4E86\uFF0C\u6211\u4EEC\u901A\u5E38\u770B\u5230\u7684TB\u5230\u5E95\u662F1024\u8FD8\u662F1000\u5462\uFF1F\u4E3A\u4EC0\u4E48\u6709\u8BA9\u4EBA\u8FD9\u4E48\u6DF7\u6DC6\u7684\u5355\u4F4D\u5462\uFF1F\u6211\u4E00\u5757400G\u7684\u786C\u76D8\uFF0C\u4E3A\u4EC0\u4E48\u5728\u7CFB\u7EDF\u4E2D\u663E\u793A\u53EA\u6709372G\u5462\uFF1F\u662F\u6709\u65E0\u826F\u5546\u5BB6\u5077\u5BB9\u91CF\u5417\uFF1F** \u8FD9\u4E2A\u95EE\u9898\u5C31\u8981\u6162\u6162\u9053\u6765\u4E86\uFF1A \u5F88\u4E45\u5F88\u4E45\u4EE5\u524D\uFF0C1956\u5E74\uFF0C\u5728\u6BDB\u4E3B\u5E2D\u505A\u4E86\u300A\u8BBA\u5341\u5927\u5173\u7CFB\u300B\u8BB2\u8BDD\u540E\u51E0\u4E2A\u6708\uFF0C\u5927\u6D0B\u5F7C\u5CB8\u7684IBM\u516C\u53F8\u63A8\u51FA\u4E86\u7B2C\u4E00\u6B3E\u5546\u7528\u786C\u76D8 IBM 350.\u8FD9\u4E2A\u78C1\u76D8\u5C31\u67091.5\u5E73\u65B9\u7C73\u7684\u5927\u5BB6\u4F19\uFF0C\u914D\u7F6E\u4E8650\u4E2A\u7269\u7406\u201C\u76D8\u7247Platter\u201D,\u67095\u4E07\u4E2A\u6247\u533ASector\uFF0C\u6BCF\u4E2A\u6247\u533A100\u4E2A\u5B57\u7B26\uFF08alphanumeric characters\uFF09\uFF0C\u603B\u5BB9\u91CF\u4E3A5\u767E\u4E07\u5B57\u7B26\uFF085 million characters\uFF09 \u6240\u4EE5\u4F60\u4EE5\u4E3A\u78C1\u76D8\u662F\u5B58\u4E8C\u8FDB\u5236\u4EE3\u7801\u7684\u5C31\u53EA\u80FD\u548C\u4E8C\u8FDB\u5236\u5BF9\u5E94\u5417\uFF1F\u4F60\u770B\u770B\u8FD9\u5168\u7403\u7B2C\u4E00\u4E2A\u786C\u76D8\uFF0C\u54EA\u4E2A\u6570\u636E\u662F2\u6B21\u5E42\u6765\u7B97\u7684\uFF1F \u540E\u6765\u7684\u786C\u76D8\u90FD\u662F\u6309\u7167\u5341\u8FDB\u5236\u6765\u6807\u8BC6\u5BB9\u91CF\uFF0C\u6240\u4EE5\u5E76\u4E0D\u662F\u5382\u5BB6\u5077\u5BB9\u91CF\u4E5F\u4E0D\u662F\u5382\u5BB6\u5355\u72EC\u641E\u4E86\u4E00\u4E2A1000\u8FDB\u5236\u3002\\r\\n\\r\\n**\u4E3A\u4EC0\u4E48\u64CD\u4F5C\u7CFB\u7EDF\u4E2D\u663E\u793A\u7684\u5BB9\u91CF\u6BD4\u786C\u76D8\u6807\u8BC6\u7684\u5BB9\u91CF\u5C11\u5462\uFF1F** \u662F\u7684\uFF0C\u4F60\u5DF2\u7ECF\u77E5\u9053\u7B54\u6848\u4E86\uFF0C\u786C\u76D8\u7684\u5BB9\u91CF\u662F\u7528\u5341\u8FDB\u5236\u6807\u8BC6\u7684\uFF0C\u800C\u64CD\u4F5C\u7CFB\u7EDF\u662F\u7528\u4E8C\u8FDB\u5236\u8BA1\u7B97\u7684\uFF0C\u76F8\u5F53\u4E8E\u628AGB\u6362\u7B97\u6210\u4E86GiB\uFF0C\u5F53\u7136\u5C31\u5C11\u4E86\u3002\\r\\n\\r\\n**\u90A3\u64CD\u4F5C\u7CFB\u7EDF\u62BD\u4EC0\u4E48\u98CE\u8981\u7528\u4E8C\u8FDB\u5236\u6765\u8BA1\u7B97\u5462\uFF1F** \u90A3\u662F\u56E0\u4E3ARAM\u5C31\u662F\u5185\u5B58\u6761\u8FD9\u4E1C\u897F\u7684\u5BB9\u91CF\u5374\u53C8\u662F\u7528\u4E8C\u8FDB\u5236\u6807\u8BC6\u7684\uFF0C\u5C31\u662F\u8BF41GB\u7684\u5185\u5B58\u662F\u7B49\u4E8E1024MB. \u6240\u4EE5Windows\u5C31\u91C7\u7528\u4E861024\u6765\u505A\u7684\u5BB9\u91CF\u7684\u8FDB\u5236\uFF0C\u8FD9\u6837\u5185\u5B58\u6761\u7684\u5BB9\u91CF\u663E\u793A\u662F\u6B63\u786E\u7684\uFF0C\u78C1\u76D8\u5BB9\u91CF\u663E\u793A\u5C31\u548C\u5382\u5BB6\u7684\u4E0D\u4E00\u81F4\u4E86\u3002\u5176\u5B9EWindows\u53EF\u4EE5\u6539\u8FDB\u4E00\u4E0B\uFF0C\u6BD4\u5982\u8BB2\u5185\u5BB9\u7684\u5BB9\u91CF\u663E\u793A\u4E3ATiB, \u78C1\u76D8\u5BB9\u91CF\u663E\u793A\u4E3ATB\uFF0C\u8FD9\u6837\u5C31\u5BF9\u5F97\u4E0A\u4E86\u3002\\r\\n\\r\\n**1000\u548C1024\u662F\u4EC0\u4E48\u65F6\u5019\u5F00\u59CB\u7528\u6DF7\u7684\u5462\uFF1F\u6211\u4EEC\u8BE5\u600E\u4E48\u533A\u5206\u5462\uFF1F** \u602A\u5C31\u602A\u9020\u5185\u5B58\u6761\u7684\u65F6\u5019\u592A\u65E9\u4E86\uFF0C1952\u5E74\uFF0C\u6211\u4EEC\u6297\u7F8E\u63F4\u671D\u8FD8\u6CA1\u6253\u5B8C\u3002\u5F53\u65F6\u7684\u5355\u4F4D\u53EA\u6709SI\u4E5F\u5C31\u662F\u5341\u8FDB\u5236\uFF0C\u90A3\u65F6\u5019\u5BB9\u91CF\u4E5F\u4E0D\u5927\uFF0C1024\u548C1000\u4E5F\u5DEE\u4E0D\u4E86\u591A\u5C11\u6240\u4EE5\u5C31\u51D1\u5408\u4E86\u3002\u540E\u6765\u5BB9\u91CF\u8D8A\u6765\u8D8A\u5927\uFF0C\u6211\u4E70\u5757100TB\u7684\u786C\u76D8\uFF0C\u7ED3\u679C\u53EA\u670990.9TB\uFF0C\u5C11\u4E86\u5C06\u8FD110TB\uFF0C\u8FD9\u8FD8\u4E0D\u5403\u5B98\u53F8\u554A\u3002\u6240\u4EE5\u57281998\u5E74\uFF08\u6297\u7F8E\u63F4\u671D\u5DF2\u7ECF\u7ED3\u675F\u4E86N\u591A\u5E74\uFF09\uFF0CIEC\u624D\u5B9A\u4E49\u4E86\u4E8C\u8FDB\u5236\u7684\u5355\u4F4DTiB\uFF0CGiB\u8FD9\u5806\u3002 \u90A3\u4E48\u73B0\u57289021\u5E74\u4E86\uFF0C\u6211\u770B\u5230TB\u80AF\u5B9A\u662F1000\uFF0CTiB\u80AF\u5B9A\u662F1024\u5427\uFF1F\u5BF9\u4E0D\u8D77\uFF0C\u8FD8\u771F\u4E0D\u4E00\u5B9A\uFF0CTiB\u662F1024\u6CA1\u7684\u8DD1\uFF0C\u4F46TB\u5230\u5E95\u662F1000\u8FD8\u662F1024\u5462\uFF0C\u5728\u5185\u5B58\u4E0A\u662F1024\uFF0C\u5728\u5BB6\u7528\u786C\u76D8\u4E0A\u662F1000\uFF0C\u5176\u4ED6\u60C5\u51B5\u4E0B\u7531\u4E8E\u6DF7\u7528\u7684\u65F6\u95F4\u592A\u957F\u4E86\u5177\u4F53\u662F\u54EA\u4E2A\u53EA\u80FD\u6839\u636E\u4E0A\u4E0B\u6587\u53BB\u731C\uFF0C\u4F60\u884C\u7684\uFF01\u8FD0\u6C14\u597D\uFF0C\u4F1A\u78B0\u5230\u6CE8\u91CA\u8BF4\u660E\u8FD9\u4E2ATB\u662F\u5341\u8FDB\u5236\u8FD8\u662F\u4E8C\u8FDB\u5236\u3002\\r\\n\\r\\n\u6240\u6709\u5934\u6587\u4EF6: 1.\u9996\u5148\u662F\u6700\u65B9\u4FBF\u7684\u4E07\u80FD\u5934\u6587\u4EF6\uFF0C\u987E\u540D\u601D\u4E49\uFF0C\u53EF\u4EE5\u5C06\u5176\u7406\u89E3\u4E3A\u7236\u4EB2\u5934\u6587\u4EF6\uFF08\u9664\u4E86\u672C\u7BC7\u7B2C14\u4E2A\u5934\u6587\u4EF6\uFF09\u90FD\u5305\u542B \uFF08\u867D\u7136\u65B9\u4FBF\u4E86\u61D2\u4EBA\uFF0C\u4F46\u662F\u7F3A\u70B9\u4E5F\u5F88\u660E\u663E--\u8FD9\u4E00\u5934\u6587\u4EF6\u5F88\u5360\u7528\u5185\u5B58\uFF09\uFF1A #include<bits/stdc++.h>\\r\\n\\r\\n2.\u63A5\u7740\u4E5F\u662F\u6BD4\u8F83\u5E38\u7528\u7684\uFF0C\u4F5C\u7528\u4E8E\u6570\u636E\u6D41\u8F93\u5165\u8F93\u51FA cin>>\u548Ccout<<\uFF1A #include\\r\\n\\r\\n3.\u7136\u540E\u662F\u5404\u79CD\u7B97\u6CD5\u7684\u5934\u6587\u4EF6(\u4F8B\u5982sort\u51FD\u6570\u7B49)\uFF1A #include\\r\\n\\r\\n4.\u5173\u4E8E\u6570\u5B66\u51FD\u6570\u7684\u5934\u6587\u4EF6\uFF08\u4F8B\u5982max( )\uFF0Cmin( )\uFF0Cabs( )\u7B49\uFF09\uFF08\u4ECEC\u8BED\u8A00\u4E2D\u7684math.h\u7EE7\u627F\u800C\u6765\uFF09\uFF1A #include\\r\\n\\r\\n5.string\u5B57\u7B26\u4E32\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n6.\u63A5\u7740\u662FC\u8BED\u8A00\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n7.\u666E\u901A\u961F\u5217(\u53EA\u80FD\u4E00\u8FB9\u8FDB\u4E00\u8FB9\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n8.\u53CC\u5411\u961F\u5217(\u4E24\u8FB9\u90FD\u53EF\u4EE5\u8FDB\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n9.\u6808(\u5148\u8FDB\u540E\u51FA\uFF0C\u540E\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n10.\u5217\u8868\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n11.\u52A8\u6001\u6570\u7EC4(\u4E0D\u9700\u77E5\u9053\u8BE5\u6570\u7EC4\u7684\u6570\u91CF)\u7684\u5934\u6587\u4EF6: #include\\r\\n\\r\\n12.\u56FE\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n13.\u96C6\u5408(\u5185\u90E8\u81EA\u52A8\u6709\u5E8F\u4E14\u4E0D\u542B\u91CD\u590D\u5143\u7D20)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n14.\u63A7\u5236\u7535\u8111\u6216\u5C0F\u9ED1\u6846\u5934\u6587\u4EF6(\u4E0D\u5305\u542B\u5728\u4E07\u80FD\u5934\u4EF6)\uFF1A #include<windows.h>\\r\\n\\r\\n```none\\r\\n\u300A\u6EE1\u6C5FWA\u300B\\r\\nRE\u51B2\u51A0\uFF0CTLE\u5904\u3001\u6F47\u6F47\u96E8\u6B47\u3002\\r\\n\u62AC\u671B\u773C\uFF0C\u6EE1\u5929WA\uFF0C\u6012\u706B\u6FC0\u70C8\u3002\\r\\n\u4E09\u5341AC\u5C18\u4E0E\u571F\uFF0C\u516B\u5343\u63D0\u4EA4\u4E91\u548C\u6708\u3002\\r\\n\u83AB\u6284\u88AD\u3001\u6CA1\u4E86AC\u8BB0\u5F55\uFF0C\u7A7A\u60B2\u5207\u3002\\r\\n\\r\\nCE\u803B\uFF0C\u72B9\u672A\u96EA\u3002\\r\\n\u849F\u84BB\u6068\uFF0C\u4F55\u65F6\u706D\u3002\\r\\n\u9A7E\u7A0B\u5E8F\uFF0C\u8E0F\u7834\u9898\u76EE\u5217\u8868\u3002\\r\\n\u95ED\u773C\u5199\u51FA\u7701\u9009\u9898\uFF0C\u7B11\u8C08\u731B\u5237NOI\u3002\\r\\n\u5F85\u4ECE\u5934\u3001\u6536\u62FEA+B\uFF0C\u671D\u5929\u9619\u3002\\r\\n\\r\\n\\r\\n\u300A\u5C06\u5237\u9898\u300B\\r\\n\u541B\u4E0D\u89C1\uFF0C\u6D1B\u8C37\u4E4B\u9898\u5929\u4E0A\u6765\uFF0C\u590D\u6742\u5230\u6D77\u4E0D\u590D\u56DE\u3002\\r\\n\u541B\u4E0D\u89C1\uFF0C\u9AD8\u5802\u660E\u955C\u60B2\u767D\u53D1\uFF0C\u671D\u5982\u9752\u4E1D\u66AE\u6210\u96EA\u3002\\r\\n\u4EBA\u751FWAWA\u987B\u5C3D\u601D\uFF0C\u83AB\u4F7F\u7535\u8111\u7A7A\u5BF9\u9898\u3002\\r\\n\u5929\u751F\u6211\u6750\u6CA1\u6709\u7528\uFF0C\u5343\u65B9\u767E\u8BA1\u8FD8RE\u3002\\r\\nAC\u4E00\u70B9\u4E14\u4E3A\u4E50\uFF0C\u4F1A\u987B\u4E00\u5237\u4E09\u767EWA\u3002\\r\\n\u543E\u56E2\u53CB\uFF0C\u725B\u5927\u4F6C\uFF0C\u5C06\u5237\u9898\uFF0C\u624B\u83AB\u505C\uFF01\uFF01\uFF01\\r\\n\u4E0E\u9898\u505A\u4E00\u904D\uFF0C\u8BF7\u7CFB\u7EDF\u4E3A\u849F\u84BB\u4EE5\u6D4B\u8BC4\u3002\\r\\n\u5929\u5929WAWA\u4E0D\u8DB3\u8D35\uFF0C\u4F46\u613F\u957F\u7720\u4E0D\u590D\u9192\uFF01\uFF01\uFF01\\r\\n\u53E4\u6765\u5927\u4F6C\u7686\u5237\u9898\uFF0C\u60DF\u6709\u849F\u84BB\u6C34\u7287\u7287\u3002\\r\\n\u7AD9\u957F\u6614\u65F6\u4E07AC\uFF0C\u6597\u9898\u5341\u5343\u6063\u6B22\u8C11\u3002\\r\\n\u4E3B\u4EBA\u4F55\u4E3A\u8A00AC\uFF1F\u5F84\u987B\u6CBD\u53D6\u5BF9\u541BWA\u3002\\r\\nTLE\uFF0CMLE\uFF0COLE\uFF0CUKE\uFF0CWA\uFF0CPC\uFF0CCE\u548CRE\u3002\\r\\n\u547C\u513F\u5C06\u51FA\u6362AK\uFF0C\u4E0E\u5C14\u540C\u9500\u4E07\u53E4\u6101\uFF01\uFF01\uFF01\\r\\n\\r\\n\u300A\u897F\u6C5F\u6708\xB7\u8BC1\u660E\u300B\\r\\n\u5373\u5F97\u6613\u89C1\u5E73\u51E1\uFF0C\u4EFF\u7167\u4E0A\u4F8B\u663E\u7136\u3002\u7559\u4F5C\u4E60\u9898\u7B54\u6848\u7565\u3002\u8BFB\u8005\u81EA\u8BC1\u4E0D\u96BE\u3002\\r\\n\u53CD\u4E4B\u4EA6\u7136\u540C\u7406\uFF0C\u63A8\u8BBA\u81EA\u7136\u6210\u7ACB\u3002\u7565\u53BB\u8FC7\u7A0BQED\u3002\u7531\u4E0A\u53EF\u77E5\u8BC1\u6BD5\u3002\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n\u6211\u4ECE\u5341\u4E8C\u5C81\u8D77\uFF0C\u4FBF\u5728\u6D1B\u8C37\u7684\u849F\u84BB\u9910\u5385\u91CC\u5F53\u4F19\u8BA1\uFF0Ckkk\u8BF4\uFF0C\u6837\u5B50\u592A\u50BB\uFF0C\u6015\u4F8D\u5019\u4E0D\u4E86\u4E13\u804C\u5F00\u53D1\uFF0C\u5C31\u5728\u5916\u9762\u505A\u70B9\u4E8B\u7F62\u3002\u5916\u9762\u7684\u7FFB\u8BD1\u7BA1\u7406\uFF0C\u867D\u7136\u5BB9\u6613\u8BF4\u8BDD\uFF0C\u4F46\u5520\u5520\u53E8\u53E8\u7F20\u5939\u4E0D\u6E05\u7684\u4E5F\u5F88\u4E0D\u5C11\u3002\u4ED6\u4EEC\u5F80\u5F80\u8981\u4EB2\u773C\u770B\u7740\u4E00\u4E2A\u5B57\u4E00\u4E2A\u5B57\u5BA1\u6838\u8FC7\uFF0C\u770B\u8FC7\u5230\u5E95\u662F\u4E0D\u662F\u673A\u7FFB\uFF0C\u53C8\u4EB2\u770B\u5C06\u786E\u8BA4\u7FFB\u8BD1\u6309\u4E0B\uFF0C\u7136\u540E\u653E\u5FC3\uFF1A\u5728\u8FD9\u4E25\u91CD\u76D1\u7763\u4E0B\uFF0C\u6478\u9C7C\u4E5F\u5F88\u4E3A\u96BE\u3002\u6240\u4EE5\u8FC7\u4E86\u51E0\u5929\uFF0Ckkk\u53C8\u8BF4\u6211\u5E72\u4E0D\u4E86\u8FD9\u4E8B\u3002\u5E78\u4E8Fdarkflames\u7684\u60C5\u9762\u5927\uFF0C\u8F9E\u9000\u4E0D\u5F97\uFF0C\u4FBF\u6539\u4E3A\u4E13\u7BA1\u7287\u7287\u7684\u4E00\u79CD\u65E0\u804A\u804C\u52A1\u4E86\u3002\\r\\n\\r\\n\u6211\u4ECE\u6B64\u4FBF\u6574\u5929\u7684\u5750\u5728\u7535\u8111\u524D\uFF0C\u4E13\u7BA1\u6211\u7684\u804C\u52A1\u3002\u867D\u7136\u6CA1\u6709\u4EC0\u4E48\u5931\u804C\uFF0C\u4F46\u603B\u89C9\u5F97\u6709\u4E9B\u5355\u8C03\uFF0C\u6709\u4E9B\u65E0\u804A\u3002kkk\u662F\u4E00\u526F\u51F6\u9762\u5B54\uFF0Cdarkflames\u4E5F\u6CA1\u6709\u597D\u58F0\u6C14\uFF0C\u6559\u4EBA\u6D3B\u6CFC\u4E0D\u5F97\uFF1B\u53EA\u6709\u9648\u4E59\u5DF1\u5230\u5E97\uFF0C\u624D\u53EF\u4EE5\u7B11\u51E0\u58F0\uFF0C\u6240\u4EE5\u81F3\u4ECA\u8FD8\u8BB0\u5F97\u3002\\r\\n\\r\\n\u9648\u4E59\u5DF1\u662F\u7AD9\u7740\u6253\u6BD4\u8D5B\u800CAK\u7684\u552F\u4E00\u7684\u4EBA\u3002\u4ED6\u8EAB\u6750\u5F88\u7C97\u58EE\uFF1B\u7A1A\u6C14\u9762\u5B54\uFF0C\u53CC\u773C\u91CC\u65F6\u5E38\u653E\u51FA\u806A\u9896\u7684\u5149\u3002\u2026\u2026\u2026\u2026\u56E0\u4E3A\u4ED6\u59D3\u9648\uFF0C\u522B\u4EBA\u4FBF\u4ECE\u63CF\u7EA2\u7EB8\u4E0A\u7684\u201C\u4E0A\u5DE8\u4F6C\u9648\u4E59\u5DF1\u201D\u8FD9\u534A\u61C2\u4E0D\u61C2\u7684\u8BDD\u91CC\uFF0C\u66FF\u4ED6\u53D6\u4E0B\u4E00\u4E2A\u7EF0\u53F7\uFF0C\u53EB\u505A\u9648\u4E59\u5DF1\u3002\u9648\u4E59\u5DF1\u4E00\u5230\u5E97\uFF0C\u6240\u6709\u6253\u6BD4\u8D5B\u7684\u4EBA\u4FBF\u90FD\u770B\u7740\u4ED6\u7B11\uFF0C\u6709\u7684\u53EB\u9053\uFF1A\u201C\u9648\u4E59\u5DF1\uFF0C\u4F60\u53C8AC\u4E86\u4E00\u9053\u7D2B\u9898\uFF01\u201D\u4ED6\u4E0D\u56DE\u7B54\uFF0C\u5BF9\u67DC\u91CC\u8BF4\uFF0C\u201C\u4E24\u9053IOI2018\uFF0C\u8981\u4E00\u6253\u7701\u9009+\u3002\u201D\u4FBF\u6392\u51FA\u6234\u5C14ALIENWARE\u3002\u4ED6\u4EEC\u53C8\u6545\u610F\u7684\u9AD8\u58F0\u56B7\u9053\uFF1A\u201Cche\\\\_zheAKIOI\uFF01\u201D\u9648\u4E59\u5DF1\u7741\u5927\u773C\u775B\u8BF4\uFF1A\u201C\u4F60\u600E\u4E48\u8FD9\u6837\u51ED\u7A7A\u6C61\u4EBA\u6E05\u767D\u2026\u2026\u201D\u201C\u4EC0\u4E48\u6E05\u767D\uFF1F\u6211\u524D\u5929\u4EB2\u773C\u89C1\u4F60\u534A\u4E2A\u5C0F\u65F6\u5199\u5B8CIOI\uFF0C\u628A\u5176\u4ED6\u4EBA\u540A\u7740\u6253\u3002\u201D\u9648\u4E59\u5DF1\u4FBF\u6DA8\u7EA2\u4E86\u8138\uFF0C\u989D\u4E0A\u7684\u9752\u7B4B\u6761\u6761\u7EFD\u51FA\uFF0C\u4E89\u8FA9\u9053\uFF1A\u201C\u5199\u5B8C\u4E0D\u80FD\u7B97\u6211AK\u2026\u2026\u6211\u83DC\uFF01\u2026\u2026\u521D\u5B66\u8005\u7684\u4E8B\uFF0C\u80FD\u7B97AK\u4E48\uFF1F\u201D\u63A5\u8FDE\u4FBF\u662F\u96BE\u61C2\u7684\u8BDD\uFF0C\u4EC0\u4E48\u201C\u6BD4\u8D5B\u771F\u96BE\u201D\uFF0C\u4EC0\u4E48\u201C\u849F\u84BB\u201D\u4E4B\u7C7B\uFF0C\u5F15\u5F97\u4F17\u4EBA\u90FD\u54C4\u7B11\u8D77\u6765\uFF1A\u5E97\u5185\u5916\u90FD\u5145\u6EE1\u4E86\u5FEB\u6D3B\u7684\u7A7A\u6C14\u3002\\r\\n\\r\\n\u2026\u2026\u2026\u2026\\r\\n\\r\\n\u201C\u96C6\u8BAD\u961F\u7684\u4EBA\u8111\u5B50\u53D1\u660F\uFF0C\u7ADF\u7136\u5077\u5230chen\\\\_zhe\u90A3\u91CC\u53BB\u4E86\uFF0C\u4ED6\u5BB6\u7684\u9898\uFF0C\u5077\u7684\u5F97\u5417\uFF1F\u201D\u201C\u540E\u6765\u600E\u6837\u5462\uFF1F\u201D\u201C\u88ABchen\\\\_zhe\u6253\uFF0C\u540A\u7740\u6253\u3002\u201D\\r\\n\\r\\n\xB7\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\xB7\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\xB7\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\xB7\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n\xB7\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\xB7\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\xB7\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\xB7\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\\r\\n\\r\\n---\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF \u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3 \u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\\r\\n\\r\\n\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0 \u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E \u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\nWA \u662F\u4E00\u79CD\u7EDD\u671B TLE \u662F\u4E00\u79CD\u75DB\u82E6 RE \u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE \u662F\u4E00\u79CD\u65E0\u5948 AC \u662F\u4E00\u79CD\u539F\u8C05 AK \u662F\u4E00\u79CD\u5E7B\u60F3\\r\\n\\r\\n\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F \u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136 \u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\nNOI \u662F\u4E00\u79CD\u68A6\u60F3\\r\\n\\r\\n---\\r\\n\\r\\n\u795E\u7287\uFF1A\u201C\u7F51\u7EDC\u6D4124\u9898\uFF1F\u5207\u6389\uFF01\u6A21\u62DF\u9000\u706B\uFF1FA\u4E86\uFF01\u4E0D\u5728\u8BDD\u4E0B\uFF01\u201D\\r\\n\\r\\n\u5927\u7287\uFF1A\u201C\u4ECA\u5929\u8FD9\u4E2A\u659C\u7387\u4F18\u5316\u603B\u7B97\u641E\u5B9A\u4E86\uFF0C\u660E\u5929\u5199Treap\u3002\u201D\\r\\n\\r\\n\u4E2D\u7287\uFF1A\u201C\u7EBF\u6BB5\u6811Get\uFF01\u7EC8\u4E8E\u53EF\u4EE5\u505A\u7EBF\u6BB5\u6811\u9898\u4E86\uFF0C\u54C8\u54C8\u3002\u201D\\r\\n\\r\\n\u5C0F\u7287\uFF1A\u201CDP\u7EC8\u4E8E\u4F1A\u5199\u4E86\uFF0C\u547C\u547C\uFF0C\u554A\u4EC0\u4E48\uFF0C\u8FD8\u6709\u6811\u5F62\u72B6\u538B\u6570\u4F4D\u2026\u2026\u201D\\r\\n\\r\\n\u849F\u84BB\uFF1A\u201C\u554A\u554A\u554A\u554A\u554A\u8FD9\u4E2Aa+b\u600E\u4E48\u8FD9\u4E48\u5751\uFF01\u8C03\u4E86\u8FD9\u4E48\u4E45\uFF01\u201D\\r\\n\\r\\n\u6211\uFF1A\u201C\u8FD9\u4E2Ac++\u600E\u4E48\u8FD8\u6CA1\u88C5\u597D\u3002\u201D\\r\\n\\r\\n---\\r\\n\\r\\n### \u8BBA \u89C1 \u7956 \u5B97 \u7684 N \u79CD \u65B9 \u6CD5\\r\\n\\r\\n1. \u4E0D\u5F00 `freopen` \u89C1\u7956\u5B97\uFF1B\\r\\n2. \u4E0D\u5F00 `long long` \u89C1\u7956\u5B97\uFF1B\\r\\n3. \u591A\u6D4B\u4E0D\u6E05\u7A7A\u89C1\u7956\u5B97\uFF1B\\r\\n4. \u6E05\u7A7A\u8D85\u65F6\u89C1\u7956\u5B97\uFF1B\\r\\n5. \u5C11 `#include <cstdio>` \u89C1\u7956\u5B97\uFF1B\\r\\n6. 232\u22121**2**3\u200B**2**\u200B\u2212**1** \u4E0D\u5F00 `unsigned int` \u89C1\u7956\u5B97\uFF1B\\r\\n7. 264\u22121**2**6\u200B**4**\u200B\u2212**1** \u4E0D\u5F00 `unsigned long long` \u89C1\u7956\u5B97\uFF1B\\r\\n8. \u4F7F\u7528\u5DF2\u6B7B\u7684\u7B97\u6CD5\u89C1\u7956\u5B97\uFF1B\\r\\n9. `cin`\uFF0C`cout` \u6548\u7387\u4F4E\u89C1\u7956\u5B97\uFF1B\\r\\n10. `n`\uFF0C`m` \u5199\u53CD\u89C1\u7956\u5B97\uFF1B\\r\\n11. \u53D8\u91CF\u91CD\u540D\u89C1\u7956\u5B97\uFF1B\\r\\n12. \u9012\u5F52\u51FD\u6570\u4E2D\u4F7F\u7528\u540C\u4E00\u4E2A\u5FAA\u73AF\u53D8\u91CF\u89C1\u7956\u5B97\uFF1B\\r\\n13. \u8C03\u8BD5\u4E0D\u6CE8\u91CA\u89C1\u7956\u5B97\uFF1B\\r\\n14. \u6570\u7EC4\u5F00\u5927\u89C1\u7956\u5B97;\\r\\n\\r\\nAC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\u597D\u4E86\uFF0C\u542C\u597D\u4E86\u6D1B\u8C37\u3002\u7B49\u6211\u5F53\u4E0A\u7BA1\u7406\u5458\uFF0C\u6211\u4F1A\u5236\u5B9A\u65B0\u7684\u7A0E\u6CD5\uFF0C\u6211\u77A7\u77A7\u2026\u2026\\r\\n\\r\\nAC\u8981\u6263\u7A0E\\r\\n\\r\\nWA\u8981\u6263\u7A0E\\r\\n\\r\\nRE\u8981\u6263\u7A0E\\r\\n\\r\\nTLE\u8981\u6263\u7A0E\\r\\n\\r\\nMLE\u8981\u6263\u7A0E\\r\\n\\r\\nCE\u8981\u6263\u7A0E\\r\\n\\r\\nUKE\u8981\u6263\u7A0E\\r\\n\\r\\nOLE\u8981\u6263\u7A0E\\r\\n\\r\\nPC\u8981\u6263\u7A0E\\r\\n\\r\\nAK\u4E5F\u8981\u6263\u7A0E\\\\~\\r\\n\\r\\n\u6D1B\u8C37\uFF1A\u6211\u6297\u8BAE\u4EE5\u4E0A\u7684\u7A0E\uFF01\\r\\n\\r\\n\u6297\u8BAE\u4EE5\u4E0A\u7684\u7A0E\u8981\u6263\u7A0E\\r\\n\\r\\n```none\\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ || || || || || || // // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ _o\uD83D\uDCA9o_ // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ o8888888o // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ 88\\" . \\"88 // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ (| \xD7 \xD7 |) // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ O\\\\ \u0434 /O // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ ____/`---\'\\\\____ // ////\\r\\n\\\\\\\\\\\\\\\\ .\' \\\\\\\\| |// `. ////\\r\\n//== / \\\\\\\\||| : |||// \\\\ ==\\\\\\\\\\r\\n//== / _||||| -:- |||||- \\\\ ==\\\\\\\\\\r\\n//== | | \\\\\\\\\\\\ - /// | | ==\\\\\\\\\\r\\n//== | \\\\_| \'\'\\\\---/\'\' | | ==\\\\\\\\\\r\\n//== \\\\ .-\\\\__ `-` ___/-. / ==\\\\\\\\\\r\\n//== ___`. .\' /--.--\\\\ `. . ___ ==\\\\\\\\\\r\\n//== .\\"\\" \'< `.___\\\\_<|>_/___.\' >\' \\"\\". ==\\\\\\\\\\r\\n//== | | : `- \\\\`.;`\\\\ _ /`;.`/ - ` : | | \\\\\\\\\\\\\\\\\\r\\n//// \\\\ \\\\ `-. \\\\_ __\\\\ /__ _/ .-` / / \\\\\\\\\\\\\\\\\\r\\n//// ========`-.____`-.___\\\\_____/___.-`____.-\'======== \\\\\\\\\\\\\\\\\\r\\n//// `=---=\' \\\\\\\\\\\\\\\\\\r\\n//// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // \u9B54\u7956\u6BD2\u86CA y\u6C38\u8FDCWA \u6C38\u8FDC\u4FEE\u6539 \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // // // // || || || || || || || || || || \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n \\r\\n\\r\\n\\r\\n\\r\\n\u66F4\u5168\u7684\u5E72\u8D27\uFF1A[https://oj.qdturing.cn/d/Neptune/wiki/help#contest](https://oj.qdturing.cn/d/Neptune/wiki/help#contest)\\r\\n\\r\\n\u4EE5\u53CA\uFF1A[\u5168\u4E86\uFF01AK\u3001AC\u3001OJ\u2026\u2026\u4FE1\u5965\u5E38\u7528\u540D\u8BCD\u89E3\u91CA - \u77E5\u4E4E (zhihu.com)](https://zhuanlan.zhihu.com/p/620939848)\\r\\n\\r\\n\u8FD8\u6709\uFF1A[[\u5B58\u50A8]\u5BB9\u91CF\u5355\u4F4D\u540D\u8BCD\u89E3\u91CA - \u53EF\u7528\u5BB9\u91CF\uFF0C\u6709\u6548\u5BB9\u91CF\uFF0CTB\uFF0CTiB, GB,GiB\u7684\u56F0\u6270 - \u77E5\u4E4E (zhihu.com)](https://zhuanlan.zhihu.com/p/80232325)\\r\\n\\r\\n~~***\u5F69\u86CB\uFF1A\u8BBE\u7F6E\u6027\u522B\u6211\u9009\u7684other***~~\\r\\n\\r\\n***\u8FD9\u4F60\u90FD\u770B\u5B8C\u4E86\uFF1F(?\u0414?)\u5173\u6CE8\u4E0B\u5457***\\r\\n\\r\\n***\u767D\u5AD6\u4E00\u65F6\u723D\uFF0C\u4E00\u76F4\u767D\u5AD6\u4E00\u76F4\u723D***\\r\\n\\r\\n```none\\r\\n// Standard iostream objects -*- C++ -*-\\r\\n\\r\\n// Copyright (C) 1997-2014 Free Software Foundation, Inc.\\r\\n//\\r\\n// This file is part of the GNU ISO C++ Library. This library is free\\r\\n// software; you can redistribute it and/or modify it under the\\r\\n// terms of the GNU General Public License as published by the\\r\\n// Free Software Foundation; either version 3, or (at your option)\\r\\n// any later version.\\r\\n\\r\\n// This library is distributed in the hope that it will be useful,\\r\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\r\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\r\\n// GNU General Public License for more details.\\r\\n\\r\\n// Under Section 7 of GPL version 3, you are granted additional\\r\\n// permissions described in the GCC Runtime Library Exception, version\\r\\n// 3.1, as published by the Free Software Foundation.\\r\\n\\r\\n// You should have received a copy of the GNU General Public License and\\r\\n// a copy of the GCC Runtime Library Exception along with this program;\\r\\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\\r\\n// <http://www.gnu.org/licenses/>.\\r\\n\\r\\n/** @file include/iostream\\r\\n * This is a Standard C++ Library header.\\r\\n */\\r\\n\\r\\n//\\r\\n// ISO C++ 14882: 27.3 Standard iostream objects\\r\\n//\\r\\n\\r\\n#ifndef _GLIBCXX_IOSTREAM\\r\\n#define _GLIBCXX_IOSTREAM 1\\r\\n\\r\\n#pragma GCC system_header\\r\\n\\r\\n#include <bits/c++config.h>\\r\\n#include <ostream>\\r\\n#include <istream>\\r\\n\\r\\nnamespace std _GLIBCXX_VISIBILITY(default)\\r\\n{\\r\\n_GLIBCXX_BEGIN_NAMESPACE_VERSION\\r\\n\\r\\n /**\\r\\n * @name Standard Stream Objects\\r\\n *\\r\\n * The <iostream> header declares the eight <em>standard stream\\r\\n * objects</em>. For other declarations, see\\r\\n * http://gcc.gnu.org/onlinedocs/libstdc++/manual/io.html\\r\\n * and the @link iosfwd I/O forward declarations @endlink\\r\\n *\\r\\n * They are required by default to cooperate with the global C\\r\\n * library\'s @c FILE streams, and to be available during program\\r\\n * startup and termination. For more information, see the section of the\\r\\n * manual linked to above.\\r\\n */\\r\\n //@{\\r\\n extern istream cin;\\t\\t/// Linked to standard input\\r\\n extern ostream cout;\\t\\t/// Linked to standard output\\r\\n extern ostream cerr;\\t\\t/// Linked to standard error (unbuffered)\\r\\n extern ostream clog;\\t\\t/// Linked to standard error (buffered)\\r\\n\\r\\n#ifdef _GLIBCXX_USE_WCHAR_T\\r\\n extern wistream wcin;\\t\\t/// Linked to standard input\\r\\n extern wostream wcout;\\t/// Linked to standard output\\r\\n extern wostream wcerr;\\t/// Linked to standard error (unbuffered)\\r\\n extern wostream wclog;\\t/// Linked to standard error (buffered)\\r\\n#endif\\r\\n //@}\\r\\n\\r\\n // For construction of filebuffers for cout, cin, cerr, clog et. al.\\r\\n static ios_base::Init __ioinit;\\r\\n\\r\\n_GLIBCXX_END_NAMESPACE_VERSION\\r\\n} // namespace\\r\\n\\r\\n#endif /* _GLIBCXX_IOSTREAM */\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n#ifndef _GLIBCXX_NO_ASSERT\\r\\n#include <cassert>\\r\\n#endif\\r\\n#include <cctype>\\r\\n#include <cerrno>\\r\\n#include <cfloat>\\r\\n#include <ciso646>\\r\\n#include <climits>\\r\\n#include <clocale>\\r\\n#include <cmath>\\r\\n#include <csetjmp>\\r\\n#include <csignal>\\r\\n#include <cstdarg>\\r\\n#include <cstddef>\\r\\n#include <cstdio>\\r\\n#include <cstdlib>\\r\\n#include <cstring>\\r\\n#include <ctime>\\r\\n\\r\\n#if __cplusplus >= 201103L\\r\\n#include <ccomplex>\\r\\n#include <cfenv>\\r\\n#include <cinttypes>\\r\\n#include <cstdalign>\\r\\n#include <cstdbool>\\r\\n#include <cstdint>\\r\\n#include <ctgmath>\\r\\n#include <cwchar>\\r\\n#include <cwctype>\\r\\n#endif\\r\\n\\r\\n// C++\\r\\n#include <algorithm>\\r\\n#include <bitset>\\r\\n#include <complex>\\r\\n#include <deque>\\r\\n#include <exception>\\r\\n#include <fstream>\\r\\n#include <functional>\\r\\n#include <iomanip>\\r\\n#include <ios>\\r\\n#include <iosfwd>\\r\\n#include <iostream>\\r\\n#include <istream>\\r\\n#include <iterator>\\r\\n#include <limits>\\r\\n#include <list>\\r\\n#include <locale>\\r\\n#include <map>\\r\\n#include <memory>\\r\\n#include <new>\\r\\n#include <numeric>\\r\\n#include <ostream>\\r\\n#include <queue>\\r\\n#include <set>\\r\\n#include <sstream>\\r\\n#include <stack>\\r\\n#include <stdexcept>\\r\\n#include <streambuf>\\r\\n#include <string>\\r\\n#include <typeinfo>\\r\\n#include <utility>\\r\\n#include <valarray>\\r\\n#include <vector>\\r\\n\\r\\n#if __cplusplus >= 201103L\\r\\n#include <array>\\r\\n#include <atomic>\\r\\n#include <chrono>\\r\\n#include <condition_variable>\\r\\n#include <forward_list>\\r\\n#include <future>\\r\\n#include <initializer_list>\\r\\n#include <mutex>\\r\\n#include <random>\\r\\n#include <ratio>\\r\\n#include <regex>\\r\\n#include <scoped_allocator>\\r\\n#include <system_error>\\r\\n#include <thread>\\r\\n#include <tuple>\\r\\n#include <typeindex>\\r\\n#include <type_traits>\\r\\n#include <unordered_map>\\r\\n#include <unordered_set>\\r\\n#endif\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[https://www.luogu.com.cn/](https://www.luogu.com.cn/)\\r\\n\\r\\n[\u5728\u7EBF\u9ED1\u5BA2\u6A21\u62DF\u653B\u51FB\u6F14\u793A (tonghei.com)](https://hackcode.tonghei.com/hacker/)\\r\\n\\r\\n\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B\u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B\u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B\u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002\\r\\n\u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B\u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B\u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B\u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\u2014\u2014\u5C0F A\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B\u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B\u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B\u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002\\r\\n\u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B\u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B\u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B\u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\u2014\u2014\u5C0F A\\r\\n\\r\\n","school":"\u9752\u5C9B\u7ACB\u65B0\u5C0F\u5B66","studentId":"20","phone":"18661978285","backgroundImage":"/components/profile/backgrounds/1.jpg","unreadMsg":0,"pinnedDomains":["gsk1","system","lixin3","W0001","Neptune","Y001"],"fontFamily":"Open Sans","codeFontFamily":"Source Code Pro","preferredEditorType":"sv","monacoTheme":"vs-light","theme":"dark","showInvisibleChar":false,"formatCode":true,"realname":"\u738B\u6893\u5BB8","skipAnimate":false,"showTimeAgo":true,"coin":92100,"displayName":"\u738B\u6893\u5BB8","nAccept":177,"nSubmit":204,"rp":0,"rpInfo":{},"level":0,"avatarUrl":"//sdn.geekzu.org/avatar/27c40cafc2e6207660995464171af398?d=mm&s=128"}'; </script> <script type="text/javascript" src="https://oj.qdturing.cn/resource/4.50.2/lang-zh.js"></script> <script type="text/javascript" src="https://oj.qdturing.cn/hydro-4.50.2.js"></script> <nav class="nav slideout-menu" id="menu"> <div class="row"><div class="columns clearfix"> <ol class="nav__list nav__list--main clearfix"> <li class="nav__list-item"> <a href="/"><img class="nav__logo" src="/nav_logo_dark.png"></a> </li> <li class="nav__list-item"> <a href="/d/W0001/" class="nav__item"> 首页 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/p" class="nav__item"> 题库 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/training" class="nav__item"> 训练 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/contest" class="nav__item"> 比赛 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/homework" class="nav__item"> 作业 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/record?uidOrName=1063" class="nav__item"> 评测记录 </a> </li> </ol> <ol class="nav__list nav__list--secondary clearfix"> <li class="nav__list-item" data-dropdown-pos="bottom right" data-dropdown-custom-class="nav__dropdown" data-dropdown-target="#menu-nav-domain" data-dropdown-disabledconstrainToWindow data-dropdown-trigger-desktop-only> <span class="nav__item"><span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/c966bade52d355d61c5a90226ae5959b?d=mm&s=64" width="20" height="20"></span> 韦老师 <span class="icon icon-expand_more nojs--hide"></span></span> <ol class="dropdown-target menu" id="menu-nav-domain"><li class="menu__item"> <a href="/d/gsk1/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=4141512521&s=160" width="20" height="20"></span> EL训练计划 (gsk1) </a> </li><li class="menu__item"> <a href="/d/system/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="https://oj.qdturing.cn/file/4/favicon.ico" width="20" height="20"></span> 图灵编程教育 (system) </a> </li><li class="menu__item"> <a href="/d/lixin3/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=4141512521&s=160" width="20" height="20"></span> 立新三年级 (lixin3) </a> </li><li class="menu__item"> <a href="/d/W0001/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/c966bade52d355d61c5a90226ae5959b?d=mm&s=64" width="20" height="20"></span> 韦老师 (W0001) </a> </li><li class="menu__item"> <a href="/d/Neptune/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/9e853346d72b5227f38177e3e8e94691?d=mm&s=64" width="20" height="20"></span> 乐智 (Neptune) </a> </li><li class="menu__item"> <a href="/d/Y001/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=28015861&s=160" width="20" height="20"></span> 于老师的python域 (Y001) </a> </li><li class="menu__seperator"></li><li class="menu__item"> <a href="/d/W0001/home/domain" class="menu__link"> <span class="icon icon-wrench"></span> 管理 </a> </li> </ol> </li> <li class="nav__list-item" data-dropdown-pos="bottom right" data-dropdown-custom-class="nav__dropdown" data-dropdown-target="#menu-nav-user" data-dropdown-disabledconstrainToWindow data-dropdown-trigger-desktop-only> <a href="/d/W0001/user/1063" class="nav__item">王梓宸 <span class="icon icon-expand_more nojs--hide"></span></a> <ol class="dropdown-target menu" id="menu-nav-user"> <li class="menu__item"> <a href="/d/W0001/user/1063" class="menu__link"> <span class="icon icon-account--circle"></span> 我的资料 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/messages" class="menu__link"> <span class="icon icon-comment--multiple"></span> 站内消息 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/settings/domain" class="menu__link"> <span class="icon icon-web"></span> @ 韦老师 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/settings/account" class="menu__link"> <span class="icon icon-wrench"></span> 账户设置 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/settings/preference" class="menu__link"> <span class="icon icon-sliders"></span> 偏好设置 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/security" class="menu__link"> <span class="icon icon-security"></span> 安全设置 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/domain" class="menu__link"> <span class="icon icon-web"></span> 我的域 </a> </li> <li class="menu__seperator"></li><li class="menu__item nojs--hide"> <a href="/d/W0001/fund/info" class="menu__link"> <span class="icon icon-statistics"></span> 我的金币记录 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/logout" class="menu__link" name="nav_logout"> <span class="icon icon-logout"></span> 登出 </a> </li> </ol> </li> </ol> </div></div> </nav> <nav class="nav--shadow"></nav> <div class="slideout-panel" id="panel"> <div class="slideout-overlay"></div> <div class="header--mobile"> <div class="row"><div class="columns clearfix"> <div class="float-left"> <a class="header--mobile__domain" href="/" target="_self"> <img src="/nav_logo_dark.png"> </a> </div> <div class="float-right"> <button type="button" class="header__hamburger"> <div class="hamburger hamburger--spin"> <span class="hamburger-box"> <span class="hamburger-inner"></span> </span> </div> </button> </div> </div></div> </div> <div class="main"> <style> .user-profile-bg { background-image: url("/components/profile/backgrounds/1.jpg"), url("/components/profile/backgrounds/1.jpg"); } </style> <div class="row"> <div class="medium-9 columns"> <div class="section"> <div class="profile-header user-profile-bg"> <div class="profile-header__content"> <div class="media"> <div class="media__left"> <img src="//sdn.geekzu.org/avatar/746a96ddf2d4353be8894048b0067b98?d=mm&s=120" width="120" height="120" class="large user-profile-avatar"> </div> <div class="media__body profile-header__main"> <h1> 郝铮 <small>(郝铮)</small> </h1> <p> UID: 1051, 注册于 <span class="time relative" data-timestamp="1688638192.394">2023-7-6 18:09:52</span>, 最后登录于 <span class="time relative" data-timestamp="1708342280.407">2024-2-19 19:31:20</span>, 最后活动于 <span class="time relative" data-timestamp="1720832595.076">2024-7-13 9:03:15</span>. </p> <p>解决了 203 道题目，RP: 0 (No. ?)</p> <div class="profile-header__contact-bar"> <a class="profile-header__contact-item" href="/d/W0001/home/messages?target=1051" target="_blank" data-tooltip="发送站内信息"> <span class="icon icon-comment--multiple"></span> </a> <a class="profile-header__contact-item" href="javascript:;" data-copy="enBaQVdkUFhWeGZmQGh5ZHJvLmxvY2Fs" data-tooltip="复制电子邮件"> <span class="icon icon-mail"></span> </a> </div> </div> </div> </div> </div> <div class="profile-content"> <div class="section__tab-container immersive"> <ul class="section__tabs"> <li class="section__tab-item"> <h1 class="section__tab-title">个人简介</h1> <div class="section__tab-main"> <div class="nothing-placeholder"> <div class="nothing-icon"></div> 该用户太懒，这里啥也没写 (´・ω・｀) </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">通过的题目</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <div class="row"> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P381" data-tooltip="角谷猜想"><b>A1002P381</b></a></li> <li> <a href="/d/W0001/p/A1002P17" data-tooltip="一尺之棰"><b>A1002P17</b></a></li> <li> <a href="/d/W0001/p/A1002P18" data-tooltip="小明学游泳"><b>A1002P18</b></a></li> <li> <a href="/d/W0001/p/A1002P128" data-tooltip="数字统计"><b>A1002P128</b></a></li> <li> <a href="/d/W0001/p/A1002P386" data-tooltip="数中有几个0"><b>A1002P386</b></a></li> <li> <a href="/d/W0001/p/A1002P153" data-tooltip="求最小因数"><b>A1002P153</b></a></li> <li> <a href="/d/W0001/p/A1002P573" data-tooltip="求最大公约数"><b>A1002P573</b></a></li> <li> <a href="/d/W0001/p/A1002P574" data-tooltip="两个自然数m和n的最小公倍数"><b>A1002P574</b></a></li> <li> <a href="/d/W0001/p/A1002P575" data-tooltip="最大正方形边长"><b>A1002P575</b></a></li> <li> <a href="/d/W0001/p/A1002P436" data-tooltip="数值计算"><b>A1002P436</b></a></li> <li> <a href="/d/W0001/p/A1002P49" data-tooltip="输出第二个整数"><b>A1002P49</b></a></li> <li> <a href="/d/W0001/p/A1002P50" data-tooltip="输入和输出实型数据"><b>A1002P50</b></a></li> <li> <a href="/d/W0001/p/A1002P52" data-tooltip="变量的解释"><b>A1002P52</b></a></li> <li> <a href="/d/W0001/p/A1002P53" data-tooltip="换行分隔输出"><b>A1002P53</b></a></li> <li> <a href="/d/W0001/p/A1002P801" data-tooltip="输入输出3"><b>A1002P801</b></a></li> <li> <a href="/d/W0001/p/A1002P54" data-tooltip="字符菱形"><b>A1002P54</b></a></li> <li> <a href="/d/W0001/p/A1002P560" data-tooltip="图形打印正方形"><b>A1002P560</b></a></li> <li> <a href="/d/W0001/p/A1002P593" data-tooltip="图形打印长方形"><b>A1002P593</b></a></li> <li> <a href="/d/W0001/p/A1002P594" data-tooltip="图形打印直角三角形"><b>A1002P594</b></a></li> <li> <a href="/d/W0001/p/A1002P596" data-tooltip="数字图形正方形一"><b>A1002P596</b></a></li> <li> <a href="/d/W0001/p/A1002P597" data-tooltip="数字图形正方形二"><b>A1002P597</b></a></li> <li> <a href="/d/W0001/p/A1002P598" data-tooltip="数字图形三角形一"><b>A1002P598</b></a></li> <li> <a href="/d/W0001/p/A1002P599" data-tooltip="数字图形三角形二"><b>A1002P599</b></a></li> <li> <a href="/d/W0001/p/A1002P562" data-tooltip="星号倒直角"><b>A1002P562</b></a></li> <li> <a href="/d/W0001/p/A1002P563" data-tooltip="平行四边形"><b>A1002P563</b></a></li> <li> <a href="/d/W0001/p/A1002P602" data-tooltip="星号倒等腰三角形"><b>A1002P602</b></a></li> <li> <a href="/d/W0001/p/A1002P568" data-tooltip="星号梯形"><b>A1002P568</b></a></li> <li> <a href="/d/W0001/p/A1002P569" data-tooltip="9*9乘法公式"><b>A1002P569</b></a></li> <li> <a href="/d/W0001/p/A1002P650" data-tooltip="公园买门票"><b>A1002P650</b></a></li> <li> <a href="/d/W0001/p/A1002P635" data-tooltip="阿凡提的难题"><b>A1002P635</b></a></li> <li> <a href="/d/W0001/p/A1002P638" data-tooltip="三色球问题"><b>A1002P638</b></a></li> <li> <a href="/d/W0001/p/A1002P385" data-tooltip="数位之和"><b>A1002P385</b></a></li> <li> <a href="/d/W0001/p/A1002P51" data-tooltip="输入输出字符型数据"><b>A1002P51</b></a></li> <li> <a href="/d/W0001/p/A1002P46" data-tooltip="声明变量并输出"><b>A1002P46</b></a></li> <li> <a href="/d/W0001/p/A1002P477" data-tooltip="输出图形"><b>A1002P477</b></a></li> <li> <a href="/d/W0001/p/A1002P663" data-tooltip="判断能否被3，5，7整除"><b>A1002P663</b></a></li> <li> <a href="/d/W0001/p/A1002P111" data-tooltip="求四个数的最大数"><b>A1002P111</b></a></li> <li> <a href="/d/W0001/p/A1002P3" data-tooltip="小鱼的游泳时间"><b>A1002P3</b></a></li> <li> <a href="/d/W0001/p/A1002P60" data-tooltip="节省多少时间"><b>A1002P60</b></a></li> <li> <a href="/d/W0001/p/A1002P61" data-tooltip="输出整数12345各个位上的数字之和"><b>A1002P61</b></a></li> <li> <a href="/d/W0001/p/A1002P584" data-tooltip="分磁带"><b>A1002P584</b></a></li> <li> <a href="/d/W0001/p/A1002P583" data-tooltip="分钱"><b>A1002P583</b></a></li> <li> <a href="/d/W0001/p/A1002P987" data-tooltip="A + B 问题"><b>A1002P987</b></a></li> <li> <a href="/d/W0001/p/A1002P67" data-tooltip="时分秒"><b>A1002P67</b></a></li> <li> <a href="/d/W0001/p/A1002P587" data-tooltip="【深基2.例8】再分肥宅水"><b>A1002P587</b></a></li> <li> <a href="/d/W0001/p/A1002P771" data-tooltip="五舍六入"><b>A1002P771</b></a></li> <li> <a href="/d/W0001/p/A1002P581" data-tooltip="鸡兔同笼问题"><b>A1002P581</b></a></li> <li> <a href="/d/W0001/p/A1002P582" data-tooltip="车棚"><b>A1002P582</b></a></li> <li> <a href="/d/W0001/p/A1002P585" data-tooltip="【基础题】五位好朋友相聚"><b>A1002P585</b></a></li> <li> <a href="/d/W0001/p/A1002P980" data-tooltip="分糖果"><b>A1002P980</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P557" data-tooltip="交换输出"><b>A1002P557</b></a></li> <li> <a href="/d/W0001/p/A1002P559" data-tooltip="交换输出 3"><b>A1002P559</b></a></li> <li> <a href="/d/W0001/p/A1002P77" data-tooltip="整数判断"><b>A1002P77</b></a></li> <li> <a href="/d/W0001/p/A1002P94" data-tooltip="超市卖电池"><b>A1002P94</b></a></li> <li> <a href="/d/W0001/p/A1002P89" data-tooltip="苹果和虫子"><b>A1002P89</b></a></li> <li> <a href="/d/W0001/p/A1002P92" data-tooltip="需要几辆车"><b>A1002P92</b></a></li> <li> <a href="/d/W0001/p/A1002P95" data-tooltip="十位大还是个位大"><b>A1002P95</b></a></li> <li> <a href="/d/W0001/p/A1002P88" data-tooltip="点和正方形的关系"><b>A1002P88</b></a></li> <li> <a href="/d/W0001/p/A1002P694" data-tooltip="顺序输出"><b>A1002P694</b></a></li> <li> <a href="/d/W0001/p/A1002P695" data-tooltip="顺序输出2"><b>A1002P695</b></a></li> <li> <a href="/d/W0001/p/A1002P91" data-tooltip="装苹果"><b>A1002P91</b></a></li> <li> <a href="/d/W0001/p/A1002P85" data-tooltip="有一门课不及格的学生"><b>A1002P85</b></a></li> <li> <a href="/d/W0001/p/A1002P83" data-tooltip="判断闰年"><b>A1002P83</b></a></li> <li> <a href="/d/W0001/p/A1002P101" data-tooltip="乘车费用"><b>A1002P101</b></a></li> <li> <a href="/d/W0001/p/A1002P772" data-tooltip="是否是连续奇数"><b>A1002P772</b></a></li> <li> <a href="/d/W0001/p/A1002P463" data-tooltip="水仙花数 1"><b>A1002P463</b></a></li> <li> <a href="/d/W0001/p/A1002P81" data-tooltip="判断3的倍数"><b>A1002P81</b></a></li> <li> <a href="/d/W0001/p/A1002P977" data-tooltip="收集瓶盖赢大奖"><b>A1002P977</b></a></li> <li> <a href="/d/W0001/p/A1002P484" data-tooltip="小明家的电费"><b>A1002P484</b></a></li> <li> <a href="/d/W0001/p/A1002P815" data-tooltip="求生者的欲望"><b>A1002P815</b></a></li> <li> <a href="/d/W0001/p/A1002P527" data-tooltip="国王移动的步数"><b>A1002P527</b></a></li> <li> <a href="/d/W0001/p/A1002P485" data-tooltip="出租车费（小学组2015第一题）"><b>A1002P485</b></a></li> <li> <a href="/d/W0001/p/A1002P437" data-tooltip="输出30个星号"><b>A1002P437</b></a></li> <li> <a href="/d/W0001/p/A1002P13" data-tooltip="输出1到10的整数"><b>A1002P13</b></a></li> <li> <a href="/d/W0001/p/A1002P21" data-tooltip="100以内的偶数"><b>A1002P21</b></a></li> <li> <a href="/d/W0001/p/A1002P237" data-tooltip="输出符合条件的数"><b>A1002P237</b></a></li> <li> <a href="/d/W0001/p/A1002P34" data-tooltip="输入n，输出算式1+2+3+...+n"><b>A1002P34</b></a></li> <li> <a href="/d/W0001/p/A1002P140" data-tooltip="整数的个数"><b>A1002P140</b></a></li> <li> <a href="/d/W0001/p/A1002P32" data-tooltip="计算1+2+…+100的和"><b>A1002P32</b></a></li> <li> <a href="/d/W0001/p/A1002P137" data-tooltip="奇数求和"><b>A1002P137</b></a></li> <li> <a href="/d/W0001/p/A1002P33" data-tooltip="求和1"><b>A1002P33</b></a></li> <li> <a href="/d/W0001/p/A1002P142" data-tooltip="求公式和"><b>A1002P142</b></a></li> <li> <a href="/d/W0001/p/A1002P136" data-tooltip="求和2"><b>A1002P136</b></a></li> <li> <a href="/d/W0001/p/A1002P141" data-tooltip="奥运奖牌计数"><b>A1002P141</b></a></li> <li> <a href="/d/W0001/p/A1002P144" data-tooltip="均值"><b>A1002P144</b></a></li> <li> <a href="/d/W0001/p/A1002P150" data-tooltip="整数序列的元素最大跨度值"><b>A1002P150</b></a></li> <li> <a href="/d/W0001/p/A1002P154" data-tooltip="求最大因数"><b>A1002P154</b></a></li> <li> <a href="/d/W0001/p/A1002P155" data-tooltip="判断质数"><b>A1002P155</b></a></li> <li> <a href="/d/W0001/p/A1002P158" data-tooltip="质数问题1"><b>A1002P158</b></a></li> <li> <a href="/d/W0001/p/A1002P23" data-tooltip="小青蛙回来了"><b>A1002P23</b></a></li> <li> <a href="/d/W0001/p/A1002P80" data-tooltip="冰淇淋"><b>A1002P80</b></a></li> <li> <a href="/d/W0001/p/A1002P64" data-tooltip="矩形面积"><b>A1002P64</b></a></li> <li> <a href="/d/W0001/p/A1002P807" data-tooltip="快递费用"><b>A1002P807</b></a></li> <li> <a href="/d/W0001/p/A1002P747" data-tooltip="上学迟到.V2"><b>A1002P747</b></a></li> <li> <a href="/d/W0001/p/A1002P93" data-tooltip="购买水杯"><b>A1002P93</b></a></li> <li> <a href="/d/W0001/p/W0001P1210" data-tooltip="输出数字时钟"><b>W0001P1210</b></a></li> <li> <a href="/d/W0001/p/A1002P100" data-tooltip="包装箱"><b>A1002P100</b></a></li> <li> <a href="/d/W0001/p/A1002P102" data-tooltip="冷饮的价格"><b>A1002P102</b></a></li> <li> <a href="/d/W0001/p/A1002P104" data-tooltip="小明暑假的零花钱"><b>A1002P104</b></a></li> <li> <a href="/d/W0001/p/A1002P105" data-tooltip="求数的量级？"><b>A1002P105</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P109" data-tooltip="象棋大赛"><b>A1002P109</b></a></li> <li> <a href="/d/W0001/p/A1002P114" data-tooltip="BMI"><b>A1002P114</b></a></li> <li> <a href="/d/W0001/p/A1002P115" data-tooltip="数的性质"><b>A1002P115</b></a></li> <li> <a href="/d/W0001/p/A1002P14" data-tooltip="倒序输出10以内的自然数"><b>A1002P14</b></a></li> <li> <a href="/d/W0001/p/A1002P15" data-tooltip="输出2到n-1所有的整数"><b>A1002P15</b></a></li> <li> <a href="/d/W0001/p/A1002P19" data-tooltip="输出n以内所有的整数"><b>A1002P19</b></a></li> <li> <a href="/d/W0001/p/A1002P139" data-tooltip="奇数以及偶数的和"><b>A1002P139</b></a></li> <li> <a href="/d/W0001/p/A1002P145" data-tooltip="求整数的和与均值"><b>A1002P145</b></a></li> <li> <a href="/d/W0001/p/A1002P146" data-tooltip="财务管理"><b>A1002P146</b></a></li> <li> <a href="/d/W0001/p/A1002P147" data-tooltip="短信计费"><b>A1002P147</b></a></li> <li> <a href="/d/W0001/p/A1002P402" data-tooltip="最大值与最小值"><b>A1002P402</b></a></li> <li> <a href="/d/W0001/p/A1002P151" data-tooltip="数据统计"><b>A1002P151</b></a></li> <li> <a href="/d/W0001/p/A1002P159" data-tooltip="质数问题2"><b>A1002P159</b></a></li> <li> <a href="/d/W0001/p/A1002P456" data-tooltip="判断两位数的质数"><b>A1002P456</b></a></li> <li> <a href="/d/W0001/p/A1002P247" data-tooltip="[语言月赛202212] 洛谷三角洲"><b>A1002P247</b></a></li> <li> <a href="/d/W0001/p/A1002P1059" data-tooltip="剧院广场"><b>A1002P1059</b></a></li> <li> <a href="/d/W0001/p/A1002P112" data-tooltip="至少要买几瓶止咳糖浆？"><b>A1002P112</b></a></li> <li> <a href="/d/W0001/p/LUOGUP420" data-tooltip="小鱼会有危险吗"><b>LUOGUP420</b></a></li> <li> <a href="/d/W0001/p/A1002P489" data-tooltip="苹果和虫子2"><b>A1002P489</b></a></li> <li> <a href="/d/W0001/p/A1002P825" data-tooltip="数字口袋"><b>A1002P825</b></a></li> <li> <a href="/d/W0001/p/LUOGUP75" data-tooltip="[NOIP2012 普及组] 质因数分解"><b>LUOGUP75</b></a></li> <li> <a href="/d/W0001/p/LUOGUP7684" data-tooltip="最大公约数和最小公倍数"><b>LUOGUP7684</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8326" data-tooltip="[信息与未来 2018] 最大公约数"><b>LUOGUP8326</b></a></li> <li> <a href="/d/W0001/p/LUOGUP29" data-tooltip="[NOIP2001 普及组] 最大公约数和最小公倍数问题"><b>LUOGUP29</b></a></li> <li> <a href="/d/W0001/p/P001P775" data-tooltip="开学大采购"><b>P001P775</b></a></li> <li> <a href="/d/W0001/p/A1002P143" data-tooltip="计算公式的和2"><b>A1002P143</b></a></li> <li> <a href="/d/W0001/p/P001P776" data-tooltip="换钞票"><b>P001P776</b></a></li> <li> <a href="/d/W0001/p/P001P773" data-tooltip="买小猫小狗"><b>P001P773</b></a></li> <li> <a href="/d/W0001/p/A1002P398" data-tooltip="满足条件的数累加"><b>A1002P398</b></a></li> <li> <a href="/d/W0001/p/LUOGUP4670" data-tooltip="【深基4.例3】分类平均"><b>LUOGUP4670</b></a></li> <li> <a href="/d/W0001/p/A1002P427" data-tooltip="与指定数字相同的数的个数"><b>A1002P427</b></a></li> <li> <a href="/d/W0001/p/A1002P403" data-tooltip="求最高分最低分"><b>A1002P403</b></a></li> <li> <a href="/d/W0001/p/A1002P465" data-tooltip="【深基4.例3】分类平均"><b>A1002P465</b></a></li> <li> <a href="/d/W0001/p/A1002P395" data-tooltip="财务管理"><b>A1002P395</b></a></li> <li> <a href="/d/W0001/p/A1002P236" data-tooltip="多边形内角和"><b>A1002P236</b></a></li> <li> <a href="/d/W0001/p/A1002P401" data-tooltip="计算公式的和2"><b>A1002P401</b></a></li> <li> <a href="/d/W0001/p/A1002P526" data-tooltip="Book Reading"><b>A1002P526</b></a></li> <li> <a href="/d/W0001/p/A1002P424" data-tooltip="含k个3的数"><b>A1002P424</b></a></li> <li> <a href="/d/W0001/p/A1002P1112" data-tooltip="[语言月赛202304] 扶苏与 0"><b>A1002P1112</b></a></li> <li> <a href="/d/W0001/p/A1002P460" data-tooltip="最佳身体状态"><b>A1002P460</b></a></li> <li> <a href="/d/W0001/p/A1002P422" data-tooltip="倒序组合数字"><b>A1002P422</b></a></li> <li> <a href="/d/W0001/p/A1002P423" data-tooltip="数字反转"><b>A1002P423</b></a></li> <li> <a href="/d/W0001/p/A1002P457" data-tooltip="五位数倒序组合判断质数"><b>A1002P457</b></a></li> <li> <a href="/d/W0001/p/A1002P497" data-tooltip="短信计费"><b>A1002P497</b></a></li> <li> <a href="/d/W0001/p/A1002P399" data-tooltip="整数的个数"><b>A1002P399</b></a></li> <li> <a href="/d/W0001/p/A1002P671" data-tooltip="数1的个数"><b>A1002P671</b></a></li> <li> <a href="/d/W0001/p/A1002P667" data-tooltip="第n小的质数"><b>A1002P667</b></a></li> <li> <a href="/d/W0001/p/A1002P721" data-tooltip="定义函数输出《静夜思》"><b>A1002P721</b></a></li> <li> <a href="/d/W0001/p/A1002P722" data-tooltip="定义一个有参数的函数"><b>A1002P722</b></a></li> <li> <a href="/d/W0001/p/A1002P724" data-tooltip="求两个整数的最大数"><b>A1002P724</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P732" data-tooltip="求三个数的最大数"><b>A1002P732</b></a></li> <li> <a href="/d/W0001/p/A1002P726" data-tooltip="素数的个数"><b>A1002P726</b></a></li> <li> <a href="/d/W0001/p/A1002P728" data-tooltip="回文数个数"><b>A1002P728</b></a></li> <li> <a href="/d/W0001/p/A1002P730" data-tooltip="挛生素数"><b>A1002P730</b></a></li> <li> <a href="/d/W0001/p/A1002P731" data-tooltip="求出N以内的全部素数，并按每行五个数显示"><b>A1002P731</b></a></li> <li> <a href="/d/W0001/p/A1002P161" data-tooltip="纯粹素数"><b>A1002P161</b></a></li> <li> <a href="/d/W0001/p/A1002P758" data-tooltip="数根"><b>A1002P758</b></a></li> <li> <a href="/d/W0001/p/A1002P162" data-tooltip="纯粹合数"><b>A1002P162</b></a></li> <li> <a href="/d/W0001/p/A1002P959" data-tooltip="【深基3.例7】肥胖问题"><b>A1002P959</b></a></li> <li> <a href="/d/W0001/p/A1002P860" data-tooltip="均值"><b>A1002P860</b></a></li> <li> <a href="/d/W0001/p/A1002P991" data-tooltip="[NOIP2004 普及组] 不高兴的津津"><b>A1002P991</b></a></li> <li> <a href="/d/W0001/p/A1002P492" data-tooltip="与7无关的数"><b>A1002P492</b></a></li> <li> <a href="/d/W0001/p/A1002P435" data-tooltip="回文数"><b>A1002P435</b></a></li> <li> <a href="/d/W0001/p/P001P296" data-tooltip="分跳绳"><b>P001P296</b></a></li> <li> <a href="/d/W0001/p/P001P27" data-tooltip="[语言月赛202210] 玉桂狗"><b>P001P27</b></a></li> <li> <a href="/d/W0001/p/A1002P748" data-tooltip="打折优惠"><b>A1002P748</b></a></li> <li> <a href="/d/W0001/p/A1002P1045" data-tooltip="百货商场"><b>A1002P1045</b></a></li> <li> <a href="/d/W0001/p/A1002P832" data-tooltip="课桌"><b>A1002P832</b></a></li> <li> <a href="/d/W0001/p/A1002P499" data-tooltip="药房管理"><b>A1002P499</b></a></li> <li> <a href="/d/W0001/p/A1002P823" data-tooltip="集卡"><b>A1002P823</b></a></li> <li> <a href="/d/W0001/p/A1002P999" data-tooltip="Div"><b>A1002P999</b></a></li> <li> <a href="/d/W0001/p/A1002P1148" data-tooltip="音乐播放器"><b>A1002P1148</b></a></li> <li> <a href="/d/W0001/p/A1002P1155" data-tooltip="判断偶数"><b>A1002P1155</b></a></li> <li> <a href="/d/W0001/p/A1002P1175" data-tooltip="安排座位"><b>A1002P1175</b></a></li> <li> <a href="/d/W0001/p/A1002P639" data-tooltip="求因子数量"><b>A1002P639</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6847" data-tooltip="输出绝对值"><b>LUOGUP6847</b></a></li> <li> <a href="/d/W0001/p/LUOGUP9429" data-tooltip="[语言月赛 202401] 分饼干 I"><b>LUOGUP9429</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8744" data-tooltip="[NICA #2] 台式烤香肠"><b>LUOGUP8744</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6858" data-tooltip="分段函数"><b>LUOGUP6858</b></a></li> <li> <a href="/d/W0001/p/LUOGUP46" data-tooltip="[NOIP2005 普及组] 陶陶摘苹果"><b>LUOGUP46</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP457" data-tooltip="晶晶赴约会"><b>OPENJUDGEP457</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP577" data-tooltip="求平均年龄"><b>OPENJUDGEP577</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP596" data-tooltip="字符三角形"><b>OPENJUDGEP596</b></a></li> <li> <a href="/d/W0001/p/DFBYP396" data-tooltip="【入门】小丽找数？"><b>DFBYP396</b></a></li> <li> <a href="/d/W0001/p/DFBYP598" data-tooltip="【入门】请输出n~1之间所有的整数"><b>DFBYP598</b></a></li> <li> <a href="/d/W0001/p/DFBYP599" data-tooltip="【入门】请输出带有特殊尾数的数"><b>DFBYP599</b></a></li> <li> <a href="/d/W0001/p/DFBYP86" data-tooltip="【入门】寻找雷劈数"><b>DFBYP86</b></a></li> <li> <a href="/d/W0001/p/DFBYP638" data-tooltip="【入门】奇怪的数？"><b>DFBYP638</b></a></li> <li> <a href="/d/W0001/p/DFBYP91" data-tooltip="【入门】同因查找"><b>DFBYP91</b></a></li> <li> <a href="/d/W0001/p/DFBYP562" data-tooltip="【入门】宇航员选拔"><b>DFBYP562</b></a></li> <li> <a href="/d/W0001/p/DFBYP394" data-tooltip="【入门】与7无关的数？"><b>DFBYP394</b></a></li> <li> <a href="/d/W0001/p/DFBYP615" data-tooltip="【入门】输出满足条件的整数4"><b>DFBYP615</b></a></li> <li> <a href="/d/W0001/p/DFBYP614" data-tooltip="【入门】输出满足条件的整数3"><b>DFBYP614</b></a></li> <li> <a href="/d/W0001/p/DFBYP684" data-tooltip="【入门】数字直角（1）"><b>DFBYP684</b></a></li> <li> <a href="/d/W0001/p/DFBYP559" data-tooltip="【入门】游乐设施"><b>DFBYP559</b></a></li> <li> <a href="/d/W0001/p/DFBYP549" data-tooltip="【入门】计算考试需要的教室"><b>DFBYP549</b></a></li> <li> <a href="/d/W0001/p/F0001P597" data-tooltip="画矩形"><b>F0001P597</b></a></li> <li> <a href="/d/W0001/p/DFBYP395" data-tooltip="【入门】恐龙园买玩具？"><b>DFBYP395</b></a></li> </ul></div> </div> </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">最近活动</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <ul> <li><a class="contest-type--homework" href="/d/W0001/homework/668f293e2cc4de29b559a5be"> 2024年7月13日8:30班【2】暑假第6课 循环模拟强化 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667be010d5ee05a9cfe6fd2f"> 2024年7月12日 8:30班【2】暑假第5课 一阶段总回顾【顺序、分支】 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bde3ed5ee05a9cfe6f8ef"> 2024年7月11日 8:30班【2】暑假第4课 枚举[循环] <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdcccd5ee05a9cfe6f450"> 2024年7月10日 8:30班【2】暑假第3课 嵌套循环的进阶应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdc55d5ee05a9cfe6f317"> 2024年7月9日 8:30班【2】暑假第2课 自定义函数进阶 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdc07d5ee05a9cfe6f284"> 2024年7月8日 8:30班【2】暑假第1课 自定义函数应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/666d6a5a7eae9f89336ed30d"> 2024年6月15日 周六晚6:30 因数问题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/666314fc9ce3ee63df634941"> 2024年6月8日 周六晚6:30 均值进阶、最值问题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66593e3415bf1e7980b2fe79"> 2024年6月1日 周六晚6:30 循环输入的应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6652b4e3731e4f15703ff9ef"> 2024年5月26日 周日上午10:40 自定义函数基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6651c79c731e4f15703ed166"> 2024年5月25日 周六晚6:30 for进阶 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6649ecfda8161cfa14308f88"> 2024年5月19日 周日晚6:30 循环嵌套枚举 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6640c00d9ff061bfd2eb819a"> 2024年5月12日 循环嵌套与嵌套枚举 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66376112d8fe700f0a96732f"> 2024年5月5日 郝铮 循环嵌套 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/661a03ee87b210d79c0e11f0"> 2024年4月13日_一阶段测试前_知识点回顾补习题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/660e0c1c05e2e24e525c588c"> 2024年4月4日_模拟过程2 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66093b432faa61e7f72ac958"> 2024年3月31日_郝铮_模拟过程基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/660000e5f26c85f66d34c2d5"> 2024年3月24日_周日晚6:30_循环基础回顾 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65f6c9990af942acbf2418a5"> 2024年3月17日_周日晚6:30_最小公倍数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65ed97971262bacd76242f84"> 2024年3月10日_郝铮个人练习题_公约数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65e7f114f1cf5ef3a82ec837"> 周六晚6:30班_补题练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d69fa2b2cb853d3a253eea"> 2024年2月22日__重新组合数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d40e696856afdb5df48526"> 2024年2月20日_while循环拆数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d14f48c82e8ec49fe5e2af"> 2024年2月18日_郝铮练习题_while循环基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65bae748057b4522090398ac"> 2024年2月1日_因数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65a35178bc37e08db95d4b3b"> 2024年1月28日_郝铮_循环输入计数、均值、最值 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6590b6986094e1d6b15a2245"> 2023年12月31日_郝铮_求和与计数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65869e8e1ad900d8eae866c3"> 2023年12月23日_郝铮_for循环基础与分支回顾 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/657502065031d8469e60face"> 2023年12月10日_郝铮_分支难题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6550387ea68626844040fbc6"> 2023年11月12日_周日九点一对一_分支回顾练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/653dad8b9a295856447bfa9a"> 2023年10月29日_周日九点一对一_郝铮_顺序与分支综合练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6529f0de76ea90cdae3b7448"> 分支进阶练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/651cfa63808ae6bc3efef204"> 2023年10月4日_单独辅导班_赋值语句与模拟法 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64fc5256dca1ff8e071ec29b"> 周日九点一对一单循环枚举法的应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64f29438e70cd31d0ea2b064"> 2023年9月2日_秋零基础班一 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64dc8cd438608da1af9a27d8"> 一期零基础单独辅导班第4课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64dacbb538608da1af98b4a5"> 一期零基础单独辅导班第3课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64d8499b38608da1af97771a"> 一期零基础单独辅导班第2课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64d7965b38608da1af9747ce"> 一期零基础单独辅导班第1课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> </ul> </div> </div> </li><li class="section__tab-item"> <h1 class="section__tab-title">Stat</h1> <div class="section__tab-main"> <div class="typo section__body" id="history_stat" style="width:100%;height:500px"> </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">Rating</h1> <div class="section__tab-main"> <div class="typo section__body" id="history_rating" style="width:100%;height:500px"></div> </div> </li> </ul> </div> </div> </div> </div> <div class="medium-3 columns"> <div class="section side"> <div class="section__body"> <div class="balancer sidebar-user-stat"> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">213</div> <div class="numbox__text">已递交</div> </div> </div> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">203</div> <div class="numbox__text">已通过</div> </div> </div> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">0</div> <div class="numbox__text">题解被赞</div> </div> </div> </div> </div> </div> <div class="section side"> <div class="section__header"> <h2 class="section__title">题目标签</h2> </div> <div class="typo section__body no-media"> <dl class="exlarge horizontal"> <dt>一阶段</dt> <dd>98</dd> <dt>单循环结构</dt> <dd>48</dd> <dt>多分支、嵌套分支结构</dt> <dd>13</dd> <dt>双分支结构</dt> <dd>13</dd> <dt>循环嵌套-打印图形</dt> <dd>12</dd> <dt>自定义函数</dt> <dd>12</dd> <dt>求和计数</dt> <dd>10</dd> <dt>数据的输入和输出</dt> <dd>9</dd> <dt>数据的运算</dt> <dd>9</dd> <dt>for循环</dt> <dd>9</dd> <dt>短除法拆数</dt> <dd>8</dd> <dt>分支结构</dt> <dd>8</dd> <dt>质数</dt> <dd>7</dd> <dt>输入输出</dt> <dd>7</dd> <dt>多重循环结构</dt> <dd>6</dd> <dt>O2优化</dt> <dd>6</dd> <dt>简单循环</dt> <dd>6</dd> <dt>均值</dt> <dd>5</dd> <dt>循环结构</dt> <dd>5</dd> <dt>while循环</dt> <dd>4</dd> </dl> </div> </div> </div> </div> </div> <div class="footer"> <div class="row"><div class="columns"> <div class="row footer__links"> <div class="medium-3 large-2 columns footer__category expandable"> <h1> 状态 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="/d/W0001/record">评测队列</a></li> <li class="footer__category__item"><a href="/d/W0001/status">服务状态</a></li> </ul></div> </div> <div class="medium-3 large-2 columns footer__category expandable"> <h1> 开发 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="https://github.com/hydro-dev/Hydro" target="_blank">开源</a></li> <li class="footer__category__item"><a href="/d/W0001/api">API</a></li> </ul></div> </div> <div class="medium-3 large-2 columns footer__category expandable end"> <h1> 支持 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="/d/W0001/wiki/help">帮助</a></li> <li class="footer__category__item"><a href="/d/W0001/wiki/about#contact">QQ 群</a></li> </ul></div> </div> </div> <div class="footer__extra-link clearfix"> <div class="footer__extra-left"> <ol class="clearfix"> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about">关于</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#contact">联系我们</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#privacy">隐私</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#tos">服务条款</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#contact">版权申诉</a></li> <li class="footer__extra-link-item nojs--hide" data-dropdown-target="#menu-footer-lang"> <span><span class="icon icon-global"></span> Language <span class="icon icon-expand_less"></span></span> <ol class="dropdown-target menu" id="menu-footer-lang"><li class="menu__item"><a class="menu__link" href="/d/W0001/language/en">English</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/ko">한국어</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/zh">简体中文</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/zh_TW">正體中文</a></li></ol> </li> <li class="footer__extra-link-item"> <a href="/legacy?legacy=true">兼容模式</a> </li> <li class="footer__extra-link-item nojs--hide" data-dropdown-target="#menu-footer-theme"> <span><span class="icon icon-global"></span> 主题 <span class="icon icon-expand_less"></span></span> <ol class="dropdown-target menu" id="menu-footer-theme"> <li class="menu__item"><a class="menu__link" href="/d/W0001/set_theme/light">亮色</a></li> <li class="menu__item"><a class="menu__link" href="/d/W0001/set_theme/dark">暗色</a></li> </ol> </li> </ol> </div> <div class="footer__extra-right"> <ol class="clearfix"><li class="footer__extra-link-item"></li><li class="footer__extra-link-item"><style>.uname--lv1{color:#cccccc!important;}.uname--lv2{color:green!important;}.uname--lv3{color:#03a89e!important;}.uname--lv4{color:blue!important;}.uname--lv5{color:#a0a!important;}.uname--lv6{color:#ffcc87!important;}.uname--lv7{color:#ffbb55!important;}.uname--lv8{color:#ff7777!important;}.uname--lv9{color:#ff3333!important;}.uname--lv10{color:#aa0100!important;}.badge--lv1,.badge--lv2,.badge--lv3,.badge--lv4,.badge--lv5,.badge--lv6,.badge--lv7,.badge--lv8,.badge--lv9,.badge--lv10{display:none!important;}</style> </li><li class="footer__extra-link-item"></li><li class="footer__extra-link-item">Worker 0, 40ms</li> <!-- Prepare 0ms --> <!-- Method 11ms --> <li class="footer__extra-link-item">Powered by <a href="https://hydro.js.org">Hydro v4.12.3</a> Community</li> </ol> </div> </div> </div></div> </div> </div> <script> var UiContextNew = '{"udoc":{"_id":1051,"mail":"zpZAWdPXVxff@hydro.local","uname":"\u90DD\u94EE","hashType":"hydro","priv":4,"regat":"2023-07-06T10:09:52.394Z","loginat":"2024-02-19T11:31:20.407Z","perm":"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","role":"\u5B66\u751F","scope":"BigInt::-1","tfa":false,"authn":false,"group":["\u5468\u65E5\u4E0A\u534810:40","\u5468\u65E5\u665A6:30","1051"],"domains":[],"viewLang":"zh","timeZone":"Asia/Shanghai","codeLang":"cc.cc14o2","codeTemplate":"","avatar":"gravatar:zpZAWdPXVxff@hydro.local","gender":2,"school":"Turing","studentId":"1234567","phone":"15169626699","backgroundImage":"/components/profile/backgrounds/1.jpg","unreadMsg":0,"pinnedDomains":["F0001","P001","W0001"],"fontFamily":"Open Sans","codeFontFamily":"Source Code Pro","preferredEditorType":"sv","monacoTheme":"vs-light","theme":"light","showInvisibleChar":false,"formatCode":true,"realname":"\u90DD\u94EE","skipAnimate":false,"showTimeAgo":true,"coin":57200,"displayName":"\u90DD\u94EE","nAccept":203,"nSubmit":213,"rp":0,"rpInfo":{},"level":0},"history":[{"time":"2024-07-13T16:00:00.000Z","nAccept":203,"rp":0,"rpInfo":{}},{"time":"2024-07-12T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":13,"newAccept":8,"nAccept":203},{"time":"2024-07-11T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":21,"newAccept":12,"nAccept":197},{"time":"2024-07-10T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":14,"newAccept":9,"nAccept":185},{"time":"2024-07-09T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":10,"newAccept":4,"nAccept":176},{"time":"2024-07-08T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":6,"newAccept":5,"nAccept":172},{"time":"2024-07-07T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-06T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-05T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-04T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-03T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-02T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-01T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-30T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-29T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-28T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-27T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-26T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-25T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-24T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-23T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-22T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-21T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-20T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-19T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-18T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-17T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-16T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-15T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":21,"newAccept":5,"nAccept":167},{"time":"2024-06-14T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":2,"newAccept":1,"nAccept":166}]}'; var UserContextNew = '{}'; </script> </body> </html>``` ```
.user-profile-bg { background-image: url("/components/profile/backgrounds/1.jpg"), url("/components/profile/backgrounds/1.jpg"); }郝铮 (郝铮)
UID: 1051, 注册于 2023-7-6 18:09:52, 最后登录于 2024-2-19 19:31:20, 最后活动于 2024-7-13 9:03:15.
解决了 203 道题目，RP: 0 (No. ?)
-
个人简介
该用户太懒，这里啥也没写 (´・ω・｀)</div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">通过的题目</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <div class="row"> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P381" data-tooltip="角谷猜想"><b>A1002P381</b></a></li> <li> <a href="/d/W0001/p/A1002P17" data-tooltip="一尺之棰"><b>A1002P17</b></a></li> <li> <a href="/d/W0001/p/A1002P18" data-tooltip="小明学游泳"><b>A1002P18</b></a></li> <li> <a href="/d/W0001/p/A1002P128" data-tooltip="数字统计"><b>A1002P128</b></a></li> <li> <a href="/d/W0001/p/A1002P386" data-tooltip="数中有几个0"><b>A1002P386</b></a></li> <li> <a href="/d/W0001/p/A1002P153" data-tooltip="求最小因数"><b>A1002P153</b></a></li> <li> <a href="/d/W0001/p/A1002P573" data-tooltip="求最大公约数"><b>A1002P573</b></a></li> <li> <a href="/d/W0001/p/A1002P574" data-tooltip="两个自然数m和n的最小公倍数"><b>A1002P574</b></a></li> <li> <a href="/d/W0001/p/A1002P575" data-tooltip="最大正方形边长"><b>A1002P575</b></a></li> <li> <a href="/d/W0001/p/A1002P436" data-tooltip="数值计算"><b>A1002P436</b></a></li> <li> <a href="/d/W0001/p/A1002P49" data-tooltip="输出第二个整数"><b>A1002P49</b></a></li> <li> <a href="/d/W0001/p/A1002P50" data-tooltip="输入和输出实型数据"><b>A1002P50</b></a></li> <li> <a href="/d/W0001/p/A1002P52" data-tooltip="变量的解释"><b>A1002P52</b></a></li> <li> <a href="/d/W0001/p/A1002P53" data-tooltip="换行分隔输出"><b>A1002P53</b></a></li> <li> <a href="/d/W0001/p/A1002P801" data-tooltip="输入输出3"><b>A1002P801</b></a></li> <li> <a href="/d/W0001/p/A1002P54" data-tooltip="字符菱形"><b>A1002P54</b></a></li> <li> <a href="/d/W0001/p/A1002P560" data-tooltip="图形打印正方形"><b>A1002P560</b></a></li> <li> <a href="/d/W0001/p/A1002P593" data-tooltip="图形打印长方形"><b>A1002P593</b></a></li> <li> <a href="/d/W0001/p/A1002P594" data-tooltip="图形打印直角三角形"><b>A1002P594</b></a></li> <li> <a href="/d/W0001/p/A1002P596" data-tooltip="数字图形正方形一"><b>A1002P596</b></a></li> <li> <a href="/d/W0001/p/A1002P597" data-tooltip="数字图形正方形二"><b>A1002P597</b></a></li> <li> <a href="/d/W0001/p/A1002P598" data-tooltip="数字图形三角形一"><b>A1002P598</b></a></li> <li> <a href="/d/W0001/p/A1002P599" data-tooltip="数字图形三角形二"><b>A1002P599</b></a></li> <li> <a href="/d/W0001/p/A1002P562" data-tooltip="星号倒直角"><b>A1002P562</b></a></li> <li> <a href="/d/W0001/p/A1002P563" data-tooltip="平行四边形"><b>A1002P563</b></a></li> <li> <a href="/d/W0001/p/A1002P602" data-tooltip="星号倒等腰三角形"><b>A1002P602</b></a></li> <li> <a href="/d/W0001/p/A1002P568" data-tooltip="星号梯形"><b>A1002P568</b></a></li> <li> <a href="/d/W0001/p/A1002P569" data-tooltip="9*9乘法公式"><b>A1002P569</b></a></li> <li> <a href="/d/W0001/p/A1002P650" data-tooltip="公园买门票"><b>A1002P650</b></a></li> <li> <a href="/d/W0001/p/A1002P635" data-tooltip="阿凡提的难题"><b>A1002P635</b></a></li> <li> <a href="/d/W0001/p/A1002P638" data-tooltip="三色球问题"><b>A1002P638</b></a></li> <li> <a href="/d/W0001/p/A1002P385" data-tooltip="数位之和"><b>A1002P385</b></a></li> <li> <a href="/d/W0001/p/A1002P51" data-tooltip="输入输出字符型数据"><b>A1002P51</b></a></li> <li> <a href="/d/W0001/p/A1002P46" data-tooltip="声明变量并输出"><b>A1002P46</b></a></li> <li> <a href="/d/W0001/p/A1002P477" data-tooltip="输出图形"><b>A1002P477</b></a></li> <li> <a href="/d/W0001/p/A1002P663" data-tooltip="判断能否被3，5，7整除"><b>A1002P663</b></a></li> <li> <a href="/d/W0001/p/A1002P111" data-tooltip="求四个数的最大数"><b>A1002P111</b></a></li> <li> <a href="/d/W0001/p/A1002P3" data-tooltip="小鱼的游泳时间"><b>A1002P3</b></a></li> <li> <a href="/d/W0001/p/A1002P60" data-tooltip="节省多少时间"><b>A1002P60</b></a></li> <li> <a href="/d/W0001/p/A1002P61" data-tooltip="输出整数12345各个位上的数字之和"><b>A1002P61</b></a></li> <li> <a href="/d/W0001/p/A1002P584" data-tooltip="分磁带"><b>A1002P584</b></a></li> <li> <a href="/d/W0001/p/A1002P583" data-tooltip="分钱"><b>A1002P583</b></a></li> <li> <a href="/d/W0001/p/A1002P987" data-tooltip="A + B 问题"><b>A1002P987</b></a></li> <li> <a href="/d/W0001/p/A1002P67" data-tooltip="时分秒"><b>A1002P67</b></a></li> <li> <a href="/d/W0001/p/A1002P587" data-tooltip="【深基2.例8】再分肥宅水"><b>A1002P587</b></a></li> <li> <a href="/d/W0001/p/A1002P771" data-tooltip="五舍六入"><b>A1002P771</b></a></li> <li> <a href="/d/W0001/p/A1002P581" data-tooltip="鸡兔同笼问题"><b>A1002P581</b></a></li> <li> <a href="/d/W0001/p/A1002P582" data-tooltip="车棚"><b>A1002P582</b></a></li> <li> <a href="/d/W0001/p/A1002P585" data-tooltip="【基础题】五位好朋友相聚"><b>A1002P585</b></a></li> <li> <a href="/d/W0001/p/A1002P980" data-tooltip="分糖果"><b>A1002P980</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P557" data-tooltip="交换输出"><b>A1002P557</b></a></li> <li> <a href="/d/W0001/p/A1002P559" data-tooltip="交换输出 3"><b>A1002P559</b></a></li> <li> <a href="/d/W0001/p/A1002P77" data-tooltip="整数判断"><b>A1002P77</b></a></li> <li> <a href="/d/W0001/p/A1002P94" data-tooltip="超市卖电池"><b>A1002P94</b></a></li> <li> <a href="/d/W0001/p/A1002P89" data-tooltip="苹果和虫子"><b>A1002P89</b></a></li> <li> <a href="/d/W0001/p/A1002P92" data-tooltip="需要几辆车"><b>A1002P92</b></a></li> <li> <a href="/d/W0001/p/A1002P95" data-tooltip="十位大还是个位大"><b>A1002P95</b></a></li> <li> <a href="/d/W0001/p/A1002P88" data-tooltip="点和正方形的关系"><b>A1002P88</b></a></li> <li> <a href="/d/W0001/p/A1002P694" data-tooltip="顺序输出"><b>A1002P694</b></a></li> <li> <a href="/d/W0001/p/A1002P695" data-tooltip="顺序输出2"><b>A1002P695</b></a></li> <li> <a href="/d/W0001/p/A1002P91" data-tooltip="装苹果"><b>A1002P91</b></a></li> <li> <a href="/d/W0001/p/A1002P85" data-tooltip="有一门课不及格的学生"><b>A1002P85</b></a></li> <li> <a href="/d/W0001/p/A1002P83" data-tooltip="判断闰年"><b>A1002P83</b></a></li> <li> <a href="/d/W0001/p/A1002P101" data-tooltip="乘车费用"><b>A1002P101</b></a></li> <li> <a href="/d/W0001/p/A1002P772" data-tooltip="是否是连续奇数"><b>A1002P772</b></a></li> <li> <a href="/d/W0001/p/A1002P463" data-tooltip="水仙花数 1"><b>A1002P463</b></a></li> <li> <a href="/d/W0001/p/A1002P81" data-tooltip="判断3的倍数"><b>A1002P81</b></a></li> <li> <a href="/d/W0001/p/A1002P977" data-tooltip="收集瓶盖赢大奖"><b>A1002P977</b></a></li> <li> <a href="/d/W0001/p/A1002P484" data-tooltip="小明家的电费"><b>A1002P484</b></a></li> <li> <a href="/d/W0001/p/A1002P815" data-tooltip="求生者的欲望"><b>A1002P815</b></a></li> <li> <a href="/d/W0001/p/A1002P527" data-tooltip="国王移动的步数"><b>A1002P527</b></a></li> <li> <a href="/d/W0001/p/A1002P485" data-tooltip="出租车费（小学组2015第一题）"><b>A1002P485</b></a></li> <li> <a href="/d/W0001/p/A1002P437" data-tooltip="输出30个星号"><b>A1002P437</b></a></li> <li> <a href="/d/W0001/p/A1002P13" data-tooltip="输出1到10的整数"><b>A1002P13</b></a></li> <li> <a href="/d/W0001/p/A1002P21" data-tooltip="100以内的偶数"><b>A1002P21</b></a></li> <li> <a href="/d/W0001/p/A1002P237" data-tooltip="输出符合条件的数"><b>A1002P237</b></a></li> <li> <a href="/d/W0001/p/A1002P34" data-tooltip="输入n，输出算式1+2+3+...+n"><b>A1002P34</b></a></li> <li> <a href="/d/W0001/p/A1002P140" data-tooltip="整数的个数"><b>A1002P140</b></a></li> <li> <a href="/d/W0001/p/A1002P32" data-tooltip="计算1+2+…+100的和"><b>A1002P32</b></a></li> <li> <a href="/d/W0001/p/A1002P137" data-tooltip="奇数求和"><b>A1002P137</b></a></li> <li> <a href="/d/W0001/p/A1002P33" data-tooltip="求和1"><b>A1002P33</b></a></li> <li> <a href="/d/W0001/p/A1002P142" data-tooltip="求公式和"><b>A1002P142</b></a></li> <li> <a href="/d/W0001/p/A1002P136" data-tooltip="求和2"><b>A1002P136</b></a></li> <li> <a href="/d/W0001/p/A1002P141" data-tooltip="奥运奖牌计数"><b>A1002P141</b></a></li> <li> <a href="/d/W0001/p/A1002P144" data-tooltip="均值"><b>A1002P144</b></a></li> <li> <a href="/d/W0001/p/A1002P150" data-tooltip="整数序列的元素最大跨度值"><b>A1002P150</b></a></li> <li> <a href="/d/W0001/p/A1002P154" data-tooltip="求最大因数"><b>A1002P154</b></a></li> <li> <a href="/d/W0001/p/A1002P155" data-tooltip="判断质数"><b>A1002P155</b></a></li> <li> <a href="/d/W0001/p/A1002P158" data-tooltip="质数问题1"><b>A1002P158</b></a></li> <li> <a href="/d/W0001/p/A1002P23" data-tooltip="小青蛙回来了"><b>A1002P23</b></a></li> <li> <a href="/d/W0001/p/A1002P80" data-tooltip="冰淇淋"><b>A1002P80</b></a></li> <li> <a href="/d/W0001/p/A1002P64" data-tooltip="矩形面积"><b>A1002P64</b></a></li> <li> <a href="/d/W0001/p/A1002P807" data-tooltip="快递费用"><b>A1002P807</b></a></li> <li> <a href="/d/W0001/p/A1002P747" data-tooltip="上学迟到.V2"><b>A1002P747</b></a></li> <li> <a href="/d/W0001/p/A1002P93" data-tooltip="购买水杯"><b>A1002P93</b></a></li> <li> <a href="/d/W0001/p/W0001P1210" data-tooltip="输出数字时钟"><b>W0001P1210</b></a></li> <li> <a href="/d/W0001/p/A1002P100" data-tooltip="包装箱"><b>A1002P100</b></a></li> <li> <a href="/d/W0001/p/A1002P102" data-tooltip="冷饮的价格"><b>A1002P102</b></a></li> <li> <a href="/d/W0001/p/A1002P104" data-tooltip="小明暑假的零花钱"><b>A1002P104</b></a></li> <li> <a href="/d/W0001/p/A1002P105" data-tooltip="求数的量级？"><b>A1002P105</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P109" data-tooltip="象棋大赛"><b>A1002P109</b></a></li> <li> <a href="/d/W0001/p/A1002P114" data-tooltip="BMI"><b>A1002P114</b></a></li> <li> <a href="/d/W0001/p/A1002P115" data-tooltip="数的性质"><b>A1002P115</b></a></li> <li> <a href="/d/W0001/p/A1002P14" data-tooltip="倒序输出10以内的自然数"><b>A1002P14</b></a></li> <li> <a href="/d/W0001/p/A1002P15" data-tooltip="输出2到n-1所有的整数"><b>A1002P15</b></a></li> <li> <a href="/d/W0001/p/A1002P19" data-tooltip="输出n以内所有的整数"><b>A1002P19</b></a></li> <li> <a href="/d/W0001/p/A1002P139" data-tooltip="奇数以及偶数的和"><b>A1002P139</b></a></li> <li> <a href="/d/W0001/p/A1002P145" data-tooltip="求整数的和与均值"><b>A1002P145</b></a></li> <li> <a href="/d/W0001/p/A1002P146" data-tooltip="财务管理"><b>A1002P146</b></a></li> <li> <a href="/d/W0001/p/A1002P147" data-tooltip="短信计费"><b>A1002P147</b></a></li> <li> <a href="/d/W0001/p/A1002P402" data-tooltip="最大值与最小值"><b>A1002P402</b></a></li> <li> <a href="/d/W0001/p/A1002P151" data-tooltip="数据统计"><b>A1002P151</b></a></li> <li> <a href="/d/W0001/p/A1002P159" data-tooltip="质数问题2"><b>A1002P159</b></a></li> <li> <a href="/d/W0001/p/A1002P456" data-tooltip="判断两位数的质数"><b>A1002P456</b></a></li> <li> <a href="/d/W0001/p/A1002P247" data-tooltip="[语言月赛202212] 洛谷三角洲"><b>A1002P247</b></a></li> <li> <a href="/d/W0001/p/A1002P1059" data-tooltip="剧院广场"><b>A1002P1059</b></a></li> <li> <a href="/d/W0001/p/A1002P112" data-tooltip="至少要买几瓶止咳糖浆？"><b>A1002P112</b></a></li> <li> <a href="/d/W0001/p/LUOGUP420" data-tooltip="小鱼会有危险吗"><b>LUOGUP420</b></a></li> <li> <a href="/d/W0001/p/A1002P489" data-tooltip="苹果和虫子2"><b>A1002P489</b></a></li> <li> <a href="/d/W0001/p/A1002P825" data-tooltip="数字口袋"><b>A1002P825</b></a></li> <li> <a href="/d/W0001/p/LUOGUP75" data-tooltip="[NOIP2012 普及组] 质因数分解"><b>LUOGUP75</b></a></li> <li> <a href="/d/W0001/p/LUOGUP7684" data-tooltip="最大公约数和最小公倍数"><b>LUOGUP7684</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8326" data-tooltip="[信息与未来 2018] 最大公约数"><b>LUOGUP8326</b></a></li> <li> <a href="/d/W0001/p/LUOGUP29" data-tooltip="[NOIP2001 普及组] 最大公约数和最小公倍数问题"><b>LUOGUP29</b></a></li> <li> <a href="/d/W0001/p/P001P775" data-tooltip="开学大采购"><b>P001P775</b></a></li> <li> <a href="/d/W0001/p/A1002P143" data-tooltip="计算公式的和2"><b>A1002P143</b></a></li> <li> <a href="/d/W0001/p/P001P776" data-tooltip="换钞票"><b>P001P776</b></a></li> <li> <a href="/d/W0001/p/P001P773" data-tooltip="买小猫小狗"><b>P001P773</b></a></li> <li> <a href="/d/W0001/p/A1002P398" data-tooltip="满足条件的数累加"><b>A1002P398</b></a></li> <li> <a href="/d/W0001/p/LUOGUP4670" data-tooltip="【深基4.例3】分类平均"><b>LUOGUP4670</b></a></li> <li> <a href="/d/W0001/p/A1002P427" data-tooltip="与指定数字相同的数的个数"><b>A1002P427</b></a></li> <li> <a href="/d/W0001/p/A1002P403" data-tooltip="求最高分最低分"><b>A1002P403</b></a></li> <li> <a href="/d/W0001/p/A1002P465" data-tooltip="【深基4.例3】分类平均"><b>A1002P465</b></a></li> <li> <a href="/d/W0001/p/A1002P395" data-tooltip="财务管理"><b>A1002P395</b></a></li> <li> <a href="/d/W0001/p/A1002P236" data-tooltip="多边形内角和"><b>A1002P236</b></a></li> <li> <a href="/d/W0001/p/A1002P401" data-tooltip="计算公式的和2"><b>A1002P401</b></a></li> <li> <a href="/d/W0001/p/A1002P526" data-tooltip="Book Reading"><b>A1002P526</b></a></li> <li> <a href="/d/W0001/p/A1002P424" data-tooltip="含k个3的数"><b>A1002P424</b></a></li> <li> <a href="/d/W0001/p/A1002P1112" data-tooltip="[语言月赛202304] 扶苏与 0"><b>A1002P1112</b></a></li> <li> <a href="/d/W0001/p/A1002P460" data-tooltip="最佳身体状态"><b>A1002P460</b></a></li> <li> <a href="/d/W0001/p/A1002P422" data-tooltip="倒序组合数字"><b>A1002P422</b></a></li> <li> <a href="/d/W0001/p/A1002P423" data-tooltip="数字反转"><b>A1002P423</b></a></li> <li> <a href="/d/W0001/p/A1002P457" data-tooltip="五位数倒序组合判断质数"><b>A1002P457</b></a></li> <li> <a href="/d/W0001/p/A1002P497" data-tooltip="短信计费"><b>A1002P497</b></a></li> <li> <a href="/d/W0001/p/A1002P399" data-tooltip="整数的个数"><b>A1002P399</b></a></li> <li> <a href="/d/W0001/p/A1002P671" data-tooltip="数1的个数"><b>A1002P671</b></a></li> <li> <a href="/d/W0001/p/A1002P667" data-tooltip="第n小的质数"><b>A1002P667</b></a></li> <li> <a href="/d/W0001/p/A1002P721" data-tooltip="定义函数输出《静夜思》"><b>A1002P721</b></a></li> <li> <a href="/d/W0001/p/A1002P722" data-tooltip="定义一个有参数的函数"><b>A1002P722</b></a></li> <li> <a href="/d/W0001/p/A1002P724" data-tooltip="求两个整数的最大数"><b>A1002P724</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P732" data-tooltip="求三个数的最大数"><b>A1002P732</b></a></li> <li> <a href="/d/W0001/p/A1002P726" data-tooltip="素数的个数"><b>A1002P726</b></a></li> <li> <a href="/d/W0001/p/A1002P728" data-tooltip="回文数个数"><b>A1002P728</b></a></li> <li> <a href="/d/W0001/p/A1002P730" data-tooltip="挛生素数"><b>A1002P730</b></a></li> <li> <a href="/d/W0001/p/A1002P731" data-tooltip="求出N以内的全部素数，并按每行五个数显示"><b>A1002P731</b></a></li> <li> <a href="/d/W0001/p/A1002P161" data-tooltip="纯粹素数"><b>A1002P161</b></a></li> <li> <a href="/d/W0001/p/A1002P758" data-tooltip="数根"><b>A1002P758</b></a></li> <li> <a href="/d/W0001/p/A1002P162" data-tooltip="纯粹合数"><b>A1002P162</b></a></li> <li> <a href="/d/W0001/p/A1002P959" data-tooltip="【深基3.例7】肥胖问题"><b>A1002P959</b></a></li> <li> <a href="/d/W0001/p/A1002P860" data-tooltip="均值"><b>A1002P860</b></a></li> <li> <a href="/d/W0001/p/A1002P991" data-tooltip="[NOIP2004 普及组] 不高兴的津津"><b>A1002P991</b></a></li> <li> <a href="/d/W0001/p/A1002P492" data-tooltip="与7无关的数"><b>A1002P492</b></a></li> <li> <a href="/d/W0001/p/A1002P435" data-tooltip="回文数"><b>A1002P435</b></a></li> <li> <a href="/d/W0001/p/P001P296" data-tooltip="分跳绳"><b>P001P296</b></a></li> <li> <a href="/d/W0001/p/P001P27" data-tooltip="[语言月赛202210] 玉桂狗"><b>P001P27</b></a></li> <li> <a href="/d/W0001/p/A1002P748" data-tooltip="打折优惠"><b>A1002P748</b></a></li> <li> <a href="/d/W0001/p/A1002P1045" data-tooltip="百货商场"><b>A1002P1045</b></a></li> <li> <a href="/d/W0001/p/A1002P832" data-tooltip="课桌"><b>A1002P832</b></a></li> <li> <a href="/d/W0001/p/A1002P499" data-tooltip="药房管理"><b>A1002P499</b></a></li> <li> <a href="/d/W0001/p/A1002P823" data-tooltip="集卡"><b>A1002P823</b></a></li> <li> <a href="/d/W0001/p/A1002P999" data-tooltip="Div"><b>A1002P999</b></a></li> <li> <a href="/d/W0001/p/A1002P1148" data-tooltip="音乐播放器"><b>A1002P1148</b></a></li> <li> <a href="/d/W0001/p/A1002P1155" data-tooltip="判断偶数"><b>A1002P1155</b></a></li> <li> <a href="/d/W0001/p/A1002P1175" data-tooltip="安排座位"><b>A1002P1175</b></a></li> <li> <a href="/d/W0001/p/A1002P639" data-tooltip="求因子数量"><b>A1002P639</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6847" data-tooltip="输出绝对值"><b>LUOGUP6847</b></a></li> <li> <a href="/d/W0001/p/LUOGUP9429" data-tooltip="[语言月赛 202401] 分饼干 I"><b>LUOGUP9429</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8744" data-tooltip="[NICA #2] 台式烤香肠"><b>LUOGUP8744</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6858" data-tooltip="分段函数"><b>LUOGUP6858</b></a></li> <li> <a href="/d/W0001/p/LUOGUP46" data-tooltip="[NOIP2005 普及组] 陶陶摘苹果"><b>LUOGUP46</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP457" data-tooltip="晶晶赴约会"><b>OPENJUDGEP457</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP577" data-tooltip="求平均年龄"><b>OPENJUDGEP577</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP596" data-tooltip="字符三角形"><b>OPENJUDGEP596</b></a></li> <li> <a href="/d/W0001/p/DFBYP396" data-tooltip="【入门】小丽找数？"><b>DFBYP396</b></a></li> <li> <a href="/d/W0001/p/DFBYP598" data-tooltip="【入门】请输出n~1之间所有的整数"><b>DFBYP598</b></a></li> <li> <a href="/d/W0001/p/DFBYP599" data-tooltip="【入门】请输出带有特殊尾数的数"><b>DFBYP599</b></a></li> <li> <a href="/d/W0001/p/DFBYP86" data-tooltip="【入门】寻找雷劈数"><b>DFBYP86</b></a></li> <li> <a href="/d/W0001/p/DFBYP638" data-tooltip="【入门】奇怪的数？"><b>DFBYP638</b></a></li> <li> <a href="/d/W0001/p/DFBYP91" data-tooltip="【入门】同因查找"><b>DFBYP91</b></a></li> <li> <a href="/d/W0001/p/DFBYP562" data-tooltip="【入门】宇航员选拔"><b>DFBYP562</b></a></li> <li> <a href="/d/W0001/p/DFBYP394" data-tooltip="【入门】与7无关的数？"><b>DFBYP394</b></a></li> <li> <a href="/d/W0001/p/DFBYP615" data-tooltip="【入门】输出满足条件的整数4"><b>DFBYP615</b></a></li> <li> <a href="/d/W0001/p/DFBYP614" data-tooltip="【入门】输出满足条件的整数3"><b>DFBYP614</b></a></li> <li> <a href="/d/W0001/p/DFBYP684" data-tooltip="【入门】数字直角（1）"><b>DFBYP684</b></a></li> <li> <a href="/d/W0001/p/DFBYP559" data-tooltip="【入门】游乐设施"><b>DFBYP559</b></a></li> <li> <a href="/d/W0001/p/DFBYP549" data-tooltip="【入门】计算考试需要的教室"><b>DFBYP549</b></a></li> <li> <a href="/d/W0001/p/F0001P597" data-tooltip="画矩形"><b>F0001P597</b></a></li> <li> <a href="/d/W0001/p/DFBYP395" data-tooltip="【入门】恐龙园买玩具？"><b>DFBYP395</b></a></li> </ul></div> </div> </div> </div> </li> <li class="section__tab-item">最近活动
- 2024年7月13日8:30班【2】暑假第6课 循环模拟强化 作业
- 2024年7月12日 8:30班【2】暑假第5课 一阶段总回顾【顺序、分支】 作业
- 2024年7月11日 8:30班【2】暑假第4课 枚举[循环] 作业
- 2024年7月10日 8:30班【2】暑假第3课 嵌套循环的进阶应用 作业
- 2024年7月9日 8:30班【2】暑假第2课 自定义函数进阶 作业
- 2024年7月8日 8:30班【2】暑假第1课 自定义函数应用 作业
- 2024年6月15日 周六晚6:30 因数问题 作业
- 2024年6月8日 周六晚6:30 均值进阶、最值问题 作业
- 2024年6月1日 周六晚6:30 循环输入的应用 作业
- 2024年5月26日 周日上午10:40 自定义函数基础 作业
- 2024年5月25日 周六晚6:30 for进阶 作业
- 2024年5月19日 周日晚6:30 循环嵌套枚举 作业
- 2024年5月12日 循环嵌套与嵌套枚举 作业
- 2024年5月5日 郝铮 循环嵌套 作业
- 2024年4月13日_一阶段测试前_知识点回顾补习题 作业
- 2024年4月4日_模拟过程2 作业
- 2024年3月31日_郝铮_模拟过程基础 作业
- 2024年3月24日_周日晚6:30_循环基础回顾 作业
- 2024年3月17日_周日晚6:30_最小公倍数 作业
- 2024年3月10日_郝铮个人练习题_公约数 作业
- 周六晚6:30班_补题练习 作业
- 2024年2月22日__重新组合数 作业
- 2024年2月20日_while循环拆数 作业
- 2024年2月18日_郝铮练习题_while循环基础 作业
- 2024年2月1日_因数 作业
- 2024年1月28日_郝铮_循环输入计数、均值、最值 作业
- 2023年12月31日_郝铮_求和与计数 作业
- 2023年12月23日_郝铮_for循环基础与分支回顾 作业
- 2023年12月10日_郝铮_分支难题 作业
- 2023年11月12日_周日九点一对一_分支回顾练习 作业
- 2023年10月29日_周日九点一对一_郝铮_顺序与分支综合练习 作业
- 分支进阶练习 作业
- 2023年10月4日_单独辅导班_赋值语句与模拟法 作业
- 周日九点一对一单循环枚举法的应用 作业
- 2023年9月2日_秋零基础班一 作业
- 一期零基础单独辅导班第4课时 作业
- 一期零基础单独辅导班第3课时 作业
- 一期零基础单独辅导班第2课时 作业
- 一期零基础单独辅导班第1课时 作业
-
Stat
</div> -
Rating
题目标签
- 一阶段
- 98
- 单循环结构
- 48
- 多分支、嵌套分支结构
- 13
- 双分支结构
- 13
- 循环嵌套-打印图形
- 12
- 自定义函数
- 12
- 求和计数
- 10
- 数据的输入和输出
- 9
- 数据的运算
- 9
- for循环
- 9
- 短除法拆数
- 8
- 分支结构
- 8
- 质数
- 7
- 输入输出
- 7
- 多重循环结构
- 6
- O2优化
- 6
- 简单循环
- 6
- 均值
- 5
- 循环结构
- 5
- while循环
- 4
用户 - 郝铮 - 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; }<html data-page="user_detail" data-layout="basic" class="layout--basic page--user_detail theme--dark nojs" lang="zh" data-app="Hydro"> <head> <meta charset="UTF-8"> <meta http-equiv="Content-Type" content="text/html; charset=utf-8"/> <meta http-equiv="X-UA-Compatible" content="chrome=1"/> <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1" /> <link rel="apple-touch-icon" sizes="180x180" href="https://oj.qdturing.cn/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="https://oj.qdturing.cn/favicon-16x16.png" sizes="16x16"> <link rel="canonical" href="/user/1051"> <meta name="theme-color" content="#56758f"> <meta property="og:site_name" content="Turing" /> <meta property="og:title" content="用户 - 郝铮 - Turing" /> <meta property="og:url" content="/user/1051" /> <meta property="og:image" content="https://oj.qdturing.cn/favicon-96x96.png" /> <title>用户 - 郝铮 - Turing</title> <style> 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; } </style> <link rel="stylesheet" media="all" href="https://oj.qdturing.cn/theme-4.50.2.css"> <script> var _htmlNode = document.documentElement; _htmlNode.className = _htmlNode.className.replace(' nojs', ' hasjs'); try { import('data:text/javascript,');Object.fromEntries([]);window.matchMedia('all').addEventListener('change',()=>{}); } catch(e) { const s = document.createElement('script'); s.async = false; s.src = "https://oj.qdturing.cn/polyfill-4.50.2.js"; document.head.appendChild(s); } </script> </head> <body> <script> var UiContext = '{"cdn_prefix":"https://oj.qdturing.cn/","url_prefix":"/","ws_prefix":"/","constantVersion":"70c9f5ce","domainId":"W0001","domain":{"_id":"W0001","lower":"w0001","owner":1137,"name":"\u97E6\u8001\u5E08","bulletin":"\\r\\n","roles":{"\u5B66\u751F":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800"},"avatar":"gravatar:uWMhTWY0FGe4@hydro.local","langs":"","share":""},"extraTitleContent":"\u90DD\u94EE","SWConfig":{"preload":"","hosts":["http://oj.qdturing.cn","https://oj.qdturing.cn","/","https://oj.qdturing.cn/"],"domains":[]}}'; var UserContext = '{"_id":1063,"mail":"9FYwgiQXYN08@hydro.local","uname":"\u738B\u6893\u5BB8","hashType":"hydro","priv":4,"regat":"2023-07-09T01:17:19.580Z","loginat":"2024-07-08T02:38:37.757Z","perm":"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","role":"\u5B66\u751F","scope":"BigInt::-1","tfa":false,"authn":false,"group":["\u5468\u65E5\u4E0A\u534810:40","1063"],"domains":[{"_id":"gsk1","lower":"gsk1","owner":66,"name":"EL\u8BAD\u7EC3\u8BA1\u5212","bulletin":"\u4ECE\u96F6\u5F00\u59CB\u505A\u7684\u57FA\u7840\u9898","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:4141512521","langs":"","share":"*"},{"_id":"system","lower":"system","owner":1,"name":"\u56FE\u7075\u7F16\u7A0B\u6559\u80B2","bulletin":" \\r\\n\\r\\n\\r\\n\\r\\n","roles":{"default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653953214551808165282433","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653952565927908707663873","Coach":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654073609166297577289715","Beginner":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653953215255495607059073"},"avatar":"url:https://oj.qdturing.cn/file/4/favicon.ico","langs":"","share":"*"},{"_id":"lixin3","lower":"lixin3","owner":66,"name":"\u7ACB\u65B0\u4E09\u5E74\u7EA7","bulletin":"\u4E09\u5E74\u7EA7c++\u793E\u56E2","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653958117425427716768449","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:4141512521"},{"_id":"W0001","lower":"w0001","owner":1137,"name":"\u97E6\u8001\u5E08","bulletin":"\\r\\n","roles":{"\u5B66\u751F":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800"},"avatar":"gravatar:uWMhTWY0FGe4@hydro.local","langs":"","share":""},{"_id":"Neptune","lower":"neptune","owner":66,"name":"\u4E50\u667A","bulletin":"\u6B22\u8FCE\u5927\u5BB6\u6765\u5230\u4E50\u667A\u57DF\uFF0C\u575A\u6301\u4E0D\u61C8\uFF0C\u52AA\u529B\u5B66\u4E60\uFF0C\u76F8\u4FE1\u4F60\u4E00\u5B9A\u80FD\u5728\u8FD9\u91CC\u5F97\u5230\u63D0\u9AD8~\\r\\n\\r\\n\\r\\n","roles":{"Nep":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654027002091052956910209","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653804978457923079372800","coach":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831654068997191758647392241"},"avatar":"gravatar:haiwangstars@163.com","langs":"51nod.12,openjudge.G++,luogu.11o2,cc.cc14o2,codeforces.61,codeforces.50,51nod,openjudge,luogu,cc,codeforces","share":"*"},{"_id":"Y001","lower":"y001","owner":3,"name":"\u4E8E\u8001\u5E08\u7684python\u57DF","bulletin":"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED","roles":{"stu":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881","guest":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653842461994587632205953","default":"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831653995010913575226802881"},"avatar":"qq:28015861","langs":"","share":""}],"viewLang":"zh","timeZone":"Asia/Shanghai","codeLang":"cc.cc14o2","codeTemplate":"","avatar":"//sdn.geekzu.org/avatar/27c40cafc2e6207660995464171af398?d=mm&s=128","qq":"\u4E0D\u77E5\u9053","gender":"0","bio":"\u5527\u5527\u590D\u5527\u5527\uFF0C\u6728\u5170\u5F00\u98DE\u673A\uFF0C \u5F00\u7684\u4EC0\u4E48\u673A\uFF1F\u6CE2\u97F3747\uFF01\\r\\n\\r\\n\u95EE\u5973\u4F55\u6240\u601D\uFF0C\u95EE\u5973\u4F55\u6240\u5FC6\u3002\u5973\u4EA6\u6709\u6240\u601D\uFF0C\u6CA1\u94B1\u4E70\u98DE\u673A\u3002\\r\\n\\r\\n\u6628\u591C\u89C1\u519B\u5E16\uFF0C\u8981\u7528\u8F70\u70B8\u673A\uFF0C\u98DE\u673A\u5341\u4E8C\u67B6\uFF0C\u67B6\u67B6\u4E70\u4E0D\u8D77\u3002\\r\\n\\r\\n\u963F\u7237\u65E0\u5927\u94B1\uFF0C\u6728\u5170\u65E0\u91D1\u94F6\uFF0C\u613F\u53BB\u4E70\u94A2\u94C1\uFF0C\u4ECE\u6B64\u9020\u98DE\u673A\u3002\\r\\n\\r\\n\u4E1C\u5E02\u4E70\u56FE\u7EB8\uFF0C\u897F\u5E02\u4E70\u87BA\u4E1D\uFF0C\u5357\u5E02\u4E70\u73BB\u7483\uFF0C\u5317\u5E02\u4E70\u94C1\u76AE\u3002\\r\\n\\r\\n\u65E6\u8F9E\u7237\u5A18\u53BB\uFF0C\u66AE\u5BBF\u65E7\u673A\u5E93\uFF0C\u4E0D\u95FB\u7239\u5A18\u5524\u5973\u58F0\uFF0C\u4F46\u95FB\u94C1\u76AE\u6469\u64E6\u6ECB\u5566\u58F0\u3002\\r\\n\\r\\n\u65E6\u8F9E\u673A\u5E93\u53BB\uFF0C\u66AE\u81F3\u519B\u8425\u65C1\uFF0C\u4E0D\u95FB\u7239\u5A18\u5524\u5973\u58F0\uFF0C\u4F46\u95FB\u5C06\u519B\u5927\u547C\u54C8\u54C8\u54C8\u3002\\r\\n\\r\\n\u4E07\u91CC\u5F00\u98DE\u673A\uFF0C\u5173\u5C71\u4E00\u4E0B\u6CA1\u3002\u70ED\u6C14\u4F20\u673A\u7FFC\uFF0C\u65E5\u5149\u7167\u73BB\u7483\u3002\\r\\n\\r\\n\u5C06\u519B\u88AB\u5413\u6B7B\uFF0C\u58EE\u58EB\u9B42\u5DF2\u98DE\u3002\u98DE\u6765\u649E\u5929\u5B50\uFF0C\u5929\u5B50\u8EBA\u75C5\u5E8A\uFF0E\\r\\n\\r\\n\u7B56\u52CB\u5341\u4E8C\u8F6C\uFF0C\u8D4F\u8D50\u4FE9\u8033\u5149\u3002\u53EF\u6C57\u95EE\u6240\u6B32\uFF0C\u6728\u5170\u4E0D\u613F\u8FDB\u7262\u623F\uFF1B\u613F\u5F00747\uFF0C\u98DE\u7740\u56DE\u6545\u4E61\u3002\\r\\n\\r\\n\u7239\u5A18\u95FB\u5973\u6765,\u7AEF\u8D77\u673A\u5173\u67AA\uFF1B\u963F\u59CA\u95FB\u59B9\u6765\uFF0C\u5F53\u6237\u4E3E\u624B\u67AA\uFF1B\u5C0F\u5F1F\u95FB\u59CA\u6765,\u78E8\u5200\u970D\u970D\u5411\u7239\u5A18\u3002\\r\\n\\r\\n\u5F00\u6211\u673A\u8231\u95E8\uFF0C\u8FDB\u6211\u98DE\u673A\u8231\uFF0C\u8131\u6211\u6218\u65F6\u888D\uFF0C\u6362\u4E0A\u98DE\u884C\u88C5, \u591A\u88C5\u624B\u69B4\u5F39\uFF0C\u5BF9\u5916\u67B6\u673A\u67AA\u3002\\r\\n\\r\\n\u51FA\u95E8\u57CB\u70B8\u5F39\uFF0C\u4EB2\u53CB\u7686\u60CA\u5FD9\uFF1A\u79BB\u522B\u5341\u4E8C\u5E74,\u4E0D\u77E5\u6728\u5170\u53D8\u7316\u72C2\u3002\\r\\n\\r\\n\u75AF\u5B50\u811A\u8E6C\u5730\uFF0C\u5446\u5B50\u773C\u7D27\u95ED\uFF0C\u4E24\u4EBA\u5E76\u6392\u8D70\uFF0C\u8C01\u80FD\u8BF4\u6211\u4E0D\\r\\n\u6B63\u5E38?\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF\uFF0C\u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3\\r\\n\\r\\n\u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\uFF0C\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0\\r\\n\\r\\n\u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E\uFF0C\u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\n\u7206\u96F6\u662F\u4E00\u79CD\u5BBF\u547D\uFF0CWA\u662F\u4E00\u79CD\u7EDD\u671B\\r\\n\\r\\nTLE\u662F\u4E00\u79CD\u75DB\u82E6\uFF0CRE\u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE\u662F\u4E00\u79CD\u65E0\u5948\uFF0CAC\u662F\u4E00\u79CD\u539F\u8C05\\r\\n\\r\\nAK\u662F\u4E00\u79CD\u5E7B\u60F3\uFF0C\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F\\r\\n\\r\\n\u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136\uFF0C\u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\n\u6A21\u62DF\u53EA\u4F1A\u731C\u9898\u610F\uFF0C\u8D2A\u5FC3\u53EA\u80FD\u8FC7\u6837\u4F8B\\r\\n\\r\\n\u6570\u5B66\u4E0A\u6765\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u4E00\u822C\u770B\u89C4\u5F8B\\r\\n\\r\\n\u7EC4\u5408\u6570\u5B66\u9760\u8FD0\u6C14\uFF0C\u8BA1\u7B97\u51E0\u4F55\u778E\u66B4\u529B\\r\\n\\r\\n\u56FE\u8BBA\u5F3A\u884C\u5957\u6A21\u677F\uFF0C\u6570\u8BBA\u53EA\u4F1A\uFF27\uFF23\uFF24\\r\\n\\r\\n\u9012\u5F52\u9012\u63A8\u4F24\u4E0D\u8D77\uFF0C\u641C\u7D22\u832B\u7136\uFF34\uFF2C\uFF25\\r\\n\\r\\n\u5206\u6CBB\u505A\u5F97\u50CF\u679A\u4E3E\uFF0C\u66B4\u529B\u679A\u4E3E\u6570\u7B2C\u4E00\\r\\n\\r\\n\u6570\u636E\u7ED3\u6784\u5E72\u77AA\u773C\uFF0C\u6012\u5237\u6C34\u9898\u627E\u4FE1\u5FC3\\r\\n\\r\\n\u6DA8\u59FF\u52BF\u4E5F\u4E0D\u5BB9\u6613\uFF0C\u8003\u8BD5\u4E00\u6765\u5168\u61F5\u903C\\r\\n\\r\\n\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\u3002\\r\\n\\r\\n\u6A21\u62DF\u5B9A\u60F3\u5168\uFF0C\u52A8\u89C4\u5B9A\u627E\u5BF9\u3002\\r\\n\\r\\n\u8D2A\u5FC3\u5B9A\u8BC1\u660E\uFF0C\u4E8C\u5206LM+1\u3002\\r\\n\\r\\n\u5404\u79CD\u8001\u5E08\u4E00\u56DE\u5934\\r\\n\\r\\n\u8BED\u6587\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u6B64\u5730\u7A7A\u4F59\u9EC4\u9E64\u697C\u3002\\r\\n\\r\\n\u6570\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6B21\u51FD\u6570\u5BF9\u79F0\u8F74\u3002\\r\\n\\r\\n\u82F1\u8BED\u8001\u5E08\u4E00\u56DE\u5934\uFF0Csorry\u52A0\u4E0A\u4E09\u514B\u6CB9\\r\\n\\r\\n\u5316\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6C27\u5316\u78B3\u53D8\u6C7D\u6CB9\u3002\\r\\n\\r\\n\u7269\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E00\u6839\u6760\u6746\u64AC\u5730\u7403\u3002\\r\\n\\r\\n\u751F\u7269\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8BD5\u7BA1\u5A74\u513F\u6C34\u4E2D\u6E38\u3002\\r\\n\\r\\n\u5730\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5927\u9646\u7248\u5757\u4E71\u6F02\u6D41\u3002\\r\\n\\r\\n\u52B3\u6280\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u7834\u94DC\u70C2\u94C1\u6765\u8D70\u79C0\u3002\\r\\n\\r\\n\u653F\u6CBB\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5E03\u4EC0\u6539\u884C\u5356\u8C46\u6CB9\u3002\\r\\n\\r\\n\u7F8E\u672F\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8499\u5A1C\u4E3D\u838E\u4E5F\u98CE\u6D41\u3002\\r\\n\\r\\n\u4F53\u80B2\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5965\u8FD0\u53D6\u6D88\u6253\u7BEE\u7403\u3002\\r\\n\\r\\n\u7535\u8111\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5B66\u751F\u5168\u6210\u963F\uFF31\u53CB\u3002\\r\\n\\r\\n\u5168\u4F53\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E16\u754C\u4EBA\u6C11\u6CA1\u81EA\u7531\u3002\\r\\n\\r\\n\u300A\u9006\u5B50\u541F\u300B\\r\\n\\r\\n\u6148\u6BCD\u624B\u4E2D\u5251\uFF0C\\r\\n\\r\\n\u9006\u5B50\u8EAB\u4E0A\u5288\u3002\\r\\n\\r\\n\u4E00\u79D2\u5341\u516B\u5251\uFF0C\\r\\n\\r\\n\u5251\u5251\u51FA\u66B4\u51FB\u3002\\r\\n\\r\\n\u7236\u89C1\u5B50\u672A\u51C9\uFF0C\\r\\n\\r\\n\u638F\u51FA\u4E03\u5339\u72FC\u3002\\r\\n\\r\\n\u5B50\u89C1\u4E03\u5339\u72FC\uFF0C\\r\\n\\r\\n\u77AC\u95F4\u900F\u5FC3\u51C9\u3002\\r\\n\\r\\n\u900F\u5FC3\u51C9\uFF0C\u5FC3\u98DE\u626C\u3002\\r\\n\\r\\n\u679C\u51BB\u6211\u8981\u559C\u4E4B\u90CE\u3002\\r\\n\\r\\n\u8001\u9AA5\u4F0F\u67A5\uFF0C\u5FD7\u5728\u5343\u91CC\u3002\u6A2A\u626B\u9965\u997F\uFF0C\u505A\u56DE\u81EA\u5DF1\u3002 \u4EF0\u5929\u5927\u7B11\u51FA\u95E8\u53BB\uFF0C\u5F52\u6765\u501A\u6756\u81EA\u53F9\u606F\u3002 \u5782\u6B7B\u75C5\u4E2D\u60CA\u5750\u8D77\uFF0C\u7B11\u95EE\u5BA2\u4ECE\u4F55\u5904\u6765\u3002 \u5341\u5E74\u751F\u6B7B\u4E24\u832B\u832B\uFF0C\u559C\u7F8A\u7F8A\u4E0E\u7070\u592A\u72FC\u3002 \u8FDC\u8D74\u4EBA\u95F4\u60CA\u9E3F\u5BB4\uFF0C\u9B3C\u5200\u4E00\u5F00\u770B\u4E0D\u89C1\u3002 \u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5BF9\u955C\u8D34\u82B1\u9EC4\u3002 \u4E00\u671D\u88AB\u86C7\u54AC\uFF0C\u5904\u5904\u95FB\u557C\u9E1F\u3002 \u67AF\u85E4\u8001\u6811\u660F\u9E26\uFF0C\u4E0A\u73ED\u6478\u9C7C\u56DE\u5BB6\uFF01 \u8BFB\u4E66\u7834\u4E07\u5377\uFF0C\u5377\u5377\u6709\u7237\u540D\u3002 \u60C5\u4E0D\u77E5\u6240\u8D77\uFF0C\u4E00\u5F80\u60C5\u6DF1\uFF0C\u518D\u800C\u8870\uFF0C\u4E09\u800C\u7AED\u3002 \u5929\u5802\u6709\u8DEF\u4F60\u4E0D\u8D70\uFF0C\u5B66\u6D77\u65E0\u6DAF\u82E6\u4F5C\u821F\u3002 \u5C11\u5C0F\u79BB\u5BB6\u8001\u5927\u56DE\uFF0C\u5B89\u80FD\u8FA8\u6211\u662F\u96C4\u96CC\u3002 \u5DF4\u5C71\u695A\u6C34\u51C4\u51C9\u5730\uFF0C\u871C\u96EA\u51B0\u57CE\u751C\u871C\u871C\u3002 \u543E\u8F88\u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5403\u4E2A\u6843\u6843\u597D\u51C9\u51C9\u3002 \u4EAC\u4E2D\u6709\u5584\u53E3 J \u8005\uFF0C\u4ECE\u6B64\u541B\u738B\u4E0D\u65E9\u671D\u3002\\r\\n\\r\\n\u5728\u8FD9\u5BCC\u88D5\u7684\u5E74\u4EE3\uFF0C\u8BD7\u4EBA\u4F55\u4E3A\uFF1F \u53EF\u662F\uFF0C\u4F60\u5374\u8BF4\uFF0C\u8BD7\u4EBA\u662F\u9152\u795E\u795E\u5723\u7684\u796D\u53F8\uFF0C \u5728\u795E\u5723\u7684\u9ED1\u591C\u4E2D\uFF0C\u4ED6\u8D70\u904D\u5927\u5730\u3002\\r\\n\\r\\n\u6211\u547D\u7531\u6211\u4E0D\u7531\u5929\uFF0C\u5434\u94A9\u5F2F\uFF0C\u5C55\u950B\u5BD2\u3002\\r\\n\\r\\n\u7EA2\u5C18\u5F80\u4E8B\u4ED8\u6D41\u6C34\uFF0C\u5FD8\u5C3D\u4FD7\u7F18\u59CB\u5F97\u771F\uFF0C\u4E00\u996E\u800C\u5C3D\uFF0C\u518D\u9189\u5343\u5E74\uFF01\\r\\n\\r\\n\u60CA\u6D9B\u5165\u6D77\u89C5\u87AD\u864E\uFF0C\u98CE\u96EA\u5F52\u5C71\u65A9\u5996\u90AA\u3002\\r\\n\\r\\n\u843D\u5CF0\u957F\u65E5\u5760\uFF0C\u8D77\u7B14\u53E0\u5D82\u5347\u3002\\r\\n\\r\\n\u4EBA\u6709\u60B2\u6B22AC\uFF0C\u6708\u6709\u9634\u6674DP\uFF0C\u6B64\u4E8B\u53E4\u96BETLE,\u4F46\u613F\u4EBAWA\uFF0C\u5343\u91CC\u5171MLE.\\r\\n\\r\\n#### \u4E00\u5929\u5730\u7406\u8001\u5E08\u95EE\uFF1A\u540C\u5B66\u4EEC\uFF0C\u6CB3\u6C34\u5411\u54EA\u91CC\u6D41\u5440?\u4E00\u5B66\u751F\u731B\u7AD9\u8D77\u6765\u5531\u5230\uFF1A\u5927\u6CB3\u5411\u4E1C\u6D41\u554A\u3002\\r\\n\\r\\n#### \u8001\u5E08\u6CA1\u7406\u4F1A\u4ED6\uFF0C\u63A5\u7740\u8BF4\uFF1A\u5929\u4E0A\u6709 \u591A\u5C11\u9897\u661F\u661F\u554A?\u90A3\u4F4D\u540C\u5B66\u53C8\u5531\u5230\uFF1A\u5929\u4E0A\u7684\u661F\u661F\u53C2\u5317\u6597\u554A\u3002\\r\\n\\r\\n#### \u8001\u5E08\u6C14\u6025\uFF1A\u4F60\u7ED9\u6211\u6EDA\u51FA\u53BB!\u5B66\u751F\uFF1A\u8BF4\u8D70\u54B1\u5C31\u8D70\u554A\u3002\u8001\u5E08\u65E0\u5948\u8BF4\uFF1A\u4F60\u6709\u75C5\u5427?\u5B66\u751F\uFF1A\u4F60\u6709\u6211\u6709\u5168\u90FD\u6709\u554A!\\r\\n\\r\\n#### \u8001\u5E08\uFF1A\u4F60\u518D\u8BF4\u4E00\u53E5\u8BD5\u8BD5\u2026\u5B66\u751F\uFF1A\u8DEF\u89C1\u4E0D\u5E73\u4E00\u58F0\u543C\u554A!\u8001\u5E08\uFF1A\u4F60\u4FE1\u4E0D\u4FE1\u6211\u63CD\u4F60?\u5B66\u751F\uFF1A\u8BE5\u51FA\u624B\u65F6\u5C31\u51FA\u624B\u2026\\r\\n\\r\\n#### \u8001\u5E08\u6012\uFF1A\u6211\u8BA9\u4F60\u9000\u5B66!\u5B66\u751F\uFF1A\u98CE\u98CE\u706B\u706B\u95EF\u4E5D\u5DDE!\u2026\\r\\n\\r\\n\u5750\u4E0A\u90A3\u53F0\u79BB\u5BB6\u7684\u7535\u8111\uFF0C\u98D8\u53BB\u65E0\u4EBA\u77E5\u6653\u7684\u673A\u623F\\r\\n\\r\\n\u80CC\u7740\u6559\u7EC3\u8BF4\u7684\u90A3\u53E5\u8BDD\uFF0C\u5B69\u5B50OI\u5176\u5B9E\u4E0D\u590D\u6742\\r\\n\\r\\n\u54E6\u54E6\u54E6BUG\u8F7B\u8F7B\u7684\u6539\\r\\n\\r\\n\u522B\u7BA1\u90A3\u591A\u5634WA\\r\\n\\r\\n\u54BD\u4E0B\u90A3\u4E9BRE\\r\\n\\r\\n\u4F60\u624D\u80FD\u6162\u6162\u957F\u5927\\r\\n\\r\\n\u8981\u9519\u8FC7\u51E0\u4E2AAC\\r\\n\\r\\n\u7528\u4F60\u6700\u597D\u7684\u5E74\u534E\\r\\n\\r\\n\u8FD9\u662F\u66B4\u529B\u7684\u4EE3\u4EF7\\r\\n\\r\\n\u3010\u5B8B\u3011\u8F9B\u5F03\u75BE \u8305\u623F\u4F4E\u5C0F\uFF0C\u81ED\u5F97\u4E0D\u5F97\u4E86\u3002\u9189\u91CC\u5434\u97F3\u76F8\u5A9A\u597D\uFF0C\u767D\u53D1\u8C01\u5BB6\u7FC1\u5AAA\uFF1F\u5927\u513F\u9504\u8C46\u5931\u8E2A\uFF0C\u4E2D\u513F\u88AB\u56F0\u9E21\u7B3C\u3002\u6700\u559C\u5C0F\u513F\u4EA1\u8D56\uFF0C\u6EAA\u5934\u62D0\u5356\u513F\u7AE5\u3002\\r\\n\\r\\n\u9759\u591C\u601D \u3010\u5510\u3011\u674E\u767D \u5E8A\u524D\u660E\u6708\u5149\uFF0C \u674E\u767D\u7761\u7684\u9999\u3002 \u68A6\u89C1\u68D2\u68D2\u7CD6\uFF0C \u53E3\u6C34\u4E09\u5343\u4E08\u3002\\r\\n\\r\\nAC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nPC=Perfect Compile=\u5B8C\u7F8E\u7684\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nOLE=Output Limit Enough=\u8F93\u51FA\u5408\u6CD5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\\r\\n\\r\\n\u4EE5\u4E0B\u662F\u201C\u4E00\u8A00\u201D\uFF08\u56FE\u7075\u4E3B\u9875\uFF09^(*\uFFE3(oo)\uFFE3)^\\r\\n^ ^\\r\\no\\r\\n\\r\\n\u6211\u6240\u521B\u9020\u7684\u602A\u7269\uFF0C\u662F\u6211\u7684\u7F6A\u4E0E\u6076\uFF0C\u662F\u6211\u7684\u7231\u4E0E\u4FDD\u62A4 !\\r\\n\\r\\n\u4E00\u677F\u4E00\u773C\uFF0C\u5C31\u4F1A\u6ECB\u751F\u5F31\u70B9\u3002\\r\\n\\r\\n\u4F60\u6B3A\u4ED6\u773C\u76F2\uFF0C\u9A97\u5F97\u4ED6\u597D\u82E6\uFF01\\r\\n\\r\\n\u4ECE\u8FD9\u91CC\uFF08\u592A\u7A7A\uFF09\u6839\u672C\u770B\u4E0D\u5230\u4EC0\u4E48\u56FD\u5883\u7EBF\uFF0C\u53EA\u6709\u5730\u7403\u3002\\r\\n\\r\\n\u6CA1\u6709\u5149\u660E\u662F\u4E0D\u5E78\u7684\u4E48\uFF1F\u4E0D\uFF0C\u9700\u8981\u5149\u660E\u624D\u662F\u771F\u6B63\u7684\u4E0D\u5E78\u3002\\r\\n\\r\\n\u98CE\u5411\u662F\u4F1A\u8F6C\u53D8\u7684\u3002\\r\\n\\r\\n\u4E3A\u6BDB\u6211\u7684\u773C\u91CC\u5E38\u542B\u6CEA\u6C34\uFF0C\u56E0\u4E3A\u6211\u8001\u662F\u8EBA\u7740\u4E2D\u67AA\u3002\\r\\n\\r\\n\u6625\u98CE\u8D77\uFF0C\u82B1\u98D8\u96F6\uFF0C\u68A6\u9192\u65F6\u5206\uFF0C\u5374\u6709\u51E0\u591A\u6101\uFF0C\u4E0A\u5FC3\u5934\\r\\n\\r\\n\u5C31\u7B97\u98CE\u5439\u6563\u4E86\u51B0\u96EA\uFF0C\u60F3\u5FF5\u4E5F\u4F1A\u7559\u5B58\u4E0B\u6765\u3002\\r\\n\\r\\n\u65E0\u8BBA\u6492\u600E\u6837\u7684\u8C0E\uFF0C\u90FD\u65E0\u6CD5\u6B3A\u9A97\u81EA\u5DF1\u7684\u5FC3\u3002\\r\\n\\r\\n\u5982\u679C\u6709\u4E00\u4E2A\u559C\u6B22\u4F60\u7684\u4EBA\u51FA\u73B0\uFF0C\u4E00\u5B9A\u4E0D\u8981\u51F6\u5979\u54E6\uFF01\\r\\n\\r\\n\u6211\u4EEC\u901A\u5E38\u628A\u81EA\u5DF1\u505A\u7684\u50BB\u4E8B\u79F0\u4E3A\u201C\u547D\u8FD0\u201D\u3002\\r\\n\\r\\n\u6211\u7231\u4F60\uFF0C\u4E0E\u4F60\u6709\u4F55\u76F8\u5E72\uFF1F\u6BC1\u706D\u4F60\uFF0C\u53C8\u4E0E\u4F60\u6709\u4F55\u76F8\u5E72\uFF1F\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n//\u5403\u8C46\u4EBA\u6E38\u620F\uD83D\uDC40\uFE0F \uFF08\u6765\u6E90CSDN,\u53EF\u4EE5\u590D\u5236\uFF09\\r\\n#include <cstdio>\\r\\n#include <iostream>\\r\\n#include <ctime>\\r\\n#include <conio.h>\\r\\n#include <windows.h> //\u505C\u987F:Sleep(); \\r\\n#include <cstdlib> //\u6E05\u5C4F:system(\\"cls\\");\\r\\n#include <cstring>\\r\\nusing namespace std;\\r\\nconst int n=809;\\r\\nstruct Point {int x,y;};\\r\\nint dali;\\r\\nint fx[4]={-1,27,1,-27};\\r\\nint fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}};\\r\\nint dis[1000][1000]; //0:\u5899 1:\u6709\u5206\u7684\u8DEF 2:\u6CA1\u5206\u7684\u8DEF 3:\u602A\u7269\u7684\u5BB6 \\r\\nint changdi[30][27]={\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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}\\r\\n};\\r\\nint x,x1,x2,x3,x4,y,y1,y2,y3,y4;\\r\\nint now,now1,now2,now3,now4;\\r\\nint g1,g2,g3,g4;\\r\\nint fangx,nextfx,last1,last2,last3,last4;\\r\\nint fenshu,guozi,guaitimer;\\r\\nint T1,T2,t1,t2,stopped; //T:\u8BA1\u65F6 t1:\u73A9\u5BB6\u901F\u5EA6 t2:\u602A\u7269\u901F\u5EA6 \\r\\nint f=0; //f:{0:\u7EE7\u7EED 1:\u88AB\u5403 2:\u8D62\u4E86 3:\u8F93\u4E86}\\r\\nint beichi;\\r\\nvoid color(int a)//\u989C\u8272\u51FD\u6570\\r\\n{\\r\\nSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a);\\r\\n}\\r\\nvoid gotoxy(int x,int y)//\u4F4D\u7F6E\u51FD\u6570(\u884C\u4E3Ax \u5217\u4E3Ay)\\r\\n{\\r\\nCOORD pos;\\r\\npos.X=2*y;\\r\\npos.Y=x;\\r\\nSetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);\\r\\n}\\r\\nvoid begin(){\\r\\nsystem(\\"cls\\");\\r\\ncolor(11); printf(\\" \u2605\\"); color(10); printf(\\"\u5403\u8C46\u4EBA\\"); color(11); printf(\\"\u2605\\\\n\\\\n\\"); color(7);\\r\\nprintf(\\" \u8BF7\u5C06\u7A97\u53E3\u5F00\u81F3\\"); color(11); printf(\\"\u5168\u5C4F\\\\n\\"); color(7);\\r\\nprintf(\\" \u6B63\u5728\u521D\u59CB\u5316\uFF0C\u8BF7\u8010\u5FC3\u7B49\u5F85\\"); \\r\\nfor (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900;\\r\\n for (int i=0; i<=n; i++){\\r\\n for (int j=0; j<=3; j++){\\r\\n if (i+fx[j]>=0 && i+fx[j]<=n){\\r\\n int k=i+fx[j],xx=k/27,yy=k%27,kk;\\r\\n if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1;\\r\\n }\\r\\n }\\r\\n}\\r\\n for (int k=0; k<=n; k++)if(changdi[k]){\\r\\n for (int i=0; i<=n; i++)if(changdi[i])\\r\\n for (int j=0; j<=n; j++)if(changdi[j])\\r\\n if (dis[i][j]>dis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j];\\r\\n if (k%80==0){color (13); gotoxy(3,12); printf(\\"\u2502\\");}\\r\\n if (k%80==20){color(13); gotoxy(3,12); printf(\\"\u2571\\");}\\r\\n if (k%80==40){color(13); gotoxy(3,12); printf(\\"\u2500\\");}\\r\\n if (k%80==60){color(13); gotoxy(3,12); printf(\\"\u2572\\");}\\r\\n if (k%60==0){color(11); gotoxy(5,k/60); printf(\\"\u25CF\\");}\\r\\n}\\r\\n}\\r\\nvoid shuru(){\\r\\nchar ch=getch();\\r\\nif (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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse if (ch==\'0\' | ch==\'s\') stopped=(stopped+1)%2;\\r\\nelse if (ch==\'4\' | ch==\'a\') t1++;\\r\\nelse if (ch==\'7\' | ch==\'q\') t2++;\\r\\nelse if ((ch==\'6\' | ch==\'d\') && t1-1>0) t1--; \\r\\nelse if ((ch==\'9\' | ch==\'e\') && t2-1>0) t2--;\\r\\nelse if (ch==\'g\') dali=(dali+1)%2;\\r\\n}\\r\\nvoid reset(){\\r\\nsystem(\\"cls\\"); color(7);\\r\\ngotoxy(2,30); printf(\\"\u63A7\u5236\u65B9\u5411\uFF1A1/2/3/5\\");\\r\\ngotoxy(4,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A4/6\\");\\r\\ngotoxy(6,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A7/9\\");\\r\\nx=22; y=13; \\r\\nx1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15;\\r\\nnow=607; now1=389; now2=390; now3=392; now4=393;\\r\\nfor (int k=0; k<=n; k++){\\r\\n int i=k/27,j=k%27;\\r\\n gotoxy(i,j);\\r\\n if (changdi[i][j]==1){color(7); printf(\\"?\\");}\\r\\n else if (!changdi[i][j]){color(1); printf(\\"\u25A0\\");}\\r\\n if (j=26){gotoxy(i,27); color(7); printf(\\"%d\\",i);} \\r\\n}\\r\\ngotoxy(0,0);\\r\\ngotoxy(x,y); color(14); printf(\\"\u25CF\\");\\r\\ngotoxy(x1,y1); color(4); printf(\\"\u25C6\\");\\r\\ngotoxy(x2,y2); color(5); printf(\\"\u25C6\\");\\r\\ngotoxy(x3,y3); color(3); printf(\\"\u25C6\\");\\r\\ngotoxy(x4,y4); color(2); printf(\\"\u25C6\\");\\r\\nfangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0;\\r\\ngotoxy(14,30); printf(\\" \\");\\r\\n}\\r\\nvoid move1(){\\r\\nint xx,yy;\\r\\nxx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1];\\r\\nif (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n fangx=nextfx;\\r\\n}\\r\\nelse{\\r\\n if (x==13 && y==0 && fangx==0){xx=x; yy=26;}\\r\\n else if (x==13 && y==26 && fangx==2){xx=x; yy=0;}\\r\\n else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];}\\r\\n if (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n }\\r\\n }\\r\\ncolor(7);\\r\\n//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]);\\r\\n}\\r\\nvoid move2(){\\r\\nint haha,minhaha,xx,yy,chi=0;\\r\\nif (g1){\\r\\n minhaha=2147483647;\\r\\n if (now1%27==0 | now1%27==26) haha=last1;\\r\\n else if (!dali){\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha<dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now1+=fx[haha]; last1=(haha+2)%4;\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last1=0;\\r\\n gotoxy(now1/27,now1%27); \\r\\n if (changdi[now1/27][now1%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now1=389;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g2){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[fangx][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[fangx][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now2%27==0 | now2%27==26) haha=last2;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha<dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n }\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last2=0;\\r\\n gotoxy(now2/27,now2%27); \\r\\n if (changdi[now2/27][now2%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now2=390;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g3){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[(fangx+1)%4][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[(fangx+1)%4][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now3%27==0 | now3%27==26) haha=last3;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else {\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha<dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n } \\r\\n xx=now3/27; yy=now3%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now3/27; yy=now3%27; \\r\\n gotoxy(xx,yy); color(3); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last3=0;\\r\\n gotoxy(now3/27,now3%27); \\r\\n if (changdi[now3/27][now3%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now3=341;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (chi) beichi++;\\r\\n}\\r\\nint main(){\\r\\nbegin();\\r\\nint jixu=1;\\r\\nreset();\\r\\n string bb[4]={\\"\u25CF\\",\\"\u2460\\",\\"\u2461\\",\\"\u2462\\"}; color(7);\\r\\ngotoxy(12,12); printf(\\"\u5012\u8BA1\u65F6\\"); color(12);\\r\\nfor (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);}\\r\\ngotoxy(12,12); printf(\\" \\"); gotoxy(13,13); printf(\\" \\"); color(7);\\r\\nwhile (!f){\\r\\n Sleep(1);\\r\\n gotoxy(10,30); printf(\\"\u5F97\u5206\uFF1A%d \\",fenshu);\\r\\n gotoxy(8,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A%d \\",300-t2);\\r\\n gotoxy(9,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A%d \\",300-t1);\\r\\n gotoxy(15,30); printf(\\"\u88AB\u5403\u6B21\u6570\uFF1A%d \\",beichi);\\r\\n if (kbhit()) shuru();\\r\\n if (stopped) continue;\\r\\n T1=(T1+1)%t1; T2=(T2+1)%t2;\\r\\n if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1();\\r\\n if (T2%t2==0){\\r\\n if (guaitimer<=8){\\r\\n if (guaitimer==0) g1=1;\\r\\n if (guaitimer==8) g2=1;\\r\\n guaitimer++;\\r\\n }\\r\\n if (!g3 && fenshu>=30) g3=1;\\r\\n move2(); \\r\\n }\\r\\n if (fenshu==guozi)f=2;\\r\\n}\\r\\nif (f=2) {\\r\\n Sleep(3000);\\r\\n system(\\"cls\\");\\r\\n printf(\\"\u606D\u559C\u4F60\u5403\u5B8C\u4E86\uFF01\\\\n\u4F60\u4E00\u5171\u88AB\u602A\u7269\u5403\u6389\u4E86 %d \u6B21\\",beichi);\\r\\n Sleep(3000);\\r\\n char ying;\\r\\n scanf(\\"%c\\",&ying);\\r\\n}\\r\\n}\\r\\n```1\u3001\u5899\u4E0A\u6302\u9762\u9F13\uFF0C\u9F13\u4E0A\u753B\u8001\u864E\uFF0C\u8001\u864E\u6293\u7834\u9F13\uFF0C\u62FF\u5757\u5E03\u6765\u8865\u3002\\r\\n\u3000\u3000\u4E0D\u77E5\u662F\u5E03\u8865\u9F13\uFF0C\u8FD8\u662F\u5E03\u8865\u864E?\\r\\n\u3000\u30002\u3001\u5634\u8BF4\u817F\uFF0C\u817F\u8BF4\u5634\uFF0C\u5634\u8BF4\u817F\u7231\u8DD1\u817F\uFF0C\u817F\u8BF4\u5634\u7231\u5356\u5634\u3002\\r\\n\u3000\u3000\u5149\u52A8\u5634\u4E0D\u52A8\u817F\uFF0C\u5149\u52A8\u817F\u4E0D\u52A8\u5634\uFF0C\u4E0D\u5982\u4E0D\u957F\u817F\u548C\u5634\u3002\\r\\n\u3000\u30003\u3001\u4E03\u52A0\u4E00\uFF0C\u518D\u51CF\u4E00\uFF0C\u52A0\u5B8C\u51CF\u5B8C\u7B49\u4E8E\u51E0?\u4E03\u52A0\u4E00\uFF0C\u518D\u51CF\u4E00\uFF0C\u52A0\u5B8C\u51CF\u5B8C\u8FD8\u662F\u4E03\u3002\\r\\n\u3000\u30004\u3001\u5927\u5200\u5BF9\u5355\u5200\uFF0C\u5355\u5200\u5BF9\u5927\u5200\uFF0C\u5927\u5200\u6597\u5355\u5200\uFF0C\u5355\u5200\u593A\u5927\u5200\u3002\\r\\n\u3000\u30005\u3001\u4F60\u4E5F\u52E4\u6765\u6211\u4E5F\u52E4\uFF0C\u751F\u4EA7\u540C\u5FC3\u571F\u53D8\u91D1\u3002\u5DE5\u4EBA\u519C\u6C11\u4EB2\u5144\u5F1F\uFF0C\u5FC3\u5FC3\u76F8\u5370\u56E2\u7ED3\u7D27\u3002\\r\\n\u3000\u30006\u3001\u957F\u866B\u56F4\u7740\u7816\u5806\u8F6C\uFF0C\u8F6C\u5B8C\u7816\u5806\u94BB\u7816\u5806\u3002\\r\\n\u3000\u30007\u3001\u4E09\u5C71\u5C79\u56DB\u6C34\uFF0C\u56DB\u6C34\u7ED5\u4E09\u5C71;\u4E09\u5C71\u56DB\u6C34\u6625\u5E38\u5728\uFF0C\u56DB\u6C34\u4E09\u5C71\u56DB\u65F6\u6625\u3002\\r\\n\u3000\u30008\u3001\u5E08\u90E8\u53F8\u4EE4\u90E8\u6307\u793A\uFF1A\u56DB\u56E2\u5341\u8FDE\u77F3\u8FDE\u957F\u5E26\u56DB\u5341\u4EBA\u5728\u5341\u65E5\u56DB\u65F6\u56DB\u5341\u56DB\u5206\u6309\u65F6\u5230\u8FBE\u5E08\u90E8\u53F8\u4EE4\u90E8\uFF0C\u5E08\u957F\u53EC\u5F00\u8A93\u5E08\u5927\u4F1A\u3002\\r\\n\u3000\u30009\u3001\u6709\u4E2A\u9762\u94FA\u95E8\u671D\u5357\uFF0C\u95E8\u4E0A\u6302\u7740\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u6458\u4E86\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u9762\u94FA\u95E8\u671D\u5357;\u6302\u4E0A\u84DD\u5E03\u68C9\u95E8\u5E18\uFF0C\u9762\u94FA\u8FD8\u662F\u95E8\u671D\u5357\u3002\\r\\n\u3000\u300010\u3001\u5C71\u524D\u6709\u4E2A\u4E25\u5706\u773C\uFF0C\u5C71\u540E\u6709\u4E2A\u4E25\u773C\u5706\uFF0C\u4E8C\u4EBA\u5C71\u524D\u6765\u6BD4\u773C\uFF0C\u4E0D\u77E5\u662F\u4E25\u5706\u773C\u7684\u773C\u5706\uFF0C\u8FD8\u662F\u4E25\u773C\u5706\u6BD4\u4E25\u5706\u773C\u7684\'\u773C\u5706?\\r\\n\u3000\u300020__\u5E74\u7ECF\u5178\u7ED5\u53E3\u4EE4\u30102\u3011\\r\\n\u3000\u3000\u5C0F\u5149\u548C\u5C0F\u521A\uFF0C\u62AC\u7740\u6C34\u6876\u4E0A\u5C97\u3002\u4E0A\u5C71\u5C97\uFF0C\u6B47\u6B47\u51C9\uFF0C\u62FF\u8D77\u7AF9\u7AFF\u73A9\u6253\u4ED7\u3002\u4E52\u4E52\u4E52\uFF0C\u4E53\u4E53\u4E53\uFF0C\u6253\u6765\u6253\u53BB\u7838\u4E86\u7F38\u3002\u5C0F\u5149\u602A\u5C0F\u521A\uFF0C\u5C0F\u521A\u602A\u5C0F\u5149\uFF0C\u5C0F\u5149\u5C0F\u521A\u90FD\u602A\u4E3F\u7AFF\u548C\u6C34\u7F38\u3002\\r\\n\u3000\u3000\u5C0F\u534E\u548C\u80D6\u5A03\uFF0C\u4E24\u4E2A\u79CD\u82B1\u53C8\u79CD\u74DC\uFF0C\u5C0F\u534E\u4F1A\u79CD\u82B1\u4E0D\u4F1A\u79CD\u74DC\uFF0C\u80D6\u5A03\u4F1A\u79CD\u74DC\u4E0D\u4F1A\u79CD\u82B1\u3002\\r\\n\u3000\u3000\u8F9B\u5382\u957F\uFF0C\u7533\u5382\u957F\uFF0C\u540C\u4E61\u4E0D\u540C\u884C\u3002\u8F9B\u5382\u957F\u58F0\u58F0\u8BB2\u751F\u4EA7\uFF0C\u7533\u5382\u957F\u5E38\u5E38\u95F9\u601D\u60F3\u3002\u8F9B\u5382\u957F\u4E00\u5FC3\u53EA\u60F3\u9769\u65B0\u5382\uFF0C\u7533\u5382\u957F\u6EE1\u53E3\u53EA\u8BB2\u52A0\u85AA\u9977\u3002\\r\\n\u3000\u3000\u4E00\u4E2A\u80D6\u5A03\u5A03\uFF0C\u6349\u4E86\u4E09\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\uFF0C\u4E09\u4E2A\u80D6\u5A03\u5A03\uFF0C\u6349\u4E86\u4E00\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\uFF0C\u6349\u4E86\u4E00\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\u7684\u4E09\u4E2A\u80D6\u5A03\u5A03\uFF0C\u771F\u4E0D\u5982\u6349\u4E86\u4E09\u4E2A\u5927\u82B1\u6D3B\u86E4\u87C6\u7684\u4E00\u4E2A\u80D6\u5A03\u5A03\u3002\u5527\u5527\u590D\u5527\u5527\uFF0C\u6728\u5170\u5F00\u98DE\u673A\uFF0C \u5F00\u7684\u4EC0\u4E48\u673A\uFF1F\u6CE2\u97F3747\uFF01\\r\\n\\r\\ncase 16:\\r\\n if (collisionDetection(block07, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block07, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block07, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block07[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 17:\\r\\n if (collisionDetection(block08, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block08, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block08, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block08[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 18:\\r\\n if (collisionDetection(block09, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block09, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block09, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block09[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 19:\\r\\n if (collisionDetection(block06, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block06, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block06, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block06[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 20:\\r\\n if (collisionDetection(block11, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block11, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block11, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block11[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 21:\\r\\n if (collisionDetection(block12, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block12, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block12, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block12[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 22:\\r\\n if (collisionDetection(block13, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block13, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block13, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block13[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 23:\\r\\n if (collisionDetection(block10, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block10, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block10, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block10[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 24:\\r\\n if (collisionDetection(block15, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block15, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block15, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block15[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 25:\\r\\n if (collisionDetection(block14, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block14, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block14, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block14[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 26:\\r\\n if (collisionDetection(block17, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block17, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block17, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block17[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ncase 27:\\r\\n if (collisionDetection(block16, map, x, y))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n }\\r\\n else if (collisionDetection(block16, map, x, y - 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n --y;\\r\\n }\\r\\n else if (collisionDetection(block16, map, x, y + 1))\\r\\n {\\r\\n clearBlock(hOut, block, x, y);\\r\\n for (int i = 0; i < 4; ++i)\\r\\n {\\r\\n for (int j = 0; j < 4; ++j)\\r\\n {\\r\\n block[i][j] = block16[i][j];\\r\\n }\\r\\n }\\r\\n ++y;\\r\\n }\\r\\n break;\\r\\ndefault:\\r\\n break;\\r\\n}\\r\\n```\\r\\n\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n\\r\\n\u4EBA\u751F\u5C31\u50CF\u5C71\u5CF0\uFF0C\u8D77\u8D77\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\u843D\\r\\n\\r\\n\\r\\n\\r\\n#include<bits/stdc++.h>\\r\\nusing namespace std;\\r\\nstruct Node{\\r\\nint l,r;\\r\\n}yx[1111111];\\r\\nvoid dfs(int u){\\r\\ncout<<u<<\\"\\\\n\\";\\r\\nif(yx[u].l)dfs(yx[u].l);\\r\\nif(yx[u].r)dfs(yx[u].r);\\r\\n}\\r\\nint main(){\\r\\nios::sync_with_stdio(0);\\r\\ncin.tie(0);\\r\\ncout.tie(0);\\r\\nint n;\\r\\ncin>>n;\\r\\nfor(int i=1;i<=n;i++)cin>>yx[i].l>>yx[i].r;\\r\\ndfs(n);\\r\\n//\\tsystem(\\"shutdown -S -t 100\\");\\r\\nreturn 0;\\r\\n}\\r\\n\\r\\nsrand((unsigned)time(NULL));\\r\\nroundBlock(hOut, blockA);\\r\\nwhile (true)\\r\\n{\\r\\nif (check)\\r\\n{\\r\\neliminateRow(hOut, map, val, fraction, checkpoint);\\r\\ncheck = false;\\r\\npositionX = -3;\\r\\npositionY = 4;\\r\\nif (collisionDetection(blockA, map, positionX, positionY))\\r\\n{\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblockB[i][j] = blockA[i][j];\\r\\n}\\r\\n}\\r\\nroundBlock(hOut, blockA);\\r\\n}\\r\\nelse\\r\\n{\\r\\ngameOver(hOut, blockA, map);\\r\\ngoto initial;\\r\\n}\\r\\n}\\r\\nprintBlock(hOut, blockB, positionX, positionY);\\r\\nif (_kbhit())\\r\\n{\\r\\nkey = _getch();\\r\\nswitch (key)\\r\\n{\\r\\ncase 72:\\r\\nmyUp(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 75:\\r\\nmyLeft(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 77:\\r\\nmyRight(hOut, blockB, map, positionX, positionY);\\r\\nbreak;\\r\\ncase 80:\\r\\nswitch (myDown(hOut, blockB, map, positionX, positionY))\\r\\n{\\r\\ncase 0:\\r\\ncheck = false;\\r\\nbreak;\\r\\ncase 1:\\r\\ncheck = true;\\r\\nbreak;\\r\\ncase 2:\\r\\ngameOver(hOut, blockB, map);\\r\\ngoto initial;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\nbreak;\\r\\ncase 32:\\r\\nmyStop(hOut, blockA);\\r\\nbreak;\\r\\ncase 27:\\r\\nexit(0);\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n}\\r\\nSleep(20);\\r\\nif (0 == --times)\\r\\n{\\r\\nswitch (myDown(hOut, blockB, map, positionX, positionY))\\r\\n{\\r\\ncase 0:\\r\\ncheck = false;\\r\\nbreak;\\r\\ncase 1:\\r\\ncheck = true;\\r\\nbreak;\\r\\ncase 2:\\r\\ngameOver(hOut, blockB, map);\\r\\ngoto initial;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\ntimes = val;\\r\\n}\\r\\n}\\r\\ncin.get();\\r\\nreturn 0;\\r\\n\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\ncase 16:\\r\\nif (collisionDetection(block07, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block07, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block07[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 17:\\r\\nif (collisionDetection(block08, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block08, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block08[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 18:\\r\\nif (collisionDetection(block09, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block09, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block09[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 19:\\r\\nif (collisionDetection(block06, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block06, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block06[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 20:\\r\\nif (collisionDetection(block11, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block11, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block11[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 21:\\r\\nif (collisionDetection(block12, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block12, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block12[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 22:\\r\\nif (collisionDetection(block13, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block13, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block13[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 23:\\r\\nif (collisionDetection(block10, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block10, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block10[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 24:\\r\\nif (collisionDetection(block15, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block15, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block15[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 25:\\r\\nif (collisionDetection(block14, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block14, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block14[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 26:\\r\\nif (collisionDetection(block17, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block17, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block17[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ncase 27:\\r\\nif (collisionDetection(block16, map, x, y))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y - 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n--y;\\r\\n}\\r\\nelse if (collisionDetection(block16, map, x, y + 1))\\r\\n{\\r\\nclearBlock(hOut, block, x, y);\\r\\nfor (int i = 0; i < 4; ++i)\\r\\n{\\r\\nfor (int j = 0; j < 4; ++j)\\r\\n{\\r\\nblock[i][j] = block16[i][j];\\r\\n}\\r\\n}\\r\\n++y;\\r\\n}\\r\\nbreak;\\r\\ndefault:\\r\\nbreak;\\r\\n}\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n//\u5403\u8C46\u4EBA\u6E38\u620F\uD83D\uDC40\uFE0F \uFF08\u6765\u6E90CSDN,\u53EF\u4EE5\u590D\u5236\uFF09\\r\\n#include <cstdio>\\r\\n#include <iostream>\\r\\n#include <ctime>\\r\\n#include <conio.h>\\r\\n#include <windows.h> //\u505C\u987F:Sleep(); \\r\\n#include <cstdlib> //\u6E05\u5C4F:system(\\"cls\\");\\r\\n#include <cstring>\\r\\nusing namespace std;\\r\\nconst int n=809;\\r\\nstruct Point {int x,y;};\\r\\nint dali;\\r\\nint fx[4]={-1,27,1,-27};\\r\\n\\r\\n\\r\\nint fxfx[4][2]={{0,-1},{1,0},{0,1},{-1,0}};\\r\\nint dis[1000][1000]; //0:\u5899 1:\u6709\u5206\u7684\u8DEF 2:\u6CA1\u5206\u7684\u8DEF 3:\u602A\u7269\u7684\u5BB6 \\r\\nint changdi[30][27]={\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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},\\r\\n{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}\\r\\n};\\r\\nint x,x1,x2,x3,x4,y,y1,y2,y3,y4;\\r\\nint now,now1,now2,now3,now4;\\r\\nint g1,g2,g3,g4;\\r\\nint fangx,nextfx,last1,last2,last3,last4;\\r\\nint fenshu,guozi,guaitimer;\\r\\nint T1,T2,t1,t2,stopped; //T:\u8BA1\u65F6 t1:\u73A9\u5BB6\u901F\u5EA6 t2:\u602A\u7269\u901F\u5EA6 \\r\\nint f=0; //f:{0:\u7EE7\u7EED 1:\u88AB\u5403 2:\u8D62\u4E86 3:\u8F93\u4E86}\\r\\nint beichi;\\r\\nvoid color(int a)//\u989C\u8272\u51FD\u6570\\r\\n{\\r\\nSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),a);\\r\\n}\\r\\nvoid gotoxy(int x,int y)//\u4F4D\u7F6E\u51FD\u6570(\u884C\u4E3Ax \u5217\u4E3Ay)\\r\\n{\\r\\nCOORD pos;\\r\\npos.X=2*y;\\r\\npos.Y=x;\\r\\nSetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),pos);\\r\\n}\\r\\nvoid begin(){\\r\\nsystem(\\"cls\\");\\r\\ncolor(11); printf(\\" \u2605\\"); color(10); printf(\\"\u5403\u8C46\u4EBA\\"); color(11); printf(\\"\u2605\\\\n\\\\n\\"); color(7);\\r\\nprintf(\\" \u8BF7\u5C06\u7A97\u53E3\u5F00\u81F3\\"); color(11); printf(\\"\u5168\u5C4F\\\\n\\"); color(7);\\r\\nprintf(\\" \u6B63\u5728\u521D\u59CB\u5316\uFF0C\u8BF7\u8010\u5FC3\u7B49\u5F85\\"); \\r\\nfor (int i=0; i<=n; i++) for (int j=1; j<=n; j++) dis[i][j]=900;\\r\\n for (int i=0; i<=n; i++){\\r\\n for (int j=0; j<=3; j++){\\r\\n if (i+fx[j]>=0 && i+fx[j]<=n){\\r\\n int k=i+fx[j],xx=k/27,yy=k%27,kk;\\r\\n if (changdi[i/27][i%27] && changdi[xx][yy]) dis[i][k]=kk=1;\\r\\n }\\r\\n }\\r\\n}\\r\\n for (int k=0; k<=n; k++)if(changdi[k]){\\r\\n for (int i=0; i<=n; i++)if(changdi[i])\\r\\n for (int j=0; j<=n; j++)if(changdi[j])\\r\\n if (dis[i][j]>dis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j];\\r\\n if (k%80==0){color (13); gotoxy(3,12); printf(\\"\u2502\\");}\\r\\n if (k%80==20){color(13); gotoxy(3,12); printf(\\"\u2571\\");}\\r\\n if (k%80==40){color(13); gotoxy(3,12); printf(\\"\u2500\\");}\\r\\n if (k%80==60){color(13); gotoxy(3,12); printf(\\"\u2572\\");}\\r\\n if (k%60==0){color(11); gotoxy(5,k/60); printf(\\"\u25CF\\");}\\r\\n}\\r\\n}\\r\\nvoid shuru(){\\r\\nchar ch=getch();\\r\\nif (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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse 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;\\r\\nelse if (ch==\'0\' | ch==\'s\') stopped=(stopped+1)%2;\\r\\nelse if (ch==\'4\' | ch==\'a\') t1++;\\r\\nelse if (ch==\'7\' | ch==\'q\') t2++;\\r\\nelse if ((ch==\'6\' | ch==\'d\') && t1-1>0) t1--; \\r\\nelse if ((ch==\'9\' | ch==\'e\') && t2-1>0) t2--;\\r\\nelse if (ch==\'g\') dali=(dali+1)%2;\\r\\n}\\r\\nvoid reset(){\\r\\nsystem(\\"cls\\"); color(7);\\r\\ngotoxy(2,30); printf(\\"\u63A7\u5236\u65B9\u5411\uFF1A1/2/3/5\\");\\r\\ngotoxy(4,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A4/6\\");\\r\\ngotoxy(6,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A7/9\\");\\r\\nx=22; y=13; \\r\\nx1=x2=x3=x4=14; y1=11; y2=12; y3=14; y4=15;\\r\\nnow=607; now1=389; now2=390; now3=392; now4=393;\\r\\nfor (int k=0; k<=n; k++){\\r\\n int i=k/27,j=k%27;\\r\\n gotoxy(i,j);\\r\\n if (changdi[i][j]==1){color(7); printf(\\"?\\");}\\r\\n else if (!changdi[i][j]){color(1); printf(\\"\u25A0\\");}\\r\\n if (j=26){gotoxy(i,27); color(7); printf(\\"%d\\",i);} \\r\\n}\\r\\ngotoxy(0,0);\\r\\ngotoxy(x,y); color(14); printf(\\"\u25CF\\");\\r\\ngotoxy(x1,y1); color(4); printf(\\"\u25C6\\");\\r\\ngotoxy(x2,y2); color(5); printf(\\"\u25C6\\");\\r\\ngotoxy(x3,y3); color(3); printf(\\"\u25C6\\");\\r\\ngotoxy(x4,y4); color(2); printf(\\"\u25C6\\");\\r\\nfangx=0; T1=T2=guaitimer=0; t1=75; t2=100;stopped=0; fenshu=0; guozi=237; g1=g2=g3=g4=0; dali=0;\\r\\ngotoxy(14,30); printf(\\" \\");\\r\\n}\\r\\nvoid move1(){\\r\\nint xx,yy;\\r\\nxx=x+fxfx[nextfx][0]; yy=y+fxfx[nextfx][1];\\r\\nif (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n fangx=nextfx;\\r\\n}\\r\\nelse{\\r\\n if (x==13 && y==0 && fangx==0){xx=x; yy=26;}\\r\\n else if (x==13 && y==26 && fangx==2){xx=x; yy=0;}\\r\\n else{xx=x+fxfx[fangx][0]; yy=y+fxfx[fangx][1];}\\r\\n if (changdi[xx][yy]){\\r\\n if (changdi[xx][yy]==1){fenshu+=1; changdi[xx][yy]=2;}\\r\\n color(14);\\r\\n gotoxy(x,y); printf(\\" \\");\\r\\n gotoxy(xx,yy); if (!dali) printf(\\"\u25CE\\"); else printf(\\"\u2606\\");\\r\\n now=x*27+y; x=xx; y=yy;\\r\\n }\\r\\n }\\r\\ncolor(7);\\r\\n//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]);\\r\\n}\\r\\nvoid move2(){\\r\\nint haha,minhaha,xx,yy,chi=0;\\r\\nif (g1){\\r\\n minhaha=2147483647;\\r\\n if (now1%27==0 | now1%27==26) haha=last1;\\r\\n else if (!dali){\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha>dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++)\\r\\n if (changdi[(now1+fx[i])/27][(now1+fx[i])%27] && i!=last1 && minhaha<dis[now1+fx[i]][now]) \\r\\n {minhaha=dis[now1+fx[i]][now]; haha=i;}\\r\\n }\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now1+=fx[haha]; last1=(haha+2)%4;\\r\\n xx=now1/27; yy=now1%27; gotoxy(xx,yy); color(4); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last1=0;\\r\\n gotoxy(now1/27,now1%27); \\r\\n if (changdi[now1/27][now1%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now1=389;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g2){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[fangx][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[fangx][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now2%27==0 | now2%27==26) haha=last2;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha>dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else{\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now2+fx[i])/27][(now2+fx[i])%27] && i!=last2 && minhaha<dis[now2+fx[i]][k]) \\r\\n {minhaha=dis[now2+fx[i]][k]; haha=i;}\\r\\n } \\r\\n }\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now2+=fx[haha]; last2=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now2/27; yy=now2%27; gotoxy(xx,yy); color(5); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last2=0;\\r\\n gotoxy(now2/27,now2%27); \\r\\n if (changdi[now2/27][now2%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now2=390;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (g3){\\r\\n int k;\\r\\n minhaha=2147483647;\\r\\n if (fangx==0 | fangx==2){\\r\\n k=y+(fxfx[(fangx+1)%4][1])*3;\\r\\n while (k>25 | !changdi[x][k]) k--;\\r\\n while (k<1 | !changdi[x][k]) k++;\\r\\n } else{\\r\\n k=x+(fxfx[(fangx+1)%4][0])*3;\\r\\n while (k>28 | !changdi[k][y]) k--;\\r\\n while (k<1 | !changdi[k][y]) k++; \\r\\n } \\r\\n if (fangx==0 | fangx==2) k=x*27+k; else k=k*27+y;\\r\\n if (now3%27==0 | now3%27==26) haha=last3;\\r\\n else if (!dali)\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha>dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n else {\\r\\n minhaha=-minhaha;\\r\\n for (int i=0; i<=3; i++){\\r\\n if (changdi[(now3+fx[i])/27][(now3+fx[i])%27] && i!=last3 && minhaha<dis[now3+fx[i]][k]) \\r\\n {minhaha=dis[now3+fx[i]][k]; haha=i;}\\r\\n } \\r\\n } \\r\\n xx=now3/27; yy=now3%27; gotoxy(xx,yy); \\r\\n if (changdi[xx][yy]==1) printf(\\"?\\");else printf(\\" \\"); \\r\\n now3+=fx[haha]; last3=(haha+2)%4; gotoxy(18,30);\\r\\n xx=now3/27; yy=now3%27; \\r\\n gotoxy(xx,yy); color(3); printf(\\"\u25C6\\"); color(7);\\r\\n if (xx==x && yy==y){\\r\\n if (!dali) chi+=1;\\r\\n else {\\r\\n guozi+=50;\\r\\n fenshu+=50;\\r\\n last3=0;\\r\\n gotoxy(now3/27,now3%27); \\r\\n if (changdi[now3/27][now3%27]==1) printf(\\"?\\"); else printf(\\" \\");\\r\\n now3=341;\\r\\n }\\r\\n }\\r\\n}\\r\\nif (chi) beichi++;\\r\\n}\\r\\nint main(){\\r\\nbegin();\\r\\nint jixu=1;\\r\\nreset();\\r\\n string bb[4]={\\"\u25CF\\",\\"\u2460\\",\\"\u2461\\",\\"\u2462\\"}; color(7);\\r\\ngotoxy(12,12); printf(\\"\u5012\u8BA1\u65F6\\"); color(12);\\r\\nfor (int i=3; i>=0; i--){if (i==0) color(11);gotoxy(13,13); cout<<bb[i]; Sleep(1000);}\\r\\ngotoxy(12,12); printf(\\" \\"); gotoxy(13,13); printf(\\" \\"); color(7);\\r\\nwhile (!f){\\r\\n Sleep(1);\\r\\n gotoxy(10,30); printf(\\"\u5F97\u5206\uFF1A%d \\",fenshu);\\r\\n gotoxy(8,30); printf(\\"\u602A\u7269\u901F\u5EA6\uFF1A%d \\",300-t2);\\r\\n gotoxy(9,30); printf(\\"\u4F60\u7684\u901F\u5EA6\uFF1A%d \\",300-t1);\\r\\n gotoxy(15,30); printf(\\"\u88AB\u5403\u6B21\u6570\uFF1A%d \\",beichi);\\r\\n if (kbhit()) shuru();\\r\\n if (stopped) continue;\\r\\n T1=(T1+1)%t1; T2=(T2+1)%t2;\\r\\n if (T1%t1==0 && now+fx[fangx]>0 && now+fx[fangx]<n) move1();\\r\\n if (T2%t2==0){\\r\\n if (guaitimer<=8){\\r\\n if (guaitimer==0) g1=1;\\r\\n if (guaitimer==8) g2=1;\\r\\n guaitimer++;\\r\\n }\\r\\n if (!g3 && fenshu>=30) g3=1;\\r\\n move2(); \\r\\n }\\r\\n if (fenshu==guozi)f=2;\\r\\n}\\r\\nif (f=2) {\\r\\n Sleep(3000);\\r\\n system(\\"cls\\");\\r\\n printf(\\"\u606D\u559C\u4F60\u5403\u5B8C\u4E86\uFF01\\\\n\u4F60\u4E00\u5171\u88AB\u602A\u7269\u5403\u6389\u4E86 %d \u6B21\\",beichi);\\r\\n Sleep(3000);\\r\\n char ying;\\r\\n scanf(\\"%c\\",&ying);\\r\\n}\\r\\n}\\r\\n\\r\\n\\r\\n/*\\r\\n\u72FC\u4EBA\u6740V2.0\\r\\n\u66F4\u65B0\u5E73\u7968\u7CFB\u7EDF\u3001\u8B66\u957F \\r\\n\u4EE3\u7801\u6574\u7406 \\r\\n\u5404\u79CDBug\u4FEE\u590D\\r\\n*/\\r\\n#include<bits/stdc++.h>\\r\\n#include<windows.h>\\r\\n#include<conio.h>\\r\\nusing namespace std;\\r\\n\\r\\nconst int daytime=0,night=1;\\r\\nint day=0, during_time=daytime, player_number, my_number;\\r\\nHWND hwnd=GetForegroundWindow();//\u7A97\u53E3\u5B9A\u4E49\\r\\n\\r\\n/*\u8BBE\u7F6E\u989C\u8272*/\\r\\nconst int blue=0,yellow=1,red=2,green=3,purple=4,white=5;//\u989C\u8272\u5E38\u91CF \\r\\nvoid color(int c){\\r\\n switch(c)\\r\\n {\\r\\n case red:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);break;\\r\\n case green:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);break;\\r\\n case yellow:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN);break;\\r\\n case blue:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);break;\\r\\n case white:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE);break;\\r\\n case purple:SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED |FOREGROUND_BLUE);break;\\r\\n }\\r\\n}\\r\\nint idx_police=-1;\\r\\n\\r\\n/*\u63A7\u5236\u5149\u6807\u5728\u63A7\u5236\u53F0\u7684\u4F4D\u7F6E */\\r\\nvoid gotoxy(int x,int y){\\r\\n COORD position;\\r\\n position.X=x;\\r\\n position.Y=y;\\r\\n SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position);\\r\\n}\\r\\n\\r\\n/*\u521D\u59CB\u5316\u7A97\u53E3*/\\r\\nvoid init_Show_Window(){\\r\\n system(\\"mode con lines=60 cols=188\\");//\u5168\u5C4F \\r\\n ShowWindow(hwnd,SW_MAXIMIZE);//\u7A97\u53E3\u6700\u5927\u5316 \\r\\n DeleteMenu(GetSystemMenu(GetConsoleWindow(), FALSE), SC_CLOSE, MF_BYCOMMAND);\\r\\n DrawMenuBar(GetConsoleWindow());//\u5220\u9664\xD7\u5B57\u7B26 \\r\\n}\\r\\n\\r\\n/*\u73A9\u5BB6\u7C7B*/\\r\\nconst int nvwu=0,cunmin=1,yuyanjia=2,langren=3,lieren=4,shouwei=5,good=6,die=1,life=2;\\r\\nclass player{\\r\\npublic:\\r\\n int type;\\r\\n int die_or_life;\\r\\n int how(){\\r\\n return die_or_life;\\r\\n }\\r\\n int is_light;//\u662F\u5426\u5DF2\u7ECF\u516C\u5E03 \\r\\n int killer;\\r\\n};\\r\\nplayer players[1000];\\r\\n\\r\\n/*\u8F6C\u6362\u767D\u5929\u6A21\u5F0F*/ \\r\\nvoid change_daytime(){\\r\\n during_time=daytime;\\r\\n day++;\\r\\n}\\r\\n\\r\\n/*\u8F6C\u6362\u9ED1\u591C\u6A21\u5F0F*/\\r\\nvoid change_night(){\\r\\n during_time=night;\\r\\n}\\r\\nint nnvwu=0,ncunmin=0,nyuyanjia=0,nlangren=0,nlieren=0,nshouwei=0;\\r\\nint idxnvwu,idxshouwei,idxyuyanjia,idxlieren,idxlangren[4]={-1,-1,-1,-1};\\r\\n\\r\\n/*b\u662F\u5426\u5728Arr\u4E2D*/\\r\\nbool is_include(int arr[],int b,int l){\\r\\n for(int i=0;i<l;i++){\\r\\n if(arr[i]==b)\\r\\n return true;\\r\\n }\\r\\n return false;\\r\\n}\\r\\n\\r\\n/*\u521D\u59CB\u5316\u4EBA\u6570*/\\r\\nvoid init_players(){\\r\\n my_number=rand()%player_number;\\r\\n if(player_number==12) nlangren=4;\\r\\n else if(player_number>=10) nlangren=3;\\r\\n else nlangren=2;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n players[i].die_or_life=life;\\r\\n players[i].is_light=0;\\r\\n players[i].type=-1;\\r\\n players[i].killer=2147483647;\\r\\n }\\r\\n for(int i=0;i<nlangren;i++)\\r\\n {\\r\\n int p=rand()%player_number;\\r\\n if(!is_include(idxlangren,p,4))\\r\\n idxlangren[i]=p,players[p].type=langren;\\r\\n else\\r\\n i--;\\r\\n Sleep(rand()%80+100);\\r\\n }\\r\\n if(player_number==12)\\r\\n {\\r\\n do{\\r\\n idxshouwei=rand()%player_number;\\r\\n }while(players[idxshouwei].type!=-1); \\r\\n players[idxshouwei].type=shouwei; \\r\\n }\\r\\n do{\\r\\n idxnvwu=rand()%player_number;\\r\\n }while(players[idxnvwu].type!=-1);\\r\\n players[idxnvwu].type=nvwu;\\r\\n if(player_number>=10)\\r\\n {\\r\\n do{\\r\\n idxlieren=rand()%player_number;\\r\\n }while(players[idxlieren].type!=-1);\\r\\n players[idxlieren].type=lieren; \\r\\n }\\r\\n do{\\r\\n idxyuyanjia=rand()%player_number;\\r\\n }while(players[idxyuyanjia].type!=-1);\\r\\n players[idxyuyanjia].type=yuyanjia;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(players[i].type==-1)\\r\\n players[i].type=cunmin,\\r\\n ncunmin++;\\r\\n if(players[my_number].type==langren)\\r\\n {\\r\\n for(int i=0;i<nlangren;i++)\\r\\n {\\r\\n players[idxlangren[i]].is_light=1;\\r\\n }\\r\\n }\\r\\n players[my_number].is_light=1;\\r\\n}\\r\\n\\r\\n/*\u5728\u5C4F\u5E55\u4E0A\u6253\u5370\u4E1C\u897F*/\\r\\nvoid print(){\\r\\n gotoxy(0,0);\\r\\n cout<<\\"\u4F5C\u8005\uFF1A\u6D1B\u8C37393864\\";\\r\\n gotoxy(90,0);\\r\\n if(during_time==night)\\r\\n color(red);\\r\\n else\\r\\n color(blue);\\r\\n printf(\\"\u7B2C%d\u5929 | \\",day);\\r\\n if(during_time==night) cout<<\\"\u9ED1\u591C\\";\\r\\n else cout<<\\"\u767D\u5929\\";\\r\\n\\r\\n gotoxy(0,3);\\r\\n color(blue);\\r\\n cout<<\\" \u6211\u7684\u53F7\u4F4D:\\"<<my_number+1;\\r\\n for(int i=0;i<player_number;i++){\\r\\n gotoxy(i*8+1,4);\\r\\n if(i==idx_police) color(yellow);\\r\\n else color(blue);\\r\\n cout<<i+1<<\\"\u53F7\u4F4D\\"; \\r\\n gotoxy(i*8+1,5);\\r\\n if(players[i].how()==die){\\r\\n color(red);\\r\\n cout<<\\"\u6B7B \u4EA1\\";\\r\\n }else{\\r\\n color(green);\\r\\n cout<<\\"\u5B58 \u6D3B\\";\\r\\n }\\r\\n gotoxy(i*8+1,6);\\r\\n color(blue);\\r\\n if(players[i].is_light){\\r\\n if(players[i].is_light==1){\\r\\n switch(players[i].type){\\r\\n case nvwu: cout<<\\"\u5973 \u5DEB\\";break;\\r\\n case yuyanjia: cout<<\\"\\\\b\u9884\u8A00\u5BB6\\";break;\\r\\n case cunmin: cout<<\\"\u6751 \u6C11\\";break;\\r\\n case langren:cout<<\\"\u72FC \u4EBA\\"; break;\\r\\n case lieren:cout<<\\"\u730E \u4EBA\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88 \u536B\\"; break;\\r\\n } \\r\\n }else{\\r\\n cout<<\\"\u597D\u4EBA\\";\\r\\n }\\r\\n\\r\\n }else{\\r\\n cout<<\\"\u672A\u77E5\\";\\r\\n }\\r\\n }\\r\\n\\r\\n} \\r\\n\\r\\n/*\u5224\u65AD\u662F\u5426\u7ED3\u675F,\u6CA1\u7ED3\u675F\u8FD4\u56DE0 \u597D\u4EBA\u80DC\u5229\u8FD4\u56DE1 \u72FC\u4EBA\u80DC\u5229\u8FD4\u56DE2 \u5E73\u5C40\u8FD4\u56DE3*/\\r\\nint is_end(){\\r\\n int die_bad=0;\\r\\n int die_people=0;\\r\\n int die_god=0;\\r\\n for(int i=0;i<player_number;i++){\\r\\n if((players[i].type == nvwu || players[i].type == yuyanjia || players[i].type == shouwei)&&players[i].die_or_life==die)\\r\\n die_god++;\\r\\n else if(players[i].type == langren && players[i].die_or_life==die)\\r\\n die_bad++;\\r\\n else if(players[i].type == cunmin && players[i].die_or_life==die)\\r\\n die_people++;\\r\\n }\\r\\n if((die_bad==die_people || die_bad==die_god)&&(die_bad>=nlangren))\\r\\n return 3;\\r\\n if(die_bad>=nlangren)\\r\\n return 1;\\r\\n if(die_people>=ncunmin||die_god>=(player_number>=10 ? 3:2))\\r\\n return 2;\\r\\n return 0;\\r\\n}\\r\\n\\r\\n/*\u6E38\u620F\u5F00\u59CB\u524D\u7684\u9A9A\u64CD\u4F5C*/\\r\\nvoid before_game(){\\r\\n srand(time(NULL));\\r\\n init_Show_Window();\\r\\n color(green);\\r\\n cout<<\\"\u6B22\u8FCE\u6765\u5230\u72FC\u4EBA\u6740\u6E38\u620F\\\\t\\\\t\\\\t\u4E3A\u4E86\u66F4\u597D\u7684\u6E38\u620F\u4F53\u9A8C,\u8BF7\u53F3\u952E\u70B9\u51FB\u4E0A\u65B9\u2191\u2191,\u70B9\u51FB\\\\\\"\u5C5E\u6027\\\\\\",\u70B9\u51FB\\\\\\"\u5B57\u4F53\\\\\\"\u680F\u76EE,\u5C06\u5B57\u4F53\u4FEE\u6539\u4E3A\u5B8B\u4F53\u6216\u65B0\u5B8B\u4F53,\u5C06\u5B57\u53F7\u6539\u4E3A20\\\\n\u4F5C\u8005\uFF1A\u6D1B\u8C37393864\\\\n\u8BF7\u52FF\u79C1\u81EA\u8F6C\u8F7D,\u8FDD\u8005\u4F9D\u6CD5\u8FFD\u7A76\u6CD5\u5F8B\u8D23\u4EFB \u6CE8\uFF1A10 11 12\u4EBA\u5C40\u5F00\u8BBE\u730E\u4EBA 12\u4EBA\u5C40\u5F00\u8BBE\u5B88\u536B\u8B66\u957F\\\\n______________________\\\\n\\";\\r\\n cout<<\\"\u8BF7\u8F93\u5165\u73A9\u5BB6\u4EBA\u6570(8-12\u4EBA):\\";\\r\\n cin>>player_number;\\r\\n while(player_number<8||player_number>12)\\r\\n { cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\"; cin>>player_number; }\\r\\n system(\\"cls\\");\\r\\n cout<<\\"\u521D\u59CB\u5316\u8EAB\u4EFD\u4E2D\uFF0C\u8BF7\u7A0D\u7B49.\\";\\r\\n for(int i=0;i<6;i++){\\r\\n for(int j=0;j<12;j++){\\r\\n cout<<\\".\\";\\r\\n Sleep(50);\\r\\n } \\r\\n 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\\";\\r\\n }\\r\\n system(\\"cls\\");\\r\\n\\r\\n init_players();\\r\\n cout<<\\"\u6211\u7684\u53F7\u4F4D:\\"<<my_number+1<<endl\\r\\n <<\\"\u6211\u7684\u8EAB\u4EFD:\\";\\r\\n switch(players[my_number].type){\\r\\n case nvwu: cout<<\\"\u5973\u5DEB\\\\n\\";break;\\r\\n case yuyanjia: cout<<\\"\u9884\u8A00\u5BB6\\\\n\\";break;\\r\\n case cunmin: cout<<\\"\u6751\u6C11\\\\n\\";break;\\r\\n case langren:cout<<\\"\u72FC\u4EBA\\\\n\\";break; \\r\\n case lieren:cout<<\\"\u730E\u4EBA\\\\n\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88\u536B\\\\n\\";break;\\r\\n }\\r\\n change_daytime();\\r\\n system(\\"pause\\");\\r\\n system(\\"cls\\");\\r\\n cout<<\\"\u6E38\u620F\u52A0\u8F7D\u4E2D.\\";int ppppp=rand()%3+2;\\r\\n for(int i=0;i<ppppp;i++){\\r\\n for(int j=0;j<6;j++){\\r\\n cout<<\\".\\";\\r\\n Sleep(rand()%100+150);\\r\\n } \\r\\n cout<<\\"\\\\b\\\\b\\\\b\\\\b\\\\b\\\\b \\\\b\\\\b\\\\b\\\\b\\\\b\\\\b\\";\\r\\n } \\r\\n print();\\r\\n} \\r\\n\\r\\n/*\u6BCF\u4E00\u5929\u5F00\u59CB\u524D\u7684\u64CD\u4F5C*/\\r\\nvoid something_before_everyday(){\\r\\n change_night();\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n int langrensha=-1,NVWUDU=-1,nvwujiu=-1,shouweishou=-1;\\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\";\\r\\n gotoxy(0,8);\\r\\n color(white);\\r\\n cout<<\\"\u5929\u9ED1~\u8BF7\u95ED\u773C~~~\\\\n\\";\\r\\n}\\r\\n\\r\\n/*\u5B88\u536B\u64CD\u4F5C*/\\r\\nint shouweishou=0;\\r\\nint ShouWei(){\\r\\n color(blue);\\r\\n cout<<\\"\u5B88\u536B~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u8981\u5B88\u62A4\u7684\u662F?\\\\n\\";\\r\\n if(players[my_number].type==shouwei&&players[my_number].die_or_life == life){\\r\\n cin>>shouweishou;\\r\\n while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>shouweishou;\\r\\n }\\r\\n cout<<\\"\u4F60\u4ECA\u665A\u8981\u5B88\u62A4\u7684\u662F\\"<<shouweishou<<\\"\u53F7\\\\n\\";\\r\\n Sleep(1500); \\r\\n shouweishou--;\\r\\n }else{\\r\\n if(players[idxshouwei].die_or_life == life){\\r\\n shouweishou=rand()%10;\\r\\n while(!(shouweishou>=1&&shouweishou<=player_number&&players[shouweishou-1].die_or_life == life)){\\r\\n shouweishou=rand()%10;\\r\\n }\\r\\n }\\r\\n } \\r\\n Sleep(2000);\\r\\n cout<<\\"\u5B88\u536B\u8BF7\u95ED\u773C\\"<<endl<<endl;\\r\\n return shouweishou;\\r\\n} \\r\\n\\r\\n/*\u72FC\u4EBA\u64CD\u4F5C*/\\r\\nint LangRen(){\\r\\n int langrensha=-1;\\r\\n color(red);\\r\\n cout<<\\"\u72FC\u4EBA~\u8BF7\u7741\u773C~~~\\\\n\\";\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u4EEC\u4ECA\u665A\u8981\u6740~\u8C01~~??\\\\n\\";\\r\\n if(players[my_number].type==langren&&players[my_number].die_or_life == life){\\r\\n cin>>langrensha;\\r\\n while(!(langrensha>=1&&langrensha<=player_number&&players[langrensha-1].die_or_life==life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165!\\\\n\\";\\r\\n cin>>langrensha;\\r\\n }\\r\\n cout<<\\"\u4F60\u4EEC\u4ECA\u665A\u8981\u6740\u7684\u662F\\"<<langrensha--<<\\"\u53F7\\\\n\\";\\r\\n Sleep(3500);\\r\\n }else{\\r\\n while(langrensha==-1 || players[langrensha].die_or_life == die || players[langrensha].type==langren){\\r\\n langrensha=rand()%player_number;\\r\\n }\\r\\n Sleep(3000);\\r\\n }\\r\\n cout<<\\"\u72FC\u4EBA\u8BF7~\u95ED\u773C~~\\\\n\\\\n\\";\\r\\n return langrensha;\\r\\n}\\r\\n\\r\\n/*\u5973\u5DEB\u64CD\u4F5C*/\\r\\nint nvwujiu=0,nvwudu=0,is_nvwujiu=0,is_nvwudu=0;\\r\\nint NvWu(int langrensha){\\r\\n color(purple);\\r\\n cout<<\\"\u5973\u5DEB~~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(2000);\\r\\n if(players[my_number].type==nvwu&&players[my_number].die_or_life == life){\\r\\n if(is_nvwujiu) \\r\\n cout<<\\"\u4F60\u5DF2\u7ECF\u7528\u8FC7\u89E3\u836F\\\\n\\",Sleep(1500);\\r\\n else\\r\\n {\\r\\n cout<<\\"\u4ECA\u665A\\"<<langrensha+1<<\\"\u53F7\u6B7B\u4E86,\u4F60\u60F3\u7528\u89E3\u836F\u5417\uFF1F(1\u60F3 / 2\u4E0D\u60F3)\\\\n\\";\\r\\n int is_nvwujie=0;\\r\\n cin>>is_nvwujie;\\r\\n while(is_nvwujie!=1&&is_nvwujie!=2){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>is_nvwujie;\\r\\n } \\r\\n if(is_nvwujie==1) {\\r\\n Sleep(1000);\\r\\n cout<<\\"\u5DF2\u7ECF\u89E3\u6551\\"<<langrensha+1<<\\"\u53F7\\\\n\\";\\r\\n nvwujiu=langrensha;\\r\\n }\\r\\n is_nvwujiu=1;\\r\\n }\\r\\n Sleep(1500);\\r\\n if(::is_nvwudu) cout<<\\"\u4F60\u5DF2\u7ECF\u7528\u8FC7\u89E3\u836F\\\\n\\",Sleep(1500);\\r\\n else\\r\\n {\\r\\n cout<<\\"\u4F60\u60F3\u7528\u6BD2\u836F\u5417\uFF1F\uFF081\u60F3 / 2\u4E0D\u60F3\uFF09\\\\n\\";\\r\\n Sleep(1500);\\r\\n int is_nvwudu=0;\\r\\n cin>>is_nvwudu;\\r\\n while(is_nvwudu!=1&&is_nvwudu!=2){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>is_nvwudu;\\r\\n } \\r\\n if(is_nvwudu==1){\\r\\n Sleep(1500);\\r\\n cout<<\\"\u4F60\u60F3\u6BD2\u8C01\uFF1F\\\\n\\"; \\r\\n cin>>nvwudu;\\r\\n while(!(nvwudu>=1&&nvwudu<=player_number&&players[nvwudu].die_or_life==life)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\\\\n\\";\\r\\n cin>>nvwudu; \\r\\n }\\r\\n nvwudu--;\\r\\n Sleep(1500);\\r\\n cout<<\\"\u5DF2\u7ECF\u6BD2\u6B7B\u4E86\\"<<nvwudu+1<<\\"\u53F7\\\\n\\";\\r\\n }\\r\\n ::is_nvwudu=1;\\r\\n } \\r\\n }else{\\r\\n if(players[idxnvwu].die_or_life == life){\\r\\n if(!is_nvwujiu)\\r\\n {\\r\\n int is_jiu=rand()%8;\\r\\n if(is_jiu==0){\\r\\n nvwujiu=langrensha;\\r\\n is_nvwujiu=1;\\r\\n } \\r\\n }\\r\\n if(!is_nvwudu)\\r\\n {\\r\\n int is_du=rand()%4;\\r\\n if(is_du==0){\\r\\n int num=rand()%player_number;\\r\\n nvwudu=num;\\r\\n is_nvwudu=1;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n } \\r\\n cout<<\\"\u5973\u5DEB~\u8BF7\u95ED\u773C~~\\\\n\\\\n\\";\\r\\n return nvwujiu*10000+nvwudu;//\u4F20\u56DE\u4E24\u4E2A\u53D8\u91CF\uFF0C\u201C\u52A0\u5BC6\u201D\u64CD\u4F5C \\r\\n}\\r\\n\\r\\nint yuyanjiabixutoupiao=-1;\\r\\n/*\u9884\u8A00\u5BB6\u64CD\u4F5C*/\\r\\nvoid YuYanJia(){\\r\\n color(green);\\r\\n cout<<\\"\u9884\u8A00\u5BB6~\u8BF7\u7741\u773C~~\\\\n\\";\\r\\n Sleep(2000);\\r\\n if(players[my_number].type==yuyanjia&&players[my_number].die_or_life == life){\\r\\n cout<<\\"\u8BF7\u95EE\u4F60\u60F3\u67E5\u9A8C\u8C01\u7684\u8EAB\u4EFD\\\\n\\";\\r\\n int p;\\r\\n cin>>p;\\r\\n while(!(p>=1&&p<=player_number)){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>p;\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<p<<\\"\u53F7\u7684\u8EAB\u4EFD\u662F\u2014\u2014\\";\\r\\n Sleep(1000);\\r\\n if(players[p-1].type == langren){\\r\\n cout<<\\"\u72FC\u4EBA\\\\n\\";\\r\\n players[p-1].is_light = 1;\\r\\n }else{\\r\\n cout<<\\"\u597D\u4EBA\\\\n\\";\\r\\n players[p-1].is_light = 2;\\r\\n }\\r\\n }else{\\r\\n int p=-1;\\r\\n while(p==-1||players[p].die_or_life==die||p==idxlieren)\\r\\n p=rand()%player_number;\\r\\n if(players[p].type==langren)//\u9501\u5B9A\u76EE\u6807! \\r\\n {\\r\\n yuyanjiabixutoupiao=p;\\r\\n }\\r\\n }\\r\\n cout<<\\"\u9884\u8A00\u5BB6~~\u8BF7\u95ED\u773C~~\\\\n\\";\\r\\n}\\r\\n\\r\\n/*\u9ED1\u591C\u64CD\u4F5C*/\\r\\nint LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; \\r\\nvoid Night(){ \\r\\n LANGRENSHA=-1,NVWUDU=-1,NVWUJIU=-1,SHOUWEISHOU=-1; \\r\\n\\r\\n //\u5982\u679C\u670912\u4EBA\u5C40\uFF0C\u6DFB\u52A0\u5B88\u536B \\r\\n if(player_number==12){\\r\\n SHOUWEISHOU=ShouWei();\\r\\n Sleep(2000);\\r\\n } \\r\\n /*\u72FC\u4EBA\u90E8\u5206*/\\r\\n LANGRENSHA=LangRen();\\r\\n Sleep(3500);\\r\\n /*\u5973\u5DEB\u90E8\u5206*/ \\r\\n int nvwu=NvWu(LANGRENSHA);\\r\\n NVWUDU=nvwu%10+nvwu/10%10;\\r\\n NVWUJIU=nvwu/10000%10+nvwu/100000%10;\\r\\n Sleep(3000);\\r\\n /*\u9884\u8A00\u5BB6\u90E8\u5206*/\\r\\n YuYanJia();\\r\\n Sleep(2000);\\r\\n}\\r\\n\\r\\n/*\u730E\u4EBA\u64CD\u4F5C*/\\r\\nvoid Lieren(){\\r\\n int lierendai=-1;\\r\\n cout<<idxlieren+1<<\\"\u53F7\u662F\u730E\u4EBA\\\\n\\";\\r\\n\\r\\n players[idxlieren].is_light = 1;\\r\\n Sleep(1000);\\r\\n if(idxlieren==my_number){\\r\\n cout<<\\"\u4F60\u60F3\u5E26\u8D70\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n cin>>lierendai;\\r\\n while(lierendai<1||lierendai>player_number||players[lierendai].die_or_life==die){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>lierendai;\\r\\n }\\r\\n lierendai--;\\r\\n }else{\\r\\n lierendai=rand()%player_number;\\r\\n while(players[lierendai].die_or_life == die){\\r\\n lierendai=rand()%player_number;\\r\\n }\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<\\"\u730E\u4EBA\u9009\u62E9\u5E26\u8D70\\"<<lierendai+1<<\\"\u53F7\\\\n\\";\\r\\n Sleep(2000);\\r\\n players[lierendai].die_or_life = die;\\r\\n}\\r\\n\\r\\nvoid police_die();\\r\\n/*\u5224\u65AD\u8C01\u6B7B\u4E86*/\\r\\nvoid panduansiwang(){\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n Sleep(3000);\\r\\n color(white);\\r\\n cout<<\\"\u5929\u4EAE\u4E86\\\\n\\";\\r\\n Sleep(2000);\\r\\n gotoxy(0,9);\\r\\n cout<<\\"\u6628\u665A\\";\\r\\n bool is_die[15]={false},is_die_lieren=false,flag=false;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(players[i].die_or_life==life)\\r\\n {\\r\\n if(i==LANGRENSHA||i==NVWUDU) {\\r\\n if(players[i].type==lieren) is_die_lieren=true;\\r\\n players[i].killer= (i==LANGRENSHA ? langren:nvwu);\\r\\n players[i].die_or_life=die;\\r\\n is_die[i]=true;\\r\\n }\\r\\n if(i==SHOUWEISHOU||i==NVWUJIU) {\\r\\n if(players[i].type==lieren) is_die_lieren=false;\\r\\n players[i].killer=-1;\\r\\n players[i].die_or_life=life;\\r\\n is_die[i]=false;\\r\\n } \\r\\n }\\r\\n }\\r\\n bool is_police_die=false;\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_die[i])\\r\\n {\\r\\n if(flag) cout<<\\"\u548C\\"<<i+1<<\\"\u53F7\\";\\r\\n else cout<<i+1<<\\"\u53F7\\",flag=true;\\r\\n if(i==idx_police) \\r\\n is_police_die=true;\\r\\n }\\r\\n }\\r\\n if(flag) cout<<\\"\u6B7B\u4E86\\\\n\\";\\r\\n else cout<<\\"\u662F\u5E73\u5B89\u591C\\\\n\\";\\r\\n\\r\\n if(is_die_lieren) Lieren();\\r\\n if(is_police_die) police_die();\\r\\n}\\r\\n\\r\\n/*\u9009\u8B66\u957F*/\\r\\nvoid choose_police(){\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n color(blue);\\r\\n gotoxy(0,7);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n color(yellow);\\r\\n cout<<\\"\u4E0B\u9762\u5F00\u59CB\u9009\u4E3E\u8B66\u957F\uFF0C\u5404\u4F4D\u4E0D\u80FD\u9009\u4E3E\u81EA\u5DF1~\\\\n\\";\\r\\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};\\r\\n memset(cannot,-1,sizeof(cannot));\\r\\n CHOOSE:\\r\\n color(yellow);\\r\\n Sleep(1500);\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(players[i].die_or_life==life&&!is_include(cannot,i,player_number))\\r\\n {\\r\\n if(i==my_number)\\r\\n {\\r\\n cout<<\\"\u4F60\u8981\u9009\u4E3E\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n int n;\\r\\n cin>>n;\\r\\n while(n<1||n>player_number||n==i+1||players[n-1].die_or_life==die||!is_include(must,n-1,player_number))\\r\\n {\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165!\\\\n\\";\\r\\n cin>>n;\\r\\n }\\r\\n cout<<i+1<<\\"\u53F7\u9009\u4E3E\\"<<n--<<\\"\u53F7\\\\n\\";\\r\\n tong[n]++;\\r\\n }\\r\\n else\\r\\n {\\r\\n int n=rand()%player_number;\\r\\n while(n==i||players[n].die_or_life==die||!is_include(must,n,player_number))\\r\\n n=rand()%player_number;\\r\\n cout<<i+1<<\\"\u53F7\u9009\u4E3E\\"<<n+1<<\\"\u53F7\\\\n\\";\\r\\n tong[n]++;\\r\\n }\\r\\n Sleep(1500);\\r\\n }\\r\\n }\\r\\n int idx_max=-1,maxn=-1,len=0;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(maxn<tong[i])\\r\\n {\\r\\n maxn=tong[i];\\r\\n idx_max=i;\\r\\n }\\r\\n int maxn_arr[15]={0};\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(tong[i]==maxn)\\r\\n {\\r\\n maxn_arr[len++]=i;\\r\\n }\\r\\n }\\r\\n color(blue);\\r\\n if(len>1)\\r\\n {\\r\\n for(int i=0;i<len;i++)\\r\\n {\\r\\n if(i==len-1)\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7\u5E73\u7968\\\\n\\"; \\r\\n }\\r\\n else\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7,\\";\\r\\n }\\r\\n }\\r\\n for(int i=0;i<len;i++)\\r\\n cannot[i]=maxn_arr[i];\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_include(cannot,i,len))\\r\\n must[i]=i;\\r\\n else\\r\\n must[i]=-1;\\r\\n }\\r\\n color(white);\\r\\n goto CHOOSE;\\r\\n }\\r\\n cout<<\\"\u606D\u559C\\"<<idx_max+1<<\\"\u53F7\u5F53\u9009\u8B66\u957F\\\\n\\";\\r\\n Sleep(3000);\\r\\n idx_police=idx_max;\\r\\n return;\\r\\n}\\r\\n\\r\\n/*\u6295\u7968*/\\r\\nint toupiao(){\\r\\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}; \\r\\n memset(cannot,-1,sizeof(cannot));\\r\\n gotoxy(0,7);\\r\\n color(blue);\\r\\n cout<<\\"________________________\\\\n\\";\\r\\n color(white);\\r\\n cout<<\\"\u4E0B\u9762\u8FDB\u5165\u6295\u7968\u73AF\u8282\\\\n\\";\\r\\n memset(tong,0,sizeof(tong));\\r\\n Sleep(2000);\\r\\n TOUPIAO:\\r\\n for(int i=0;i<player_number;i++){\\r\\n if(players[i].die_or_life == life&&!is_include(cannot,i,player_number)){\\r\\n if(i==my_number){\\r\\n color(white);\\r\\n cout<<\\"\u4F60\u8981\u6295\u51E0\u53F7\uFF1F\\\\n\\";\\r\\n int n;\\r\\n cin>>n;\\r\\n while(!(n>=1&&n<=player_number&&is_include(must,n-1,player_number))){\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>n;\\r\\n }\\r\\n Sleep(2000);\\r\\n cout<<setw(2)<<my_number+1<<\\"\u53F7\u6295\u4E86\\"<<setw(2)<<n<<\\"\u53F7\\";\\r\\n if(my_number==n-1) color(red),cout<<\\"\u5FEB\u6765\u770B\uFF01\u8FD9\u6709\u4E2A\u75AF\u5B50\u6295\u81EA\u5DF1\uFF01\\"; \\r\\n if(i==idx_police) color(yellow),cout<<\\"(\u8B66\u957F)\\\\n\\"; else cout<<\\"\\\\n\\";\\r\\n if(i==idx_police) tong[n-1]++;\\r\\n tong[n-1]++;\\r\\n }else{\\r\\n color(white);\\r\\n int t=-1;\\r\\n while(t==-1 || players[t].die_or_life == die || t==i || !is_include(must,t,player_number)){\\r\\n if(i==idxyuyanjia&&yuyanjiabixutoupiao!=-1)\\r\\n {\\r\\n t=yuyanjiabixutoupiao;\\r\\n yuyanjiabixutoupiao=-1;\\r\\n continue;\\r\\n }\\r\\n t=rand()%player_number;\\r\\n if(is_include(idxlangren,i,nlangren))\\r\\n {\\r\\n if(players[t].type == langren)\\r\\n t=-1;\\r\\n }\\r\\n }\\r\\n cout<<setw(2)<<i+1<<\\"\u53F7\\"<<\\"\u6295\u4E86\\"<<setw(2)<<t+1<<\\"\u53F7\\";\\r\\n if(i==idx_police) cout<<\\"(\u8B66\u957F2\u7968)\\\\n\\"; else cout<<\\"\\\\n\\";\\r\\n if(i==idx_police) tong[t]++;\\r\\n tong[t]++; \\r\\n }\\r\\n\\r\\n Sleep(rand()%1000+1000);\\r\\n }\\r\\n }\\r\\n int idx_max=-1,maxn=-1,len=0;\\r\\n for(int i=0;i<player_number;i++)\\r\\n if(maxn<tong[i])\\r\\n {\\r\\n maxn=tong[i];\\r\\n idx_max=i;\\r\\n }\\r\\n int maxn_arr[15]={0};\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(tong[i]==maxn)\\r\\n {\\r\\n maxn_arr[len++]=i;\\r\\n }\\r\\n }\\r\\n color(blue);\\r\\n if(len>1)\\r\\n {\\r\\n for(int i=0;i<len;i++)\\r\\n {\\r\\n if(i==len-1)\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7\u5E73\u7968\\\\n\\"; \\r\\n }\\r\\n else\\r\\n {\\r\\n cout<<maxn_arr[i]+1<<\\"\u53F7,\\";\\r\\n }\\r\\n }\\r\\n for(int i=0;i<len;i++)\\r\\n cannot[i]=maxn_arr[i];\\r\\n for(int i=0;i<player_number;i++)\\r\\n {\\r\\n if(is_include(cannot,i,len))\\r\\n must[i]=i;\\r\\n else\\r\\n must[i]=-1;\\r\\n }\\r\\n color(white);\\r\\n goto TOUPIAO;\\r\\n\\r\\n }\\r\\n\\r\\n cout<<idx_max+1<<\\"\u53F7\\"<<\\"\u51FA\u5C40\\\\n\\";\\r\\n Sleep(4000);\\r\\n players[idx_max].die_or_life = die;\\r\\n players[idx_max].killer = good;\\r\\n return idx_max;\\r\\n}\\r\\n\\r\\n/*\u8B66\u957F\u6B7B\u4EA1*/\\r\\nvoid police_die(){\\r\\n color(yellow);\\r\\n int type;\\r\\n if(idx_police==my_number)\\r\\n {\\r\\n Sleep(1550);\\r\\n cout<<\\"\u4F60\u662F\u60F3\u6495\u6BC1\u8B66\u5FBD\u8FD8\u662F\u79FB\u4EA4\u8B66\u5FBD\uFF1F\uFF08\u6495\u6BC1\u8F93\u51651\uFF0C\u79FB\u4EA4\u8F93\u51652)\\";\\r\\n\\r\\n cin>>type;\\r\\n while(!(type==1||type==2))\\r\\n {\\r\\n cout<<\\"\u8BF7\u91CD\u65B0\u8F93\u5165\uFF01\\\\n\\";\\r\\n cin>>type;\\r\\n }\\r\\n }\\r\\n else{\\r\\n type=rand()%3+1;\\r\\n }\\r\\n if(type==1)\\r\\n {\\r\\n cout<<\\"\u8B66\u957F\u9009\u62E9\u6495\u6BC1\u8B66\u5FBD\\\\n\\";\\r\\n Sleep(1000);\\r\\n idx_police=-1;\\r\\n }\\r\\n else\\r\\n {\\r\\n int lucky=-1;\\r\\n while(lucky==-1||players[lucky].die_or_life==die)\\r\\n lucky=rand()%player_number;\\r\\n cout<<\\"\u8B66\u957F\u9009\u62E9\u628A\u8B66\u5FBD\u79FB\u4EA4\u7ED9\\"<<lucky+1<<\\"\u53F7\\\\n\\";\\r\\n Sleep(1500);\\r\\n idx_police=lucky; \\r\\n }\\r\\n}\\r\\n\\r\\n/*\u6545\u4E8B\u7684\u6700\u540E*/\\r\\nvoid the_end(){\\r\\n system(\\"cls\\");\\r\\n switch(is_end()){\\r\\n case 1:cout<<\\"\u597D\u4EBA\u80DC\u5229\\\\n\\\\n\\"; break;\\r\\n case 2:cout<<\\"\u72FC\u4EBA\u80DC\u5229\\\\n\\\\n\\"; break;\\r\\n case 3:cout<<\\"\u672C\u5C40\u5E73\u5C40\\\\n\\\\n\\"; break;\\r\\n }\\r\\n for(int i=0;i<player_number;i++){\\r\\n cout<<i+1<<\\"\u53F7\u4F4D:\\\\t\\";\\r\\n switch(players[i].type){\\r\\n case nvwu: cout<<\\"\u5973\u5DEB\\\\t\\";break;\\r\\n case yuyanjia: cout<<\\"\u9884\u8A00\u5BB6\\\\t\\";break;\\r\\n case cunmin: cout<<\\"\u6751\u6C11\\\\t\\";break;\\r\\n case langren:cout<<\\"\u72FC\u4EBA\\\\t\\";break;\\r\\n case lieren:cout<<\\"\u730E\u4EBA\\\\t\\"; break; \\r\\n case shouwei:cout<<\\"\u5B88\u536B\\\\t\\";break; \\r\\n } \\r\\n cout<<\\"\u6700\u7EC8\\";\\r\\n switch(players[i].killer){\\r\\n case nvwu:cout<<\\"\u88AB\u5973\u5DEB\u6BD2\u6B7B\\\\n\\"; break;\\r\\n case langren:cout<<\\"\u88AB\u72FC\u4EBA\u6740\u6B7B\\\\n\\"; break;\\r\\n case good:cout<<\\"\u88AB\u6295\u7968\u51FA\u5C40\\\\n\\"; break;\\r\\n case lieren:cout<<\\"\u88AB\u730E\u4EBA\u5E26\u8D70\\\\n\\";break;\\r\\n default :cout<<\\"\u5B58\u6D3B\\\\n\\";\\r\\n }\\r\\n cout<<endl;\\r\\n }\\r\\n}\\r\\n\\r\\n/*\u4E3B\u51FD\u6570*/\\r\\nint main(){\\r\\n\\r\\n int wheel=0; \\r\\n before_game();\\r\\n while(!is_end()){\\r\\n //\u9ED1\u591C\u51C6\u5907 \\r\\n something_before_everyday();\\r\\n Sleep(1500); \\r\\n\\r\\n //\u9ED1\u591C\u90E8\u5206 \\r\\n Night(); //\u8FDB\u5165\u9ED1\u591C\uFF01 \\r\\n change_daytime(); //\u6362\u5929 \\r\\n\\r\\n //\u5929\u4EAE\u4E86 \\r\\n panduansiwang();//\u5224\u65AD\u8C01\u6B7B\u4E86 \\r\\n Sleep(2000);\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n if(is_end()) break;\\r\\n\\r\\n //\u9009\u8B66\u957F \\r\\n if(!wheel&&player_number==12)\\r\\n {\\r\\n choose_police();\\r\\n system(\\"cls\\");\\r\\n print();\\r\\n }\\r\\n\\r\\n //\u6295\u7968\u73AF\u8282 \\r\\n int idx_max=toupiao();//\u7968\u6570\u6700\u591A\u7684\u4EBA \\r\\n int lierendai=-1;\\r\\n if(idx_max==idx_police){\\r\\n police_die();\\r\\n }\\r\\n if(players[idx_max].type==lieren){//\u542F\u52A8\u730E\u4EBA\u7A0B\u5E8F \\r\\n Lieren();\\r\\n if(is_end()) break;\\r\\n }\\r\\n system(\\"cls\\");\\r\\n print(); \\r\\n wheel++;\\r\\n }\\r\\n\\r\\n the_end();\\r\\n system(\\"pause\\");\\r\\n return 0;\\r\\n}\\r\\n```\\r\\n\\r\\n\u5B9C\u8003NOIP , \u5C0F\u5FC3\u522B\u7206\u96F6.] \u9A97\u5206\u8FC7\u6837\u4F8B\uFF0C\u66B4\u529B\u51FA\u5947\u8FF9\u3002\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\\r\\n\\r\\n\u897F\u6C5F\u6708\xB7\u591C\u884COI\u9053\u4E2D \u660E\u6708AC\u60CA\u9E4A\uFF0C\\r\\n\\r\\nRE\u534A\u591C\u9E23\u8749\u3002\\r\\n\\r\\n\u7A3B\u82B1\u9999\u91CC\u8BF4\u4E30\u5E74\uFF0C\\r\\n\\r\\n\u542C\u53D6WA\u58F0\u4E00\u7247\u3002\\r\\n\\r\\n\u4E03\u516B\u4E2ATLE\uFF0C\\r\\n\\r\\n\u4E24\u4E09\u70B9MLE\u3002\\r\\n\\r\\n\u65E7\u65F6\u8305\u5E97\u793E\u6797\u8FB9\uFF0C\\r\\n\\r\\n\u8DEF\u8F6CCE\u5FFD\u89C1\u3002\\r\\n\\r\\n\u751F\u547D\u7684\u610F\u4E49?\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\u6D1B\u8C37\u65B0\u624B\u6751\u5916\uFF0C\u4E00\u4E2AOIer\u5F00\u8BBE\u7684\u673A\u623F\u91CC\uFF0C\u7A0B\u5E8F\u5458kkk\u7AEF\u5750\u5728\u684C\u540E\u3002\u4ED6\u5934\u4E5F\u4E0D\u62AC\uFF0C\u51B7\u51B7\u5730\u95EE\uFF1A\u201C\u4F60\u53EB\u4EC0\u4E48\u540D\u5B57\uFF1F\u201D\\r\\n\\r\\n\u201CQAQ\\\\_\\\\_\\"\\r\\n\\r\\n\u201C\u5E74\u9F84\uFF1F\u201D\\r\\n\\r\\n\u201C\\\\*\\\\*\u5C81\u3002\u201D\\r\\n\\r\\n\u201C\u4EC0\u4E48\u9519\u8BEF\uFF1F\u201D\\r\\n\\r\\n\u201CTLE\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7AD9\u8D77\u8EAB\u719F\u7EC3\u5730\u6253\u5F00\u75C5\u4EBA\u7684\u4EE3\u7801\u3002\u4ED6\u6123\u4F4F\u4E86\uFF0C\u84DD\u8272\u7684\u773C\u775B\u91CC\u95EA\u51FA\u60CA\u7591\u7684\u795E\u60C5\u3002\u4ED6\u91CD\u65B0\u5BA1\u89C6\u7740\u773C\u524D\u8FD9\u4E2A\u4EBA\uFF0C\u51B7\u51B7\u5730\u95EE\uFF1A\u201C\u4F60\u7684\u6D1B\u8C37\u540D\u662F\u4EC0\u4E48\u989C\u8272\u7684\uFF1F\u201D\\r\\n\\r\\n\u201C\u68D5\u8272\u3002\u201D\\r\\n\\r\\n\u201C\u4F60\u662F\u7EA2\u540D\uFF01\u201Dkkk\u7A0B\u5E8F\u5458\u4E00\u9488\u89C1\u8840\u5730\u8BF4\uFF0C\u201C\u6211\u5F53\u8FC7\u7BA1\u7406\u5458 \uFF08\u5176\u5B9E\u73B0\u5728\u4E5F\u662F\uFF09\uFF0C\u8FD9\u4E48\u591A\u7684\u4EE3\u7801\uFF0C\u53EA\u6709\u7EA2\u540D\u5927\u4F6C\u624D\u5199\u7684\u51FA\u6765\uFF01\u201D\\r\\n\\r\\n\u75C5\u4EBA\u5FAE\u5FAE\u4E00\u7B11\uFF0C\u8BF4\uFF1A\u201Ckkk\u7A0B\u5E8F\u5458\uFF0C\u4F60\u8BF4\u6211\u662F\u7EA2\u540D\uFF0C\u6211\u5C31\u662F\u7EA2\u540D\u5427\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7684\u76EE\u5149\u67D4\u548C\u4E86\uFF0C\u4ED6\u5429\u5490\u540C\u4E8B\uFF1A\u201C\u51C6\u5907\u6539BUG\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u6B63\u5728\u6362\u5DE5\u4F5C\u670D\uFF0C\u540C\u4E8B\u8DD1\u6765\uFF0C\u4F4E\u58F0\u544A\u8BC9\u4ED6\u75C5\u4EBA\u62D2\u7EDD\u4F7F\u7528O2\u4F18\u5316\u3002kkk\u7A0B\u5E8F\u5458\u7684\u7709\u6BDB\u626C\u4E86\u8D77\u6765\uFF0C\u4ED6\u8D70\u8FDB\u673A\u623F\uFF0C\u751F\u6C14\u5730\u8BF4\uFF1A\u201C\u5E74\u8F7B\u4EBA\uFF0C\u5728\u8FD9\u513F\u8981\u542C\u7A0B\u5E8F\u5458\u7684\u6307\u6325\uFF01\u201D\\r\\n\\r\\n\u75C5\u4EBA\u5E73\u9759\u5730\u56DE\u7B54\uFF1A\u201Ckkk\u7A0B\u5E8F\u5458\uFF0CO2\u4F18\u5316\u79BB\u5934\u6587\u4EF6\u592A\u8FD1\uFF0C\u6211\u62C5\u5FC3\u65BD\u884CO2\u4F18\u5316\u4F1A\u5F71\u54CD\u5934\u6587\u4EF6\u3002\u800C\u6211\uFF0C\u4ECA\u540E\u9700\u8981\u4E00\u4E2A\u975E\u5E38\u597D\u7528\u7684\u5934\u6587\u4EF6\uFF01\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u518D\u4E00\u6B21\u6123\u4F4F\u4E86\uFF0C\u7ADF\u6709\u70B9\u53E3\u5403\u5730\u8BF4\uFF1A\u201C\u4F60\uFF0C\u4F60\u80FD\u5FCD\u53D7\u5417\uFF1F\u4F60\u7684\u7A0B\u5E8F\u9700\u8981\u52A0\u4E0A\u65E0\u6570\u4E2A\u526A\u679D\uFF0C\u628A\u539F\u5148\u7684\u4EE3\u7801\u548C\u4F60\u6539\u7684\u4EE3\u7801\u5168\u90E8\u5220\u6389\uFF01\u201D\\r\\n\\r\\n\u201C\u8BD5\u8BD5\u770B\u5427\u3002\u201D\\r\\n\\r\\n\u7535\u8111\u524D\uFF0C\u4E00\u5411\u4ECE\u5BB9\u9547\u5B9A\u7684kkk\u7A0B\u5E8F\u5458\uFF0C\u8FD9\u6B21\u53CC\u624B\u5374\u6709\u4E9B\u98A4\u6296\uFF0C\u4ED6\u989D\u4E0A\u6C57\u73E0\u6EDA\u6EDA\uFF0C\u540C\u4E8B\u5E2E\u4ED6\u64E6\u4E86\u4E00\u6B21\u53C8\u4E00\u6B21\u3002\u6700\u540E\u4ED6\u5FCD\u4E0D\u4F4F\u5F00\u53E3\u5BF9\u75C5\u4EBA\u8BF4\uFF1A\u201C\u4F60\u633A\u4E0D\u4F4F\u53EF\u4EE5\u54FC\u53EB\u3002\u201D\\r\\n\\r\\n\u75C5\u4EBA\u4E00\u58F0\u4E0D\u542D\uFF0C\u53CC\u624B\u7D27\u7D27\u6293\u4F4F\u8EAB\u4E0B\u7684\u767D\u5E8A\u5355\uFF0C\u624B\u80CC\u9752\u7B4B\u66B4\u8D77\uFF0C\u6C57\u5982\u96E8\u4E0B\u3002\u4ED6\u8D8A\u6765\u8D8A\u4F7F\u52B2\uFF0C\u5D2D\u65B0\u7684\u767D\u5E8A\u5355\u5C45\u7136\u88AB\u6293\u7834\u4E86\u3002\uFF08\u6CE8\uFF1A\u539F\u56E0\u662F\u56E0\u4E3A\u4E0D\u613F\u610F\u770B\u5230\u81EA\u5DF1\u7684\u4EE3\u7801\u88AB\u6539\uFF09\\r\\n\\r\\n\u8131\u53BB\u5DE5\u4F5C\u670D\u7684kkk\u7A0B\u5E8F\u5458\u64E6\u7740\u6C57\u8D70\u8FC7\u6765\uFF0C\u7531\u8877\u5730\u8BF4\uFF1A\u201C\u5E74\u8F7B\u4EBA\uFF0C\u6211\u771F\u62C5\u5FC3\u4F60\u4F1AWA\u8FC7\u53BB\u3002\u201D\\r\\n\\r\\n\u75C5\u4EBA\u8138\u8272\u82CD\u767D\u3002\u4ED6\u52C9\u5F3A\u4E00\u7B11\uFF0C\u8BF4\uFF1A\u201C\u6211\u4E00\u76F4\u5728\u6570\u4F60\u7684\u6539\u7684\u884C\u6570\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u5413\u4E86\u4E00\u8DF3\uFF0C\u4E0D\u76F8\u4FE1\u5730\u95EE\uFF1A\u201C\u6211\u6539\u4E86\u591A\u5C11\u884C\uFF1F\u201D\\r\\n\\r\\n\u201C2^6\u884C\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u60CA\u5446\u4E86\uFF0C\u5927\u58F0\u56B7\u9053\uFF1A\u201C\u4F60\u662F\u4E00\u4E2A\u771F\u6B63\u7684OIer\uFF0C\u4E00\u4E2A\u4F1A\u5199\u4EE3\u7801\u7684\u795E\u7287\uFF01\u4F60\u582A\u79F0\u7BA1\u7406\u5458\uFF01\u201D\\r\\n\\r\\n\u201C\u4F60\u8FC7\u5956\u4E86\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u7684\u8138\u4E0A\u6D6E\u51FA\u6148\u7965\u7684\u795E\u60C5\u3002\u4ED6\u60F3\u8BF4\u4EC0\u4E48\u53C8\u5FCD\u4F4F\u4E86\uFF0C\u6325\u624B\u8BA9\u540C\u4E8B\u51FA\u53BB\uFF0C\u7136\u540E\u5173\u4E0A\u673A\u623F\u7684\u95E8\uFF0C\u6CE8\u89C6\u7740\u75C5\u4EBA\uFF0C\u8BF4\uFF1A\u201C\u544A\u8BC9\u6211\uFF0C\u4F60\u7684\u771F\u540D\u53EB\u4EC0\u4E48\uFF1F\u201D\\r\\n\\r\\n\u201Cchen\\\\_zhe\u3002\u201D\\r\\n\\r\\nkkk\u7A0B\u5E8F\u5458\u8083\u7136\u8D77\u656C\uFF1A\u201C\u554A\uFF0CAK IOI\u7684\u795E\u7287\uFF0C\u4E45\u4EF0\u4E45\u4EF0\uFF0C\u8BA4\u8BC6\u4F60\u5F88\u8363\u5E78\u3002\u201Dchen\\\\_zhe\u53CB\u597D\u5730\u628A\u624B\u4F38\u4E86\u8FC7\u53BB\u3002\\r\\n\\r\\n\u627E\u5230\u4E00\u9996 \u201C\u597D\u201D \u8BD7\uFF0C\u7ED9\u5927\u5BB6\u5206\u4EAB\u4E00\u4E0B\uFF1A\\r\\n\\r\\n\u542C\u8BF4\u6D25\u6D25\u4E3A\u8BFE\u7A0B\u70E6\u607C \u91D1\u660E\u4E00\u5BB6\u4F4F\u8FDB\u4E86\u65B0\u623F\\r\\n\\r\\n\u542C\u8BF4\u4E01\u4E01\u73A9\u6570\u5B57\u6E38\u620F \u706B\u67F4\u68D2\u80FD\u642D\u51FA\u65B0\u5929\u5730\\r\\n\\r\\n\u542C\u8BF4\u6821\u95E8\u5916\u6B63\u5728\u780D\u6811 \u5927\u5BB6\u4E00\u8D77\u505A\u9776\u5F62\u6570\u72EC\\r\\n\\r\\n\u542C\u8BF4\u65C5\u884C\u8005\u5728\u8D5A\u5DEE\u4EF7 \u6F5C\u4F0F\u8005\u6B63\u5728\u7834\u8BD1\u7740\u5BC6\u7801\\r\\n\\r\\n\u53EA\u6709\u65E0\u5C3D\u7684\u4EE3\u7801\u77E5\u9053 \u6D25\u6D25\u6446\u8131\u4E86\u5B66\u4E60\u7684\u70E6\u607C\\r\\n\\r\\n\u91D1\u660E\u5F00\u5FC3\u5730\u8D70\u8FDB\u5546\u5E97 \u6311\u9009\u7740\u4E66\u684C\u548C\u7535\u8111\\r\\n\\r\\n\u603B\u6709\u4E00\u79CD\u7B97\u6CD5\u80FD\u591F\u8BA9\u4F60\u6210\u529F\u62FF\u5230\u5206\\r\\n\\r\\n\u65E0\u8BBA\u662F\u8D2A\u5FC3\u8FD8\u662F\u52A8\u89C4 \u6216\u8005\u5C06\u7B54\u6848\u4E8C\u5206\\r\\n\\r\\n\u601D\u5982\u6CC9\u6D8C\u6380\u8D77\u6CE2\u6D9B \u53C8\u6C47\u6210\u4E00\u4E2A\u65B0\u7684\u7B97\u6CD5\\r\\n\\r\\n\u8BA9\u6240\u6709TLE \u6240\u6709MLE \u6FC0\u52B1\u7740\u6211\u4EEC\u524D\u884C\u5199\u4EE3\u7801\\r\\n\\r\\n\u542C\u8BF4\u540C\u5B66\u4EEC\u5728\u73A9\u63A8\u7406 \u5C0FZ\u7684\u889C\u5B50\u603B\u914D\u4E0D\u9F50\\r\\n\\r\\n\u542C\u8BF4\u4E24\u4EBA\u5728\u6311\u9009\u5BA2\u6808 \u706B\u661F\u4E0A\u6709\u6761\u80FD\u91CF\u9879\u94FE\\r\\n\\r\\n\u542C\u8BF4\u9676\u9676\u5728\u91C7\u6458\u82F9\u679C \u4E00\u53EA\u9752\u86D9\u8981\u4ECE\u6CB3\u8FB9\u8FC7\\r\\n\\r\\n\u542C\u8BF4\u63A8\u9500\u5458\u8D70\u5165\u80E1\u540C \u6770\u745E\u722C\u8FDB\u4E86\u5976\u916A\u7684\u5C0F\u6D1E\\r\\n\\r\\n\u53EA\u6709\u65E0\u5C3D\u7684\u4EE3\u7801\u77E5\u9053 \u540C\u5B66\u4EEC\u7537\u5973\u914D\u5BF9\u7EC3\u8D77\u4E86\u821E\u8E48\\r\\n\\r\\n\u5C0FZ\u628A\u4ED6\u7684\u889C\u5B50\u627E\u5230 AK\u4E86\u65E0\u6570\u673A\u623F\\r\\n\\r\\n\u5C4F\u5E55\u5FAE\u5FAE\u53D1\u4EAE \u601D\u60F3\u5728\u865A\u6811\u8DEF\u5F84\u5F77\u5FA8\\r\\n\\r\\n\u5E73\u9762\u7684\u5411\u91CF\u4EA4\u9519\u751F\u957F \u7EC7\u6210\u5FE7\u4F24\u7684\u7F51\\r\\n\\r\\n\u526A\u679D\u526A\u53BB\u6211\u4EEC\u7684\u75AF\u72C2 SPFA\u544A\u8BC9\u6211\u524D\u9014\u5728\u4F55\u65B9\\r\\n\\r\\n01\u80CC\u5305\u88C5\u4E0B\u4E86\u5FE7\u4F24 \u7B11\u989C\u6D0B\u6EA2\u8138\u5E9E\\r\\n\\r\\n\u6DF1\u591C\u7535\u8111,\u5BCC\u4E3D\u5802\u7687,\u9898\u76EE W A ,\u4E0D\u514D\u5F77\u5FA8.\\r\\n\\r\\nD P \u80CC\u5305,\u8FF7\u8FF7\u832B\u832B,R P R P ,\u5168\u90E8\u7528\u5149.\\r\\n\\r\\n\u5C4F\u5E55\u5FAE\u4EAE,\u4EE3\u7801\u5343\u884C,\u7070\u540D\u84DD\u540D,\u6DE1\u6DE1\u5FE7\u4F24\u2026\u2026\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\u3002\\r\\n\\r\\n\uFF08#\\r\\n#DFBYP312. \u3010\u5165\u95E8\u3011\u5206\u8DF3\u7EF3#\uFF09\\r\\n\\r\\n# 0 **Compile Error**\\r\\n\\r\\n```\\r\\nfoo.cc: In function \'int main()\':\\r\\nfoo.cc:5:15: error: no match for \'operator>\' (operand types are \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} and \'int\')\\r\\n 5 | cin>>a>b;\\r\\n | ~~~~~~^~\\r\\n | | |\\r\\n | | int\\r\\n | std::basic_istream<char>::__istream_type {aka std::basic_istream<char>}\\r\\nfoo.cc:5:15: note: candidate: \'operator>(int, int)\' (built-in)\\r\\n 5 | cin>>a>b;\\r\\n | ~~~~~~^~\\r\\nfoo.cc:5:15: note: no known conversion for argument 1 from \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} to \'int\'\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/regex:66,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:110,\\r\\n from foo.cc:1:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: candidate: \'template<class _BiIter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const sub_match<_BiIter>&)\'\\r\\n 1150 | operator>(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1150:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: candidate: \'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)\'\\r\\n 1210 | operator>(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1210:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: candidate: \'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)\'\\r\\n 1303 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1303:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)\'\\r\\n 1377 | operator>(typename iterator_traits<_Bi_iter>::value_type const* __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1377:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__cxx11::sub_match<_BiIter>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)\'\\r\\n 1471 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1471:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)\'\\r\\n 1547 | operator>(typename iterator_traits<_Bi_iter>::value_type const& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1547:5: note: template argument \\r\\ndeduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__cxx11::sub_match<_BiIter>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: candidate: \'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)\'\\r\\n 1647 | operator>(const sub_match<_Bi_iter>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/regex.h:1647:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::sub_match<_BiIter>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:47,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/locale_classes.h:40,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/ios_base.h:41,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ios:42,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/istream:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/sstream:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/complex:45,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/ccomplex:39,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:54:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: candidate: \'template<class _Iterator> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)\'\\r\\n 465 | operator>(const reverse_iterator<_Iterator>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:465:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::reverse_iterator<_Iterator>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: candidate: \'template<class _IteratorL, class _IteratorR> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)\'\\r\\n 510 | operator>(const reverse_iterator<_IteratorL>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:510:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::reverse_iterator<_Iterator>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: candidate: \'template<class _IteratorL, class _IteratorR> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)\'\\r\\n 1721 | operator>(const move_iterator<_IteratorL>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1721:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::move_iterator<_IteratorL>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: candidate: \'template<class _Iterator> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)\'\\r\\n 1780 | operator>(const move_iterator<_Iterator>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_iterator.h:1780:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::move_iterator<_IteratorL>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_algobase.h:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:50:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: candidate: \'template<class _T1, class _T2> constexpr bool std::operator>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)\'\\r\\n 676 | operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_pair.h:676:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::pair<_T1, _T2>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/string:53:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)\'\\r\\n 3737 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3737:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)\'\\r\\n 3750 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3750:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: candidate: \'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)\'\\r\\n 3762 | operator>(const _CharT* __lhs,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/basic_string.h:3762:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const _CharT*\' and \'std::basic_istream<char>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/deque:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:68:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const deque<_Tp, _Alloc>&, const deque<_Tp, _Alloc>&)\'\\r\\n 2345 | operator>(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_deque.h:2345:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::deque<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/functional:54,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:71:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: candidate: \'template<class ... _TElements, class ... _UElements> constexpr bool std::operator>(const tuple<_Elements ...>&, const tuple<_Types ...>&)\'\\r\\n 1557 | operator>(const tuple<_TElements...>& __t,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/tuple:1557:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::tuple<_Elements ...>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/list:63,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:79:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const __cxx11::list<_Tp, _Alloc>&, const __cxx11::list<_Tp, _Alloc>&)\'\\r\\n 2196 | operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_list.h:2196:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__cxx11::list<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:81:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: candidate: \'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const map<_Key, _Tp, _Compare, _Alloc>&, const map<_Key, _Tp, _Compare, _Alloc>&)\'\\r\\n 1563 | operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_map.h:1563:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::map<_Key, _Tp, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/map:62:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: candidate: \'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator>(const multimap<_Key, _Tp, _Compare, _Alloc>&, const multimap<_Key, _Tp, _Compare, _Alloc>&)\'\\r\\n 1184 | operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multimap.h:1184:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::multimap<_Key, _Tp, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:75,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:82:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: candidate: \'template<class _Tp, class _Dp, class _Up, class _Ep> bool std::operator>(const unique_ptr<_Tp, _Dp>&, const unique_ptr<_Up, _Ep>&)\'\\r\\n 929 | operator>(const unique_ptr<_Tp, _Dp>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:929:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::unique_ptr<_Tp, _Dp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: candidate: \'template<class _Tp, class _Dp> bool std::operator>(const unique_ptr<_Tp, _Dp>&, nullptr_t)\'\\r\\n 937 | operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:937:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::unique_ptr<_Tp, _Dp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: candidate: \'template<class _Tp, class _Dp> bool std::operator>(nullptr_t, const unique_ptr<_Tp, _Dp>&)\'\\r\\n 947 | operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/unique_ptr.h:947:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::unique_ptr<_Tp, _Dp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:53,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/memory:76:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: candidate: \'template<class _Tp1, class _Tp2, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp1, _Lp>&, const __shared_ptr<_Tp2, _Lp>&)\'\\r\\n 1883 | operator>(const __shared_ptr<_Tp1, _Lp>& __a,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1883:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__shared_ptr<_Tp1, _Lp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: candidate: \'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(const __shared_ptr<_Tp, _Lp>&, nullptr_t)\'\\r\\n 1889 | operator>(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1889:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::__shared_ptr<_Tp, _Lp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: candidate: \'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>&)\'\\r\\n 1894 | operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr_base.h:1894:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::__shared_ptr<_Tp, _Lp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: candidate: \'template<class _Tp, class _Up> bool std::operator>(const shared_ptr<_Tp>&, const shared_ptr<_Tp>&)\'\\r\\n 653 | operator>(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:653:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::shared_ptr<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: candidate: \'template<class _Tp> bool std::operator>(const shared_ptr<_Tp>&, nullptr_t)\'\\r\\n 659 | operator>(const shared_ptr<_Tp>& __a, nullptr_t) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:659:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::shared_ptr<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: candidate: \'template<class _Tp> bool std::operator>(nullptr_t, const shared_ptr<_Tp>&)\'\\r\\n 665 | operator>(nullptr_t, const shared_ptr<_Tp>& __a) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/shared_ptr.h:665:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::shared_ptr<_Tp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/vector:64,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:86:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const vector<_Tp, _Alloc>&, const vector<_Tp, _Alloc>&)\'\\r\\n 2087 | operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_vector.h:2087:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::vector<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/queue:64:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: candidate: \'template<class _Tp, class _Seq> bool std::operator>(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&)\'\\r\\n 413 | operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_queue.h:413:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::queue<_Tp, _Seq>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:87:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: candidate: \'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const set<_Key, _Compare, _Alloc>&, const set<_Key, _Compare, _Alloc>&)\'\\r\\n 1037 | operator>(const set<_Key, _Compare, _Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_set.h:1037:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::set<_Key, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/set:62:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: candidate: \'template<class _Key, class _Compare, class _Alloc> bool std::operator>(const multiset<_Key, _Compare, _Alloc>&, const multiset<_Key, _Compare, _Alloc>&)\'\\r\\n 1024 | operator>(const multiset<_Key,_Compare,_Alloc>& __x,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_multiset.h:1024:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::multiset<_Key, _Compare, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/stack:61,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:89:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: candidate: \'template<class _Tp, class _Seq> bool std::operator>(const stack<_Tp, _Seq>&, const stack<_Tp, _Seq>&)\'\\r\\n 389 | operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/stl_stack.h:389:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::stack<_Tp, _Seq>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:603,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:95:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::_Expr<_Dom1, typename _Dom1::value_type>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::_Expr<_Dom1, typename _Dom1::value_type>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: candidate: \'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)\'\\r\\n 420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::_Expr<_Dom1, typename _Dom1::value_type>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const valarray<_Tp>&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::valarray<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::valarray<_Tp>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: candidate: \'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)\'\\r\\n 1201 | _DEFINE_BINARY_OPERATOR(>, __greater)\\r\\n | ^~~~~~~~~~~~~~~~~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/valarray:1201:1: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: mismatched types \'const std::valarray<_Tp>\' and \'int\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:99:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: candidate: \'template<class _Tp, long unsigned int _Nm> bool std::operator>(const array<_Tp, _Nm>&, const array<_Tp, _Nm>&)\'\\r\\n 350 | operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/array:350:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::array<_Tp, _Nm>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/forward_list:38,\\r\\n from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:104:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: candidate: \'template<class _Tp, class _Alloc> bool std::operator>(const forward_list<_Tp, _Alloc>&, const forward_list<_Tp, _Alloc>&)\'\\r\\n 1511 | operator>(const forward_list<_Tp, _Alloc>& __lx,\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/bits/forward_list.h:1511:5: note: template argument deduction/substitution failed:\\r\\nfoo.cc:5:16: note: \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} is not derived from \'const std::forward_list<_Tp, _Alloc>\'\\r\\n 5 | cin>>a>b;\\r\\n | ^\\r\\nIn file included from /nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/x86_64-unknown-linux-gnu/bits/stdc++.h:113:\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:3: note: candidate: \'bool std::operator>(thread::id, thread::id)\'\\r\\n 85 | operator>(thread::id __x, thread::id __y) noexcept\\r\\n | ^~~~~~~~\\r\\n/nix/store/qfqjymymsd2x29yknsgllfiq1h64s3f4-gcc-12.3.0/include/c++/12.3.0/thread:85:24: note: no known conversion for argument 1 from \'std::basic_istream<char>::__istream_type\' {aka \'std::basic_istream<char>\'} to \'std::thread::id\'\\r\\n 85 | operator>(thread::id __x, thread::id __y) noexcept\\r\\n | ~~~~~~~~~~~^~~\\r\\n```\\r\\n\\r\\n# \u4EE3\u7801\\r\\n\\r\\n[ \u4E0B\u8F7D](https://oj.qdturing.cn/d/W0001/record/66792c8f00458a4cdc048c58?download=true)\\r\\n\\r\\n```cpp\\r\\n#include<bits/stdc++.h>\\r\\nusing namespace std;\\r\\nint main(){\\r\\n\\tint a,b,c;\\r\\n\\tcin>>a>b;\\r\\n\\tcout<<a/b<<\\" \\"<<a%b;\\r\\n\\treturn 0;\\r\\n}\\r\\n\u5C31\u8FD9\uFF1F\uFF1F\uFF1F\uFF1F\uFF1F\uFF1F\\r\\n```\\r\\n\\r\\n[\u6613\u8D77\u6E38 - \u641C\u7D22 (bing.com)](https://cn.bing.com/search?q=%E6%98%93%E8%B5%B7%E6%B8%B8&gs_lcrp=EgZjaHJvbWUqBwgAEEUYwgMyBwgAEEUYwgMyBwgBEEUYwgMyBwgCEEUYwgMyBwgDEEUYwgMyBwgEEEUYwgMyBwgFEEUYwgMyBwgGEEUYwgMyBwgHEEUYwgPSAQsxNzAzOTYzajBqNKgCCLACAQ&FORM=ANAB01&PC=EDGEDBB) \u3010cn.bing.com\u3011\u6613\u8D77\u6E38 \uD83D\uDC4D \uD83D\uDC4E \uD83D\uDE80\uFE0F\\r\\n\\r\\n```none\\r\\n\\"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\\":\\"\u4E8E\u8001\u5E08\u7684python\u57DF\\",\\"bulletin\\":\\"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED\\",\\"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\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"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\\\\\\":\\\\\\"\u4E8E\u8001\u5E08\u7684python\u57DF\\\\\\",\\\\\\"bulletin\\\\\\":\\\\\\"\u6B22\u8FCE\u6765\u5230\u4E8E\u8001\u5E08\u7684\u4FE1\u606F\u5B66\u7ADE\u8D5B\u9884\u79D1\u73ED\\\\\\",\\\\\\"roles\\\\\\":{\\\\\\"stu\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\\\\\\",\\\\\\"guest\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652661870373870220902529\\\\\\",\\\\\\"default\\\\\\":\\\\\\"10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652814419292857815499457\\\\\\"},\\\\\\"avatar\\\\\\":\\\\\\"qq:28015861\\\\\\",\\\\\\"langs\\\\\\":\\\\\\"\\\\\\",\\\\\\"share\\\\\\":\\\\\\"\\\\\\"}],\\\\\\"tfa\\\\\\":false,\\\\\\"authn\\\\\\":false,\\\\\\"group\\\\\\":[\\\\\\"\u5468\u65E5\u4E0B\u53481\u70B915\u73ED\\\\\\",\\\\\\"1015\\\\\\"],\\\\\\"viewLang\\\\\\":\\\\\\"zh\\\\\\",\\\\\\"skipAnimate\\\\\\":true,\\\\\\"timeZone\\\\\\":\\\\\\"Asia/Shanghai\\\\\\",\\\\\\"codeLang\\\\\\":\\\\\\"py.py2\\\\\\",\\\\\\"codeTemplate\\\\\\":\\\\\\"\\\\\\",\\\\\\"avatar\\\\\\":\\\\\\"gravatar:duVZICerlJNJ@hydro.local\\\\\\",\\\\\\"qq\\\\\\":\\\\\\"\\\\\\",\\\\\\"gender\\\\\\":\\\\\\"2\\\\\\",\\\\\\"bio\\\\\\":\\\\\\"\uD83D\uDC4D \uD83D\uDC4E \uD83D\uDE80\uFE0F \\\\\\\\r\\\\\\\\n\\\\\\",\\\\\\"school\\\\\\":\\\\\\"\u9752\u5C9B\u7ACB\u65B0\u5C0F\u5B66\\\\\\",\\\\\\"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\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"coin\\\\\\":37200,\\\\\\"displayName\\\\\\":\\\\\\"\u6881\u5BB6\u7855\\\\\\",\\\\\\"nAccept\\\\\\":124,\\\\\\"nSubmit\\\\\\":137,\\\\\\"rp\\\\\\":0,\\\\\\"rpInfo\\\\\\":{},\\\\\\"level\\\\\\":0,\\\\\\"avatarUrl\\\\\\":\\\\\\"//sdn.geekzu.org/avatar/4779837f999db1fa2002860d3a781a04?d=mm&s=128\\\\\\"}\\"}\\r\\n\u4F1A\u51FA\u73B0\u56DE\u6536\u5DE5\u5382\u4E2A \uFF0C\u770B\u2018\u2019vlx \u2018\u2019\u3010\u3011\u6F02\u4EAE\u3010\u3011\\r\\n\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n\u666E\u901A\u8F93\u5165 n=int(input()) \u5207\u7247\u8F93\u5165 \u2014\u2014\uFF0C\u2014\u2014=map(int,input().split()) \u5217\u8868\u8F93\u5165 a(list(map(int,input().split())) \u8FDE\u7EED\u8F93\u5165 for i in range(0x3f3f3f3f): a=int(input()) \u603B\u4F1A\u6709\u5730\u4E0A\u7684\u751F\u7075\uFF0C\u6562\u4E8E\u76F4\u9762\u96F7\u9706\u7684\u5A01 \u5149 \u9996\u53D1\u4E8E[\u9ED1\u5BA2\u5DE5\u5177](https://www.zhihu.com/column/c_1318154529670574080)\\r\\n\\r\\n\u5207\u6362\u6A21\u5F0F\\r\\n\\r\\n\u5199\u6587\u7AE0\\r\\n\\r\\n\u767B\u5F55/\u6CE8\u518C\\r\\n\\r\\n\\r\\n\\r\\n# \u8FD93\u4E2A\u9ED1\u79D1\u6280\u7F51\u7AD9\uFF0C\u8BA9\u4F60\u79D2\u53D8\u201D\u9ED1\u5BA2\u201C\\r\\n\\r\\n[](https://www.zhihu.com/people/an-wang-hei-ke)\\r\\n\\r\\n[\u5C0F\u9053hack](https://www.zhihu.com/people/an-wang-hei-ke)\\r\\n\\r\\n> \u6765\u6E90\uFF1A\u7801\u519C\u5B66\u4E60\u8054\u76DF\\r\\n\\r\\n\u60F3\u8981\u4E86\u89E3\u5168\u7403\u88AB\u9ED1\u5BA2\u653B\u51FB\u7684\u60C5\u51B5\u5417\uFF1F\\r\\n\\r\\n\u60F3\u4F53\u9A8C\u4E0B\u7535\u5F71\u4E0A\u9ED1\u5BA2\u4F7F\u7528\u7684\u9A9A\u64CD\u4F5C\u5417\uFF1F\\r\\n\\r\\n\u53C8\u6216\u8005\u4E00\u952E\u751F\u6210\u9AD8\u903C\u683C\u80CC\u666F\uFF1F\\r\\n\\r\\n\u5C0F\u7F16\u521A\u5F00\u59CB\u770B\u5230\u7684\u65F6\u5019\u5C31\u89C9\u5F97\u5F88\u795E\u5947\uFF0C\u8FD8\u6709\u8FD9\u79CD\u795E\u5947\u7684\u7F51\u7AD9\uFF1F\\r\\n\\r\\n\u4E00\u8D77\u6765\u63A2\u7D22\u4E0B\u5427\uFF01\\r\\n\\r\\n\\r\\n\\r\\n**\u4E00.geektyper\uFF08\u6A21\u62DF\u9ED1\u5BA2\uFF09**\\r\\n\\r\\n\u8FD9\u662F\u4E00\u6B3E\u529F\u80FD\u5F3A\u5927\u7684\u9ED1\u5BA2\u6A21\u62DF\u8F6F\u4EF6\uFF0C\u5B83\u53EF\u4EE5\u6A21\u62DF\u7535\u5F71\u4E0A\u90A3\u79CD\u9ED1\u5BA2\u64CD\u4F5C\u7535\u8111\u7684\u8FC7\u7A0B\uFF0C\u5305\u62EC\u6572\u4EE3\u7801\u4EE5\u53CA\u51FA\u73B0\u5404\u79CD\u9AD8\u5927\u4E0A\u7684\u5F39\u7A97\uFF0C\u5E76\u4E14\u53EF\u4EE5\u81EA\u5B9A\u4E49\u4EE3\u7801\u989C\u8272\u3001\u80CC\u666F\u4EE5\u53CALogo\u56FE\u6848\\r\\n\\r\\n\u4E0D\u77E5\u9053\u4F60\u4EEC\u770B\u7535\u5F71\u7684\u65F6\u5019\uFF0C\u770B\u5230\u90A3\u79CD\u9ED1\u5BA2\u64CD\u4F5C\u7CFB\u7EDF\uFF0C\u6572\u51FB\u952E\u76D8\u65F6\u7535\u8111\u4E0A\u98DE\u901F\u65CB\u8F6C\u4E00\u4E9B\u6570\u636E\uFF0C\u611F\u89C9\u662F\u4E0D\u662F\u5E05\u7206\u4E86\uFF0C\u6709\u4E00\u79CD\u8BA9\u4F60\u4E5F\u60F3\u6210\u4E3A\u4E00\u540D\u9ED1\u5BA2\u7684\u611F\u89C9\uFF0C\\r\\n\\r\\n\u8FD9\u4E2A\u8F6F\u4EF6\u5C31\u53EF\u4EE5\u6EE1\u8DB3\u4F60\uFF0C\u5341\u8DB3\u7684\u201C\u64A9\u59B9\u795E\u5668\u201D\u597D\u5417\uFF01\\r\\n\\r\\n\\r\\n\\r\\n**1\u3001\u5148\u6253\u5F00\u5B89\u88C5\u597D\u7684geektyper**\\r\\n\\r\\n\u5728\u4E3B\u754C\u9762\u4E0A\u6211\u4EEC\u53EF\u4EE5\u770B\u5230\u5DE6\u4E0A\u65B9\u7684\u64CD\u4F5C\u63D0\u793A\u548C\u53F3\u4FA7\u7684\u529F\u80FD\u6309\u94AE\u3002\\r\\n\\r\\n\u521A\u5F00\u59CB\u4F7F\u7528\u5927\u5BB6\u53EF\u80FD\u6709\u70B9\u61F5\u5708\uFF0C\u6211\u4EEC\u53EF\u4EE5\u6309\u7167\u63D0\u793A\u70B9\u51FB\u201CF2\u201D\uFF0C\\r\\n\\r\\n\u5C31\u53EF\u4EE5\u5F39\u51FA\u5E2E\u52A9\u754C\u9762\uFF0C\u663E\u793A\u6BCF\u4E2A\u952E\u7684\u4F5C\u7528\uFF0C\u5C31\u53EF\u4EE5\u5F00\u59CB\u64CD\u4F5C\u5566\u3002\\r\\n\\r\\n\\r\\n\\r\\n**2\u3001\u53F3\u4E0B\u89D2\u6709\u4E00\u4E2A\u201C\u2630\u201D\u6309\u94AE\uFF0C\u70B9\u51FB\u5B83\u4F1A\u8FDB\u5165\u8BBE\u7F6E\u754C\u9762**\\r\\n\\r\\n\u4F60\u53EF\u4EE5\u5728\u91CC\u9762\u5BF9\u754C\u9762\u6587\u5B57\u7684\u8272\u5F69\u548C\u683C\u5F0F\u8FDB\u884C\u4FEE\u6539\u3002\\r\\n\\r\\n\\r\\n\\r\\n**3\u3001\u6700\u540E\u5C31\u662F\u5B83\u6700\u70AB\u9177\u7684\u529F\u80FD\u4E86**\\r\\n\\r\\n\u70B9\u51FB\u53F3\u4E0A\u89D2\u7684DL Data\u5C31\u4F1A\u51FA\u73B0\u7C7B\u4F3C\u4E8E\u7535\u5F71\u91CC\u90A3\u79CD\u6B63\u5728\u4E0B\u8F7D\u7684\u754C\u9762\uFF0C\\r\\n\\r\\n\u5176\u4ED6\u4E5F\u662F\u70B9\u51FB\u4E4B\u540E\u51FA\u73B0\u5404\u79CD\u6570\u636E\u5C55\u73B0\uFF0C\u800C\u4E14\u4F60\u8FD8\u53EF\u4EE5\u6572\u4EE3\u7801\uFF0C\\r\\n\\r\\n\u8FD9\u65F6\u5019\u4F60\u5C31\u50CF\u662F\u4E00\u4E2A\u9ED1\u5BA2\u5728\u64CD\u4F5C\u5404\u79CD\u7CFB\u7EDF\uFF0C\u8D85\u70AB\u9177\u597D\u5417\uFF01\\r\\n\\r\\n\\r\\n\\r\\n## **2.CYBERMAP**\\r\\n\\r\\n\u7F51\u5740\uFF1A\\r\\n\\r\\n[https://\\\\*\\\\*cybermap.kaspersky.com/\\\\*\\\\*CyberThreat](https://link.zhihu.com/?target=https%3A//cybermap.kaspersky.com/CyberThreat)\\r\\n\\r\\n\u8FD9\u4E2A\u7F51\u7AD9\u662F\u4E00\u4E2A\u53EF\u4EE5\u201C\u5B9E\u65F6\u5C55\u793A\u5168\u7403\u6076\u610F\u653B\u51FB\u201D\u7684\u7F51\u7AD9\uFF0C\\r\\n\\r\\n\u4F60\u53EF\u4EE5\u5F88\u76F4\u89C2\u7684\u770B\u5230\u5168\u7403\u9ED1\u5BA2\u7684\u5B9E\u65F6\u653B\u51FB\u6D3B\u52A8\u60C5\u51B5\uFF0C\\r\\n\\r\\n\u8FD9\u4E2A\u7F51\u7AD9\u771F\u7684\u505A\u7684\u5F88\u70AB\u9177\uFF0C\u8BA9\u4F60\u770B\u4E00\u773C\u5C31\u7231\u4E0A\u4ED6\\r\\n\\r\\n\u56E0\u4E3A\u662F\u56FD\u5916\u7684\u7F51\u7AD9\uFF0C\u6240\u4EE5\u5927\u5BB6\u53BB\u641C\u7D22\u7684\u65F6\u5019\u53EF\u4EE5\u4F7F\u7528Google\u6D4F\u89C8\u5668\uFF0C\u56FD\u5185\u7684\u6D4F\u89C8\u5668\u53EF\u80FD\u641C\u4E0D\u5230\uFF0C\u5C0F\u7F16\u7528\u7684\u662FGoogle\uFF0C\u4E0A\u4E2A\u52A8\u56FE\u5927\u5BB6\u611F\u53D7\u4E0B\u5B83\u7684\u70AB\u9177\u3002\\r\\n\\r\\n\\r\\n\\r\\n**1\u3001\u6570\u636E\u6765\u6E90**\\r\\n\\r\\n\u60F3\u8981\u4E86\u89E3\u4ED6\u8FD9\u4E9B\u6570\u636E\u6536\u96C6\u8FD9\u4E48\u6765\u7684\uFF0C\u53EF\u4EE5\u770B\u5230\u754C\u9762\u4E0A\u6709\u4E00\u4E2A\u6570\u636E\u6765\u6E90\uFF0C\u90FD\u6709\u5F88\u6E05\u695A\u7684\u6570\u636E\u5206\u6790\u3002\\r\\n\\r\\n\\r\\n\\r\\n**2\u3001\u9009\u62E9\u56FD\u5BB6**\\r\\n\\r\\n\u8FD9\u662F\u4E00\u4E2A\u201C\u5B9E\u65F6\u5C55\u793A\u5168\u7403\u6076\u610F\u653B\u51FB\u201D\u7684\u7F51\u7AD9\uFF0C\u6240\u4EE5\u4F60\u53EF\u4EE5\u9009\u62E9\u4F60\u60F3\u8981\u770B\u7684\u56FD\u5BB6\u76EE\u524D\u6240\u53D7\u7684\u653B\u51FB\u3002\\r\\n\\r\\n\\r\\n\\r\\n## **\u4E09.Stars-Emmision**\\r\\n\\r\\n\u7F51\u5740\uFF1A\\r\\n\\r\\n[https://**wangyasai.github.io/Sta**rs-Emmision/](https://link.zhihu.com/?target=https%3A//wangyasai.github.io/Stars-Emmision/)\\r\\n\\r\\n\u4E00\u6B3E\u6BD4\u540D\u5B57\u66F4\u52A0\u6D6E\u5938\u7684\u751F\u6210\u5668\uFF0C\u53EF\u4EE5\u4E00\u952E\u751F\u6210\u5C0F\u7C73\u6D77\u62A5\u8FD9\u79CD\u80CC\u666F\u6548\u679C\uFF0C\u5927\u5927\u8282\u7701\u8BBE\u8BA1\u65F6\u95F4\u554A\uFF0C\\r\\n\\r\\n\u5B83\u4E0E\u661F\u661F\u6709\u5173\uFF0C\u662F\u4E00\u6B3E\u653E\u5C04\u56FE\u7247\u751F\u6210\u7F51\u7AD9\uFF0C\u72B9\u5982\u65E0\u6570\u7684\u6D41\u661F\u96E8\u6B63\u5411\u4F60\u6251\u9762\u800C\u6765\uFF0C\u5728\u7EBF\u5236\u4F5C\u7C92\u5B50\u6563\u5C04\uFF0C\u6548\u679C\u6781\u4E3A\u9707\u64BC\u554A\uFF01\\r\\n\\r\\n\u4E00\u822C\u8FD9\u79CD\u6548\u679C\u662F\u5728AI\u91CC\u9762\u5236\u4F5C\u51FA\u6765\u7684\uFF0C\u5728\u8FD9\u91CC\u76F4\u63A5\u751F\u6210\uFF0C\u60CA\u4E0D\u60CA\u559C\uFF0C\u610F\u4E0D\u610F\u5916\uFF1F\\r\\n\\r\\n\\r\\n\\r\\n1\u3001\u8FDB\u5165\u7F51\u7AD9\u754C\u9762\u53F3\u4E0A\u89D2\u662F\u53EF\u4EE5\u8C03\u8282\u53C2\u6570\u7684\uFF0C\u867D\u7136\u90FD\u662F\u82F1\u6587\uFF0C\u4F46\u662F\u90FD\u662F\u6BD4\u8F83\u7B80\u5355\u7684\uFF0C\u5C0F\u7F16\u90FD\u80FD\u770B\u61C2\uFF0C\u4F60\u4EEC\u80AF\u5B9A\u90FDOK\u554A\\r\\n\\r\\n\\r\\n\\r\\n\u6709\u4E00\u4E2AColor1\u548CColor2\uFF0C\u8FD9\u4E24\u4E2A\u662F\u53EF\u4EE5\u66F4\u6362\u6210\u81EA\u5DF1\u559C\u6B22\u7684\u989C\u8272\u7684\u3002\\r\\n\\r\\n\\r\\n\\r\\n2\u3001\u5728\u201CDirection\u201D\u91CC\u9762\u662F\u53EF\u4EE5\u8C03\u8282\u7C92\u5B50\u7684\u8303\u56F4\u7684\uFF0C\u770B\u4F60\u6BD4\u8F83\u559C\u6B22\u90A3\u79CD\u53EF\u4EE5\u81EA\u7531\u66F4\u6362\u3002\\r\\n\\r\\n\\r\\n\\r\\n\u6700\u540E\u8C03\u6574\u5B8C\u6210\uFF0C\u53EF\u4EE5\u4E0B\u8F7D\u4FDD\u5B58\u4E0B\u6765\uFF0C\u6BD4\u5982\u53EF\u4EE5\u653E\u8FDBPPT\u91CC\u4E5F\u662F\u4E00\u4E2A\u4E0D\u9519\u7684\u9009\u62E9\uFF0C\u53C8\u6216\u8005\u53EF\u4EE5\u7528GIF\u5F55\u5236\u5DE5\u5177\uFF0C\u628A\u5B83\u5F55\u5236\u6210\u4E00\u4E2A\u52A8\u6001\u80CC\u666F\uFF0C\u4E5F\u662F\u7F8E\u8F6E\u7F8E\u5942\u554A\u3002\\r\\n\\r\\n\u4ECA\u5929\u8DDF\u5927\u5BB6\u5206\u4EAB\u7684\u8DDF\u4EE5\u5F80\u4E0D\u4E00\u6837\uFF0C\u53EF\u80FD\u6211\u4EEC\u4E0D\u9700\u8981\u7ECF\u5E38\u7528\u5230\uFF0C\u4F46\u662F\u88C5\u88C5\u903C\u4E5F\u662F\u5F88\u597D\u7684\u554A\uFF0C\u903C\u683C\u6EE1\u6EE1\u597D\u5417\uFF0C\u5C0F\u7F16\u521A\u5F00\u59CB\u770B\u5230\u662F\u65F6\u5019\u5C31\u89C9\u5F97\u5F88\u795E\u5947\u554A\uFF0C\u77AC\u95F4\u5FC3\u52A8\uFF0C\u5C31\u5206\u4EAB\u7ED9\u4F60\u4EEC\u5566 \\r\\n\\r\\n[\u5728\u7EBF\u9ED1\u5BA2\u6A21\u62DF\u653B\u51FB\u6F14\u793A (tonghei.com)](https://hackcode.tonghei.com/hacker/)\\r\\n\\r\\n \\r\\n\\r\\nfor i in range(True): m=str(input(\\"\u59D3\u540D\uFF1A\\")) n=int(input(\\"\u4F60\u7684\u5E74\u4EFD\uFF1A\\")) y=int(input(\\"\u4F60\u7684\u6708\u4EFD\uFF1A\\")) r=int(input(\\"\u4F60\u7684\u65E5\u671F\uFF1A\\")) x=str(input(\\"\u4F60\u7684\u661F\u5EA7\uFF1A\\")) print(n,\\"\u5E74\\",end=\\" \\") print(y,\\"\u6708\\",end=\\" \\") print(r,\\"\u65E5\\") print(x) d=str(input(\\"\u4F60\u7684\u7231\u597D\uFF1A\\")) if d==\\"\u7BEE\u7403\\" or d==\\"\u8DB3\u7403\\" or d==\\"\u7FBD\u6BDB\u7403\\": print(\\"\u9633\u5149\u5F00\u6717\u5927\u7537\u5B69\\") elif d==\\"\u7F16\u7A0B\\": print(\\"\u9ED1\u5BA2\\") elif d==\\"\u67AA\\": print(\\"\u72D9\u51FB\u4E4B\u738B\\") else: print(\\"\u5176\u4ED6\\") w=int(input(\\"\u4F60\u5E73\u65F6\u7684\u81EA\u6211\u6253\u5206\uFF1A\\")) if w<60: print(\\"\u5DEE\\") elif w>=60 and w<70: print(\\"\u8FD8\u53EF\u4EE5\\") elif w>=70 and w<80: print(\\"\u826F\\") if w>=80 and w<=100: print(\\"\u4F18\u79C0\\") aw=str(input(\\"\u4F60\u7684\u5B66\u6821\uFF1A\\")) aq=int(input(\\"\u671F\u4E2D\u6210\u7EE9\uFF1A\\")) am=int(input(\\"\u671F\u672B\u6210\u7EE9\uFF1A\\")) if am == 0 and aq == 0: print(\\"\u4F60\u5728\\",aw,\\"\u65E0\\",\\"\u65E0\\") if am!=0 and aq==0: print(\\"\u4F60\u5728\\",aw,am,\\"\u65E0\\") if am==0 and aq!=0: print(\\"\u4F60\u5728\\",aw,\\"\u65E0\\",aq) print(\\"\u4F60\u6240\u6709\u7684\u4E1C\u897F\u5DF2\u7ECF\u5168\u90E8\u6D4B\u8BD5\u5B8C\uFF01\\") print(\\"\uFF01\uFF01\uFF01\u52A0\u6CB9\uFF01\uFF01\uFF01\\")\\r\\n\\r\\n\u6D1B\u8C37\\r\\n\\r\\n/\\\\*\u8BC4\u6D4B\u72B6\u6001 Waiting \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u6B63\u5728\u7B49\u5F85\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6 Fetched \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u5DF2\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\uFF0C\u6B63\u5728\u51C6\u5907\u5F00\u59CB\u8BC4\u6D4B Compiling \u8BC4\u6D4B\uFF1A\u6B63\u5728\u7F16\u8BD1\u4E2D Judging \u8BC4\u6D4B\uFF1A\u7F16\u8BD1\u6210\u529F\uFF0C\u6B63\u5728\u8BC4\u6D4B\u4E2D Accepted \u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u5B8C\u5168\u6B63\u786E Wrong Answer \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u4E0E\u6807\u51C6\u7B54\u6848\u4E0D\u4E00\u81F4\uFF08\u4E0D\u5305\u62EC\u884C\u672B\u7A7A\u683C\u4EE5\u53CA\u6587\u4EF6\u672B\u7A7A\u884C\uFF09 Time Limit Exceeded \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236 Memory Limit Exceeded \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u5185\u5B58\u7A7A\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236 Runtime Error \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u9519\u8BEF\uFF08\u5982\u6570\u7EC4\u8D8A\u754C\u3001\u88AB\u96F6\u9664\u3001\u8FD0\u7B97\u6EA2\u51FA\u3001\u6808\u6EA2\u51FA\u3001\u65E0\u6548\u6307\u9488\u7B49\uFF09 Compile Error \u4E0D\u901A\u8FC7\uFF1A\u7F16\u8BD1\u5931\u8D25 System Error \u9519\u8BEF\uFF1A\u7CFB\u7EDF\u9519\u8BEF\uFF08\u5982\u679C\u60A8\u9047\u5230\u6B64\u95EE\u9898\uFF0C\u8BF7\u53CA\u65F6\u5728\u8BA8\u8BBA\u533A\u8FDB\u884C\u53CD\u9988\uFF09 Canceled \u5176\u4ED6\uFF1A\u8BC4\u6D4B\u88AB\u53D6\u6D88 Unknown Error \u5176\u4ED6\uFF1A\u672A\u77E5\u9519\u8BEF Ignored \u5176\u4ED6\uFF1A\u88AB\u5FFD\u7565 \u6709\u201C\u6210\u7EE9\u53D6\u6D88\u201D\u5B57\u6837\u5219\u8BF4\u660E\u7BA1\u7406\u5458\u624B\u52A8\u6807\u8BB0\u6B64\u8BB0\u5F55\u4E3A\u53D6\u6D88\uFF0C\u53EF\u80FD\u8FDD\u53CD\u4E86\u670D\u52A1\u6761\u6B3E\uFF0C\u6BD4\u5982\u4EE3\u7801\u88AB\u53D1\u73B0\u4E0E\u5176\u4ED6\u7528\u6237\u7684\u4EE3\u7801\u5341\u5206\u76F8\u4F3C\u3002\\r\\n\\r\\nsqrt(n); i\\\\*i<=n;\\r\\n\\r\\n\u7F16\u8BD1\u9519\u8BEF \u53EF\u80FD\u6709\u4EE5\u4E0B\u60C5\u51B5\uFF1A\\r\\n\\r\\n1. \u9012\u4EA4\u65F6\u9009\u9519\u4E86\u7F16\u7A0B\u8BED\u8A00\\r\\n2. Java \u7684\u4E3B\u7C7B\u540D\u6CA1\u6709\u4F7F\u7528 \\"Main\\"\\r\\n3. \u5BF9\u4E8E C/C++\uFF1A\u89C1\u4E0B\\r\\n4. \u4E00\u822C\u6027\u7684\u7F16\u8BD1\u9519\u8BEF \u5BF9 C/C++ \u9009\u624B\u7684\u7279\u522B\u63D0\u9192\uFF1A\\r\\n5. \\\\_\\\\_int64 \u5728 GNU C++ \u4E2D\u5E94\u5199\u6210 long long \u7C7B\u578B\\r\\n6. main() \u8FD4\u56DE\u503C\u5FC5\u987B\u5B9A\u4E49\u4E3A int \uFF0C\u800C\u4E0D\u662F void\\r\\n7. for \u8BED\u53E5\u4E2D\u7684\u6307\u6807\u53D8\u91CF i \u5C06\u4F1A\u5728\u5982\\"for (int i = 0...) {...}\\"\u8BED\u53E5\u4E4B\u540E\u53D8\u4E3A\u65E0\u6548\\r\\n8. itoa \u4E0D\u662F\u4E00\u4E2A\u901A\u7528 ANSI \u51FD\u6570\uFF08\u6807\u51C6 C/C++ \u4E2D\u65E0\u6B64\u51FD\u6570\uFF09\\r\\n9. printf \u4E2D\u4F7F\u7528 %lf \u683C\u5F0F\u662F\u4E0D\u6B63\u786E\u7684\\r\\n\\r\\n\u4E16\u754C\u4E0A\u6700\u9065\u8FDC\u7684\u8DDD\u79BB\u4E0D\u662F\u751F\u4E0E\u6B7B\uFF0C\u800C\u662F\u4F60\u4EB2\u624B\u5236\u9020\u7684BUG\u5C31\u5728\u4F60\u773C\u524D\uFF0C\u4F60\u5374\u600E\u4E48\u90FD\u627E\u4E0D\u5230\u5979\u3002 AC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nPC=Perfect Compile=\u5B8C\u7F8E\u7684\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nOLE=Output Limit Enough=\u8F93\u51FA\u5408\u6CD5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\u6309\u7167\u8D5B\u5236\u4E0D\u540C\uFF0C\u6709\u4E0D\u540C\u7684\u9012\u4EA4\u3001\u6392\u540D\u89C4\u5219\u3002\\r\\n\\r\\nOI \u8D5B\u5236\u6240\u6709\u9898\u76EE\u5747\u4EE5\u6700\u540E\u4E00\u6B21\u9012\u4EA4\u4E3A\u51C6\uFF0C\u7279\u522B\u5730\uFF0C\u8BF7\u907F\u514D\u7F16\u8BD1\u9519\u8BEF\u3002\\r\\n\\r\\nOI \u8D5B\u5236\u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u603B\u5206\u9AD8\u7684\u6392\u5728\u524D\u9762\uFF0C\u603B\u5206\u76F8\u7B49\u5219\u6392\u540D\u76F8\u540C\u3002\\r\\n\\r\\nACM/ICPC \u8D5B\u5236\u6240\u6709\u9898\u76EE\u9012\u4EA4\u540E\u7ACB\u5373\u8BC4\u6D4B\uFF0C\u4EE5\u662F\u5426\u901A\u8FC7\u4E3A\u51C6\u3002\\r\\n\\r\\nACM/ICPC \u8D5B\u5236\u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u901A\u8FC7\u9898\u76EE\u6570\u591A\u7684\u6392\u5728\u524D\u9762\uFF0C\u901A\u8FC7\u9898\u76EE\u6570\u76F8\u540C\u7684\u505A\u9898\u8017\u65F6\uFF08\u542B\u7F5A\u65F6\uFF09\u5C11\u7684\u6392\u5728\u524D\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u9009\u624B\u53EF\u4EE5\u591A\u6B21\u63D0\u4EA4\u4E00\u9053\u9898\u76EE\uFF0C\u5E76\u83B7\u5F97\u5B9E\u65F6\u8BC4\u6D4B\u7ED3\u679C\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u591A\u6B21\u63D0\u4EA4\u4F1A\u5BFC\u81F4\u9009\u624B\u7684\u5F97\u5206\u88AB\u6263\u9664\uFF0C\u6392\u884C\u699C\u5C06\u663E\u793A\u7528\u6237\u7684\u6700\u9AD8\u5F97\u5206\u3002\\r\\n\\r\\n\u4E50\u591A \u8D5B\u5236\u4E0B\uFF0C\u6BCF\u9053\u9898\u7684\u6700\u7EC8\u5F97\u5206\u4E3A:s\\\\*max(0.95^n,0.7).s,n\u5206\u522B\u4EE3\u8868\u672C\u6B21\u5F97\u5206\u548C\u672C\u6B21\u63D0\u4EA4\u524D\u7684\u5C1D\u8BD5\u6B21\u6570\u3002\\r\\n\\r\\n\u4E50\u591A \u6392\u540D\u89C4\u5219\u4E3A\uFF1A\u6309\u7167\u5982\u4E0A\u89C4\u5219\u6298\u7B97\u540E\u7684\u5206\u6570\u4ECE\u9AD8\u5230\u4F4E\u6392\u540D\u3002\\r\\n\\r\\nIOI(\u4E25\u683C) \u8D5B\u5236\u4E0B\uFF0C\u4E0D\u540C\u4E8EIOI\u8D5B\u5236\uFF0C\u6392\u884C\u699C\u5C06\u88AB\u5173\u95ED\u81F3\u6BD4\u8D5B\u7ED3\u675F\u3002\\r\\n\\r\\nIOI(\u4E25\u683C) \u8D5B\u5236\u4E0B\uFF0C\u6BCF\u9053\u9898\u7684\u6392\u884C\u699C\u5F97\u5206\u5C06\u4E3A\u7528\u6237\u6BCF\u4E2A\u5B50\u4EFB\u52A1\u5728\u6240\u6709\u63D0\u4EA4\u4E2D\u7684\u6700\u5927\u5F97\u5206\u7684\u548C\u3002\\r\\n\\r\\n\u65F6\u95F4\u4E0E\u7A7A\u95F4\u9650\u5236\u4EE5\u9898\u76EE\u8BF4\u660E\u4E3A\u51C6\uFF0C\u9ED8\u8BA4\u9650\u5236\u53C2\u89C1\u9650\u5236\u3002\\r\\n\\r\\n1. \u9012\u4EA4\u65F6\u9009\u9519\u4E86\u7F16\u7A0B\u8BED\u8A00\\r\\n2. Java \u7684\u4E3B\u7C7B\u540D\u6CA1\u6709\u4F7F\u7528 \\"Main\\"\\r\\n3. \u5BF9\u4E8E C/C++\uFF1A\u89C1\u4E0B\\r\\n4. \u4E00\u822C\u6027\u7684\u7F16\u8BD1\u9519\u8BEF\\r\\n\\r\\n\u5BF9 C/C++ \u9009\u624B\u7684\u7279\u522B\u63D0\u9192\uFF1A\\r\\n\\r\\n1. \\\\_\\\\_int64 \u5728 GNU C++ \u4E2D\u5E94\u5199\u6210 long long \u7C7B\u578B\\r\\n2. main() \u8FD4\u56DE\u503C\u5FC5\u987B\u5B9A\u4E49\u4E3A int \uFF0C\u800C\u4E0D\u662F void\\r\\n3. for \u8BED\u53E5\u4E2D\u7684\u6307\u6807\u53D8\u91CF i \u5C06\u4F1A\u5728\u5982\\"for (int i = 0...) {...}\\"\u8BED\u53E5\u4E4B\u540E\u53D8\u4E3A\u65E0\u6548\\r\\n4. itoa \u4E0D\u662F\u4E00\u4E2A\u901A\u7528 ANSI \u51FD\u6570\uFF08\u6807\u51C6 C/C++ \u4E2D\u65E0\u6B64\u51FD\u6570\uFF09\\r\\n5. printf \u4E2D\u4F7F\u7528 %lf \u683C\u5F0F\u662F\u4E0D\u6B63\u786E\u7684\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF\uFF0C\u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3\\r\\n\\r\\n\u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\uFF0C\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0\\r\\n\\r\\n\u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E\uFF0C\u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\n\u7206\u96F6\u662F\u4E00\u79CD\u5BBF\u547D\uFF0CWA\u662F\u4E00\u79CD\u7EDD\u671B\\r\\n\\r\\nTLE\u662F\u4E00\u79CD\u75DB\u82E6\uFF0CRE\u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE\u662F\u4E00\u79CD\u65E0\u5948\uFF0CAC\u662F\u4E00\u79CD\u539F\u8C05\\r\\n\\r\\nAK\u662F\u4E00\u79CD\u5E7B\u60F3\uFF0C\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F\\r\\n\\r\\n\u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136\uFF0C\u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\n#\u6A21\u62DF\u53EA\u4F1A\u731C\u9898\u610F\uFF0C\u8D2A\u5FC3\u53EA\u80FD\u8FC7\u6837\u4F8B\\r\\n\\r\\n\u6570\u5B66\u4E0A\u6765\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u4E00\u822C\u770B\u89C4\u5F8B\\r\\n\\r\\n\u7EC4\u5408\u6570\u5B66\u9760\u8FD0\u6C14\uFF0C\u8BA1\u7B97\u51E0\u4F55\u778E\u66B4\u529B\\r\\n\\r\\n#\u56FE\u8BBA\u5F3A\u884C\u5957\u6A21\u677F\uFF0C\u6570\u8BBA\u53EA\u4F1A\uFF27\uFF23\uFF24\\r\\n\\r\\n#\u9012\u5F52\u9012\u63A8\u4F24\u4E0D\u8D77\uFF0C\u641C\u7D22\u832B\u7136\uFF34\uFF2C\uFF25\\r\\n\\r\\n\u5206\u6CBB\u505A\u5F97\u50CF\u679A\u4E3E\uFF0C\u66B4\u529B\u679A\u4E3E\u6570\u7B2C\u4E00\\r\\n\\r\\n\u6570\u636E\u7ED3\u6784\u5E72\u77AA\u773C\uFF0C\u6012\u5237\u6C34\u9898\u627E\u4FE1\u5FC3\\r\\n\\r\\n\u6DA8\u59FF\u52BF\u4E5F\u4E0D\u5BB9\u6613\uFF0C\u8003\u8BD5\u4E00\u6765\u5168\u61F5\u903C\\r\\n\\r\\n\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n#\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\u3002\\r\\n\\r\\n\u6A21\u62DF\u5B9A\u60F3\u5168\uFF0C\u52A8\u89C4\u5B9A\u627E\u5BF9\u3002\\r\\n\\r\\n\u8D2A\u5FC3\u5B9A\u8BC1\u660E\uFF0C\u4E8C\u5206LM+1\u3002\\r\\n\\r\\n\u5B9C\u8003NOIP , \u5C0F\u5FC3\u522B\u7206\u96F6.] \u9A97\u5206\u8FC7\u6837\u4F8B\uFF0C\u66B4\u529B\u51FA\u5947\u8FF9\u3002\\r\\n\\r\\n\u5C71\u91CD\u6C34\u590D\u7591\u65E0\u8DEF\uFF0Cmake\u540E\u9762\u4E0D\u52A0to\u3002\\r\\n\\r\\n\u79E6\u65F6\u660E\u6708\u6C49\u65F6\u5173\uFF0C\u9AD8\u4EF7\u6C27\u5316\u4F4E\u4EF7\u8FD8\u3002\\r\\n\\r\\n\u541B\u95EE\u5F52\u671F\u672A\u6709\u671F\uFF0C\u70B9\u88C2\u52A0\u500D\u5300\u4E24\u6781\u3002\\r\\n\\r\\n\u9152\u9163\u80F8\u80C6\u5C1A\u5F00\u5F20\uFF0CGM=gR\u65B9\u3002\\r\\n\\r\\n\u78A7\u4E91\u5929\uFF0C\u9EC4\u53F6\u5730\uFF0C\u9AD8\u6E29\u9AD8\u538B\u50AC\u5316\u5242\u3002\\r\\n\\r\\n\u6A2A\u770B\u6210\u5CAD\u4FA7\u6210\u5CF0\uFF0C\u6D1B\u4F26\u5179\u529B\u4E0D\u505A\u529F\u3002\\r\\n\\r\\n\u8349\u6811\u77E5\u6625\u4E0D\u4E45\u5F52\uFF0Cb\u65B9\u51CF\u53BB4ac\u3002\\r\\n\\r\\n\u701A\u6D77\u9611\u5E72\u767E\u4E08\u51B0\uFF0C\u9178\u8131\u7F9F\u57FA\u9187\u8131\u6C22\\r\\n\\r\\n\u897F\u6C5F\u6708\xB7\u591C\u884COI\u9053\u4E2D \u660E\u6708AC\u60CA\u9E4A\uFF0C\\r\\n\\r\\nRE\u534A\u591C\u9E23\u8749\u3002\\r\\n\\r\\n\u7A3B\u82B1\u9999\u91CC\u8BF4\u4E30\u5E74\uFF0C\\r\\n\\r\\n\u542C\u53D6WA\u58F0\u4E00\u7247\u3002\\r\\n\\r\\n\u4E03\u516B\u4E2ATLE\uFF0C\\r\\n\\r\\n\u4E24\u4E09\u70B9MLE\u3002\\r\\n\\r\\n\u65E7\u65F6\u8305\u5E97\u793E\u6797\u8FB9\uFF0C\\r\\n\\r\\n\u8DEF\u8F6CCE\u5FFD\u89C1\u3002\\r\\n\\r\\n\u751F\u547D\u7684\u610F\u4E49?\\r\\n\\r\\n\u5982\u679C26\u4E2A\u82F1\u6587\u5B57\u6BCD\\r\\n\\r\\nA,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\\r\\n\\r\\n\u5206\u522B\u7B49\u4E8E\\r\\n\\r\\n1,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\\r\\n\\r\\n\u90A3\u4E48\uFF1A\\r\\n\\r\\n\u83B7\u5F97\u77E5\u8BC6,Knowledge\\r\\n\\r\\n=K+N+O+W+L+E+D+G+E\\r\\n\\r\\n=11+14+15+23+12+5+4+7+5\\r\\n\\r\\n=96%\\r\\n\\r\\n\u52AA\u529B\u5DE5\u4F5C\uFF0CWorkhard\\r\\n\\r\\n=W+O+R+K+H+A+R+D\\r\\n\\r\\n=23+15+18+11+8+1+18+4\\r\\n\\r\\n=98%\\r\\n\\r\\n\u4E5F\u5C31\u662F\u8BF4\u77E5\u8BC6\u548C\u52AA\u529B\u5DE5\u4F5C\uFF0C\u5BF9\u6211\u4EEC\u4EBA\u751F\u7684\u5F71\u54CD\uFF0C\u53EF\u4EE5\u8FBE\u523096%\u548C98%\u3002\\r\\n\\r\\n\u597D\u8FD0,Luck\\r\\n\\r\\n=L+U+C+K=\\r\\n\\r\\n12+21+3+11=\\r\\n\\r\\n47%\\r\\n\\r\\n\u7231\u60C5,Love\\r\\n\\r\\n=L+O+V+E\\r\\n\\r\\n=12+15+22+5\\r\\n\\r\\n=54%\\r\\n\\r\\n\u770B\u6765\uFF0C\u8FD9\u4E9B\u6211\u4EEC\u901A\u5E38\u8BA4\u4E3A\u91CD\u8981\u7684\u4E1C\u897F \u5374\u5E76\u6CA1\u8D77\u5230\u6700\u91CD\u8981\u7684\u4F5C\u7528\u3002\\r\\n\\r\\n\u90A3\u4E48\uFF0C \u4EC0\u4E48\u53EF\u4EE5\u51B3\u5B9A\u6211\u4EEC100\uFF05\u7684\u4EBA\u751F\u5462\uFF1F\\r\\n\\r\\n\u662FMoney\uFF08\u91D1\u94B1\uFF09\u5417\uFF1F\\r\\n\\r\\n=M+O+N+E+Y\\r\\n\\r\\n=13+15+14+5+25\\r\\n\\r\\n=72% \u770B\u6765\u4E5F\u4E0D\u662F\u3002\\r\\n\\r\\n\u662FLeadership (\u9886\u5BFC\u80FD\u529B)\u5417\uFF1F\\r\\n\\r\\n=L+E+A+D+E+R+S+H+I+P\\r\\n\\r\\n=12+5+1+4+5+18+19+9+16\\r\\n\\r\\n=89%\\r\\n\\r\\n\u8FD8\u4E0D\u662F\u3002\\r\\n\\r\\n\u91D1\u94B1\uFF0C\u6743\u529B\u4E5F\u4E0D\u80FD\u5B8C\u5168\u51B3\u5B9A\u6211\u4EEC\u7684\u751F\u6D3B\u3002 \u90A3\u662F\u4EC0\u4E48\u5462\uFF1F\u5176\u5B9E\uFF0C \u771F\u6B63\u80FD\u4F7F\u6211\u4EEC\u751F\u6D3B\u5706\u6EE1\u7684\u4E1C\u897F\u5C31\u5728\u6211\u4EEC\u7684 \u4EE3\u7801\u91CC\u9762\uFF01\\r\\n\\r\\n\u8F93\u5165\u8F93\u51FA\u6D41\u5934\u6587\u4EF6,iostream\\r\\n\\r\\n=I+O+S+T+R+E+A+M\\r\\n\\r\\n=9+15+19+20+18+5+1+13\\r\\n\\r\\n=100%\\r\\n\\r\\n\u6240\u4EE5\u575A\u6301\u5199\u4EE3\u7801\u5427\u2026\\r\\n\\r\\n\u5404\u79CD\u8001\u5E08\u4E00\u56DE\u5934 \u8BED\u6587\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u6B64\u5730\u7A7A\u4F59\u9EC4\u9E64\u697C\u3002 \u6570\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6B21\u51FD\u6570\u5BF9\u79F0\u8F74\u3002 \u82F1\u8BED\u8001\u5E08\u4E00\u56DE\u5934\uFF0Csorry\u52A0\u4E0A\u4E09\u514B\u6CB9\u3002 \u5316\u5B66\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E8C\u6C27\u5316\u78B3\u53D8\u6C7D\u6CB9\u3002 \u7269\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E00\u8DDF\u6760\u6746\u64AC\u5730\u7403\u3002 \u751F\u7269\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8BD5\u7BA1\u5A74\u513F\u6C34\u4E2D\u6E38\u3002 \u5730\u7406\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5927\u9646\u7248\u5757\u4E71\u6F02\u6D41\u3002 \u52B3\u6280\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u7834\u94DC\u70C2\u94C1\u6765\u8D70\u79C0\u3002 \u653F\u6CBB\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5E03\u4EC0\u6539\u884C\u5356\u8C46\u6CB9\u3002 \u7F8E\u672F\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u8499\u5A1C\u4E3D\u838E\u4E5F\u98CE\u6D41\u3002 \u4F53\u80B2\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5965\u8FD0\u53D6\u6D88\u6253\u7BEE\u7403\u3002 \u7535\u8111\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u5B66\u751F\u5168\u6210\u963F\uFF31\u53CB\u3002 \u5168\u4F53\u8001\u5E08\u4E00\u56DE\u5934\uFF0C\u4E16\u754C\u4EBA\u6C11\u6CA1\u81EA\u7531\u3002\\r\\n\\r\\n\u6240\u6709\u5934\u6587\u4EF6: 1.\u9996\u5148\u662F\u6700\u65B9\u4FBF\u7684\u4E07\u80FD\u5934\u6587\u4EF6\uFF0C\u987E\u540D\u601D\u4E49\uFF0C\u53EF\u4EE5\u5C06\u5176\u7406\u89E3\u4E3A\u7236\u4EB2\u5934\u6587\u4EF6 \uFF08\u867D\u7136\u65B9\u4FBF\u4E86\u61D2\u4EBA\uFF0C\u4F46\u662F\u7F3A\u70B9\u4E5F\u5F88\u660E\u663E--\u8FD9\u4E00\u5934\u6587\u4EF6\u5F88\u5360\u7528\u5185\u5B58\uFF09\uFF1A #include<bits/stdc++.h> 2.\u63A5\u7740\u4E5F\u662F\u6BD4\u8F83\u5E38\u7528\u7684\uFF0C\u4F5C\u7528\u4E8E\u6570\u636E\u6D41\u8F93\u5165\u8F93\u51FA cin>>\u548Ccout<<\uFF1A #include 3.\u7136\u540E\u662F\u5404\u79CD\u7B97\u6CD5\u7684\u5934\u6587\u4EF6(\u4F8B\u5982sort\u51FD\u6570\u7B49)\uFF1A #include 4.\u5173\u4E8E\u6570\u5B66\u51FD\u6570\u7684\u5934\u6587\u4EF6\uFF08\u4F8B\u5982max( )\uFF0Cmin( )\uFF0Cabs( )\u7B49\uFF09\uFF08\u4ECEC\u8BED\u8A00\u4E2D\u7684math.h\u7EE7\u627F\u800C\u6765\uFF09\uFF1A #include 5.string\u5B57\u7B26\u4E32\u5934\u6587\u4EF6\uFF1A #include 6.\u63A5\u7740\u662FC\u8BED\u8A00\u7684\u5934\u6587\u4EF6\uFF1A #include 7.\u666E\u901A\u961F\u5217(\u53EA\u80FD\u4E00\u8FB9\u8FDB\u4E00\u8FB9\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 8.\u53CC\u5411\u961F\u5217(\u4E24\u8FB9\u90FD\u53EF\u4EE5\u8FDB\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 9.\u6808(\u5148\u8FDB\u540E\u51FA\uFF0C\u540E\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include 10.\u5217\u8868\u7684\u5934\u6587\u4EF6\uFF1A #include 11.\u52A8\u6001\u6570\u7EC4(\u4E0D\u9700\u77E5\u9053\u8BE5\u6570\u7EC4\u7684\u6570\u91CF)\u7684\u5934\u6587\u4EF6: #include 12.\u56FE\u7684\u5934\u6587\u4EF6\uFF1A #include 13.\u96C6\u5408(\u5185\u90E8\u81EA\u52A8\u6709\u5E8F\u4E14\u4E0D\u542B\u91CD\u590D\u5143\u7D20)\u7684\u5934\u6587\u4EF6\uFF1A #include 14.\u63A7\u5236\u7535\u8111\u6216\u5C0F\u9ED1\u6846\u5934\u6587\u4EF6(\u4E0D\u5305\u542B\u5728\u4E07\u80FD\u5934\u4EF6)\uFF1A #include<windows.h>\\r\\n\\r\\n\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B \u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B \u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B \u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002 \u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B \u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B \u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B \u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\\r\\n\\r\\n\u73ED\u957F\u8BF4:\u8D70\uFF0C\u6211\u4EEC\u53BB\u70B8\u4E86\u5B66\u6821\u3002 \u526F\u73ED\u957F\u8BF4:\u8FD9\u4E2A\u4E3B\u610F\u4E0D\u9519 \u5316\u5B66\u8BFE\u4EE3\u8868\u8D1F\u8D23\u63D0\u53D6\u6C22\u6C14 \u7269\u7406\u8BFE\u4EE3\u8868\u8D1F\u8D23\u62FC\u88C5\u6C22\u5F39 \u6570\u5B66\u8BFE\u4EE3\u8868\u8D1F\u8D23\u8BA1\u7B97\u7206\u7834\u9762\u79EF \u5730\u7406\u8BFE\u4EE3\u8868\u8D1F\u8D23\u7B56\u5212\u7206\u7834\u5730\u70B9 \u5386\u53F2\u8BFE\u4EE3\u8868\u8D1F\u8D23\u8BB0\u5F55\u5149\u8F89\u573A\u9762 \u751F\u7269\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4E8B\u540E\u751F\u6001\u73AF\u5883 \u653F\u6CBB\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4F7F\u7528\u6CD5\u5F8B\u6253\u5B98\u53F8 \u8BED\u6587\u8BFE\u4EE3\u8868\u8D1F\u8D23\u4E71\u5199\u6587\u7AE0\u63A8\u5378\u8D23\u4EFB \u82F1\u8BED\u8BFE\u4EE3\u8868\u8D1F\u8D23\u5230\u5916\u56FD\u8D2D\u4E70\u8FDB\u53E3\u6750\u6599 \u4F53\u80B2\u8BFE\u4EE3\u8868\u8D1F\u8D23\u5C60\u6740XXX\\r\\n\\r\\n\u9F13\u8D77\u52C7\u6C14\u6572\u8D77\u8FD9\u952E\u76D8 \u53EA\u56E0\u4E3A\u6709\u4F60\u5728 \u65E0\u5411\u56FE\uFF0C\u662F\u5426\u660E\u767D \u5BB3\u7F9E\u7684\u6211\uFF0C\u8BF4\u4E0D\u51FA\u7684\u7231 \u6211\u4E5F\u66FE\u56DB\u5904\u6F02\u6CCA\u6D41\u6D6A \u4E3A\u6C42\u5355\u5143\u77ED\u8DEF \u76F4\u5230\u6211\u84E6\u7136\u56DE\u9996\u65F6 \u77A5\u89C1\u4F60\u590D\u6742\u6A21\u6837\\r\\n\\r\\n\u63D0\u4EA4\u4E00\u6B21\u4E00\u6B21\u4E00\u904D\u4E00\u904D \u5DE1\u67E5\u4E8EOJ \u53EA\u4E3A\u4E86AC\u51FA\u73B0 \u5982\u4F55\u5361\u8FDB\u8D85\u9650\u65F6\u95F4 \u589E\u5E7F\u8DEF\u6B62\u4E0D\u4F4F\u6C42\u6700\u5927\u6D41 \u6DF1\u5E7F\u628A\u56FE\u641C \u624B\u6572\u7740\u5C0F\u5C0F\u7684\u952E\u76D8 \u6CA1\u4EBA\u966A\u5728\u6211\u5DE6\u53F3\\r\\n\\r\\n\u5957\u7528\u5FC3\u7231\u7684\u7EBF\u6BB5\u6811 \u4EFF\u4F5BAC\u4E86\u5168OJ \u60F3\u8981\u8BC4\u6D4B\u673A\u4E86\u89E3 \u8FD9AK\u7684\u611F\u89C9\\r\\n\\r\\n\u4E00\u4E2A\u4EBA\u7684\u4F18\u5316\u90A3\u7F51\u7EDC\u6D41 \u660E\u660E\u60F3AC\u5374\u8D85\u65F6\u8D85\u7A7A \u867D\u7136\u6211\u7684\u5E38\u6570\u53EF\u80FD\u4E0D\u592A\u591F \u6709\u8C01\u80FD\u61C2\u6211\u6E29\u67D4 \u505A\u4E00\u68F5\u5E73\u8861\u6811\u968F\u6570\u65CB\u8F6C \u53C8\u56DE\u6EAF\u6700\u521D\u7684\u6839\u8282\u70B9 \u540E\u6765\u6211\u624D\u5361\u8FDB\u8FD9\u5C31\u662F\u4F60\u60F3\u8981\u7684\u65F6\u9650 \u90A3\u4E48\u9ED8\u9ED8\u7206\u96F6\u662F\u6211\u7ED9\u4F60\u6700\u540E\u7684\u6E29\u67D4\\r\\n\\r\\n\u5199\u7740n\u65B9n\u4E09\u7684\u66B4\u529B \u5F62\u5355\u5F71\u53EA\u7684\u6211 \u4EFBBUG\u5C06\u6211\u5265\u843D \u4E00\u58F0\u53F9\u606F\u53EA\u80FD\u6253\u8868 \u6211\u4E5F\u60F3\u6253\u5230\u90A3\u96C6\u8BAD\u961F \u7ED9\u81EA\u5DF1\u9A97\u70B9\u5206 \u4EFB\u5DE8\u4F6C\u5982\u6B64\u5F3A\u5927 \u53C8\u4F55\u5904\u80FD\u591F\u9A97\u5230\u5206\\r\\n\\r\\nOI\u603B\u6709\u8BB8\u591A\u632B\u6298 \u8BF7\u575A\u5B9A\u81EA\u5DF1\u7684\u9009\u62E9 \u5373\u4F7F\u5728\u96BE\u8FC7\u65F6\u523B \u4E5F\u8981\u628A\u4EE3\u7801\u5199\\r\\n\\r\\n\u4E00\u4E2A\u4EBA\u7684\u4F18\u5316\u90A3\u7F51\u7EDC\u6D41 \u660E\u660E\u60F3AC\u5374\u8D85\u65F6\u8D85\u7A7A \u867D\u7136\u6211\u7684\u5B9E\u529B\u53EF\u80FD\u4E0D\u592A\u591F \u6709\u8C01\u80FD\u61C2\u6211\u6E29\u67D4 \u505A\u4E00\u68F5\u5E73\u8861\u6811\u968F\u6570\u65CB\u8F6C \u53C8\u56DE\u6EAF\u6700\u521D\u7684\u6839\u8282\u70B9 \u540E\u6765\u6211\u624D\u5361\u8FDB\u8FD9\u5C31\u662F\u4F60\u60F3\u8981\u7684\u65F6\u9650 \u90A3\u4E48\u9ED8\u9ED8\u7206\u96F6\u662F\u6211\u7ED9\u4F60\u6700\u540E\u7684\u6E29\u67D4\\r\\n\\r\\n\u4E3A\u4F60\u5199\u8D77\u8FD9\u4EE3\u7801 \u8FD9\u662F\u9B3C\u755C\u7684\u98CE\u683C \u5C31\u7B97\u8D85\u65F6\u53C8\u5982\u4F55 \u53EA\u60F3\u5E26\u7ED9\u4F60AC \u4E3A\u4F60\u6211\u52AA\u529B\u5237\u9898\u5199dp \u611F\u8C22\u4F60\u4EEC\u7684\u5173\u6CE8 \u5C31\u7B97\u660E\u5929for\u5FAA\u73AF\u91CD\u590D \u6709\u4E86\u966A\u4F34\u5C31\u4E0D\u5B64\u72EC\\r\\n\\r\\n---\\r\\n\\r\\n\u54AC\u4E0B\u4E00\u53E3\u6211\u7684\u5FEB\u901F\u5E42\u5427 \u5C1D\u5C3D\u8FD9\u6D4B\u8BC4\u7684A(C) WA T(LE) R(E) \u8EAB\u5728\u6587\u5316\u8BFE\u7684OIer\u4EEC\u554A \u4E0D\u8981\u5FD8\u8BB0\u4F60\u4EE3\u7801 \u4E5F\u8BB8\u5BF9\u8FD9\u4E16\u754C\u6709\u7740\u65E0\u5948 \u5DF2\u4E0D\u518D\u662F\u90A3\u4E00\u4E2A\u849F\u84BB \u5373\u4F7FNOIP\u7206\u96F6\u4E5F\u8981\u5B66\u4F1A\u53BB\u627F\u62C5\\r\\n\\r\\n\u6709\u4E86\u7B97\u6CD5\u966A\u4F34\u6211\u5DF2\u4E0D\u518D\u4F1A\u5B64\u5355 \u4F60\u4EEC\u7684\u9F13\u52B1\u5728\u6211\u7684\u5FC3\u4E2D\u6C38\u4E0D\u4F1A\u6D88\u6563\\r\\n\\r\\n# [\u5BB6\u957F\u76F4\u547C\u592A\u66B4\u529B\uFF01\u8FD9\u4E9B\u7B97\u6CD5\u53EF\u80FD\u4F1A\u88AB\u5220\u9664](https://www.cnblogs.com/wlzhouzhuan/p/15344765.html)\\r\\n\\r\\n\u8FD1\u65E5\uFF0C\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u591A\u4F4D\u7528\u6237\u5BB6\u957F\u5411\\r\\n\\r\\nhttps://www.luogu.com.cn/user/1\\r\\n\\r\\n\u513F\u7AE5\u7684\u56E0\u7D20\u51FA\u73B0\uFF0C\u8981\u6C42\u5BF9\u76F8\u5173\u7B97\u6CD5\u8FDB\u884C\u6574\u6539\u6216\u88AB\u5220\u9664\u3002\\r\\n\\r\\n\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u9898\u76EE\u7EC4\u7BA1\u7406\u5458\u5728\u63A5\u53D7\u91C7\u8BBF\u65F6\u8BF4\u9053\uFF0C\u5728\u6700\u8FD1\u51E0\u5929\u5185\uFF0C\u6D1B\u8C37\u6536\u5230\u4E86\u6570\u5341\u6761\u5BB6\u957F\u6765\u4FE1\uFF0C\u58F0\u79F0\u7F51\u7AD9\u6559\u6388\u7684\u90E8\u5206\u7B97\u6CD5\u5B58\u5728\u201C\u8840\u8165\u201D\u3001\u201C\u66B4\u529B\u201D\u7B49\u5185\u5BB9\u3002\u201C\u4ED6\u4EEC\u8BF4\u8FD9\u4E9B\u4E1C\u897F\u4F1A\u6559\u574F\u4ED6\u4EEC\u5BB6\u7684\u5B69\u5B50\uFF0C\u8981\u6C42\u6211\u4EEC\u6574\u6539\u8FD9\u4E9B\u7B97\u6CD5\uFF0C\u628A\u8FD9\u4E9B\u5BF9\u5C0F\u670B\u53CB\u4E0D\u592A\u597D\u7684\u4E1C\u897F\u5220\u6389\uFF0C\u6216\u8005\u76F4\u63A5\u628A\u7B97\u6CD5\u5220\u9664\u3002\u201D\\r\\n\\r\\n\u968F\u7740\u56FD\u5E86 (\u96FE) \u7684\u5230\u6765\uFF0C\u5F88\u591A\u5BB6\u957F\u76F4\u63A5\u6765\u5230\u6D1B\u8C37\u53CD\u6620\u60C5\u51B5\u3002\u8BB0\u8005\u5728\u73B0\u573A\u968F\u673A\u91C7\u8BBF\u4E86\u51E0\u4F4D\u5BB6\u957F\uFF0C\u8BE2\u95EE\u4ED6\u4EEC\u5BF9\u8FD9\u4E9B\u7B97\u6CD5\u7684\u770B\u6CD5\u3002\\r\\n\\r\\n\u5218\u5973\u58EB\u7684\u513F\u5B50\u6B63\u5728\u6D1B\u8C37\u5B66\u4E60\u666E\u53CA\u7EC4\u5185\u5BB9\u3002\u5728\u91C7\u8BBF\u4E2D\u5218\u5973\u58EB\u544A\u8BC9\u8BB0\u8005\uFF0C\u5E0C\u671B\u6D1B\u8C37\u505C\u5F00\u200B**\u5308\u7259\u5229\u7B97\u6CD5**\u200B\u3002\u201C\u6211\u770B\u91CC\u9762\u8BB2\u7684\u90FD\u662F\u4E9B\u4E00\u4E00\u5339\u914D\u554A\u3001\u4E8C\u5206\u56FE\u554A\u4E4B\u7C7B\u7684\u5339\u914D\u95EE\u9898\uFF0C\u200B**\u8FD9\u4E0D\u662F\u6559\u5B69\u5B50\u600E\u4E48\u627Enpy\u4E48\uFF1F\u90A3\u4ED6\u4EE5\u540E\u5C82\u4E0D\u662F\u5B66\u4F1A\u65E9\u604B\u4E86\uFF1F**\u200B\u201D\u738B\u5148\u751F\u4E5F\u6709\u7C7B\u4F3C\u7684\u60F3\u6CD5\u3002\u4ED6\u8981\u6C42\u6D1B\u8C37\u6574\u6539**\u6708\u8D5B**\u5185\u5BB9\u3002\u201C**\u200B\u542C\u8BF4\u8BFE\u7A0B\u91CC\u9762\u6709\u2018\u9009\u59B9\u5B50\u2019\uFF0C\u8981\u662F\u5C0F\u670B\u53CB\u88AB\u5973\u62F3\u6253\u4E86\u8BE5\u600E\u4E48\u529E\uFF1F\u200B**\u592A\u5371\u9669\u4E86\uFF01\u201D\\r\\n\\r\\n\u8BA4\u4E3A\u6570\u636E\u7ED3\u6784\u592A\u5371\u9669\u3001\u5BB9\u6613\u4F24\u5230\u5B69\u5B50\uFF0C\u662F\u5F88\u591A\u5BB6\u957F\u7684\u5171\u540C\u5FC3\u58F0\u3002\u738B\u5927\u7237\u4ECA\u5E74\u5DF2\u7ECF\u516D\u5341\u591A\u5C81\u4E86\uFF0C\u5374\u4F9D\u7136\u4E13\u7A0B\u8DD1\u5230\u5B66\u6821\uFF0C\u9AD8\u547C\u505C\u6B62\u6559\u6388**Splay\u6811**\u548C\u200B**Treap\u6811**\u200B\u3002\u4ED6\u8BF4\uFF0C**\u81EA\u5BB6\u7684\u5B59\u5B50\u5F88\u5C0F\u7684\u65F6\u5019\u649E\u5230\u6811\u4E0A\u8FC7\uFF0C\u4ED6\u62C5\u5FC3\u8FD9\u4E24\u68F5\u6811\u4F1A\u7ED9\u5B69\u5B50\u9020\u6210\u5FC3\u7406\u9634\u5F71\u3002**\\r\\n\\r\\n\u6B64\u5916\uFF0C\u200B**\u6700\u5927\u6D41**\u200B\u3001**\u8D39\u7528\u6D41**\u7B49\u7B97\u6CD5\u4E5F\u906D\u5230\u4E86\u90E8\u5206\u5BB6\u957F\u7684\u62B5\u5236\u3002\u201C\u4E3B\u8981\u8FD8\u662F\u73A9\u6C34\u5B89\u5168\u561B\u201D\uFF0C\u9648\u5973\u58EB\u8BF4\uFF0C\u201C\u5B69\u5B50\u4EEC\u770B\u5230\u8FD9\u4E9B\u6D41\u554A\u3001\u6D41\u91CF\u554A\u3001\u56DE\u5BB6\u5C31\u5F88\u53EF\u80FD\u4F1A\u4E0B\u6C34\u53BB\u6E38\u6CF3\uFF0C\u6211\u4EEC\u5F53\u5BB6\u957F\u7684\u8FD8\u662F\u4E0D\u653E\u5FC3\u561B\u3002\u201D\u800C\u5F20\u5148\u751F\u7684\u6001\u5EA6\u5219\u66F4\u4E3A\u575A\u51B3\uFF1A\u201C\u200B\\\\*\\\\*\u73B0\u5728\u5C31\u6562\u73A9\u6C34\uFF0C\u5C06\u6765\u6562\u73A9\u4EC0\u4E48\uFF0C\u6211\u90FD\u4E0D\u6562\u60F3\u4E86\uFF01\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u540C\u6837\u4F5C\u4E3A\u7B97\u6CD5\uFF0C**\u200B\u300A\u6DF1\u5165\u6D45\u51FA\u7A0B\u5E8F\u8BBE\u8BA1\u7ADE\u8D5B\u300B\u200B**\u53D7\u5230\u62B5\u5236\u7684\u7406\u7531\u5219\u6709\u5F88\u5927\u4E0D\u540C\u3002\u5434\u5148\u751F\u544A\u8BC9\u8BB0\u8005\uFF1A\u201C\u4E3B\u8981\u662F\uFF0C\u8FD9\u4E2A\uFF08\u6DF1\u5165\u6D45\u51FA\u7A0B\u5E8F\u8BBE\u8BA1\u7ADE\u8D5B\u7684\u6559\u6750\uFF09\u592A\u539A\u4E86\uFF0C\u5F97\u6709\u597D\u51E0\u65A4\u91CD\uFF0C**\u200B\u7F51\u4E0A\u5C0F\u5B69\u5B50\u5982\u679C\u5B09\u620F\u6253\u95F9\uFF0C\u62FF\u7740\u8FD9\u672C\u4E66\u5230\u5904\u4E71\u7529\uFF08\u7684\u8BDD\uFF09\uFF0C\u975E\u5E38\u5371\u9669\u3002\u200B**\u8981\u662F\u78B0\u5230\u5934\u7684\u8BDD\uFF0C\u90A3\u80AF\u5B9A\u4F1A\u628A\u5934\u78D5\u7834\u7684\uFF0C\u4F60\u8BF4\u8FD9\u4E2A\u8D23\u4EFB\u7531\u8C01\u6765\u627F\u62C5\uFF1F\u201D\\r\\n\\r\\n\u5728\u4F17\u591A\u7B97\u6CD5\u4E2D\uFF0C\u5BB6\u957F\u62B5\u5236\u547C\u58F0\u6700\u9AD8\u7684\u5219\u662F\u56FE\u8BBA\u7B97\u6CD5\u3002\u5728\u5BB6\u957F\u770B\u6765\uFF0C\u6709\u7684\u7B97\u6CD5\u8981\u627E\u73AF\uFF0C\u4F1A\u7ED5\u6655\u5230\u5B69\u5B50\uFF1B\u753B\u56FE\u7528\u7684\u7B14\u53EF\u80FD\u4F1A\u6233\u4F24\u624B\u6307\uFF1B\u5F88\u591A\u7B97\u6CD5\u5728\u641C\u7D22\u7684\u65F6\u5019\u53EF\u80FD\u4F1A\u628A\u7CFB\u7EDF\u6808\u7528\u7206\uFF1B\u6709\u4E9B\u7B97\u6CD5\u5199\u9519\u4E86\u8981\u8F93\u4E2D\u91CF\u53C2\u89E3\u6539\u5F88\u4E45\uFF0C\u53EF\u80FD\u4F1A\u7D2F\u5230\u5C0F\u670B\u53CB\uFF0C\u201C\u200B\\\\*\\\\*\u628A\u6211\u5BB6\u5C0F\u5B69\u7D2F\u6B7B\u4E86\u8BE5\u600E\u4E48\u529E\uFF1F\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u9664\u4E86\u62C5\u5FC3\u5B69\u5B50\u4EEC\u7684\u5B89\u5168\u5916\uFF0C\u5BF9\u5B69\u5B50\u751F\u6D3B\u4E60\u60EF\u7684\u5F71\u54CD\u4E5F\u6210\u4E3A\u4E86\u5BB6\u957F\u4EEC\u62B5\u5236\u8BFE\u7A0B\u7684\u8981\u7D20\u4E4B\u4E00\u3002\u53F6\u5973\u58EB\u544A\u8BC9\u8BB0\u8005\uFF0C\u5979\u5E0C\u671B\u6D1B\u8C37\u6574\u6539\u5168\u90E8\u82F1\u8BED\u9898\u9762\u3002\u53F6\u5973\u58EB\u7684\u513F\u5B50\u624D\u8003\u666E\u53CA\u7EC4\uFF0C\u5374\u5DF2\u7ECF\u5B66\u4F1A\u4E86sh\\\\*t\uFF0Cf\\\\*\\\\*k\u7B49\u9AD8\u7EA7\u8BCD\u6C47\u3002\u201C\u5B69\u5B50\u73B0\u5728\u51FA\u53E3\u5C31\u662F\u8FD9\u79CD\u8BCD\uFF0C\u5F71\u54CD\u5F88\u4E0D\u597D\uFF0C\u80AF\u5B9A\u662F\u6D1B\u8C37\u7684\u9898\u9762\u6559\u7684\u3002\u201D\u53F6\u5973\u58EB\u8BF4\u3002\\r\\n\\r\\n\u540C\u6837\uFF0C\u674E\u5148\u751F\u5BF9\u4E8E\u6D1B\u8C37\u7684bfs, dfs, bdfs\u7B97\u6CD5\u4E5F\u9887\u6709\u5FAE\u8BCD\u3002\u201C\u6211\u4EEC\u8FD8\u662F\u60F3\u7ED9\u5B69\u5B50\u8425\u9020\u4E00\u4E2A\u5065\u5EB7\u7684\u6210\u957F\u73AF\u5883\u561B\uFF0C\u6211\u770B\u8BFE\u4E0A\uFF0C\u5C45\u7136\u8BA9\u5C0F\u670B\u53CB\u4EEC\u53BB\u66B4\u529B\u904D\u5386\u56FE\u554A\u3001\u66B4\u529B\u627E\u7B54\u6848\u554A\uFF0C\u8FD9\u4E0D\u662F\u6559\u5C0F\u670B\u53CB\u4EEC\u66B4\u529B\u4E48\uFF1F\u200B\\\\*\\\\*\u5E73\u65F6\u6253\u6253\u6740\u6740\u7684\u52A8\u753B\u7247\u6211\u90FD\u4E0D\u8BA9\u81EA\u5BB6\u5C0F\u5B69\u770B\uFF0C\u66F4\u4E0D\u8981\u8BF4\u52A8\u624B\u53BB\u505A\u8FD9\u4E9B\u4E86\u3002\\\\*\\\\*\u200B\u201D\\r\\n\\r\\n\u6B64\u5916\uFF0C\u4E00\u4E9B\u975E\u76C8\u5229\u673A\u6784\u4E5F\u906D\u5230\u4E86\u5BB6\u957F\u7684\u62B5\u5236\u3002\u5F88\u591A\u5BB6\u957F\u8BA4\u4E3A\uFF0C\u73A9\u7535\u8111\u662F\u5F71\u54CD\u81EA\u5BB6\u5C0F\u5B69\u5B66\u4E60\u7684\u5173\u952E\u539F\u56E0\uFF0C\u56E0\u6B64\u5F3A\u70C8\u8981\u6C42\u6D1B\u8C37\u53D6\u7F14 **\u200BF \uFF0C\u5E76\u53D6\u6D88\u76F8\u5173\u7ADE\u8D5B\u3002\u200B **N\\\\*\\\\*P** \u9996\u5F53\u5176\u51B2\uFF0C\u5468\u5148\u751F\u63A5\u53D7\u91C7\u8BBF\u65F6\u8BF4\u9053\uFF1A\u201C\u542C\u8BF4\u8FD9\u95E8\u8BFE\u8981\u5B66\u751F\u4EEC\u81EA\u5DF1\u5B66\u4E60\u7B97\u6CD5\uFF0C\u8981\u662F\u771F\u628A\u7B97\u6CD5\u5B66\u597D\u4E86\uFF0C\u4E0D\u5C31\u4F1A\u6709\u66F4\u591A\u5C0F\u670B\u53CB\u6C89\u8FF7\u7535\u8111\u4E48\uFF1F\u200B**\u5982\u679C\u4ED6\u4EEC\u4E0D\u5B66\u7B97\u6CD5\u7684\u8BDD\uFF0C\u6211\u4EEC\u7684\u5C0F\u5B69\u5C31\u4E0D\u4F1A\u8FD9\u4E48\u8D2A\u73A9\u7535\u8111\u4E86\u3002**\u200B\u201D\u540C\u6837\uFF0C\u4E00\u4E9B\u5BB6\u957F\u4E5F\u5BF9**\u6D4F\u89C8\u5668**\u200B\u8868\u793A\u4E0D\u6EE1\uFF1A\u201C\u200B**\u6CA1\u6709\u6D4F\u89C8\u5668\uFF0C\u5C0F\u670B\u53CB\u4EEC\u81EA\u7136\u5C31\u4E0D\u4F1A\u6C89\u8FF7\u4E0A\u7F51\u4E86\u3002\\\\*\\\\*\u201D\\r\\n\\r\\n\u8BA9\u8BB0\u8005\u611F\u5230\u60CA\u5947\u7684\u662F\uFF0C\u5F88\u591A\u5BB6\u957F\u5BF9\u4E00\u4E9B\u8BA1\u7B97\u673A\u57FA\u7840\u6570\u5B66\u5185\u5BB9\u4E5F\u6709\u8F83\u5927\u7684\u610F\u89C1\u3002\u90E8\u5206\u5BB6\u957F\u8981\u6C42\u4E0B\u67B6\\\\*\\\\*\u300A\u7EC4\u5408\u6570\u5B66\u300B\\\\*\\\\* **\u200B\u300A\u6DF7\u51DD\u571F\u6570\u5B66\u300B\u200B**\u7B49\u8BFE\u7A0B\u3002\u5728\u95EE\u53CA\u539F\u56E0\u65F6\uFF0C\u5BB6\u957F\u544A\u8BC9\u8BB0\u8005\uFF0C**\u6587\u4E2D\u7684\u611F\u53F9\u53F7\u5F88\u50CF\u4E00\u6839\u68CD\u5B50\uFF0C\u4F1A\u5F15\u53D1\u5C0F\u670B\u53CB\u7684\u66B4\u529B\u503E\u5411\u3002**\\r\\n\\r\\n\u9488\u5BF9\u6B64\u4E8B\uFF0C\u8BB0\u8005\u5C1D\u8BD5\u8054\u7EDC\u6D1B\u8C37\u7F51\u7EDC\u79D1\u6280\u6709\u9650\u516C\u53F8\u7684\u7BA1\u7406\u5458\u3002\u7BA1\u7406\u5458\u56DE\u590D\u79F0\uFF0C\\r\\n\\r\\nhttps://www.luogu.com.cn/user/1\\r\\n\\r\\n\u4E0D\u8FC7\uFF0C\u4E5F\u6709\u5C11\u6570\u5BB6\u957F\u5BF9\u4E00\u4E9B\u7B97\u6CD5\u8868\u793A\u652F\u6301\u3002\u4E00\u4F4D\u5BB6\u957F\u544A\u8BC9\u8BB0\u8005\uFF0C\u5E0C\u671B\u5B66\u6821\u7740\u529B\u5EFA\u8BBE\u300A\u7F16\u7A0B\u8BED\u8A00\u57FA\u7840\u300B\u8BFE\u7A0B\u3002\u201C\u200B\\\\*\\\\*\u5B69\u5B50\u5982\u679C\u5728\u5B66\u6821\u5B66\u597D\u8BED\u8A00\u8FD9\u4E9B\u4E1C\u897F\u7684\u8BDD\uFF0C\u56DE\u8BA9\u4ED6\u642C\u7816\u7684\u65F6\u5019\u5E94\u8BE5\u80FD\u66F4\u597D\u4E00\u4E9B\u3002\\\\*\\\\*\u200B\u201D import turtle import time print(\'\u6B22\u8FCE\u4F7F\u7528PY-C\u8BED\u8A00!\') 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(\'\u65E0\u7528\') b=input() if b==\'pwrnbnt[nt()>x]\': q=input(\'\u6709\u7528\') print(q) time.sleep(2) elif n==\'bl prt; and ();\': print(\'qwerty(print()):!\') w=input() a=input(\'\u65E0\u7528\u8F93\u5165\') if w==\'bl\': t=input(\'\u8F93\u5165\u53D8\u91CF\') b=t u=input() if u==\'prt(bl[itntgujhy]-(a))\': print(b) time.sleep(2)\\r\\n\\r\\nelif 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(\'\u5012\u5E8F\u6392\u5217\') 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\u200B==y: print(j) time.sleep(2) elif n==\u200B\'if [1;2{1234}to(12345[x])\u200B==\\"y\\"];\': print(\'if and else to print()!;\') u=input() if u==\u200B\'input(1*2) if and if(to); and eles to and if (print(123)):\': q=int(input()) w=int(input()) if q\u200B==w: print(q) time.sleep(2) elif q>w: print(q) time.sleep() elif n==\u200B\'a,b\u200B==int(input(2))} and while and to {12qwerty}-(a) print(a);\': a=int(input()) b=int(input(\'\u4E0D\u8981\u662F\u592A\u5927\u7684\u6570\')) while a>b: print(a) a+=1 time.sleep(2) elif n==\u200B\'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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\'\u8ACB\u8F38\u5165\u4E00\u500B\u5217\u8868\').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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\'\u8BF7\u8F93\u5165\u4E00\u4E2A\u5217\u8868\').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(\\"\u4E00\u4E2A\u5143\u7EC4\\")) 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==\'\u200B*mt*\u200B: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==\'\u200B*mt*\u200B:turtle drew;\': n=int(input(\'\u6B21\u6570\')) for i in range(1,n+1): a=input(\'a cmd\') if a \u200B==\'turtle.qdesgforward(100);\': turtle.forward(100) elif a==\u200B\'turtle.qhhjaudbnsuleft(90);\': turtle.left(90)\\r\\n\\r\\n# \u770B\u5B8Cmd\u8BED\u6CD5\u8BB0\u5F97\u56DE\u6765\uFF01\uFF01\u6587\u7AE0\u672B\u5C3E\u6709\u5F69\u86CB\uFF01\uFF01md\u8BED\u6CD5\u653E\u8FD9\u91CC\u4E86\uFF1A\\r\\n\\r\\n# [Markdown \u8BED\u6CD5---\u6233\u6211\u8DF3\u8F6C](https://blog.csdn.net/qcx321/article/details/53780672)\\r\\n\\r\\n# \u5199\u9898\u683C\u5F0F\uFF1A\uFF1A\\r\\n\\r\\n```none\\r\\nmarkdown\\r\\n//\'#\'\u548C\u6587\u5B57\u4E2D\u95F4\u6709\u7A7A\u683C\uFF01\uFF01\\r\\n//\u6B63\u786E\u793A\u8303\uFF1A# \u9898\u76EE\u63CF\u8FF0\\r\\n//\u9519\u8BEF\u793A\u8303\uFF1A#\u9898\u76EE\u63CF\u8FF0\\r\\n\\r\\n# \u9898\u76EE\u80CC\u666F(\u82E5\u679C\u6709\u9700\u8981\u80FD\u5199\u4E0A)\\r\\n\\r\\n\u8F93\u5165\u4F60\u60F3\u8BF4\u7684\uFF08\u6CE8\u610F\u8DDF\u80CC\u666F\u6709\u5173)\\r\\n\\r\\n# \u9898\u76EE\u63CF\u8FF0\\r\\n\\r\\n\u53D1\u6325\u4F60\u7684\u60F3\u8C61(\u4E0D\u8981\u628A\u8F93\u5165\u8F93\u51FA\u683C\u5F0F\u8BF4\u4E86\uFF0C\\r\\n\u53EA\u8BF4\u4EE3\u7801\u9700\u89E3\u51B3\u7684\u529F\u80FD\u5C31\u53EF\u4EE5\u5566\uFF01\uFF09\\r\\n\\r\\n# \u8F93\u5165\u683C\u5F0F\\r\\n\\r\\n\u8F93\u5165\u5171$\u8F93\u5165\u884C\u6570$\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n# \u8F93\u51FA\u683C\u5F0F\\r\\n\\r\\n\u8F93\u5165\u5171$\u8F93\u51FA\u884C\u6570$\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n# \u8F93\u5165\u8F93\u51FA\u6837\u4F8B\\r\\n\\r\\n## \u8F93\u5165\u6837\u4F8B\\r\\n\\r\\n\\\\```input1\\r\\n\u2026\u2026\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n\\\\```\\r\\n\\r\\n## \u8F93\u51FA\u6837\u4F8B\\r\\n\\r\\n\\\\```output1\\r\\n\u2026\u2026\u2026\u2026\u2026\u2026\u2026\u2026\\r\\n\\r\\n\\\\```\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n\u6700\u540E\u5199\u9898\u63A8\u8350\u5728[HydroOJ](https://hydro.ac/)\u4E0A\u9762\u5199\u9898\uFF0C\u4E00\u6B65\u4E00\u6B65\u6162\u6162\u6765\uFF1A\\r\\n\\r\\n\u7B2C\u4E00\u6B65\uFF09\u521B\u5EFA\u65B9\u6CD5\uFF1A[\u57DF\u521B\u5EFA\u6559\u7A0B](https://hydro.ac/discuss/6172ceeed850d38c79ae18f9)\\r\\n\\r\\n\u7B2C\u4E8C\u6B65\uFF09\u4F7F\u7528\u65B9\u6CD5\uFF1A\u81EA\u5DF1\u7528Github\u8D26\u53F7\u521B\u4E00\u4E2A\u81EA\u5DF1\u7684\u57DF\uFF0C\u4F53\u9A8C\u4E00\u628A\u5F53\u7BA1\u7406\u5458\u7684\u723D\uFF01\u5EFA\u597D\u57DF\u540E\uFF0C\u70B9\u5230\u9898\u5E93\uFF0C\u53F3\u4FA7\u83DC\u5355\u680F\u9009\\"\u521B\u5EFA\u9898\u76EE\\"\uFF0C\u5728\u91CC\u9762\u4F60\u53EF\u4EE5\u73B0\u5199markdown\uFF0C\u8FD8\u8BB0\u5F97\u6587\u7AE0\u5F00\u59CB\u90A3\u4E2A\u94FE\u63A5\u5417\uFF1F\u7528\u91CC\u9762\u7684\u8BED\u6CD5\u628A\u4F60\u60F3\u8981\u7684\u4E1C\u897F\u5448\u73B0\u51FA\u6765\u5C31\u597D\u5566\uFF01\uFF01\\r\\n\\r\\n[\u8BAD\u7EC3 - Turing (qdturing.cn)](https://oj.qdturing.cn/d/W0001/training)\\r\\n\\r\\n[https://oj.qdturing.cn/d/system/](https://oj.qdturing.cn/d/system/) \'\'\' \\r\\n\\r\\n```none\\r\\n::\\r\\n :;J7,:, ::;7:\\r\\n ,ivYi, , ;LLLFS:\\r\\n :iv7Yi :7ri;j5PL\\r\\n ,:ivYLvr ,ivrrirrY2X,\\r\\n :;r@Wwz.7r: :ivu@kexianli.\\r\\n :iL7::,:::iiirii:ii;::::,,irvF7rvvLujL7ur\\r\\n ri::,:,::i:iiiiiii:i:irrv177JX7rYXqZEkvv17\\r\\n ;i:, , ::::iirrririi:i:::iiir2XXvii;L8OGJr71i\\r\\n :,, ,,: ,::ir@mingyi.irii:i:::j1jri7ZBOS7ivv,\\r\\n ,::, ::rv77iiiriii:iii:i::,rvLq@huhao.Li\\r\\n ,, ,, ,:ir7ir::,:::i;ir:::i:i::rSGGYri712:\\r\\n ::: ,v7r:: ::rrv77:, ,, ,:i7rrii:::::, ir7ri7Lri\\r\\n , 2OBBOi,iiir;r:: ,irriiii::,, ,iv7Luur:\\r\\n ,, i78MBBi,:,:::,:, :7FSL: ,iriii:::i::,,:rLqXv::\\r\\n : iuMMP: :,:::,:ii;2GY7OBB0viiii:i:iii:i:::iJqL;::\\r\\n , ::::i ,,,,, ::LuBBu BBBBBErii:i:i:i:i:i:i:r77ii\\r\\n , : , ,,:::rruBZ1MBBqi, :,,,:::,::::::iiriri:\\r\\n , ,,,,::::i: @arqiao. ,:,, ,:::ii;i7:\\r\\n :, rjujLYLi ,,:::::,:::::::::,, ,:i,:,,,,,::i:iii\\r\\n :: BBBBBBBBB0, ,,::: , ,:::::: , ,,,, ,,:::::::\\r\\n i, , ,8BMMBBBBBBi ,,:,, ,,, , , , , , :,::ii::i::\\r\\n : iZMOMOMBBM2::::::::::,,,, ,,,,,,:,,,::::i:irr:i:::,\\r\\n i ,,:;u0MBMOG1L:::i:::::: ,,,::, ,,, ::::::i:i:iirii:i:i:\\r\\n : ,iuUuuXUkFu7i:iii:i:::, :,:,: ::::::::i:i:::::iirr7iiri::\\r\\n : :rk@Yizero.i:::::, ,:ii:::::::i:::::i::,::::iirrriiiri::,\\r\\n : 5BMBBBBBBSr:,::rv2kuii:::iii::,:i:,, , ,,:,:i@petermu.,\\r\\n , :r50EZ8MBBBBGOBBBZP7::::i::,:::::,: :,:,::i;rrririiii::\\r\\n :jujYY7LS0ujJL7r::,::i::,::::::::::::::iirirrrrrrr:ii:\\r\\n ,: :@kevensun.:,:,,,::::i:i:::::,,::::::iir;ii;7v77;ii;i,\\r\\n ,,, ,,:,::::::i:iiiii:i::::,, ::::iiiir@xingjief.r;7:i,\\r\\n , , ,,,:,,::::::::iiiiiiiiii:,:,:::::::::iiir;ri7vL77rrirri::\\r\\n :,, , ::::::::i:::i:::i:i::,,,,,:,::i:i:::iir;@Secbone.ii:::\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n```none\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ || || || || || || // // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ _ooOoo_ // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ o8888888o // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ 88\\" . \\"88 // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ (| -_- |) // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ O\\\\ = /O // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ ____/`---\'\\\\____ // ////\\r\\n\\\\\\\\\\\\\\\\ .\' \\\\\\\\| |// `. ////\\r\\n//== / \\\\\\\\||| : |||// \\\\ ==\\\\\\\\\\r\\n//== / _||||| -:- |||||- \\\\ ==\\\\\\\\\\r\\n//== | | \\\\\\\\\\\\ - /// | | ==\\\\\\\\\\r\\n//== | \\\\_| \'\'\\\\---/\'\' | | ==\\\\\\\\\\r\\n//== \\\\ .-\\\\__ `-` ___/-. / ==\\\\\\\\\\r\\n//== ___`. .\' /--.--\\\\ `. . ___ ==\\\\\\\\\\r\\n//== .\\"\\" \'< `.___\\\\_<|>_/___.\' >\' \\"\\". ==\\\\\\\\\\r\\n//== | | : `- \\\\`.;`\\\\ _ /`;.`/ - ` : | | \\\\\\\\\\\\\\\\\\r\\n//// \\\\ \\\\ `-. \\\\_ __\\\\ /__ _/ .-` / / \\\\\\\\\\\\\\\\\\r\\n//// ========`-.____`-.___\\\\_____/___.-`____.-\'======== \\\\\\\\\\\\\\\\\\r\\n//// `=---=\' \\\\\\\\\\\\\\\\\\r\\n//// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // \u4F5B\u7956\u4FDD\u4F51 \u6C38\u8FDCAC \u6C38\u4E0D\u4FEE\u6539 \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // // // // || || || || || || || || || || \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[https://oj.qdturing.cn/user/2430](https://oj.qdturing.cn/user/2430)\\r\\n\\r\\n[https://oj.qdturing.cn/user/3092](https://oj.qdturing.cn/user/3092)\\r\\n\\r\\n[https://oj.qdturing.cn/user/1014](https://oj.qdturing.cn/user/1014)\\r\\n\\r\\n[https://oj.qdturing.cn/user/1015](https://oj.qdturing.cn/user/1015)\\r\\n\\r\\n# \u6CF0\u62C9\u745E\u4E9A\\\\~\\r\\n\\r\\n   \\r\\n\\r\\n[https://oj.qdturing.cn/user/362](https://oj.qdturing.cn/user/362) [https://oj.qdturing.cn/user/27](https://oj.qdturing.cn/user/27)\\r\\n\\r\\n  \\r\\n\\r\\n# \u6BD4\u8D5B\\r\\n\\r\\n1. **10**\\r\\n **2024-4**\\r\\n \\r\\n # [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u5C0F\u5B66\u7EC4](https://oj.qdturing.cn/contest/66163ff3e58c8dbba13b068c)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * 600 \u5C0F\u65F6\\r\\n * 45\\r\\n2. **10**\\r\\n **2024-4**\\r\\n \\r\\n # [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u521D\u4E2D\u7EC4](https://oj.qdturing.cn/contest/66162df2e58c8dbba13af0c8)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * 600 \u5C0F\u65F6\\r\\n * 25\\r\\n3. **31**\\r\\n **2024-3**\\r\\n \\r\\n # [\u56FE\u7075\u4E09\u6708\u6708\u8D5B - \u63D0\u9AD8\u7EC4 \u8D5B\u9898](https://oj.qdturing.cn/contest/66092cff2faa61e7f72a9727)\\r\\n \\r\\n * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm)\\r\\n * 2 \u5C0F\u65F6\\r\\n * 23\\r\\n4. **6**\\r\\n **2024-2**\\r\\n \\r\\n # [2024 \u65B0\u6625\u8D3A\u5C81 \u601D\u7EF4\u6A21\u62DF\u8D5B div.2](https://oj.qdturing.cn/contest/65c10bf5c82e8ec49fdfee00)\\r\\n \\r\\n * [ACM/ICPC](https://oj.qdturing.cn/contest?rule=acm)\\r\\n * Rated\\r\\n * 3 \u5C0F\u65F6\\r\\n * 28\\r\\n5. **8**\\r\\n **2023-7**\\r\\n \\r\\n # [2023.7.8 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B](https://oj.qdturing.cn/contest/64a8ca1289a4167efe646520)\\r\\n \\r\\n * [IOI](https://oj.qdturing.cn/contest?rule=ioi)\\r\\n * Rated\\r\\n * 5 \u5C0F\u65F6\\r\\n * 6\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/contest)\\r\\n\\r\\n# \u4F5C\u4E1A\\r\\n\\r\\n1. **21**\\r\\n **2024-2**\\r\\n \\r\\n # [2024 \u65B0\u6625\u8D3A\u5C81 \u601D\u7EF4\u6A21\u62DF\u8D5B div.2 \u8865\u9898\u573A](https://oj.qdturing.cn/homework/65c2e34cc82e8ec49fe0b120)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **2 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **1 \u4E2A\u6708\u524D**\\r\\n2. **28**\\r\\n **2023-7**\\r\\n \\r\\n # [2023.6.10 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u8D5B](https://oj.qdturing.cn/homework/648985663d3f34cb2cb71939)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **8 \u4E2A\u6708\u524D**\\r\\n3. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.5.27 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u9898\u573A](https://oj.qdturing.cn/homework/64780c42f428fb2d18a6d008)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n4. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023\u5E74 \u5E02\u5317\u533A\u533A\u8D5B - \u521D\u4E2D\u7EC4\u8865\u9898\u573A](https://oj.qdturing.cn/homework/645de3a2eb77954a9afa5a27)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n5. **30**\\r\\n **2023-6**\\r\\n \\r\\n # [2023\u5E74 \u5E02\u5317\u533A\u533A\u8D5B - \u5C0F\u5B66\u7EC4\u8865\u9898\u573A](https://oj.qdturing.cn/homework/645ddfd2eb77954a9afa56b5)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n6. **29**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.6.3 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u8D5B](https://oj.qdturing.cn/homework/64803c5aa3c4b799f61a0e42)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **9 \u4E2A\u6708\u524D**\\r\\n7. **5**\\r\\n **2023-6**\\r\\n \\r\\n # [2023.5.20 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B \u8865\u9898\u573A](https://oj.qdturing.cn/homework/646994197e384d7c1691ff34)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n8. **25**\\r\\n **2023-5**\\r\\n \\r\\n # [2023.4.22 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/64488cd3b4bcd970abf6dff1)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **10 \u4E2A\u6708\u524D**\\r\\n9. **7**\\r\\n **2023-5**\\r\\n \\r\\n # [2023.4.29 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/644d0555604717e00720f3ce)\\r\\n \\r\\n * \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n * \u5F00\u59CB\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n * \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n10. **29**\\r\\n\\r\\n**2023-4**\\r\\n\\r\\n# [2023.3.25 \u9752\u5C9B\u5E02\u56FE\u7075\u7F16\u7A0B\u676F \u5468\u8D5B\u8865\u9898\u573A](https://oj.qdturing.cn/homework/641d43a8453064be228e37b2)\\r\\n\\r\\n* \u72B6\u6001: \u5DF2\u7ED3\u675F\\r\\n* \u5F00\u59CB\u65F6\u95F4: **1 \u5E74\u524D**\\r\\n* \u6700\u7EC8\u622A\u6B62\u65F6\u95F4: **11 \u4E2A\u6708\u524D**\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/homework)\\r\\n\\r\\n# \u8BAD\u7EC3\\r\\n\\r\\n1. 351\\r\\n \u5DF2\u53C2\u52A0\\r\\n \\r\\n # [\u6D4B\u8BD5\u4E13\u7528\u8BAD\u7EC3](https://oj.qdturing.cn/training/6477fcfbf428fb2d18a6cd82)\\r\\n \\r\\n \u6D4B\u8BD5\u4E13\u7528\u8BAD\u7EC3,\u7528\u4E8E\u65B0\u751F\u6D4B\u8BD5\\r\\n \\r\\n * 5 \u5C0F\u8282, 61 \u9053\u9898\\r\\n * **\u5DF2\u5B8C\u6210 0%**\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/training)\\r\\n\\r\\n# Ranking\\r\\n\\r\\n| \u6392\u540D | \u7528\u6237\u540D | RP | \u4E2A\u4EBA\u7B80\u4ECB |\\r\\n| ------ | -------- | ---- | ---------- |\\r\\n\\r\\n| 1 |  [\u738B\u6CF3\u6743 (Wf\\\\_yjqd)](https://oj.qdturing.cn/user/58) | 2225 | \u6211\u5C31\u770B\u4E0D\u6253\u6BD4\u8D5B\u591A\u4E45\u80FD\u6389\u4E0B Rank 1 | \u62DC\u6708 | RiOI | \u83DC\u72D7 | lyhtql\uFF01| AFT | | ---- | -------------------------------------------------------------------------------------------------------------------------------- | ------ | --------------------------------------------------------------------------------------------------------------- | | 2 |  [\u539F\u6893\u6052 (yzh\\\\_tcl)](https://oj.qdturing.cn/user/157) | 1949 | \u674E\u9038\u822A\u548C\u738B\u6CF3\u6743\u8BF4\u4E86\uFF0C\u4ED6\u4EEC\u53EA\u9700\u8981\u7565\u5FAE\u51FA\u624B\uFF0C\u5C31\u5DF2\u77E5\u8FD9\u4E2A\u5206\u6BB5\u7684\u6781\u9650\u4E86 | | 3 |  [\u674E\u5B89 (Andy\\\\_Li)](https://oj.qdturing.cn/user/126) | 1943 | AFO . . . . . . . . . . . . . . . . . . . . ... | | 4 |  [\u674E\u5BB8\u6717 (lcl000000)](https://oj.qdturing.cn/user/427) | 1932 | | | 5 |  [\u4EC7\u5B50\u671F (sevenqiu)](https://oj.qdturing.cn/user/1104) | 1875 | \u6211\u662F\u4E2A\u8001\u516D \u6211\u7231\u86CB\u4ED4 | | 6 |  [\u5F20\u71A0\u747E (WCD.ZYJ)](https://oj.qdturing.cn/user/76) | 1861 | | | 7 |  [\u81E7\u5B87\u8F69 (NaCl\\\\_Fish)](https://oj.qdturing.cn/user/61) | 1809 | [CSDN\u4E3B\u9875Link](https://blog.csdn.net/m0_62680538?type=blog) | | 8 |  [\u5218\u4ED5\u4FCA (liushijun)](https://oj.qdturing.cn/user/898) | 1799 | ***Exploration Never Ends*** | | 9 |  [\u97E9\u627F\u6631 (saixingzhe)](https://oj.qdturing.cn/user/75) | 1783 | \u201C\u662F\u91D1\u5B50\u603B\u4F1A\u53D1\u5149\u201D \u201C\u4F46\u5982\u679C\u6CA1\u6709\u5149\u6E90\uFF0C\u91D1\u5B50\u6C38\u8FDC\u4E0D\u4F1A\u53D1\u5149\u201D # [HCOI \u51FA\u9898\u56E2]([https://www.luog](https://www.luog/)... | | 10 |  [\u9A6C\u6D69\u9E23 (mahaoming)](https://oj.qdturing.cn/user/129) | 1781 | 6\u2026\u2026\u2026\u2026\uFF1F |\\r\\n\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/ranking)\\r\\n\\r\\n# \u8BA8\u8BBA\\r\\n\\r\\n1. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u6E29\u5EA6\u8F6C\u6362\u65E0\u8F93\u5165\u7248\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c9ff993cdee3b59700a#1713061023552)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n2. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u660E\u4E70\u6C34\u679C\u4E94\u65E0\u8F93\u5165\u7248\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c6af993cdee3b596ee6#1713060970292)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n3. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5012\u9709\u7684\u5C0F\u660E\uFF08\u6C42\u89E3\uFF09](https://oj.qdturing.cn/discuss/661b3c3af993cdee3b596dba#1713060922702)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 2 \u6B21\u67E5\u770B\\r\\n *  [\u5F3A\u94ED\u8F69 (qiangmingxuan) ](https://oj.qdturing.cn/user/349)@ **1 \u5C0F\u65F6\u524D**\\r\\n4. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u77E5\u8BC6](https://oj.qdturing.cn/discuss/661a721bf993cdee3b587229#1713009179189)\\r\\n \\r\\n * [\u6570\u5B66](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6)\\r\\n * 5 \u6B21\u67E5\u770B\\r\\n *  [\u59DC\u5B97\u4F55 (JZH) ](https://oj.qdturing.cn/user/1289)@ **16 \u5C0F\u65F6\u524D**\\r\\n5. 2\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [4\u670811\u65E5\u672A\u6765\u4E4B\u661F\u4F5C\u4E1A\u600E\u4E48\u5199](https://oj.qdturing.cn/discuss/6619ef2387b210d79c0ddce4#1713006555814)\\r\\n \\r\\n * [\u9898\u89E3](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3)\\r\\n * 14 \u6B21\u67E5\u770B\\r\\n *  [\u5D14\u7AE3\u7693 ](https://oj.qdturing.cn/user/1806)@ **16 \u5C0F\u65F6\u524D**\\r\\n6. 1\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [string \u600E\u4E48\u7528getline](https://oj.qdturing.cn/discuss/661919bb87b210d79c0cf318#1712927819286)\\r\\n \\r\\n * [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n * 14 \u6B21\u67E5\u770B\\r\\n *  [\u5218\u65ED\u677E (LeoLiu) ](https://oj.qdturing.cn/user/685)@ **1 \u5929\u524D**\\r\\n7. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u51683](https://oj.qdturing.cn/discuss/6617ffee87b210d79c0c1e1b#1712848878082)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 31 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n8. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u51682](https://oj.qdturing.cn/discuss/6617dbff87b210d79c0bea6a#1712839679686)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 26 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n9. 0\\r\\n \u8BC4\u8BBA\\r\\n \\r\\n # [\u5C0F\u6E38\u620F\u5927\u5168](https://oj.qdturing.cn/discuss/6617da4b87b210d79c0be2bf#1712839243992)\\r\\n \\r\\n * [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n * 22 \u6B21\u67E5\u770B\\r\\n *  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n10. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u540E\u6094\u5427\uFF0C\u5C11\u5E74\uFF01](https://oj.qdturing.cn/discuss/6617ce2ae58c8dbba13e60bd#1712836138025)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 17 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **2 \u5929\u524D**\\r\\n\\r\\n11. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u53EF\u80FD\u8BA9\u4F60\u540E\u6094\u7684\u4E1C\u4E1C](https://oj.qdturing.cn/discuss/6617b9cde58c8dbba13e1f9a#1712830925828)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 18 \u6B21\u67E5\u770B\\r\\n*  [\u9EC4\u65B0\u4E5F (Hxy0705) ](https://oj.qdturing.cn/user/1142)@ **2 \u5929\u524D**\\r\\n\\r\\n12. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u901A\u5929\u5854](https://oj.qdturing.cn/discuss/6617a5e0e58c8dbba13de3f0#1712837968242)\\r\\n\\r\\n* [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n* 24 \u6B21\u67E5\u770B\\r\\n*  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **2 \u5929\u524D**\\r\\n\\r\\n13. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u4F60\u597D\uFF0C\u738B\u6668\u5E0C](https://oj.qdturing.cn/discuss/6617a596e58c8dbba13de0b0#1712993715835)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 14 \u6B21\u67E5\u770B\\r\\n*  [\u6731\u7F8E\u83D5 ](https://oj.qdturing.cn/user/1728)@ **20 \u5C0F\u65F6\u524D**\\r\\n\\r\\n14. 2\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u6CA1\u6709\u517Boc\u7684\u4EA4\u6D41\u4E00\u4E0B](https://oj.qdturing.cn/discuss/6617a519e58c8dbba13dd66f#1712969817779)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 13 \u6B21\u67E5\u770B\\r\\n*  [\u738B\u6668\u5E0C (wangchenxi) ](https://oj.qdturing.cn/user/3394)@ **1 \u5929\u524D**\\r\\n\\r\\n15. 3\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [c++\u683C\u5F0F](https://oj.qdturing.cn/discuss/66179f19e58c8dbba13d4a05#1712992786779)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 19 \u6B21\u67E5\u770B\\r\\n*  [\u5D14\u7AE3\u7693 ](https://oj.qdturing.cn/user/1806)@ **20 \u5C0F\u65F6\u524D**\\r\\n\\r\\n16. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [114514114514](https://oj.qdturing.cn/discuss/66168bdee58c8dbba13be42a#1712753630359)\\r\\n\\r\\n* [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n* 17 \u6B21\u67E5\u770B\\r\\n*  [\u9AD8\u6668\u7199 (17362259026) ](https://oj.qdturing.cn/user/1224)@ **3 \u5929\u524D**\\r\\n\\r\\n17. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u5927\u4F6C\u4EEC\u4E00\u770B](https://oj.qdturing.cn/discuss/661681d5e58c8dbba13bba65#1712751061541)\\r\\n\\r\\n* [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u521D\u4E2D\u7EC4](https://oj.qdturing.cn/discuss/contest/66162df2e58c8dbba13af0c8)\\r\\n* 20 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **3 \u5929\u524D**\\r\\n\\r\\n18. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u6709\u5927\u4F6C\u5417\uFF0C\u70B9\u8FDB\u6765\u770B\u770B](https://oj.qdturing.cn/discuss/6616818ae58c8dbba13bb905#1712823743205)\\r\\n\\r\\n* [2022-2023\u5E74\u5E02\u5317\u533A\u533A\u8D5B\u5386\u5E74\u771F\u9898 - \u5C0F\u5B66\u7EC4](https://oj.qdturing.cn/discuss/contest/66163ff3e58c8dbba13b068c)\\r\\n* 22 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **2 \u5929\u524D**\\r\\n\\r\\n19. 0\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u8C01\u6709\u7A7A\uFF1F](https://oj.qdturing.cn/discuss/661664ace58c8dbba13b6a4d#1712743596552)\\r\\n\\r\\n* [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B)\\r\\n* 14 \u6B21\u67E5\u770B\\r\\n*  [\u5B59\u8D1E\u70DC ](https://oj.qdturing.cn/user/1459)@ **3 \u5929\u524D**\\r\\n\\r\\n20. 1\\r\\n\\r\\n\u8BC4\u8BBA\\r\\n\\r\\n# [\u8BA8\u8BBA](https://oj.qdturing.cn/discuss/661640ffe58c8dbba13b0a01#1712734472982)\\r\\n\\r\\n* [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n* 16 \u6B21\u67E5\u770B\\r\\n*  [\u9648\u6631\u6C40 ](https://oj.qdturing.cn/user/3037)@ **3 \u5929\u524D**\\r\\n* [\u66F4\u591A >](https://oj.qdturing.cn/discuss)\\r\\n\\r\\n# \u4E00\u8A00\\r\\n\\r\\nCannot get hitokoto.\\r\\n\\r\\n# \u6700\u65B0\u9898\u76EE\\r\\n\\r\\n[**P1183** \u3010\u5165\u95E8\u3011\u53CB\u597D\u6570](https://oj.qdturing.cn/p/P1183)1 \u5468\u524D\\r\\n\\r\\n[**zs024** \u5C0FZ\u7684\u5207\u9664\u6811](https://oj.qdturing.cn/p/zs024)1 \u5468\u524D\\r\\n\\r\\n[**zs023** \u5C0F\u6768\u7684\u65C5\u6E38](https://oj.qdturing.cn/p/zs023)1 \u5468\u524D\\r\\n\\r\\n[**zs022** \u5C0FS\u7684\u5B50\u6570\u7EC4\u548C](https://oj.qdturing.cn/p/zs022)1 \u5468\u524D\\r\\n\\r\\n[**zs021** \u5C0FB\u7684\u6392\u5217\u6570\u7EC4](https://oj.qdturing.cn/p/zs021)1 \u5468\u524D\\r\\n\\r\\n[**zs020** \u5C0FA\u7684\u6392\u5E8F\u6570\u7EC4](https://oj.qdturing.cn/p/zs020)1 \u5468\u524D\\r\\n\\r\\n[**zs019** \u8FF7\u5BAB\u7EDF\u8BA1](https://oj.qdturing.cn/p/zs019)1 \u5468\u524D\\r\\n\\r\\n[**zs24414** \u5151\u6362\u8D27\u5E01](https://oj.qdturing.cn/p/zs24414)1 \u5468\u524D\\r\\n\\r\\n[**zs24413** n\u91CD\u4E32](https://oj.qdturing.cn/p/zs24413)1 \u5468\u524D\\r\\n\\r\\n[**zs24411** \u8BA8\u4F10\u5DE8\u9F99\u7684\u5C0F\u961F](https://oj.qdturing.cn/p/zs24411)1 \u5468\u524D\\r\\n\\r\\n# \u641C\u7D22\\r\\n\\r\\n[ ] \u641C\u7D22\\r\\n\\r\\n# \u8BA8\u8BBA\u8282\u70B9\\r\\n\\r\\n* ## \u63A2\u7D22\\r\\n \\r\\n 1. [\u95EE\u7B54](https://oj.qdturing.cn/discuss/node/%E9%97%AE%E7%AD%94)\\r\\n 2. [\u5206\u4EAB](https://oj.qdturing.cn/discuss/node/%E5%88%86%E4%BA%AB)\\r\\n 3. [\u9898\u89E3](https://oj.qdturing.cn/discuss/node/%E9%A2%98%E8%A7%A3)\\r\\n* ## \u5728\u7EBF\u9898\u5E93\\r\\n \\r\\n 1. [CodeForces](https://oj.qdturing.cn/discuss/node/CodeForces)\\r\\n 2. [TopCoder](https://oj.qdturing.cn/discuss/node/TopCoder)\\r\\n 3. [POJ](https://oj.qdturing.cn/discuss/node/POJ)\\r\\n 4. [BZOJ](https://oj.qdturing.cn/discuss/node/BZOJ)\\r\\n 5. [USACO](https://oj.qdturing.cn/discuss/node/USACO)\\r\\n 6. [RQNOJ](https://oj.qdturing.cn/discuss/node/RQNOJ)\\r\\n 7. [UOJ](https://oj.qdturing.cn/discuss/node/UOJ)\\r\\n 8. [LOJ](https://oj.qdturing.cn/discuss/node/LOJ)\\r\\n 9. [\u6D1B\u8C37](https://oj.qdturing.cn/discuss/node/%E6%B4%9B%E8%B0%B7)\\r\\n* ## \u6CDB\\r\\n \\r\\n 1. [\u6570\u5B66](https://oj.qdturing.cn/discuss/node/%E6%95%B0%E5%AD%A6)\\r\\n 2. [C++](https://oj.qdturing.cn/discuss/node/C%2B%2B)\\r\\n 3. [Python](https://oj.qdturing.cn/discuss/node/Python)\\r\\n 4. [Julia](https://oj.qdturing.cn/discuss/node/Julia)\\r\\n 5. [\u6E38\u620F](https://oj.qdturing.cn/discuss/node/%E6%B8%B8%E6%88%8F)\\r\\n 6. [\u4FDD\u9001](https://oj.qdturing.cn/discuss/node/%E4%BF%9D%E9%80%81)\\r\\n\\r\\n# \u63A8\u8350\\r\\n\\r\\n* ## \u4E2D\u6587\\r\\n \\r\\n 1. [LibreOJ](https://loj.ac/)\\r\\n 2. [\u6D1B\u8C37](https://www.luogu.com.cn/)\\r\\n 3. [UOJ](https://uoj.ac/)\\r\\n 4. [CometOJ](https://www.cometoj.com/)\\r\\n 5. [Vijos](https://vijos.org/)\\r\\n* ## English\\r\\n \\r\\n 1. [Codeforces](https://codeforces.com/)\\r\\n 2. [AtCoder](https://atcoder.jp/)\\r\\n 3. [CodeChef](https://www.codechef.com/)\\r\\n 4. [SPOJ](https://www.spoj.com/)\\r\\n 5. [TopCoder](https://www.topcoder.com/)\\r\\n 6. [OnlineJudge](https://onlinejudge.org/)\\r\\n* ## \u5DE5\u5177\\r\\n \\r\\n 1. [OIerDb](https://oier.baoshuo.dev/)\\r\\n\\r\\n# \u72B6\u6001\\r\\n\\r\\n* [\u8BC4\u6D4B\u961F\u5217](https://oj.qdturing.cn/record)\\r\\n* [\u670D\u52A1\u72B6\u6001](https://oj.qdturing.cn/status)\\r\\n\\r\\n# \u5F00\u53D1\\r\\n\\r\\n* [\u5F00\u6E90](https://github.com/hydro-dev/Hydro)\\r\\n* [API](https://oj.qdturing.cn/api)\\r\\n\\r\\n# \u652F\u6301\\r\\n\\r\\n* [\u5E2E\u52A9](https://oj.qdturing.cn/wiki/help)\\r\\n* [QQ \u7FA4](https://oj.qdturing.cn/wiki/about#contact)\\r\\n\\r\\n1. [\u5173\u4E8E](https://oj.qdturing.cn/wiki/about)\\r\\n2. [\u8054\u7CFB\u6211\u4EEC](https://oj.qdturing.cn/wiki/about#contact)\\r\\n3. [\u9690\u79C1](https://oj.qdturing.cn/wiki/about#privacy)\\r\\n4. [\u670D\u52A1\u6761\u6B3E](https://oj.qdturing.cn/wiki/about#tos)\\r\\n5. [\u7248\u6743\u7533\u8BC9](https://oj.qdturing.cn/wiki/about#contact)\\r\\n6. Language\\r\\n7. [\u517C\u5BB9\u6A21\u5F0F](https://oj.qdturing.cn/legacy?legacy=true)\\r\\n8. \u4E3B\u9898\\r\\n9. \\r\\n10. \\r\\n11. \\r\\n12. Worker 0, 38ms\\r\\n13. Powered by [Hydro v4.11.2](https://hydro.js.org/) Community\\r\\n\\r\\n\u5728\u8FD9\u5BCC\u88D5\u7684\u5E74\u4EE3\uFF0C\u8BD7\u4EBA\u4F55\u4E3A\uFF1F \u53EF\u662F\uFF0C\u4F60\u5374\u8BF4\uFF0C\u8BD7\u4EBA\u662F\u9152\u795E\u795E\u5723\u7684\u796D\u53F8\uFF0C \u5728\u795E\u5723\u7684\u9ED1\u591C\u4E2D\uFF0C\u4ED6\u8D70\u904D\u5927\u5730\u3002\\r\\n\\r\\n\u6211\u547D\u7531\u6211\u4E0D\u7531\u5929\uFF0C\u5434\u94A9\u5F2F\uFF0C\u5C55\u950B\u5BD2\u3002\\r\\n\\r\\n\u7EA2\u5C18\u5F80\u4E8B\u4ED8\u6D41\u6C34\uFF0C\u5FD8\u5C3D\u4FD7\u7F18\u59CB\u5F97\u771F\uFF0C\u4E00\u996E\u800C\u5C3D\uFF0C\u518D\u9189\u5343\u5E74\uFF01\\r\\n\\r\\n\u60CA\u6D9B\u5165\u6D77\u89C5\u87AD\u864E\uFF0C\u98CE\u96EA\u5F52\u5C71\u65A9\u5996\u90AA\u3002\\r\\n\\r\\n\u843D\u5CF0\u957F\u65E5\u5760\uFF0C\u8D77\u7B14\u53E0\u5D82\u5347\u3002\\r\\n\\r\\n[https://s1.ax1x.com/2018/03/09/9RBOTs.gif](https://s1.ax1x.com/2018/03/09/9RBOTs.gif)\\r\\n\\r\\n[https://neave.com/](https://neave.com/)\\r\\n\\r\\n[https://classic.minecraft.net/](https://classic.minecraft.net/)\\r\\n\\r\\n[http://jcw87.github.io/c2-sans-fight/](http://jcw87.github.io/c2-sans-fight/)\\r\\n\\r\\n[http://nodes-escape.hzfe.org/](http://nodes-escape.hzfe.org/)\\r\\n\\r\\n[https://y.qq.com/n/ryqq/notfound](https://y.qq.com/n/ryqq/notfound)\\r\\n\\r\\n[https://yiyan.baidu.com/](https://yiyan.baidu.com/)\\r\\n\\r\\n[https://www.bilibili.com/](https://www.bilibili.com/)\\r\\n\\r\\n[https://oj.qdturing.cn/first\\\\_login?redirect=%2F%3F](https://oj.qdturing.cn/first_login?redirect=%2F%3F)\\r\\n\\r\\n1. \u6E05\u5E73\u4E50\xB7\u6751\u5C45\\r\\n\\r\\n---\\r\\n\\r\\n\u3010\u5B8B\u3011\u8F9B\u5F03\u75BE \u8305\u623F\u4F4E\u5C0F\uFF0C\u81ED\u5F97\u4E0D\u5F97\u4E86\u3002\u9189\u91CC\u5434\u97F3\u76F8\u5A9A\u597D\uFF0C\u767D\u53D1\u8C01\u5BB6\u7FC1\u5AAA\uFF1F\u5927\u513F\u9504\u8C46\u5931\u8E2A\uFF0C\u4E2D\u513F\u88AB\u56F0\u9E21\u7B3C\u3002\u6700\u559C\u5C0F\u513F\u4EA1\u8D56\uFF0C\u6EAA\u5934\u62D0\u5356\u513F\u7AE5\u3002\\r\\n\\r\\n---\\r\\n\\r\\n\u9759\u591C\u601D \u3010\u5510\u3011\u674E\u767D \u5E8A\u524D\u660E\u6708\u5149\uFF0C \u674E\u767D\u7761\u7684\u9999\u3002 \u68A6\u89C1\u68D2\u68D2\u7CD6\uFF0C \u53E3\u6C34\u4E09\u5343\u4E08\u3002\\r\\n\\r\\n---\\r\\n\\r\\n\uFF08\u4E0A\u6587\uFF1A\u6539\u7F16\uFF0C\u4E0B\u6587:\u81EA\u7F16\uFF09\\r\\n\\r\\n---\\r\\n\\r\\n\u5395\u6240\uD83D\uDEBE \u534A\u591C\u4E09\u66F4\uFF0C\u5395\u6240\u6CA1\u706F\u3002 \u4F60\u4E0A\u5395\u6240\uFF0C\u6389\u8FDB\u8305\u5751\u3002 \u6FC0\u70C8\u6597\u4E89\uFF0C\u58EE\u70C8\u727A\u7272\u3002 \u4E3A\u7EAA\u5FF5\u4F60\uFF0C\u5395\u6240\u88C5\u706F\u3002\\r\\n\\r\\n---\\r\\n\\r\\n```none\\r\\n\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/user/972)\\r\\n\\r\\n\u8001\u9AA5\u4F0F\u67A5\uFF0C\u5FD7\u5728\u5343\u91CC\u3002\u6A2A\u626B\u9965\u997F\uFF0C\u505A\u56DE\u81EA\u5DF1\u3002 \u4EF0\u5929\u5927\u7B11\u51FA\u95E8\u53BB\uFF0C\u5F52\u6765\u501A\u6756\u81EA\u53F9\u606F\u3002 \u5782\u6B7B\u75C5\u4E2D\u60CA\u5750\u8D77\uFF0C\u7B11\u95EE\u5BA2\u4ECE\u4F55\u5904\u6765\u3002 \u5341\u5E74\u751F\u6B7B\u4E24\u832B\u832B\uFF0C\u559C\u7F8A\u7F8A\u4E0E\u7070\u592A\u72FC\u3002 \u8FDC\u8D74\u4EBA\u95F4\u60CA\u9E3F\u5BB4\uFF0C\u9B3C\u5200\u4E00\u5F00\u770B\u4E0D\u89C1\u3002 \u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5BF9\u955C\u8D34\u82B1\u9EC4\u3002 \u4E00\u671D\u88AB\u86C7\u54AC\uFF0C\u5904\u5904\u95FB\u557C\u9E1F\u3002 \u67AF\u85E4\u8001\u6811\u660F\u9E26\uFF0C\u4E0A\u73ED\u6478\u9C7C\u56DE\u5BB6\uFF01 \u8BFB\u4E66\u7834\u4E07\u5377\uFF0C\u5377\u5377\u6709\u7237\u540D\u3002 \u60C5\u4E0D\u77E5\u6240\u8D77\uFF0C\u4E00\u5F80\u60C5\u6DF1\uFF0C\u518D\u800C\u8870\uFF0C\u4E09\u800C\u7AED\u3002 \u5929\u5802\u6709\u8DEF\u4F60\u4E0D\u8D70\uFF0C\u5B66\u6D77\u65E0\u6DAF\u82E6\u4F5C\u821F\u3002 \u5C11\u5C0F\u79BB\u5BB6\u8001\u5927\u56DE\uFF0C\u5B89\u80FD\u8FA8\u6211\u662F\u96C4\u96CC\u3002 \u5DF4\u5C71\u695A\u6C34\u51C4\u51C9\u5730\uFF0C\u871C\u96EA\u51B0\u57CE\u751C\u871C\u871C\u3002 \u543E\u8F88\u7537\u513F\u5F53\u81EA\u5F3A\uFF0C\u5403\u4E2A\u6843\u6843\u597D\u51C9\u51C9\u3002 \u4EAC\u4E2D\u6709\u5584\u53E3 J \u8005\uFF0C\u4ECE\u6B64\u541B\u738B\u4E0D\u65E9\u671D\u3002\\r\\n\\r\\n\u5B9D\u85CF\\r\\n\\r\\nnone #include<windows.h> using namespace std; int main(){ system(\\"A 10\\");\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/user/972)\\r\\n\\r\\n| 1 | 2 | 3 |\\r\\n| ------ | --- | --- |\\r\\n| baga | |\\r\\n| |\\r\\n\\r\\n[https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru](https://moe-counter.glitch.me/get/@dashenqinglai?theme=moebooru)\\r\\n\\r\\n[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)\\r\\n\\r\\n[https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif](https://i.loli.net/2018/10/29/5bd644bb4f0ba.gif)\\r\\n\\r\\n[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)\\r\\n\\r\\n[https://sr.mihoyo.com/](https://sr.mihoyo.com/)\\r\\n\\r\\n\u6211\u542C\u5230\u4E86\u3010\u751F\u751F\u4E0D\u606F\u3011\u7684\u6FC0\u8361\uFF0C\u542C\u5230\u4E86\u3010\u5929\u884C\u5065\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7834\u4E07\u6CD5\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u66FF\u7F6A\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u547C\u5524\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u79BB\u6790\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u53CC\u751F\u82B1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7206\u71C3\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u5F3A\u8FD0\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u63A2\u56CA\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u8DC3\u8FC1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u52B2\u98CE\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u4F20\u97F3\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u8D64\u708E\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u4E0D\u706D\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u6FC0\u53D1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u9B42\u8FC1\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u7075\u55C5\u3011\u7684\u56DE\u54CD\uFF0C\u542C\u5230\u4E86\u3010\u593A\u9B42\u9B44\u3011\u7684\u56DE\u54CD\u3002\\r\\n\\r\\n~~ctrl+c\u662F\u4E2A\u597D\u4E1C\u897F~~\\r\\n\\r\\n~~\u6700\u5B89\u53F2\u4E4B\u4E71~~ \u6700\u6709\u5E72\u8D27\u7684\u4E00\u96C6\\r\\n\\r\\n# \u60A8\u662F\u7B2C114514\u4E2A\u6765\u53C2\u89C2\u7684\u4EBA\\r\\n\\r\\n\\r\\n\\r\\n         \\r\\n\\r\\n  [\u6362\u4E00\u6279](https://oj.qdturing.cn/d/Neptune/user/2796)\\r\\n\\r\\n\\r\\n\\r\\n```none\\r\\n\u4F60\u2026\u2026\\r\\n\u5C45\u7136\u770B\u5B8C\u4E86\uFF1F\uD83C\uDF1A\\r\\n*\u4E0B\u9762\u6CA1\u6709\u4E1C\u897F\u4E86\uD83D\uDC47**\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n## **\u4FE1\u5965\u6BD4\u8D5B**\\r\\n\\r\\n\u200B**OI**\u200B(Olympiad Informatics)\uFF1A\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\\r\\n\\r\\n\u200B**OIer**\u200B\uFF1A\u53C2\u52A0\u4FE1\u606F\u5B66\u5965\u8D5B\u7684\u9009\u624B\\r\\n\\r\\n\u200B**OJ**\u200B(Online Judge)\uFF1A\u5728\u7EBF\u5224\u9898\u7CFB\u7EDF\\r\\n\\r\\n**CSP-J/S** \uFF1A\u7531 CCF \u4E3B\u529E\u7684\u8BA1\u7B97\u673A\u975E\u4E13\u4E1A\u7EA7\u522B\u7684\u8F6F\u4EF6\u80FD\u529B\u8BA4\u8BC1\u3002\u8BA4\u8BC1\u5305\u62EC CSP-J\uFF08Junior\uFF0C\u5165\u95E8\u7EA7\uFF09\u548C CSP-S\uFF08Senior\uFF0C\u63D0\u9AD8\u7EA7\uFF09\u4E24\u4E2A\u7EA7\u522B\uFF0C\u8BA4\u8BC1\u5185\u5BB9\u5747\u5305\u62EC\u7B97\u6CD5\u8BBE\u8BA1\u80FD\u529B\u548C\u7F16\u7A0B\u80FD\u529B\u3002\\r\\n\\r\\n\u200B**NOIP**\u200B\uFF1A\u5168\u56FD\u9752\u5C11\u5E74\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u8054\u8D5B(National Olympiad in Informatics in Provinces)\u3002\u540C\u4E00\u65F6\u95F4\u3001\u4E0D\u540C\u5730\u70B9\u4EE5\u5404\u7701\u5E02\u4E3A\u5355\u4F4D\u7531\u7279\u6D3E\u5458\u7EC4\u7EC7\u3002\u5168\u56FD\u7EDF\u4E00\u5927\u7EB2\u3001\u7EDF\u4E00\u8BD5\u5377\u3002\\r\\n\\r\\n\u200B**NOI\u7701\u9009**\u200B\uFF1A\u6BCF\u5E74 NOI \u4E3E\u529E\u4E4B\u524D\uFF0C\u5404\u7701\u9700\u5206\u7701\u8FDB\u884C\u7701\u4EE3\u8868\u961F\u9009\u62D4\uFF0C\u4ECE\u800C\u786E\u5B9A\u54EA\u4E9B\u9009\u624B\u83B7\u5F97\u672C\u7701\u53C2\u52A0 NOI \u7684\u540D\u989D\u3002\\r\\n\\r\\n\u200B**NOI**\u200B\uFF1A\u5168\u56FD\u9752\u5C11\u5E74\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\uFF0C\u5373\u56FD\u8D5B\u3002\\r\\n\\r\\n\u200B**CTSC**\u200B\uFF1A\u56FD\u5BB6\u961F\u9009\u62D4\u6BD4\u8D5B\uFF0C\u9009\u51FA\u53C2\u52A0IOI\u7684\u56FD\u5BB6\u961F\u7684\u6BD4\u8D5B\u3002\\r\\n\\r\\n\u200B**IOI**\u200B\uFF1A\u56FD\u9645\u4FE1\u606F\u5B66\u5965\u6797\u5339\u514B\u7ADE\u8D5B\uFF0C\u5168\u7403\u7684\u6BD4\u8D5B\uFF0COI\u6700\u9AD8\u8363\u8A89\\r\\n\\r\\n## **\u6BD4\u8D5B\u7ED3\u679C**\\r\\n\\r\\n**\u4E00\u9053\u9898\u76EE\u63D0\u4EA4\u540E\uFF0C\u53EF\u80FD\u5F97\u5230\u4E24\u4E2A\u7ED3\u679C\uFF1A**\\r\\n\\r\\n\u200B**AC**\u200B\uFF1AAccepted \u7B54\u6848\u6B63\u786E/\u901A\u8FC7\\r\\n\\r\\n\u200B**WA**\u200B\uFF1AWrong Answer \u7B54\u6848\u9519\u8BEF\\r\\n\\r\\n**\u9664\u6B64\u4E4B\u5916\u8FD8\u6709\u66F4\u591A\u7684\u72B6\u6001\u7F29\u5199\uFF1A**\\r\\n\\r\\n\u200B**UKE**\u200B\uFF1AUnknown Error \u672A\u77E5\u9519\u8BEF\\r\\n\\r\\n\u200B**RE**\u200B\uFF1ARuntime Error \u8FD0\u884C\u65F6\u9519\u8BEF\\r\\n\\r\\n\u200B**CE**\u200B\uFF1AComplie Error \u7F16\u8BD1\u9519\u8BEF\uFF0C\u8BED\u6CD5\u6709\u95EE\u9898\\r\\n\\r\\n\u200B**PE**\u200B\uFF1APresentation Error \u683C\u5F0F\u9519\u8BEF\\r\\n\\r\\n\u200B**TLE**\u200B\uFF1ATime Limit Exceed \u8D85\u51FA\u65F6\u95F4\u9650\u5236\uFF0C\u9700\u8981\u4F18\u5316\u4F60\u7684\u7B97\u6CD5\\r\\n\\r\\n\u200B**MLE**\u200B\uFF1AMemory Limit Exceed \u8D85\u51FA\u5185\u5B58\u9650\u5236\\r\\n\\r\\n\u200B**OLE**\u200B\uFF1AOutput Limit Exceed \u8F93\u51FA\u8D85\u51FA\u9650\u5236\\r\\n\\r\\n## **\u4FE1\u5965\u505A\u9898\u6280\u5DE7**\\r\\n\\r\\n\u200B**\u9A97\u5206**\u200B\uFF1A\u5C31\u662F\u7528\u4E0D\u662F\u6B63\u89E3\u7684\u7A0B\u5E8F\uFF08\u4FDD\u8BC1\u6211\u4EEC\u80FD\u8F7B\u677E\u641E\u5B9A\u7684\u7A0B\u5E8F\uFF09\uFF0C\u5C3D\u53EF\u80FD\u591A\u5F97\u9A97\u53D6\u5206\u6570\u3002\\r\\n\\r\\n\u200B**\u66B4\u529B\u89E3\u9898**\u200B\uFF1A\u672C\u8D28\u662F\u5217\u4E3E\u6CD5\uFF1B\u5C31\u7406\u8BBA\u4E0A\u800C\u8A00\uFF0C\u5B83\u53EF\u4EE5\u89E3\u51B3\u6240\u6709\u95EE\u9898\uFF0C\u53EA\u662F\u65F6\u95F4\u7684\u957F\u77ED\u95EE\u9898\u7F62\u4E86\u3002\u4F46\u5BF9\u4E8E\u201C\u66B4\u529B\u6C42\u89E3\u6CD5\u201D\u4E5F\u662F\u53EF\u4EE5\u8FDB\u884C\u4F18\u5316\u7684\uFF0C\u6211\u4EEC\u59D1\u4E14\u79F0\u4F18\u5316\u540E\u7684\u201C\u66B4\u529B\u6C42\u89E3\u6CD5\u201D\u4E3A\u201C\u5DE7\u66B4\u201D\u3002\\r\\n\\r\\n\u5177\u4F53\u7684\u64CD\u4F5C\u65B9\u6CD5\u5C31\u662F\u5145\u5206\u5229\u7528\u7EA6\u675F\u6761\u4EF6\uFF0C\u4EE5\u7F29\u5C0F\u7B97\u6CD5\u8BA1\u7B97\u7684\u8303\u56F4\u3002\\r\\n\\r\\n\uFF081\uFF09\u5229\u7528\u9898\u76EE\u4E2D\u7684\u7B49\u5F0F\u6761\u4EF6\\r\\n\\r\\n\uFF082\uFF09\u5229\u7528\u9898\u76EE\u4E2D\u7684\u4E0D\u7B49\u5F0F\u6761\u4EF6\uFF0C\u8FDB\u884C\u6570\u5B66\u4E2D\u4E0D\u7B49\u5F0F\u7684\u7F29\u653E\\r\\n\\r\\n\u200B**\u5BF9\u62CD**\u200B\uFF1A\u7528\u4E00\u4E2A\u7B80\u5355\u7684\u7A0B\u5E8F\u53BB\u68C0\u6D4B\u4E00\u4E2A\u590D\u6742\u7684\u7A0B\u5E8F\u3002\u7B80\u5355\u7684\u8BF4\u5C31\u662F\u5F53\u4F60\u5199\u5B8C\u4E00\u4E2A\u9898\u76EE\u7684\u7A0B\u5E8F\u4EE5\u540E\uFF0C\u518D\u5199\u4E00\u4E2A\u66B4\u529B\u6C42\u89E3\u8BE5\u9898\u76EE\u7684\u7A0B\u5E8F\uFF0C\u7136\u540E\u81EA\u5DF1\u751F\u6210\u4E00\u4E9B\u6D4B\u8BD5\u6570\u636E\uFF0C\u770B\u540C\u6837\u7684\u6570\u636E\uFF0C\u4E24\u4E2A\u7A0B\u5E8F\u8F93\u51FA\u7684\u7ED3\u679C\u662F\u5426\u76F8\u540C\uFF0C\u4E0D\u540C\u610F\u5473\u7740\u88AB\u5BF9\u62CD\u7684\u7A0B\u5E8F\u6709\u95EE\u9898\u3002\u4EE5\u6B64\u6765\u5E2E\u52A9\u4F60\u4FEE\u6539\u7A0B\u5E8F\uFF0C\u63D0\u9AD8\u901A\u8FC7\u7387\u7684\u65B9\u6CD5\uFF0C\u6211\u4EEC\u79F0\u4E3A\u5BF9\u62CD\u3002\\r\\n\\r\\n## **\u4FE1\u5965\u9009\u624B\u5F3A\u5F31**\\r\\n\\r\\n\u200B**\u849F\u84BB**\u200B\uFF1A\u5DE8\u5F31\u7684\u8C10\u97F3\uFF0C\u7528\u4E8EOIer\u81EA\u8C26\uFF0C\u51E0\u4E4E\u6240\u6709\u4EBA\uFF08\u54EA\u6015\u662F\u5927\u4F6C\uFF09\u90FD\u4F1A\u7528\u8FD9\u4E2A\u8BCD\u79F0\u547C\u81EA\u5DF1\u3002\\r\\n\\r\\n\u200B**\u795E\u7287**\u200B\uFF1A\u5373\u5F88\u5389\u5BB3\u7684\u5927\u725B\\r\\n\\r\\n\u200B**AK**\u200B\uFF1A\u5728\u4E00\u6B21\u6BD4\u8D5B\u91CCAC\u4E86\u6240\u6709\u9898\\r\\n\\r\\n\u200B**\u7206\u96F6**\u200B\uFF1A\u5728\u4E00\u6B21\u6BD4\u8D5B\u4E2D\u559C\u63D00\u5206\\r\\n\\r\\n\u4EC0\u4E48\u4F60\u5C45\u7136\u770B\u5B8C\u4E86\uFF1F*\uD83C\uDF1A*\\r\\n\\r\\n\u7262\u5927\u65F6\u95F4 *\uD83C\uDF1A* \u554A\u7262\u5927\u522B\u8098\u51FB\u6211\uD83D\uDE2B\uD83D\uDCAA\uD83C\uDFFF\uD83D\uDC68\uD83C\uDFFF\u200D\uD83E\uDDB2\u5B69\u5B50\u4EEC\u8FD9\u5E76\u4E0D\u597D\u7B11\\r\\n\\r\\nIt\'s been a long day without you my friend\\r\\n\\r\\nAnd I\'ll tell you all about it when I see you again\\r\\n\\r\\nWe\'ve come a long way from where we began\\r\\n\\r\\nOh I\'ll tell you all about it when I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\nDamn who knew all the planes we flew\\r\\n\\r\\nGood things we\'ve been through\\r\\n\\r\\nThat I\'ll be standing right here\\r\\n\\r\\nTalking to you about another path\\r\\n\\r\\nI know we loved to hit the road and laugh\\r\\n\\r\\nBut something told me that it wouldn\'t last\\r\\n\\r\\nHad to switch up look at things different see the bigger picture\\r\\n\\r\\nThose were the days hard work forever pays\\r\\n\\r\\nNow I see you in a better place\\r\\n\\r\\nNow I see you in a better place\\r\\n\\r\\nHow could we not talk about family\\r\\n\\r\\nwhen family\'s all that we got?\\r\\n\\r\\nEverything I went through you were standing there by my side\\r\\n\\r\\nAnd now you gonna be with me for the last ride\\r\\n\\r\\nIt\'s been a long day without you my friend\\r\\n\\r\\nAnd I\'ll tell you all about it when I see you again\\r\\n\\r\\nWe\'ve come a long way from where we began\\r\\n\\r\\nOh I\'ll tell you all about it when I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\nWhen I see you again\\r\\n\\r\\n\u4EC0\u4E48\u2193\u2191\\r\\n\\r\\n\u4F60\u5C45\u7136\u53C8\u770B\u5B8C\u4E86\uFF1F*\uD83C\uDF1A*\\r\\n\\r\\n\u7262\u5927\u5FEB\u8098\u51FB\u5B83 \uD83D\uDCA9\uD83D\uDCAA\uD83C\uDFFF\uD83D\uDC68\uD83C\uDFFF\u200D\uD83E\uDDB2\\r\\n\\r\\n@\u4F20\u5947\u673A\u957F\u4F50\u5DF4\u626C\\r\\n\\r\\n* **Waiting** \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u6B63\u5728\u7B49\u5F85\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\\r\\n* **Fetched** \u8BC4\u6D4B\uFF1A\u8BC4\u6D4B\u8BF7\u6C42\u5DF2\u88AB\u8BC4\u6D4B\u673A\u6293\u53D6\uFF0C\u6B63\u5728\u51C6\u5907\u5F00\u59CB\u8BC4\u6D4B\\r\\n* **Compiling** \u8BC4\u6D4B\uFF1A\u6B63\u5728\u7F16\u8BD1\u4E2D\\r\\n* **Judging** \u8BC4\u6D4B\uFF1A\u7F16\u8BD1\u6210\u529F\uFF0C\u6B63\u5728\u8BC4\u6D4B\u4E2D\\r\\n* **Accepted** \u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u5B8C\u5168\u6B63\u786E\\r\\n* **Wrong Answer** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8F93\u51FA\u4E0E\u6807\u51C6\u7B54\u6848\u4E0D\u4E00\u81F4\uFF08\u4E0D\u5305\u62EC\u884C\u672B\u7A7A\u683C\u4EE5\u53CA\u6587\u4EF6\u672B\u7A7A\u884C\uFF09\\r\\n* **Time Limit Exceeded** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236\\r\\n* **Memory Limit Exceeded** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u5185\u5B58\u7A7A\u95F4\u8D85\u8FC7\u4E86\u9898\u76EE\u9650\u5236\\r\\n* **Runtime Error** \u4E0D\u901A\u8FC7\uFF1A\u7A0B\u5E8F\u8FD0\u884C\u65F6\u9519\u8BEF\uFF08\u5982\u6570\u7EC4\u8D8A\u754C\u3001\u88AB\u96F6\u9664\u3001\u8FD0\u7B97\u6EA2\u51FA\u3001\u6808\u6EA2\u51FA\u3001\u65E0\u6548\u6307\u9488\u7B49\uFF09\\r\\n* **Compile Error** \u4E0D\u901A\u8FC7\uFF1A\u7F16\u8BD1\u5931\u8D25\\r\\n* **System Error** \u9519\u8BEF\uFF1A\u7CFB\u7EDF\u9519\u8BEF\uFF08\u5982\u679C\u60A8\u9047\u5230\u6B64\u95EE\u9898\uFF0C\u8BF7\u53CA\u65F6\u5728\u8BA8\u8BBA\u533A\u8FDB\u884C\u53CD\u9988\uFF09\\r\\n* **Canceled** \u5176\u4ED6\uFF1A\u8BC4\u6D4B\u88AB\u53D6\u6D88\\r\\n* **Unknown Error** \u5176\u4ED6\uFF1A\u672A\u77E5\u9519\u8BEF\\r\\n* **Ignored** \u5176\u4ED6\uFF1A\u88AB\u5FFD\u7565\\r\\n\\r\\n> \u6709\u201C\u6210\u7EE9\u53D6\u6D88\u201D\u5B57\u6837\u5219\u8BF4\u660E\u7BA1\u7406\u5458\u624B\u52A8\u6807\u8BB0\u6B64\u8BB0\u5F55\u4E3A\u53D6\u6D88\uFF0C\u53EF\u80FD\u8FDD\u53CD\u4E86\u670D\u52A1\u6761\u6B3E\uFF0C\u6BD4\u5982\u4EE3\u7801\u88AB\u53D1\u73B0\u4E0E\u5176\u4ED6\u7528\u6237\u7684\u4EE3\u7801\u5341\u5206\u76F8\u4F3C\u3002\\r\\n\\r\\n**\u88F8\u5BB9\u91CF\uFF08Raw Capacity\uFF09** - \u786C\u76D8\u7684\u539F\u59CB\u5BB9\u91CF\u603B\u548C\uFF0C\u6BD4\u5982\u670910\u575710TB\u7684\u786C\u76D8\uFF0C\u90A3\u88F8\u5BB9\u91CF\u5C31\u662F10\\\\*10TB=100TB **\u53EF\u7528\u5BB9\u91CF\uFF08Usable Capacity/u\uFF09** - \u524D\u7AEF\u80FD\u591F\u770B\u5230\u7684\u5BB9\u91CF\uFF0C\u9664\u5F00\u4E86RAID\u548C\u7CFB\u7EDF\u5F00\u9500\u7684\u5BB9\u91CF\uFF0C\u6BD4\u598210\\\\*10TB\u786C\u76D8\uFF0C\u7EC4\u4E86\u4E2A9+1\u7684RAID 5\uFF0C\u90A3\u7406\u8BBA\u4E0A\u53EF\u7528\u5BB9\u91CF\u5E94\u8BE5\u4E3A90TB\uFF0C\u4F46\u662F\u4E00\u822C\u5B58\u50A8\u9635\u5217\u8FD8\u6709\u7CFB\u7EDF\u5F00\u9500\uFF0C\u4E0D\u540C\u5382\u5BB6\u4E0D\u540C\u578B\u53F7\u5F00\u9500\u4E0D\u540C\uFF0C\u6240\u4EE5\u6700\u7EC8\u7684\u53EF\u7528\u5BB9\u91CF\u4E5F\u4E0D\u4E00\u6837\uFF0C\u6709\u53EF\u80FD70TB\uFF0C\u4E5F\u53EF\u80FD80TB\u3002\u53E6\u5916\uFF0C\u53EF\u7528\u5BB9\u91CF\u4E5F\u53EF\u4EE5\u5728\u540E\u9762\u8DDF\u4E00\u4E2A**\u5C0F\u5199u**\u6765\u8868\u793A\uFF0C\u6BD4\u5982100TBu\uFF0C\u5C31\u8868\u793A100TB\u53EF\u7528\u5BB9\u91CF\u200B**\u6709\u6548\u5BB9\u91CF\uFF08Effective Capacity/e\uFF09**\u200B- \u91C7\u7528\u5728\u7EBF\u6570\u636E\u5220\u51CF\u6280\u672F\uFF08\u91CD\u5220deduplication/\u538B\u7F29compression\u4E4B\u540E\uFF09\u53EF\u4E3A\u524D\u7AEF\u63D0\u4F9B\u7684\u201C\u7B49\u6548\u201D\u5BB9\u91CF\u3002\u6BD4\u5982\u67D0\u6574\u5217\u80FD\u63D0\u4F9B3:1\u7684\u6570\u636E\u5220\u51CF\u6BD4\uFF0C\u6B64\u65F6100TBu\u5C31\u76F8\u5F53\u4E8E\u80FD\u5B58300TB\u7684\u6570\u636E\uFF0C\u6240\u4EE5\u6709\u6548\u5BB9\u91CF\u5C31\u662F300TB\u3002\u6709\u6548\u5BB9\u91CF\u4E5F\u53EF\u4EE5\u5728\u540E\u9762\u8DDF\u4E00\u4E2A**\u5C0F\u5199e**\u8868\u793A\uFF0C300TBe\u8868\u793A300TB\u6709\u6548\u5BB9\u91CF\u3002\\r\\n\\r\\n**TB,TiB, GB,GiB, MB, MiB, KB, KiB** \u7B80\u5355\u5F97\u8BF4 TB,GB\u8FD9\u4E9B\u662F1000\u8FDB\u5236\uFF0C1TB=1000 GB TiB GiB\u8FD9\u4E9B\u662F1024\u8FDB\u5236\uFF0C1TiB = 1024GiB TiB\u548CTB\u4E4B\u95F4\u6362\u7B97\uFF1A 1TiB = 1.099511627776 TB \uFF08\u5177\u4F53\u6362\u7B97\u8FC7\u7A0B\u5C31\u4E0D\u5199\u4E86\uFF0C\u81EA\u5DF1\u62FF\u4E2A\u5C0F\u672C\u672C\u7B97\uFF09 TB\uFF08Terabyte\uFF09 \u662F\u56FD\u9645\u5355\u4F4D\u5236 International System of Units (SI).\u662F\u5341\u8FDB\u5236\uFF0C\u5305\u62EC\uFF1Akilo, mega, giga, tera, peta, exa, zetta and yotta TiB(Tebibyte\uFF09\u662FInternational Electrotechnical Commission (IEC) \u5355\u4F4D\uFF0C\u662F\u4E8C\u8FDB\u5236\uFF0C\u5305\u62EC\uFF1Akibi, mebi, gibi, pebi, exbi, zebi and yobi\\r\\n\\r\\n**\u90A3\u4E48\u95EE\u9898\u6765\u4E86\uFF0C\u6211\u4EEC\u901A\u5E38\u770B\u5230\u7684TB\u5230\u5E95\u662F1024\u8FD8\u662F1000\u5462\uFF1F\u4E3A\u4EC0\u4E48\u6709\u8BA9\u4EBA\u8FD9\u4E48\u6DF7\u6DC6\u7684\u5355\u4F4D\u5462\uFF1F\u6211\u4E00\u5757400G\u7684\u786C\u76D8\uFF0C\u4E3A\u4EC0\u4E48\u5728\u7CFB\u7EDF\u4E2D\u663E\u793A\u53EA\u6709372G\u5462\uFF1F\u662F\u6709\u65E0\u826F\u5546\u5BB6\u5077\u5BB9\u91CF\u5417\uFF1F** \u8FD9\u4E2A\u95EE\u9898\u5C31\u8981\u6162\u6162\u9053\u6765\u4E86\uFF1A \u5F88\u4E45\u5F88\u4E45\u4EE5\u524D\uFF0C1956\u5E74\uFF0C\u5728\u6BDB\u4E3B\u5E2D\u505A\u4E86\u300A\u8BBA\u5341\u5927\u5173\u7CFB\u300B\u8BB2\u8BDD\u540E\u51E0\u4E2A\u6708\uFF0C\u5927\u6D0B\u5F7C\u5CB8\u7684IBM\u516C\u53F8\u63A8\u51FA\u4E86\u7B2C\u4E00\u6B3E\u5546\u7528\u786C\u76D8 IBM 350.\u8FD9\u4E2A\u78C1\u76D8\u5C31\u67091.5\u5E73\u65B9\u7C73\u7684\u5927\u5BB6\u4F19\uFF0C\u914D\u7F6E\u4E8650\u4E2A\u7269\u7406\u201C\u76D8\u7247Platter\u201D,\u67095\u4E07\u4E2A\u6247\u533ASector\uFF0C\u6BCF\u4E2A\u6247\u533A100\u4E2A\u5B57\u7B26\uFF08alphanumeric characters\uFF09\uFF0C\u603B\u5BB9\u91CF\u4E3A5\u767E\u4E07\u5B57\u7B26\uFF085 million characters\uFF09 \u6240\u4EE5\u4F60\u4EE5\u4E3A\u78C1\u76D8\u662F\u5B58\u4E8C\u8FDB\u5236\u4EE3\u7801\u7684\u5C31\u53EA\u80FD\u548C\u4E8C\u8FDB\u5236\u5BF9\u5E94\u5417\uFF1F\u4F60\u770B\u770B\u8FD9\u5168\u7403\u7B2C\u4E00\u4E2A\u786C\u76D8\uFF0C\u54EA\u4E2A\u6570\u636E\u662F2\u6B21\u5E42\u6765\u7B97\u7684\uFF1F \u540E\u6765\u7684\u786C\u76D8\u90FD\u662F\u6309\u7167\u5341\u8FDB\u5236\u6765\u6807\u8BC6\u5BB9\u91CF\uFF0C\u6240\u4EE5\u5E76\u4E0D\u662F\u5382\u5BB6\u5077\u5BB9\u91CF\u4E5F\u4E0D\u662F\u5382\u5BB6\u5355\u72EC\u641E\u4E86\u4E00\u4E2A1000\u8FDB\u5236\u3002\\r\\n\\r\\n**\u4E3A\u4EC0\u4E48\u64CD\u4F5C\u7CFB\u7EDF\u4E2D\u663E\u793A\u7684\u5BB9\u91CF\u6BD4\u786C\u76D8\u6807\u8BC6\u7684\u5BB9\u91CF\u5C11\u5462\uFF1F** \u662F\u7684\uFF0C\u4F60\u5DF2\u7ECF\u77E5\u9053\u7B54\u6848\u4E86\uFF0C\u786C\u76D8\u7684\u5BB9\u91CF\u662F\u7528\u5341\u8FDB\u5236\u6807\u8BC6\u7684\uFF0C\u800C\u64CD\u4F5C\u7CFB\u7EDF\u662F\u7528\u4E8C\u8FDB\u5236\u8BA1\u7B97\u7684\uFF0C\u76F8\u5F53\u4E8E\u628AGB\u6362\u7B97\u6210\u4E86GiB\uFF0C\u5F53\u7136\u5C31\u5C11\u4E86\u3002\\r\\n\\r\\n**\u90A3\u64CD\u4F5C\u7CFB\u7EDF\u62BD\u4EC0\u4E48\u98CE\u8981\u7528\u4E8C\u8FDB\u5236\u6765\u8BA1\u7B97\u5462\uFF1F** \u90A3\u662F\u56E0\u4E3ARAM\u5C31\u662F\u5185\u5B58\u6761\u8FD9\u4E1C\u897F\u7684\u5BB9\u91CF\u5374\u53C8\u662F\u7528\u4E8C\u8FDB\u5236\u6807\u8BC6\u7684\uFF0C\u5C31\u662F\u8BF41GB\u7684\u5185\u5B58\u662F\u7B49\u4E8E1024MB. \u6240\u4EE5Windows\u5C31\u91C7\u7528\u4E861024\u6765\u505A\u7684\u5BB9\u91CF\u7684\u8FDB\u5236\uFF0C\u8FD9\u6837\u5185\u5B58\u6761\u7684\u5BB9\u91CF\u663E\u793A\u662F\u6B63\u786E\u7684\uFF0C\u78C1\u76D8\u5BB9\u91CF\u663E\u793A\u5C31\u548C\u5382\u5BB6\u7684\u4E0D\u4E00\u81F4\u4E86\u3002\u5176\u5B9EWindows\u53EF\u4EE5\u6539\u8FDB\u4E00\u4E0B\uFF0C\u6BD4\u5982\u8BB2\u5185\u5BB9\u7684\u5BB9\u91CF\u663E\u793A\u4E3ATiB, \u78C1\u76D8\u5BB9\u91CF\u663E\u793A\u4E3ATB\uFF0C\u8FD9\u6837\u5C31\u5BF9\u5F97\u4E0A\u4E86\u3002\\r\\n\\r\\n**1000\u548C1024\u662F\u4EC0\u4E48\u65F6\u5019\u5F00\u59CB\u7528\u6DF7\u7684\u5462\uFF1F\u6211\u4EEC\u8BE5\u600E\u4E48\u533A\u5206\u5462\uFF1F** \u602A\u5C31\u602A\u9020\u5185\u5B58\u6761\u7684\u65F6\u5019\u592A\u65E9\u4E86\uFF0C1952\u5E74\uFF0C\u6211\u4EEC\u6297\u7F8E\u63F4\u671D\u8FD8\u6CA1\u6253\u5B8C\u3002\u5F53\u65F6\u7684\u5355\u4F4D\u53EA\u6709SI\u4E5F\u5C31\u662F\u5341\u8FDB\u5236\uFF0C\u90A3\u65F6\u5019\u5BB9\u91CF\u4E5F\u4E0D\u5927\uFF0C1024\u548C1000\u4E5F\u5DEE\u4E0D\u4E86\u591A\u5C11\u6240\u4EE5\u5C31\u51D1\u5408\u4E86\u3002\u540E\u6765\u5BB9\u91CF\u8D8A\u6765\u8D8A\u5927\uFF0C\u6211\u4E70\u5757100TB\u7684\u786C\u76D8\uFF0C\u7ED3\u679C\u53EA\u670990.9TB\uFF0C\u5C11\u4E86\u5C06\u8FD110TB\uFF0C\u8FD9\u8FD8\u4E0D\u5403\u5B98\u53F8\u554A\u3002\u6240\u4EE5\u57281998\u5E74\uFF08\u6297\u7F8E\u63F4\u671D\u5DF2\u7ECF\u7ED3\u675F\u4E86N\u591A\u5E74\uFF09\uFF0CIEC\u624D\u5B9A\u4E49\u4E86\u4E8C\u8FDB\u5236\u7684\u5355\u4F4DTiB\uFF0CGiB\u8FD9\u5806\u3002 \u90A3\u4E48\u73B0\u57289021\u5E74\u4E86\uFF0C\u6211\u770B\u5230TB\u80AF\u5B9A\u662F1000\uFF0CTiB\u80AF\u5B9A\u662F1024\u5427\uFF1F\u5BF9\u4E0D\u8D77\uFF0C\u8FD8\u771F\u4E0D\u4E00\u5B9A\uFF0CTiB\u662F1024\u6CA1\u7684\u8DD1\uFF0C\u4F46TB\u5230\u5E95\u662F1000\u8FD8\u662F1024\u5462\uFF0C\u5728\u5185\u5B58\u4E0A\u662F1024\uFF0C\u5728\u5BB6\u7528\u786C\u76D8\u4E0A\u662F1000\uFF0C\u5176\u4ED6\u60C5\u51B5\u4E0B\u7531\u4E8E\u6DF7\u7528\u7684\u65F6\u95F4\u592A\u957F\u4E86\u5177\u4F53\u662F\u54EA\u4E2A\u53EA\u80FD\u6839\u636E\u4E0A\u4E0B\u6587\u53BB\u731C\uFF0C\u4F60\u884C\u7684\uFF01\u8FD0\u6C14\u597D\uFF0C\u4F1A\u78B0\u5230\u6CE8\u91CA\u8BF4\u660E\u8FD9\u4E2ATB\u662F\u5341\u8FDB\u5236\u8FD8\u662F\u4E8C\u8FDB\u5236\u3002\\r\\n\\r\\n\u6240\u6709\u5934\u6587\u4EF6: 1.\u9996\u5148\u662F\u6700\u65B9\u4FBF\u7684\u4E07\u80FD\u5934\u6587\u4EF6\uFF0C\u987E\u540D\u601D\u4E49\uFF0C\u53EF\u4EE5\u5C06\u5176\u7406\u89E3\u4E3A\u7236\u4EB2\u5934\u6587\u4EF6\uFF08\u9664\u4E86\u672C\u7BC7\u7B2C14\u4E2A\u5934\u6587\u4EF6\uFF09\u90FD\u5305\u542B \uFF08\u867D\u7136\u65B9\u4FBF\u4E86\u61D2\u4EBA\uFF0C\u4F46\u662F\u7F3A\u70B9\u4E5F\u5F88\u660E\u663E--\u8FD9\u4E00\u5934\u6587\u4EF6\u5F88\u5360\u7528\u5185\u5B58\uFF09\uFF1A #include<bits/stdc++.h>\\r\\n\\r\\n2.\u63A5\u7740\u4E5F\u662F\u6BD4\u8F83\u5E38\u7528\u7684\uFF0C\u4F5C\u7528\u4E8E\u6570\u636E\u6D41\u8F93\u5165\u8F93\u51FA cin>>\u548Ccout<<\uFF1A #include\\r\\n\\r\\n3.\u7136\u540E\u662F\u5404\u79CD\u7B97\u6CD5\u7684\u5934\u6587\u4EF6(\u4F8B\u5982sort\u51FD\u6570\u7B49)\uFF1A #include\\r\\n\\r\\n4.\u5173\u4E8E\u6570\u5B66\u51FD\u6570\u7684\u5934\u6587\u4EF6\uFF08\u4F8B\u5982max( )\uFF0Cmin( )\uFF0Cabs( )\u7B49\uFF09\uFF08\u4ECEC\u8BED\u8A00\u4E2D\u7684math.h\u7EE7\u627F\u800C\u6765\uFF09\uFF1A #include\\r\\n\\r\\n5.string\u5B57\u7B26\u4E32\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n6.\u63A5\u7740\u662FC\u8BED\u8A00\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n7.\u666E\u901A\u961F\u5217(\u53EA\u80FD\u4E00\u8FB9\u8FDB\u4E00\u8FB9\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n8.\u53CC\u5411\u961F\u5217(\u4E24\u8FB9\u90FD\u53EF\u4EE5\u8FDB\u51FA)(\u5148\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n9.\u6808(\u5148\u8FDB\u540E\u51FA\uFF0C\u540E\u8FDB\u5148\u51FA)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n10.\u5217\u8868\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n11.\u52A8\u6001\u6570\u7EC4(\u4E0D\u9700\u77E5\u9053\u8BE5\u6570\u7EC4\u7684\u6570\u91CF)\u7684\u5934\u6587\u4EF6: #include\\r\\n\\r\\n12.\u56FE\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n13.\u96C6\u5408(\u5185\u90E8\u81EA\u52A8\u6709\u5E8F\u4E14\u4E0D\u542B\u91CD\u590D\u5143\u7D20)\u7684\u5934\u6587\u4EF6\uFF1A #include\\r\\n\\r\\n14.\u63A7\u5236\u7535\u8111\u6216\u5C0F\u9ED1\u6846\u5934\u6587\u4EF6(\u4E0D\u5305\u542B\u5728\u4E07\u80FD\u5934\u4EF6)\uFF1A #include<windows.h>\\r\\n\\r\\n```none\\r\\n\u300A\u6EE1\u6C5FWA\u300B\\r\\nRE\u51B2\u51A0\uFF0CTLE\u5904\u3001\u6F47\u6F47\u96E8\u6B47\u3002\\r\\n\u62AC\u671B\u773C\uFF0C\u6EE1\u5929WA\uFF0C\u6012\u706B\u6FC0\u70C8\u3002\\r\\n\u4E09\u5341AC\u5C18\u4E0E\u571F\uFF0C\u516B\u5343\u63D0\u4EA4\u4E91\u548C\u6708\u3002\\r\\n\u83AB\u6284\u88AD\u3001\u6CA1\u4E86AC\u8BB0\u5F55\uFF0C\u7A7A\u60B2\u5207\u3002\\r\\n\\r\\nCE\u803B\uFF0C\u72B9\u672A\u96EA\u3002\\r\\n\u849F\u84BB\u6068\uFF0C\u4F55\u65F6\u706D\u3002\\r\\n\u9A7E\u7A0B\u5E8F\uFF0C\u8E0F\u7834\u9898\u76EE\u5217\u8868\u3002\\r\\n\u95ED\u773C\u5199\u51FA\u7701\u9009\u9898\uFF0C\u7B11\u8C08\u731B\u5237NOI\u3002\\r\\n\u5F85\u4ECE\u5934\u3001\u6536\u62FEA+B\uFF0C\u671D\u5929\u9619\u3002\\r\\n\\r\\n\\r\\n\u300A\u5C06\u5237\u9898\u300B\\r\\n\u541B\u4E0D\u89C1\uFF0C\u6D1B\u8C37\u4E4B\u9898\u5929\u4E0A\u6765\uFF0C\u590D\u6742\u5230\u6D77\u4E0D\u590D\u56DE\u3002\\r\\n\u541B\u4E0D\u89C1\uFF0C\u9AD8\u5802\u660E\u955C\u60B2\u767D\u53D1\uFF0C\u671D\u5982\u9752\u4E1D\u66AE\u6210\u96EA\u3002\\r\\n\u4EBA\u751FWAWA\u987B\u5C3D\u601D\uFF0C\u83AB\u4F7F\u7535\u8111\u7A7A\u5BF9\u9898\u3002\\r\\n\u5929\u751F\u6211\u6750\u6CA1\u6709\u7528\uFF0C\u5343\u65B9\u767E\u8BA1\u8FD8RE\u3002\\r\\nAC\u4E00\u70B9\u4E14\u4E3A\u4E50\uFF0C\u4F1A\u987B\u4E00\u5237\u4E09\u767EWA\u3002\\r\\n\u543E\u56E2\u53CB\uFF0C\u725B\u5927\u4F6C\uFF0C\u5C06\u5237\u9898\uFF0C\u624B\u83AB\u505C\uFF01\uFF01\uFF01\\r\\n\u4E0E\u9898\u505A\u4E00\u904D\uFF0C\u8BF7\u7CFB\u7EDF\u4E3A\u849F\u84BB\u4EE5\u6D4B\u8BC4\u3002\\r\\n\u5929\u5929WAWA\u4E0D\u8DB3\u8D35\uFF0C\u4F46\u613F\u957F\u7720\u4E0D\u590D\u9192\uFF01\uFF01\uFF01\\r\\n\u53E4\u6765\u5927\u4F6C\u7686\u5237\u9898\uFF0C\u60DF\u6709\u849F\u84BB\u6C34\u7287\u7287\u3002\\r\\n\u7AD9\u957F\u6614\u65F6\u4E07AC\uFF0C\u6597\u9898\u5341\u5343\u6063\u6B22\u8C11\u3002\\r\\n\u4E3B\u4EBA\u4F55\u4E3A\u8A00AC\uFF1F\u5F84\u987B\u6CBD\u53D6\u5BF9\u541BWA\u3002\\r\\nTLE\uFF0CMLE\uFF0COLE\uFF0CUKE\uFF0CWA\uFF0CPC\uFF0CCE\u548CRE\u3002\\r\\n\u547C\u513F\u5C06\u51FA\u6362AK\uFF0C\u4E0E\u5C14\u540C\u9500\u4E07\u53E4\u6101\uFF01\uFF01\uFF01\\r\\n\\r\\n\u300A\u897F\u6C5F\u6708\xB7\u8BC1\u660E\u300B\\r\\n\u5373\u5F97\u6613\u89C1\u5E73\u51E1\uFF0C\u4EFF\u7167\u4E0A\u4F8B\u663E\u7136\u3002\u7559\u4F5C\u4E60\u9898\u7B54\u6848\u7565\u3002\u8BFB\u8005\u81EA\u8BC1\u4E0D\u96BE\u3002\\r\\n\u53CD\u4E4B\u4EA6\u7136\u540C\u7406\uFF0C\u63A8\u8BBA\u81EA\u7136\u6210\u7ACB\u3002\u7565\u53BB\u8FC7\u7A0BQED\u3002\u7531\u4E0A\u53EF\u77E5\u8BC1\u6BD5\u3002\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n\u6211\u4ECE\u5341\u4E8C\u5C81\u8D77\uFF0C\u4FBF\u5728\u6D1B\u8C37\u7684\u849F\u84BB\u9910\u5385\u91CC\u5F53\u4F19\u8BA1\uFF0Ckkk\u8BF4\uFF0C\u6837\u5B50\u592A\u50BB\uFF0C\u6015\u4F8D\u5019\u4E0D\u4E86\u4E13\u804C\u5F00\u53D1\uFF0C\u5C31\u5728\u5916\u9762\u505A\u70B9\u4E8B\u7F62\u3002\u5916\u9762\u7684\u7FFB\u8BD1\u7BA1\u7406\uFF0C\u867D\u7136\u5BB9\u6613\u8BF4\u8BDD\uFF0C\u4F46\u5520\u5520\u53E8\u53E8\u7F20\u5939\u4E0D\u6E05\u7684\u4E5F\u5F88\u4E0D\u5C11\u3002\u4ED6\u4EEC\u5F80\u5F80\u8981\u4EB2\u773C\u770B\u7740\u4E00\u4E2A\u5B57\u4E00\u4E2A\u5B57\u5BA1\u6838\u8FC7\uFF0C\u770B\u8FC7\u5230\u5E95\u662F\u4E0D\u662F\u673A\u7FFB\uFF0C\u53C8\u4EB2\u770B\u5C06\u786E\u8BA4\u7FFB\u8BD1\u6309\u4E0B\uFF0C\u7136\u540E\u653E\u5FC3\uFF1A\u5728\u8FD9\u4E25\u91CD\u76D1\u7763\u4E0B\uFF0C\u6478\u9C7C\u4E5F\u5F88\u4E3A\u96BE\u3002\u6240\u4EE5\u8FC7\u4E86\u51E0\u5929\uFF0Ckkk\u53C8\u8BF4\u6211\u5E72\u4E0D\u4E86\u8FD9\u4E8B\u3002\u5E78\u4E8Fdarkflames\u7684\u60C5\u9762\u5927\uFF0C\u8F9E\u9000\u4E0D\u5F97\uFF0C\u4FBF\u6539\u4E3A\u4E13\u7BA1\u7287\u7287\u7684\u4E00\u79CD\u65E0\u804A\u804C\u52A1\u4E86\u3002\\r\\n\\r\\n\u6211\u4ECE\u6B64\u4FBF\u6574\u5929\u7684\u5750\u5728\u7535\u8111\u524D\uFF0C\u4E13\u7BA1\u6211\u7684\u804C\u52A1\u3002\u867D\u7136\u6CA1\u6709\u4EC0\u4E48\u5931\u804C\uFF0C\u4F46\u603B\u89C9\u5F97\u6709\u4E9B\u5355\u8C03\uFF0C\u6709\u4E9B\u65E0\u804A\u3002kkk\u662F\u4E00\u526F\u51F6\u9762\u5B54\uFF0Cdarkflames\u4E5F\u6CA1\u6709\u597D\u58F0\u6C14\uFF0C\u6559\u4EBA\u6D3B\u6CFC\u4E0D\u5F97\uFF1B\u53EA\u6709\u9648\u4E59\u5DF1\u5230\u5E97\uFF0C\u624D\u53EF\u4EE5\u7B11\u51E0\u58F0\uFF0C\u6240\u4EE5\u81F3\u4ECA\u8FD8\u8BB0\u5F97\u3002\\r\\n\\r\\n\u9648\u4E59\u5DF1\u662F\u7AD9\u7740\u6253\u6BD4\u8D5B\u800CAK\u7684\u552F\u4E00\u7684\u4EBA\u3002\u4ED6\u8EAB\u6750\u5F88\u7C97\u58EE\uFF1B\u7A1A\u6C14\u9762\u5B54\uFF0C\u53CC\u773C\u91CC\u65F6\u5E38\u653E\u51FA\u806A\u9896\u7684\u5149\u3002\u2026\u2026\u2026\u2026\u56E0\u4E3A\u4ED6\u59D3\u9648\uFF0C\u522B\u4EBA\u4FBF\u4ECE\u63CF\u7EA2\u7EB8\u4E0A\u7684\u201C\u4E0A\u5DE8\u4F6C\u9648\u4E59\u5DF1\u201D\u8FD9\u534A\u61C2\u4E0D\u61C2\u7684\u8BDD\u91CC\uFF0C\u66FF\u4ED6\u53D6\u4E0B\u4E00\u4E2A\u7EF0\u53F7\uFF0C\u53EB\u505A\u9648\u4E59\u5DF1\u3002\u9648\u4E59\u5DF1\u4E00\u5230\u5E97\uFF0C\u6240\u6709\u6253\u6BD4\u8D5B\u7684\u4EBA\u4FBF\u90FD\u770B\u7740\u4ED6\u7B11\uFF0C\u6709\u7684\u53EB\u9053\uFF1A\u201C\u9648\u4E59\u5DF1\uFF0C\u4F60\u53C8AC\u4E86\u4E00\u9053\u7D2B\u9898\uFF01\u201D\u4ED6\u4E0D\u56DE\u7B54\uFF0C\u5BF9\u67DC\u91CC\u8BF4\uFF0C\u201C\u4E24\u9053IOI2018\uFF0C\u8981\u4E00\u6253\u7701\u9009+\u3002\u201D\u4FBF\u6392\u51FA\u6234\u5C14ALIENWARE\u3002\u4ED6\u4EEC\u53C8\u6545\u610F\u7684\u9AD8\u58F0\u56B7\u9053\uFF1A\u201Cche\\\\_zheAKIOI\uFF01\u201D\u9648\u4E59\u5DF1\u7741\u5927\u773C\u775B\u8BF4\uFF1A\u201C\u4F60\u600E\u4E48\u8FD9\u6837\u51ED\u7A7A\u6C61\u4EBA\u6E05\u767D\u2026\u2026\u201D\u201C\u4EC0\u4E48\u6E05\u767D\uFF1F\u6211\u524D\u5929\u4EB2\u773C\u89C1\u4F60\u534A\u4E2A\u5C0F\u65F6\u5199\u5B8CIOI\uFF0C\u628A\u5176\u4ED6\u4EBA\u540A\u7740\u6253\u3002\u201D\u9648\u4E59\u5DF1\u4FBF\u6DA8\u7EA2\u4E86\u8138\uFF0C\u989D\u4E0A\u7684\u9752\u7B4B\u6761\u6761\u7EFD\u51FA\uFF0C\u4E89\u8FA9\u9053\uFF1A\u201C\u5199\u5B8C\u4E0D\u80FD\u7B97\u6211AK\u2026\u2026\u6211\u83DC\uFF01\u2026\u2026\u521D\u5B66\u8005\u7684\u4E8B\uFF0C\u80FD\u7B97AK\u4E48\uFF1F\u201D\u63A5\u8FDE\u4FBF\u662F\u96BE\u61C2\u7684\u8BDD\uFF0C\u4EC0\u4E48\u201C\u6BD4\u8D5B\u771F\u96BE\u201D\uFF0C\u4EC0\u4E48\u201C\u849F\u84BB\u201D\u4E4B\u7C7B\uFF0C\u5F15\u5F97\u4F17\u4EBA\u90FD\u54C4\u7B11\u8D77\u6765\uFF1A\u5E97\u5185\u5916\u90FD\u5145\u6EE1\u4E86\u5FEB\u6D3B\u7684\u7A7A\u6C14\u3002\\r\\n\\r\\n\u2026\u2026\u2026\u2026\\r\\n\\r\\n\u201C\u96C6\u8BAD\u961F\u7684\u4EBA\u8111\u5B50\u53D1\u660F\uFF0C\u7ADF\u7136\u5077\u5230chen\\\\_zhe\u90A3\u91CC\u53BB\u4E86\uFF0C\u4ED6\u5BB6\u7684\u9898\uFF0C\u5077\u7684\u5F97\u5417\uFF1F\u201D\u201C\u540E\u6765\u600E\u6837\u5462\uFF1F\u201D\u201C\u88ABchen\\\\_zhe\u6253\uFF0C\u540A\u7740\u6253\u3002\u201D\\r\\n\\r\\n\xB7\u66B4\u529B\u51FA\u5947\u8FF9\uFF0C\u9A97\u5206\u8FC7\u6837\u4F8B\u3002\\r\\n\\r\\n\xB7\u6570\u5B66\u5148\u6253\u8868\uFF0C\uFF24\uFF30\u770B\u8FD0\u6C14\u3002\\r\\n\\r\\n\xB7\u7A77\u4E3E\uFF34\uFF2C\uFF25\uFF0C\u9012\u63A8\uFF35\uFF2B\uFF25\u3002\\r\\n\\r\\n\xB7\u6A21\u62DF\uFF2D\uFF2C\uFF25\uFF0C\u8D2A\u5FC3\u8FD8\uFF23\uFF25\u3002\\r\\n\\r\\n\xB7\u60F3\u8981\u9A97\u5230\u5206\uFF0C\u5C31\u8981\u6709\u65B9\u6CD5\u3002\\r\\n\\r\\n\xB7\u56FE\u8BBA\u80CC\u6A21\u677F\uFF0C\u6570\u8BBA\u80CC\u516C\u5F0F\u3002\\r\\n\\r\\n\xB7\u52A8\u89C4\u80CC\u65B9\u7A0B\uFF0C\u9AD8\u7CBE\u80CC\u4EE3\u7801\u3002\\r\\n\\r\\n\xB7\u5982\u679C\u90FD\u6CA1\u80CC\uFF0C\u5E72\u8106\u8F93\u6837\u4F8B\\r\\n\\r\\n---\\r\\n\\r\\n\u5237\u9898\u662F\u4E00\u79CD\u51FA\u8DEF \u679A\u4E3E\u662F\u4E00\u79CD\u601D\u60F3 \u6253\u8868\u662F\u4E00\u79CD\u52C7\u6C14\\r\\n\\r\\n\u641C\u7D22\u662F\u4E00\u79CD\u4FE1\u4EF0 \u526A\u679D\u662F\u4E00\u79CD\u7CBE\u795E \u9A97\u5206\u662F\u4E00\u79CD\u65E5\u5E38\\r\\n\\r\\nWA \u662F\u4E00\u79CD\u7EDD\u671B TLE \u662F\u4E00\u79CD\u75DB\u82E6 RE \u662F\u4E00\u79CD\u653E\u5F03\\r\\n\\r\\nUKE \u662F\u4E00\u79CD\u65E0\u5948 AC \u662F\u4E00\u79CD\u539F\u8C05 AK \u662F\u4E00\u79CD\u5E7B\u60F3\\r\\n\\r\\n\u5F03\u8D5B\u662F\u4E00\u79CD\u9893\u5E9F \u540A\u6253\u662F\u4E00\u79CD\u5FC5\u7136 \u8FDB\u961F\u662F\u4E00\u79CD\u5962\u671B\\r\\n\\r\\nNOI \u662F\u4E00\u79CD\u68A6\u60F3\\r\\n\\r\\n---\\r\\n\\r\\n\u795E\u7287\uFF1A\u201C\u7F51\u7EDC\u6D4124\u9898\uFF1F\u5207\u6389\uFF01\u6A21\u62DF\u9000\u706B\uFF1FA\u4E86\uFF01\u4E0D\u5728\u8BDD\u4E0B\uFF01\u201D\\r\\n\\r\\n\u5927\u7287\uFF1A\u201C\u4ECA\u5929\u8FD9\u4E2A\u659C\u7387\u4F18\u5316\u603B\u7B97\u641E\u5B9A\u4E86\uFF0C\u660E\u5929\u5199Treap\u3002\u201D\\r\\n\\r\\n\u4E2D\u7287\uFF1A\u201C\u7EBF\u6BB5\u6811Get\uFF01\u7EC8\u4E8E\u53EF\u4EE5\u505A\u7EBF\u6BB5\u6811\u9898\u4E86\uFF0C\u54C8\u54C8\u3002\u201D\\r\\n\\r\\n\u5C0F\u7287\uFF1A\u201CDP\u7EC8\u4E8E\u4F1A\u5199\u4E86\uFF0C\u547C\u547C\uFF0C\u554A\u4EC0\u4E48\uFF0C\u8FD8\u6709\u6811\u5F62\u72B6\u538B\u6570\u4F4D\u2026\u2026\u201D\\r\\n\\r\\n\u849F\u84BB\uFF1A\u201C\u554A\u554A\u554A\u554A\u554A\u8FD9\u4E2Aa+b\u600E\u4E48\u8FD9\u4E48\u5751\uFF01\u8C03\u4E86\u8FD9\u4E48\u4E45\uFF01\u201D\\r\\n\\r\\n\u6211\uFF1A\u201C\u8FD9\u4E2Ac++\u600E\u4E48\u8FD8\u6CA1\u88C5\u597D\u3002\u201D\\r\\n\\r\\n---\\r\\n\\r\\n### \u8BBA \u89C1 \u7956 \u5B97 \u7684 N \u79CD \u65B9 \u6CD5\\r\\n\\r\\n1. \u4E0D\u5F00 `freopen` \u89C1\u7956\u5B97\uFF1B\\r\\n2. \u4E0D\u5F00 `long long` \u89C1\u7956\u5B97\uFF1B\\r\\n3. \u591A\u6D4B\u4E0D\u6E05\u7A7A\u89C1\u7956\u5B97\uFF1B\\r\\n4. \u6E05\u7A7A\u8D85\u65F6\u89C1\u7956\u5B97\uFF1B\\r\\n5. \u5C11 `#include <cstdio>` \u89C1\u7956\u5B97\uFF1B\\r\\n6. 232\u22121**2**3\u200B**2**\u200B\u2212**1** \u4E0D\u5F00 `unsigned int` \u89C1\u7956\u5B97\uFF1B\\r\\n7. 264\u22121**2**6\u200B**4**\u200B\u2212**1** \u4E0D\u5F00 `unsigned long long` \u89C1\u7956\u5B97\uFF1B\\r\\n8. \u4F7F\u7528\u5DF2\u6B7B\u7684\u7B97\u6CD5\u89C1\u7956\u5B97\uFF1B\\r\\n9. `cin`\uFF0C`cout` \u6548\u7387\u4F4E\u89C1\u7956\u5B97\uFF1B\\r\\n10. `n`\uFF0C`m` \u5199\u53CD\u89C1\u7956\u5B97\uFF1B\\r\\n11. \u53D8\u91CF\u91CD\u540D\u89C1\u7956\u5B97\uFF1B\\r\\n12. \u9012\u5F52\u51FD\u6570\u4E2D\u4F7F\u7528\u540C\u4E00\u4E2A\u5FAA\u73AF\u53D8\u91CF\u89C1\u7956\u5B97\uFF1B\\r\\n13. \u8C03\u8BD5\u4E0D\u6CE8\u91CA\u89C1\u7956\u5B97\uFF1B\\r\\n14. \u6570\u7EC4\u5F00\u5927\u89C1\u7956\u5B97;\\r\\n\\r\\nAC=Answer Coarse=\u7C97\u52A3\u7684\u7B54\u6848\\r\\n\\r\\nWA=Wonderful Answer=\u597D\u7B54\u6848\\r\\n\\r\\nTLE=Time Limit Enough=\u65F6\u95F4\u5145\u88D5\\r\\n\\r\\nMLE=Memory Limit Enough=\u5185\u5B58\u5145\u88D5\\r\\n\\r\\nCE=Compile Easily=\u8F7B\u677E\u901A\u8FC7\u7F16\u8BD1\\r\\n\\r\\nRE=Run Excellently=\u5B8C\u7F8E\u8FD0\u884C\\r\\n\\r\\nUKE=Unbelievably Keep Enough Score=\u96BE\u4EE5\u7F6E\u4FE1\u5730\u4FDD\u6301\u8DB3\u591F\u7684\u5206\u6570\\r\\n\\r\\nAU=All Unaccepted=\u5168\u90FD\u4E0D\u6B63\u786E\\r\\n\\r\\n\u597D\u4E86\uFF0C\u542C\u597D\u4E86\u6D1B\u8C37\u3002\u7B49\u6211\u5F53\u4E0A\u7BA1\u7406\u5458\uFF0C\u6211\u4F1A\u5236\u5B9A\u65B0\u7684\u7A0E\u6CD5\uFF0C\u6211\u77A7\u77A7\u2026\u2026\\r\\n\\r\\nAC\u8981\u6263\u7A0E\\r\\n\\r\\nWA\u8981\u6263\u7A0E\\r\\n\\r\\nRE\u8981\u6263\u7A0E\\r\\n\\r\\nTLE\u8981\u6263\u7A0E\\r\\n\\r\\nMLE\u8981\u6263\u7A0E\\r\\n\\r\\nCE\u8981\u6263\u7A0E\\r\\n\\r\\nUKE\u8981\u6263\u7A0E\\r\\n\\r\\nOLE\u8981\u6263\u7A0E\\r\\n\\r\\nPC\u8981\u6263\u7A0E\\r\\n\\r\\nAK\u4E5F\u8981\u6263\u7A0E\\\\~\\r\\n\\r\\n\u6D1B\u8C37\uFF1A\u6211\u6297\u8BAE\u4EE5\u4E0A\u7684\u7A0E\uFF01\\r\\n\\r\\n\u6297\u8BAE\u4EE5\u4E0A\u7684\u7A0E\u8981\u6263\u7A0E\\r\\n\\r\\n```none\\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\ny\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA y\u6C38\u8FDCWA \\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ || || || || || || // // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ _o\uD83D\uDCA9o_ // // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ o8888888o // // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ 88\\" . \\"88 // // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ (| \xD7 \xD7 |) // // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ \\\\\\\\ O\\\\ \u0434 /O // // ////\\r\\n\\\\\\\\\\\\\\\\ \\\\\\\\ ____/`---\'\\\\____ // ////\\r\\n\\\\\\\\\\\\\\\\ .\' \\\\\\\\| |// `. ////\\r\\n//== / \\\\\\\\||| : |||// \\\\ ==\\\\\\\\\\r\\n//== / _||||| -:- |||||- \\\\ ==\\\\\\\\\\r\\n//== | | \\\\\\\\\\\\ - /// | | ==\\\\\\\\\\r\\n//== | \\\\_| \'\'\\\\---/\'\' | | ==\\\\\\\\\\r\\n//== \\\\ .-\\\\__ `-` ___/-. / ==\\\\\\\\\\r\\n//== ___`. .\' /--.--\\\\ `. . ___ ==\\\\\\\\\\r\\n//== .\\"\\" \'< `.___\\\\_<|>_/___.\' >\' \\"\\". ==\\\\\\\\\\r\\n//== | | : `- \\\\`.;`\\\\ _ /`;.`/ - ` : | | \\\\\\\\\\\\\\\\\\r\\n//// \\\\ \\\\ `-. \\\\_ __\\\\ /__ _/ .-` / / \\\\\\\\\\\\\\\\\\r\\n//// ========`-.____`-.___\\\\_____/___.-`____.-\'======== \\\\\\\\\\\\\\\\\\r\\n//// `=---=\' \\\\\\\\\\\\\\\\\\r\\n//// // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // \u9B54\u7956\u6BD2\u86CA y\u6C38\u8FDCWA \u6C38\u8FDC\u4FEE\u6539 \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n//// // // // // // || || || || || || || || || || \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\ \\\\\\\\\\\\\\\\\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[Copy](https://oj.qdturing.cn/d/W0001/user/1015)\\r\\n\\r\\n \\r\\n\\r\\n\\r\\n\\r\\n\u66F4\u5168\u7684\u5E72\u8D27\uFF1A[https://oj.qdturing.cn/d/Neptune/wiki/help#contest](https://oj.qdturing.cn/d/Neptune/wiki/help#contest)\\r\\n\\r\\n\u4EE5\u53CA\uFF1A[\u5168\u4E86\uFF01AK\u3001AC\u3001OJ\u2026\u2026\u4FE1\u5965\u5E38\u7528\u540D\u8BCD\u89E3\u91CA - \u77E5\u4E4E (zhihu.com)](https://zhuanlan.zhihu.com/p/620939848)\\r\\n\\r\\n\u8FD8\u6709\uFF1A[[\u5B58\u50A8]\u5BB9\u91CF\u5355\u4F4D\u540D\u8BCD\u89E3\u91CA - \u53EF\u7528\u5BB9\u91CF\uFF0C\u6709\u6548\u5BB9\u91CF\uFF0CTB\uFF0CTiB, GB,GiB\u7684\u56F0\u6270 - \u77E5\u4E4E (zhihu.com)](https://zhuanlan.zhihu.com/p/80232325)\\r\\n\\r\\n~~***\u5F69\u86CB\uFF1A\u8BBE\u7F6E\u6027\u522B\u6211\u9009\u7684other***~~\\r\\n\\r\\n***\u8FD9\u4F60\u90FD\u770B\u5B8C\u4E86\uFF1F(?\u0414?)\u5173\u6CE8\u4E0B\u5457***\\r\\n\\r\\n***\u767D\u5AD6\u4E00\u65F6\u723D\uFF0C\u4E00\u76F4\u767D\u5AD6\u4E00\u76F4\u723D***\\r\\n\\r\\n```none\\r\\n// Standard iostream objects -*- C++ -*-\\r\\n\\r\\n// Copyright (C) 1997-2014 Free Software Foundation, Inc.\\r\\n//\\r\\n// This file is part of the GNU ISO C++ Library. This library is free\\r\\n// software; you can redistribute it and/or modify it under the\\r\\n// terms of the GNU General Public License as published by the\\r\\n// Free Software Foundation; either version 3, or (at your option)\\r\\n// any later version.\\r\\n\\r\\n// This library is distributed in the hope that it will be useful,\\r\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\r\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\r\\n// GNU General Public License for more details.\\r\\n\\r\\n// Under Section 7 of GPL version 3, you are granted additional\\r\\n// permissions described in the GCC Runtime Library Exception, version\\r\\n// 3.1, as published by the Free Software Foundation.\\r\\n\\r\\n// You should have received a copy of the GNU General Public License and\\r\\n// a copy of the GCC Runtime Library Exception along with this program;\\r\\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\\r\\n// <http://www.gnu.org/licenses/>.\\r\\n\\r\\n/** @file include/iostream\\r\\n * This is a Standard C++ Library header.\\r\\n */\\r\\n\\r\\n//\\r\\n// ISO C++ 14882: 27.3 Standard iostream objects\\r\\n//\\r\\n\\r\\n#ifndef _GLIBCXX_IOSTREAM\\r\\n#define _GLIBCXX_IOSTREAM 1\\r\\n\\r\\n#pragma GCC system_header\\r\\n\\r\\n#include <bits/c++config.h>\\r\\n#include <ostream>\\r\\n#include <istream>\\r\\n\\r\\nnamespace std _GLIBCXX_VISIBILITY(default)\\r\\n{\\r\\n_GLIBCXX_BEGIN_NAMESPACE_VERSION\\r\\n\\r\\n /**\\r\\n * @name Standard Stream Objects\\r\\n *\\r\\n * The <iostream> header declares the eight <em>standard stream\\r\\n * objects</em>. For other declarations, see\\r\\n * http://gcc.gnu.org/onlinedocs/libstdc++/manual/io.html\\r\\n * and the @link iosfwd I/O forward declarations @endlink\\r\\n *\\r\\n * They are required by default to cooperate with the global C\\r\\n * library\'s @c FILE streams, and to be available during program\\r\\n * startup and termination. For more information, see the section of the\\r\\n * manual linked to above.\\r\\n */\\r\\n //@{\\r\\n extern istream cin;\\t\\t/// Linked to standard input\\r\\n extern ostream cout;\\t\\t/// Linked to standard output\\r\\n extern ostream cerr;\\t\\t/// Linked to standard error (unbuffered)\\r\\n extern ostream clog;\\t\\t/// Linked to standard error (buffered)\\r\\n\\r\\n#ifdef _GLIBCXX_USE_WCHAR_T\\r\\n extern wistream wcin;\\t\\t/// Linked to standard input\\r\\n extern wostream wcout;\\t/// Linked to standard output\\r\\n extern wostream wcerr;\\t/// Linked to standard error (unbuffered)\\r\\n extern wostream wclog;\\t/// Linked to standard error (buffered)\\r\\n#endif\\r\\n //@}\\r\\n\\r\\n // For construction of filebuffers for cout, cin, cerr, clog et. al.\\r\\n static ios_base::Init __ioinit;\\r\\n\\r\\n_GLIBCXX_END_NAMESPACE_VERSION\\r\\n} // namespace\\r\\n\\r\\n#endif /* _GLIBCXX_IOSTREAM */\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n```none\\r\\n#ifndef _GLIBCXX_NO_ASSERT\\r\\n#include <cassert>\\r\\n#endif\\r\\n#include <cctype>\\r\\n#include <cerrno>\\r\\n#include <cfloat>\\r\\n#include <ciso646>\\r\\n#include <climits>\\r\\n#include <clocale>\\r\\n#include <cmath>\\r\\n#include <csetjmp>\\r\\n#include <csignal>\\r\\n#include <cstdarg>\\r\\n#include <cstddef>\\r\\n#include <cstdio>\\r\\n#include <cstdlib>\\r\\n#include <cstring>\\r\\n#include <ctime>\\r\\n\\r\\n#if __cplusplus >= 201103L\\r\\n#include <ccomplex>\\r\\n#include <cfenv>\\r\\n#include <cinttypes>\\r\\n#include <cstdalign>\\r\\n#include <cstdbool>\\r\\n#include <cstdint>\\r\\n#include <ctgmath>\\r\\n#include <cwchar>\\r\\n#include <cwctype>\\r\\n#endif\\r\\n\\r\\n// C++\\r\\n#include <algorithm>\\r\\n#include <bitset>\\r\\n#include <complex>\\r\\n#include <deque>\\r\\n#include <exception>\\r\\n#include <fstream>\\r\\n#include <functional>\\r\\n#include <iomanip>\\r\\n#include <ios>\\r\\n#include <iosfwd>\\r\\n#include <iostream>\\r\\n#include <istream>\\r\\n#include <iterator>\\r\\n#include <limits>\\r\\n#include <list>\\r\\n#include <locale>\\r\\n#include <map>\\r\\n#include <memory>\\r\\n#include <new>\\r\\n#include <numeric>\\r\\n#include <ostream>\\r\\n#include <queue>\\r\\n#include <set>\\r\\n#include <sstream>\\r\\n#include <stack>\\r\\n#include <stdexcept>\\r\\n#include <streambuf>\\r\\n#include <string>\\r\\n#include <typeinfo>\\r\\n#include <utility>\\r\\n#include <valarray>\\r\\n#include <vector>\\r\\n\\r\\n#if __cplusplus >= 201103L\\r\\n#include <array>\\r\\n#include <atomic>\\r\\n#include <chrono>\\r\\n#include <condition_variable>\\r\\n#include <forward_list>\\r\\n#include <future>\\r\\n#include <initializer_list>\\r\\n#include <mutex>\\r\\n#include <random>\\r\\n#include <ratio>\\r\\n#include <regex>\\r\\n#include <scoped_allocator>\\r\\n#include <system_error>\\r\\n#include <thread>\\r\\n#include <tuple>\\r\\n#include <typeindex>\\r\\n#include <type_traits>\\r\\n#include <unordered_map>\\r\\n#include <unordered_set>\\r\\n#endif\\r\\n```\\r\\n\\r\\n[Copy]()\\r\\n\\r\\n[https://www.luogu.com.cn/](https://www.luogu.com.cn/)\\r\\n\\r\\n[\u5728\u7EBF\u9ED1\u5BA2\u6A21\u62DF\u653B\u51FB\u6F14\u793A (tonghei.com)](https://hackcode.tonghei.com/hacker/)\\r\\n\\r\\n\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B\u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B\u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B\u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002\\r\\n\u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B\u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B\u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B\u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\u2014\u2014\u5C0F A\u6570\u5B66\u662F\u706B\uFF0C\u70B9\u4EAE\u7269\u7406\u7684\u706F\uFF1B\u7269\u7406\u662F\u706F\uFF0C\u7167\u4EAE\u5316\u5B66\u7684\u8DEF\uFF1B\u5316\u5B66\u662F\u8DEF\uFF0C\u901A\u5411\u751F\u7269\u7684\u5751\uFF1B\u751F\u7269\u662F\u5751\uFF0C\u57CB\u846C\u5B66\u7406\u7684\u4EBA\u3002\\r\\n\u6587\u8A00\u662F\u706B\uFF0C\u70B9\u4EAE\u5386\u53F2\u5BAB\u706F\uFF1B\u5386\u53F2\u662F\u706F\uFF0C\u7167\u4EAE\u793E\u4F1A\u4E4B\u8DEF\uFF1B\u793E\u4F1A\u662F\u8DEF\uFF0C\u901A\u5411\u54F2\u5B66\u5927\u5751\uFF1B\u54F2\u5B66\u662F\u5751\uFF0C\u57CB\u846C\u6587\u79D1\u751F\u3002\u2014\u2014\u5C0F A\\r\\n\\r\\n","school":"\u9752\u5C9B\u7ACB\u65B0\u5C0F\u5B66","studentId":"20","phone":"18661978285","backgroundImage":"/components/profile/backgrounds/1.jpg","unreadMsg":0,"pinnedDomains":["gsk1","system","lixin3","W0001","Neptune","Y001"],"fontFamily":"Open Sans","codeFontFamily":"Source Code Pro","preferredEditorType":"sv","monacoTheme":"vs-light","theme":"dark","showInvisibleChar":false,"formatCode":true,"realname":"\u738B\u6893\u5BB8","skipAnimate":false,"showTimeAgo":true,"coin":92100,"displayName":"\u738B\u6893\u5BB8","nAccept":177,"nSubmit":204,"rp":0,"rpInfo":{},"level":0,"avatarUrl":"//sdn.geekzu.org/avatar/27c40cafc2e6207660995464171af398?d=mm&s=128"}'; </script> <script type="text/javascript" src="https://oj.qdturing.cn/resource/4.50.2/lang-zh.js"></script> <script type="text/javascript" src="https://oj.qdturing.cn/hydro-4.50.2.js"></script> <nav class="nav slideout-menu" id="menu"> <div class="row"><div class="columns clearfix"> <ol class="nav__list nav__list--main clearfix"> <li class="nav__list-item"> <a href="/"><img class="nav__logo" src="/nav_logo_dark.png"></a> </li> <li class="nav__list-item"> <a href="/d/W0001/" class="nav__item"> 首页 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/p" class="nav__item"> 题库 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/training" class="nav__item"> 训练 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/contest" class="nav__item"> 比赛 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/homework" class="nav__item"> 作业 </a> </li> <li class="nav__list-item"> <a href="/d/W0001/record?uidOrName=1063" class="nav__item"> 评测记录 </a> </li> </ol> <ol class="nav__list nav__list--secondary clearfix"> <li class="nav__list-item" data-dropdown-pos="bottom right" data-dropdown-custom-class="nav__dropdown" data-dropdown-target="#menu-nav-domain" data-dropdown-disabledconstrainToWindow data-dropdown-trigger-desktop-only> <span class="nav__item"><span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/c966bade52d355d61c5a90226ae5959b?d=mm&s=64" width="20" height="20"></span> 韦老师 <span class="icon icon-expand_more nojs--hide"></span></span> <ol class="dropdown-target menu" id="menu-nav-domain"><li class="menu__item"> <a href="/d/gsk1/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=4141512521&s=160" width="20" height="20"></span> EL训练计划 (gsk1) </a> </li><li class="menu__item"> <a href="/d/system/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="https://oj.qdturing.cn/file/4/favicon.ico" width="20" height="20"></span> 图灵编程教育 (system) </a> </li><li class="menu__item"> <a href="/d/lixin3/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=4141512521&s=160" width="20" height="20"></span> 立新三年级 (lixin3) </a> </li><li class="menu__item"> <a href="/d/W0001/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/c966bade52d355d61c5a90226ae5959b?d=mm&s=64" width="20" height="20"></span> 韦老师 (W0001) </a> </li><li class="menu__item"> <a href="/d/Neptune/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//sdn.geekzu.org/avatar/9e853346d72b5227f38177e3e8e94691?d=mm&s=64" width="20" height="20"></span> 乐智 (Neptune) </a> </li><li class="menu__item"> <a href="/d/Y001/" class="menu__link"> <span class="icon"><img class="small user-profile-avatar v-center" loading="lazy" src="//q1.qlogo.cn/g?b=qq&nk=28015861&s=160" width="20" height="20"></span> 于老师的python域 (Y001) </a> </li><li class="menu__seperator"></li><li class="menu__item"> <a href="/d/W0001/home/domain" class="menu__link"> <span class="icon icon-wrench"></span> 管理 </a> </li> </ol> </li> <li class="nav__list-item" data-dropdown-pos="bottom right" data-dropdown-custom-class="nav__dropdown" data-dropdown-target="#menu-nav-user" data-dropdown-disabledconstrainToWindow data-dropdown-trigger-desktop-only> <a href="/d/W0001/user/1063" class="nav__item">王梓宸 <span class="icon icon-expand_more nojs--hide"></span></a> <ol class="dropdown-target menu" id="menu-nav-user"> <li class="menu__item"> <a href="/d/W0001/user/1063" class="menu__link"> <span class="icon icon-account--circle"></span> 我的资料 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/messages" class="menu__link"> <span class="icon icon-comment--multiple"></span> 站内消息 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/settings/domain" class="menu__link"> <span class="icon icon-web"></span> @ 韦老师 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/settings/account" class="menu__link"> <span class="icon icon-wrench"></span> 账户设置 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/settings/preference" class="menu__link"> <span class="icon icon-sliders"></span> 偏好设置 </a> </li> <li class="menu__item"> <a href="/d/W0001/home/security" class="menu__link"> <span class="icon icon-security"></span> 安全设置 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/home/domain" class="menu__link"> <span class="icon icon-web"></span> 我的域 </a> </li> <li class="menu__seperator"></li><li class="menu__item nojs--hide"> <a href="/d/W0001/fund/info" class="menu__link"> <span class="icon icon-statistics"></span> 我的金币记录 </a> </li> <li class="menu__seperator"></li> <li class="menu__item"> <a href="/d/W0001/logout" class="menu__link" name="nav_logout"> <span class="icon icon-logout"></span> 登出 </a> </li> </ol> </li> </ol> </div></div> </nav> <nav class="nav--shadow"></nav> <div class="slideout-panel" id="panel"> <div class="slideout-overlay"></div> <div class="header--mobile"> <div class="row"><div class="columns clearfix"> <div class="float-left"> <a class="header--mobile__domain" href="/" target="_self"> <img src="/nav_logo_dark.png"> </a> </div> <div class="float-right"> <button type="button" class="header__hamburger"> <div class="hamburger hamburger--spin"> <span class="hamburger-box"> <span class="hamburger-inner"></span> </span> </div> </button> </div> </div></div> </div> <div class="main"> <style> .user-profile-bg { background-image: url("/components/profile/backgrounds/1.jpg"), url("/components/profile/backgrounds/1.jpg"); } </style> <div class="row"> <div class="medium-9 columns"> <div class="section"> <div class="profile-header user-profile-bg"> <div class="profile-header__content"> <div class="media"> <div class="media__left"> <img src="//sdn.geekzu.org/avatar/746a96ddf2d4353be8894048b0067b98?d=mm&s=120" width="120" height="120" class="large user-profile-avatar"> </div> <div class="media__body profile-header__main"> <h1> 郝铮 <small>(郝铮)</small> </h1> <p> UID: 1051, 注册于 <span class="time relative" data-timestamp="1688638192.394">2023-7-6 18:09:52</span>, 最后登录于 <span class="time relative" data-timestamp="1708342280.407">2024-2-19 19:31:20</span>, 最后活动于 <span class="time relative" data-timestamp="1720832595.076">2024-7-13 9:03:15</span>. </p> <p>解决了 203 道题目，RP: 0 (No. ?)</p> <div class="profile-header__contact-bar"> <a class="profile-header__contact-item" href="/d/W0001/home/messages?target=1051" target="_blank" data-tooltip="发送站内信息"> <span class="icon icon-comment--multiple"></span> </a> <a class="profile-header__contact-item" href="javascript:;" data-copy="enBaQVdkUFhWeGZmQGh5ZHJvLmxvY2Fs" data-tooltip="复制电子邮件"> <span class="icon icon-mail"></span> </a> </div> </div> </div> </div> </div> <div class="profile-content"> <div class="section__tab-container immersive"> <ul class="section__tabs"> <li class="section__tab-item"> <h1 class="section__tab-title">个人简介</h1> <div class="section__tab-main"> <div class="nothing-placeholder"> <div class="nothing-icon"></div> 该用户太懒，这里啥也没写 (´・ω・｀) </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">通过的题目</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <div class="row"> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P381" data-tooltip="角谷猜想"><b>A1002P381</b></a></li> <li> <a href="/d/W0001/p/A1002P17" data-tooltip="一尺之棰"><b>A1002P17</b></a></li> <li> <a href="/d/W0001/p/A1002P18" data-tooltip="小明学游泳"><b>A1002P18</b></a></li> <li> <a href="/d/W0001/p/A1002P128" data-tooltip="数字统计"><b>A1002P128</b></a></li> <li> <a href="/d/W0001/p/A1002P386" data-tooltip="数中有几个0"><b>A1002P386</b></a></li> <li> <a href="/d/W0001/p/A1002P153" data-tooltip="求最小因数"><b>A1002P153</b></a></li> <li> <a href="/d/W0001/p/A1002P573" data-tooltip="求最大公约数"><b>A1002P573</b></a></li> <li> <a href="/d/W0001/p/A1002P574" data-tooltip="两个自然数m和n的最小公倍数"><b>A1002P574</b></a></li> <li> <a href="/d/W0001/p/A1002P575" data-tooltip="最大正方形边长"><b>A1002P575</b></a></li> <li> <a href="/d/W0001/p/A1002P436" data-tooltip="数值计算"><b>A1002P436</b></a></li> <li> <a href="/d/W0001/p/A1002P49" data-tooltip="输出第二个整数"><b>A1002P49</b></a></li> <li> <a href="/d/W0001/p/A1002P50" data-tooltip="输入和输出实型数据"><b>A1002P50</b></a></li> <li> <a href="/d/W0001/p/A1002P52" data-tooltip="变量的解释"><b>A1002P52</b></a></li> <li> <a href="/d/W0001/p/A1002P53" data-tooltip="换行分隔输出"><b>A1002P53</b></a></li> <li> <a href="/d/W0001/p/A1002P801" data-tooltip="输入输出3"><b>A1002P801</b></a></li> <li> <a href="/d/W0001/p/A1002P54" data-tooltip="字符菱形"><b>A1002P54</b></a></li> <li> <a href="/d/W0001/p/A1002P560" data-tooltip="图形打印正方形"><b>A1002P560</b></a></li> <li> <a href="/d/W0001/p/A1002P593" data-tooltip="图形打印长方形"><b>A1002P593</b></a></li> <li> <a href="/d/W0001/p/A1002P594" data-tooltip="图形打印直角三角形"><b>A1002P594</b></a></li> <li> <a href="/d/W0001/p/A1002P596" data-tooltip="数字图形正方形一"><b>A1002P596</b></a></li> <li> <a href="/d/W0001/p/A1002P597" data-tooltip="数字图形正方形二"><b>A1002P597</b></a></li> <li> <a href="/d/W0001/p/A1002P598" data-tooltip="数字图形三角形一"><b>A1002P598</b></a></li> <li> <a href="/d/W0001/p/A1002P599" data-tooltip="数字图形三角形二"><b>A1002P599</b></a></li> <li> <a href="/d/W0001/p/A1002P562" data-tooltip="星号倒直角"><b>A1002P562</b></a></li> <li> <a href="/d/W0001/p/A1002P563" data-tooltip="平行四边形"><b>A1002P563</b></a></li> <li> <a href="/d/W0001/p/A1002P602" data-tooltip="星号倒等腰三角形"><b>A1002P602</b></a></li> <li> <a href="/d/W0001/p/A1002P568" data-tooltip="星号梯形"><b>A1002P568</b></a></li> <li> <a href="/d/W0001/p/A1002P569" data-tooltip="9*9乘法公式"><b>A1002P569</b></a></li> <li> <a href="/d/W0001/p/A1002P650" data-tooltip="公园买门票"><b>A1002P650</b></a></li> <li> <a href="/d/W0001/p/A1002P635" data-tooltip="阿凡提的难题"><b>A1002P635</b></a></li> <li> <a href="/d/W0001/p/A1002P638" data-tooltip="三色球问题"><b>A1002P638</b></a></li> <li> <a href="/d/W0001/p/A1002P385" data-tooltip="数位之和"><b>A1002P385</b></a></li> <li> <a href="/d/W0001/p/A1002P51" data-tooltip="输入输出字符型数据"><b>A1002P51</b></a></li> <li> <a href="/d/W0001/p/A1002P46" data-tooltip="声明变量并输出"><b>A1002P46</b></a></li> <li> <a href="/d/W0001/p/A1002P477" data-tooltip="输出图形"><b>A1002P477</b></a></li> <li> <a href="/d/W0001/p/A1002P663" data-tooltip="判断能否被3，5，7整除"><b>A1002P663</b></a></li> <li> <a href="/d/W0001/p/A1002P111" data-tooltip="求四个数的最大数"><b>A1002P111</b></a></li> <li> <a href="/d/W0001/p/A1002P3" data-tooltip="小鱼的游泳时间"><b>A1002P3</b></a></li> <li> <a href="/d/W0001/p/A1002P60" data-tooltip="节省多少时间"><b>A1002P60</b></a></li> <li> <a href="/d/W0001/p/A1002P61" data-tooltip="输出整数12345各个位上的数字之和"><b>A1002P61</b></a></li> <li> <a href="/d/W0001/p/A1002P584" data-tooltip="分磁带"><b>A1002P584</b></a></li> <li> <a href="/d/W0001/p/A1002P583" data-tooltip="分钱"><b>A1002P583</b></a></li> <li> <a href="/d/W0001/p/A1002P987" data-tooltip="A + B 问题"><b>A1002P987</b></a></li> <li> <a href="/d/W0001/p/A1002P67" data-tooltip="时分秒"><b>A1002P67</b></a></li> <li> <a href="/d/W0001/p/A1002P587" data-tooltip="【深基2.例8】再分肥宅水"><b>A1002P587</b></a></li> <li> <a href="/d/W0001/p/A1002P771" data-tooltip="五舍六入"><b>A1002P771</b></a></li> <li> <a href="/d/W0001/p/A1002P581" data-tooltip="鸡兔同笼问题"><b>A1002P581</b></a></li> <li> <a href="/d/W0001/p/A1002P582" data-tooltip="车棚"><b>A1002P582</b></a></li> <li> <a href="/d/W0001/p/A1002P585" data-tooltip="【基础题】五位好朋友相聚"><b>A1002P585</b></a></li> <li> <a href="/d/W0001/p/A1002P980" data-tooltip="分糖果"><b>A1002P980</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P557" data-tooltip="交换输出"><b>A1002P557</b></a></li> <li> <a href="/d/W0001/p/A1002P559" data-tooltip="交换输出 3"><b>A1002P559</b></a></li> <li> <a href="/d/W0001/p/A1002P77" data-tooltip="整数判断"><b>A1002P77</b></a></li> <li> <a href="/d/W0001/p/A1002P94" data-tooltip="超市卖电池"><b>A1002P94</b></a></li> <li> <a href="/d/W0001/p/A1002P89" data-tooltip="苹果和虫子"><b>A1002P89</b></a></li> <li> <a href="/d/W0001/p/A1002P92" data-tooltip="需要几辆车"><b>A1002P92</b></a></li> <li> <a href="/d/W0001/p/A1002P95" data-tooltip="十位大还是个位大"><b>A1002P95</b></a></li> <li> <a href="/d/W0001/p/A1002P88" data-tooltip="点和正方形的关系"><b>A1002P88</b></a></li> <li> <a href="/d/W0001/p/A1002P694" data-tooltip="顺序输出"><b>A1002P694</b></a></li> <li> <a href="/d/W0001/p/A1002P695" data-tooltip="顺序输出2"><b>A1002P695</b></a></li> <li> <a href="/d/W0001/p/A1002P91" data-tooltip="装苹果"><b>A1002P91</b></a></li> <li> <a href="/d/W0001/p/A1002P85" data-tooltip="有一门课不及格的学生"><b>A1002P85</b></a></li> <li> <a href="/d/W0001/p/A1002P83" data-tooltip="判断闰年"><b>A1002P83</b></a></li> <li> <a href="/d/W0001/p/A1002P101" data-tooltip="乘车费用"><b>A1002P101</b></a></li> <li> <a href="/d/W0001/p/A1002P772" data-tooltip="是否是连续奇数"><b>A1002P772</b></a></li> <li> <a href="/d/W0001/p/A1002P463" data-tooltip="水仙花数 1"><b>A1002P463</b></a></li> <li> <a href="/d/W0001/p/A1002P81" data-tooltip="判断3的倍数"><b>A1002P81</b></a></li> <li> <a href="/d/W0001/p/A1002P977" data-tooltip="收集瓶盖赢大奖"><b>A1002P977</b></a></li> <li> <a href="/d/W0001/p/A1002P484" data-tooltip="小明家的电费"><b>A1002P484</b></a></li> <li> <a href="/d/W0001/p/A1002P815" data-tooltip="求生者的欲望"><b>A1002P815</b></a></li> <li> <a href="/d/W0001/p/A1002P527" data-tooltip="国王移动的步数"><b>A1002P527</b></a></li> <li> <a href="/d/W0001/p/A1002P485" data-tooltip="出租车费（小学组2015第一题）"><b>A1002P485</b></a></li> <li> <a href="/d/W0001/p/A1002P437" data-tooltip="输出30个星号"><b>A1002P437</b></a></li> <li> <a href="/d/W0001/p/A1002P13" data-tooltip="输出1到10的整数"><b>A1002P13</b></a></li> <li> <a href="/d/W0001/p/A1002P21" data-tooltip="100以内的偶数"><b>A1002P21</b></a></li> <li> <a href="/d/W0001/p/A1002P237" data-tooltip="输出符合条件的数"><b>A1002P237</b></a></li> <li> <a href="/d/W0001/p/A1002P34" data-tooltip="输入n，输出算式1+2+3+...+n"><b>A1002P34</b></a></li> <li> <a href="/d/W0001/p/A1002P140" data-tooltip="整数的个数"><b>A1002P140</b></a></li> <li> <a href="/d/W0001/p/A1002P32" data-tooltip="计算1+2+…+100的和"><b>A1002P32</b></a></li> <li> <a href="/d/W0001/p/A1002P137" data-tooltip="奇数求和"><b>A1002P137</b></a></li> <li> <a href="/d/W0001/p/A1002P33" data-tooltip="求和1"><b>A1002P33</b></a></li> <li> <a href="/d/W0001/p/A1002P142" data-tooltip="求公式和"><b>A1002P142</b></a></li> <li> <a href="/d/W0001/p/A1002P136" data-tooltip="求和2"><b>A1002P136</b></a></li> <li> <a href="/d/W0001/p/A1002P141" data-tooltip="奥运奖牌计数"><b>A1002P141</b></a></li> <li> <a href="/d/W0001/p/A1002P144" data-tooltip="均值"><b>A1002P144</b></a></li> <li> <a href="/d/W0001/p/A1002P150" data-tooltip="整数序列的元素最大跨度值"><b>A1002P150</b></a></li> <li> <a href="/d/W0001/p/A1002P154" data-tooltip="求最大因数"><b>A1002P154</b></a></li> <li> <a href="/d/W0001/p/A1002P155" data-tooltip="判断质数"><b>A1002P155</b></a></li> <li> <a href="/d/W0001/p/A1002P158" data-tooltip="质数问题1"><b>A1002P158</b></a></li> <li> <a href="/d/W0001/p/A1002P23" data-tooltip="小青蛙回来了"><b>A1002P23</b></a></li> <li> <a href="/d/W0001/p/A1002P80" data-tooltip="冰淇淋"><b>A1002P80</b></a></li> <li> <a href="/d/W0001/p/A1002P64" data-tooltip="矩形面积"><b>A1002P64</b></a></li> <li> <a href="/d/W0001/p/A1002P807" data-tooltip="快递费用"><b>A1002P807</b></a></li> <li> <a href="/d/W0001/p/A1002P747" data-tooltip="上学迟到.V2"><b>A1002P747</b></a></li> <li> <a href="/d/W0001/p/A1002P93" data-tooltip="购买水杯"><b>A1002P93</b></a></li> <li> <a href="/d/W0001/p/W0001P1210" data-tooltip="输出数字时钟"><b>W0001P1210</b></a></li> <li> <a href="/d/W0001/p/A1002P100" data-tooltip="包装箱"><b>A1002P100</b></a></li> <li> <a href="/d/W0001/p/A1002P102" data-tooltip="冷饮的价格"><b>A1002P102</b></a></li> <li> <a href="/d/W0001/p/A1002P104" data-tooltip="小明暑假的零花钱"><b>A1002P104</b></a></li> <li> <a href="/d/W0001/p/A1002P105" data-tooltip="求数的量级？"><b>A1002P105</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P109" data-tooltip="象棋大赛"><b>A1002P109</b></a></li> <li> <a href="/d/W0001/p/A1002P114" data-tooltip="BMI"><b>A1002P114</b></a></li> <li> <a href="/d/W0001/p/A1002P115" data-tooltip="数的性质"><b>A1002P115</b></a></li> <li> <a href="/d/W0001/p/A1002P14" data-tooltip="倒序输出10以内的自然数"><b>A1002P14</b></a></li> <li> <a href="/d/W0001/p/A1002P15" data-tooltip="输出2到n-1所有的整数"><b>A1002P15</b></a></li> <li> <a href="/d/W0001/p/A1002P19" data-tooltip="输出n以内所有的整数"><b>A1002P19</b></a></li> <li> <a href="/d/W0001/p/A1002P139" data-tooltip="奇数以及偶数的和"><b>A1002P139</b></a></li> <li> <a href="/d/W0001/p/A1002P145" data-tooltip="求整数的和与均值"><b>A1002P145</b></a></li> <li> <a href="/d/W0001/p/A1002P146" data-tooltip="财务管理"><b>A1002P146</b></a></li> <li> <a href="/d/W0001/p/A1002P147" data-tooltip="短信计费"><b>A1002P147</b></a></li> <li> <a href="/d/W0001/p/A1002P402" data-tooltip="最大值与最小值"><b>A1002P402</b></a></li> <li> <a href="/d/W0001/p/A1002P151" data-tooltip="数据统计"><b>A1002P151</b></a></li> <li> <a href="/d/W0001/p/A1002P159" data-tooltip="质数问题2"><b>A1002P159</b></a></li> <li> <a href="/d/W0001/p/A1002P456" data-tooltip="判断两位数的质数"><b>A1002P456</b></a></li> <li> <a href="/d/W0001/p/A1002P247" data-tooltip="[语言月赛202212] 洛谷三角洲"><b>A1002P247</b></a></li> <li> <a href="/d/W0001/p/A1002P1059" data-tooltip="剧院广场"><b>A1002P1059</b></a></li> <li> <a href="/d/W0001/p/A1002P112" data-tooltip="至少要买几瓶止咳糖浆？"><b>A1002P112</b></a></li> <li> <a href="/d/W0001/p/LUOGUP420" data-tooltip="小鱼会有危险吗"><b>LUOGUP420</b></a></li> <li> <a href="/d/W0001/p/A1002P489" data-tooltip="苹果和虫子2"><b>A1002P489</b></a></li> <li> <a href="/d/W0001/p/A1002P825" data-tooltip="数字口袋"><b>A1002P825</b></a></li> <li> <a href="/d/W0001/p/LUOGUP75" data-tooltip="[NOIP2012 普及组] 质因数分解"><b>LUOGUP75</b></a></li> <li> <a href="/d/W0001/p/LUOGUP7684" data-tooltip="最大公约数和最小公倍数"><b>LUOGUP7684</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8326" data-tooltip="[信息与未来 2018] 最大公约数"><b>LUOGUP8326</b></a></li> <li> <a href="/d/W0001/p/LUOGUP29" data-tooltip="[NOIP2001 普及组] 最大公约数和最小公倍数问题"><b>LUOGUP29</b></a></li> <li> <a href="/d/W0001/p/P001P775" data-tooltip="开学大采购"><b>P001P775</b></a></li> <li> <a href="/d/W0001/p/A1002P143" data-tooltip="计算公式的和2"><b>A1002P143</b></a></li> <li> <a href="/d/W0001/p/P001P776" data-tooltip="换钞票"><b>P001P776</b></a></li> <li> <a href="/d/W0001/p/P001P773" data-tooltip="买小猫小狗"><b>P001P773</b></a></li> <li> <a href="/d/W0001/p/A1002P398" data-tooltip="满足条件的数累加"><b>A1002P398</b></a></li> <li> <a href="/d/W0001/p/LUOGUP4670" data-tooltip="【深基4.例3】分类平均"><b>LUOGUP4670</b></a></li> <li> <a href="/d/W0001/p/A1002P427" data-tooltip="与指定数字相同的数的个数"><b>A1002P427</b></a></li> <li> <a href="/d/W0001/p/A1002P403" data-tooltip="求最高分最低分"><b>A1002P403</b></a></li> <li> <a href="/d/W0001/p/A1002P465" data-tooltip="【深基4.例3】分类平均"><b>A1002P465</b></a></li> <li> <a href="/d/W0001/p/A1002P395" data-tooltip="财务管理"><b>A1002P395</b></a></li> <li> <a href="/d/W0001/p/A1002P236" data-tooltip="多边形内角和"><b>A1002P236</b></a></li> <li> <a href="/d/W0001/p/A1002P401" data-tooltip="计算公式的和2"><b>A1002P401</b></a></li> <li> <a href="/d/W0001/p/A1002P526" data-tooltip="Book Reading"><b>A1002P526</b></a></li> <li> <a href="/d/W0001/p/A1002P424" data-tooltip="含k个3的数"><b>A1002P424</b></a></li> <li> <a href="/d/W0001/p/A1002P1112" data-tooltip="[语言月赛202304] 扶苏与 0"><b>A1002P1112</b></a></li> <li> <a href="/d/W0001/p/A1002P460" data-tooltip="最佳身体状态"><b>A1002P460</b></a></li> <li> <a href="/d/W0001/p/A1002P422" data-tooltip="倒序组合数字"><b>A1002P422</b></a></li> <li> <a href="/d/W0001/p/A1002P423" data-tooltip="数字反转"><b>A1002P423</b></a></li> <li> <a href="/d/W0001/p/A1002P457" data-tooltip="五位数倒序组合判断质数"><b>A1002P457</b></a></li> <li> <a href="/d/W0001/p/A1002P497" data-tooltip="短信计费"><b>A1002P497</b></a></li> <li> <a href="/d/W0001/p/A1002P399" data-tooltip="整数的个数"><b>A1002P399</b></a></li> <li> <a href="/d/W0001/p/A1002P671" data-tooltip="数1的个数"><b>A1002P671</b></a></li> <li> <a href="/d/W0001/p/A1002P667" data-tooltip="第n小的质数"><b>A1002P667</b></a></li> <li> <a href="/d/W0001/p/A1002P721" data-tooltip="定义函数输出《静夜思》"><b>A1002P721</b></a></li> <li> <a href="/d/W0001/p/A1002P722" data-tooltip="定义一个有参数的函数"><b>A1002P722</b></a></li> <li> <a href="/d/W0001/p/A1002P724" data-tooltip="求两个整数的最大数"><b>A1002P724</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P732" data-tooltip="求三个数的最大数"><b>A1002P732</b></a></li> <li> <a href="/d/W0001/p/A1002P726" data-tooltip="素数的个数"><b>A1002P726</b></a></li> <li> <a href="/d/W0001/p/A1002P728" data-tooltip="回文数个数"><b>A1002P728</b></a></li> <li> <a href="/d/W0001/p/A1002P730" data-tooltip="挛生素数"><b>A1002P730</b></a></li> <li> <a href="/d/W0001/p/A1002P731" data-tooltip="求出N以内的全部素数，并按每行五个数显示"><b>A1002P731</b></a></li> <li> <a href="/d/W0001/p/A1002P161" data-tooltip="纯粹素数"><b>A1002P161</b></a></li> <li> <a href="/d/W0001/p/A1002P758" data-tooltip="数根"><b>A1002P758</b></a></li> <li> <a href="/d/W0001/p/A1002P162" data-tooltip="纯粹合数"><b>A1002P162</b></a></li> <li> <a href="/d/W0001/p/A1002P959" data-tooltip="【深基3.例7】肥胖问题"><b>A1002P959</b></a></li> <li> <a href="/d/W0001/p/A1002P860" data-tooltip="均值"><b>A1002P860</b></a></li> <li> <a href="/d/W0001/p/A1002P991" data-tooltip="[NOIP2004 普及组] 不高兴的津津"><b>A1002P991</b></a></li> <li> <a href="/d/W0001/p/A1002P492" data-tooltip="与7无关的数"><b>A1002P492</b></a></li> <li> <a href="/d/W0001/p/A1002P435" data-tooltip="回文数"><b>A1002P435</b></a></li> <li> <a href="/d/W0001/p/P001P296" data-tooltip="分跳绳"><b>P001P296</b></a></li> <li> <a href="/d/W0001/p/P001P27" data-tooltip="[语言月赛202210] 玉桂狗"><b>P001P27</b></a></li> <li> <a href="/d/W0001/p/A1002P748" data-tooltip="打折优惠"><b>A1002P748</b></a></li> <li> <a href="/d/W0001/p/A1002P1045" data-tooltip="百货商场"><b>A1002P1045</b></a></li> <li> <a href="/d/W0001/p/A1002P832" data-tooltip="课桌"><b>A1002P832</b></a></li> <li> <a href="/d/W0001/p/A1002P499" data-tooltip="药房管理"><b>A1002P499</b></a></li> <li> <a href="/d/W0001/p/A1002P823" data-tooltip="集卡"><b>A1002P823</b></a></li> <li> <a href="/d/W0001/p/A1002P999" data-tooltip="Div"><b>A1002P999</b></a></li> <li> <a href="/d/W0001/p/A1002P1148" data-tooltip="音乐播放器"><b>A1002P1148</b></a></li> <li> <a href="/d/W0001/p/A1002P1155" data-tooltip="判断偶数"><b>A1002P1155</b></a></li> <li> <a href="/d/W0001/p/A1002P1175" data-tooltip="安排座位"><b>A1002P1175</b></a></li> <li> <a href="/d/W0001/p/A1002P639" data-tooltip="求因子数量"><b>A1002P639</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6847" data-tooltip="输出绝对值"><b>LUOGUP6847</b></a></li> <li> <a href="/d/W0001/p/LUOGUP9429" data-tooltip="[语言月赛 202401] 分饼干 I"><b>LUOGUP9429</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8744" data-tooltip="[NICA #2] 台式烤香肠"><b>LUOGUP8744</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6858" data-tooltip="分段函数"><b>LUOGUP6858</b></a></li> <li> <a href="/d/W0001/p/LUOGUP46" data-tooltip="[NOIP2005 普及组] 陶陶摘苹果"><b>LUOGUP46</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP457" data-tooltip="晶晶赴约会"><b>OPENJUDGEP457</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP577" data-tooltip="求平均年龄"><b>OPENJUDGEP577</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP596" data-tooltip="字符三角形"><b>OPENJUDGEP596</b></a></li> <li> <a href="/d/W0001/p/DFBYP396" data-tooltip="【入门】小丽找数？"><b>DFBYP396</b></a></li> <li> <a href="/d/W0001/p/DFBYP598" data-tooltip="【入门】请输出n~1之间所有的整数"><b>DFBYP598</b></a></li> <li> <a href="/d/W0001/p/DFBYP599" data-tooltip="【入门】请输出带有特殊尾数的数"><b>DFBYP599</b></a></li> <li> <a href="/d/W0001/p/DFBYP86" data-tooltip="【入门】寻找雷劈数"><b>DFBYP86</b></a></li> <li> <a href="/d/W0001/p/DFBYP638" data-tooltip="【入门】奇怪的数？"><b>DFBYP638</b></a></li> <li> <a href="/d/W0001/p/DFBYP91" data-tooltip="【入门】同因查找"><b>DFBYP91</b></a></li> <li> <a href="/d/W0001/p/DFBYP562" data-tooltip="【入门】宇航员选拔"><b>DFBYP562</b></a></li> <li> <a href="/d/W0001/p/DFBYP394" data-tooltip="【入门】与7无关的数？"><b>DFBYP394</b></a></li> <li> <a href="/d/W0001/p/DFBYP615" data-tooltip="【入门】输出满足条件的整数4"><b>DFBYP615</b></a></li> <li> <a href="/d/W0001/p/DFBYP614" data-tooltip="【入门】输出满足条件的整数3"><b>DFBYP614</b></a></li> <li> <a href="/d/W0001/p/DFBYP684" data-tooltip="【入门】数字直角（1）"><b>DFBYP684</b></a></li> <li> <a href="/d/W0001/p/DFBYP559" data-tooltip="【入门】游乐设施"><b>DFBYP559</b></a></li> <li> <a href="/d/W0001/p/DFBYP549" data-tooltip="【入门】计算考试需要的教室"><b>DFBYP549</b></a></li> <li> <a href="/d/W0001/p/F0001P597" data-tooltip="画矩形"><b>F0001P597</b></a></li> <li> <a href="/d/W0001/p/DFBYP395" data-tooltip="【入门】恐龙园买玩具？"><b>DFBYP395</b></a></li> </ul></div> </div> </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">最近活动</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <ul> <li><a class="contest-type--homework" href="/d/W0001/homework/668f293e2cc4de29b559a5be"> 2024年7月13日8:30班【2】暑假第6课 循环模拟强化 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667be010d5ee05a9cfe6fd2f"> 2024年7月12日 8:30班【2】暑假第5课 一阶段总回顾【顺序、分支】 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bde3ed5ee05a9cfe6f8ef"> 2024年7月11日 8:30班【2】暑假第4课 枚举[循环] <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdcccd5ee05a9cfe6f450"> 2024年7月10日 8:30班【2】暑假第3课 嵌套循环的进阶应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdc55d5ee05a9cfe6f317"> 2024年7月9日 8:30班【2】暑假第2课 自定义函数进阶 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/667bdc07d5ee05a9cfe6f284"> 2024年7月8日 8:30班【2】暑假第1课 自定义函数应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/666d6a5a7eae9f89336ed30d"> 2024年6月15日 周六晚6:30 因数问题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/666314fc9ce3ee63df634941"> 2024年6月8日 周六晚6:30 均值进阶、最值问题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66593e3415bf1e7980b2fe79"> 2024年6月1日 周六晚6:30 循环输入的应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6652b4e3731e4f15703ff9ef"> 2024年5月26日 周日上午10:40 自定义函数基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6651c79c731e4f15703ed166"> 2024年5月25日 周六晚6:30 for进阶 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6649ecfda8161cfa14308f88"> 2024年5月19日 周日晚6:30 循环嵌套枚举 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6640c00d9ff061bfd2eb819a"> 2024年5月12日 循环嵌套与嵌套枚举 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66376112d8fe700f0a96732f"> 2024年5月5日 郝铮 循环嵌套 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/661a03ee87b210d79c0e11f0"> 2024年4月13日_一阶段测试前_知识点回顾补习题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/660e0c1c05e2e24e525c588c"> 2024年4月4日_模拟过程2 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/66093b432faa61e7f72ac958"> 2024年3月31日_郝铮_模拟过程基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/660000e5f26c85f66d34c2d5"> 2024年3月24日_周日晚6:30_循环基础回顾 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65f6c9990af942acbf2418a5"> 2024年3月17日_周日晚6:30_最小公倍数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65ed97971262bacd76242f84"> 2024年3月10日_郝铮个人练习题_公约数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65e7f114f1cf5ef3a82ec837"> 周六晚6:30班_补题练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d69fa2b2cb853d3a253eea"> 2024年2月22日__重新组合数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d40e696856afdb5df48526"> 2024年2月20日_while循环拆数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65d14f48c82e8ec49fe5e2af"> 2024年2月18日_郝铮练习题_while循环基础 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65bae748057b4522090398ac"> 2024年2月1日_因数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65a35178bc37e08db95d4b3b"> 2024年1月28日_郝铮_循环输入计数、均值、最值 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6590b6986094e1d6b15a2245"> 2023年12月31日_郝铮_求和与计数 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/65869e8e1ad900d8eae866c3"> 2023年12月23日_郝铮_for循环基础与分支回顾 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/657502065031d8469e60face"> 2023年12月10日_郝铮_分支难题 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6550387ea68626844040fbc6"> 2023年11月12日_周日九点一对一_分支回顾练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/653dad8b9a295856447bfa9a"> 2023年10月29日_周日九点一对一_郝铮_顺序与分支综合练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/6529f0de76ea90cdae3b7448"> 分支进阶练习 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/651cfa63808ae6bc3efef204"> 2023年10月4日_单独辅导班_赋值语句与模拟法 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64fc5256dca1ff8e071ec29b"> 周日九点一对一单循环枚举法的应用 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64f29438e70cd31d0ea2b064"> 2023年9月2日_秋零基础班一 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64dc8cd438608da1af9a27d8"> 一期零基础单独辅导班第4课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64dacbb538608da1af98b4a5"> 一期零基础单独辅导班第3课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64d8499b38608da1af97771a"> 一期零基础单独辅导班第2课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> <li><a class="contest-type--homework" href="/d/W0001/homework/64d7965b38608da1af9747ce"> 一期零基础单独辅导班第1课时 <span class="contest-type-tag"><span class="icon icon-award"></span>作业</span> </a></li> </ul> </div> </div> </li><li class="section__tab-item"> <h1 class="section__tab-title">Stat</h1> <div class="section__tab-main"> <div class="typo section__body" id="history_stat" style="width:100%;height:500px"> </div> </div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">Rating</h1> <div class="section__tab-main"> <div class="typo section__body" id="history_rating" style="width:100%;height:500px"></div> </div> </li> </ul> </div> </div> </div> </div> <div class="medium-3 columns"> <div class="section side"> <div class="section__body"> <div class="balancer sidebar-user-stat"> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">213</div> <div class="numbox__text">已递交</div> </div> </div> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">203</div> <div class="numbox__text">已通过</div> </div> </div> <div class="balancer__body"> <div class="numbox"> <div class="numbox__num medium">0</div> <div class="numbox__text">题解被赞</div> </div> </div> </div> </div> </div> <div class="section side"> <div class="section__header"> <h2 class="section__title">题目标签</h2> </div> <div class="typo section__body no-media"> <dl class="exlarge horizontal"> <dt>一阶段</dt> <dd>98</dd> <dt>单循环结构</dt> <dd>48</dd> <dt>多分支、嵌套分支结构</dt> <dd>13</dd> <dt>双分支结构</dt> <dd>13</dd> <dt>循环嵌套-打印图形</dt> <dd>12</dd> <dt>自定义函数</dt> <dd>12</dd> <dt>求和计数</dt> <dd>10</dd> <dt>数据的输入和输出</dt> <dd>9</dd> <dt>数据的运算</dt> <dd>9</dd> <dt>for循环</dt> <dd>9</dd> <dt>短除法拆数</dt> <dd>8</dd> <dt>分支结构</dt> <dd>8</dd> <dt>质数</dt> <dd>7</dd> <dt>输入输出</dt> <dd>7</dd> <dt>多重循环结构</dt> <dd>6</dd> <dt>O2优化</dt> <dd>6</dd> <dt>简单循环</dt> <dd>6</dd> <dt>均值</dt> <dd>5</dd> <dt>循环结构</dt> <dd>5</dd> <dt>while循环</dt> <dd>4</dd> </dl> </div> </div> </div> </div> </div> <div class="footer"> <div class="row"><div class="columns"> <div class="row footer__links"> <div class="medium-3 large-2 columns footer__category expandable"> <h1> 状态 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="/d/W0001/record">评测队列</a></li> <li class="footer__category__item"><a href="/d/W0001/status">服务状态</a></li> </ul></div> </div> <div class="medium-3 large-2 columns footer__category expandable"> <h1> 开发 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="https://github.com/hydro-dev/Hydro" target="_blank">开源</a></li> <li class="footer__category__item"><a href="/d/W0001/api">API</a></li> </ul></div> </div> <div class="medium-3 large-2 columns footer__category expandable end"> <h1> 支持 <span class="expand-icon"> <span class="icon icon-expand_more"></span> </span> </h1> <div class="footer__category__expander"><ul class="footer__category__list"> <li class="footer__category__item"><a href="/d/W0001/wiki/help">帮助</a></li> <li class="footer__category__item"><a href="/d/W0001/wiki/about#contact">QQ 群</a></li> </ul></div> </div> </div> <div class="footer__extra-link clearfix"> <div class="footer__extra-left"> <ol class="clearfix"> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about">关于</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#contact">联系我们</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#privacy">隐私</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#tos">服务条款</a></li> <li class="footer__extra-link-item"><a href="/d/W0001/wiki/about#contact">版权申诉</a></li> <li class="footer__extra-link-item nojs--hide" data-dropdown-target="#menu-footer-lang"> <span><span class="icon icon-global"></span> Language <span class="icon icon-expand_less"></span></span> <ol class="dropdown-target menu" id="menu-footer-lang"><li class="menu__item"><a class="menu__link" href="/d/W0001/language/en">English</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/ko">한국어</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/zh">简体中文</a></li><li class="menu__item"><a class="menu__link" href="/d/W0001/language/zh_TW">正體中文</a></li></ol> </li> <li class="footer__extra-link-item"> <a href="/legacy?legacy=true">兼容模式</a> </li> <li class="footer__extra-link-item nojs--hide" data-dropdown-target="#menu-footer-theme"> <span><span class="icon icon-global"></span> 主题 <span class="icon icon-expand_less"></span></span> <ol class="dropdown-target menu" id="menu-footer-theme"> <li class="menu__item"><a class="menu__link" href="/d/W0001/set_theme/light">亮色</a></li> <li class="menu__item"><a class="menu__link" href="/d/W0001/set_theme/dark">暗色</a></li> </ol> </li> </ol> </div> <div class="footer__extra-right"> <ol class="clearfix"><li class="footer__extra-link-item"></li><li class="footer__extra-link-item"><style>.uname--lv1{color:#cccccc!important;}.uname--lv2{color:green!important;}.uname--lv3{color:#03a89e!important;}.uname--lv4{color:blue!important;}.uname--lv5{color:#a0a!important;}.uname--lv6{color:#ffcc87!important;}.uname--lv7{color:#ffbb55!important;}.uname--lv8{color:#ff7777!important;}.uname--lv9{color:#ff3333!important;}.uname--lv10{color:#aa0100!important;}.badge--lv1,.badge--lv2,.badge--lv3,.badge--lv4,.badge--lv5,.badge--lv6,.badge--lv7,.badge--lv8,.badge--lv9,.badge--lv10{display:none!important;}</style> </li><li class="footer__extra-link-item"></li><li class="footer__extra-link-item">Worker 0, 40ms</li> <!-- Prepare 0ms --> <!-- Method 11ms --> <li class="footer__extra-link-item">Powered by <a href="https://hydro.js.org">Hydro v4.12.3</a> Community</li> </ol> </div> </div> </div></div> </div> </div> <script> var UiContextNew = '{"udoc":{"_id":1051,"mail":"zpZAWdPXVxff@hydro.local","uname":"\u90DD\u94EE","hashType":"hydro","priv":4,"regat":"2023-07-06T10:09:52.394Z","loginat":"2024-02-19T11:31:20.407Z","perm":"BigInt::10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652772046470338450555521","role":"\u5B66\u751F","scope":"BigInt::-1","tfa":false,"authn":false,"group":["\u5468\u65E5\u4E0A\u534810:40","\u5468\u65E5\u665A6:30","1051"],"domains":[],"viewLang":"zh","timeZone":"Asia/Shanghai","codeLang":"cc.cc14o2","codeTemplate":"","avatar":"gravatar:zpZAWdPXVxff@hydro.local","gender":2,"school":"Turing","studentId":"1234567","phone":"15169626699","backgroundImage":"/components/profile/backgrounds/1.jpg","unreadMsg":0,"pinnedDomains":["F0001","P001","W0001"],"fontFamily":"Open Sans","codeFontFamily":"Source Code Pro","preferredEditorType":"sv","monacoTheme":"vs-light","theme":"light","showInvisibleChar":false,"formatCode":true,"realname":"\u90DD\u94EE","skipAnimate":false,"showTimeAgo":true,"coin":57200,"displayName":"\u90DD\u94EE","nAccept":203,"nSubmit":213,"rp":0,"rpInfo":{},"level":0},"history":[{"time":"2024-07-13T16:00:00.000Z","nAccept":203,"rp":0,"rpInfo":{}},{"time":"2024-07-12T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":13,"newAccept":8,"nAccept":203},{"time":"2024-07-11T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":21,"newAccept":12,"nAccept":197},{"time":"2024-07-10T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":14,"newAccept":9,"nAccept":185},{"time":"2024-07-09T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":10,"newAccept":4,"nAccept":176},{"time":"2024-07-08T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":6,"newAccept":5,"nAccept":172},{"time":"2024-07-07T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-06T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-05T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-04T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-03T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-02T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-07-01T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-30T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-29T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-28T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-27T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-26T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-25T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-24T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-23T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-22T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-21T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-20T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-19T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-18T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-17T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-16T16:00:00.000Z","rp":0,"rpInfo":{},"nAccept":167},{"time":"2024-06-15T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":21,"newAccept":5,"nAccept":167},{"time":"2024-06-14T16:00:00.000Z","rp":0,"rpInfo":{},"nSubmit":2,"newAccept":1,"nAccept":166}]}'; var UserContextNew = '{}'; </script> </body> </html>``` ```
.user-profile-bg { background-image: url("/components/profile/backgrounds/1.jpg"), url("/components/profile/backgrounds/1.jpg"); }郝铮 (郝铮)
UID: 1051, 注册于 2023-7-6 18:09:52, 最后登录于 2024-2-19 19:31:20, 最后活动于 2024-7-13 9:03:15.
解决了 203 道题目，RP: 0 (No. ?)
-
个人简介
该用户太懒，这里啥也没写 (´・ω・｀)</div> </li> <li class="section__tab-item"> <h1 class="section__tab-title">通过的题目</h1> <div class="section__tab-main"> <div class="typo section__body no-media"> <div class="row"> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P381" data-tooltip="角谷猜想"><b>A1002P381</b></a></li> <li> <a href="/d/W0001/p/A1002P17" data-tooltip="一尺之棰"><b>A1002P17</b></a></li> <li> <a href="/d/W0001/p/A1002P18" data-tooltip="小明学游泳"><b>A1002P18</b></a></li> <li> <a href="/d/W0001/p/A1002P128" data-tooltip="数字统计"><b>A1002P128</b></a></li> <li> <a href="/d/W0001/p/A1002P386" data-tooltip="数中有几个0"><b>A1002P386</b></a></li> <li> <a href="/d/W0001/p/A1002P153" data-tooltip="求最小因数"><b>A1002P153</b></a></li> <li> <a href="/d/W0001/p/A1002P573" data-tooltip="求最大公约数"><b>A1002P573</b></a></li> <li> <a href="/d/W0001/p/A1002P574" data-tooltip="两个自然数m和n的最小公倍数"><b>A1002P574</b></a></li> <li> <a href="/d/W0001/p/A1002P575" data-tooltip="最大正方形边长"><b>A1002P575</b></a></li> <li> <a href="/d/W0001/p/A1002P436" data-tooltip="数值计算"><b>A1002P436</b></a></li> <li> <a href="/d/W0001/p/A1002P49" data-tooltip="输出第二个整数"><b>A1002P49</b></a></li> <li> <a href="/d/W0001/p/A1002P50" data-tooltip="输入和输出实型数据"><b>A1002P50</b></a></li> <li> <a href="/d/W0001/p/A1002P52" data-tooltip="变量的解释"><b>A1002P52</b></a></li> <li> <a href="/d/W0001/p/A1002P53" data-tooltip="换行分隔输出"><b>A1002P53</b></a></li> <li> <a href="/d/W0001/p/A1002P801" data-tooltip="输入输出3"><b>A1002P801</b></a></li> <li> <a href="/d/W0001/p/A1002P54" data-tooltip="字符菱形"><b>A1002P54</b></a></li> <li> <a href="/d/W0001/p/A1002P560" data-tooltip="图形打印正方形"><b>A1002P560</b></a></li> <li> <a href="/d/W0001/p/A1002P593" data-tooltip="图形打印长方形"><b>A1002P593</b></a></li> <li> <a href="/d/W0001/p/A1002P594" data-tooltip="图形打印直角三角形"><b>A1002P594</b></a></li> <li> <a href="/d/W0001/p/A1002P596" data-tooltip="数字图形正方形一"><b>A1002P596</b></a></li> <li> <a href="/d/W0001/p/A1002P597" data-tooltip="数字图形正方形二"><b>A1002P597</b></a></li> <li> <a href="/d/W0001/p/A1002P598" data-tooltip="数字图形三角形一"><b>A1002P598</b></a></li> <li> <a href="/d/W0001/p/A1002P599" data-tooltip="数字图形三角形二"><b>A1002P599</b></a></li> <li> <a href="/d/W0001/p/A1002P562" data-tooltip="星号倒直角"><b>A1002P562</b></a></li> <li> <a href="/d/W0001/p/A1002P563" data-tooltip="平行四边形"><b>A1002P563</b></a></li> <li> <a href="/d/W0001/p/A1002P602" data-tooltip="星号倒等腰三角形"><b>A1002P602</b></a></li> <li> <a href="/d/W0001/p/A1002P568" data-tooltip="星号梯形"><b>A1002P568</b></a></li> <li> <a href="/d/W0001/p/A1002P569" data-tooltip="9*9乘法公式"><b>A1002P569</b></a></li> <li> <a href="/d/W0001/p/A1002P650" data-tooltip="公园买门票"><b>A1002P650</b></a></li> <li> <a href="/d/W0001/p/A1002P635" data-tooltip="阿凡提的难题"><b>A1002P635</b></a></li> <li> <a href="/d/W0001/p/A1002P638" data-tooltip="三色球问题"><b>A1002P638</b></a></li> <li> <a href="/d/W0001/p/A1002P385" data-tooltip="数位之和"><b>A1002P385</b></a></li> <li> <a href="/d/W0001/p/A1002P51" data-tooltip="输入输出字符型数据"><b>A1002P51</b></a></li> <li> <a href="/d/W0001/p/A1002P46" data-tooltip="声明变量并输出"><b>A1002P46</b></a></li> <li> <a href="/d/W0001/p/A1002P477" data-tooltip="输出图形"><b>A1002P477</b></a></li> <li> <a href="/d/W0001/p/A1002P663" data-tooltip="判断能否被3，5，7整除"><b>A1002P663</b></a></li> <li> <a href="/d/W0001/p/A1002P111" data-tooltip="求四个数的最大数"><b>A1002P111</b></a></li> <li> <a href="/d/W0001/p/A1002P3" data-tooltip="小鱼的游泳时间"><b>A1002P3</b></a></li> <li> <a href="/d/W0001/p/A1002P60" data-tooltip="节省多少时间"><b>A1002P60</b></a></li> <li> <a href="/d/W0001/p/A1002P61" data-tooltip="输出整数12345各个位上的数字之和"><b>A1002P61</b></a></li> <li> <a href="/d/W0001/p/A1002P584" data-tooltip="分磁带"><b>A1002P584</b></a></li> <li> <a href="/d/W0001/p/A1002P583" data-tooltip="分钱"><b>A1002P583</b></a></li> <li> <a href="/d/W0001/p/A1002P987" data-tooltip="A + B 问题"><b>A1002P987</b></a></li> <li> <a href="/d/W0001/p/A1002P67" data-tooltip="时分秒"><b>A1002P67</b></a></li> <li> <a href="/d/W0001/p/A1002P587" data-tooltip="【深基2.例8】再分肥宅水"><b>A1002P587</b></a></li> <li> <a href="/d/W0001/p/A1002P771" data-tooltip="五舍六入"><b>A1002P771</b></a></li> <li> <a href="/d/W0001/p/A1002P581" data-tooltip="鸡兔同笼问题"><b>A1002P581</b></a></li> <li> <a href="/d/W0001/p/A1002P582" data-tooltip="车棚"><b>A1002P582</b></a></li> <li> <a href="/d/W0001/p/A1002P585" data-tooltip="【基础题】五位好朋友相聚"><b>A1002P585</b></a></li> <li> <a href="/d/W0001/p/A1002P980" data-tooltip="分糖果"><b>A1002P980</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P557" data-tooltip="交换输出"><b>A1002P557</b></a></li> <li> <a href="/d/W0001/p/A1002P559" data-tooltip="交换输出 3"><b>A1002P559</b></a></li> <li> <a href="/d/W0001/p/A1002P77" data-tooltip="整数判断"><b>A1002P77</b></a></li> <li> <a href="/d/W0001/p/A1002P94" data-tooltip="超市卖电池"><b>A1002P94</b></a></li> <li> <a href="/d/W0001/p/A1002P89" data-tooltip="苹果和虫子"><b>A1002P89</b></a></li> <li> <a href="/d/W0001/p/A1002P92" data-tooltip="需要几辆车"><b>A1002P92</b></a></li> <li> <a href="/d/W0001/p/A1002P95" data-tooltip="十位大还是个位大"><b>A1002P95</b></a></li> <li> <a href="/d/W0001/p/A1002P88" data-tooltip="点和正方形的关系"><b>A1002P88</b></a></li> <li> <a href="/d/W0001/p/A1002P694" data-tooltip="顺序输出"><b>A1002P694</b></a></li> <li> <a href="/d/W0001/p/A1002P695" data-tooltip="顺序输出2"><b>A1002P695</b></a></li> <li> <a href="/d/W0001/p/A1002P91" data-tooltip="装苹果"><b>A1002P91</b></a></li> <li> <a href="/d/W0001/p/A1002P85" data-tooltip="有一门课不及格的学生"><b>A1002P85</b></a></li> <li> <a href="/d/W0001/p/A1002P83" data-tooltip="判断闰年"><b>A1002P83</b></a></li> <li> <a href="/d/W0001/p/A1002P101" data-tooltip="乘车费用"><b>A1002P101</b></a></li> <li> <a href="/d/W0001/p/A1002P772" data-tooltip="是否是连续奇数"><b>A1002P772</b></a></li> <li> <a href="/d/W0001/p/A1002P463" data-tooltip="水仙花数 1"><b>A1002P463</b></a></li> <li> <a href="/d/W0001/p/A1002P81" data-tooltip="判断3的倍数"><b>A1002P81</b></a></li> <li> <a href="/d/W0001/p/A1002P977" data-tooltip="收集瓶盖赢大奖"><b>A1002P977</b></a></li> <li> <a href="/d/W0001/p/A1002P484" data-tooltip="小明家的电费"><b>A1002P484</b></a></li> <li> <a href="/d/W0001/p/A1002P815" data-tooltip="求生者的欲望"><b>A1002P815</b></a></li> <li> <a href="/d/W0001/p/A1002P527" data-tooltip="国王移动的步数"><b>A1002P527</b></a></li> <li> <a href="/d/W0001/p/A1002P485" data-tooltip="出租车费（小学组2015第一题）"><b>A1002P485</b></a></li> <li> <a href="/d/W0001/p/A1002P437" data-tooltip="输出30个星号"><b>A1002P437</b></a></li> <li> <a href="/d/W0001/p/A1002P13" data-tooltip="输出1到10的整数"><b>A1002P13</b></a></li> <li> <a href="/d/W0001/p/A1002P21" data-tooltip="100以内的偶数"><b>A1002P21</b></a></li> <li> <a href="/d/W0001/p/A1002P237" data-tooltip="输出符合条件的数"><b>A1002P237</b></a></li> <li> <a href="/d/W0001/p/A1002P34" data-tooltip="输入n，输出算式1+2+3+...+n"><b>A1002P34</b></a></li> <li> <a href="/d/W0001/p/A1002P140" data-tooltip="整数的个数"><b>A1002P140</b></a></li> <li> <a href="/d/W0001/p/A1002P32" data-tooltip="计算1+2+…+100的和"><b>A1002P32</b></a></li> <li> <a href="/d/W0001/p/A1002P137" data-tooltip="奇数求和"><b>A1002P137</b></a></li> <li> <a href="/d/W0001/p/A1002P33" data-tooltip="求和1"><b>A1002P33</b></a></li> <li> <a href="/d/W0001/p/A1002P142" data-tooltip="求公式和"><b>A1002P142</b></a></li> <li> <a href="/d/W0001/p/A1002P136" data-tooltip="求和2"><b>A1002P136</b></a></li> <li> <a href="/d/W0001/p/A1002P141" data-tooltip="奥运奖牌计数"><b>A1002P141</b></a></li> <li> <a href="/d/W0001/p/A1002P144" data-tooltip="均值"><b>A1002P144</b></a></li> <li> <a href="/d/W0001/p/A1002P150" data-tooltip="整数序列的元素最大跨度值"><b>A1002P150</b></a></li> <li> <a href="/d/W0001/p/A1002P154" data-tooltip="求最大因数"><b>A1002P154</b></a></li> <li> <a href="/d/W0001/p/A1002P155" data-tooltip="判断质数"><b>A1002P155</b></a></li> <li> <a href="/d/W0001/p/A1002P158" data-tooltip="质数问题1"><b>A1002P158</b></a></li> <li> <a href="/d/W0001/p/A1002P23" data-tooltip="小青蛙回来了"><b>A1002P23</b></a></li> <li> <a href="/d/W0001/p/A1002P80" data-tooltip="冰淇淋"><b>A1002P80</b></a></li> <li> <a href="/d/W0001/p/A1002P64" data-tooltip="矩形面积"><b>A1002P64</b></a></li> <li> <a href="/d/W0001/p/A1002P807" data-tooltip="快递费用"><b>A1002P807</b></a></li> <li> <a href="/d/W0001/p/A1002P747" data-tooltip="上学迟到.V2"><b>A1002P747</b></a></li> <li> <a href="/d/W0001/p/A1002P93" data-tooltip="购买水杯"><b>A1002P93</b></a></li> <li> <a href="/d/W0001/p/W0001P1210" data-tooltip="输出数字时钟"><b>W0001P1210</b></a></li> <li> <a href="/d/W0001/p/A1002P100" data-tooltip="包装箱"><b>A1002P100</b></a></li> <li> <a href="/d/W0001/p/A1002P102" data-tooltip="冷饮的价格"><b>A1002P102</b></a></li> <li> <a href="/d/W0001/p/A1002P104" data-tooltip="小明暑假的零花钱"><b>A1002P104</b></a></li> <li> <a href="/d/W0001/p/A1002P105" data-tooltip="求数的量级？"><b>A1002P105</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P109" data-tooltip="象棋大赛"><b>A1002P109</b></a></li> <li> <a href="/d/W0001/p/A1002P114" data-tooltip="BMI"><b>A1002P114</b></a></li> <li> <a href="/d/W0001/p/A1002P115" data-tooltip="数的性质"><b>A1002P115</b></a></li> <li> <a href="/d/W0001/p/A1002P14" data-tooltip="倒序输出10以内的自然数"><b>A1002P14</b></a></li> <li> <a href="/d/W0001/p/A1002P15" data-tooltip="输出2到n-1所有的整数"><b>A1002P15</b></a></li> <li> <a href="/d/W0001/p/A1002P19" data-tooltip="输出n以内所有的整数"><b>A1002P19</b></a></li> <li> <a href="/d/W0001/p/A1002P139" data-tooltip="奇数以及偶数的和"><b>A1002P139</b></a></li> <li> <a href="/d/W0001/p/A1002P145" data-tooltip="求整数的和与均值"><b>A1002P145</b></a></li> <li> <a href="/d/W0001/p/A1002P146" data-tooltip="财务管理"><b>A1002P146</b></a></li> <li> <a href="/d/W0001/p/A1002P147" data-tooltip="短信计费"><b>A1002P147</b></a></li> <li> <a href="/d/W0001/p/A1002P402" data-tooltip="最大值与最小值"><b>A1002P402</b></a></li> <li> <a href="/d/W0001/p/A1002P151" data-tooltip="数据统计"><b>A1002P151</b></a></li> <li> <a href="/d/W0001/p/A1002P159" data-tooltip="质数问题2"><b>A1002P159</b></a></li> <li> <a href="/d/W0001/p/A1002P456" data-tooltip="判断两位数的质数"><b>A1002P456</b></a></li> <li> <a href="/d/W0001/p/A1002P247" data-tooltip="[语言月赛202212] 洛谷三角洲"><b>A1002P247</b></a></li> <li> <a href="/d/W0001/p/A1002P1059" data-tooltip="剧院广场"><b>A1002P1059</b></a></li> <li> <a href="/d/W0001/p/A1002P112" data-tooltip="至少要买几瓶止咳糖浆？"><b>A1002P112</b></a></li> <li> <a href="/d/W0001/p/LUOGUP420" data-tooltip="小鱼会有危险吗"><b>LUOGUP420</b></a></li> <li> <a href="/d/W0001/p/A1002P489" data-tooltip="苹果和虫子2"><b>A1002P489</b></a></li> <li> <a href="/d/W0001/p/A1002P825" data-tooltip="数字口袋"><b>A1002P825</b></a></li> <li> <a href="/d/W0001/p/LUOGUP75" data-tooltip="[NOIP2012 普及组] 质因数分解"><b>LUOGUP75</b></a></li> <li> <a href="/d/W0001/p/LUOGUP7684" data-tooltip="最大公约数和最小公倍数"><b>LUOGUP7684</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8326" data-tooltip="[信息与未来 2018] 最大公约数"><b>LUOGUP8326</b></a></li> <li> <a href="/d/W0001/p/LUOGUP29" data-tooltip="[NOIP2001 普及组] 最大公约数和最小公倍数问题"><b>LUOGUP29</b></a></li> <li> <a href="/d/W0001/p/P001P775" data-tooltip="开学大采购"><b>P001P775</b></a></li> <li> <a href="/d/W0001/p/A1002P143" data-tooltip="计算公式的和2"><b>A1002P143</b></a></li> <li> <a href="/d/W0001/p/P001P776" data-tooltip="换钞票"><b>P001P776</b></a></li> <li> <a href="/d/W0001/p/P001P773" data-tooltip="买小猫小狗"><b>P001P773</b></a></li> <li> <a href="/d/W0001/p/A1002P398" data-tooltip="满足条件的数累加"><b>A1002P398</b></a></li> <li> <a href="/d/W0001/p/LUOGUP4670" data-tooltip="【深基4.例3】分类平均"><b>LUOGUP4670</b></a></li> <li> <a href="/d/W0001/p/A1002P427" data-tooltip="与指定数字相同的数的个数"><b>A1002P427</b></a></li> <li> <a href="/d/W0001/p/A1002P403" data-tooltip="求最高分最低分"><b>A1002P403</b></a></li> <li> <a href="/d/W0001/p/A1002P465" data-tooltip="【深基4.例3】分类平均"><b>A1002P465</b></a></li> <li> <a href="/d/W0001/p/A1002P395" data-tooltip="财务管理"><b>A1002P395</b></a></li> <li> <a href="/d/W0001/p/A1002P236" data-tooltip="多边形内角和"><b>A1002P236</b></a></li> <li> <a href="/d/W0001/p/A1002P401" data-tooltip="计算公式的和2"><b>A1002P401</b></a></li> <li> <a href="/d/W0001/p/A1002P526" data-tooltip="Book Reading"><b>A1002P526</b></a></li> <li> <a href="/d/W0001/p/A1002P424" data-tooltip="含k个3的数"><b>A1002P424</b></a></li> <li> <a href="/d/W0001/p/A1002P1112" data-tooltip="[语言月赛202304] 扶苏与 0"><b>A1002P1112</b></a></li> <li> <a href="/d/W0001/p/A1002P460" data-tooltip="最佳身体状态"><b>A1002P460</b></a></li> <li> <a href="/d/W0001/p/A1002P422" data-tooltip="倒序组合数字"><b>A1002P422</b></a></li> <li> <a href="/d/W0001/p/A1002P423" data-tooltip="数字反转"><b>A1002P423</b></a></li> <li> <a href="/d/W0001/p/A1002P457" data-tooltip="五位数倒序组合判断质数"><b>A1002P457</b></a></li> <li> <a href="/d/W0001/p/A1002P497" data-tooltip="短信计费"><b>A1002P497</b></a></li> <li> <a href="/d/W0001/p/A1002P399" data-tooltip="整数的个数"><b>A1002P399</b></a></li> <li> <a href="/d/W0001/p/A1002P671" data-tooltip="数1的个数"><b>A1002P671</b></a></li> <li> <a href="/d/W0001/p/A1002P667" data-tooltip="第n小的质数"><b>A1002P667</b></a></li> <li> <a href="/d/W0001/p/A1002P721" data-tooltip="定义函数输出《静夜思》"><b>A1002P721</b></a></li> <li> <a href="/d/W0001/p/A1002P722" data-tooltip="定义一个有参数的函数"><b>A1002P722</b></a></li> <li> <a href="/d/W0001/p/A1002P724" data-tooltip="求两个整数的最大数"><b>A1002P724</b></a></li> </ul></div> <div class="medium-3 columns"><ul> <li> <a href="/d/W0001/p/A1002P732" data-tooltip="求三个数的最大数"><b>A1002P732</b></a></li> <li> <a href="/d/W0001/p/A1002P726" data-tooltip="素数的个数"><b>A1002P726</b></a></li> <li> <a href="/d/W0001/p/A1002P728" data-tooltip="回文数个数"><b>A1002P728</b></a></li> <li> <a href="/d/W0001/p/A1002P730" data-tooltip="挛生素数"><b>A1002P730</b></a></li> <li> <a href="/d/W0001/p/A1002P731" data-tooltip="求出N以内的全部素数，并按每行五个数显示"><b>A1002P731</b></a></li> <li> <a href="/d/W0001/p/A1002P161" data-tooltip="纯粹素数"><b>A1002P161</b></a></li> <li> <a href="/d/W0001/p/A1002P758" data-tooltip="数根"><b>A1002P758</b></a></li> <li> <a href="/d/W0001/p/A1002P162" data-tooltip="纯粹合数"><b>A1002P162</b></a></li> <li> <a href="/d/W0001/p/A1002P959" data-tooltip="【深基3.例7】肥胖问题"><b>A1002P959</b></a></li> <li> <a href="/d/W0001/p/A1002P860" data-tooltip="均值"><b>A1002P860</b></a></li> <li> <a href="/d/W0001/p/A1002P991" data-tooltip="[NOIP2004 普及组] 不高兴的津津"><b>A1002P991</b></a></li> <li> <a href="/d/W0001/p/A1002P492" data-tooltip="与7无关的数"><b>A1002P492</b></a></li> <li> <a href="/d/W0001/p/A1002P435" data-tooltip="回文数"><b>A1002P435</b></a></li> <li> <a href="/d/W0001/p/P001P296" data-tooltip="分跳绳"><b>P001P296</b></a></li> <li> <a href="/d/W0001/p/P001P27" data-tooltip="[语言月赛202210] 玉桂狗"><b>P001P27</b></a></li> <li> <a href="/d/W0001/p/A1002P748" data-tooltip="打折优惠"><b>A1002P748</b></a></li> <li> <a href="/d/W0001/p/A1002P1045" data-tooltip="百货商场"><b>A1002P1045</b></a></li> <li> <a href="/d/W0001/p/A1002P832" data-tooltip="课桌"><b>A1002P832</b></a></li> <li> <a href="/d/W0001/p/A1002P499" data-tooltip="药房管理"><b>A1002P499</b></a></li> <li> <a href="/d/W0001/p/A1002P823" data-tooltip="集卡"><b>A1002P823</b></a></li> <li> <a href="/d/W0001/p/A1002P999" data-tooltip="Div"><b>A1002P999</b></a></li> <li> <a href="/d/W0001/p/A1002P1148" data-tooltip="音乐播放器"><b>A1002P1148</b></a></li> <li> <a href="/d/W0001/p/A1002P1155" data-tooltip="判断偶数"><b>A1002P1155</b></a></li> <li> <a href="/d/W0001/p/A1002P1175" data-tooltip="安排座位"><b>A1002P1175</b></a></li> <li> <a href="/d/W0001/p/A1002P639" data-tooltip="求因子数量"><b>A1002P639</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6847" data-tooltip="输出绝对值"><b>LUOGUP6847</b></a></li> <li> <a href="/d/W0001/p/LUOGUP9429" data-tooltip="[语言月赛 202401] 分饼干 I"><b>LUOGUP9429</b></a></li> <li> <a href="/d/W0001/p/LUOGUP8744" data-tooltip="[NICA #2] 台式烤香肠"><b>LUOGUP8744</b></a></li> <li> <a href="/d/W0001/p/LUOGUP6858" data-tooltip="分段函数"><b>LUOGUP6858</b></a></li> <li> <a href="/d/W0001/p/LUOGUP46" data-tooltip="[NOIP2005 普及组] 陶陶摘苹果"><b>LUOGUP46</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP457" data-tooltip="晶晶赴约会"><b>OPENJUDGEP457</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP577" data-tooltip="求平均年龄"><b>OPENJUDGEP577</b></a></li> <li> <a href="/d/W0001/p/OPENJUDGEP596" data-tooltip="字符三角形"><b>OPENJUDGEP596</b></a></li> <li> <a href="/d/W0001/p/DFBYP396" data-tooltip="【入门】小丽找数？"><b>DFBYP396</b></a></li> <li> <a href="/d/W0001/p/DFBYP598" data-tooltip="【入门】请输出n~1之间所有的整数"><b>DFBYP598</b></a></li> <li> <a href="/d/W0001/p/DFBYP599" data-tooltip="【入门】请输出带有特殊尾数的数"><b>DFBYP599</b></a></li> <li> <a href="/d/W0001/p/DFBYP86" data-tooltip="【入门】寻找雷劈数"><b>DFBYP86</b></a></li> <li> <a href="/d/W0001/p/DFBYP638" data-tooltip="【入门】奇怪的数？"><b>DFBYP638</b></a></li> <li> <a href="/d/W0001/p/DFBYP91" data-tooltip="【入门】同因查找"><b>DFBYP91</b></a></li> <li> <a href="/d/W0001/p/DFBYP562" data-tooltip="【入门】宇航员选拔"><b>DFBYP562</b></a></li> <li> <a href="/d/W0001/p/DFBYP394" data-tooltip="【入门】与7无关的数？"><b>DFBYP394</b></a></li> <li> <a href="/d/W0001/p/DFBYP615" data-tooltip="【入门】输出满足条件的整数4"><b>DFBYP615</b></a></li> <li> <a href="/d/W0001/p/DFBYP614" data-tooltip="【入门】输出满足条件的整数3"><b>DFBYP614</b></a></li> <li> <a href="/d/W0001/p/DFBYP684" data-tooltip="【入门】数字直角（1）"><b>DFBYP684</b></a></li> <li> <a href="/d/W0001/p/DFBYP559" data-tooltip="【入门】游乐设施"><b>DFBYP559</b></a></li> <li> <a href="/d/W0001/p/DFBYP549" data-tooltip="【入门】计算考试需要的教室"><b>DFBYP549</b></a></li> <li> <a href="/d/W0001/p/F0001P597" data-tooltip="画矩形"><b>F0001P597</b></a></li> <li> <a href="/d/W0001/p/DFBYP395" data-tooltip="【入门】恐龙园买玩具？"><b>DFBYP395</b></a></li> </ul></div> </div> </div> </div> </li> <li class="section__tab-item">最近活动
- 2024年7月13日8:30班【2】暑假第6课 循环模拟强化 作业
- 2024年7月12日 8:30班【2】暑假第5课 一阶段总回顾【顺序、分支】 作业
- 2024年7月11日 8:30班【2】暑假第4课 枚举[循环] 作业
- 2024年7月10日 8:30班【2】暑假第3课 嵌套循环的进阶应用 作业
- 2024年7月9日 8:30班【2】暑假第2课 自定义函数进阶 作业
- 2024年7月8日 8:30班【2】暑假第1课 自定义函数应用 作业
- 2024年6月15日 周六晚6:30 因数问题 作业
- 2024年6月8日 周六晚6:30 均值进阶、最值问题 作业
- 2024年6月1日 周六晚6:30 循环输入的应用 作业
- 2024年5月26日 周日上午10:40 自定义函数基础 作业
- 2024年5月25日 周六晚6:30 for进阶 作业
- 2024年5月19日 周日晚6:30 循环嵌套枚举 作业
- 2024年5月12日 循环嵌套与嵌套枚举 作业
- 2024年5月5日 郝铮 循环嵌套 作业
- 2024年4月13日_一阶段测试前_知识点回顾补习题 作业
- 2024年4月4日_模拟过程2 作业
- 2024年3月31日_郝铮_模拟过程基础 作业
- 2024年3月24日_周日晚6:30_循环基础回顾 作业
- 2024年3月17日_周日晚6:30_最小公倍数 作业
- 2024年3月10日_郝铮个人练习题_公约数 作业
- 周六晚6:30班_补题练习 作业
- 2024年2月22日__重新组合数 作业
- 2024年2月20日_while循环拆数 作业
- 2024年2月18日_郝铮练习题_while循环基础 作业
- 2024年2月1日_因数 作业
- 2024年1月28日_郝铮_循环输入计数、均值、最值 作业
- 2023年12月31日_郝铮_求和与计数 作业
- 2023年12月23日_郝铮_for循环基础与分支回顾 作业
- 2023年12月10日_郝铮_分支难题 作业
- 2023年11月12日_周日九点一对一_分支回顾练习 作业
- 2023年10月29日_周日九点一对一_郝铮_顺序与分支综合练习 作业
- 分支进阶练习 作业
- 2023年10月4日_单独辅导班_赋值语句与模拟法 作业
- 周日九点一对一单循环枚举法的应用 作业
- 2023年9月2日_秋零基础班一 作业
- 一期零基础单独辅导班第4课时 作业
- 一期零基础单独辅导班第3课时 作业
- 一期零基础单独辅导班第2课时 作业
- 一期零基础单独辅导班第1课时 作业
-
Stat
</div> -
Rating
题目标签
- 一阶段
- 98
- 单循环结构
- 48
- 多分支、嵌套分支结构
- 13
- 双分支结构
- 13
- 循环嵌套-打印图形
- 12
- 自定义函数
- 12
- 求和计数
- 10
- 数据的输入和输出
- 9
- 数据的运算
- 9
- for循环
- 9
- 短除法拆数
- 8
- 分支结构
- 8
- 质数
- 7
- 输入输出
- 7
- 多重循环结构
- 6
- O2优化
- 6
- 简单循环
- 6
- 均值
- 5
- 循环结构
- 5
- while循环
- 4
玉桂狗 #include<bits/stdc++.h> using namespace std; int main(){ int a,b,c,d,mm=-2e9; cin>>a>>b; for(int i=1;i<=a;i++){ cin>>c>>d; if(b>=d){ mm=max(mm,c); } } cout<<mm; return 0; }
-
最近活动
- 2024.10.26 CSP-X 小学组 赛前模拟 ACM/ICPC
- 2024.10.20 图灵 CSP-X 模拟赛补题 IOI
- 2024.10.20 普及组 10 月月赛 - 补题场 作业
- 2024.10.20图灵编程CSP-X模拟赛 ACM/ICPC
- 10.13普及组模拟赛补题场 IOI
- 2024.10.13 图灵 CSP-X 赛前第二次训练赛 补题 IOI
- 2024.10.13 图灵 CSP-X赛前第二次训练赛 ACM/ICPC
- 2024.9.30 图灵 CSP-X 小学组 试题 OI
- 9月30日 图灵复赛模拟赛（补题场） 作业
- 历年CSP初赛真题 作业
- 2024年8月2日 初赛练习（6）【小学组】-补题场 作业
- 2024年7月26日 初赛练习（5）【小学组】-补题场 作业
- 2024.7.9 初赛练习 2【小学组】补题场 作业
-
Stat
-
Rating
