新鑫念念啥都整

分类

/ 注册

全部文章（共94篇）

题解 | 斗兽棋

#include <stdio.h> int main() { char niuniu[10], niumei[10]; scanf("%s", niuniu); scanf("%s", niumei); if ...

2025-09-07

0 40

题解 | 年轻人不讲5的

// #include <stdio.h> // int main() { // char name[1000001]; // scanf("%s", name); // for (int i = 0; name[i] != '\0'; i...

2025-09-07

0 25

题解 | 杨辉三角

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

2025-09-07

0 51

题解 | 矩阵转置

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

2025-09-07

0 38

题解 | 上三角矩阵判定

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

2025-09-07

0 27

题解 | 单组_二维数组

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

2025-09-07

0 25

题解 | 校门外的树

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

2025-09-07

0 29

题解 | 约瑟夫环

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

题解 | 记数问题

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

题解 | 数组计数维护

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

2025-09-06

0 41