无聊的劳伦斯在做测评

分类

/ 注册

全部文章（共124篇）

题解 | 斐波那契数列

#include <stdio.h> //递归 int Fsequence(int n) { if (0 == n) { return 0; } if (1 == n) { return 1; } return Fsequence(n - 1) + Fsequence(...

2026-04-08

0 27

题解 | 小红的方神题spj

#include <stdio.h> #include<stdlib.h> typedef struct List { int date; struct List* next; }List; //在位置i处添加一个数 int Add(List* L, int i, in...

2026-04-08

0 36

题解 | rin和快速迭代

#include <stdio.h> int divisor(long long x) { double a = 2.0; int i = 1; int count = 0; while (i < a) { // printf("i=%d", i)...

2026-04-02

0 32

题解 | 回文日期

#include <stdio.h> int leap_year(int year) { if (year % 4 == 0 && year % 100 !=0) { return 1; } else if (year % 400 == 0) { retu...

2026-03-27

0 36

题解 | 铺地毯

#include <stdio.h> int main() { int n = 0; scanf("%d", &n); int arr[n][4]; for (int i = 0; i < n; i++) { for (int j = 0;...

2026-03-26

0 26

题解 | 小红的不动点构造

#include <stdio.h> int main() { int n = 0; int k = 0; scanf("%d %d", &n, &k); int remember = k + 1; if (k > n || n - ...

2026-03-25

0 31

题解 | 小红的异或构造

#include <stdio.h> //还原测试数据的输出 int main() { int n = 0; scanf("%d", &n); int a0 = n + 2; int x = 0; for (int i = 1; i <= n...

2026-03-25

1 28

题解 | 构造序列

#include <stdio.h> int main() { int m = 0; int n = 0; scanf("%d %d", &m, &n); if (m > n) { printf("%d", 2 ...

2026-03-25

0 32

题解 | 构造C的歪

#include <stdio.h> int main() { int a = 0; int b = 0; scanf("%d %d", &a, &b); int c = 0; if ((a + b) % 2 == 0) { c = (...

2026-03-25

0 35

题解 | 小红的签到题

#include <stdio.h> int main() { int n = 0; scanf("%d", &n); printf("x_"); for (int i = 2; i < n; i++) { printf...

2026-03-25

0 27