拾月李

分类

/ 注册

全部文章（共51篇）

题解 | Digital Roots

#include <iostream> using namespace std; int main() { int n; while (cin >> n) { cout << (n - 1) % 9 + 1 << en...

2025-07-07

0 47

题解 | 继续畅通工程

#include <iostream> #include <algorithm> using namespace std; int village[101]; typedef struct Edge{ int a, b; int cost; int...

2025-07-07

0 70

题解 | 最大公约数

#include <iostream> using namespace std; int main() { int a, b, r; while (cin >> a >> b) { while(b > 0){ ...

2025-07-06

0 77

题解 | 最短路径问题

#include <cmath> #include <endian.h> #include <iostream> #include <vector> using namespace std; typedef struct Edge{ int ...

2025-07-06

0 50

题解 | 二叉排序树

#include <iostream> using namespace std; typedef struct Node { int data; Node* lchild, *rchild; } Node; void create(Node*& node, i...

2025-07-06

0 54

题解 | 二叉排序树

#include <iostream> using namespace std; typedef struct Node { int data; Node* lchild, *rchild; } Node; void create(Node* &n, int ...

2025-07-06

0 65

题解 | 树查找

#include <iostream> #include <queue> #include <math.h> using namespace std; typedef struct Node{ int data; Node * lchild, *...

2025-07-05

0 47

题解 | 二叉树

#include <iostream> #include <queue> using namespace std; int main() { int n, m; while(cin >> m >> n){ queue&...

2025-07-05

0 62

题解 | 二叉树

#include <iostream> using namespace std; int main() { int x, y; while(cin >> x >> y){ while(x != y){ if...

2025-07-05

0 36

题解 | 二叉树遍历

#include <iostream> #include <string> using namespace std; typedef struct Node { char root; Node* rchild, *lchild; } Node; Node*...

2025-07-05

0 54