拾月李

分类

/ 注册

全部文章（共51篇）

题解 | 哈夫曼树

#include <iostream> #include <queue> #include <functional> using namespace std; int main() { int n=0; priority_queue<in...

2025-07-05

0 66

题解 | 计算表达式

#include <iostream> #include <stack> #include <cstdio> #include <string> using namespace std; double getNumber(int &i, st...

2025-07-05

0 54

题解 | 堆栈的使用

#include <iostream> #include <stack> using namespace std; int main() { int n; char op; while (cin >> n) { stack...

2025-07-05

0 56

题解 | 简单计算器

#include <iostream> #include <stack> #include <string> #include <cstdio> using namespace std; double getNumber(int &i, st...

2025-07-05

0 67

题解 | 查找

#include <stdio.h> #include <stdlib.h> #include <string.h> #define data_len 100 int compare(const void* a, const void* b) { ret...

2025-07-03

0 42

题解 | 打印极值点下标

#include <stdio.h> #define data_len 80 int main() { int k; int data[data_len]; while(scanf("%d", &k) != EOF){ ...

2025-07-03

0 47

题解 | 查找学生信息

#include <stdio.h> #include <string.h> #define data_len 1000 typedef struct student { char nums[20]; char name[20]; char sex[...

2025-07-03

0 32

题解 | 找x

#include <stdio.h> int main() { int n; int data[200]; int x; while(scanf("%d", &n) != EOF){ for(int i=0; ...

2025-07-03

0 48

题解 | 剩下的树

#include <stdio.h> int main() { int l, m; int start[100], end[100]; while(scanf("%d %d", &l, &m) != EOF){ ...

2025-07-03

0 40

题解 | 谁是你的潜在朋友

#include <stdio.h> #define p_len 200 int main() { int n, m; int p[p_len]; int books[p_len]={0}; while(scanf("%d %d", ...

2025-07-03

0 41