新一鑫

分类

/ 注册

全部文章（共88篇）

题解 | 校门外的树

#include <limits.h> #include <stdio.h> int main() { int L, M; scanf("%d %d", &L, &M); //总共有L + 1棵树 //M...

2025-09-07

0 13

题解 | 约瑟夫环

#include <stdio.h> int main() { int n, k, m; scanf("%d %d %d", &n, &k, &m); int alive[n]; for (int i...

2025-09-06

0 13

题解 | 记数问题

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

2025-09-06

0 18

题解 | 数组计数维护

#include <stdio.h> int main() { int T; scanf("%d", &T); while (T--) { int n, k; scanf("%d %d&quo...

2025-09-06

0 18

题解 | 牛牛的数学作业

// #include <stdio.h> // #include <stdlib.h> // int cmp(const void *a, const void *b){ // return *(int *)a - *(int *)b; // } // int m...

2025-09-06

0 19

题解 | 牛牛的数学作业

#include <stdio.h> #include <stdlib.h> int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b; } int main() { //试卷数量...

2025-09-06

0 17

题解 | 左侧严格小于计数

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

2025-09-06

0 21

题解 | 左侧严格小于计数

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

2025-09-06

0 16

题解 | 神秘石像的镜像序列

#include <stdio.h> int main() { int a; scanf("%d", &a); int sum = 1, xiabiao = 0; int shuzu[100]; while (a &a...

2025-09-06

0 17

题解 | 二维斐波那契数列

#include <stdio.h> #define mod 1000000007 int main() { int n, m; scanf("%d %d", &n, &m); int shuzu[n + 1][m + 1]...

2025-09-06

0 16