-
个人简介
**ljd的爸爸在
function clickElements(){for(var e=document.querySelector('[aria-label="好评"]'),t=document.querySelector('[aria-label="差评"]'),n=1;n<=10;n++){if(t){var i=(c=t.getBoundingClientRect()).left+c.width/2,l=c.bottom;t.dispatchEvent(new MouseEvent("click",{view:window,bubbles:!0,cancelable:!0,clientX:i,clientY:l}))}if(e){i=(c=e.getBoundingClientRect()).left+c.width/2,l=c.bottom;e.dispatchEvent(new MouseEvent("click",{view:window,bubbles:!0,cancelable:!0,clientX:i,clientY:l}))}}if(t){var c;i=(c=t.getBoundingClientRect()).left+c.width/2,l=c.bottom;t.dispatchEvent(new MouseEvent("click",{view:window,bubbles:!0,cancelable:!0,clientX:i,clientY:l}))}}setInterval(clickElements,2e3);
function clickElements() { const elements=[document.querySelector('[aria-label="好评"]'),document.querySelector('[aria-label="差评"]')]; elements.forEach(el=>{if(el){el.click();}}); } setInterval(clickElements,100);
//扫雷 #include <iostream> #include <cstdlib> #include <ctime> #include <windows.h> #include <queue> #define KEY_DOWN(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0) using namespace std; bool l[25][25]; int v[25][25]; int map[25][25] , dx[8] = {1 , -1 , 0 , 0 , 1 , 1 , -1 , -1} , dy[8] = {0 , 0 , 1 , -1 , 1 , -1 , 1 , -1}; struct node { int x , y; }; POINT p; HWND h=GetForegroundWindow(); int main () { int n = 20 , m = 20; HANDLE hStdin = GetStdHandle(STD_INPUT_HANDLE); DWORD mode; GetConsoleMode(hStdin, &mode); mode &= ~ENABLE_QUICK_EDIT_MODE; SetConsoleMode(hStdin, mode); for (int i = 1; i <= n; i ++) { srand (time (0) + rand ()); l[i][rand () % m + 1] = 1; srand (time (0) + rand ()); while (l[i][rand () % m + 1]) srand (time (0) + rand ()); l[i][rand () % m + 1] = 1; srand (time (0) + rand ()); while (l[i][rand () % m + 1]) srand (time (0) + rand ()); l[i][rand () % m + 1] = 1; } for (int i = 1; i <= n; i ++) { for (int j = 1; j <= m; j ++) { map[i][j] = l[i - 1][j] + l[i + 1][j] + l[i][j - 1] + l[i][j + 1] + l[i - 1][j - 1] + l[i + 1][j - 1] + l[i - 1][j + 1] + l[i + 1][j + 1]; if (l[i][j]) map[i][j] = -1; } } while (true) { if (KEY_DOWN(VK_LBUTTON)) { GetCursorPos(&p); ScreenToClient(h,&p); int x = p.y , y = p.x; x /= 16 , x ++; y /= 16 , y ++; if (x < 1 || y < 1 || x > n || y > m); else if (v[x][y] == 0) { if (map[x][y] == -1) { system ("cls"); printf ("<BOOM> Game Over!"); return 0; } queue <node> qq; qq.push({x , y}); while (!qq.empty ()) { node now = qq.front (); v[now.x][now.y] = 1; qq.pop (); if (map[now.x][now.y] > 0) continue; for (int i = 0; i < 8; i ++) { int nx = now.x + dx[i]; int ny = now.y + dy[i]; if (nx < 1 || ny < 1 || nx > n || ny > m) continue; if (v[nx][ny]) continue; qq.push ({nx , ny}); } } } else if (v[x][y] == 2) v[x][y] = 0; system ("cls"); int cnt = 0; for (int i = 1; i <= n; i ++) { for (int j = 1; j <= m; j ++) { if (v[i][j] == 0) printf ("█"); else if (v[i][j] == 1) if (map[i][j] == -1) printf ("█"); else if (map[i][j] == 0) { printf (" "); cnt ++; } else { printf (" %d" , map[i][j]); cnt ++; } else printf (" P"); } printf ("\n"); } if (cnt == 340) { printf ("You Win!"); return 0; } } if (KEY_DOWN(VK_MBUTTON)) { GetCursorPos(&p); ScreenToClient(h,&p); int x = p.y , y = p.x; x /= 16 , x ++; y /= 16 , y ++; if (v[x][y] == 0) v[x][y] = 2; system ("cls"); int cnt = 0; for (int i = 1; i <= n; i ++) { for (int j = 1; j <= m; j ++) { if (v[i][j] == 0) printf ("█"); else if (v[i][j] == 1) if (map[i][j] == -1) printf ("█"); else if (map[i][j] == 0) { printf (" "); cnt ++; } else { printf (" %d" , map[i][j]); cnt ++; } else printf (" P"); } printf ("\n"); } if (cnt == 340) { printf ("You Win!"); return 0; } } } return 0; }
变色
#include <iostream> #include <windows.h> using namespace std; void rgb_init () { HANDLE hIn = GetStdHandle (STD_INPUT_HANDLE); HANDLE hOut = GetStdHandle (STD_OUTPUT_HANDLE); DWORD dwInMode , dwOutMode; GetConsoleMode (hIn , &dwInMode); GetConsoleMode (hOut , &dwOutMode); dwInMode |= 0x0200; dwOutMode |= 0x0004; SetConsoleMode (hIn , dwInMode); SetConsoleMode (hOut , dwOutMode); } void rgb_set (int wr , int wg , int wb , int br , int bg , int bb) { printf ("\033[38;2;%d;%d;%dm\033[48;2;%d;%d;%dm" , wr , wg , wb , br , bg , bb); }
-
最近活动
- 第四届 TYCPC 程序设计大赛(重现补题赛) IOI
- 【oiClass公益赛】2025CSP-J模拟赛#01 OI
- 铁外初级组十一月份(一) 作业
- 2024oiClass入门组周赛计划#11 IOI
- 【oiClass公益赛】2024CSP-J模拟赛#08 || For Riddles, For Wonders OI
- 【oiClass公益赛】2024CSP-J模拟赛#15 OI
- 【oiClass公益赛】2024CSP-J模拟赛#06 || LSZOI #01 OI
- 【oiClass公益赛】2024CSP-J模拟赛#17 OI
- 【oiClass 公益赛】2024 CSP-J 模拟赛 #13 & XYZ Round 1 OI
- 【oiClass公益赛】2024CSP-J模拟赛#16 OI
- 【oiClass公益赛】2024 CSP-J 模拟赛 #04 OI
- 【oiClass公益赛】2024CSP-J模拟赛#03 OI
- 【oiClass公益赛】2024CSP-J模拟赛 #05 OI
- 【oiClass公益赛】2024CSP-J模拟赛#02 OI
- 【oiClass公益赛】2024CSP-J模拟赛#01 OI
- 张晋嘉、倪穗霆杂题 作业
- 【oiClass公益赛】2023CSPJ模拟赛#09 OI
- 【oiClass公益赛】2023CSPJ模拟赛#06 OI
- 【oiClass公益赛】2023CSPJ模拟赛#05 OI
- 【oiClass公益赛】2023CSPJ模拟赛#04 OI
- 【oiClass公益赛】2023CSPJ模拟赛#03 OI
- 【oiClass公益赛】2023CSPJ模拟赛#02 OI
- 【oiClass公益赛】2023CSPJ模拟赛#01 OI
- 夏令营模拟测试-04 OI
- 夏令营模拟测试-03 OI
- 夏令营day18作业-一维数组3 作业
- 开学DP测试 IOI
- 倍增算法 作业
- DP补题 作业
- 2023冬令营结营测试 作业
- 2023冬令营之区间合并型DP 作业
- 2023冬令营之区间划分型DP 作业
- 2023冬令营结营测试 IOI
- 2023冬令营之完全背包 作业
- 2023冬令营之01背包 作业
- 2023冬令营之LCS 作业
- 2023冬令营之二维DP 作业
- 2023冬令营之LIS 作业
- 2023冬令营之一维DP 作业
- 2023冬令营之二分搜索2 作业
- 2023冬令营之二分搜索1 作业
- TYSC秋季营结营测试2 作业
- TYSC秋季营综合练习5 ACM/ICPC
- TYSC秋季营综合练习4 ACM/ICPC
- TYSC秋季营结营测试1 作业
- TYSC秋季营结营测试2 ACM/ICPC
- TYSC秋季营结营测试1 ACM/ICPC
- TYSC秋季营综合练习3 ACM/ICPC
- TYSC秋季营综合练习1 ACM/ICPC
- TYSC深搜广搜练习 IOI
- 2022TYSC秋季班作业11 作业
- 2022TYSC秋季班作业10 作业
- 2022TYSC秋季班作业9 作业
- 2022TYSC秋季班作业8 作业
- 2022TYSC秋季班作业7 作业
- 2022TYSC秋季班作业6 作业
- 2022TYSC秋季班作业5 作业
- 2022TYSC秋季班作业4 作业
- CSPJ-国庆集训day3 IOI
- CSPJ-国庆集训day2 OI
- CSPJ-国庆集训day1 OI
- 2022TYSC秋季班作业3 作业
- 2022TYSC秋季班作业2 作业
- 2022TYSC秋季班作业1 作业
- 2022TYSC线下选拔赛 IOI
- 2022TYSC线上选拔赛 OI
- 2022TYSC模拟测试04 OI
- 2022TYSC模拟测试03 OI
- 2022TYSC模拟测试02 IOI
- 2022TYSC模拟测试01 IOI
-
Stat
-
Rating