无聊的劳伦斯在做测评

分类

/ 注册

全部文章（共124篇）

题解 | 区间翻转

#include <stdio.h> #include <stdlib.h> typedef struct Node { struct Node* before; struct Node* next; int data; }Node; typedef struct ...

2026-04-29

0 27

题解 | 判断质数

#include <stdio.h> int isqrt(int n) { if (n <= 1) { return n; } int x = n >> 1; int y = (x + (n / x)) >> 1; while (y <...

2026-04-28

0 25

题解 | 小红与奇数

#include <stdio.h> int main() { //1是任何数的因子，所有偶数满足YES //没有有偶数因子的奇数为NO int x = 0; scanf("%d", &x); if (x % 2 == 0) { //偶数全部Y...

2026-04-27

0 18

题解 | 【模板】双端队列

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

2026-04-21

0 21

题解 | 【模板】双端队列

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

2026-04-21

0 26

题解 | 机器翻译

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

2026-04-17

0 31

题解 | 【模板】队列操作

#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 30

题解 | 点击消除

#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 29

题解 | 【模板】栈的操作

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

2026-04-15

0 31

题解 | 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 40