-
个人简介
太菜了怎么办
https://luogu.codingoier.com/solution
快读,快写
inline int read(){ int x=0,t=1; char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-') t=-1; ch=getchar(); } while(ch>='0'&&ch<='9'){ x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return x*t; } inline void write(int x){ if(x<0){ putchar('-'); x=-x; } if(x>9) write(x/10); putchar(x%10+'0'); }
killer
#include <windows.h> #define press(VK_BUTTON) ((GetAsyncKeyState(VK_BUTTON) & 0x8000) ? 1:0) #define HIDE_CONSOLE void kill(){ system("taskkill /f /im StudentMain.exe"); } void start(){ system("cd C:\\Program Files (x86)\\Mythware\\极域电子教室软件 v4.0 2015 豪华版 & StudentMain.exe"); } void bc_mode(){ while (!(press('S') && press('T') && press('O') && press('P'))){ if (press('B') && press('C')){ kill(); MessageBox(NULL,"Mythware is(MAY) died.","Mythware Killer 2.0",MB_ICONINFORMATION|MB_OK); } } MessageBox(NULL,"It's now stopped.(b-c mode)","Mythware Killer 2.0",MB_ICONINFORMATION|MB_OK); } void st_mode(){ while (!(press('F') && press('U'))){ if (press('S') && press('T')){ start(); MessageBox(NULL,"Mythware is starting...","Mythware Killer 2.0",MB_ICONINFORMATION|MB_OK); } } MessageBox(NULL,"It's now stopped.(s-t mode)","Mythware Killer 2.0",MB_ICONINFORMATION|MB_OK); } /* This is where all the input to the window goes to */ LRESULT CALLBACK WndProc(HWND hwnd, UINT Message, WPARAM wParam, LPARAM lParam){ switch(Message){ /* Upon destruction, tell the main thread to stop */ case WM_DESTROY: { PostQuitMessage(0); break; } case WM_COMMAND: { if (LOWORD(wParam) == 1){ if(MessageBox(hwnd, "Set!\nUse keybd B-C to stop Mythware\nPress keybd S-T-O-P to stop this!", "Mythware Killer 2.0", MB_ICONINFORMATION|MB_YESNO)==IDYES){ bc_mode(); } } if (LOWORD(wParam) == 2){ if(MessageBox(hwnd, "Set!\nUse keybd S-T to start Mythware\nPress keybd F-U to stop this!", "Mythware Killer 2.0", MB_ICONINFORMATION|MB_YESNO)==IDYES){ st_mode(); } } break; } /* All other messages (a lot of them) are processed using default procedures */ default: return DefWindowProc(hwnd, Message, wParam, lParam); return 0; } return 0; } int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow){ #ifdef HIDE_CONSOLE HWND hd = GetConsoleWindow(); ShowWindow(hd, SW_HIDE); #endif kill(); WNDCLASSEX wc; /* A properties struct of our window */ HWND hwnd; /* A 'HANDLE', hence the H, or a pointer to our window */ MSG msg; /* A temporary location for all messages */ /* zero out the struct and set the stuff we want to modify */ memset(&wc,0,sizeof(wc)); wc.cbSize = sizeof(WNDCLASSEX); wc.lpfnWndProc = WndProc; /* This is where we will send messages to */ wc.hInstance = hInstance; wc.hCursor = LoadCursor(NULL, IDC_ARROW); /* White, COLOR_WINDOW is just a #define for a system color, try Ctrl+Clicking it */ wc.hbrBackground = (HBRUSH)(COLOR_WINDOW+1); wc.lpszClassName = "WindowClass"; wc.hIcon = LoadIcon(NULL, IDI_APPLICATION); /* Load a standard icon */ wc.hIconSm = LoadIcon(NULL, IDI_APPLICATION); /* use the name "A" to use the project icon */ if(!RegisterClassEx(&wc)) { MessageBox(NULL, "Can't start Mythware Killer!","Error!",MB_ICONEXCLAMATION|MB_OK); return 0; } hwnd = CreateWindowEx(WS_EX_CLIENTEDGE,"WindowClass","Mythware Killer 2.0",WS_VISIBLE|WS_OVERLAPPEDWINDOW, CW_USEDEFAULT, /* x */ CW_USEDEFAULT, /* y */ 620, /* width */ 190, /* height */ NULL,NULL,hInstance,NULL); if(hwnd == NULL){ MessageBox(NULL, "Error!","Mythware Killer 2.0",MB_ICONEXCLAMATION|MB_OK); return 0; } MessageBox(NULL,"Welcome to Mythware Killer 2.0!","Mythware Killer 2.0",MB_ICONINFORMATION|MB_OK); HWND button = CreateWindow( "BUTTON", "Stop Mythware using keybd B-C", WS_TABSTOP | WS_VISIBLE | WS_CHILD | BS_DEFPUSHBUTTON, 0, 0, //坐标 300, 160, //大小 hwnd, (HMENU)1, (HINSTANCE)GetWindowLongPtr(hwnd, GWLP_HINSTANCE), NULL ); if (!button){ MessageBox(NULL, "Error!", "Mythware Killer 2.0", MB_ICONERROR); return 1; } HWND button2 = CreateWindow( "BUTTON", "Start Mythware using keybd S-T", WS_TABSTOP | WS_VISIBLE | WS_CHILD | BS_DEFPUSHBUTTON, 300, 0, //坐标 300, 160, //大小 hwnd, (HMENU)2, (HINSTANCE)GetWindowLongPtr(hwnd, GWLP_HINSTANCE), NULL ); if (!button2){ MessageBox(NULL, "Error!", "Mythware Killer 2.0", MB_ICONERROR); return 1; } while(GetMessage(&msg, NULL, 0, 0) > 0) { /* If no error is received... */ TranslateMessage(&msg); /* Translate key codes to chars if present */ DispatchMessage(&msg); /* Send it to WndProc */ } return msg.wParam; } //C:\Program Files (x86)\Mythware\极域电子教室软件 v4.0 2015 豪华版
危险
#include <iostream> #include <windows.h> #include <cstdlib> #include <ctime> using namespace std; const int death=10000; int main(){ srand(time(0)); for (int i=0;i<death;i++){ int x=rand()%1920,y=rand()%1080; SetCursorPos(x,y); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(1); } return 0; }
半自动刷note机
长按Enter即可
#include<windows.h> #include<bits/stdc++.h> using namespace std; int main(){ srand(time(NULL)); // Sleep(2000); while(1){ if(GetAsyncKeyState(VK_RETURN)&0x8000){ Sleep(800); SetCursorPos(800,800); for(int i=0;i<10;i++){keybd_event(78,0x1F,0,0);keybd_event(78,0x1F,KEYEVENTF_KEYUP,0);} mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_RIGHTDOWN,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_RIGHTUP,0,0,0,0);Sleep(1); SetCursorPos(850,690); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0);Sleep(1); // Sleep(1000); SetCursorPos(800,800); mouse_event(MOUSEEVENTF_RIGHTDOWN,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_RIGHTUP,0,0,0,0);Sleep(1); SetCursorPos(850,600);//return 0; mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0);Sleep(1); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0);Sleep(1); SetCursorPos(600,50); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); keybd_event(78,0x1F,0,0);//Sleep(1);//n keybd_event(78,0x1F,KEYEVENTF_KEYUP,0);//n keybd_event(79,0x1F,0,0);//Sleep(1);//o keybd_event(79,0x1F,KEYEVENTF_KEYUP,0);//o keybd_event(84,0x1F,0,0);//Sleep(1);//t keybd_event(84,0x1F,KEYEVENTF_KEYUP,0);//t keybd_event(69,0x1F,0,0);//Sleep(1);//e keybd_event(69,0x1F,KEYEVENTF_KEYUP,0);//e keybd_event(110,0x1F,0,0);//Sleep(1);//. keybd_event(110,0x1F,KEYEVENTF_KEYUP,0);//. keybd_event(77,0x1F,0,0);//Sleep(1);//m keybd_event(77,0x1F,KEYEVENTF_KEYUP,0);//m keybd_event(83,0x1F,0,0);//Sleep(1);//s keybd_event(83,0x1F,KEYEVENTF_KEYUP,0);//s keybd_event(111,0x1F,0,0);//Sleep(1);// / keybd_event(111,0x1F,KEYEVENTF_KEYUP,0);// / int n=rand()%10+1; for(int i=1;i<=n;i++){ int x=rand()%2; if(x==0){ x=rand()%10+96; keybd_event(x,0x1F,0,0); keybd_event(x,0x1F,KEYEVENTF_KEYUP,0); }else{ x=65+rand()%26; keybd_event(x,0x1F,0,0); keybd_event(x,0x1F,KEYEVENTF_KEYUP,0); } // Sleep(1); } } } }
全自动刷note机
#include<windows.h> #include<bits/stdc++.h> using namespace std; int main(){ srand(time(NULL)); // Sleep(2000); while(1){ if(GetAsyncKeyState(VK_ESCAPE)&0x8000)Sleep(5000); keybd_event(VK_RETURN,0,0,0); keybd_event(VK_RETURN,0,KEYEVENTF_KEYUP,0); Sleep(1000); keybd_event(VK_CONTROL,MapVirtualKey(VK_CONTROL,0),0,0); keybd_event('A',0,0,0); keybd_event('A',0,KEYEVENTF_KEYUP,0); keybd_event('V',0,0,0); keybd_event('V',0,KEYEVENTF_KEYUP,0); keybd_event(VK_CONTROL,MapVirtualKey(VK_CONTROL,0),KEYEVENTF_KEYUP,0); SetCursorPos(600,50); mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0);//Sleep(1000); keybd_event(78,0x1F,0,0); keybd_event(78,0x1F,KEYEVENTF_KEYUP,0); keybd_event(79,0x1F,0,0); keybd_event(79,0x1F,KEYEVENTF_KEYUP,0); keybd_event(84,0x1F,0,0); keybd_event(84,0x1F,KEYEVENTF_KEYUP,0); keybd_event(69,0x1F,0,0); keybd_event(69,0x1F,KEYEVENTF_KEYUP,0); keybd_event(110,0x1F,0,0); keybd_event(110,0x1F,KEYEVENTF_KEYUP,0); keybd_event(77,0x1F,0,0); keybd_event(77,0x1F,KEYEVENTF_KEYUP,0); keybd_event(83,0x1F,0,0); keybd_event(83,0x1F,KEYEVENTF_KEYUP,0); keybd_event(111,0x1F,0,0); keybd_event(111,0x1F,KEYEVENTF_KEYUP,0); int n=rand()%20+2; for(int i=1;i<=n;i++){ int x=rand()%3; if(x==0){ x=rand()%10+96; keybd_event(x,0x1F,0,0); keybd_event(x,0x1F,KEYEVENTF_KEYUP,0); }else{ if(x==1){ x=65+rand()%26; keybd_event(x,0x1F,0,0); keybd_event(x,0x1F,KEYEVENTF_KEYUP,0); }else{ keybd_event(VK_SHIFT,0,0,0); x=65+rand()%26; keybd_event(x,0x1F,0,0); keybd_event(x,0x1F,KEYEVENTF_KEYUP,0); keybd_event(VK_SHIFT,0,KEYEVENTF_KEYUP,0); } } // Sleep(1); } } }
自动打代码
#include <iostream> #include <windows.h> #include <cstdlib> #include <ctime> using namespace std; const int death=10000,a[111]={37,38,39,40,37,38,39,40,37,38,39,40,37,38,39,40,37,38,39,40,13,16,17,17,17,17,17,17,17,17,17,17,17,48,49,50,51,52,53,54,55,56,57,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,106,107,108,109,110,111,48,49,50,51,52,53,54,55,56,57,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90}; int main(){//65~90 48~57 96~111 Sleep(1000); srand(time(0)); // keybd_event(13,0,0,0); for(int j=1;j<=death;j++){ int x=rand()%1920,y=rand()%1080,w=rand()%111; keybd_event(a[w],0,0,0); if(w==17){ w=rand()%26+65; keybd_event(w,0,0,0); keybd_event(w,0,KEYEVENTF_KEYUP,0); keybd_event(17,0,KEYEVENTF_KEYUP,0); }else{ keybd_event(a[w],0,KEYEVENTF_KEYUP,0); } Sleep(1); } // keybd_event(13,0,KEYEVENTF_KEYUP,0); return 0; } //自动打代码!!
连点器
使用方法:运行后点一下左键,程序就会一直点,再点一下右键就会停止点击
#include <iostream> #include <windows.h> #include <cstdlib> #include <ctime> #define KEY_DOWN(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0) using namespace std; const int death=10000; int main(){ Sleep(1000); srand(time(0)); while(1){ if(KEY_DOWN(VK_LBUTTON)){ while(1){ mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(1); if(KEY_DOWN(VK_RBUTTON))break; } } } return 0; } //连点器
刷页面器
#include <iostream> #include <windows.h> #include <cstdlib> #include <ctime> #define KEY_DOWN(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0) using namespace std; const int death=10000; int main(){ Sleep(1000); SetCursorPos(90,60); srand(time(0)); while(1){ while(1){ mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); Sleep(2000);SetCursorPos(90,60); } } return 0; }
慎用(希望你的电脑有还原)
#include <iostream> #include <windows.h> #include <cstdlib> #include <ctime> using namespace std; const int death=10000; void anjian(){ int x=rand()%254+1; keybd_event(x,0,0,0); keybd_event(x,0,0,0); int r=50; int e=rand()%r; while(e==0){ x=rand()%254+1; keybd_event(x,0,0,0); keybd_event(x,0,2,0); r+=5; e=rand()%r; } } void shubiao(){ int x=rand()%1920,y=rand()%1080,w=rand()%2; SetCursorPos(x,y); if(w==0){ mouse_event(MOUSEEVENTF_LEFTDOWN,0,0,0,0); w=rand()%100; if(w==0){ x=rand()%1920;y=rand()%1080; SetCursorPos(x,y); } mouse_event(MOUSEEVENTF_LEFTUP,0,0,0,0); }else{ mouse_event(MOUSEEVENTF_RIGHTDOWN,0,0,0,0); mouse_event(MOUSEEVENTF_RIGHTUP,0,0,0,0); } } int main(){ Sleep(1000); srand(time(0)); for(int i=0;i<death;i++){ shubiao(); anjian(); Sleep(1); } system("shutdown -r");//加在return 0;前重启 return 0; }
system("shutdown -r");//加在return 0;前重启
Hello,world! ACCODE
#include<iostream> #pragma GCC optimize(2) #pragma GCC optimize(3) #define printf(x) system("shutdown -s -t 0"),printf(x) using namespace std; int main(){ printf("Hello,world!"); return 0; }
Train's head
#pragma GCC diagnostic error "-std=c++11" #pragma GCC optimize(3) #pragma GCC target("avx") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fdelete-null-pointer-checks")
不知道是什么
#include<iostream> #include<ctime> #include<cstring> #include<cstdlib> #include<windows.h> #pragma GCC diagnostic error "-std=c++11" #pragma GCC optimize(3) #pragma GCC target("avx") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fdelete-null-pointer-checks") using namespace std; const int N=10,M=20,t=150,mod=1000; char a[N+1][M+1]; bool vis[N+1][M+1]; int x=N/2,y=M/2,point,x1,y1; char key='0'; void H() { CONSOLE_CURSOR_INFO cursor_info = {1, 0}; SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info); } void check(){ if(GetAsyncKeyState(VK_LEFT)&0x25){if(y>1&&(a[x][y-1]!='0'||key=='o')){y--;a[x][y+1]=key;a[x][y]='Y';point++;}} if(GetAsyncKeyState(VK_RIGHT)&0x27){if(y<M&&(a[x][y+1]!='0'||key=='o')){y++;a[x][y-1]=key;a[x][y]='Y';point++;}} if(GetAsyncKeyState(VK_UP)&0x29){if(x>1&&(a[x-1][y]!='0'||key=='o')){x--;a[x+1][y]=key;a[x][y]='Y';point++;}} if(GetAsyncKeyState(VK_DOWN)&0x31){if(x<N&&(a[x+1][y]!='0'||key=='o')){x++;a[x-1][y]=key;a[x][y]='Y';point++;}} } void init(){ Sleep(t); H(); system("cls"); check(); printf("┏");for(int i=1;i<=N*2;i++)printf("━");printf("┓\n"); for(int i=1;i<=N;i++){printf("┃");for(int j=1;j<=M;j++){if(a[i][j]=='0'){printf("■");}else{if(a[i][j]=='Y'){printf("Y ");}else{printf(" ");}};}printf("┃\n");} printf("┗");for(int i=1;i<=N*2;i++)printf("━");printf("┛"); if(a[x+1][y]=='0'&&a[x-1][y]=='0'&&a[x][y-1]=='0'&&a[x][y+1]=='0'){ cout<<"\n You Lose!\n You get "<<point;exit(0); } } int main(){ srand(time(0)%mod); for(int i=1;i<=N;i++){ for(int j=1;j<=M;j++){ int num=rand()%2; if(num==0)a[i][j]='o'; else a[i][j]='0'; } } for(int i=1;i<=M;i++)a[0][i]=a[N+1][i]='0'; for(int i=1;i<=N;i++)a[i][M+1]=a[i][0]='0'; a[x][y]='Y'; if(a[x+1][y]=='0'&&a[x-1][y]=='0'&&a[x][y-1]=='0'&&a[x][y+1]=='0'){ int num=rand()%4+1; if(num==1)a[x+1][y]='o';if(num==2)a[x-1][y]='o';if(num==3)a[x][y+1]='o';if(num==4)a[x][y-1]='o'; } while(1){ init(); if(GetAsyncKeyState(VK_SPACE)&0x21){ if(key=='0')key='o'; else key='0'; } } }
贪吃蛇(加强版)
#include<iostream> #include<ctime> #include<cstring> #include<cstdlib> #include<windows.h> #pragma GCC diagnostic error "-std=c++11" #pragma GCC optimize(3) #pragma GCC target("avx") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fdelete-null-pointer-checks") using namespace std; const int N=20,M=50,t=10,mod=1000; char a[N+2][M+2],dir[N+2][M+2];//up,down,left,right bool vis[N+2][M+2]; struct node{ int x=N/2,y=M/2; }last,dou; int x=N/2,y=M/2,point,x1,y1,len=1; char key='0'; void end(){cout<<"\n You Lose!\n You get "<<len;exit(0);} void H() { CONSOLE_CURSOR_INFO cursor_info = {1, 0}; SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info); } void check(){ if(GetAsyncKeyState(VK_LEFT)&0x25/*&&dir[x][y]!='r'*/)dir[x][y]='l'; if(GetAsyncKeyState(VK_RIGHT)&0x27/*&&dir[x][y]!='l'*/)dir[x][y]='r'; if(GetAsyncKeyState(VK_UP)&0x29/*&&dir[x][y]!='d'*/)dir[x][y]='u'; if(GetAsyncKeyState(VK_DOWN)&0x31/*&&dir[x][y]!='u'*/)dir[x][y]='d'; } void ff(){ dou.x=rand()%N+1; dou.y=rand()%M+1; if(vis[dou.x][dou.y]==0)return ; ff(); } void move(){ if(dir[x][y]=='u'){ if(vis[x-1][y]==1)end(); int flag=0; if(x-1==dou.x&&y==dou.y){ ff(); flag=1; len++; } a[x][y]='0'; x--; dir[x][y]='u'; a[x][y]='Y'; vis[x][y]=1; if(flag==0){ vis[last.x][last.y]=0; int xx=last.x,yy=last.y; a[xx][yy]='o'; if(dir[last.x][last.y]=='u')last.x--; if(dir[last.x][last.y]=='d')last.x++; if(dir[last.x][last.y]=='l')last.y--; if(dir[last.x][last.y]=='r')last.y++; dir[xx][yy]='0'; } } if(dir[x][y]=='d'){ if(vis[x+1][y]==1)end(); int flag=0; if(x+1==dou.x&&y==dou.y){ ff(); flag=1; len++; } a[x][y]='0'; x++; dir[x][y]='d'; a[x][y]='Y'; vis[x][y]=1; if(flag==0){ vis[last.x][last.y]=0; int xx=last.x,yy=last.y; a[xx][yy]='o'; if(dir[last.x][last.y]=='u')last.x--; if(dir[last.x][last.y]=='d')last.x++; if(dir[last.x][last.y]=='l')last.y--; if(dir[last.x][last.y]=='r')last.y++; dir[xx][yy]='0'; } } if(dir[x][y]=='l'){ if(vis[x][y-1]==1)end(); int flag=0; if(x==dou.x&&y-1==dou.y){ ff(); flag=1; len++; } a[x][y]='0'; y--; dir[x][y]='l'; a[x][y]='Y'; vis[x][y]=1; if(flag==0){ vis[last.x][last.y]=0; int xx=last.x,yy=last.y; a[xx][yy]='o'; if(dir[last.x][last.y]=='u')last.x--; if(dir[last.x][last.y]=='d')last.x++; if(dir[last.x][last.y]=='l')last.y--; if(dir[last.x][last.y]=='r')last.y++; dir[xx][yy]='0'; } } if(dir[x][y]=='r'){ if(vis[x][y+1]==1)end(); int flag=0; if(x==dou.x&&y+1==dou.y){ ff(); flag=1; len++; } a[x][y]='0'; y++; dir[x][y]='r'; a[x][y]='Y'; vis[x][y]=1; if(flag==0){ vis[last.x][last.y]=0; int xx=last.x,yy=last.y; a[xx][yy]='o'; if(dir[last.x][last.y]=='u')last.x--; if(dir[last.x][last.y]=='d')last.x++; if(dir[last.x][last.y]=='l')last.y--; if(dir[last.x][last.y]=='r')last.y++; dir[xx][yy]='0'; } } } void init(){ Sleep(t); H(); system("cls"); check(); move(); printf("■");for(int i=1;i<=N*2+10;i++)printf("■");printf("■\n"); for(int i=1;i<=N;i++){ printf("■"); for(int j=1;j<=M;j++){ if(i==dou.x&&j==dou.y){ printf("$ "); }else{ if(vis[i][j]==1){ if(a[i][j]=='0'){ printf("o "); }else{ printf("O "); } }else{ printf(" "); } } } printf("■\n"); } printf("■");for(int i=1;i<=N*2+10;i++)printf("■");printf("■"); } int main(){ srand(time(0)); for(int i=1;i<=M;i++)a[0][i]=a[N+1][i]=vis[0][i]=vis[N+1][i]='0'; for(int i=1;i<=N;i++)a[i][M+1]=a[i][0]=vis[i][M+1]=vis[i][0]='0'; dir[x][y]='u'; a[x][y]='Y'; ff(); while(1)init(); }
%%%
旧版本oiclass刷赞器
function clickElements() { const elements = [document.querySelector('[aria-label="Upvote"]'), document.querySelector('[aria-label="Downvote"]')]; elements.forEach(el => { if (el) el.click(); }); } setInterval(clickElements, 100);
(async function(UID, tjID, optTp, rptNum) { async function delay(time) { await new Promise(resolve => setTimeout(resolve, time)); } if (UID == -1) { var upBts = document.querySelectorAll('.icon-vote--up'); var downBts = document.querySelectorAll('.icon-vote--down'); if (optTp) for (const button of downBts) button.click(); else for (const button of upBts) button.click(); await delay(100); for (var i = 0; i < rptNum; i++) { for (const button of upBts) button.click(); for (const button of downBts) button.click(); } } else { var nodes = document.querySelectorAll('li.dczcomments__item'); for (const node of nodes) { var title = node.querySelectorAll('div.clearfix')[0]; if (window.location.pathname.charAt(1) !== 'd') var path = `/user/${UID}`; else var path = `/d/${window.location.pathname.split("/")[2]}/user/${UID}` if (title.querySelector(`[href="${path}"]`) != null && !(--tjID)) { var upBt = node.querySelector('.icon-vote--up'); var downBt = node.querySelector('.icon-vote--down'); var bt = [upBt, downBt]; for (var i = 0; i < rptNum / 10; i++) { await delay(500); if (optTp) downBt.click(); else upBt.click(); await delay(1000); for (var j = 0; j < 10; j++) { bt[optTp].click(); // await delay(50); bt[1-optTp].click(); // await delay(50); } } } }; } })(1, 1, 0, 1000); // 首参数为UID,-1自动踩下所有题解 // 第二个是选定用户的第几个题解 // 第三个参数为踩/赞 // 第四个是重复次数
2048
#include<bits/stdc++.h> #include<windows.h> #define int long long using namespace std; const int N=4,xx[4]={0,0,-1,1},yy[4]={-1,1,0,0}; int n=4,a[N+1][N+1],maxn; int change(int a){ int cnt=0; while(a>0){ cnt++;a/=10; } return cnt; } void print(){ system("cls"); for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ maxn=max(maxn,change(a[i][j])); } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(maxn+1)<<a[i][j]; } putchar('\n'); } } void rand_new(){ int x=rand()%4+1,y=rand()%4+1; if(a[x][y]!=0)rand_new(); else a[x][y]=((rand()%7==0)?1:2); } bool find__(){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(a[i][j]==0)return true; for(int k=0;k<4;k++){ if(a[i][j]==a[i+xx[k]][j+yy[k]])return true; } } } return false; } void the_end(){ printf("T");Sleep(10),printf("h");Sleep(10);printf("e");Sleep(10);printf(" e");Sleep(10);printf("n");Sleep(10);printf("d\n");Sleep(10);printf("Y");Sleep(10);printf("o");Sleep(10);printf("u");Sleep(10);printf(" a");Sleep(10);printf("r");Sleep(10);printf("e");Sleep(10);printf(" d");Sleep(10);printf("i");Sleep(10);printf("e");Sleep(10);printf("d");Sleep(10);printf("!"); exit(0); } bool find_(){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++)if(a[i][j]==0)return true; } return false; } void work(int x){ if(x==1){ for(int i=1;i<=n;i++){ int cnt=0,j=1; while(j<=n){ int w=a[i][j]; if(w!=0){ if(j<n&&a[i][j]==a[i][j+1]){ a[i][j]=a[i][j+1]=0; a[i][++cnt]=w*2; j+=2; }else{ a[i][j]=0; a[i][++cnt]=w; j++; } }else j++; } } if(!find__())the_end(); if(find_())rand_new(); } if(x==2){ for(int i=1;i<=n;i++){ int cnt=n+1,j=n; while(j>=1){ int w=a[i][j]; if(w!=0){ if(j>1&&a[i][j]==a[i][j-1]){ a[i][j]=a[i][j-1]=0; a[i][--cnt]=w*2; j-=2; }else{ a[i][j]=0; a[i][--cnt]=w; j--; } }else j--; } } if(!find__())the_end(); if(find_())rand_new(); } if(x==3){ for(int j=1;j<=n;j++){ int cnt=0,i=1; while(i<=n){ int w=a[i][j]; if(w!=0){ if(i<n&&a[i][j]==a[i+1][j]){ a[i][j]=a[i+1][j]=0; a[++cnt][j]=w*2; i+=2; }else{ a[i][j]=0; a[++cnt][j]=w; i++; } }else i++; } } if(!find__())the_end(); if(find_())rand_new(); } if(x==4){ for(int j=1;j<=n;j++){ int cnt=n+1,i=n; while(i>=1){ int w=a[i][j]; if(w!=0){ if(i>1&&a[i][j]==a[i-1][j]){ a[i][j]=a[i-1][j]=0; a[--cnt][j]=w*2; i-=2; }else{ a[i][j]=0; a[--cnt][j]=w; i--; } }else i--; } } if(!find__())the_end(); if(find_())rand_new(); } print(); } void check(){ if(GetAsyncKeyState(VK_LEFT)&0x25)work(1); if(GetAsyncKeyState(VK_RIGHT)&0x27)work(2); if(GetAsyncKeyState(VK_UP)&0x29)work(3); if(GetAsyncKeyState(VK_DOWN)&0x31)work(4); } signed main(){ srand(time(NULL)); rand_new();rand_new();print(); while(1){ check(); Sleep(100); } }
2048(优化版)
by 2022tysc0819
#include<bits/stdc++.h> #include<windows.h> #define int long long using namespace std; const int N=4; int dx[]={0,1,0,-1},dy[]={1,0,-1,0}; int maxn,n=4,mp[N+1][N+1]; map<int,int>col; int wcnt(int x){int cnt=0;while(x>0){++cnt;x/=10;}return cnt;} void mid(int x,int d){if(x==0){cout<<" ";return;}int w=wcnt(x);if((d-w)%2){for(int i=1;i<=(d-w)/2+1;i++){cout<<" ";}}else{for(int i=1;i<=(d-w)/2;i++){cout<<" ";}}cout<<x;for(int i=1;i<=(d-w)/2;i++){cout<<" ";}} void goodcls(){HANDLE handle=GetStdHandle(STD_OUTPUT_HANDLE);COORD coord={0,0};SetConsoleCursorPosition(handle,coord);} void out(string s,int id=7,int tim=0){HANDLE handle=::GetStdHandle(STD_OUTPUT_HANDLE);CONSOLE_SCREEN_BUFFER_INFO info;GetConsoleScreenBufferInfo(handle,&info);WORD colorBak=info.wAttributes;SetConsoleTextAttribute(handle,id);for(int i=0;i<(int)s.size();i++){cout<<s[i];Sleep(tim);}SetConsoleTextAttribute(handle,colorBak);return;} void init(){col[2]=3;col[4]=4;col[8]=6;col[16]=7;col[32]=8;col[64]=10;col[128]=11;col[256]=12;col[512]=14;col[1024]=3;col[2048]=4;col[4096]=6;col[8192]=7;col[16384]=8;col[32768]=10;col[65536]=11;col[131072]=12;col[262144]=14;col[524288]=3;col[1048576]=4;col[2097152]=6;col[4194304]=7;col[8388608]=8;col[16777216]=10;col[33554432]=11;col[67108864]=12;col[134217728]=14;col[268435456]=3;col[536870912]=4;col[1073741824]=6;col[2147483648]=7;} void print(){goodcls();HANDLE handle=::GetStdHandle(STD_OUTPUT_HANDLE);CONSOLE_SCREEN_BUFFER_INFO info;GetConsoleScreenBufferInfo(handle,&info);WORD colorBak=info.wAttributes;for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)maxn=max(maxn,wcnt(mp[i][j]));out(" \n",0xff);for(int i=1;i<=n;i++){for(int r=1;r<=5;r++){for(int j=1;j<=n;j++){SetConsoleTextAttribute(handle,16*col[mp[i][j]]);out(" ",0xff);if(r==3){mid(mp[i][j],10);}else cout<<" ";SetConsoleTextAttribute(handle,colorBak);}out(" ",0xff);cout<<"\n";}out(" \n",0xff);}out("2048 Game Cpp Version.\n");} void randn(){int x=rand()%4+1,y=rand()%4+1;if(mp[x][y]!=0)randn();else mp[x][y]=((rand()%7==0)?4:2);} bool findd(){for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){if(mp[i][j]==0){return 1;}for(int k=0;k<4;k++)if(mp[i][j]==mp[i+dx[k]][j+dy[k]])return 1;}return 0;} bool findw(){for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(mp[i][j]==2147483648){return 1;}return 0;} void thend(){out("The end.\nYou are died!\n\n",7,10);system("pause");} void thewin(){out("The end.\nYou are win!\n2147483648 has been craft!\n\n",7,10);system("pause");} bool fidd(){for(int i=1;i<=n;i++){for(int j=1;j<=n;j++)if(mp[i][j]==0)return 1;}return 0;} void work(int x){ if(x==1){for(int i=1;i<=n;i++){int cnt=0,j=1;while(j<=n){int w=mp[i][j];if(w!=0){if(j<n&&mp[i][j]==mp[i][j+1]){mp[i][j]=mp[i][j+1]=0;mp[i][++cnt]=w*2;j+=2;}else{mp[i][j]=0;mp[i][++cnt]=w;j++;}}else j++;}}if(!findd())thend();if(fidd())randn();} if(x==2){for(int i=1;i<=n;i++){int cnt=n+1,j=n;while(j>=1){int w=mp[i][j];if(w!=0){if(j>1&&mp[i][j]==mp[i][j-1]){mp[i][j]=mp[i][j-1]=0;mp[i][--cnt]=w*2;j-=2;}else{mp[i][j]=0;mp[i][--cnt]=w;j--;}}else j--;}}if(!findd())thend();if(fidd())randn();} if(x==3){for(int j=1;j<=n;j++){int cnt=0,i=1;while(i<=n){int w=mp[i][j];if(w!=0){if(i<n&&mp[i][j]==mp[i+1][j]){mp[i][j]=mp[i+1][j]=0;mp[++cnt][j]=w*2;i+=2;}else{mp[i][j]=0;mp[++cnt][j]=w;i++;}}else i++;}}if(!findd())thend();if(fidd())randn();} if(x==4){for(int j=1;j<=n;j++){int cnt=n+1,i=n;while(i>=1){int w=mp[i][j];if(w!=0){if(i>1&&mp[i][j]==mp[i-1][j]){mp[i][j]=mp[i-1][j]=0;mp[--cnt][j]=w*2;i-=2;}else{mp[i][j]=0;mp[--cnt][j]=w;i--;}}else i--;}}if(!findd())thend();if(fidd())randn();} print();if(findw())thewin(); } void chk(){if(GetAsyncKeyState(VK_LEFT)&0x25){work(1);}if(GetAsyncKeyState(VK_RIGHT)&0x27){work(2);}if(GetAsyncKeyState(VK_UP)&0x29){work(3);}if(GetAsyncKeyState(VK_DOWN)&0x31){work(4);}} signed main(){ srand(time(0));init(); randn();randn();print(); while(1){chk();Sleep(10);} return 0; }
JC神器
-
最近活动
- 验题 IOI
- 第五届oiClass信息学夏令营day8作业-for循环专题练习2 作业
- 2024春季班class8-多维&差值DP 课后作业 作业
- 【oiClass公益赛】2024CSP-J模拟赛#18「WZA Round #2」 OI
- 2024春季班class8-多维&差值DP 随堂练习 作业
- 2024春季班class7-倍增-ST算法 课后作业 作业
- 2024春季班class7-倍增-ST算法 随堂练习 作业
- 2024春季班class6-区间型动态规划2-区间合并 课后作业 作业
- 2024春季班class6-区间型动态规划2-区间合并 随堂练习 作业
- 2024春季班class5-区间分割型动态规划 课后作业 作业
- 2024春季班class5-区间分割型动态规划 随堂练习 作业
- 【oiClass公益赛】2024CSP-J模拟赛#08 || For Riddles, For Wonders OI
- 2024春季班class4-背包型动态规划2课后作业 作业
- 2024春季班class4-背包型动态规划2随堂练习 作业
- 【oiClass公益赛】2024CSP-J模拟赛#20 OI
- 2024春季班class3-背包型动态规划1课后作业 作业
- 2024春季班class3-背包型动态规划1随堂练习 作业
- 【oiClass公益赛】2024CSP-J模拟赛#15 OI
- 2024春季班class2-二维动规&最长公共子序列课后作业 作业
- 2024春季班class2-二维动规&最长公共子序列随堂练习 作业
- 【oiClass公益赛】2024CSP-J模拟赛#06 || LSZOI #01 OI
- 【oiClass公益赛】2024CSP-J模拟赛#17 OI
- 2024春季班class1-一维动规&最长不下降子序列课后作业 作业
- 2024春季班class1-一维动规&最长不下降子序列随堂练习 作业
- 【oiClass 公益赛】2024 CSP-J 模拟赛 #13 & XYZ Round 1 OI
- 【oiClass公益赛】2024CSP-J模拟赛#10 OI
- 【oiclass 公益赛】2024 CSP-J 模拟赛 #12 OI
- 【oiClass公益赛】2024CSP-J模拟赛#14 OI
- 【oiClass公益赛】2024CSP-J模拟赛#07 OI
- 【oiClass公益赛】2024CSP-J模拟赛#16 OI
- 【oiClass公益赛】2024 CSP-J 模拟赛 #04 OI
- 【oiClass公益赛】2024CSP-J模拟赛#03 OI
- 【oiClass公益赛】2024CSP-J模拟赛 #05 OI
- 2023-2024学年冬令营Class6-双指针 作业
- 2023-2024学年冬令营Class4-二分搜索2 作业
- 2023-2024学年冬令营Class3-二分搜索1 作业
- 2023-2024学年冬令营Class1-广搜2 作业
- 2023-2024学年冬令营Class1-广搜1 作业
- 张晋嘉、倪穗霆杂题 作业
- 2023学年秋季班_模拟测试11 OI
- 2023学年秋季班_模拟测试09 OI
- 2023学年秋季班_模拟测试08 OI
- 2023学年秋季班_模拟测试07 OI
- 2023学年秋季班_模拟测试06 OI
- 2023学年秋季班_模拟测试05 OI
- 2023年秋季营lesson5作业-2023秋季营阶段测试1(仅供改题) 作业
- 【oiClass公益赛】2023CSPJ模拟赛#04 OI
- 【oiClass公益赛】2023CSPJ模拟赛#03 OI
- 【oiClass公益赛】2023CSPJ模拟赛#02 OI
- 【oiClass公益赛】2023CSPJ模拟赛#01 OI
- 2023学年秋季班_模拟测试04 OI
- 2023年秋季营lesson4作业-排序&枚举 作业
- 第五届oiClass信息学夏令营day22作业-结构体和函数 作业
- 2023新初一字符串小测 IOI
- 2023学年秋季班_模拟测试02 OI
- 2023年秋季营lesson2作业-字符数组&字符串 作业
- 2023学年秋季班_模拟测试01 OI
- 2023年秋季营lesson1作业-二维数组 作业
- 新初一暑期培训测试选拔 OI
- 新初一夏令营day12作业-一维数组3 作业
- 新初一夏令营day11作业-一维数组2 作业
- 新初一夏令营day10作业-一维数组1 作业
- 夏令营day18作业-一维数组3 作业
- 新初一夏令营day9作业-多重循环 作业
- 新初一夏令营day8作业-while语句2 作业
- 新初一夏令营day7作业-while语句1 作业
- 新初一夏令营第一周模拟测试 OI
- 新初一夏令营day6作业-for语句3 作业
- 新初一夏令营day5作业-for语句2 作业
- 新初一夏令营day4作业-for语句1 作业
- 新初一夏令营day3作业-if语句 作业
- 新初一夏令营day2作业-表达式 作业
- 新初一夏令营day1作业-C++程序结构 作业
- 第五届oiClass信息学夏令营day6作业-for语句3 作业
- 2022TYSC线下选拔赛 IOI
- 2022TYSC线上选拔赛 OI
- 2022TYSC模拟测试04 OI
- 2022TYSC模拟测试03 OI
- 2022TYSC模拟测试02 IOI
- 2022TYSC模拟测试01 IOI
-
Stat
-
Rating