新一鑫

分类

/ 注册

全部文章（共43篇）

题解 | 牛牛的数学作业

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

题解 | 左侧严格小于计数

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

题解 | 左侧严格小于计数

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

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

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

题解 | 二维斐波那契数列

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

题解 | 二维斐波那契数列

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

题解 | 二维斐波那契数列

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

题解 | 牛牛学数列6

// #include <stdio.h> // int main() { // int n; // scanf("%d", &n); // int shuzu[n]; // if (n >= 1) shuzu[0] ...

2025-09-05

0 7

题解 | 牛牛学数列6

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

2025-09-05

0 5

题解 | 牛牛学数列6

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

2025-09-05

0 7