cwindyc的博客

#include<iostream>#include<math.h>using namespace std;void digitoutput(int n) { switch (n) { case 0: cout << "zero"; break; case 1: cout << "one"; break; case 2: cout << "two"; break; case 3: cout << "three"; br

#include<iostream>using namespace std;typedef struct TimeType { int hh; int mm; int ss;} Time;struct ID_group { char s[16]; Time inTime; Time outTime;} Person[100];int main() { int n, j = 0, count = 1, i; cin >> n; for (i = 0;

#include<iostream>#include<algorithm>#include<math.h>using namespace std;struct Digits { char charnum; int realnum; int flag = -1;}a[21];int main() { int i, count; char p; for (i = 0;; i++) { p = getchar(); a[i].charnum

#include<iostream>using namespace std;typedef int ElementType;typedef struct TNode* Position;typedef Position BinTree;struct TNode { ElementType Data; BinTree Left; BinTree Right;};void InorderTraversal(BinTree BT) { if (BT) { InorderT

#include<iostream>#include<queue>using namespace std;#define MaxTree 10#define Null -1typedef int ElementType;typedef int Tree;struct TNode { ElementType Data; Tree Left; Tree Right;}T[MaxTree];int sum = 0;Tree BuildTree(struct T

#include<iostream>using namespace std;#define MaxTree 10#define Null -1typedef char ElementType;typedef int Tree;struct TreeNode { ElementType Element; Tree Left; Tree Right;}T1[MaxTree], T2[MaxTree];//全局变量T1 T2Tree BuildTree(struct Tree

#include<iostream>#include<stack>using namespace std;int main() { int capacity, num, cnt; cin >> capacity >> num >> cnt;//capacity堆栈容量 num待检查的元素的个数 cnt组数 while (cnt--) {//循环cnt次 int* a = new int[num + 1];//创建数组存放待检查元素

在这里插入代码片

#include<iostream>using namespace std;typedef int ElementType;typedef struct Node* ptrNode;typedef ptrNode LinkList;typedef ptrNode Position;struct Node { ElementType Coefficient; ElementType Exponent; Position Next;};LinkList CreatList(

#include<iostream>using namespace std;int main() { int a[100000], i, j, flag = 0, n; int ThisSum, MaxSum = -2147483648; int Maxi, Maxj; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] >= 0) flag = 1; } if (fl

#include<iostream>using namespace std;constexpr auto MAXSIZE = 10;constexpr auto NotFound = 0;typedef int ElementType;typedef int Position;//Position代表将要用二分查找寻找的数字的位置typedef struct LNode* List;//List是指向结构体的指针struct LNode {//List结构体 ElementT

#include<iostream>using namespace std;typedef int ElementType;typedef struct TNode* Position;typedef Position BinTree;struct TNode { ElementType Data; BinTree Left; BinTree Right;};void PreorderTraversal(BinTree BT);void InorderTraversal

#include<iostream>using namespace std;typedef int ElementType;typedef struct Node* PtrToNode;typedef PtrToNode List;struct Node { ElementType Data; PtrToNode Next;};void Print(List L);List Read();List Merge(List L1, List L2);int main()

#include<iostream>using namespace std;#define MAXSIZE 10#define NotFound 0typedef int ElementType;typedef int Position;typedef struct LNode* List;struct LNode { ElementType Data[MAXSIZE]; Position Last;};List ReadInput();Position Binary