Patrick Plus

分类

题解(4)

/ 注册

全部文章（共6篇）

题解 | #二叉排序树#纯c,非递归

#include <stdio.h> #include <stdlib.h> typedef struct tnode { int x; struct tnode* lchild; struct tnode* rchild; } node, *pnod...

2023-03-19

0 332

题解 | #二叉排序树#

#include <stdio.h> #include <stdlib.h> typedef struct tnode { int x; struct tnode* lchild; struct tnode* rchild; } node, *pnod...

2023-03-19

0 299

上下金字塔

include using namespace std;int main() { int n,m,j; while (cin>>n) { for (int i = 1; i <= 2n-1; i++) { if (i &...

2020-04-22

1 723

金字塔——参考

include using namespace std;int main() { int n,m,j; while (cin>>n) { for (int i = 1; i <= n; i++) { m = n - i;...

2020-04-22

0 532

参考

include using namespace std;int main() { int n,m,flag=0; cin >> n; while (n !=0) { cin >> m; int i = 1; while (i<=...

2020-04-22

0 555

参考

include using namespace std;int main() { int a, b; while (cin >> a >> b, a || b) { cout << a + b << endl; }}

2020-04-20

0 684