名次 用户名 简介 通过数
1 Ghast
919
2 sas
834
3 SCP Foundation——Dr.Lin
欢迎新生加入老板教
798
4 abs
少年心事当拿云
793
5 3266180184
SCP=Slay.one Come and Play
788
6 zmz060126
永远的班六(这是魔咒)
774
7 bing
736
8 xiaojuruo
谁念幽寒坐呜呃
682
9 eternity destiny
信息学是你的最佳选择!
674
10 ing
信息学是你的最佳选择!
662
11 Social_CP
硬闯须红灯,横穿要马路。
629
12 Mogician
信息学是你的最佳选择!//QQ464734297进来玩啊~
627
13 linzf2011
621
14 celibacy
信息学是你的最佳选择!
616
15 猪头屠夫
信息学是你的最佳选择!
605
16 Luci
8.10虚妄之诺
605
17 Iscream
どこまでもゆくよ 一人でもゆくよ
604
18 404 Not Found
玄学
596
19 cc123321
打DIV1的大佬们,快点把平均分刷到200+,这样你们的某个学长就要跳楼了。 如果不会,你们可以进行一些PY交易。。。或者使用百度搜索算法.
583
20 黄宗杭
信息学是你的最佳选择!
577
21 mogeer
577
22 TRZ_2007
谈笑间,学校灰飞烟灭。消息传来,多情应笑我,早写作业!
573
23 若依若风
信息学是你的最佳选择!
566
24 iamyf
宠辱不惊,看庭前花开花落 去留无意,望天外云卷云舒
565
25 |斗蜂|
花开花落花祈梦,叶枯叶飞叶终逢 //QQ896597806 欢迎骚扰
564
26 BLeaves
553
27 Roll_SKY_da_shen
Roll_SKY_da_shen的留言板---------------------------------------------------------------------------------------------------------------留言板 2019.7.14 游戏:我的世界 版本:1.13 种子:20070702 坐标:x:168698 z:109264。居然有一个和大陆连在一起的蘑菇岛!!!!-----------------------------------------------------------------------------------------------------------------------------------留言板 2019.7.10 拉拉拉拉啦啦啦啦啦------------------------------------------------------------------------------------------------------------留言板 2019.6.13 毕业考倒计时7天!,加油!----------------------------------------------------------------------------------------------------------- 2019 5.25 自制的函数库,主要为数学函数#include <bits/stdc++.h> #define ll long long using namespace std; ll pow(ll a,ll b) { //快速幂 ll ans=1,bz=a,t=0; while(b!=0) { if(b&1!=0) { ans=ans*bz; } bz=bz*bz; b>>=1; } return ans; } ll fac(ll n) { if(n==1) return 1; return n*fac(n-1); } ll Tn(ll x) { return (x*(x+1))/2; //三角形数 } ll THn(ll x) { return pow(2,x)-1; //汉罗塔数 } ll AP(ll head,ll tail, ll ltem) { return (head+tail)*ltem/2; //等差数列求和 } ll GS(ll head,ll PR,ll ltem) { return (head*(1-pow(PR,ltem)))/(1-PR); //等比数列求和 } double HS(ll n) { //调和级数求和 double ans=0; for(int i=1; i<=n; i++) { ans+=1/i; } return ans; } ll C(ll n,ll m) { //组合数 long long a[101],b[101],ans=1; for(int i=1; i<=n; i++) { a[i]=i; } for(int i=1; i<=m; i++) { b[i]=i; } for(int i=m+1; i<=n; i++) { b[i]=i-m; } for(int i=1; i<=m; i++) { a[i]=1; b[i]=1; } for(int i=1; i<=n; i++) { ans=ans*a[i]/b[i]; } return ans; } ll A(ll n,ll m) { //排列数 ll ans=1; for(int i=n-m+1; i<=n; i++) { ans*=i; } return ans; } ll stirling1(int n,int k) { //第一类斯特林数(该函数增长率大,当n=20,k=10时,stirling1(n,k)就等于5917584964655) if(n==0&&k==0) return 1; if(n==0&&k==1) return 0; if(k==0) return 0; if(k==1) return 1; if(n==k) return 1; return k*stirling1(n-1,k)+stirling1(n-1,k-1); } ll stirling2(int n,int k) { //第二类斯特林数(该函数增长率大,当n=20,k=10时,stirling2(n,k)就等于381922055502195) if(n==k) return stirling1(n,k); if(k==1) return fac(n-1); if(n==0&&k==0) return 1; if(k==0) return 0; return (n-1)*stirling2(n-1,k)+stirling2(n-1,k-1); } ll Euler(int n,int k) { //欧拉数 if(k==0) return 1; if(n==k) return 0; return (k+1)*Euler(n-1,k)+(n-k)*Euler(n-1,k-1); } ll Ber(int n,int m) { //伯努利数 ll ans=0; for(int i=0; i<=n-1; i++) { ans+=pow(i,m); } return ans; } ll flb(int n) { //斐波那契数 int f0=0,f1=1,f2; for(int i=1; i<=n-1; i++) { f2=f0+f1; f0=f1; f1=f2; } return f2; } int pp[10000000]; int Eul(int x) { //欧拉函数(与上面那个不同) int maxn=x+100; if(pp[x]!=0) return pp[x]; for(int i=1; i<=maxn; i++) pp[i]=i; for(int i=2; i<=maxn; i+=2) pp[i]/=2; for(int i=3; i<=maxn; i+=2) { if(pp[i]==i) { for(int j=i; j<=maxn; j+=i) pp[j]=pp[j]/i*(i-1); } } return pp[x]; } int Kth(int l,int r,int a[],int k) { //找序列a里找第k小的数 if(l==r&&l==k) return a[k]; if(l<r) { int i=l,j=r,p=a[l]; while(i<j) { while(i<j&&a[j]>p) j--; if(i<j) swap(a[i],a[j]); while(i<j&&a[i]<=p) i++; if(i<j) swap(a[i],a[j]); } a[i]=p; if(i==k) return a[k]; else if(i>k) return Kth(l,i-1,a,k); else return Kth(i+1,r,a,k); } } int main() { int n,k; cin>>n; cout<<Eul(n)<<endl; }------------------------------------------------------------------------------------------------------------分割线 2019.5.23 水题推荐第一期 245,484------------------------------------------------------------------------------------------------------分割线 2019.5.23 245实在是太水了----------------------------------------------------------------------------------------------------------------分割线 2019.5.22 我一定会超过你的!别得意的太早!______(这是那个人的用户名)!------------------------------------------分割线 2019.5.06 taxt究竟怎么做啊啊啊啊---------------------------------------------------------------------------------------------------分割线 2019.5.01 福利!扫雷代码: #include <windows.h> #include <cstdlib> #include <ctime> #include <list> #include <cstdio> using namespace std; #define X(v) (v) % WIDTH #define Y(v) (v) / WIDTH #define BOARDX(x) ((x) - OFFSETX) / 2 #define BOARDY(y) (y) - OFFSETY #define SCREENX(x) 2 * (x) + OFFSETX #define SCREENY(y) (y) + OFFSETY #define BACKGROUND_WHITE (BACKGROUND_BLUE | BACKGROUND_GREEN | BACKGROUND_RED) #define FOREGROUND_WHITE (FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED) typedef enum { UNKNOWN, DISPLAY, MARKED } State; typedef enum { NUMBER, EMPTY, MINE } MType; typedef struct { State state; MType mtype; int val; } Cell; typedef bool (* CmpProc)(Cell& cell, void* pData); int HEIGHT = 16; int WIDTH = 16; int MINE_CNT = 40; int CELL_CNT; int OFFSETX = 3; int OFFSETY = 3; int flagCnt; int mineLeft; int unkwLeft; int liveLeft; COORD tmPos; COORD mnPos; COORD lvPos; bool bGameStart, bGameStop; DWORD dwStart; HANDLE hOut, hIn; Cell cells[16][30]; void writeChar(LPCSTR pChar, COORD wrtCrd) { DWORD wtn; WriteConsoleOutputCharacter(hOut, pChar, strlen(pChar), wrtCrd, &wtn); } void fillChar(TCHAR cChar, DWORD len, COORD wrtCrd) { DWORD wtn; FillConsoleOutputCharacter(hOut, cChar, len, wrtCrd, &wtn); } void fillAttr(WORD attr, DWORD len, COORD wrtCrd) { DWORD wtn; FillConsoleOutputAttribute(hOut, attr, len, wrtCrd, &wtn); } bool isCell(int x, int y) { return x >= 0 && x < WIDTH && y >= 0 && y < HEIGHT; } bool isMine(int x, int y) { return isCell(x, y) && cells[y][x].mtype == MINE; } bool cmpState(Cell& cell, void* pData) { return cell.state == *(State*)pData; } bool cmpMtype(Cell& cell, void* pData) { return cell.mtype == *(MType*)pData; } int aroundCmp(int x, int y, CmpProc cmp, void* pData) { int nRet = 0; for (int y0=y-1; y0<=y+1; y0++) { for (int x0=x-1; x0<=x+1; x0++) { if (isCell(x0, y0) && !(x0 == x && y0 == y)) { nRet += cmp(cells[y0][x0], pData); } } } return nRet; } int aroundMines(int x, int y) { int val = MINE; return aroundCmp(x, y, cmpMtype, &val); } int aroundMarks(int x, int y) { int val = MARKED; return aroundCmp(x, y, cmpState, &val); } void ruffle(int* arr, int len, int n) { for (int i=0; i<n; i++) { int j = rand() % len; int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp; } } void setElapsedTime() { if (bGameStart && !bGameStop) { DWORD dwDelt = (GetTickCount() - dwStart) / 1000; if (dwDelt < 1000) { char buf[5] = {0}; sprintf(buf, "%.3d\0", dwDelt); writeChar(buf, tmPos); } } } void setMinesLeft() { char buf[5] = {0}; sprintf(buf, "%2d\0", MINE_CNT - flagCnt); writeChar(buf, mnPos); } void setLivesLeft(int delt = 0) { char buf[5] = {0}; liveLeft += delt; sprintf(buf, "%2d\0", liveLeft); writeChar(buf, lvPos); } void drawCell(int x, int y) { Cell* pCell = &cells[y][x]; COORD cellCrd = {SCREENX(x), SCREENY(y)}; char buf[3] = {0}; switch (pCell->state) { case UNKNOWN: sprintf(buf, "□\0"); break; case MARKED: sprintf(buf, " P\0"); break; case DISPLAY: switch (pCell->mtype) { case MINE: sprintf(buf, " *\0"); break; case EMPTY: sprintf(buf, " \0"); break; case NUMBER: sprintf(buf, " %d\0", pCell->val); fillAttr((WORD)pCell->val, 2, cellCrd); break; } break; } writeChar(buf, cellCrd); } void initInfoBar() { char buf[50] = {0}; sprintf(buf, "生命: %2d 地雷: %2d 用时: 000\0", liveLeft, MINE_CNT); COORD crd = {(80 - strlen(buf)) / 2, SCREENY(HEIGHT) + 1}; writeChar(buf, crd); crd.X += 6; lvPos = crd; crd.X += 11; mnPos = crd; crd.X += 11; tmPos = crd; } void clearScreen() { COORD crd = {0, 0}; CONSOLE_SCREEN_BUFFER_INFO csbi; GetConsoleScreenBufferInfo(hOut, &csbi); fillChar(' ', csbi.dwSize.X * csbi.dwSize.Y, crd); fillAttr(FOREGROUND_WHITE, csbi.dwSize.X * csbi.dwSize.Y, crd); } void initGame() { srand((unsigned)time(NULL)); SetConsoleTitle("扫雷控制台版 F2: 初级; F3: 中级; F4: 高级"); clearScreen(); CELL_CNT = HEIGHT * WIDTH; OFFSETX = (80 - WIDTH * 2) / 2; int* idxs = new int[CELL_CNT]; int i, x, y; for (i=0; i<CELL_CNT; i++) { cells[Y(i)][X(i)].mtype = EMPTY; cells[Y(i)][X(i)].state = UNKNOWN; idxs[i] = i; } ruffle(idxs, CELL_CNT, MINE_CNT); for (i=0; i<MINE_CNT; i++) { cells[Y(idxs[i])][X(idxs[i])].mtype = MINE; } for (y=0; y<HEIGHT; y++) { for (x=0; x<WIDTH; x++) { if (!isMine(x, y)) { cells[y][x].val = aroundMines(x, y); cells[y][x].mtype = cells[y][x].val > 0 ? NUMBER : EMPTY; } drawCell(x, y); } } delete[] idxs; bGameStart = false; bGameStop = false; mineLeft = MINE_CNT; unkwLeft = CELL_CNT; liveLeft = MINE_CNT / 20 + 1; flagCnt = 0; initInfoBar(); } void showAll() { for (int i=0; i<CELL_CNT; i++) { cells[Y(i)][X(i)].state = DISPLAY; drawCell(X(i), Y(i)); } } void showTip(const char* tipMsg, WORD attr = FOREGROUND_WHITE) { COORD tipCrd = {(80 - strlen(tipMsg)) / 2, 1}; writeChar(tipMsg, tipCrd); fillAttr(attr, strlen(tipMsg), tipCrd); } void gameWin() { if (!bGameStop) { showTip("恭喜你, 你赢了! ", FOREGROUND_GREEN | FOREGROUND_INTENSITY); bGameStop = true; } } void gameOver(int x, int y) { setLivesLeft(-1); if (liveLeft == 0) { showAll(); showTip("游戏结束, 请重新来过!", FOREGROUND_RED | FOREGROUND_INTENSITY); bGameStop = true; } else { COORD crd = {SCREENX(x), SCREENY(y)}; WORD attr = FOREGROUND_WHITE; for (int i=0; i<6; i++) { attr = FOREGROUND_WHITE ^ FOREGROUND_RED ^ attr; fillAttr(attr, 2, crd); Sleep(100); } } } void showAround(int x, int y) { list<COORD> lst; COORD crd = {x, y}; lst.push_back(crd); while (!lst.empty()) { crd = lst.front(); lst.pop_front(); x = crd.X; y = crd.Y; for (int x0=x-1; x0<=x+1; x0++) { for (int y0=y-1; y0<=y+1; y0++) { if (!isCell(x0, y0) || (x0 == x && y0 == y)) { continue; } Cell* pCell = &cells[y0][x0]; if (pCell->state == UNKNOWN) { if (pCell->mtype == MINE) { gameOver(x0, y0); break; } else if (pCell->mtype == EMPTY) { crd.X = x0; crd.Y = y0; lst.push_back(crd); } unkwLeft--; pCell->state = DISPLAY; drawCell(x0, y0); } } } } } void onCellLDBLClick(int x, int y) { Cell* pCell = &cells[y][x]; if (pCell->mtype == NUMBER && pCell->state == DISPLAY && aroundMarks(x, y) == pCell->val) { showAround(x, y); } } void onCellLClick(int x, int y) { Cell* pCell = &cells[y][x]; if (pCell->state == UNKNOWN) { if (pCell->mtype == MINE) { gameOver(x, y); } else { pCell->state = DISPLAY; unkwLeft--; drawCell(x, y); if (pCell->mtype == EMPTY) { showAround(x, y); } } } } void onCellRClick(int x, int y) { Cell* pCell = &cells[y][x]; if (pCell->state != DISPLAY) { if (pCell->state == UNKNOWN) { pCell->state = MARKED; mineLeft -= pCell->mtype == MINE ? 1 : 0; unkwLeft--; flagCnt++; } else { pCell->state = UNKNOWN; mineLeft += pCell->mtype == MINE ? 1 : 0; unkwLeft++; flagCnt--; } drawCell(x, y); setMinesLeft(); } } void onKeyDown(WORD keyCode) { switch (keyCode) { case VK_F2: HEIGHT = 9; WIDTH = 9; MINE_CNT = 10; initGame(); break; case VK_F3: HEIGHT = 16; WIDTH = 16; MINE_CNT = 40; initGame(); break; case VK_F4: HEIGHT = 16; WIDTH = 30; MINE_CNT = 99; initGame(); break; case VK_F12: if (liveLeft < 99) { setLivesLeft(1); } break; default: break; } } void afterMouseEvent() { if (!bGameStart) { bGameStart = true; dwStart = GetTickCount(); } if (mineLeft == 0 && unkwLeft == 0) { gameWin(); } } int main(int argc, char* argv[]) { hIn = GetStdHandle(STD_INPUT_HANDLE); hOut = CreateConsoleScreenBuffer( GENERIC_WRITE, 0, NULL, CONSOLE_TEXTMODE_BUFFER, NULL ); CONSOLE_CURSOR_INFO cci; cci.dwSize = 1; cci.bVisible = FALSE; SetConsoleCursorInfo(hOut, &cci); SetConsoleActiveScreenBuffer(hOut); initGame(); for (;;) { DWORD nEvts; GetNumberOfConsoleInputEvents(hIn, &nEvts); if (nEvts > 0) { INPUT_RECORD inpRec; ReadConsoleInput(hIn, &inpRec, 1, &nEvts); bool bClked = false; if (!bGameStop && inpRec.EventType == MOUSE_EVENT) { int x = BOARDX(inpRec.Event.MouseEvent.dwMousePosition.X); int y = BOARDY(inpRec.Event.MouseEvent.dwMousePosition.Y); if (!isCell(x, y)) { continue; } bClked = true; switch (inpRec.Event.MouseEvent.dwButtonState) { case FROM_LEFT_1ST_BUTTON_PRESSED: if (inpRec.Event.MouseEvent.dwEventFlags == DOUBLE_CLICK) { onCellLDBLClick(x, y); break; } onCellLClick(x, y); break; case RIGHTMOST_BUTTON_PRESSED: onCellRClick(x, y); break; default: bClked = false; break; } if (bClked) { afterMouseEvent(); } } if (inpRec.EventType == KEY_EVENT) { onKeyDown(inpRec.Event.KeyEvent.wVirtualKeyCode); Sleep(100); } FlushConsoleInputBuffer(hIn); } setElapsedTime(); Sleep(50); } return 0; }-------------------------------分割线 2019.4.30 第501题,打破了整数,不高兴。。。-------------------------------------------------------------------------------分割线 2019.4.27 500题祭----------------------------------------------------------------------------------------------------------------------分割线
549
28 ______
连点器代码:#include<iostream> #include<windows.h> using namespace std; int main(){ POINT p; while(1){ GetCursorPos(&p); SetCursorPos(rand() % 900, rand() % 1600); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(10); } return 0; } /*AC=Answer Coarse=粗劣的答案 WA=Wonderful Answer=好答案 TLE=Time Limit Enough=时间充裕 MLE=Memory Limit Enough=内存充裕 CE=Compile Easily=轻松通过编译 RE=Run Excellently=完美运行 UKE=United Kingdom Error=英国的错误(不关我们事)) AU=All Unaccepted=全都不正确*/ 第一篇:古有善C++者,极帅之。一日会NOIP洽(普及)组,忽见一人。此人甚是怪之,其脸绿于树,其发绿于草也。忽然矣,此乃吾友袁嘉骏也。较始矣,前二题甚易,不出几时,成之。后两题甚难,众皆以为头痛,余外,甚轻则AC。笑也,旁物忽变。见师,乃知吾适梦矣。第二篇:古善C++者,故以WA为心头恨也,以AC喜,以RE愁,以TLE为wc,以UKE为wtf,以CE(编译错误)为耻,以OK为惑也。//作者:______ //#include <bits/stdc++.h> using namespace std; struct data { int a[4][4]; int step; }; int dx[5]= {0,0,1,0,-1}; int dy[5]= {0,1,0,-1,0}; queue<data>q; bool vis[70000]; int calc(data a) { int ret =0; for(int i=0; i<4; i++) { for(int j=0; j<4; j++)ret=ret*2+a.a[i][j]; } return ret; } bool cmp(data a,data b) { for(int i=0; i<4; i++) for(int j=0; j<4; j++) if(a.a[i][j]!=b.a[i][j])return false; return true; } int main() { data tmp,goal; char c; for(int i=0; i<4; i++) for(int j=0; j<4; j++) { cin>>c; tmp.a[i][j]=c-'0'; } for(int i=0; i<4; i++) for(int j=0; j<4; j++) { cin>>c; goal.a[i][j]=c-'0'; } tmp.step=0; q.push(tmp); vis[calc(tmp)]=1; while(!q.empty()) { tmp=q.front(); q.pop(); if(cmp(tmp,goal)) { printf("%d\n",tmp.step); return 0; } tmp.step++; for(int i=0; i<4; i++) for(int j=0; j<4; j++) for(int k=0; k<4; k++) { int i2=i+dx[k],j2=j+dy[k]; if(i2>=0&&i2<4&&j2>=0&&j2<4) { swap(tmp.a[i][j],tmp.a[i2][j2]); if(!vis[calc(tmp)]) { vis[calc(tmp)]=true; q.push(tmp); } swap(tmp.a[i][j],tmp.a[i2][j2]); } } } }
548
29 帅哥朱朱佳豪
The light won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see clearly? How to organize future puzzles No queuing for limited payments I slept at daybreak. Time is more expensive than LV Life is too short to be wasted I'm not interested in my position in other people's eyes. Ordinary or alternative Hate or admire No need for redundant response I just want to know what I'm talking about. because Nothing else is contemptuous of Happiness is that no one can borrow it. Forget who hates who forgets to thank Occasionally on emotional nights No one will help you make you better. It's only because you didn't make it early that you missed it. To keep moving forward every day, I must have strong strength and say hello to myself. I know the lights won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see (where to end up) How to organize future puzzles (take each step first) Yesterday has passed and tomorrow hasn't come yet. I'm not surprised that everything is suddenly happening today. I don't predict the future anymore because it's always unexpected. The city that should be there will be No matter how fast the world becomes Never thought I could win a lottery ticket. There is no need for an unrealistic face. I don't talk about dreams with anybody. Silently turn dreams into reality Whether I try it or not Still empty Do it directly instead of talking about it. He's a poor man. Or a millionaire I try my best to live my day well. Because the light won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see (where to end up) How to organize future puzzles (take each step first) I know the lights won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see (where to end up) How to organize future puzzles (take each step first) Don't guess (don't guess) Don't guess what hasn't happened yet Don't guess (don't guess) Don't guess what tomorrow is like. Don't guess (don't guess) It's always time to come without guessing. Don't guess (don't guess) Don't guess (don't guess) Don't waste time guessing the trouble or surprise I'll encounter in the future Although question marks and exclamation marks often appear, they don't stay in my heart. Once, in order to arm myself, I quickly learned to be indifferent and dirty. Now I don't want to pretend I just want to be more relaxed and live in the present moment. Time will not stay for me Why stop to choose a headache? My new goal is at the next intersection. Now all you have to do is add some gas. When I walk through the crowded crowd Humanity washed through a trough Thank you for all the lights that light up for me when I'm depressed. Always come and ring my doorbell righteously Because the light won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see (where to end up) How to organize future puzzles (take each step first) I know the lights won't turn on for me at any time. I don't want to guess whether it's good or bad or not. Who can really see (where to end up) How to organize future puzzles (take each step first) 灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 要怎么组未来的拼图 不会为了限量款排队 我都是天亮了才睡 时间比LV还贵 人生总苦短又怎么能白费 没兴趣在乎我在别人眼中的定位 普通或另类 讨厌或敬佩 不需要多余的应对 只想跟懂我的说一声幸会 因为 别的都不屑 快乐是自己的没人可以借 忘记了恨谁 有谁忘了谢 偶尔在情绪会泛滥的夜 没有人会帮你把你变得更好 错过只能怪你没有趁早 每天都要保持前进 我势必要有强劲的实力 再跟全新的自己问好 我知道灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 (哪里是归宿) 要怎么组未来的拼图 (先走好每一步) 昨天已经过去明天还没来 今天的一切就算突然我也不奇怪 我不再预测未来因为总在意料外 该在的都会在 不管这世界变得多么快 从没想过买个彩票可以让我中奖 也不需要不实在的面子 我也早就不跟别人谈论什么梦想 悄悄把梦想都变成现实 不管我是试试看 还是扑了空 直接做到而不是挂在嘴边 是个穷光蛋 还是大富翁 我都尽力的过好我的每天 因为灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 (哪里是归宿) 要怎么组未来的拼图 (先走好每一步) 我知道灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 (哪里是归宿) 要怎么组未来的拼图 (先走好每一步) 不用去猜 (不用去猜) 还没有发生的不用去猜 不用去猜(不用去猜) 明天是什么样不用去猜 不用去猜(不用去猜) 该来的总会来不用去猜 不用去猜(不用去猜) 不用去猜(不用去猜) 不浪费时间去猜测我未来会碰到的麻烦或惊喜 虽然也常会有问号跟感叹号出现但不让它留在我心里 曾经我为了去武装我自己 很快就学会了冷漠和脏话 现在我不想再装 我只想更爽快想悠然的活在这当下 时间又不会为我赖着不走 干嘛停下来为了选择头疼 我的新目标就在下个路口 现在要做的就是加点油门 当我穿过拥挤的人群 穿过低谷时被冲洗的人情 感谢所有为我亮起的灯在我丧气的时候 总是仗义的过来按我门铃 因为灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 (哪里是归宿) 要怎么组未来的拼图 (先走好每一步) 我知道灯 不会在 任何时候为我开 是好是坏 该不该 还没来的不想猜 有谁能真的看得清楚 (哪里是归宿) 要怎么组未来的拼图 (先走好每一步)
547
30 555
广告位招租
543
31 Elm
542
32 wzsyyh
██████████████████████这个人是蒟蒻┗( ▔, ▔ )┛██████████████████████ ███████████████████████████████████████████████████████████ ██████████████████████你不得不信ヽ( ̄▽ ̄)ノ██████████████████████ Runner.instance_.gameOver = function(){} https://video.tudou.com/v/XMzE3NTM3ODcyNA==.html 2:10 ch3cooh
537
33 ScanfN
复习图论.jpg
534
34 Rin
焚花入骨 焚歌为引
533
35 bch
#include<bits/stdc++.h> using namespace std; char c[3000][3000]; int h,l; inline void pushdown() { } int main() { int n; cin>>n; for (int i=1;i<=3000;++i) for (int j=1;j<=3000;++j) c[i][j]=' '; c[1][1]=c[2][2]='/'; c[1][2]=c[1][3]='_'; c[1][4]=c[2][3]='\'; h=2;l=4; for (int i=1;i<=n-1;++i) { pushdown(); push(); h*=2; l*=2; } for (int i=1<<n;i>=1;--i) for (int j=1;j<=1<<n+1;++j) cout<<c[i][j]; } #include<bits/stdc++.h> using namespace std; int time[1005],last[1005],sum[1005]; int t[100005],a[100005],b[100005]; int main() { int n,m,k; cin>>n>>m>>k; for (int i=1;i<=n-1;++i) scanf("%d",&time[i]); for (int i=1;i<=m;++i) { scanf("%d%d%d",&t[i],&a[i],&b[i]); last[a[i]]=max(last[a[i]],t[i]); sum[b[i]]++; } for (int i=1;i<=n;++i) { } } #include<bits/stdc++.h> using namespace std; int a[1005],b[1005],f[(1<<8)+5][1005];//f[][j]表示第j个人前面都买了 int main() { int c; cin>>c; while (c--) { int n; cin>>n; for (int i=1;i<=n;++i) scanf("%d%d",&a[i],&b[i]); } } #include<bits/stdc++.h> using namespace std; struct node { double x1,y11,x2,y2; int id1,id2; } a[205]; double x[25],y[25]; int len; double f[(1<<21)]; inline int sum(int x) { int su=0; while (x) { x=x&(x-1); su++; } return su; } int main() { int n; cin>>n; for (int i=1;i<=n;++i) scanf("%d%d",&x[i],&y[i]); for (int i=1;i<=n;++i) for (int j=i+1;j<=n;++j) { a[++len].x1=x[i]; a[len].y11=y[i]; a[len].id1=i; a[len].x2=x[j]; a[len].y2=y[j]; a[len].id2=j; } for (int i=1;i<(1<<n);++i) if (sum(i)%2==1) continue; else { for (int j=1;j<=len;++j) if (((i>>a[j].id1)&1) && ((i>>a[j].id2)&1)) { f[i]=max(f[i],f[i-(1<<(a[j].id1-1))-(1<<(a[j].id2-1))]+sqrt((a[j].x1-a[j].x2)*(a[j].x1-a[j].x2)+(a[j].y11-a[j].y2)*(a[j].y11-a[j].y2))); } } printf("%.2lf",f[(1<<n)-1]); } #include<bits/stdc++.h> #define res register int using namespace std; int a[20][20],s[130],f[16][130],n,max1,len; inline bool check(int x) { for (int i=1;i<=n;++i) { if ((x&1) && ((x>>1)&1)) return 0; x>>=1; } return 1; } inline int sum(int x,int now) { int sum=1,ans=0; for (int i=1;i<=n;++i) { if (x&1) ans+=a[now][i]; x>>=1; sum++; } return ans; } int main() { cin>>n; for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) scanf("%d",&a[i][j]); for (int i=0;i<(1<<n);++i) if (check(i)) s[++len]=i; for (int i=1;i<=n;++i) for (int j=1;j<=len;++j) for (int k=1;k<=len;++k) if (((s[j]>>1)&s[k])||((s[j]<<1)&s[k])||(s[j]&s[k])) continue; else f[i][j]=max(f[i][j],f[i-1][k]+sum(j,i)); for (int i=1;i<=len;++i) max1=max(max1,f[n][i]); cout<<max1; } #include<bits/stdc++.h> #pragma GCC optimize(2) #define res register int using namespace std; inline double work(int n,double x,double y) { double max1=1e8; if (n==1) { if (x<y) swap(x,y); return x/y; } for (res i=1;i<=n-1;++i) { max1=min(max1,max(work(i,x,(i*1.0)/(n*1.0)*y),work(n-i,x,((n-i)*1.0)/(n*1.0)*y))); max1=min(max1,max(work(i,(i*1.0)/(n*1.0)*x,y),work(n-i,((n-i)*1.0)/(n*1.0)*x,y))); } return max1; } int main() { double x,y;int n; cin>>x>>y>>n; printf("%.6lf",work(n,x,y)); } #include<bits/stdc++.h> #define res register int using namespace std; int a[20][20],s[1025],f[16][1025][105],n,max1,len,m; inline bool check(int x) { for (res i=1;i<=n;++i) { if ((x&1) && ((x>>1)&1)) return 0; x>>=1; } return 1; } inline int sum(int x,int now) { int sum=1,ans=0; while (x) { if (x&1) ans++; x>>=1; sum++; } return ans; } int main() { cin>>n>>m; for (res i=0;i<(1<<n);++i) if (check(i)) s[++len]=i; f[0][1][0]=1; for (res i=1;i<=n;++i) for (res j=1;j<=len;++j) for (res k=1;k<=len;++k) if (((s[j]>>1)&s[k])||((s[j]<<1)&s[k])||(s[j]&s[k])) continue; else { int o=sum(s[j],i); if (o) for (res w=o;w<=m;++w) f[i][j][w]+=f[i-1][k][w-o]; } for (res i=1;i<=n;++i) for (res j=1;j<=len;++j) max1+=f[i][j][m]; cout<<max1; } #include<bits/stdc++.h> using namespace std; int a[50005],cnt[1005]; struct node { int x,id; bool operator < (const node &y) const { return x<y.x; } } bo[1005][1005]; inline bool cmp(node x,node y) { return x.x<y.x; } int main() { int n,l,block,x1,l1,r1,c1; cin>>n; l=sqrt(n); int b=1,j=0; for (int i=1;i<=n;++i) { scanf("%d",&a[i]); bo[b][++j].x=a[i]; bo[b][j].id=i; if (j==l) {b++; j=0;} } for (int i=1;i<=b;++i) sort(bo[i]+1,bo[i]+l+1,cmp); if (j) sort(bo[b]+1,bo[b]+j,cmp); for (int i=1;i<=n;++i) { scanf("%d%d%d%d",&x1,&l1,&r1,&c1); int lb=l1/l,rb=r1/l; if (x1==0) { if (lb==rb) { for (int k=l1;k<=r1;k++) bo[lb][k].x+=c1; sort(bo[lb]+1,bo[lb]+1+l,cmp); } else{ for (int k=lb+1;k<=rb-1;++k) cnt[k]+=c1; for (int k=lb*l;k<(lb+1)*l;++k) if (bo[lb][k].id>=l1) bo[lb][k].x+=c1; for (int k=(rb+1)*l-1;k>=rb*l;--k) if (bo[rb][k].id<=r1) bo[rb][k].x+=c1; sort(bo[rb]+1,bo[rb]+l+1,cmp); } } if (x1==1) { int ans=0; for (int k=lb*l;k<(lb+1)*l;++k) if (cnt[lb]+bo[lb][k].x<c1 && bo[lb][k].id>=l1) ans++; for (int k=(rb+1)*l-1;k>=rb*l;--k) if (cnt[rb]+bo[rb][k].x<c1 && bo[rb][k].id<=r1) ans++; for (int k=lb+1;k=rb-1;++k) ans+=lower_bound(bo[k]+1,bo[k]+l+1,c1+cnt[k])-bo[k]; printf("%d\n",ans); } } } #include<bits/stdc++.h> using namespace std; const int N=5*1e5+5,inf=0x3f3f3f3f; int n,m,to[N],beg[N],nex[N],dis[N],cap[N],co[N]; int flow,cost,d[N],p[N],pre[N],a[N],e,x,a1,b1,p1,q1,y,z; int from[N],ans[N]; bool in[N]; map<string,int> ms; string name[105]; inline void add(int x,int y,int w,int k) { to[e]=y; nex[e]=beg[x]; beg[x]=e; dis[e]=w; co[e++]=k; } inline bool SPFA(int s,int t,int &flow,int &cost) { for (int i=1;i<=2*n;++i) d[i]=1e9; memset(in,0,sizeof(in)); in[s]=1; d[s]=0; p[s]=0; a[s]=1e9; queue<int> q; q.push(s); while (!q.empty()) { int x=q.front(); q.pop(); in[x]=0; for (int i=beg[x];i!=-1;i=nex[i]) { int v=to[i]; if (cap[i]<dis[i] && d[v]>co[i]+d[x]) { d[v]=d[x]+co[i]; a[v]=min(a[x],dis[i]-cap[i]); pre[v]=x; p[v]=i; if (!in[v]) { q.push(v); in[v]=1; } } } } if (d[t]==1e9) return 0; flow+=a[t]; cost+=a[t]*d[t]; int u=t; while (u!=s) { cap[p[u]]+=a[t]; cap[p[u]^1]-=a[t]; from[u]=pre[u]; u=pre[u]; } return 1; } inline int mincost(int s,int t) { while (SPFA(s,t,flow,cost)); return cost; } int main() { string s1,s2; cin>>n>>m; cin>>name[1]; ms[name[1]]=1; memset(beg,-1,sizeof(beg)); for (int i=2;i<=n;++i) { cin>>name[i]; ms[name[i]]=i; add(i+n,i,1,-1); add(i,i+n,0,1); } for (int i=1;i<=m;++i) { cin>>s1>>s2; add(ms[s1],ms[s2]+n,1,0); add(ms[s2]+n,ms[s1],0,0); add(ms[s2],ms[s1]+n,1,0); add(ms[s1]+n,ms[s2],0,0); } int ans1=-mincost(1,n+1); if (ans1==0) {cout<<"No Solution!"; return 0;} cout<<ans1; int sum=0; for (int i=from[n+1]+n;i!=n+1;i=from[i]+n) { ans[ans1-sum]=i; sum++; } for (int i=1;i<=n;++i) cout<<name[i]<<endl; cout<<name[1]; } #include<bits/stdc++.h> using namespace std; map<int,int> ms; int last; int main() { int n,x; cin>>n; for (int i=1;i<=n;++i) { scanf("%d",&x); ms[x]++; if (ms[x]>=2) {ms[x]-=2,ms[x+1]+=1;last=x+1;} if ( } /*map<int,int>::iterator it; for (it=ms.begin();it!=ms.end();++it) { if (it->first) ms[it+1]+=ms[it]/2; ms[it]%=2; if (ms[it]==0) ans++; last=it; }*/ } #include<bits/stdc++.h> using namespace std; long long a[2000005]; struct node { long long ch[2]; long long ans; } tr[8000005]; inline void build(long long x,long long id) { if (!tr[id].x) { tr[ } if (x<=tr[id].x) build(x,id<<1); } int main() { long long n,x,y,z,p; cin>>n>>a[1]>>x>>y>>z>>p; for (int i=2;i<=n;++i) { a[i]=(((long long)a[i-1]*a[i-1]%p*x%p+(long long)a[i-1]*y%p)%p+z)%p; build(a[i]); } } #include<bits/stdc++.h> using namespace std; int n,m,a[30][30],s,t; int main() { cin>>m>>n; for (int i=1;i<=n;++i) for (int j=1;j<=i+m-1;j++) scanf("%d",&a[i][j]); s=0,t=(n+m+m-1)*n/2+1; for (int i=1;i<=n;++i) { add(s,i,1,-a[1][i]); add(i,s,0,a[1][i]); } for (int i=1;i<=n-1;++i) for (int j=1;j<=i+m-1;++j) { add( } } #include<bits/stdc++.h> using namespace std; vector<int> q; int n,m,sum,now; int main() { cin>>n>>m; for (int i=1;i<=n;++i) q.push_back(i); sum=n; now=m-1; while (1) { cout<<q[now]<<" "; q.erase(q.begin()+now); now+=m-1; if (now>=q.size()-1)now-=q.size(); if (!q.size()) return 0; } } #include<bits/stdc++.h> #define res register int using namespace std; char c[6][6]; char mp[6][6]={'0','0','0','0','0','0', '0','1','1','1','1','1', '0','-1','1','1','1','1', '0','-1','-1','*','1','1', '0','-1','-1','-1','-1','1', '0','-1','-1','-1','-1','-1'}; int dx[]={-1,-1,1,1,2,2,-2,-2}; int dy[]={-2,2,-2,2,-1,1,-1,1}; struct node { int x,y,ans,tot; node(int x,int y,int ans,int tot) { this->x=x; this->y=y; this->ans=ans; } bool operator < (const node &b) const { return ans+tot>b.ans+b.tot; }; }; int main() { int T; while (T--) { for (int i=1;i<=5;++i) scanf("%s",c[i]+1); int sum=0,x,y; for(int i=1;i<=5;++i) for (int j=1;j<=5;++j) if (mp[i][j]=='*') { x=i; y=j; } else if (mp[i][j]!=c[i][j]) sum++; q.push(node(x,y,0,sum)); while (!q.empty()) { node x1=q.top(); q.pop(); for (int i=1;i<=7;++i) { int nx=dx[i]+x1.x,ny=dy[i]+x1.y; if (nx<1||ny<1||nx>5||ny>5) continue; } } } } #include<bits/stdc++.h> using namespace std; struct node { int num,high; node (int num,int high) { this->num=num; this->high=high; } }; stack<node> f; int n,a[80005]; long long ans; int main() { int n; cin>>n; for (int i=1;i<=n;++i) scanf("%d",&a[i]); f.push(node(1,a[n])); for (int i=n-1;i>=1;--i) { while (f.size() && f.top().high<a[i]) f.pop(); if (!f.size()) ans+=n-i; else { int x=f.top().num; int y=n-i+1; ans+=y-x-1; } f.push(node(n-i+1,a[i])); } cout<<ans; } #include<bits/stdc++.h> using namespace std; int w[105],to[105],beg[105],nex[105],dis[105],sum[105],tot[105]; int f[105][55][2],n,k,y,z,e,cnt[105][55]; //sum数量,tot数量*路程 //f[a][b][c] c代表造不造,cnt代表不造还有多少木材 inline void add(int x,int y,int z) { to[++e]=y; nex[e]=beg[x]; beg[x]=e; dis[e]=z; } inline void dfs(int x) { for (int i=beg[x];i!=-1;i=nex[i]) dfs(to[i]); sum[x]=w[x]; for (int i=beg[x];i!=-1;i=nex[i]) { sum[x]+=sum[to[i]]; tot[x]+=(sum[to[i]]*dis[i])+tot[to[i]]; } } inline void dp(int x) { for (int i=beg[x];i!=-1;i=nex[i]) dp(to[i]); /*f[x][0][1]=tot[x]; for (int i=beg[x];i!=-1;i=nex[i]) for (int j=k;j>=0;j--) { if (f[i][j][1]>f[to[i]][j][1]+f[to[i]][j][0]*dis[i]) { f[i][j][1]=f[to[i]][j][1]+f[to[i]][j][0]*dis[i]; f[i][j][0]=f[to[i]][j][0]+w[i]; } if (j!=0 && f[i][j][1]>f[to[i]][j-1][1]) { f[i][j][1]=f[to[i]][j-1][1]; f[i][j][0]=0; } }*/ f[x][0][0]=cnt[x]; cnt[x][0]=sum[x]; f[x][1][1]=cnt[x]; for (int i=beg[x];i!=-1;i=nex[i]) f[x][1][1]-=dis[i]*sum[to[i]]; for (int i=beg[x];i!=-1;i=nex[i]) for (int j=k;j>=2;++j) for (int p=1;p<=j-1;++p) f[x][j][1]=min(f[x][j][1],min(f[to[i]][j-p-1][0]+dis[i]*w[i],f[to[i]][j-p-1][1])+f[x][p][1]); for (int i=beg[x];i!=-1;i=nex[i]) for (int j=k;j>=0;++j) for (int p=0;p<=j;++p) { if (f[x][j][0]<f[to[i]][j-p][0]+f[x][p][0]) f[x][j][0]= cnt[x][j]+=cnt[to[i]][j-1] } } int main() { cin>>n>>k; memset(beg,-1,sizeof(beg)); /*for (int i=0;i<=n;++i) for (int j=0;j<=k;++j) f[i][j][1]=0x3f;*/ for (int i=1;i<=n;++i) { scanf("%d%d%d",&w[i],&y,&z); add(y,i,z); } dfs(0); dp(0); //cout<<f[0][k][1]; }
524
36 伟大的Daniel
信息学是你的最佳选择!
523
37 88488
/* ..::.. .:ii77v7v7v7r::. .....:rJj211sJLLvLvLvsYuuIU2s7: .:r7ju1juJuuusYvLvL7v7v7v7v7L7LvsLJu2uYi. :rsj1JjYsLYLYLYvv7v7v777v7v777v777v7v7vvYY11ui. :7uuuYYvvvv7v7v7v7v777v7v7v7v7v7v7rrvr7777v7vvYL11L. :7ujJvLvv7v7v7v777v7v777v7v7v7v7v7v771QSririr7v7v7v7YsUI7. .iJjjLL7v7v7v777v7v7v7v7v7v7v777v7v777v75dgP5jjJ77v7v7v7LvsJ2Jr .7sJYLvv7v7v7v7v7v7v7v7v7v7v7v7v7v7v7v7v77rri7IDQRr77v777v7v7vvsu2r .YKLJuv7v7v7v7v7v777v7777777v7v7v7v7vrv7v7v7vrrXZEEbLi7777v7v7v7v7vv52. .uS1LUjL777v7v7v7v777v7v7v7v7v7v7v7v777s77777v77rPgEKZdYr77v7v7v7v7v7vYXPr .. .vIL7sU7vv77v7v7v7v7v7v777v77777v7v7v7v77L577L7r777rJSEbDbX77777777777v777sXv :7r .:vJLrLUJiY17777v77777v77777v7v777777777v777r75rvULr7r7ir7JUZgP77777v777v777v7vs17. i2j7:. ......JUjYvrJu7iv27r7rv777777777v777777rrr77v7v77777r7Krruurrr7rriUEsr7r77v777v7v777v7vL1u7 iJqqq5S2525Jr::sUJsr2Jrv7I7r7rUL777r7r77v7777rri7jjr777777v7vrrYb7rYX7rrLv7QYi77777r777777v7v777v7JY1r .:7j1525IKSIj77Jiqu7UYsur7rUJ77777rus7777rirYXEg7r7v777v7777rrYuvi7D2Xd US:777777U777v77777Y7vLYYSs2J: ... . :irX27KvvrIj77v77r2u77vrr72bgdgY7Uv7v7777r77777Y7Jr7BQ iB7L7v7777ruLr7v7vvJIKur YsrUX7 .Y:.: i:.rJrr25vYJYYLPULYjvubBBBRQbj5JYsLLv7rj7vvv71iiJrYi riUXJv7777jrLLrvYv7r:.:.:r77r.7P1 :jLs2.i. :: .r..:.::Ji::i:ivJ77rir7...... ivrbJr. iY1 rjrj. rr. .YY7jZXP7 .72IjvLv .Kq. i5K7JUSL:. r i. r . . ..:777UY7. :L1 jvu7 .UXY7vLJDEg: .::rvjv77YuUj5 2P :U:jr12svUUsIiv7.:...v.......::iirYqSvrvvYYJLvrjrs7vrv7U. .57I. . .i:iL7r72gZQs7YJLYvv77r77J1g. v5 X :JrPsrLYrLKLq7sYsvPJvvv7dRRMQgQBQRgrvvL7v77r7u:jv77771. rJui ... .jvrri7Pggr77v7v777777r7YIi:Ev rj LvsIrvY 7UL77vr5s777r5DPqqSbEPPdrvr77777rrsv.7v7r7r1. .ujr ....7svYr7riiuRPi77777777v777v7ss15r 2i js5rvvu iI777ruur77iYEqXK5bPXKErJ7777r7r7rI:.:YirirY 7J7 ... .:rrrr7rri7Mur77v7v777v777v7v7vJ2J7:. 2: iZv7vuL. 71r7rvI777rrqbSX5dqSXZ7Y7rr77777rU7: .7iir72.::.rqr ... :iurir7r7i7X77777777v7v7v7v777vvsjU1uvr:. . rr P77J YL77rULr7rrsESSSZKXXEsYrr77r777rsv. 7EdgEMPYYYrvQs.... iDMqvrirr7iYJr77727rr7777v7v7v7v7vvYLjJU1uLvri:::::i7I. v ru7vL vv77v2r7r77XqXSESSXEjvrrr7r7r7rYv..jQBd17rs P .... .IBbZXYiir7rI77777K2Lrrirr77v7v777v7v7v7LYu1IIKXPPEKJ. :U77uKr: rvvr277rivvPKXE5SSdULrrr7r7r7rY7:KBg:rr:isi . iu ..... .1DqPPXsrirJjr777rgRZK5Jvrrirr7777v7vvsvvvsLJYvr:. .vYvUuYU iL7vUrrLKgqdPgqqqPu7i7rrr7r7rJr7Bd. 7rrLv ..... ....... LQPSKZbj:r1r777riPDddEddK2Y7irrrr7rsIJi. iLvU.svsJisj77sJJbdRjXdgKPPQQSiirr7jrrvurJd. vSL1I..:. ....... .DBbqIqES:J77777riqZPXqqdbEbPUJ7rirr77Lv7:. 7YJ7 Lv7BZ5u7rUvsrv7.1g5SPgjLqg1rvurvsYi:i :r5LL7 ... 2QdP5XbX7Lr7777riqEPXKXqKPbDZDP5Y7r77vY1UUr. .Ljj: 77YBi 277Uvr71iYRKXDgJrii7ZDu7Jvr::. :r:1Li IY72SPqdXJ. . . 7gXX5SPKvrr777rriKEqXqXPZQQBBBBBBRPIJJsjJI2Y. :LYI i7jBJ 1vr577vYrMPqd1:i7UI1rJ57ii:: .. . vI. 7MBBBBBBBBBBBBBBdi . .5dKX5Kbgr777777riKEqXqP2ri:i:ii77YLsYJJ2u22Ki rLsJ :rqr 177U7r1rqDKJi:rirrvvr:::i.. ..... r5 .RQBB: XgqqEi.dg:QBBBP. . dgXXbQB1Lu7777rriKZdqDL :71UPi 7jYs .7IP. rLrI77LYQDQBBBBQU: .::. ..... .i ::BE rBdPEQ. IB1 SBBMS.. .BPqRq: :1v7777riPPQQQDi ijP. 7LYY ruQBJ.LrjLrLIQQBBb72BBBBv . ....... .dr rBgZMBBBKig: BB . . :iQQr .:. 1v7r7rr7i 7QBBb Lr :LI5 ivMDEES:vY7KBBBY RgPgMBR ........... . : BZrKBBBg:Zs Qr ... Q. :s77v .I77vvr7s: 7BBB: : :sU1: .vDXgDZriJ1BQBP . XBPdB BZ ... . ... ... .. v. 2QB:.B: r ... .. v. ii. 7Yr7U1rruv dBB: j. L :g.rBg5ir5S7gB QBggBM2KB ........ . . .... .j ........ iL:iii rvrrrKqrrs5. vBB r7 :r UM 7BQsi2Y .Bs XBD5BBBiB. ....... . ........ jK7ivv: ............ 7:::s: ubirrrbgYr7Sv .BI .s :i :Bs rQ1rrU:.:L. :P .Q:7B ..... . . . ....... PM2: ... ..... ... .v::is RgKrii7EMXLrs2i .K r: .. 7B: iB7rsr:i:. BY . ... ... ............ ..... .... ... .virrL. qDPbP7iivdDES7rL1. i vB. QQr7U:: .. QEIKBr . . . ... ... . ......... ......... ....... s77:. qgqXKPdLi:sZPbE5YrYvi iM :BRr1v .. .7Ku: . . . . ... ..... . . . ................... .si .ggqXX5KKZjiiqbPqEdPjvvs7i. 7vjRZir ... . ..: . . . . ... . . . .....::.... ......... 7QdKSXSXSKKD1irDPbPEEgZP2usjv7i:....i7: :YKDXr ...... ... . r: . . . . ... ... . ................. :PQPK5XSXSXSKqDU:1QQQRQRQQQMgMQRQMQQRdu. :SPdg7 ..:........ .. ... . . ... . . ... . . . ......... :..iYZMEXKSXSKXXSKSqqDs7Ii:::rv5PBg7i7rr:. :2bSEg .......... . . . ... ... . . ... . . . ... . ... uBgMMgPKSXSX5XSXSKSqSqqDJ: .U5 .iSPKSQ7 ..... . . . ... . . . . . . . . . ... . . ..... 7QKKSKSXSKSXSXSKSKSKSqSqbP7 :Dr .7XbSKqM . ..... ... . . . . . . . ... . . . ... ... . 7QKS5S5XSKSK5KSXSKXPKqSqXPEJ .D. :rEKX5Kgu ........ ..... . . . . . . ... ... ..... . . YQKXIX5XIXSKSKSKXqKgZdPPXqKZE. r: :udK5XSPQ. ..... . . . . . . ... . ... ....... XQXX5S5XSKSXSKXKXqKZ77dZbPKPqgS 7bbXKSKSDP ............ :i.:.. . . . ... . ... ... iDgXSIXIXSPgPSKXqSKXqEi .2MDEPPbR1 .IBgXSqKgbQK ......... . ..::. . . . ... . . . . uQP5XIXIXXqKuPqXKSKXKXZP :SDQgggBS. YB2qqKKdrbPQE. ....... . . ... . ... . ..... .ii5Z5S5S5SSKP7 5KPXKXKSqPR. .7SbRBBQXr. rBJ 1dKE1 .PEMQU. ..... ......... . ... . . . .iri.KPSISIX5Kqg: JPqqXqSqXPD2 :i77rii:. iBu YPdZ7 :PEdMQI: ........ . . . . . . .i7i:..PPSSIX5XSPM. 2bbXqXKSqXdM: 7Qr iddMr :PdDqBQZji . . ........ ..rri:::::RgPXX5XSqPg vZPPqqKbSqPgE .vL .qgMr :EQr.QRRQg5v. ..... . .irr:::::::i7vEgPK5KSdP :qZZMPPEgXEZQX .:. IgQ7 .dB. qQZPDgQD5r:.... .irri:::::::::i: 7MPKXPPP XRJ:RDEdSr2RBE. :DQj 1Bv igQEDDQBBB2.:::.::irri::::::::::::i7 .gPPRgE 7QS YEQMP: .JXi 7RZ :d7 .IMq5Uj5I .Yv:::::::::::::::::7r:. vRdJdB. Pg .7bQBI. uB. . : ..ri:::::::::::::::i:Yj. :Qg P1 rQ: :JgBQ7. X2 .:.. :. . r .. iL::::::::::i:iir77: .. gR r. XL .7Lr. v. .:.. ri....:: :.:Ys.::i:i:i::ir77i. .:. 1B: j :... 7.. ir.....r ..:vr7::i:i:ii777:. .::.. iuv. . .. :i. :7......7 :.visi:i:ii7v7:. ::......srsv. i. 7...7......:i ..ivrr:iivvr: .:::.... .YrrvJ. .. i :i..r:.....ri ..Liiivvr. .::...... :J7irr7J. . i 7..:7 ....7. .i:Yrv7: .::...:.. rjrrrrrr7v:. ...:i i :i. 7.....r :7i:r1. .::.:.:...vjrrrrrrrr7YU7:. */
508
38 lyk
信息学是你的最佳选择!
502
39 IEQEFCR
#include<cstdio> #include<algorithm> #include<iostream> #define maxn 100005 #define in(x) scanf("%d",&x) using namespace std; struct ac { int l,r; //区间 int num; //线段数量 int lazy,lco,rco;//两端颜色 } t[maxn*4]; int n,m,co[maxn]; void build(int i,int l,int r) { t[i].l=l,t[i].r=r,t[i].lazy=0; if(l==r) { t[i].lco=co[l],t[i].rco=co[l]; t[i].num=1; return ; } int mid=(l+r)>>1; build(i<<1,l,mid); build(i<<1|1,mid+1,r); int all=0; t[i].lco=t[i<<1].lco; t[i].rco=t[i<<1|1].rco; all=t[i<<1].num; all+=t[i<<1|1].num; if(t[i<<1].rco==t[i<<1|1].lco) all--; t[i].num=all; return ; } void putdown(int i) { if(t[i].lazy) { t[i<<1].num=1; t[i<<1|1].num=1; t[i<<1].lazy=t[i].lazy; t[i<<1|1].lazy=t[i].lazy; t[i<<1].lco=t[i<<1].rco=t[i<<1|1].lco=t[i<<1|1].rco=t[i].lazy; t[i].lazy=0; } } void change(int i,int x,int y,int k) { //修改颜色 if(t[i].l>=x&&t[i].r<=y) { t[i].lazy=k; t[i].num=1; t[i].lco=t[i].rco=k; return ; } putdown(i); int mid=(t[i].l+t[i].r)>>1; if(mid>=x) change(i<<1,x,y,k); if(mid<y) change(i<<1|1,x,y,k); t[i].lco=t[i<<1].lco; t[i].rco=t[i<<1|1].rco; int all=t[i<<1].num+t[i<<1|1].num; if(t[i<<1].rco==t[i<<1|1].lco) all--; t[i].num=all; return ; } int sum(int i,int x,int y) { //询问数量 if(t[i].l>=x&&t[i].r<=y) { return t[i].num; } putdown(i); int mid=(t[i].l+t[i].r)>>1; int all=0; if(mid>=x&&mid<y) { all=sum(i<<1,x,y); all+=sum(i<<1|1,x,y); if(t[i<<1].rco==t[i<<1|1].lco) all--; return all; } if(mid>=x) { return sum(i<<1,x,y); } if(mid<y) { return sum(i<<1|1,x,y); } } int main() { in(n),in(m); for(int i=1; i<=n; i++) { in(co[i]); } int x,y,k,tp; build(1,1,n); for(int i=1; i<=m; i++) { in(tp),in(x),in(y); if(x>y) { int ac; ac=x; x=y; y=ac; } if(tp==1) { in(k); change(1,max(1,x),min(y,n),k); } else { printf("%d\n",sum(1,x,y)); } } }
501
40 古天鲁
http://k.sina.com.cn/article_6445828871_180338b07001003gdz.html?from=ent&subch=film https://baijiahao.baidu.com/s?id=1592017515946656114&wfr=spider&for=pc https://www.biquge.info/2_2309/2433633.html #include<bits/stdc++.h> using namespace std; const int N = 100001; int a[N],b[N]; bool vis[N]; void dfs(int x,int len,int what) { if(!(vis[x + a[x]])&&!(vis[x + b[x]])) { } if(vis[x + a[x]]) { printf("Infinity!"); exit(0); } vis[x + a[x]] = true; dfs(x + a[x],len + 1,what<<1|1); vis[x + a[x]] = false; if(vis[x + b[x]]) { printf("Infinity!"); exit(0); } vis[x + b[x]] = true; dfs(x + b[x],len + 1,what<<1); vis[x + b[x]] = false; } int main() { int n; scanf("%d",&n); for(int i = 1; i <= n; i++) scanf("%d",&a[i]); for(int i = 1; i <= n; i++) scanf("%d",&b[i]); vis[1] = true; dfs(1,0,0); }
494
41 Dark Knight
自动登录wzoi.cc #include <bits/stdc++.h> #include <windows.h> using namespace std; void Set_char(char k) { if (k>='a' && k<='z') { k=k-32; keybd_event(k,0,0,0); keybd_event(k,0,KEYEVENTF_KEYUP,0); } else if (k>='A' && k<='Z') { keybd_event(20,0,0,0); k=k-'A'+65; keybd_event(20,0,0,0); keybd_event(k,0,0,0); keybd_event(20,0,KEYEVENTF_KEYUP,0); } else { keybd_event(k,0,0,0); keybd_event(k,0,KEYEVENTF_KEYUP,0); } } void Set_string(string s) { for(int i=0; i<s.length(); i++) { if (s[i]=='-') { keybd_event(109,0,0,0); keybd_event(109,0,KEYEVENTF_KEYUP,0); } Set_char(s[i]); Sleep(200); } } void Click(int x,int y) { SetCursorPos(x,y); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(1000); } string s1="wzoi"; string s2="cc"; string s3=""; string s4=""; main() { Click(274,879); Click(221,16); Click(546,43); keybd_event(13,0,0,0); Click(200,50); Set_string(s1); keybd_event(190,0,0,0); Set_string(s2); Click(200,50); keybd_event(13,0,0,0); Click(1337,88); Click(1337,88); Click(1253,139); Set_string(s3); Click(660,291); Set_string(s4); Click(794,383); Click(1522,42); Click(1528,182); }
492
42 sqr060503
信息学不是你的最佳选择,而slay.one才是。
488
43 cat
cat老母猪 #include<bits/stdc++.h> using namespace std; int ans=1e9,d[5001],p[5001],a,b,c,n,m,s[5001][5001]; bool e[5001]; void fzjws() { scanf("%d%d",&n,&m); for(register int i=1;i<=m;i++) { scanf("%d%d%d",&a,&b,&c); s[a][b]=c; if(a==1) d[b]=c; } memset(d,127,sizeof(d)),memset(e,1,sizeof(e)),memset(p,1,sizeof(p)); e[1]=false; for(register int i=1;i<n;i++) { int t=d[0],q; for(register int j=2;j<=n;j++) if(d[j]<t and e[j]) t=d[j],q=j; e[q]=false; for(register int j=2;j<=n;j++) if(!e[j] and d[j]>d[q]+s[q][j]) d[j]=d[q]+s[q][j],p[j]=q; } for(register int i=1;i<=n;i++) ans=min(ans,d[i]); printf("%d\n",ans); } int main() { fzjws(); return 0; } int s[5001],w[5001],nx[5001],f[5001],d[5001]; int he; bool v[5001]; void add(int x,int y,int z) { s[++he]=y,w[he]=z,nx[he]=f[x],f[x]=he; } void spfa() { memset(v,0,sizeof(v)); memset(d,63,sizeof(d)); int h=0,t=1; q[1]=1,d[1]=0; while(h!=t) { h=h%he+1; int x=q[h]; v[x]=false; for(register int j=f[x];j>0;j=nx[j]) if(d[x]+w[j]<d[s[j]]) { d[s[j]]=d[x]+w[j]; if(!v[s[j]]) q[t=t%he+1]=s[j]; v[s[j]]=true; } } } #include<bits/stdc++.h> using namespace std; int ans=1e9,n,k,a,b,c,tot,h,t; int d[5001],q[5001],f[5001],nx[5001],s[5001],w[5001]; bool v[5001]; void hhd(int x,int y,int z) { s[++tot]=y;w[tot]=z; nx[tot]=f[x];f[x]=tot; } void spfa() { memset(v,0,sizeof(v)); memset(d,63,sizeof(d)); h=0,t=1,q[1]=1,d[1]=0; while(h!=t) { h=h%tot+1; int x=q[h]; v[x]=false; for(register int j=f[x];j>0;j=nx[j]) if(d[x]+w[j]<d[s[j]]) { d[s[j]]=d[x]+w[j]; if(!v[s[j]]) { q[t=t%tot+1]=s[j]; v[s[j]]=true; } } } } int main() { scanf("%d%d",&n,&k); for(int i=1;i<=k;i++) { scanf("%d%d%d",&a,&b,&c); hhd(a,b,c); } spfa(); for(int i=1;i<=n;i++) ans=min(ans,d[i]); return 0; } 单源最短路径算法(Dijkstra算法) 设图G=(V,E)是一个有向图,它的每一条边(U,V)都有一个非负权W(U,V),在G中指定一个结点V0,要求从V0到G的每一个结点Vj的最短路径找出来(或指出不存在)。 由于源结点V0是给定的,所谓称为单源最短路径。 【Dijkstra算法思想】 把所有结点分为两组。 第一组:包含已确定最短路径的结点。 第二组:包含尚未确定最短路径的结点。 按最短路径长度递增的顺序把第二组的结点加到第一组中去,直到V0可达的所有结点都包含于第一组中。在这个过程中,总保持从V0到第一组各结点的最短路径长度都不大于从V0到第二组任何结点的路径长度。 【单源最短路径算法实例】 现有一张县城的城镇地图,图中的顶点为城镇,无向边代表两个城镇间的连通关系,边上的权为公路造价,县城所在的城镇为v0。由于该县经济比较落后,因此公路建设只能从县城开始规划。规划的要求是所有可到达县城的城镇必须建设一条通往县城的汽车线路,该线路的工程总造价必须最少。 【输入】 第一行一个整数v,代表城镇数,县城编号为1。 第二行是一个整数e,表示有向边数。 以下e行,每行为两个城镇编号和它们之间的公路造价。 【输出】 v-1行,每行为两个城市的序号,表明这两个城市间建一条公路。   【输入样例】 6 10 1 2 10 1 5 19 1 6 21 2 3 5 2 4 6 2 6 11 3 4 6 4 5 18 4 6 14 5 6 33   【输出样例】 1 2 2 3 2 4 1 5 1 6 原 图 从第1点出发的最短路径
482
44 迷茫粉碎机
481
45 Zed_knight
476
46 ROY1994
ios::sync_with_stdio(false);
474
47 smallscp
信息学是你的最(cha)选择!
473
48 星空记.逸
Concentration, serious thinking, problem solving is impossible!
472
49 wwwwww
信息学是你的最佳选择!
472
50 dongyx
不进40不改签//吾曰:“何以解忧,唯有AC;何以烦恼,唯有WA;何以变态,唯有PE。三之况乎令吾头欲爆裂,所矣之乎,全以AC唯美;全以WA唯恼;全以PE唯死!!!”//▄︻┻┳══━一开心果i(徐伟哲) Why don’t you go to the hell?
471
51 asz_cjz
#66CCFF 天依生快
468
52 zzj
▄︻┻┳═━一--------------------------------人才分割线--------------------------------一━═┳┻︻▄
459
53 luyue
455
54 酒&伴..
加载中99%...
455
55 超绝可爱南北组
超绝可爱南北组,我最喜欢南北组。南下北上不接受反驳。
453
56 asz_ycx
绝望着,绝望着,秋风来了,新学期的脚步近了。 一切都像刚死去的样子,凄凄凉流下了泪。作业多起来了,试卷堆起来了,我们的脸囧起来了。 同学们的头慢慢地从课桌上抬起来了,沉沉的,重重的。教室里,课桌上,瞧去,一大片一大片满是的。低着,垂着,做几道数学,读几句英语,背几首语文。风轻悄悄的,课桌冷冰冰的。 语文、数学、英语,你不让我,我不让你,都发满了作业赶趟儿。多得像雨,堆得像山,做得像鬼。试卷里带着苦涩味儿;闭了眼,眼前仿佛已经满是练习,测验,考试。眼下成千成百的作业哗哗的做着,大小的试卷发来发去。练习满地都是:杂样儿,有名字的,没名字的,散在课桌上,像恶魔,像冤魂,还飘呀飘的。 “书山题海无穷尽”,不错的,像老师的教鞭抽打着你。风里带来些新出的试卷的气息,混着油墨味儿,还有各种科目的香,都在微微沉闷的空气里酝酿。老师将办公桌安在高高的讲台上,生气起来了,呼班主任引年级主任地卖弄喊哑的喉咙,跟改题的声音应和着。教室里的上课铃,这时候也成天嘹亮的响。 考试是最寻常的,一考就是两三天。可别恼。看,像刺刀,像毒药,像炸弹,密密地安排着,同学头顶上全笼着一层薄烟。眼睛却黑的发亮,脸色也青的逼你的眼。傍晚时候,上灯了,一点点耀眼的光,烘托出一片寂静而忙碌的晚自习。在学校里,教室中,走廊边,有拿起作业慢慢写的人;还有讲题的老师,拿着粉笔,戴着眼镜的。他们的身影,密密麻麻的在校园里静默着。 离周测越来越近了,离月考也近了。语文数英,历史地理,生物政治。题目也赶趟儿似的,一道道都出来了。计算计算题目,背诵背诵课文,各做各的试卷去。“学海无涯苦作舟”,刚开学,有的是作业,有的是功课。 作业像刚落地的娃娃,从头到脚都是新的,没有做过。 作业像小姑娘,花枝招展的,很难,很难。 作业像健壮的青年,有你攻不破的重点和难点,他领着我们考试去。
449
57 王嘉骏
#include<windows.h> int main(){ int x; HWND hwnd; hwnd=FindWindow("ConsoleWindowClass",NULL); if(hwnd) ShowWindow(hwnd,SW_HIDE); while(x!=6){ x=MessageBox(NULL,TEXT("你是猪吗?"),TEXT("啦啦啦啦啦"),4); } }
448
58 jackattack
/* 游戏提示: 1,基本不用打回车; 2,没有光标,不要惊讶; 3,会有清屏延迟; 4,死亡后还可读档; */ #include<iostream> #include<windows.h> #include<cmath> #include<conio.h> #include<time.h> using namespace std; typedef long long ll; typedef char c; typedef string s; ll probability,start,gold,accumulate,NOT,dodge,atk,CD_1,CD_2,fault,freeze,burn,thing=2,reborn; c answer,boss; s ji_neng_1_name[5]={"三连斩","怒攻","瞬杀","穿心","强击"},ji_neng_2_name[5]={"雪刺","磐石古盾","神隐","万箭","寒冰"},ji_neng_3_name[5]={"死战","反刺","隐瞬","利箭","冰魔"}; s ji_neng_1_explain[5]={"连续攻击三次(无视怪物闪避/抵挡,本身暴击)","造成100伤害","如果怪物血量低于闪避则将其斩杀","造成暴击率+暴击量的伤害","造成魔法值双倍的伤害"}; s ji_neng_2_explain[5]={"造成的伤害转化为回血(无视怪物闪避/抵挡,本身暴击)","抵挡本次伤害","若闪避则将怪物斩杀","造成100-怪物闪避的伤害","50%概率冰冻一回合并造成魔法值等量的伤害"}; s ji_neng_3_explain[5]={"造成的伤害增加血量上限-血量","抵挡时怪物受到四分之一的基本伤害","若闪避则攻击乘2","怪物防御减少一半","法师的技能没有冷却,但由魔法值发起"}; s mission[5]={"任务一:升到5级","任务二:升到10级","任务三:通过副本:巨魔堡垒","任务四:通过副本:瞬影森林","任务五:通过副本:熔岩之地"}; s thing_name[3]={"双刃斧碎片","双刃斧图纸"}; int main(); struct status{ ll ATK,DEF,HP,HPM,CTH,CTP,SPD,HEL,LEV,MP,EXP; c JOB; }status; struct player{ ll WEO,AMR,SWEO,GOLD,SKL1,SKL2,DURW,DURA,POTION,SWORD,DMG,LVW,LVA,MSN,THG[3]; }player; struct monster{ ll ATK,DEF,HP,HPM,CTH,CTP,SPD,DMG,LEV,LVB,HEL,TYPE; }monster; void type (s a, ll x){ for(int j=0; j<=a.length(); j++){ cout<<a[j]; Sleep(x); } } void clean (){ Sleep(1000); system("cls"); } void save (){ freopen("game_save.txt","w",stdout); cout<<status.ATK<<" "<<status.DEF<<endl; cout<<status.HP<<" "<<status.HPM<<endl; cout<<status.CTH<<" "<<status.CTP<<endl; cout<<status.SPD<<endl; cout<<status.HEL<<endl; cout<<status.LEV<<" "<<status.EXP<<endl; cout<<status.JOB<<endl; cout<<player.WEO<<" "<<player.AMR<<" "<<player.SWEO<<endl; cout<<player.GOLD<<endl; cout<<player.SKL1<<" "<<player.SKL2<<endl; cout<<player.DURW<<" "<<player.DURA<<endl; cout<<player.SWORD<<" "<<player.POTION<<endl; cout<<monster.LEV<<" "<<monster.LVB<<endl; for(int j=0;j<=thing-1;j++){ cout<<player.THG[j]<<" "; } exit(0); } void equipment(){ type("武器:",10); if(player.WEO==0){ type("无; ",10); } if(player.WEO==1){ type("普通的武器; ",10); } if(player.WEO==2){ if(status.JOB=='4'){ type("巨力神弓; ",10); } else if(status.JOB=='5'){ type("强杖; ",10); } else{ type("狂暴之刃; ",10); } } if(player.WEO==3){ if(status.JOB=='4'){ type("血弩; ",10); } else if(status.JOB=='5'){ type("万圣杖",10); } else{ type("嗜血怒戟; ",10); } } cout<<endl; type("武器耐久度:",10); cout<<player.DURW<<endl; type("武器等级:",10); cout<<player.LVW<<"级"<<endl; type("防具:",10); if(player.AMR==0){ type("无; ",10); } if(player.AMR==1){ type("普通的防具; ",10); } if(player.AMR==2){ type("神速闪避靴; ",10); } if(player.AMR==3){ type("圣光回血盾; ",10); } cout<<endl; type("防具耐久度:",10); cout<<player.DURA<<endl; type("防具等级:",10); cout<<player.LVA<<"级"<<endl; } void death (){ clean(); system("Color FC"); else if(monster.HP!=0){ type("你将要死了……",10); } else{ type("同归于尽……",10); } cout<<endl; type("有什么遗言吗?",10); cout<<endl; cin>>answer; type("The End",10); exit(0); } void war(){ type("怪物攻击:",10); cout<<monster.ATK<<endl; type("怪物防御:",10); cout<<monster.DEF<<endl; type("怪物血量:",10); cout<<monster.HP<<endl; type("怪物暴击率:",10); cout<<monster.CTP<<"%"<<endl; type("怪物暴击量:",10); cout<<monster.CTH<<"%"<<endl; type("怪物闪避率:",10); cout<<monster.SPD<<"%"<<endl; type("怪物等级:",10); cout<<monster.LVB<<endl; type("怪物回血:",10); cout<<monster.HEL<<endl; CD_1=0; CD_2=0; NOT=1; accumulate=0; status.MP=100; while(1){ clean(); dodge=0; player.DMG=0; monster.DMG=0; if(CD_1!=0){ CD_1--; } if(CD_2!=0){ CD_2--; } if(freeze!=0){ freeze--; } if(status.JOB=='4'){ monster.DEF/=2; } if(status.HP==0){ death(); } if(monster.HP==0){ return; } error: fault=0; probability=(rand()%3)+1; type("怪物攻击:",10); cout<<monster.ATK<<endl; type("怪物防御:",10); cout<<monster.DEF<<endl; type("怪物血量:",10); cout<<monster.HP<<endl; cout<<endl; type("你的攻击:",10); cout<<status.ATK<<endl; type("你的防御:",10); cout<<status.DEF<<endl; type("你的血量:",10); cout<<status.HP<<endl; if(status.JOB=='5'){ cout<<"魔法值:"<<status.MP<<endl; } cout<<endl; type("0,逃跑;1,攻击;2,防御;",10); if(player.SWEO>0&&NOT==1){ type("3,神兵",10); } cout<<endl; type("a:",10); if(status.JOB=='5'){ if(status.MP>=20){ type(ji_neng_1_name[4],10); } else{ cout<<"魔法值不够"; } } else{ if(CD_1==0){ type(ji_neng_1_name[status.JOB-'0'-1],10); } else{ cout<<"冷却"<<CD_1<<"回合;"; } } type("b:",10); if(status.JOB=='5'){ if(status.MP>=25){ type(ji_neng_2_name[4],10); } else{ cout<<"魔法值不够"; } } else{ if(CD_2==0){ type(ji_neng_2_name[status.JOB-'0'-1],10); } else{ cout<<"冷却"<<CD_2<<"回合;"; } } cout<<endl; answer=_getch(); if(answer=='0'){ return; } if(boss=='3'&&probability==2){ type("焚世!",10); cout<<endl; type("灼伤!",10); cout<<endl; burn=1; } else if(probability!=0&&freeze!=1){ if(((rand()%100)+1)>status.SPD){ if(((rand()%100)+1)<=monster.CTP){ monster.DMG=monster.ATK+monster.ATK/(100/monster.CTH); type("怪物暴击!",10); cout<<endl; } else{ monster.DMG=monster.ATK; if(monster.TYPE==2){ monster.DMG*=3; } } if(answer=='2'){ monster.DMG=monster.ATK-status.DEF; if(monster.DMG<=0){ monster.DMG=0; type("抵挡!",10); status.HP+=status.HEL; status.HP=min(status.HP,status.HPM); cout<<endl; if(status.JOB=='2'){ monster.HP-=monster.ATK; } } } } else{ type("闪避!",10); dodge=1; cout<<endl; } } if(answer=='1'){ if(((rand()%100)+1)>monster.SPD){ player.DMG=status.ATK; if(status.JOB=='1'){ player.DMG+=status.HPM-status.HP; } if(((rand()%100)+1)<=status.CTP){ player.DMG+=status.ATK/(100/status.CTH); type("暴击!",10); cout<<endl; } if(probability==0&&freeze!=1){ player.DMG-=monster.DEF; if(player.DMG<=0){ player.DMG=0; type("怪物抵挡!",10); monster.HP+=monster.HEL; cout<<endl; } } if(player.WEO==3){ status.HP+=player.DMG/2; status.HP=min(status.HP,status.HPM); type("嗜血!",10); cout<<endl; } } else{ type("怪物闪避!",10); cout<<endl; } } if(answer=='3'&&NOT==1){ NOT--; if(player.SWEO==1){ type("巨人之锤!",10); cout<<endl; if(rand()%100<monster.SPD){ type("怪物闪避!",10); cout<<endl; } else{ player.DMG=status.LEV*4; if(player.WEO==3){ status.HP+=status.LEV; if(status.HP>status.HPM){ status.HP=status.HPM; } } if(probability==1){ player.DMG=status.LEV*4-monster.DEF; if(player.DMG<=0){ player.DMG=0; type("怪物抵挡!",10); cout<<endl; } } } } if(player.SWEO==2){ monster.HP/=2; type("创伤之剑!",10); cout<<endl; } if(player.SWEO==3){ type("请输入攻击值",10); cout<<endl; cin>>atk; monster.HP-=atk*2; status.HP-=atk; monster.DMG=0; type("双刃斧!",10); cout<<endl; } } if(dodge==1&&status.JOB=='3'){ player.DMG*=2; } if(answer=='a'){ if(status.JOB=='5'){ if(status.MP>=20){ cout<<ji_neng_1_name[4]<<"!"<<endl; status.MP-=20; monster.HP-=status.MP*2; } else{ cout<<"魔法值不够!"<<endl; fault=1; } } else{ if(CD_1==0){ CD_1=4; cout<<ji_neng_1_name[status.JOB-'0'-1]<<"!"<<endl; if(status.JOB=='1'){ player.DMG=3*status.ATK; } else if(status.JOB=='2'){ player.DMG=100; } else if(status.JOB=='3'){ if(status.SPD>=monster.HP){ monster.HP=0; } } else{ player.DMG=status.CTH+status.CTP; } } else{ cout<<"一技能冷却中!"<<endl; fault=1; } } } if(answer=='b'&&CD_2==0){ if(status.JOB=='5'){ if(status.MP>=25){ status.MP-=25; cout<<ji_neng_2_name[4]<<"!"<<endl; if(rand()%2==1){ type("冰冻!",10); freeze=2; monster.HP-=status.MP; } } else{ cout<<"魔法值不够!"<<endl; fault=1; } } else{ if(CD_2==0){ CD_2=6; cout<<ji_neng_2_name[status.JOB-'0'-1]<<"!"<<endl; if(status.JOB=='1'){ player.DMG=status.ATK; status.HP+=status.ATK; status.HP=min(status.HP,status.HPM); } else if(status.JOB=='2'){ monster.DMG=0; } else if(status.JOB=='3'){ if(dodge==1){ monster.HP=0; } } else{ player.DMG=100-monster.SPD; } } else{ cout<<"二技能冷却中!"<<endl; fault=1; } } } if(answer!='1'&&answer!='2'&&answer!='3'&&answer!='a'&&answer!='b'){ fault=1; } if(fault==1){ goto error; } status.MP+=5; if(status.MP>100){ status.MP=100; } if(monster.TYPE==1){ player.DMG/=2; } status.HP-=monster.DMG; monster.HP-=player.DMG; if(burn==1){ burn=0; status.HP-=monster.DMG/5; } if(status.HP<0){ status.HP=0; } if(monster.HP<0){ monster.HP=0; } if(status.JOB=='4'){ monster.DEF/=2; } } } void fight (){ monster.TYPE=rand()%3; monster.ATK=(rand()%15)+monster.LEV; monster.DEF=(rand()%40)+monster.LEV*2; monster.HP=(rand()%200)+monster.LEV*8; monster.HPM=(rand()%200)+monster.LEV*8; monster.CTP=rand()%50; monster.CTH=rand()%50; monster.SPD=rand()%50; monster.HEL=rand()%50; gold=(monster.ATK+monster.HP+monster.LEV)/2; type("怪物种类:",10); cout<<endl; if(monster.TYPE==0){ type("普通怪物",10); cout<<endl; } if(monster.TYPE==1){ type("法盾怪物",10); cout<<endl; } if(monster.TYPE==2){ type("巨锤怪物",10); cout<<endl; } war(); if(monster.HP==0){ monster.LEV++; status.EXP++; if(status.EXP==status.LEV){ type("升级!",10); status.LEV++; status.ATK++; status.DEF++; status.HPM++; status.EXP=0; status.HP=status.HPM; } cout<<endl; if(status.LEV%10==0){ status.HP=status.HPM; type("回复至满!",10); cout<<endl; } if(status.LEV==5){ type("死亡商店已开启!",10); cout<<endl; } if(status.LEV==10){ type("BOSS已开启!",10); cout<<endl; } if(monster.TYPE==2&&player.WEO!=2){ type("怪物掉落了一把武器,你是否拾取?(按1)",10); cout<<endl; answer=_getch(); if(answer=='1'){ type("你获得了一把武器",10); cout<<endl; player.WEO=2; player.DURW=10; status.ATK+=10; status.CTH+=20; status.CTP+=20; } } type("金币+",10); cout<<gold<<"$"<<endl; player.GOLD+=gold; answer=0; if(player.DURW!=0){ player.DURW--; } if(player.DURA!=0){ player.DURA--; } if(player.DURW==0&&player.WEO!=0){ status.ATK-=player.WEO*5; if(player.WEO==2){ status.CTH-=20; status.CTP-=20; } status.ATK-=player.LVW; player.LVW=0; player.WEO=0; type("武器磨损!",10); cout<<endl; } if(player.DURA==0&&player.AMR!=0){ status.DEF-=player.AMR*10; status.HPM-=player.AMR*10; status.HEL-=player.AMR*10; if(status.HP>status.HPM){ status.HP=status.HPM; } if(player.AMR==2){ status.SPD-=20; } if(player.AMR==3){ status.HEL-=10; } status.DEF-=player.LVA; status.HPM-=player.LVA; status.HEL-=player.LVA; player.LVA=0; player.AMR=0; type("防具磨损!",10); cout<<endl; } if(monster.TYPE==0){ type("你获得了一块碎片",10); cout<<endl; player.THG[0]++; } } else{ type("你成功逃跑,但在逃跑过程中撒了一地金币……",10); cout<<endl; player.GOLD/=2; if(status.HP>=status.HPM/2&&player.AMR!=3){ type("你在逃跑过程中找到了一副防具,要不要拾取?(按1)",10); cout<<endl; answer=_getch(); if(answer=='1'){ type("你获得了一副防具",10); cout<<endl; player.AMR=3; player.DURA=15; status.HEL+=40; status.DEF+=30; } } } clean(); } void shop (){ while(1){ type("你有:",10); cout<<"$"<<player.GOLD<<endl; type("1,血瓶(+20血量),",10); cout<<"$"<<player.POTION<<";"<<endl; type("2,",10); if(player.SWORD==0){ type("创伤之剑",10); } else{ type("普通的武器",10); } type(",$50;",10); cout<<endl; type("3,普通的防具,$50",10); cout<<endl; type("4,双刃斧碎片,$50",10); cout<<endl; type("5,双刃斧图纸,$",10); cout<<max(0,int(200-10*player.THG[0]))<<endl; type("按0退出",10); cout<<endl; answer=_getch(); if(answer=='1'){ if(player.GOLD>=player.POTION){ if(status.HP==status.HPM){ type("血满了",10); cout<<endl; } else{ status.HP+=20; if(status.HP>status.HPM){ status.HP=status.HPM; } player.GOLD-=player.POTION; type("购买成功",10); cout<<endl; player.POTION+=5; } } else{ type("钱不够",10); cout<<endl; } } if(answer=='2'){ if(player.GOLD>=50){ if(player.SWORD==0){ player.SWEO=2; player.GOLD-=50; type("购买成功",10); cout<<endl; } else{ player.WEO=1; player.DURW=5; player.GOLD-=50; status.ATK+=5; type("购买成功",10); cout<<endl; } player.SWORD=rand()%4; } else{ type("钱不够",10); cout<<endl; } } if(answer=='3'){ if(player.GOLD>=50){ player.GOLD-=50; player.AMR=1; player.DURA=5; status.HPM+=10; status.DEF+=10; status.HEL+=10; type("购买成功",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } if(answer=='4'){ if(player.GOLD>=50){ player.GOLD-=50; player.THG[0]++; type("购买成功",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } if(answer=='5'){ if(player.GOLD>=max(0,int(200-10*player.THG[0]))){ player.GOLD-=200-10*player.THG[0]; player.THG[1]++; type("购买成功",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } if(answer=='0'){ clean(); break; } } } void backpack (){ while(1){ type("职业:",10); if(status.JOB=='1'){ type("战士",10); } else if(status.JOB=='2'){ type("坦克",10); } else if(status.JOB=='3'){ type("刺客",10); } else if(status.JOB=='4'){ type("射手",10); } else{ type("法师",10); } cout<<endl; type("攻击:",10); cout<<status.ATK<<" "; type("防御:",10); cout<<status.DEF<<endl; type("血量:",10); cout<<status.HP<<" "; type("血量上限:",10); cout<<status.HPM<<endl; type("暴击率:",10); cout<<status.CTP<<"%"<<" "; type("暴击量:",10); cout<<status.CTH<<"%"<<endl; type("回血:",10); cout<<status.HEL<<" "; type("闪避:",10); cout<<status.SPD<<"%"<<endl; type("金币:",10); cout<<player.GOLD<<" "<<endl; type("等级:",10); cout<<status.LEV<<" "; type("经验:",10); cout<<status.EXP<<"/"<<status.LEV<<endl; type("经验进度:",10); cout<<round(status.EXP/status.LEV*100)<<"%"<<endl; cout<<endl; equipment(); type("神兵:",10); if(player.SWEO==1){ type("巨人之锤",10); cout<<endl; } if(player.SWEO==2){ type("创伤之剑",10); cout<<endl; } if(player.SWEO==3){ type("双刃斧",10); cout<<endl; } if(player.SWEO==0){ type("无",10); cout<<endl; } cout<<endl; type("背包:",10); cout<<endl; for(int j=0;j<=thing-1;j++){ if(player.THG[j]>0){ cout<<thing_name[j]<<":"<<player.THG[j]<<endl; } } cout<<endl; type("任务:",10); cout<<endl; if(player.MSN==4){ type("任务全部完成!",10); cout<<endl; } else{ cout<<mission[player.MSN]<<endl; } cout<<endl; type("按0退出",10); cout<<endl; answer=_getch(); if(answer=='0'){ clean(); break; } } } void skill (){ while(1){ type("你有$",10); cout<<player.GOLD<<endl; type("1,天龙之击:",10); cout<<player.SKL1<<"级"<<endl; if(player.SKL1==0){ type("100$,",10); } else{ cout<<player.SKL1*10<<"$,"; } type("每升一级攻击加5",10); cout<<endl; type("2,圣光之力:",10); cout<<player.SKL2<<"级"<<endl; if(player.SKL2==0){ type("100$,",10); } else{ cout<<player.SKL2*10<<"$,"; } type("每升一级回血加5",10); cout<<endl; cout<<endl; type("自带技能:",10); cout<<endl; type("主动技能:",10); cout<<endl; type(ji_neng_1_name[status.JOB-'0'-1],10); cout<<":"; type(ji_neng_1_explain[status.JOB-'0'-1],10); cout<<endl; type(ji_neng_2_name[status.JOB-'0'-1],10); cout<<":"; type(ji_neng_2_explain[status.JOB-'0'-1],10); cout<<endl; type("被动技能:",10); cout<<endl; type(ji_neng_3_name[status.JOB-'0'-1],10); cout<<":"; type(ji_neng_3_explain[status.JOB-'0'-1],10); cout<<endl; type("按0退出",10); cout<<endl; answer=_getch(); if(answer=='1'){ if(player.SKL1==0){ if(player.GOLD>=100){ player.GOLD-=100; player.SKL1=1; status.ATK+=5; type("获得技能!",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } else{ if(player.GOLD>=player.SKL1*10){ player.GOLD-=player.SKL1*10; player.SKL1++; status.ATK+=5; type("技能升级!",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } } if(answer=='2'){ if(player.SKL2==0){ if(player.GOLD>=100){ player.GOLD-=100; player.SKL2=1; status.HEL+=5; type("获得技能!",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } else{ if(player.GOLD>=player.SKL2*10){ player.GOLD-=player.SKL2*10; player.SKL2++; status.HEL+=5; type("技能升级!",10); cout<<endl; } else{ type("钱不够",10); cout<<endl; } } } if(answer=='0'){ clean(); break; } } } void forge(){ while(1){ equipment(); type("1,修复装备;",10); cout<<endl; type("2,升级装备;",10); cout<<endl; type("3,制造装备;",10); cout<<endl; type("按0退出",10); cout<<endl; answer=_getch(); clean(); if(answer=='1'){ type("1,修复武器:",10); cout<<endl; cout<<"$"<<(player.WEO*4-player.DURW)*10; cout<<endl; type("2,修复防具:",10); cout<<endl; cout<<"$"<<(player.AMR*4-player.DURA)*10; cout<<endl; answer=_getch(); if(answer=='1'){ if(player.GOLD>=(player.WEO*4-player.DURW)*10){ type("修复成功!",10); player.GOLD-=(player.WEO*4-player.DURW)*10; player.DURW=player.WEO*4; } else{ type("钱不够",10); } } if(answer=='2'){ if(player.GOLD>=(player.AMR*4-player.DURA)*10){ type("修复成功!",10); player.GOLD-=(player.AMR*4-player.DURA)*10; player.DURA=player.AMR*4; } else{ type("钱不够",10); } } answer=' '; clean(); } if(answer=='2'){ type("1,升级武器:",10); cout<<endl; cout<<"$"<<(player.LVW+1)*10; cout<<endl; type("2,升级防具:",10); cout<<endl; cout<<"$"<<(player.LVA+1)*10; cout<<endl; answer=_getch(); if(answer=='1'){ if(player.GOLD>=(player.LVW+1)*10){ type("升级成功!",10); player.GOLD-=(player.LVW+1)*10; player.LVW++; status.ATK++; } else{ type("钱不够",10); } } if(answer=='2'){ if(player.GOLD>=(player.LVA+1)*10){ type("修复成功!",10); player.GOLD-=(player.LVA+1)*10; player.LVA++; status.DEF++; status.HPM++; status.HEL++; } else{ type("钱不够",10); } } clean(); answer=' '; } if(answer=='3'){ type("1,制造双刃斧",10); cout<<endl; type("需要:双刃斧碎片*10;双刃斧图纸*1;金币*100;",10); cout<<endl; type("按0退出;",10); cout<<endl; answer=_getch(); if(answer=='1'){ if(player.THG[0]>=10&&player.THG[1]>=1&&player.GOLD>=100){ type("制造成功!",10); cout<<endl; player.THG[0]-=10; player.THG[1]-=1; player.GOLD-=100; player.SWEO=3; } else{ type("原料不足",10); cout<<endl; } } clean(); } if(answer=='0'){ break; } } } void deathshop (){ type("欢迎来到神秘的死亡商店",10); cout<<endl; type("在这里你得用血量来买东西",10); cout<<endl; while(1){ type("血量:",10); cout<<status.HP<<endl; type("1,神速闪避靴,价值:",10); cout<<status.HP/2<<endl; type("2,升级瓶,价值:",10); cout<<status.LEV*2<<endl; if(status.JOB=='4'){ type("3,血弩,价值:",10); } else if(status.JOB=='5'){ type("3,血杖,价值:",10); } else{ type("3,嗜血怒戟,价值:",10); } cout<<pow((player.WEO+1)*5,2)<<endl; type("按0退出",10); cout<<endl; answer=_getch(); if(answer=='1'&&player.AMR!=2){ status.HP=status.HP-status.HP/2; type("消费成功",10); cout<<endl; player.AMR=2; player.DURA=10; status.HPM+=20; status.HEL+=20; status.SPD+=20; } if(answer=='2'){ if(status.HP<=status.LEV*2){ type("命不够",10); cout<<endl; } else{ type("消费成功",10); cout<<endl; status.HP=status.HP-status.LEV*2; status.LEV++; status.EXP=0; status.ATK++; type("升级!",10); cout<<endl; if(player.MSN==1&&status.LEV==10){ type("任务二已完成!",10); cout<<endl; type("金币+100",10); cout<<endl; player.GOLD+=100; player.MSN++; } if(status.LEV==10){ type("BOSS已开启!",10); cout<<endl; } } } if(answer=='3'){ if(status.HP<=pow((player.WEO+1)*5,2)){ type("命不够",10); cout<<endl; } else{ type("消费成功",10); cout<<endl; status.HP-=pow((player.WEO+1)*5,2); player.WEO=3; player.DURW=15; status.ATK+=15; } } if(answer=='0'){ clean(); break; } } } void BOSS (){ NOT=1; boss: type("你要挑战哪个副本?",10); cout<<endl; type("1,巨魔堡垒;",10); cout<<endl; type("2,瞬影森林;",10); cout<<endl; type("3,熔岩之地;",10); boss=_getch(); if(boss=='1'){ type("这座堡垒现在已经废弃,不知这里曾经的主人在哪里...",20); cout<<endl; type("午夜时分",20); cout<<endl; type("传出一声怒吼",20); cout<<endl; type("瘫倒的堡垒开始颤抖...",20); cout<<endl; monster.ATK=80+monster.LVB*5; monster.DEF=60+monster.LVB*5; monster.HP=200+monster.LVB*5; monster.HPM=200+monster.LVB*5; monster.CTP=40; monster.CTH=40; monster.SPD=10; monster.HEL=20+monster.LVB*5; } else if(boss=='2'){ type("森林一直不太宁静",20); cout<<endl; type("总是发出如风扫过的声音",20); cout<<endl; type("然后一个灵魂就消失在这森林里...",20); cout<<endl; monster.ATK=45+monster.LVB*5; monster.DEF=45+monster.LVB*5; monster.HP=100+monster.LVB*5; monster.HPM=100+monster.LVB*5; monster.CTP=10; monster.CTH=10; monster.SPD=50; monster.HEL=20+monster.LVB*5; } else if(boss=='3'){ type("这里只有熔岩...",20); cout<<endl; type("这里只有熔岩?",20); cout<<endl; monster.ATK=60+monster.LVB*5; monster.DEF=50+monster.LVB*5; monster.HP=150+monster.LVB*5; monster.HPM=150+monster.LVB*5; monster.CTP=30; monster.CTH=30; monster.SPD=25; monster.HEL=15+monster.LVB*5; } else{ goto boss; } war(); if(boss=='1'&&player.MSN==1){ type("任务三已完成!",10); cout<<endl; type("是否领取神兵?(按1)",10); cout<<endl; answer=_getch(); if(answer=='1'){ type("你获得了一把神兵",10); cout<<endl; player.SWEO=1; } player.MSN++; } if(boss=='2'&&player.MSN==2){ type("任务四已完成!",10); cout<<endl; type("升一级!",10); cout<<endl; status.EXP=0; status.LEV++; status.ATK++; status.HPM++; status.DEF++; player.MSN++; status.HP=status.HPM; } if(boss=='2'&&player.AMR!=2){ type("怪物掉落了一套防具,你是否拾取?(按1)",10); cout<<endl; cin>>answer; if(answer=='1'){ type("你获得了一套防具",10); cout<<endl; player.AMR==2; } } if(boss=='3'&&player.MSN==3){ type("任务五已完成!",10); cout<<endl; type("升二级!",10); cout<<endl; type("金币+200$",10); cout<<endl; status.EXP=0; status.LEV+=2; status.ATK+=2; status.HPM+=2; status.DEF+=2; player.GOLD+=200; player.MSN++; status.HP=status.HPM; } boss=0; status.EXP=0; status.LEV++; status.ATK++; status.HPM++; status.DEF++; player.GOLD+=100; status.HP=status.HPM; type("升级!",10); cout<<endl; type("金币+100$",10); cout<<endl; if(player.DURW!=0){ player.DURW-=5; } if(player.DURA!=0){ player.DURA-=5; if(player.DURW<=0&&player.WEO==0){ status.ATK-=player.WEO*10; if(player.WEO==2){ status.CTH-=20; status.CTP-=20; } status.ATK-=player.LVW; player.LVW=0; player.WEO=0; type("武器磨损!",10); cout<<endl; } if(player.DURA<=0&&player.AMR==0){ status.DEF-=player.AMR*10; status.HPM-=player.AMR*10; status.HEL-=player.AMR*10; if(status.HP>status.HPM){ status.HP=status.HPM; } if(player.AMR==2){ status.SPD-=20; } if(player.AMR==3){ status.HEL-=10; } status.DEF-=player.LVA; status.HPM-=player.LVA; status.HEL-=player.LVA; player.LVA=0; player.AMR=0; type("防具磨损!",10); cout<<endl; } monster.LVB+=20; monster.LEV+=10; answer=0; clean(); } } void dictionary(){ while(1){ type("1,怪物图鉴",10); cout<<endl; type("2,神兵图鉴",10); cout<<endl; type("按0退出",10); answer=_getch(); clean(); if(answer=='1'){ while(1){ type("1,普通怪物:掉落双刃斧碎片,无技能;",10); cout<<endl; type("2,法盾怪物:受到的伤害减半;",10); cout<<endl; type("3,巨锤怪物:掉落狂暴之刃/巨力神弓,第三次攻击伤害乘三;",10); cout<<endl; type("按0退出(上面是编号)",10); cout<<endl; answer=_getch(); if(answer=='0'){ break; } } } if(answer=='2'){ while(1){ type("1,巨人之锤:造成等级乘四的伤害;",10); cout<<endl; type("2,创伤之剑:削去怪物一半的体力;",10); cout<<endl; type("3,双刃斧:牺牲自己一定的体力,抵免怪物的伤害,并造成牺牲体力乘二的伤害;",10); cout<<endl; type("按0退出(上面是编号)",10); cout<<endl; answer=_getch(); if(answer=='0'){ break; } } } if(answer=='0'){ break; } } } int main(){ CONSOLE_CURSOR_INFO cursor_info={1,0}; SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info); system("mode con:cols=50 lines=30"); system("Color F9"); type("呵呵",10); clean(); type("游戏初始化中...大约会有10秒...",10); cout<<endl; while(start!=100){ cout<<start<<"%"<<endl; start++; Sleep(2000/start); } type("加载成功!",10); clean(); if(MessageBox(NULL,"是否读档?","游戏",MB_YESNO)==6){ freopen("game_save.txt","r",stdin); cin>>status.ATK>>status.DEF; cin>>status.HP>>status.HPM; cin>>status.CTH>>status.CTP; cin>>status.SPD; cin>>status.HEL; cin>>status.LEV>>status.EXP; cin>>status.JOB; cin>>player.WEO>>player.AMR>>player.SWEO; cin>>player.GOLD; cin>>player.SKL1>>player.SKL2; cin>>player.DURW>>player.DURA; cin>>player.SWORD>>player.POTION; cin>>monster.LEV>>monster.LVB; for(int j=0;j<=thing-1;j++){ cin>>player.THG[j]; } freopen("CON","r",stdin); } else{ job: type("你选择的角色是?(括号里的是长短处)",10); cout<<endl; type("1,战士;",10); cout<<endl; type("2,坦克(回血+,闪避-);",10); cout<<endl; type("3,刺客(暴击+,生命-);",10); cout<<endl; type("4,射手(攻击+,防御-)",10); cout<<endl; type("5,法师",10); cout<<endl; status.JOB=_getch(); status.ATK=10; status.DEF=35; status.HPM=100; status.CTH=status.CTP=status.SPD=15; status.LEV=1; player.GOLD=100; player.POTION=20; player.SWORD=1; if(status.JOB=='1'){ status.ATK=10; status.DEF=35; status.HPM=100; status.CTH=status.CTP=status.SPD=15; status.LEV=1; } else if(status.JOB=='2'){ status.HPM+=20; status.DEF+=20; status.CTP+=5; status.CTH+=5; status.SPD-=15; status.HEL+=5; } else if(status.JOB=='3'){ status.HPM-=50; status.ATK+=5; status.DEF-=10; status.CTP+=10; status.CTH+=10; status.SPD+=15; } else if(status.JOB=='4'){ status.HPM-=15; status.ATK+=10; status.DEF-=20; status.CTP+=5; status.CTH+=5; status.SPD-=10; } else if(status.JOB=='5'){ status.ATK=10; status.DEF=35; status.HPM=100; status.CTH=status.CTP=status.SPD=15; status.LEV=1; } else{ goto job; } status.HP=status.HPM; player.THG[2]=1; clean(); } while(1){ srand(time(NULL)); if(player.MSN==0&&status.LEV==5){ type("任务一已完成!",10); cout<<endl; type("金币+100",10); cout<<endl; player.GOLD+=100; player.MSN++; } if(player.MSN==1&&status.LEV==10){ type("任务二已完成!",10); cout<<endl; type("金币+100",10); cout<<endl; player.GOLD+=100; player.MSN++; } type("1,打仗; 2,商店; 3,状态;",10); cout<<endl; type("4,技能; 5,锻造; 6,图鉴",10); cout<<endl; if(status.LEV>=5){ type(" 7,死亡商店;",10); } if(status.LEV>=10){ type(" 8,BOSS副本;",10); cout<<endl; } type("0,退出并存档;",10); cout<<endl; answer=_getch(); clean(); if(answer=='1'){ fight(); answer=' '; } if(answer=='2'){ shop(); answer=' '; } if(answer=='3'){ backpack(); answer=' '; } if(answer=='4'){ skill(); answer=' '; } if(answer=='5'){ forge(); answer=' '; } if(answer=='6'){ dictionary(); answer=' '; } if(answer=='7'&&status.LEV>=5){ deathshop(); answer=' '; } if(answer=='8'&&status.LEV>=10){ BOSS(); answer=' '; } if(answer=='0'){ save(); } } }
447
59 zihao
#include<bits/stdc++.h> using namespace std; int main() { int i,j,t,f=0,c; char a[31]={0}; cin>>a; int l=strlen(a); for(i=0;i<l;i++) a[i]=a[i]-'0'; for(int k=2;k<=9;k++) { t=0; for(i=0;i<l;i++) { int x=a[i]+t*10; t=x%k; } if(t==0) { c++; cout<<k<<" "; } } if(c==0) cout<<"none"<<endl; }
445
60 tfdnsc
439
61 CDy
428
62 sos
模拟只会猜题意 贪心只能过样例  数学上来先打表 DP一般看规律 组合数学靠运气 计算几何瞎暴力 图论强行套模板 数论只会GCD 递推莫名UKE 递归堆栈往外溢 深搜总是TLE 广搜队列MLE 分治做得像枚举 叉堆做的像暴力 ▄︻┻┳══━一吴楚
428
63 asz_czy
C:\ProgramData\Microsoft\Windows\Start Menu\Programs\Games
427
64 hmy
蒟蒻果冻
422
65 年轻人
。。。
420
66 kkksc03
//点歌位招租 <div class="progress"> <div class="progress-bar progress-bar-success" style="width:20%">AC</div> <div class="progress-bar progress-bar-warning" style="width:20%">TLE</div> <div class="progress-bar progress-bar-info" style="width:20%">PC</div> <div class="progress-bar progress-bar progress-bar-striped active" style="width:20%"></div> <div class="progress-bar progress-bar-danger" style="width:20%">WA </div> </div> <button type="submit" class="btn btn-primary">提交</button> <button type="submit" class="btn btn-success">提交</button> <button type="submit" class="btn btn-danger">提交</button> <button type="submit" class="btn btn-warning">提交</button> <button type="submit" class="btn">提交</button> <button type="submit" class="btn btn-info">提交</button> <button type="submit" class="btn btn-default">提交</button> <div class="progress"><div class="progress-bar progress-bar-warning progress-bar-striped active" style="width:100%"></div></div> <text>-->点击膜我</text> <button onclick="document.forms['logout_form'].submit();return false;" class="btn btn-danger">%%%</button>
419
67 azs_wjl
418
68 wuzheng
#include<bits/stdc++.h> using namespace std; int n,k; int f[105][105]; int a[100]; int main() { cin>>n>>k; k+=3; if(n<2*k) { printf("-1\n"); return 0; } for(int i=1; i<=n; i++)cin>>a[i]; sort(a+1,a+1+n); memset(f,0x3f,sizeof(f)); f[0][0]=f[1][0]=0; for(int i=2; i<=n; i++) for(int j=1; j<=k; j++) f[i][j]=min(f[i-1][j],f[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1])); cout<<f[n][k]; }
418
69 showwlw
417
70 stutdown -s -t 1
415
71 yuyunli
化学是你的最佳选择!【请不要乱改签名谢谢
414
72 迎风布阵
老夫当年也是神一样的少年
412
73 lxp_xitan
411
74 UFOS
#include<bits/stdc++.h> using namespace std; int main() { int n,i,j,s=0,a; cin>>n; for(i=1;i<=n;i++) { a=i; while(a) { if(a%10==7) s++; a/=10; } } cout<<s; }
409
75 Super_CP
shutdown -s -t 0 ================================================== {"version":1.3,"features":{"location":{"room":true,"outside":true,"world":true}},"stores":{"wood":18893,"meat":3578,"bait":120,"fur":834,"teeth":49,"scales":20,"cloth":29,"cured meat":239,"charm":1,"leather":100,"compass":1,"bone spear":9,"torch":3,"l armour":1,"waterskin":1,"rucksack":1},"character":{"starved":1},"income":{"gatherer":{"delay":10,"stores":{"wood":0},"timeLeft":8},"builder":{"delay":10,"stores":{"wood":2},"timeLeft":4},"hunter":{"delay":10,"stores":{"fur":40,"meat":40},"timeLeft":5},"trapper":{"delay":10,"stores":{"meat":0,"bait":0},"timeLeft":5},"charcutier":{"delay":10,"stores":{"meat":0,"wood":0,"cured meat":0},"timeLeft":5},"tanner":{"delay":10,"stores":{"fur":0,"leather":0},"timeLeft":9}},"timers":{},"game":{"builder":{"level":4},"temperature":{"value":2,"text":"很宜人"},"fire":{"value":2,"text":"冒出火苗"},"buildings":{"trap":10,"lodge":1,"cart":1,"trading post":1,"smokehouse":1,"hut":20,"tannery":1,"workshop":1},"population":80,"workers":{"hunter":80,"trapper":0,"charcutier":0,"tanner":0},"outside":{"seenForest":true},"world":{"map":[[".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",";",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",",",",",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",","],[".",".",".",",",",",";",";",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",","],[".",".",",",",",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";","Y",";",";",";","Y",",",";",";",";",";",";",";",";",";","Y",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",".",".",".",".",".",",",",",",",",",","],[".",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",".",".",".",".",",",",",";",";",";",";"],[",",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",","B",",",",",",",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";"],[",",",",",",".",".",".",";",";",";",";",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";"],[",",",",".",".",".",".",";",";",";",";",".",".",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";","Y",";",".",".",".",".","H",".",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",";",";",";",";",";",";",";",";",";",";",";",",",",",",",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",".",".",";",";",";",";",";",";",";","Y",";",";",";",",",",",",",",",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";","."],[".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","B","Y",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",",",";",";",";",";",";",",",",",",",";",".",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",","B",";",";",";",";",";",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",";",";",",",",",";",";",";",";",";",";",";",";",";","B",";",";",".",".","F",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",",",",",";",";",";",";",";",";",";",",",",",",",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",".",".",".",".",".",".",".",",",",",";",";",";",";",";",";",";",".",".",".",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";","Y",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",".",".",".",",",",",";",";",";","O",";",";",";",".",".",".","O",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",".",",",",",",",",",";",";",";",";","H",";",";",";",".",".",".",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",".",";",";",";",";",";",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";","H",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",";",";",";",";",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".","H",".",".",",",",","V",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".",",",",",",",",",",",";",";",";",";",";",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".","."],["Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",","V",".",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",","V",",",",",",",",",".",".",",",";",".",";",";",";",";",";",";",";","O",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",";","A",";","H",";",";",";",";",";","H",";",";",";",";","O",";",".",".",".",".",".",".",".",".",".","F",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",","H",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".","W",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",","O",",",",",",",",",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",",",",",",","H",",",",",",",",",",",",",",",",",",","O",",","C",".",".","V",".",".",".","I",";",";",";",";",";",";","O",";",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",","B",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".","V",";",";",";",".",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",";",";",".",".",".",".",".",".",".",".",".",".",";",".",".",".",",",",",",",".",".","S",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","Y"],["Y",",",",",",",",",",",",",",",",",",",",",",",",",",","B",".",".",".","F",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],["B",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",",",",","O",",",",",",",",",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".","B",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".","B",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",","Y",",",",",".",".",".",".",".",",",",",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".","F",".",",",",",",","B",".",".",".",".",".",".",",",",",",",",",",",",","O",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".","O",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".","Y",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",",",",",",",".",".",",",",",",",",",".",".",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",",",",",".",".",".",".",",",",",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",";",";",";"],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","F",".",".",".",".",".",".",".",".",".",",",",","Y",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",".",".",".",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",".",".",";",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","H",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".","M",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",".",".",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",".",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",";",";",";",",",","],[",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",",",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",",",",",",",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","H","Y",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",","]],"mask":[[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[]]},"thieves":2,"stolen":{"wood":3180,"fur":793,"meat":1590}},"playStats":{},"previous":{},"config":{"hyperMode":true,"lightsOff":true},"cooldown":{},"cured meat":5,"charm":0,"torch":3,"bone spear":5,"l armour":0,"waterskin":0,"rucksack":0,"outfit":{"bone spear":5,"cured meat":5,"torch":3}} -------------------------------------------------------- hhhh No2222222222222222222222222222 {"version":1.3,"features":{"location":{"room":true,"outside":true,"world":true}},"stores":{"wood":16502,"meat":4804,"bait":370,"fur":1827,"teeth":56,"scales":35,"cloth":36,"cured meat":579,"charm":4,"leather":410,"compass":1,"bone spear":9,"torch":4,"l armour":1,"waterskin":1,"rucksack":1},"character":{"starved":1},"income":{"gatherer":{"delay":10,"stores":{"wood":34},"timeLeft":3},"builder":{"delay":10,"stores":{"wood":2},"timeLeft":9},"hunter":{"delay":10,"stores":{"fur":8,"meat":8},"timeLeft":10},"trapper":{"delay":10,"stores":{"meat":-10,"bait":10},"timeLeft":10},"charcutier":{"delay":10,"stores":{"meat":-50,"wood":-50,"cured meat":10},"timeLeft":10},"tanner":{"delay":10,"stores":{"fur":-50,"leather":10},"timeLeft":4}},"timers":{},"game":{"builder":{"level":4},"temperature":{"value":4,"text":"很热"},"fire":{"value":4,"text":"熊熊燃烧"},"buildings":{"trap":10,"lodge":1,"cart":1,"trading post":1,"smokehouse":1,"hut":20,"tannery":1,"workshop":1},"population":80,"workers":{"hunter":16,"trapper":10,"charcutier":10,"tanner":10},"outside":{"seenForest":true},"world":{"map":[[".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",";",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",",",",",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",","],[".",".",".",",",",",";",";",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",","],[".",".",",",",",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";","Y",";",";",";","Y",",",";",";",";",";",";",";",";",";","Y",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",".",".",".",".",".",",",",",",",",",","],[".",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",".",".",".",".",",",",",";",";",";",";"],[",",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",","B",",",",",",",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";"],[",",",",",",".",".",".",";",";",";",";",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";"],[",",",",".",".",".",".",";",";",";",";",".",".",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";","Y",";",".",".",".",".","H",".",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",";",";",";",";",";",";",";",";",";",";",";",",",",",",",";",";",";",";",";",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";"],[".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",".",".",";",";",";",";",";",";",";","Y",";",";",";",",",",",",",",",";",";",";",";",";",";",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";","."],[".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","B","Y",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",",",";",";",";",";",";",",",",",",",";",".",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",","B",";",";",";",";",";",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",";",";",";",";",";",";",",",",",";",";",";",";",";",";",";",";",";","B",";",";",".",".","F",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",",",",",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",";",";",",",",",";",";",";",";",";",";",";",",",",",",",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",".",".",".",".",".",".",".",",",",",";",";",";",";",";",";",";",".",".",".",",",",",",",",",",",",",";",";",";",";",";",";",";",";",";","Y",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",".",".",".",",",",",";",";",";","O",";",";",";",".",".",".","O",",",",",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",".",".",".",".",".",",",",",",",",",";",";",";",";","H",";",";",";",".",".",".",",",",",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",".",";",";",";",";",";",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";","H",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",";",";",";",";",";",";",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".","H",".",".",",",",","V",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".",",",",",",",",",",",";",";",";",";",";",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".","."],["Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",","V",".",",",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",","V",",",",",",",",",".",".",",",";",".",";",";",";",";",";",";",";","O",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",";","A",";","H",";",";",";",";",";","H",";",";",";",";","O",";",".",".",".",".",".",".",".",".",".","F",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",","H",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".","W",".",".","."],[".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",","O",",",",",",",",",",",",",",",".",".",".",".",".",";",";",";",";",";",";",";",";",";",";",";",";",";",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",".",",",",",",","H",",",",",",",",",",",",",",",",",",","O",",","C",".",".","V",".",".",".","I",";",";",";",";",";",";","O",";",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",",","B",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".","V",";",";",";",".",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",".",".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",";",";",".",".",".",".",".",".",".",".",".",".",";",".",".",".",",",",",",",".",".","S",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[".",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","Y"],["Y",",",",",",",",",",",",",",",",",",",",",",",",",",","B",".",".",".","F",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],["B",",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",",",",","O",",",",",",",",",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".","B",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".","B",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",","Y",",",",",".",".",".",".",".",",",",",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".","Y",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".","F",".",",",",",",","B",".",".",".",".",".",".",",",",",",",",",",",",","O",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",",",",",",",".",".",".",".",".","O",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".","Y",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",",",",",",",".",".",",",",",",",",",".",".",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",",",",",".",".",".",".",",",",",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",".","."],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",";",";",";"],[",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",",",".",".",".",".",".",".",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","F",".",".",".",".",".",".",".",".",".",",",",","Y",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",".",".",".",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","Y",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",".",".",".",".",".",".",";",";",";",";"],[",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","H",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".","M",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",".",".",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",".",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",";",";",";",";"],[",",",",",",",",".",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",";",";",";",",",","],[",",",",",",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",",",".",".",".",".",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",",",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",";",";",";",",",","],[",",",",",",",",",",".",".",",",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".","H","Y",".",".",",",",",",",",",",",",",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",".",","]],"mask":[[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true,true,true],[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,true],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[]]},"thieves":2,"stolen":{"wood":3180,"fur":793,"meat":1590}},"playStats":{},"previous":{},"config":{"hyperMode":true,"lightsOff":true},"cooldown":{},"cured meat":5,"charm":0,"torch":3,"bone spear":5,"l armour":0,"waterskin":0,"rucksack":0,"outfit":{"bone spear":5,"cured meat":5,"torch":3}}
409
76 你家红爷爷
My name is van. I am an artist, a proformance artist.I`m hire, for people to feel their fantasies------------------The♂Deep♂Dark♂Fantasy.
406
77 bluecloudi
不进50不改签——同志们,跟我上!!!▄︻┻┳══━一dongyx(董宇翔) 我是一位少年,燃烧着青春的火焰!我是蒟蒻,正在发奋图强中。开心果i ▄︻┻┳══━一404 Not Found and 王书成.TO 404 Not Found:WHY DO YOU NOT IN THE PIG HOUSE???152 Life is like water :问世间考试何物,直教人拿头撞树 !||谈笑间,学校灰飞烟灭。消息传来,多情因笑我,早写作业。(酒&伴.)|| 模拟只会猜题意 贪心只能过样例  数学上来先打表 DP一般看规律 组合数学靠运气 计算几何瞎暴力 图论强行套模板 数论只会GCD 递推莫名UKE 递归堆栈往外溢 深搜总是TLE 广搜队列MLE 分治做得像枚举 叉堆做的像暴力 404 Not Found
406
78 Wheat
信息学是你的最佳选择!//泥萌都很强啊 QAQ
404
79 CPW
第十二届全国青少年信息学奥林匹克联赛初赛试题 一、 单项选择题 (共20题,每题1.5分,共计30分。每题有且仅有一个正确答案.)。 1. 在下面各世界顶级的奖项中,为计算机科学与技术领域做出杰出贡献的科学家设立的奖项是( )。 A. 沃尔夫奖 B. 诺贝尔奖 C. 菲尔兹奖 D. 图灵奖 考察知识点:计算机科学家/图灵、图灵奖 沃尔夫奖分别奖励在农业、化学、数学、医学和物理领域,或者艺术领域中的建筑、音乐、绘画、雕塑四大项目之一中取得突出成绩的人士,其中沃尔夫数学奖影响最大。菲尔兹奖市一个国际数学联盟的国际数学家大会上颁发的奖项。 2. 在下列各软件中,不属于NOIP竞赛(复赛)推荐使用的语言环境有( )。 A. gcc/g++ B. Turbo Pascal C. RHIDE D.free pascal 考察知识点:NOIP语言环境 3. 以下断电之后仍能保存数据的有( )。 A. 寄存器 B. ROM C. RAM D. 高速缓存 考察知识点:存储器知识,ROM和RAM等 4.Linux是一种( )。 A. 绘图软件 B. 程序设计语言 C. 操作系统 D. 网络浏览器 考察知识点:操作系统软件,LIUNX ,UNIX 等。LINUX 是一类UNIX计算机操作系统的统称,也是自由软件和开发源代码发展中最著名的例子 5. CPU是( )的简称。 //英文全称:Central Processing Unit A. 硬盘 B. 中央处理器 C. 高级程序语言 D. 核心寄存器 考察知识点:中央处理器 6. 在计算机中,防火墙的作用是( )。 A. 防止火灾蔓延 B.防止网络攻击 C. 防止计算机死机 D. 防止使用者误删除数据 考察知识点:网络知识,防火墙功能 7. 在下列关于计算机语言的说法中,不正确的是( )。 A. Pascal和C都是编译执行的高级语言 B. 高级语言程序比汇编语言程序更容易从一种计算机移植到另一种计算机上 C. C++是历史上的第一个支持面向对象的计算机语言 D. 与汇编语言相比,高级语言程序更容易阅读 考察知识点:计算机语言,FORTRAN第一个电脑高级语言,它是1954年美国的IBM的IT成果。20世纪60年代开发的Simula 67 ,是面向对象语言的鼻祖。 是第一个提出面向对象的概念 1972年PARC发布了Smalltalk的第一个版本。大约在此时,“面向对象”这一术语正式确定。Smalltalk被认为是第一个真正面向对象的语言。 8. 在下列关于计算机算法的说法中,不正确的是( )。 A. 一个正确的算法至少要有一个输入 /输入可以不需要,但是输出是必须的 B. 算法的改进,在很大程度上推动了计算机科学与技术的进步 C. 判断一个算法的好坏的主要标准是算法的时间复杂性与空间复杂性 D. 目前仍然存在许多涉及到国计民生的重大课题,还没有找到能够在计算机上实施的有效算法 考察知识点:计算机算法 9. 在下列各种排序算法中,不是以"比较"作为主要操作的算法是( )。 A. 选择排序 B. 冒泡排序 C. 插入排序 D. 基数排序 考察知识点:排序算法,其他都是基于“比较”的排序 10.在编程时(使用任一种高级语言,不一定是Pascal),如果需要从磁盘文件中输入一个很大的二维数组(例如1000*1000的double型数组),按行读(即外层循环是关于行的)与按列读(即外层循环是关于列的)相比,在输入效率上( )。 A. 没有区别 B. 按行读的方式要高一些 C. 按列读的方式要高一些 D. 取决于数组的存储方式。 考察知识点:数组存储 11.在Pascal语言中,表达式 (21 xor 2)的值是( ) A. 441 B. 42 C.23 D.24 先转成二进制,再按位进行异或运算 考察知识点:表达式运算,位运算 12.在Pascal语言中,判断a不等于0且b不等于0的正确的条件表达式是( ) A. not a=0 or not b=0 B. not((a=0)and(b=0)) C. not(a=0 and b=0) D. (a<>0)and (b<>0) 考察知识点:逻辑表达式 13.某个车站呈狭长形,宽度只能容下一台车,并且只有一个出入口。已知某时刻该车站状态为空,从这一时刻开始的出入记录为:"进,出,进,进,进,出,出,进,进,进,出,出"。假设车辆入站的顺序为1,2,3,……,则车辆出站的顺序为( )。 A. 1, 2, 3, 4, 5 B. 1, 2, 4, 5, 7 C. 1, 4, 3, 7, 6 D. 1, 4, 3, 7, 2 考察知识点: 栈 14.高度为n的均衡的二叉树是指:如果去掉叶结点及相应的树枝,它应该是高度为n-1的满二叉树。在这里,树高等于叶结点的最大深度,根结点的深度为0,如果某个均衡的二叉树共有2381个结点,则该树的树高为( )。 A. 10 B. 11 C. 12 D. 13 考察知识点:二叉树性质3的应用。 15. 与十进制数1770 对应的八进制数是( )。 A. 3350 B. 3351 C. 3352 D. 3540 考察知识点:十进制转八进制,整数部分除8求余数,倒读,小数部分乘以8,取整数部分,顺着读。 16.将5个数的序列排序,不论原先的顺序如何,最少都可以通过( )次比较,完成从小到大的排序。 A. 6 B. 7 C. 8 D. 9 考察知识点:排序 17. 设A=B=D=true,C=false,以下逻辑运算表达式值为假的有( )。 A. (A∧B)∨(C∧D) B. ((A∨B∨D)∧C) C. A∧(B∨C∨D) D. (A∧B∧C)∨ D 考察知识点:逻辑运算,真值表达式 18. (2010)16 + (32)8的结果是( )。 A. (8234)10 B. (202B)16 C. (20056)8 D. (100000000110)2 考察知识点:进制求和运算,十进制和八进制和,都转成十进制运算,算出结果后,从十进制转二进制,再一一比较答案,如果十进制和二进制答案都不对,再转八和十六进制。 19. 设栈S的初始状态为空,元素a, b, c, d, e 依次入栈,以下出栈序列不可能出现的有( )。 A. a, b, c, e, d B. b, c, a, e, d C. a, e, c, b, d D. d, c, e, b, a 考察知识点:栈 C中e出栈时,栈顶为d 20. 已知6个结点的二叉树的先根遍历是1 2 3 4 5 6(数字为结点的编号,以下同),后根遍历是3 2 5 6 4 1,则该二叉树的可能的中根遍历是( ) A. 3 2 1 4 6 5 B. 3 2 1 5 4 6 C. 2 1 3 5 4 6 D. 2 3 1 4 6 5 考察知识点:二叉树遍历 第十三届全国青少年信息学奥林匹克联赛初赛试题 单项选择题(共20题,每题1.5分,共计30分。每题有且仅有一个正确答案。) 在以下各项中,( )不是CPU的组成部分。 A.控制器 B.运算器 C.寄存器 D.主板 考察知识点:中央处理器的组成 CPU由控制器、运算器、寄存器、算术逻辑单元(ALU)和累加器等组成 2.在关系数据库中,存放在数据库中的数据的逻辑结构以( )为主。 A.二叉树 B.多叉树 C.哈希表 D.二维表 考察知识点:关系数据库 关系数据库采用关系数据模型,关系数据模型的数据结构简单,是一种二维数据表格结构,所以存放在数据库中的逻辑结构以二维表为主。 3.在下列各项中,只有( )不是计算机存储容量的常用单位。 A.Byte B.KB C.UB D.TB 考察知识点:存储单位 常见存储容量单位:Byte KB MB GB TB PB等 4.ASCII码的含义是( )。 A.二→十进制转换码 B.美国信息交换标准代码 C.数字的二进制编码 D.计算机可处理字符的唯一编码 考察知识点:ASCII码 5.一个完整的计算机系统应包括( )。 A.系统硬件和系统软件 B.硬件系统和软件系统 C.主机和外部设备 D.主机、键盘、显示器和辅助存储器 考察知识点:计算机系统组成、计算机硬件 6.IT的含义是( )。 A.通信技术 B.信息技术 C.网络技术 D.信息学 考察知识点:计算机词汇 7.LAN的含义是( )。 A.因特网 B.局域网 C.广域网 D.城域网 考察知识点:网络分类 因特网——Internet 局域网——Local Area Networks(LAN) 广域网——Wide Area Networks(WAN),城域网——Metropolitan Area Networks(MAN) 8.冗余数据是指可以由其它数据导出的数据。例如,数据库中已存放了学生的数学、语文和英语的三科成绩,如果还存放三科成绩的总分,则总分就可以看作冗余数据。冗余数据往往会造成数据的不一致。例如,上面4个数据如果都是输入的,由于操作错误使总分不等于三科成绩之和,就会产生矛盾。下面关于冗余数据的说法中,正确的是( )。 A.应该在数据库中消除一切冗余数据 B.用高级语言编写的数据处理系统,通常比用关系数据库编写的系统更容易消除冗余数据 C.为了提高查询效率,在数据库中可以保留一些冗余数据,但更新时要做相容性检验 D.做相容性检验会降低效率,可以不理睬数据库中的冗余数据 考察知识点:数据库、冗余数据 适当保留冗余数据,可以提高运行效率 9.在下列各软件,不属于NOIP竞赛(复赛)推荐使用的语言环境有( )。 A.gcc B.g++ C.Turbo C D.Free Pascal 考察知识点:NOIP复赛语言环境 Noip复赛推荐语言环境: 分类 软件 版本 说明 系统软件 NOI Linux 内核 - 2.6.24 NOILinux – 1.2 操作系统 编译器 Gcc 4.1.2 C编译器 G++ 4.1.2 C++编译器 Freepascal 2.0.4 Pascal编译器 调试器 Gdb 6.6 命令行启动 Ddd 3.3.11 命令行启动 集成开发环境 GUIDE 1.0.0 单文件程序IDE(C/C++/Pascal) Anjuta 1.2.4 C/C++ IDE Lazarus 0.9.22 Pascal IDE 10.以下断电后仍能保存数据的有( )。 A.硬盘 B.高速缓存 C.显存 D.RAM 考察知识点:存储器,断电后外存储器都能保持数据,比如硬盘 U盘 光盘等 内存储器就 ROM 11.在下列关于计算机语言的说法中,正确的有( )。 A.高级语言比汇编语言更高级,是因为它的程序的运行效率更高 B.随着Pascal、C等高级语言的出现,机器语言和汇编语言已经退出了历史舞台 C.高级语言比汇编语言程序更容易从一种计算机上移植到另一种计算机上 D.C是一种面向对象的高级计算机语言 考察知识点:计算机语言 12.近20年来,许多计算机专家都大力推崇递归算法,认为它是解决较复杂问题的强有力的工具。在下列关于递归算法的说法中,正确的是( )。 A.在1977年前后形成标准的计算机高级语言“FORTRAN77”禁止在程序使用递归,原因之一是该方法可能会占用更多的内存空间 B.和非递归算法相比,解决同一个问题,递归算法一般运行得更快一些 C.对于较复杂的问题,用递归方式编程一般比非递归方式更难一些 D.对于已经定义好的标准数学函数 sin(x),应用程序中的语句“y=sin(sin(x));”就是一种递归调用 考察知识点:递归算法 13.一个无法靠自身的控制终止的循环成为“死循环”,例如,在C语言程序中,语句“while(1) printf(“*”);”就是一个死循环,运行时它将无休止地打印*号。下面关于死循环的说法中,只有( )是正确的。 A.不存在一种算法,对任何一个程序及相应的输入数据,都可以判断是否会出现死循环,因而,任何编译系统都不做死循环检查 B.有些编译系统可以检测出死循环 C.死循环属于语法错误,既然编译系统能检查各种语法错误,当然也应该能检查出死循环 D.死循环与多进程中出现的“死锁”差不多,而死锁是可以检测的,因而,死循环也可以检测的 考察知识点:编译知识,死循环 14.在Pascal语言中,表达式 (23 or 2 xor 5)的值是( )。 A.18 B.1 C.23 D.32 考察知识点:位运算 15.在Pascal语言中,判断整数a等于0或b等于0或c等于0的正确的条件表达式是( )。 A.not ((a<>0) or (b<>0) or (c<>0)) B.not ((a<>0) and (b<>0) and (c<>0)) C.not ((a=0) and (b=0)) or (c<>0) D.(a=0) and (b=0) and (c=0) 考察知识点:逻辑表达式 16.地面上有标号为A、B、C的三根柱,在A柱上放有10个直径相同中间有孔的圆盘,从上到下依次编号为1,2,3……,将A柱上的部分盘子经过B柱移入C柱,也可以在B柱上暂存。如果B柱上的操作记录为“进、进、出、进、进、出、出、进、进、出、进、出、出”。那么,在C柱上,从下到上的编号为( )。 A.2 4 3 6 5 7 B.2 4 1 2 5 7 C.2 4 3 1 7 6 D.2 4 3 6 7 5 考察知识点:栈 17.与十进制数1770对应的八进制数是( )。 A.3350 B.3351 C.3352 D.3540 考察知识点:进制转换 18.设A=B=True,C=D=False,一下逻辑运算表达式值为假的有( )。 A.(﹁A∧B)∨(C∧D∨A) B.﹁(((A∧B)∨C)∧D) C.A∧(B∨C∨D)∨D D.(A∧(D∨C))∧B 考察知识点:逻辑表达式 19.(2070)16 + (34)8 的结果是( )。 A.(8332)10 B.(208A)16 C.(100000000110)2 D.(20212)8 考察知识点:进制求和 20.已知7个节点的二叉树的先根遍历是1 2 4 5 6 3 7(数字为节点的编号,以下同),中根遍历是4 2 6 5 1 7 3,则该二叉树的后根遍历是( )。 A.4 6 5 2 7 3 1 B.4 6 5 2 1 3 7 C.4 2 3 1 5 4 7 D.4 6 5 3 1 7 2 考察知识点:二叉树遍历 二叉树图如下: 1 第十四届全国青少年信息学奥林匹克联赛初赛试题 一、 单项选择题 (共20题,每题1.5分,共计30分。每题有且仅有一个正确答案.)。 1.微型计算机中,控制器的基本功能是( )。 A. 控制机器各个部件协调工作 B. 实现算术运算和逻辑运算 C. 获取外部信息 D. 存放程序和数据 考察知识点:中央处理器重的控制器功能 2. 设A=true,B=false,C=true,D=false,以下逻辑运算表达式值为真的是( )。 A. (A∧B)∨(C∧D∨ A) B. (( A∧B)∨C)∧ D C. (B∨C∨D)∧D∧A D. A∧(D∨ C)∧B 考察知识点:逻辑表达式真值,注意优先级 3. 在下列关于图灵奖的说法中,不正确的是( )。 A. 图灵奖是美国计算机协会于1966年设立的,专门奖励那些对计算机事业作出重要贡献的个人 B. 图灵奖有“计算机界诺贝尔奖”之称 C. 迄今为止,还没有华裔计算机科学家获此殊荣(2000年 华人姚期智) D. 图灵奖的名称取自计算机科学的先驱、英国科学家阿兰•图灵 考察知识点:图灵奖 4.计算机在工作过程中,若突然停电,( )中的信息不会丢失。 A. ROM和RAM B. CPU C.ROM D. RAM 考察知识点:存储器 内存储器 5.完全二叉树共有2*N-1个结点,则它的叶节点数是( )。 A. N-1 B. N C. 2*N D. 2N-1 考察知识点:完全二叉树性质,画出二叉树结构图,可以特殊值法做 6. 在以下各项中,( )不是操作系统软件。 A. Solaris B. Linux C. Windows Vista D. Sybase 考察知识点:操作系统软件,Solaris 是SUN Microsystems 研发的计算机操作系统,它被认为是UNIX操作系统的衍生版本之一;Sybase是美国Sybase公司研制的一种关系型数据库系统。 7.设栈S的初始状态为空,元素a,b,c,d,e,f依次入栈S,出栈的序列为b,d,f,e,c,a,则栈S的容量至少应该是( )。 A. 6 B. 5 C. 4 D. 3 考察知识点:栈的容量 8. 与十进制数28.5625相等的四进制数是( )。 A. 123.21 B. 131.22 C. 130.22 D. 130.21 考察知识点:十进制转四进制 9. 设字符串S=”Olympic”,S的非空子串的数目是( )。 A. 28 B. 29 C. 16 D. 17 考察知识点:字符子串,长度为1的7个,长度为2的6个,长度为3的5个,长度为4的4个……长度为7的1个,总和=7+6+5+4+3+2+1 10.Web2.0是近年来互联网的热门概念之一,其核心思想是互动与分享。下列网站中,( )是典型的Web2.0应用。 A. Sina B. Flickr C. Yahoo D. Google 考察知识点:信息技术新发展。Flickr为一家提供免费及付费数位照片储存、分享方案的线上服务,也提供网络社群服务的平台。一般认为Flickr 是Web 2.0 应用方式的绝佳例子。 11. 递归过程或函数调用时,处理参数和返回地址,通常使用一种称为( )的数据结构。 A. 队列 B. 多维数组 C. 线性表 D. 栈 考察知识点:递归、函数调用与栈 12. (2008)10 + (5B)16的结果是( )。 A. (833)16 B. (2089)10 C. (4163)8 D. (100001100011)2 考察知识点:进制求和 13. 二叉树T,已知其先根遍历是1 2 4 3 5 7 6(数字为结点的编号,以下同),中根遍历是2 4 1 5 7 3 6,则该二叉树的后根遍历是( )。 A. 4 2 5 7 6 3 1 B. 4 2 7 5 6 3 1 C. 7 4 2 5 6 3 1 D. 4 2 7 6 5 3 1 14.将数组{8, 23, 4, 16, 77, -5, 53, 100}中的元素按从大到小的顺序排列,每次可以交换任意两个元素,最少需要交换( )次。 A. 4 B. 5 C. 6 D. 7 15. 对有序数组{5, 13, 19, 21, 37, 56, 64, 75, 88,92,100}进行二分查找,成功查找元素19的查找长度(比较次数)是( )。 A. 1 B. 2 C. 3 D. 4 考察知识点:二分查找 第一次与56比较,第二次与19比较 16. 面向对象程序设计(Object-Oriented Programming)是一种程序设计的方法论,它将对象作为程序的基本单元,将数据和程序封装在对象中,以提高软件的重用性、灵活性和扩展性。下面关于面向对象程序设计的说法中,不正确的是( )。 A. 面向对象程序设计通常采用自顶向下设计方法进行设计。 B. 面向对象程序设计方法具有继承性(inheritance)、封装性(encapsulation)、多态性(polymorphism)等几大特点。 C. 支持面向对象特性的语言称为面向对象的编程语言,目前较为流行的有C++、JAVA、C#等。 D. 面向对象的程序设计的雏形来自于Simula语言,后来在SmallTalk语言的完善和标准化的过程中得到更多的扩展和对以前思想的重新注解。至今,SmallTalk语言仍然被视为面向对象语言的基础。 考察知识点:面向对象程序设计。程序设计的方法包括结构化设计和面向对象设计方法。 17. 在32*32点阵的“字库”中,汉字“北”与“京”的字模占用字节数之和是( )。 A. 512 B. 256 C. 384 D. 128 考察知识点:汉字存储 32*32/8*2两个汉字 18. 设T是一棵有n个顶点的树,下列说法不正确的是( )。 A. T有n条边 B. T是连通的 C. T是无环的 D. T有n-1条边 19. 下列不属于NOIP竞赛推荐使用的语言环境的是( )。 A. Dev-C++ B. Visual C++ C. free pascal D. Lazarus 20.在PASCAL程序中,表达式(200 or 10)的值是( ) A. 20 B. 1 C. 220 D. 202 第十五届全国青少年信息学奥林匹克联赛初赛试题 单项选择题 (共20题,每题1.5分,共计30分。每题有且仅有一个正确答案。) 1、 关于图灵机下面的说法哪个是正确的: 图灵机是世界上最早的电子计算机。 由于大量使用磁带操作,图灵机运行速度很慢。 图灵机是英国人图灵发明的,在二战中为破译德军的密码发挥了重要作用。 图灵机只是一个理论上的计算模型。 考察知识点:图灵机 最早的电子计算机室ENIAC;图灵机师计算机模型,没有运算速度,更谈不上磁带操作;图灵的本人在二战中破译德军密码系统中发挥了重要作用,而不是图灵机;图灵的基本思想是用机器来模拟人们用纸笔进行数学运算的过程,构造出一台假想的机器。 2、关于计算机内存下面的说法哪个是正确的: 随机存储器(RAM)的意思是当程序运行时,每次具体分配给程序的内存位置是随机而不确定的。 1MB内存通常是指1024*1024字节大小的内存。 计算机内存严格说来包括主存(memory)、高速缓存(cache)和寄存器(register)三个部分。 一般内存中的数据即使在断电的情况下也能保留2个小时以上。 考察知识点:内存储器。RAM不是位置随机,二是随时访问。1MB=1024KB=1024*1024B 高速缓存和寄存器的物理实现是集成在CPU中,这两部分不属于冯•诺依曼体系中的五大部分的任意一个部分;显然内存中数据断电后会消失。 3、关于BIOS下面说法哪个是正确的: BIOS是计算机基本输入输出系统软件的简称。 BIOS里包含了键盘、鼠标、声卡、显卡、打印机等常用输入输出设备的驱动程序。 BIOS一般由操作系统厂商来开发完成。 BIOS能供提各种文件拷贝、复制、删除以及目录维护等文件管理功能。 考察知识点:BIOS 它的英文就是:Basic Input Output System 的缩略语,中文意思就是基本输入输出系统。BIOS只存一些系统启动的基本信息,这些设备的驱动程式不存在的,设备的驱动程序一般由设备生产商提供。如显卡驱动由显卡生产商提供。BIOS一般由单独的芯片长假生产。 4、关于CPU下面哪个说法是正确的: CPU全称为中央处理器(或中央处理单元)。 CPU可以直接运行汇编语言。 同样主频下,32位的CPU比16位的CPU运行速度快一倍。 CPU最早是由Intel公司发明的。 5、关于ASCII,下面哪个说法是正确的: ASCII码就是键盘上所有键的唯一编码。 一个ASCII码使用一个字节的内存空间就能够存放。 最新扩展的ASCII编码方案包含了汉字和其他欧洲语言的编码。 ASCII码是英国人主持制定并推广使用的。 6、下列软件中不是计算机操作系统的是: A) Windows B) Linux C) OS/2 D) WPS 7、关于互联网,下面的说法哪一个是正确的: 新一代互联网使用的IPv6标准是IPv5标准的升级与补充。 互联网的入网主机如果有了域名就不再需要IP地址。 互联网的基础协议为TCP/IP协议。 互联网上所有可下载的软件及数据资源都是可以合法免费使用的。 8、关于HTML下面哪种说法是正确的://计算机网络语言 jsp 脚本等 HTML实现了文本、图形、声音乃至视频信息的统一编码。 HTML全称为超文本标记语言。 网上广泛使用的 Flash动画都是由HTML编写的。 HTML也是一种高级程序设计语言。 9、关于程序设计语言,下面哪个说法是正确的: 加了注释的程序一般会比同样的没有加注释的程序运行速度慢。 高级语言开发的程序不能使用在低层次的硬件系统(如:自控机床)或低端手机上。 高级语言相对于低级语言更容易实现跨平台的移植。 以上说法都不对。 10、已知大写字母A的ASCII编码为65(十进制),则大写字母J的十进制ASCII编码为: 71 B) 72 C) 73 D) 以上都不是 11、十进制小数125.125对应的八进制数是 A) 100.1 B) 175.175 C) 175.1 D) 100.175 12、有六个元素FEDCBA 从左至右依次顺序进栈,在进栈过程中会有元素被弹出栈。问下列哪一个不可能是合法的出栈序列? EDCFAB B) DECABF C) CDFEBA D) BCDAEF 13、 表达式a*(b+c)-d的后缀表达式是: abcd*+- B) abc+*d- C) abc*+d- D) -+*abcd 14、一个包含n个分支结点(非叶结点)的非空二叉树,它的叶结点数目最多为: A) 2n + 1 B) 2n-1 C) n-1 D) n+1 15、快速排序最坏情况下的算法复杂度为: A) O(log2n) B) O(n) C) O(nlog2n) D) O(n2) 16. 有一个由4000个整数构成的顺序表,假定表中的元素已经按升序排列,采用二分查找定位一个元素。则最多需要几次比较就能确定是否存在所查找的元素: A) 11次 B) 12次 C) 13次 D) 14次 17、排序算法是稳定的意思是关键码相同的记录排序前后相对位置不发生改变,下列哪种排序算法是不稳定的: A) 冒泡排序 B) 插入排序 C) 归并排序 D) 快速排序 18、已知n个顶点的有向图,若该图是强连通的(从所有顶点都存在路径到达其他顶点),则该图中最少有多少条有向边? A) n B) n+1 C) n-1 D) n*(n-1) 19、全国信息学奥林匹克的官方网站为参与信息学竞赛的老师同学们提供相关的信息和资源,请问全国信息学奥林匹克官方网站的网址是: A) http://www.noi.com/ B) http://www.noi.org/ C) http://www.noi.cn/ D) http://www.xinxixue.com/ 20、在参加NOI系列竞赛过程中,下面哪一种行为是 不 被严格禁止的: 携带书写工具,手表和不具有通讯功能的电子词典进入赛场。 在联机测试中通过手工计算出可能的答案并在程序里直接输出答案来获取分数。 通过互联网搜索取得解题思路。 在提交的程序中启动多个进程以提高程序的执行效率。 第十六届全国青少年信息学奥林匹克联赛初赛试题 一、 单项选择题 (共20题,每题1.5分,共计30分。每题有且仅有一个正确答案.)。 1.2E+03表示( )。 A. 2.03 B. 5 C. 8 D. 2000 2. 一个字节(Byte)由( )个二进制位组成。 A. 8 B. 16 C. 32 D.以上都有可能 解答:常识题,一个字节由8位组成。 3. 以下逻辑表达式的值恒为真的是( )。 A. P∨( P∧Q)∨( P∧ Q) B. Q∨( P∧Q) ∨(P ∧Q) C. P∨Q∨(P∧ Q)∨( P∧Q) D. P∨ Q∨(P∧ Q) ∨( P∧ Q) 解答:为使逻辑表达式恒为真,则∨前的P或Q一定要为False去判断是否为真,因为∨前的P或Q为True的话,整个表达式就位真,所以我们∨前的P或Q一定要为False带入表达式判断,这样A选项为True B选项为False C选项为False D选项为False 4.LINUX下可执行文件的默认扩展名为( ) A. .exe B. .com C. .dll D. 以上都不是 解答:exe 和 com 可执行文件 dll是动态数据库文件扩展名 5.如果树根算是第一层,那么一棵n层的二叉树最多有( )个结点。 A. 2N-1 B. 2N C. 2N+1 D. 2N-1 解答:常识题,二叉树性质 6. 提出”存储程序”的计算机工作原理的是( ) A. 克劳德.香农 B. 戈登.摩尔 C. 查尔斯.巴比奇 D. 冯.诺依曼 7.设X、Y、Z分别代表三进制下的一位数字,若等式XY+ZX=XYX在三进制下成立,那么同样在三进制下,等式XY×ZX=( )。 A. YZX B. ZXY C. XYZ D. XZY 解答:XY+ZX=XYX这个等式在3进制下成立,我们不妨把它转成10进制,3X+Y+3Z+X=9X +3Y+X,即3Z=6X+2Y,由于X、Y、Z分别代表0、1、2枚举后得出X=1,Y=0,Z=2,这样带入XY×ZX=(10)3×(21)3=(21)10=(210)3=(ZXY) 8. Pascal语言、C语言和C++语言都属于( )。 A.面向对象语言 B. 脚本语言 C. 解释性语言 D. 编译性语言 9. 前缀表达式“+ 3 * 2 +5 12 ”( )。 A. 23 B. 25 C. 37 D. 65 解答:运算符只能作为父节点,而数字是叶子节点。中缀表达式 见右图,3+2*(5+12)=37 10.主存储器的存储速度比中央处理器(CPU)的工作速度慢的多,从而使得后者的效率受到影响。而根据局部性原理,CPU所访问的存储单元通常都趋于聚集在一个较小的连续区域中。于是,为了提高系统整体的执行效率,在CPU中引入了( ) A. 寄存器 B. 高速缓存 C. 闪存 D. 外存 11.一个字长为8位的整数的补码是11111001,则它的原码是( ) A. 00000111 B. 01111001 C. 11111001 D. 10000111 解答:正数的补码与原码相同。负数的补码是符号位(第一位)为1,其余位数为该数绝对值的原码按位取反后整个数加1.11111001的首位为1,作为符号为代表该数为负数,所以保留该位,1111001减1然后取反,再加上符号为就是10000111. 12. 基于比较的排序时间复杂度的下限是( ),其中n是待排的元素个数。 A. O(n) B. O(nlogn) C. O(logn) D. O(n2) 13. 一个自然数在十进制下有n位,则它在二进制下的位数与( )最接近。 A. 5n B. nlog210 C. 1×log2n D. 10nlog2n 14.在下列HTML语句中,可以正确产生一个指向NOI官方网站的超级链接是( ) A. <a url=”http://www.noi.cn” 欢迎访问NOI网站</a> B. <a href=”http://www.noi.cn”>欢迎访问NOI网站</a> C. <a>url=”http://www.noi.cn” </a> D. <a name=”http://www.noi.cn”>欢迎访问NOI网站</a> 15.元素R1、R2、R3、R4、R5入栈的顺序为R1、R2、R3、R4、R5。如果第一个出栈的是R3,那么第5个出栈的不可能是( )。 A. R1 B. R2 C. R4 D. R5 解答:R1在R2之下,肯定晚于R2之后出栈 16.双向链表中,有两个指针域llink和rlink,分别指向该节点的前驱及后继。设p指向链表中的一个节点,它的左右节点均非空。现要求删除节点p,则下面语句序列中错误的是( )。 A. p^.rlink^.llink=p^.rlink; P^.llink^.rlink=p^.llink;dispose(p); B. P^.llink^.rlink= p^.rlink; p^.rlink^.llink=p^.llink; dispose(p); C. p^.rlink^.llink=p^.llink; p^.rlink^.llink^.rlink=p^.rlink; dispose(p); D. P^.llink^.rlink= p^.rlink; p^.llink^.rlink^.llink=p^.llink; dispose(p); 解答:A中将p的后继的前驱指向P的 后继,p的前驱的后继指向p的前驱,这样链表就断了。 17. 一棵二叉树的前序遍历序列是ABCDEFG,后序遍历序列是CBFEGDA,则根节点的左子树的节点个数可能是( )。 A. 2 B. 3 C. 4 D. 5 18. 关于拓扑排序,下面说法正确的是( )。 A. 所有连通的有向图都可以实现拓扑排序 B. 对一个图而言,拓扑排序的结果是唯一的 C. 拓扑排序中入度为0的节点总会排在入度大于0的节点的前面 D. 拓扑排序结果序列中的第一个节点一定是入度为0的点 解答:A中,当图中有环,必然无法拓扑排序;B中,同一时刻,入度为0的点不唯一,拓扑排序也就不唯一;C中,如下图 1-3-2也是正确排序,但3却在2之前 1 3 2 19. 完全二叉树的顺序存储方案,是指将完全二叉树的节点从上至下,从左至右依次存放到一个顺序结构的数组中。假定根节点存放子数组的1号位置,则第k号节点的父节点如果存在的话,应当存放在数组的( )号位置。 A. 2k B. 2k+1 C. k/2下取整 D. (k+1)/2下取整 20.全国青少年信息学奥林匹克系列活动的主办单位是( ) A.教育部 B. 科技部 C. 共青团中央 D. 中国计算机协会 第十七届全国青少年信息学奥林匹克联赛初试题 (普及组 Pascal语言 两小时完成) ●●全部试题答案均要求写在答卷纸上,写在试卷纸上一律无效●● 一、单项选择题(共20题,每题1.5分,共计30分,每题有且仅有一个正确选项。) 1.在二进制下,1010100+( )=1100001 A.1011 B.1101 C.1010 D.1111 解:做竖式减法即可: 1100001 —1010100 1101 2.字符“0”的ASCII码为48,则字符“9”的ASCII码为( )。 A.39 B.57 C.120 D.视具体的计算机而定 解:‘0’的ASCII码加9就是‘9’的ASCII码 3.一片容量为8GB的SD卡能存储大约( )张大小为2MB的数码照片 A.1600 B.2000 C.4000 D.16000 解:8*1024MB÷2MB=4*1024约等于4000 4.摩尔定律(Moore's Law)是由英特尔创始人之一戈登•摩尔(Gordon Moore)提出来的。根据摩尔定律,在过去几十年以及在可预测的未来几年,单块集成电路的集成度大约每( )个月翻一番 A.1 B.6 C.18 D.36 5.无向完全图是图中每对顶点之间都恰好有一条边的简单图,已知无向完全图G有7个顶点,则它共有( )条边 A.7 B.21 C.42 D.49 解:无向完全图的边数=n*(n-1)/2 =7*(7-1)/2 =21 6.寄存器是( )的重要组成部分 A.硬盘 B.高速缓存 C.内存 D.CPU 7.如果根结点的深度记为1,则一棵有2011个叶结点的二叉树的深度最少是( ) A.10 B.11 C.12 D.13 解: 二叉树每层最多的节点数=2i-1 2011<2i-1 解i的最小值是12 8.体育课的铃声响了,同学们都陆续奔向操场,按老师的要求从高到矮排成一排。每个同学按顺序来到操场时,都从排尾走向排头,找到第一个比自己高的同学,并站在他的后面。这种站队的方法类似于( )算法。 A.快速排序 B.插入排序 C.冒泡排序 D.归并排序 9.一个正整数在二进制下有100位,则它在十六进制下有( )位。 A.7 B.13 C.25 D.不能确定 解:二进制转十六进制,四位转一位 所以100÷4=25 10.有人认为,在个人电脑送修前,将文件放入回收站中就是已经将其删除了。这种想法( ) A.正确,将文件放入回收站意味着彻底删除,无法恢复 B.不正确,只有将回收站清空以后才意味着彻底删除无法恢复 C.不正确,即使将回收站清空,文件只是被标记为删除,仍然可能通过恢复软件找回 D.不正确,只要在硬盘上出现过的文件,永远不可能被彻底删除 11.广度优先搜索时,需要用到的数据结构是( ) A.链表 B.队列 C.栈 D.散列表 12.在使用高级语言编写程序时,一般提到的“空间复杂度”中的“空间”是指( )。 A.程序运行时理论上所占的内存空间 B.程序运行时理论上所占的数组空间 C.程序运行时理论上所占的硬盘空间 D.程序源文件理论上所占的硬盘空间 13.在含有N个元素的双向链表中查询是否存在关键字为K的元素,最坏情况下运行时间复杂度为( ) A.O(1) B.O(log n) C.O(n) D.O(n log n) 14.生物特征识别,是利用人体本身的生物特征进行身份认证的一种技术。目前,指纹识别、虹膜识别、人脸识别等技术已广泛应用于政府、银行、安全防卫等领域。以下不属于生物特征识别技术及其应用的是( ) A.指静脉验证 B.步态验证 C.ATM机密码验证 D.声音验证 15.现有一段文言文,要通过二进制哈弗曼编码进行压缩,简单起见,这段文言文只由4个汉字“之”、“乎”、“者”、“也”组成,它们出现的次数分别为 700、600、300、200。那么“也”的编码长度是( )。 A.1 B.2 C.3 D.4 解;哈夫曼编码就是将字符或字符串中按照出现的频率从高到低排列, 如右图。之的编码是0 乎的编码是10 者的编码是110 也的编码是111 所以长度是3 16.关于汇编语言,下列说法错误的是( ) A.是一种与具体硬件相关的程序设计语言 B.在编写复杂程序时,相对于高级语言而言代码量较大,且不易调试 C.可以直接访问寄存器、内存单元以及IO端口 D.随着高级语言的诞生,如今已完全被淘汰,不再使用 17.( )是一种选优搜索法,按选优条件向前搜索,以达到目标。当搜索到某一步时,发现原先选择的并不优或达不到目标,就退回一步重新选择。 A.回溯 B.枚举法 C.动态规划 D.贪心法 18.1956年( )授予肖克利(William Shockley)、巴丁(John Bardeen)和布拉顿(Walter Brattain),以表彰他们对半导体的研究和晶体管效应的发现 A.诺贝尔物理学奖 B.约翰•冯•诺依曼奖 C.图灵奖 D.高德纳奖(Donald E.Knuth Prize) 19.对一个有向图而言,如果每个节点都存在到达其他节点的路径,那么就称它是强连通的。例如,右图就是强连通图,事实上,在去掉边( )后依然是强连通的 A. a B. b C. c D. d 20.从ENIAC到当前最先进的计算机,冯•诺依曼体系结构始终占有重要地位。冯•诺依曼体系结构的核心内容是( ) A.采用开关电路 B.采用半导体器件 C.采用存储程序和程序控制原理 D.采用键盘输入 第十八届全国青少年信息学奥林匹克联赛初赛 一、单项选择题(共20题,每题1.5分,共计30分;每题且仅有一个正确选项) 1. 计算机如果缺少( ),将无法正常启动。 A. 内存 B. 鼠标 C. U盘 D. 摄像头 2. ( )是一种先进先出的线性表。 A. 栈 B. 队列 C. 哈希表(散列表) D. 二叉树 3. 目前计算机芯片(集成电路)制造的主要原料是( ),它是一种可以在沙子中提炼出的物质。 A. 硅 B. 铜 C. 锗 D. 铝 4. 十六进制数9A在( )进制下是232. A. 四 B. 八 C. 十 D. 十二 解 先将9A转成十进制 9A=9*16+10=154 在十进制的情况下154<232,要让他们相等,232的进制必定小于十进制,排除了C和D选项,再将B和A选项代入计算得结果! 5.( )不属于操作系统。 A. Windows B. DOS C. Photoshop D. NOI Linux 6. 如果一棵二叉树的中序遍历是BAC,那么它的先序遍历不可能是( )。 A. ABC B. CBA C. ACB D. BAC 7. 目前个人电脑的( )市场占有率最靠前的厂商包括Intel、AMD等公司。 A. 显示器 B. CPU C. 内存 D. 鼠标 8. 使用冒泡排序对序列进行升序排列,每执行一次交换操作系统将会减少1个逆序对,因此序列 5,4,3,2,1 需要执行( )次操作,才能完成冒泡排序。 A. 0 B. 5 C. 10 D. 15 解:从降序排序为升序,第一趟交换要4次,第二趟要3次,第三趟要2次,第四趟要1次。共10次。 9. 1946年诞生于美国宾夕法尼亚大学的ENIAC属于( )计算机。 A. 电子管 B. 晶体管 C. 集成电路 D. 超大规模集成电路 10. 无论是TCP/IP模型还是OSI模型,都可以视为网络的分层模型,每个网络协议都会被归入某一层中。如果用现实生活中的例子来比喻这些“层”,以下最恰当的是( )。 A. 中国公司的经理与波兰公司的经理交互商业文件 B. 军队发布命令 C. 国际会议中,每个人都与他国地位对等的人直接进行会谈 D. 体育比赛中,每一级比赛的优胜者晋级上一级比赛 11.矢量图(Vector Image)图形文件所占的贮存空间比较小,并且无论如何放大、缩小或旋转等都不会失真,是因为它( )。 A. 记录了大量像素块的色彩值来表示图像 B. 用点、直线或者多边形等基于数学方程的几何图元来表示图像 C. 每个像素点的颜色信息均用矢量表示 D. 把文件保存在互联网,采用在线浏览的方式查看图像 12. 如果一个栈初始时为空,且当前栈中的元素从栈底到栈顶依次为a,b,c,另有元素d已经出栈,则可能的入栈顺序是( )。 A. a, d, c, b B. b, a, c, d C. a, c, b, d D. d, a, b, c 13. ( )是主要用于显示网页服务器或者文件系统的HTML文件的内容,并让用户与这些文件交互的一种软件。 A. 资源管理器 B. 浏览器 C. 电子邮件 D. 编译器 14. ( )是目前互联网上常用的E-mail服务协议。 A. HTTP B. FTP C. POP3 D. Telnet 解 HTTP 是超文本传输协议 FTP是文件传输协议 Telnet 远程登录 15. ( )就是把一个复杂的问题分成两个或更多的相同类似的子问题,再把子问题分解成更小的子问题……直到最后的子问题可以简单地直接求解。而原问题的解就是子问题解的并。 A. 动态规划 B. 贪心 C. 分治 D. 搜索 16. 地址总线的位数决定了CPU可直接寻址的内存空间大小,例如地址总线为16位,其最大的可寻址空间为64KB。如果地址总线是32位,则理论上最大可寻址的内存空间为( )。 A. 128KB B. 1MB C. 1GB D. 4GB 解 232=210*210*210*22=1024*1024*1024*4B=4GB 17. 蓝牙和Wi-Fi都是( )设备。 A. 无线广域网 B. 无线城域网 C. 无线局域网 D. 无线路由器 18. 在程序运行过程中,如果递归调用的层数过多,会因为( )引发错误。 A. 系统分配的栈空间溢出 B. 系统分配的堆空间溢出 C. 系统分配的队列空间溢出 D. 系统分配的链表空间溢出 19. 原字符串中任意一段连续的字符所组成的新字符串称为子串。则字符“AAABBBCCC”共有( )个不同的非空子串。 A. 3 B. 12 C. 36 D. 45 20. 仿生学的问世开辟了独特的科学技术发展道路。人们研究生物体的结构、功能和工作原理,并将这些原理移植于新兴的工程技术中。以下关于仿生学的叙述,错误的是( ) A. 由研究蝙蝠,发明雷达 B. 由研究蜘蛛网,发明因特网 C. 由研究海豚,发明声纳 D. 由研究电鱼,发明伏特电池 2013年第十九届全国青少年信息学奥林匹克联赛初赛 一、单项选择题(共 20 题,每题 1.5 分,共计 30 分;每题有且仅有一个正确选项) 1.一个 32 位整型变量占用( )个字节。 A. 4 B. 8 C. 32 D. 128 2.二进制数 11.01 在十进制下是( )。 A. 3.25 B. 4.125 C. 6.25 D. 11.125 3.下面的故事与( )算法有着异曲同工之妙。 从前有座山,山里有座庙,庙里有个老和尚在给小和尚讲故事:“从前有座山,山里有座庙,庙里有个老和尚在给小和尚讲故事:’从前有座山,山里有座庙,庙里有个老和尚给小和尚讲故事........................’” A. 枚举 B. 递归 C. 贪心 D. 分治 4.逻辑表达式( )的值与变量 A 的真假无关。 A. (A ∨ B) ∧ ¬A B. (A ∨ B) ∧ ¬B C. (A ∧ B) ∨ (¬A ∧ B) D. (A ∨ B) ∧ ¬A ∧ B 5.将(2, 6, 10, 17)分别存储到某个地址区间为 0~10 的哈希表中,如果哈希函数h(x) =( ),将不会产生冲突,其中 a mod b 表示 a 除以 b 的余数。 A. x mod 11 B. x2 mod 11 C. 2x mod 11 D. [√X ] mod 11,其中[√X ]表示√X 下取整 6.在十六进制表示法中,字母 A 相当于十进制中的( )。 A. 9 B. 10 C. 15 D. 16 7.下图中所使用的数据结构是( B )。 8.在 Windows 资源管理器中,用鼠标右键单击一个文件时,会出现一个名为“复制”的操作选项,它的意思是( ) 。 A. 用剪切板中的文件替换该文件 B. 在该文件所在文件夹中,将该文件克隆一份 C. 将该文件复制到剪切板,并保留原文件 D. 将该文件复制到剪切板,并删除原文件 9.已知一棵二叉树有 10 个节点,则其中至多有( )个节点有 2 个子节点。 A. 4 B. 5 C. 6 D. 7 10.在一个无向图中,如果任意两点之间都存在路径相连,则称其为连通图。右图是一个有4 个顶点、6 条边的连通图。若要使它不再是连通图,至少要删去其中的( )条边。 A. 1 B. 2 C. 3 D. 4 11.二叉树的( )第一个访问的节点是根节点。 A. 先序遍历 B. 中序遍历 C. 后序遍历 D. 以上都是 12.以 A0 作为起点,对下面的无向图进行深度优先遍历时,遍历顺序不可能是( )。 A. A0, A1, A2, A3 B. A0, A1, A3, A2 C. A0, A2, A1, A3 D. A0, A3, A1, A2 13.IPv4 协议使用 32 位地址,随着其不断被分配,地址资源日趋枯竭。因此,它正逐渐被使用( )位地址的 IPv6 协议所取代。 A. 40 B. 48 C. 64 D. 128 14.( )的平均时间复杂度为 O(n log n),其中 n 是待排序的元素个数。 A. 快速排序 B. 插入排序 C. 冒泡排序 D. 基数排序 15.下面是根据欧几里得算法编写的函数,它所计算的是 a 和 b 的( )。 function euclid(a, b : longint) : longint; Begin if b = 0 then euclid := a else euclid := euclid(b, a mod b); end; A.最大公共质因子 B.最小公共质因子 C.最大公约数 D.最小公倍数 16.通常在搜索引擎中,对某个关键词加上双引号表示( )。 A. 排除关键词,不显示任何包含该关键词的结果 C. 精确搜索,只显示包含整个关键词的结果 B. 将关键词分解,在搜索结果中必须包含其中的一部分 D.站内搜索,只显示关键词所指向网站的内容 17.中国的国家顶级域名是( )。 A. .cn B. .ch C. .chn D. .china 18.把 64 位非零浮点数强制转换成 32 位浮点数后,不可能( )。 A. 大于原数 B. 小于原数 C. 等于原数 D. 与原数符号相反 19.下列程序中,正确计算 1, 2, „, 100 这 100 个自然数之和 sum (初始值为 0) 的是( A)。 20.CCF NOIP 复赛全国统一评测时使用的系统软件是( )。 A. NOI Windows B. NOI Linux C. NOI Mac OS D. NOI DOS 第二十届全国青少年信息学奥林匹克联赛初赛 普及组Pascal语言试题 竞赛时间:2014年10月12日14:30-16:30 一、单项选择题(共20题,每题1.5分,共计30分;每题有且仅有一个正确选项) 1. 以下哪个是面向对象的高级语言( )。 A.汇编语言 B. C++ C. Fortran D. Basic 2. 1TB代表的字节数量是( )。 A. 2的10次方 B. 2的20次方 C. 2的30次方 D. 2的40次方 3. 二进制数00100100和00010101的和是( )。 A. 00101000 B. 001010100 C. 01000101 D. 00111001 4. 以下哪一种设备属于输出设备( )。 A. 扫描仪 B.键盘 C.鼠标 D.打印机 5. 下列对操作系统功能的描述最为完整的是( )。 A负责外设与主机之间的信息交换 B.负责诊断机器的故障 C.控制和管理计算机系统的各种硬件和软件资源的使用 D.将源程序编译成目标程序 6. CPU、存储器、I/O设备是通过( )连接起来的。 A.接口 B.总线 C.控制线 D.系统文件 7. 断电后会丢失数据的存储器是( )。 A. RAM B. ROM C. 硬盘 D. 光盘 8. 以下哪一种是属于电子邮件收发的协议( ). A. SMTP B. UDP C. P2P D. FTP 9. 下列选项中不属于图像格式的是( )。 A. JPEG格式 B. TXT格式 C. GIF格式 D. PNG格式 10. 链表不具有的特点是( )。 A. 不必事先估计存储空间 B. 可随机访问任一元素 C. 插入删除不需要移动元素 D. 所储空间与线性表长度成正比 11. 下列各无符号十进制整数中,能用八位二进制表示的数中最大的是( )。 A. 296 B. 133 C. 256 D. 199 12. 下列几个32位IP地址中,书写错误的是( )。 A. 162.105.142.27 B. 192.168.0.1 C. 256.256.129.1 D. 10.0.0.1 13. 要求以下程序的功能是计算: s=1+1/2+1/3+...+1/10。 var n: integer; s:real; begin s:=1.0; for n:=10 downto 2 do s:=s+1 div n; writeln(s:6:4); end. 程序运行后输出结果错误,导致错误结果的程序行是( )。 A. s:=1.0; B. for n:=10 downto 2 do C. s:=s+1 div n; D. writeln(s:6:4); 14. 设变量x为real型且己赋值,则以下语句中能将x中的数值保留到小数点后两位,并将第三位四舍五入的是( ). A. x:=(x*100)+0.5/100.0; B. x:=(x*100+0.5)/100.0; C. x:=trunc(x*100+0.5)/100.0; D. x:= (x/100+0.5)*100.0; 15. 有以下程序: var s,a,n: integer; begin s:=0; a:=1; readln(n); repeat s:=s+1; a:=a-2; until a=n; writeln(s); end. 若要使程序的输出值为2,则应该从键盘给n输入的值是( )。 A. -1 B. -3 C. -5 D. 0 16. 一棵具有5层的满二叉树中结点数为( )。 A. 31 B. 32 C. 33 D. 16 17. 有向图中每个顶点的度等于该顶点的( )。 A. 入度 B. 出度 C. 入度与出度之和 D. 入度与出度之差 18. 设有100个数据元素,采用折半搜索时,最大比较次数为( )。 A. 6 B. 7 C. 8 D. 10 19. 若有如下程序段, 其中s、a、b、c均己定义为整型变量.且a、 c均已赋值,c>0。 s:=a; for b:=1 to c do s:=s+1; 则与上述程序段功能等价的斌值语句是( )。 A. s:=a+b B. s:=a+c C. s:=s+c D. s:=b+c 20. 计算机界的最高奖是( )。 A.菲尔兹奖 B.诺贝尔奖 C.图灵奖 D.普利策奖 第二十一届全国青少年信息学奥林匹克联赛初赛 普及组 Pascal语言试题 竞赛时间:2015年 10月 11日 14:30~16:30 一、单项选择题(共20题 ,每题1.5分 ,共计30分 ;每题有且仅有一个正确选项 ) 1.1MB等于( )。 A.1000字节 B,1024字节C. 1000X1000字节 D. 1024X1024字节 2. 在 PC机 中 ,PENTIUM(奔腾 )、 酷睿、赛扬等是指( )。 A.生产厂家名称 B. 硬盘的型号 C. CPU的 型号 D. 显示器的型号 3.操作系统的作用是 ( )。 A.把源程序译成 目标程序 B.便于进行数据管理 C.控制和管理系统资源 D.实现硬件之间的连接 4.在计算机内部用来传送、存贮、加工处理的数据或指令都是以 ( )形式进行的。 A.二进制码 B.八进制码 C.十进制码 D.智能拼音码 5.下列说法正确的是 ( )。 A.CPU的主要任务是执行数据运算和程序控制 B.存储器具有记忆能力 ,其中信息任何时候都不会丢失 C.两个显示器屏幕尺寸相同 ,则 它们的分辨率必定相同 D.个人用户只能使用 WIFI的方式连接到 lnternet 6.二进制数00100100和00010100的和是( )。 A.00101000 B.01110011 C.01000100 D.00111000 7.与二进制小数 0.1相等的十六进制数是 ( )。 A. 0.8 B. 0.4 C. 0.2 D.0.1 8.所谓的“中断”是指( )。 A.操作系统随意停止一 个程序的运行 B.当出现需要时 ,CPU暂时停止当前程序的执行转而执行处理新情况的过程 C.因停机而停止一 个程序的运行 D.电脑死机 9.计算机病毒是 ( )。 A.通过计算机传播的危害人体健康的一种病毒 B.人为制造的能够侵入计算机系统并给计算机带来故障的程序或指令集合 C.一种由于计算机元器件老化而产生的对生态环境有害的物质 D.利用计算机的海量高速运算能力而研制出来的用于疾病预防的新型病毒 10.FTP可以用于 ( )。 A.远程传输文件 B.发送电子邮件 C.浏览网页 D.网上聊天 11.下面哪种软件不属于即时通信软件( )。 A.QQ B.MSN C.微信 D.P2P 12.6个顶点的连通图的最小生成树 ,其边数为 ( )。 A. 6 B. 5 C. 7 D. 4 13.链表不具备的特点是 ( )。 A.可随机访问任何一个元素 B.插入、删除操作不需要移动元素 C.无需事先估计存储空间大小 D.所需存储空间与存储元素个数成正比 14.线性表若采用链表存储结构 ,要求内存中可用存储单元地址 ( )。 A.必须连续 B.部分地址必须连续 C.一 定不连续 D.连续不连续均可 15.今有一空栈S,对下列待进栈的数据元素序列a,b,c,d,e,f依次进行进栈 ,进栈,出栈 ,进栈 ,进栈 ,出栈的操作 ,则此操作完成后 ,栈S的栈顶元素为( )。 A. f B. c C. a D. b 16.前序遍历序列与中序遍历序列相同的 二 叉树为 ( )。 A.根结点无左子树的二叉树 B.根结点无右子树的二叉树 C.只有根结点的二叉树或非叶子结点只有左子树的二叉树 D.只有根结点的二叉树或非叶子结点只有右子树的二叉树 17.如果根的高度为1,具有61个结点的完全二叉树的高度为 ( )。 A. 5 B. 6 C. 7 D. 8 18.下列选项中不属于视频文件格式的是( )。 A. TXT B. AVl C. MOV D. RMVB 19.设某算法的计算时间表示为递推关系式T(n)=T(n-1)+n(n为正整数 )及T(0)=1,则该算法的时间复杂度为( )。 A.O(logn) B. O(nIogn) C.O(n) D.O(n2) 20.在NOI系列赛事中参赛选手必须使用由承办单位统一提供的设备。下列物品中不允许选 手自带的是( )。 A.鼠标 B.笔 C.身份证 D.准考证 第二十二届全国青少年信息学奥林匹克联赛初赛 一、单项选择题(共 20 题,每题 1.5 分,共计 30 分;每题有且仅有一个正确选项) 以下不是微软公司出品的软件是( )。 A. Powerpoint B. Word C. Excel D. Acrobat Reader 2. 如果 256 种颜色用二进制编码来表示,至少需要( )位。 A. 6 B. 7 C. 8 D. 9 以下不属于无线通信技术的是( )。 A. 蓝牙 B. WiFi C. GPRS D. 以太网 4. 以下不是 CPU 生产厂商的是( )。 A. Intel B. AMD C. Microsoft D. IBM 5. 以下不是存储设备的是( )。 A. 光盘 B. 磁盘 C. 固态硬盘 D. 鼠标 如果开始时计算机处于小写输入状态,现在有一只小老鼠反复按照 CapsLock、 字母键 A、字母键 S 和字母键 D 的顺序循环按键,即 CapsLock、A、S、D、 CapsLock、A、S、D、……,屏幕上输出的第 81 个字符是字母( )。 A. A B. S C. D D. a 7. 二进制数 00101100 和 00010101 的和是( )。 A. 00101000 B. 01000001 C. 01000100 D. 00111000 8. 与二进制小数 0.1 相等的八进制数是( )。 A. 0.8 B. 0.4 C. 0.2 D. 0.1 9. 以下是 32 位机器和 64 位机器的区别的是( )。 A. 显示器不同 B. 硬盘大小不同 C. 寻址空间不同 D. 输入法不同 10. 以下关于字符串的判定语句中正确的是( )。 A. 字符串是一种特殊的线性表 B. 串的长度必须大于零 C. 字符串不可以用数组来表示 D. 空格字符组成的串就是空串 一棵二叉树如右图所示,若采用顺序存储结构,即用一维数组元素存储该二叉树中的结点(根结点的下标为 1, 若某结点的下标为 i ,则其左孩子位于下标 2i 处、右孩子位于下标(2i+1)处),则图中所有结点的最大下标为( )。 A. 6 B. 10 C. 12 D. 15 若有如下程序段,其中 s、a、b、c 均已定义为整型变量,且 a、c 均已赋值(c 大于 0)。 s := a; for b := 1 to c do s := s + 1; 则与上述程序段修改 s 值的功能等价的赋值语句是( )。 s := a + b; B. s := a + c; C. s := s + c; D. s := b + c; 有以下程序: var k, n: longint; begin k := 4; n := 0; while n < k do begin inc(n); if n mod 3 <> 0 then continue; dec(k); end; writeln(k, ',', n); end. 程序运行后的输出结果是( )。 A. 2,2 B. 2,3 C. 3,2 D. 3,3 给定含有 n 个不同的数的数组 L=<x1, x2, ..., xn>。如果 L 中存在 x(i1 < i < n)使得 x1 < x2 < ... < xi-1 < xi > xi+1 > ... > xn, 则称 L 是单峰的,并称 xi 是 L 的 “峰顶”。现在已知 L 是单峰的,请把 a-c 三行代码补全到算法中使得算法正确找到 L 的峰顶。 a. Search(k+1, n) Search(1, k-1) return L[k] Search(1, n) k←⌊n/2⌋ if L[k] > L[k-1] and L[k] > L[k+1] then __________ else if L[k] > L[k-1] and L[k] < L[k+1] then __________ else __________ 正确的填空顺序是( )。 A. c, a, b B. c, b, a C. a, b, c D. b, a, c 15. 设简单无向图 G 有 16 条边且每个顶点的度数都是 2,则图 G 有( )个顶 点。 A. 10 B. 12 C. 8 D. 16 16. 有 7 个一模一样的苹果,放到 3 个一样的盘子中,一共有( )种放法。 A. 7 B. 8 C. 21 D. 37 下图表示一个果园灌溉系统,有 A、B、C、D 四个阀门,每个阀门可以打开或关上,所有管道粗细相同,以下设置阀门的方法中,可以让果树浇上水的是( )。 有水 有水 果树 A. B 打开,其他都关上 C. A 打开,其他都关上 B. AB 都打开,CD 都关上 D. D 打开,其他都关上 CCF NOIP2016 初赛普及组 Pascal 语言试题 第 3 页,共 10 页 Lucia 和她的朋友以及朋友的朋友都在某社交网站上注册了账号。下图是他们之间的关系图,两个人之间有边相连代表这两个人是朋友,没有边相连代表不是朋友。这个社交网站的规则是:如果某人 A 向他(她)的朋友 B 分享了某张照片,那么 B 就可以对该照片进行评论;如果 B 评论了该照片,那么他(她)的所有朋友都可以看见这个评论以及被评论的照片,但是不能对该照片进行评论(除非 A 也向他(她)分享了该照片)。现在 Lucia 已经上传了一张照片,但是她不想让 Jacob 看见这张照片,那么她可以向以下朋友( )分享该照片。 A. Dana, Michael, Eve B. Dana, Eve, Monica C. Michael, Eve, Jacob D. Micheal, Peter, Monica 周末小明和爸爸妈妈三个人一起想动手做三道菜。小明负责洗菜、爸爸负责切菜、妈妈负责炒菜。假设做每道菜的顺序都是:先洗菜 10 分钟,然后切菜 10 分钟,最后炒菜 10 分钟。那么做一道菜需要 30 分钟。注意:两道不同的菜的相同步骤不可以同时进行。例如第一道菜和第二道的菜不能同时洗, 也不能同时切。那么做完三道菜的最短时间需要( )分钟。 A. 90 B. 60 C. 50 D. 40 20. 参加 NOI 比赛,以下不能带入考场的是( )。 A. 钢笔 B. 适量的衣服 C. U 盘 D. 铅笔 第二十二届全国青少年信息学奥林匹克联赛初赛 一、单项选择题(共 20 题,每题 1.5 分,共计 30 分;每题有且仅有一个正确选项) 1.在 8 位二进制补码中,10101011 表示的数是十进制下的( )。 A. 43 B. -85 C. -43 D. -84 2.计算机存储数据的基本单位是( )。 A. bit B. Byte C. GB D. KB 3.下列协议中与电子邮件无关的是( )。 A. POP3 B. SMTP C. WTO D. IMAP 4.分辨率为 800x600、16 位色的位图,存储图像信息所需的空间为( )。 A.937.5KB B. 4218.75KB C.4320KB D. 2880KB 5.计算机应用的最早领域是( )。 A. 数值计算 B. 人工智能 C. 机器人 D. 过程控制 6.下列不属于面向对象程序设计语言的是( )。 A. C B. C++ C. Java D. C# 7.NOI 的中文意思是( )。 A. 中国信息学联赛 B. 全国青少年信息学奥林匹克竞赛 C. 中国青少年信息学奥林匹克竞赛 D. 中国计算机协会 8. 2017年10月1日是星期日,1999年10月1日是( )。 A. 星期三 B. 星期日 C. 星期五 D. 星期二 9.甲、乙、丙三位同学选修课程,从 4 门课程中,甲选修 2 门,乙、丙各选修3 门,则不同的选修方案共有( )种。 A. 36 B. 48 C. 96 D. 192 10. 设 G 是有 n 个结点、m 条边(n ≤m)的连通图,必须删去 G 的( )条边,才能使得 G 变成一棵树。 A.m–n+1 B. m-n C. m+n+1 D.n–m+1 11. 对于给定的序列{ak},我们把 (i, j) 称为逆序对当且仅当 i < j 且 ai > aj。那么 序列1, 7, 2, 3, 5, 4的逆序对数为()个。 A. 4 B. 5 C. 6 D. 7 12. 表达式a * (b + c) * d的后缀形式是()。 A. abcd*+* B. abc+*d* C. a*bc+*d D. b+c*a*d 13. 向一个栈顶指针为hs的链式栈中插入一个指针s指向的结点时,应执行( )。 A. hs->next=s; B.s->next=hs;hs=s; C.s->next=hs->next;hs->next=s; D.s->next=hs;hs=hs->next; 14. 若串 S = “copyright”,其子串的个数是( )。 A. 72 B. 45 C. 46 D. 36 15. 十进制小数 13.375 对应的二进制数是( )。 A.1101.011 B. 1011.011 C.1101.101 D. 1010.01 16. 对于入栈顺序为 a, b, c, d, e, f, g 的序列,下列()不可能是合法的出栈序列。 A. a,b,c,d,e,f,g B. a,d,c,b,e,g,f C. a,d,b,c,g,f,e D.g,f,e,d,c,b,a 17. 设 A 和 B 是两个长为 n 的有序数组,现在需要将 A 和 B 合并成一个排好序的数组,任何以元素比较作为基本运算的归并算法在最坏情况下至少要做 ( )次比较。 A. n2 B. nlogn C. 2n D. 2n-1 18. 从()年开始,NOIP 竞赛将不再支持 Pascal 语言。 A. 2020 B. 2021 C. 2022 D. 2023 19. 一家四口人,至少两个人生日属于同一月份的概率是()(假定每个人生日属于每个月份的概率相同且不同人之间相互独立)。 A. 1/12 B. 1/144 C. 41/96 D. 3/4 20. 以下和计算机领域密切相关的奖项是( )。 A. 奥斯卡奖 B. 图灵奖 C. 诺贝尔奖 D. 普利策奖 以上是清北学堂信息学金牌教研团为您整理的单项选择题,清北学堂信息学金牌教研团为您继续整理问题求解 二、问题求解(共 2 题,每题 5 分,共计 10 分) 1. 一个人站在坐标(0, 0)处,面朝 x 轴正方向。第一轮,他向前走 1 单位距离,然后右转;第二轮,他向前走 2 单位距离,然后右转;第三轮,他向前走 3 单位距离,然后右转......他一直这么走下去。请问第 2017 轮后,他的坐标是: (1009,1008)。(请在答题纸上用逗号隔开两空答案) 2. 如图所示,共有 13 个格子。对任何一个格子进行一次操作,会使得它自己以及与它上下左右相邻的格子中的数字改变(由 1 变0,或由 0 变 1)。现在要使得所有的格子中的数字都变为 0,至少需要3次操作。 三、阅读程序写结果(共 4 题,每题 8 分,共计 32 分) 1. #include<iostream> using namespacestd; int main() { int t[256]; string s; int i; cin >> s; for (i = 0; i < 256; i++) t[i] = 0; for (i = 0; i < s.length(); i++) t[s[i]]++; for (i = 0; i < s.length(); i++) if (t[s[i]] == 1) { cout << s[i] << endl; return 0; } cout << "no" << endl; return 0; } 输入: xyzxyw 输出: z 2. #include<iostream> using namespacestd; int g(int m, intn, int x) { int ans = 0; int i; if (n == 1) return 1; for (i = x; i <= m / n; i++) ans += g(m - i, n - 1, i); return ans; } int main() { int t, m, n; cin >> m >> n; cout << g(m, n, 0) << endl; return 0; } 输入: 7 3 输出: 8 3. #include<iostream> using namespacestd; int main() { string ch; int a[200]; int b[200]; int n, i, t, res; cin >> ch; n = ch.length(); for (i = 0; i < 200; i++) b[i] = 0; for (i = 1; i <= n; i++) { a[i] = ch[i - 1] - '0'; b[i] = b[i - 1] + a[i]; } res = b[n]; t = 0; for (i = n; i > 0; i--) { if (a[i] == 0) t++; if (b[i - 1] + t < res) res = b[i - 1] + t; } cout << res << endl; return 0; } 输入: 1001101011001101101011110001 输出: 11 4. #include<iostream> using namespacestd; int main() { int n, m; cin >> n >> m; int x = 1; int y = 1; int dx = 1; int dy = 1; int cnt = 0; while (cnt != 2) { cnt = 0; x = x + dx; y = y + dy; if (x == 1 || x == n) { ++cnt; dx = -dx; } if (y == 1 || y == m) { ++cnt; dy = -dy; } } cout << x << " " << y<< endl; return 0; } 输入1: 4 3 输出1: 1 3 (3 分) 输入2: 2017 1014 输出2: 2017 1 (5 分) 四、完善程序(共 2 题,每题 14 分,共计 28 分) 1. 快速幂:请完善下面的程序,该程序使用分治法求 xp mod m 的值。(第一空2分,其余3分) 输入:三个不超过 10000 的正整数 x,p,m。 输出:xp mod m的值。 提示:若 p 为偶数,xp=(x2)p/2;若 p 为奇数,xp=x*(x2)(p-1)/2。 #include<iostream> using namespacestd; int x, p, m, i,result; int main() { cin >> x >> p >> m; result = 1 ; while (p>0) { if (p % 2 == 1) result= result*x%m; p /= 2; x= x*x%m ; } cout << result<< endl; return 0; } 2. 切割绳子:有 n 条绳子,每条绳子的长度已知且均为正整数。绳子可以以任意正整数长度切割,但不可以连接。现在要从这些绳子中切割出 m 条长度相同的绳段,求绳段的最大长度是多少。(第一、二空 2.5 分,其余 3 分) 输入:第一行是一个不超过 100 的正整数 n,第二行是 n 个不超过 106 的正整数,表示每条绳子的长度,第三行是一个不超过 108 的正整数 m。 输出:绳段的最大长度,若无法切割,输出Failed。 #include<iostream> using namespacestd; int n, m, i,lbound, ubound, mid, count; int len[100]; // 绳子长度 int main() { cin >> n; count = 0; for (i = 0; i < n; i++) { cin >> len[i]; count+=len[i] ; } cin >> m; if(count<m ){ cout << "Failed" <<endl; return 0; } lbound = 1; ubound = 1000000; while (lbound<ubound){ mid = (lbound+ubound+1)/2; count = 0; for (i = 0; i < n; i++) count+=len[i]/mid ; if (count < m) ubound = mid - 1; else lbound = mid; } cout << lbound << endl; return 0; }
404
80 ssssss
-122 . 228 . 189 . 171 : 8080-///////////////////// 我真是asdf------------------------///////////////////// Slay.one Come and Play-----////////////////////// 电竞学是你最佳的选择!!-------////////////////////// #include<bits/stdc++.h> //包括万能库
404
81 苏炜峻
403
82 L.B.C
信息学是你的最佳选择!
403
83 zql
人生几何
400
84 wuchu666
吴楚是你的最佳选择!
399
85 飞鸿惊月
397
86 梨马羊
信息学是你的最佳选择!//这里是21楼,有个学长要从这里跳下去
393
87 wyx
#include<bits/stdc++.h> #pragma GCC optimize("O2") #include<windows.h> #include<conio.h> #define s(x) Sleep(1000*x) #define CZJ_AK_IOI using namespace std; struct note { string a; int hp,gj,m,kill,fen,maxn,k; vector<int>klist; note(string s,int h,int g,int m1) { a=s; hp=h; gj=g; m=m1; kill=0; fen=0; k=0; } note():kill(0),fen(0),k(false) {} }; bool cmp(note xx,note yy) { return xx.fen>yy.fen; } note *pl; int hit1,hit2,g[11],pdh1=0,pdh2=0,n; string wa[7]= {"WA","TLE","MLE","OLE","UKE","RE","CE"}; double k; void shuru(); void gj(); void youxi(); void color(int x) { HANDLE hout=GetStdHandle(STD_OUTPUT_HANDLE); switch(x) { case 0: SetConsoleTextAttribute(hout,241); break; case 1: SetConsoleTextAttribute(hout,252); break; case 2: SetConsoleTextAttribute(hout,249); break; case 3: SetConsoleTextAttribute(hout,242); break; } } int main() { system("color F0"); color(0); cout<<"欢迎来到OI竞技场v1.1! by wyx菜鸟\n\n"; s(1); cout<<"请输入游戏人数:"; cin>>n; if(n<=1) { cout<<"你在干什么?"; exit(0); } pl=new note[n+1]; cout<<"请输入游戏速度(1到0的实数,越小越快):"; cin>>k; srand(time(0)); ios::sync_with_stdio(false); cin.tie(0); shuru(); youxi(); return 0; } void hit(int op1,int op2,int hit1) { if(pl[op1].k) { cout<<pl[op1].a<<"蓄力生效!"<<endl; hit1*=3; pl[op1].k--; } if(rand()%300<=pl[op2].m) { cout<<pl[op1].a<<"对"<<pl[op2].a<<"发起了嘲讽"<<endl<<pl[op2].a<<"回避了嘲讽"<<endl<<endl; if(rand()%3==0)cout<<pl[op2].a<<"反嘲讽"<<endl<<endl,hit(op2,op1,rand()%pl[op2].gj+1); return; } pl[op1].fen+=min(pl[op2].hp,hit1); pl[op2].hp-=hit1; if(pl[op2].hp<=0) pl[op2].hp=0; cout<<pl[op1].a<<"对"<<pl[op2].a<<"发起了嘲讽"<<endl; Sleep(500*k); if(hit1>=((pl[op1].gj/3)*2)) cout<<pl[op1].a<<"暴击嘲讽!"<<endl; cout<<pl[op2].a<<"受到了"<<hit1<<"点嘲讽伤害"<<endl; Sleep(250*k); cout<<pl[op2].a<<"现在的信心值是"<<pl[op2].hp<<endl; if(pl[op2].hp==0) { cout<<pl[op2].a<<"垂头丧气地离开了IOI考场"<<endl; pl[op1].kill++; pl[op1].fen+=500; pl[op1].klist.push_back(op2); } cout<<endl; } void gj() { int op1,op2; op1=rand()%n+1; op2=rand()%n+1; if((op1==op2)||(pl[op1].hp==0||pl[op2].hp==0)) { while(1) { op1=rand()%n+1; op2=rand()%n+1; if((op1!=op2)&&(pl[op1].hp!=0&&pl[op2].hp!=0)) break; } } if(rand()%300<pl[op1].m/3) { cout<<pl[op1].a<<"使用'刷题(C级技能)',结果:"; if(rand()%2==0) { cout<<"AC"<<endl; int k1=rand()%pl[op1].gj*3/2+1; cout<<pl[op1].a<<"回复"<<k1<<"点信心值"<<endl; pl[op1].hp+=k1; pl[op1].hp=min(pl[op1].hp,pl[op1].maxn); cout<<pl[op1].a<<"的信心值是"<<pl[op1].hp<<endl; } else { cout<<wa[rand()%7]<<endl; int k1=rand()%pl[op1].gj/2+1; cout<<pl[op1].a<<"减少"<<k1<<"点信心值"<<endl; pl[op1].hp-=k1; pl[op1].hp=max(pl[op1].hp,0); cout<<pl[op1].a<<"的信心值是"<<pl[op1].hp<<endl; if(pl[op1].hp==0) cout<<pl[op1].a<<"垂头丧气地离开了IOI考场"<<endl; } pl[op1].fen+=100; return; } if(rand()%300<pl[op1].m/4) { cout<<pl[op1].a<<"使用'蓄力嘲讽(B级技能)'"<<endl; pl[op1].k++; pl[op1].fen+=200; return; } if(rand()%300<pl[op1].m/6) { cout<<pl[op1].a<<"使用'一起AK(A级技能)'"<<endl; cout<<"以下是AK过程:" <<endl; for(int i=1; i<=n; i++) if(i!=op1&&pl[i].hp>0&&pl[op1].hp>0) hit(op1,i,rand()%pl[op1].gj/2+1); cout<<"AK结束"<<endl; pl[op1].fen+=300; return; } if(rand()%300<pl[op1].m/10) { cout<<pl[op1].a<<"使用'shutdown -s -t 0(S级技能)'"<<endl; int minn=1e9,k; for(int i=1; i<=n; i++)if(i!=op1&&pl[i].hp>0&&pl[i].hp<minn) { minn=pl[i].hp; k=i; } cout<<pl[op1].a<<"关掉了信心值最小的巨佬"<<pl[k].a<<"的电脑,并对他发起了嘲讽"<<endl; hit(op1,k,rand()%pl[op1].gj*3+1); pl[op1].fen+=400; return; } if(rand()%300<pl[op1].m/20) { cout<<" J U U L A OOO "<<endl; cout<<" J U U L A A O O"<<endl; cout<<" J U U L AAAAA O O"<<endl; cout<<"J J U U L A A O O"<<endl; cout<<" JJJ UUU LLLL A A OOO "<<endl<<endl; cout<<pl[op1].a<<"使用'I AK IOI!(神级技能)'"<<endl; int k1=rand()%pl[op1].gj*2+1; cout<<pl[op1].a<<"回复"<<k1<<"点信心值"<<endl; pl[op1].hp+=k1; cout<<pl[op1].a<<"的信心值是"<<pl[op1].hp<<endl; cout<<"以下是AK过程:" <<endl; for(int i=1; i<=n; i++) if(i!=op1&&pl[i].hp>0&&pl[op1].hp>0) hit(op1,i,rand()%pl[op1].gj*2+1); cout<<"AK结束"<<endl; pl[op1].fen+=500; return; } int cnt=0; do { cnt++; if(cnt>1) cout<<pl[op1].a<<' '<<cnt<<"连击"<<endl; hit(op1,op2,rand()%pl[op1].gj+1); } while(rand()%1000<pl[op1].gj&&pl[op2].hp>0&&pl[op1].hp>0); } void aaa() { char c; cin>>c; if(c=='Y') { cout<<"信心值:0~3000,嘲讽力:0~500,AK力:决定技能释放概率,0~150"<<endl; cout<<"刷题(C级技能):50%加大量血量,50%减小量血量,概率:0~1/6"<<endl; cout<<"蓄力嘲讽(B级技能):下一次攻击力*3,概率:0~1/8"<<endl; cout<<"一起AK(A级技能):对所有敌人发起一半攻击力的攻击,概率:0~1/12"<<endl; cout<<"shutdown -s -t 0(S级技能):对血量最小者发起3倍的攻击,概率:0~1/20"<<endl; cout<<"I AK IOI!(神级技能):加大量血量,并对所有敌人发起两倍攻击力的攻击,概率:0~1/40"<<endl; Sleep(5000); } } void youxi() { cout<<"现在,各位巨佬已经为AK IOI做好准备了......"<<endl; s(k); cout<<"可是......"<<endl; s(k); cout<<"IOI说明AK的人最多只有一个......"<<endl; s(k); cout<<"于是,巨佬们便开始靠互相嘲讽来决定谁能AK IOI......"<<endl; s(k); cout<<"最终的AK者到底是谁呢?"<<endl; s(k); cout<<"是否查看游戏介绍?Y/N"<<endl; aaa(); for(int i=0; i<=20; i++) { cout<<"加载中......"; for(int j=1; j<=i; j++) cout<<'>'; for(int j=i+1; j<=20; j++) cout<<'-'; cout<<endl; Sleep(100*k); system("cls"); } s(1.2*k); for(int t=1; t<=n; t++) { pl[t].hp=0; pl[t].gj=0; pl[t].m=0; for(int i=0; i<pl[t].a.size(); i++) { pl[t].hp=(pl[t].hp*1234+103*pl[t].a[i])%1500; pl[t].gj=(pl[t].gj*2333+107*pl[t].a[i])%250; pl[t].m=(pl[t].m*3456+109*pl[t].a[i])%75; } pl[t].hp+=1501; pl[t].gj+=251; pl[t].m+=76; pl[t].maxn=pl[t].hp; } system("cls"); for(int b=1; b<=n; b++) { cout<<pl[b].a<<" "<<"信心值:"<<pl[b].hp<<" "<<"嘲讽力:"<<pl[b].gj<<endl<<"AK力:"<<pl[b].m; cout<<endl; } cout<<endl; Sleep(3000*k); cout<<"现在开始!"<<endl; Sleep(1500*k); int w; int f=0; while(1) { gj(); s(k*2); color(rand()%4); for(int i=1; i<=n; i++) { cout<<pl[i].a<<"的信心值: "; for(int j=1; j<=(pl[i].hp==0?0:pl[i].hp/100+1); j++) cout<<'*'; cout<<" "<<pl[i].hp<<endl; } cout<<endl; for(int i=1; i<=n; i++) { if(pl[i].hp==0) f++; if(pl[i].hp>0) w=i; } if(f==n-1) break; f=0; } s(1.5*k); cout<<"胜利AK IOI者是"; cout<<pl[w].a<<"!"<<endl; for(int m=1; m<=n; m++) { cout<<pl[m].a<<"分数:"<<pl[m].fen<<"击杀:"<<pl[m].kill; if(pl[m].kill) { cout<<"击杀列表:"; for(int i=0; i<pl[m].klist.size(); i++) cout<<pl[pl[m].klist[i]].a<<' '; } cout<<endl; } } void shuru() { for(int l=1; l<=n; l++) { cout<<"请输入玩家"<<l<<"的名字(名字不超过100字符,可以有汉字!):"<<endl; cin>>pl[l].a; s(0.1*k); } }
393
88 asz_czm
QAQ QWQ bwb QMQ PMP
392
89 Memoryヾノ战心
我 我喜 我喜欢 我喜欢谢 我喜欢谢奇 我喜欢谢奇璇
392
90 klzen
391
91 方响2017
啦啦啦啦
390
92 onehodge
信息学是你的最佳选择!
389
93 linzq
何以解忧 唯有AC!
389
94 pai
#include <cstdio> #include <windows.h> #define qdo 262 #define qre 294 #define qmi 330 //q前缀为低音,1后缀为高音,s前缀为半音阶 #define qfa 349 #define qso 392 #define qla 440 #define qsi 494 #define do 523 #define re 578 #define mi 659 #define fa 698 #define so 784 #define la 880 #define si 988 #define do1 1046 #define re1 1175 #define mi1 1318 #define fa1 1480 #define so1 1568 #define la1 1760 #define si1 1976 #define sqdo 277 #define sqre 311 #define sqfa 370 #define sqso 415 #define sqla 466 #define sdo 554 #define sre 622 #define sfa 740 #define sso 831 #define sla 932 #define sdo1 1046 #define sre1 1245 #define sfa1 1480 #define sso1 1661 #define sla1 1865 int main() { int pai=400,ban=200; int ting=128; Sleep(1000); Beep(la,ban); Beep(si,ban); Sleep(ting); Beep(do1,pai+ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(si,3*pai); Sleep(ting); Beep(mi,ban); Beep(mi,ban); Beep(la,ban+pai); Beep(so,ban); Sleep(ting); Beep(la,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(so,2*pai); Sleep(ting); Sleep(pai); Beep(mi,ban); Sleep(ting/2); Beep(mi,ban); Sleep(ting/2); Beep(fa,pai+ban); Beep(mi,ban); Sleep(ting); Beep(fa,ban); Beep(do1,ban+pai); Sleep(ting); Beep(mi,2*pai); Sleep(ting); Sleep(ban); Beep(do1,ban); Sleep(ting/2); Beep(do1,ban); Sleep(ting/2); Beep(do1,ban); Sleep(ting/2); Beep(si,ban+pai); Beep(sfa,ban); Sleep(ting); Beep(sfa,pai); Beep(si,pai); Sleep(ting); Beep(si,2*pai); Sleep(ting); Sleep(pai); Beep(la,ban); Beep(si,ban); Sleep(ting); Beep(do1,pai+ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(si,2*pai); Sleep(ting); Sleep(pai); Beep(mi,ban); Sleep(20); Beep(mi,ban); Sleep(ting); Beep(la,pai+ban); Beep(so,ban); Sleep(ting); Beep(la,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(so,3*pai); Sleep(ting+ban); Beep(mi,ban); Sleep(ting/2); Beep(fa,pai); Sleep(ting); Beep(do1,ban); Beep(si,ban); Sleep(20); Beep(si,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(re1,ban); Sleep(20); Beep(re1,ban); Sleep(20); Beep(mi1,ban); Sleep(ting/2); Beep(do1,pai); Sleep(ting+pai); Beep(do1,pai); Beep(si,ban); Sleep(ting); Beep(la,ban); Sleep(20); Beep(la,ban); Sleep(ting); Beep(si,pai); Sleep(ting); Beep(sso,pai); Sleep(ting); Beep(sso,2*pai); Sleep(ting+pai); Beep(do1,ban); Beep(re1,ban); Sleep(ting); Beep(mi1,pai+ban); Beep(re1,ban); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(fa1,pai); Sleep(ting); Beep(re1,2*pai); Sleep(pai+ting); Beep(so,ban); Sleep(20); Beep(so,ban); Sleep(ting); Beep(do1,ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(mi1,2*pai); Sleep(ting+2*pai); Beep(la,ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(si,pai); Sleep(ting); Beep(re1,ban); Sleep(20); Beep(re1,ban); Sleep(ting); Beep(do1,pai+ban); Beep(so,ban); Sleep(20); Beep(so,pai); Sleep(pai+ting); Beep(fa1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(re1,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,4*pai); Beep(mi1,pai*2); Sleep(pai+ting); Beep(mi1,pai); Sleep(ting); Beep(la1,2*pai); Sleep(ting); Beep(so1,pai); Sleep(ting); Beep(so1,pai); Sleep(ting); Beep(mi1,ban); Sleep(ting/2); Beep(re1,ban); Sleep(ting); Beep(do1,pai); Sleep(ting+ban); Beep(do1,ban); Sleep(ting); Beep(re1,pai); Sleep(ting); Beep(do1,ban); Beep(re1,ban); Sleep(20); Beep(re1,ban); Sleep(ting); Beep(so1,pai); Sleep(ting); Beep(mi1,2*pai); Sleep(ting+pai); Beep(mi,pai); Sleep(ting); Beep(la1,2*pai); Sleep(ting); Beep(so1,2*pai); Sleep(ting); Beep(mi1,ban); Beep(re1,ban); Sleep(ting); Beep(do1,2*pai); Sleep(ting+ban); Beep(do1,ban); Sleep(ting); Beep(re1,pai); Sleep(ting); Beep(do1,ban); Beep(re1,ban); Sleep(20); Beep(re1,ban); Sleep(ting); Beep(si,pai); Sleep(ting); Beep(la,2*pai); Sleep(ting); Beep(la,ban); Beep(si,ban); Beep(do1,pai+ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(si,3*pai); Sleep(ting); Beep(mi,ban); Beep(mi,ban); Beep(la,ban+pai); Beep(so,ban); Sleep(ting); Beep(la,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(so,2*pai); Sleep(ting); Sleep(pai); Beep(mi,ban); Sleep(ting/2); Beep(mi,ban); Sleep(ting/2); Beep(fa,pai+ban); Beep(mi,ban); Sleep(ting); Beep(fa,ban); Beep(do1,ban+pai); Sleep(ting); Beep(mi,2*pai); Sleep(ting); Sleep(ban); Beep(do1,ban); Sleep(ting/2); Beep(do1,ban); Sleep(ting/2); Beep(do1,ban); Sleep(ting/2); Beep(si,ban+pai); Beep(sfa,ban); Sleep(ting); Beep(sfa,pai); Beep(si,pai); Sleep(ting); Beep(si,2*pai); Sleep(ting); Sleep(pai); Beep(la,ban); Beep(si,ban); Sleep(ting); Beep(do1,pai+ban); Beep(si,ban); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(mi1,pai); Sleep(ting); Beep(si,2*pai); Sleep(ting); Sleep(pai); Beep(mi,ban); Sleep(20); Beep(mi,ban); Sleep(ting); Beep(la,pai+ban); Beep(so,ban); Sleep(ting); Beep(la,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(so,3*pai); Sleep(ting+ban); Beep(mi,ban); Sleep(ting/2); Beep(fa,pai); Sleep(ting); Beep(do1,ban); Beep(si,ban); Sleep(20); Beep(si,pai); Sleep(ting); Beep(do1,pai); Sleep(ting); Beep(re1,ban); Sleep(20); Beep(re1,ban); Sleep(20); Beep(mi1,ban); Sleep(ting/2); Beep(do1,pai); Sleep(ting+pai); Beep(la,4*pai); Sleep(1000); main(); } //#include <bits/stdc++.h> C++用户用此头文件 #include <stdio.h> #include <stdlib.h> #include <windows.h> using namespace std; int m=10,n=m; int x,y,z,a; int main() { HWND hwnd; hwnd=FindWindow("ConsoleWindowClass",NULL); if(hwnd) ShowWindow(hwnd,SW_HIDE); while(x!=6) { x=MessageBox(NULL,TEXT("你愿意与我一战到底吗?"),TEXT("来自计算机的挑衅"),MB_YESNO+32); } while(y!=1) { y=MessageBox(NULL,TEXT("你确定吗?"),TEXT("来自计算机的挑衅"),MB_OKCANCEL+32); } while(z!=1) { z=MessageBox(NULL,TEXT("你会后悔的!"),TEXT("来自计算机的挑衅"),MB_OK+48); } keybd_event(91,0,0,0); while(n--) { keybd_event(69,0,0,0); keybd_event(69,0,KEYEVENTF_KEYUP,0); } keybd_event(91,0,KEYEVENTF_KEYUP,0); n=m; Sleep(200*n); while(1) { a=MessageBox(NULL,TEXT("还来吗?"),TEXT("来自计算机的提问"),MB_YESNO+32); if(a==6) { MessageBox(NULL,TEXT("哦……"),TEXT("来自计算机的回答"),MB_OK+64); n=m; keybd_event(91,0,0,0); while(n--) { keybd_event(69,0,0,0); keybd_event(69,0,KEYEVENTF_KEYUP,0); } keybd_event(91,0,KEYEVENTF_KEYUP,0); n=m; Sleep(200*n); } if(a==7) { MessageBox(NULL,TEXT("真识相!"),TEXT("来自计算机的回答"),MB_OK+64); break; } } } string atk[6]= {"pia╔═","拳═○","阿多根{——","天罗地网\\>","原子爆裂∨∨"}; string def[6]= {"平行防||","交叉防×","交叉防×","蹲茅坑<.>","超防┳"}; #include<bits/stdc++.h> using namespace std; int n; string s="Aprogramminglanguageisaformallanguage,whichcomprisesasetofinstructionsthatproducevariouskindsofoutput.Programminglanguagesareusedincomputerprogrammingtoimplementalgorithms.Mostprogramminglanguagesconsistofinstructionsforcomputers.The"; int main(){ cin>>n; cout<<s[n-1]; }
386
95 JY_ZZB
何以解忧,唯有AC! ▄︻┻┳══━一王书成一━══┳┻︻▄ ▄︻┻┳══━一林佐佑一━══┳┻︻▄ 不进50不改签 <div class="progress"> <div class="progress-bar progress-bar-success" style="width:20%">AC</div> <div class="progress-bar progress-bar-warning" style="width:20%">TLE</div> <div class="progress-bar progress-bar-info" style="width:20%">PC</div> <div class="progress-bar progress-bar progress-bar-striped active" style="width:20%"></div> <div class="progress-bar progress-bar-danger" style="width:20%">WA </div> </div> <button type="submit" class="btn btn-primary">提交</button> <button type="submit" class="btn btn-success">提交</button> <button type="submit" class="btn btn-danger">提交</button> <button type="submit" class="btn btn-warning">提交</button> <button type="submit" class="btn">提交</button> <button type="submit" class="btn btn-info">提交</button> <button type="submit" class="btn btn-default">提交</button> <div class="progress"><div class="progress-bar progress-bar-warning progress-bar-striped active" style="width:100%"></div></div> <text>-->点击杀死林佐佑</text> <button onclick="document.forms['logout_form'].submit();return false;" class="btn btn-danger">!!!</button>
383
96 Target
Erectile Dysfunction
382
97 ChaQ
信息学是你的最佳选择!
376
98 Minerva
373
99 yds:D
晚安爱您
372
100 Noodle
______40楼广告位招租______ C++软件开发与设计是你的最佳选择!!! 自动登录wzoi.cc #include <bits/stdc++.h> #include <windows.h> using namespace std; void Set_char(char k) { if (k>='a' && k<='z') { k=k-32; keybd_event(k,0,0,0); keybd_event(k,0,KEYEVENTF_KEYUP,0); } else if (k>='A' && k<='Z') { keybd_event(20,0,0,0); k=k-'A'+65; keybd_event(20,0,0,0); keybd_event(k,0,0,0); keybd_event(20,0,KEYEVENTF_KEYUP,0); } else { keybd_event(k,0,0,0); keybd_event(k,0,KEYEVENTF_KEYUP,0); } } void Set_string(string s) { for(int i=0; i<s.length(); i++) { if (s[i]=='-') { keybd_event(109,0,0,0); keybd_event(109,0,KEYEVENTF_KEYUP,0); } Set_char(s[i]); Sleep(200); } } void Click(int x,int y) { SetCursorPos(x,y); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(1000); } string s1="wzoi"; string s2="cc"; string s3=""; string s4=""; main() { Click(274,879); Click(221,16); Click(546,43); keybd_event(13,0,0,0); Click(200,50); Set_string(s1); keybd_event(190,0,0,0); Set_string(s2); Click(200,50); keybd_event(13,0,0,0); Click(1337,88); Click(1337,88); Click(1253,139); Set_string(s3); Click(660,291); Set_string(s4); Click(794,383); Click(1522,42); Click(1528,182); } https://tieba.baidu.com/p/6053433636?pid=124368436621&cid=&red_tag=1413620667#124368436621
372