Drlinga

分类

/ 注册

全部文章（共23篇）

题解 | 求最大最小数

#include <stdio.h> #include <stdlib.h> #include <limits.h> void quick_sort(int*arr,int l,int r); void swap(int*a,int*b); int main(...

2025-05-15

0 26

题解 | 求最大最小数

#include <stdio.h> #include <stdlib.h> void quick_sort(int*arr,int l,int r); void swap(int*a,int*b); int main() { int n; while (...

2025-05-15

0 26

题解 | 二叉树遍历

#include <stdio.h> #include <stdlib.h> typedef struct node { char c; struct node* left; struct node* right; } BinaryTreeNode;...

2025-05-13

0 47

题解 | 二叉树遍历

#include <stdio.h> #include <stdlib.h> typedef struct node { char c; struct node* left; struct node* right; } BinaryTreeNode;...

2025-05-13

0 35

题解 | 球的半径和体积

#include <stdio.h> #include <math.h> int main() { int x0,y0,z0,x1,y1,z1; while(scanf("%d %d %d %d %d %d",&x0,&y...

2025-05-13

0 28

题解 | 成绩排序

#include <stdio.h> #include <stdlib.h> typedef struct{ int ID; int score; }Grade; void printGrade(Grade g); void sort(Grade*grad...

2025-05-13

0 28

题解 | 整数拆分

#include <iostream> #include <vector> #define MOD 1000000000 using namespace std; int countPartitions(int n); int main() { int n; ...

2025-05-13

0 24

题解 | 质因数的个数

#include <stdio.h> #include <math.h> int primeFactorCount(int n); int main() { int n; while(scanf("%d",&n)!=EOF){ ...

2025-05-12

0 25

题解 | 手机键盘

#include <stdio.h> int keybord[26]={1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,8,8,8,8}; int pos[26]={1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,...

2025-05-12

0 26

题解 | 代理服务器

#include <iostream> #include <vector> #include <string> using namespace std; int findMinSwitches(const vector<string>& pro...

2025-05-12

0 24