无聊的劳伦斯在做测评

分类

/ 注册

全部文章（共121篇）

题解 | 【模板】双端队列

//优化版双端队列 #include <stdio.h> #define MAXSIZE 262144 typedef struct Queue { int data[MAXSIZE]; int front, back, length; }Queue; inline int r...

2026-04-21

0 9

题解 | 【模板】双端队列

#include <stdio.h> #include <assert.h> #define MAXSIZE 200000 typedef struct Queue { int data[MAXSIZE]; int front, back, length; }Queue;...

2026-04-21

0 7

题解 | 机器翻译

#include<stdlib.h> #include<stdio.h> typedef struct Queue { int date; struct Queue* next; }Queue; typedef struct{ int length; struct ...

2026-04-17

0 14

题解 | 【模板】队列操作

#include <stdio.h> #define MaxSize 100001 typedef struct { int date[MaxSize]; int front, rear; }Squeue; int EnQueue(Squeue* q, int e) { if ...

2026-04-17

0 12

题解 | 点击消除

#include<stdlib.h> #include<stdio.h> typedef struct Stack { char date; struct Stack* next; }Stack; void push(Stack* stacktop, char e) {...

2026-04-16

0 14

题解 | 【模板】栈的操作

#include<stdio.h> #include<string.h> #include<stdlib.h> typedef struct Stack { int date; struct Stack* before; struct Stack* end...

2026-04-15

0 18

题解 | x_to_y_2

#include <stdio.h> int main() { int T = 0; scanf("%d", &T); while (T--) { long long x = 0; long long ...

2026-04-14

0 22

题解 | 【模板】位运算Ⅲ ‖ 混合运算

#include <stdio.h> unsigned int Left(unsigned int x, int p) { int num = 1 << 12; num = num - 1; x = x << p; x = num & x; r...

2026-04-13

0 19

题解 | 76选数

#include <stdio.h> int main() { unsigned long long n = 0; scanf("%llu", &n); unsigned long long a = 1; a = a << 63; in...

2026-04-10

0 20

题解 | 二进制不同位数

#include <stdio.h> int main() { int m = 0; int n = 0; scanf("%d %d", &m, &n); int count = 0; m = m ^ n; for (int i =...

2026-04-10

0 26