无聊的劳伦斯在做测评
无聊的劳伦斯在做测评
全部文章
分类
归档
标签
去牛客网
登录
/
注册
无聊的劳伦斯在做测评的博客
全部文章
(共71篇)
题解 | 复读机
#include <stdio.h> #include <stdlib.h> int include_dot(char* str) { for (int i = 0;str[i] != '\0'; i++) { if (str[i] == '.') { ret...
2026-03-16
0
4
题解 | 牛牛学说话之-字符串
#include <stdio.h> int main() { char s[10000]; scanf("%s", &s); printf("%s", s); return 0; }
2026-03-16
0
4
题解 | 二维斐波那契数列
#include <stdio.h> int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m); long long arr[877][877] = { 1 }; long long...
2026-03-16
0
3
题解 | 杨辉三角
#include <stdio.h> int main() { int n = 0; int arr1[34] = { 1 }; int arr2[34] = { 1 }; scanf("%d", &n); for (int i = 1; i &l...
2026-03-13
0
6
题解 | 有序序列合并
#include <stdio.h> int main() { int n = 0; int m = 0; int arr_n[1000] = {0}; int arr_m[1000] = {0}; int arr_sum[2000] = { 0 }; int i = 0;...
2026-03-13
0
5
题解 | 序列中整数去重
#include <stdio.h> int main() { int arr[30] = { 0 }; int n = 0; int count = 0; scanf("%d", &n); for (int i = 0; i < n; i+...
2026-03-13
0
7
题解 | 左侧严格小于计数
#include <stdio.h> int main() { int arr[100] = { 0 }; int n = 0; scanf("%d", &n); int count = 0; for (int i = 0; i < n; i...
2026-03-13
0
7
题解 | 神秘石像的镜像序列
#include <stdio.h> int main() { int arr[100] = { 1 }; scanf("%d", &arr[0]); for (int i = 0; arr[i] != 0; i++) { scanf("...
2026-03-13
0
4
题解 | 牛牛学数列6
#include <stdio.h> int Add(int x) { if (x == 1) { return 0; } if (2 == x || 3 == x) { return 1; } return Add(x - 3) + 2 * Add(x - 2) +...
2026-03-12
1
7
题解 | 逆序输出
#include <stdio.h> int main() { int arr[10] = {0}; for (int i = 0; i < 10; i++) { scanf("%d", &arr[i]); } for (int i = 9...
2026-03-12
0
9
首页
上一页
1
2
3
4
5
6
7
8
下一页
末页