ysong想养只修狗

分类

/ 注册

全部文章（共63篇）

题解 | #搬水果#

#include <iostream> #include <queue> #include <vector> using namespace std; //哈夫曼树应用 int main() { int n; while (cin >>...

2023-06-05

0 253

题解 | #哈夫曼树#

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

2023-06-05

0 279

题解 | #复数集合#

#include <iostream> #include <queue> using namespace std; struct Complex{ int real; int imag; Complex(int r, int i):real(r), ...

2023-06-04

0 264

题解 | #二叉搜索树#

#include <iostream> using namespace std; struct Node { char data; Node* left; Node* right; Node(char c):data(c), left(NULL), ri...

2023-06-03

0 204

题解 | #二叉排序树#

#include <iostream> using namespace std; const int N = 101; struct Node{ int data; Node* left; Node* right; Node(int x):data(x)...

2023-06-03

0 259

题解 | #二叉排序树#

#include <iostream> using namespace std; struct Node { int data; Node* left; Node* right; Node(int a) : data(a), left(NULL), ri...

2023-06-03

0 199

题解 | #二叉树遍历#

#include <iostream> #include <string> using namespace std; struct Node { char data; Node* leftT; Node* rightT; Node(char ...

2023-06-02

0 209

题解 | #二叉树遍历#

#include <iostream> using namespace std; int pos; string str; struct Node { char data; Node * leftT; Node * rightT; Node(char ...

2023-06-02

0 201

题解 | #八皇后#

#include <cstdio> #include <iostream> using namespace std; const int N = 10; bool col[N], dg[2 * N], ndg[2 * N]; char path[10];//存放每一种方案...

2023-05-29

0 183

题解 | #神奇的口袋#

#include <iostream> using namespace std; const int N = 50; int path[N]; bool visit[N]; int a[N]; int sum_weight; int sum_method; int n; void D...

2023-05-29

0 229