诗酒田园
诗酒田园
全部文章
分类
归档
标签
去牛客网
登录
/
注册
诗酒田园的博客
全部文章
(共41篇)
题解 | KiKi定义电子日历类
#include <stdio.h> int main() { int year = 0; int month = 0; int date = 0; while (scanf("%d %d %d", &year, &month, &a...
2026-02-14
0
28
题解 | KiKi学结构体和指针
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { int arr[n]; int i = 0; //...
2026-02-14
0
30
题解 | KiKi去重整数并排序
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { int arr1[n]; int i = 0; /...
2026-02-14
0
28
题解 | KiKi去重整数并排序
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { int i = 0; int m = 0; in...
2026-02-14
0
24
题解 | KiKi求质数个数
#include <stdio.h> int main() { int a = 100; int i = 0; int count = 0; int j = 0; for (i = 100; i < 1000; i++) { ...
2026-02-13
0
26
题解 | KiKi学程序设计基础
#include <stdio.h> int main() { printf("printf(\"Hello world!\\n\");\ncout << \"Hello world!\" << end...
2026-02-13
0
30
题解 | 小乐乐查找数字
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { //输入数字串 int arr[n]; ...
2026-02-13
0
30
题解 | 小乐乐找最大数
#include <stdio.h> int main() { int arr[4]; while (scanf("%d", &arr[0]) == 1) { int max = arr[0]; int i ...
2026-02-13
0
29
题解 | 小乐乐转换成绩
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { if (n >= 0 && n <= 1...
2026-02-13
0
23
题解 | 小乐乐计算函数
#include <stdio.h> int max3(int a, int b, int c) { int max = a; if (b > max) max = b; if (c > max) max = c; ...
2026-02-13
0
28
首页
上一页
1
2
3
4
5
下一页
末页