m0_45384394的博客

#include<iostream>#include<vector>#include<algorithm>#include<math.h>using namespace std;int main(){ int hash[100000]; int n; cin>>n; int tag=0; for(int i=0;i<n;i++) { int x; ci

#include<map>#include<vector>#include<iostream>#include<algorithm>using namespace std;typedef struct{ string s; int id;}node;bool cmp(node n1,node n2){ return n1.id<n2.id;}int main(){ map<string,int>

#include<iostream>#include<map>#include<algorithm>#include<vector>using namespace std;typedef struct{ string name; int id;}node;bool cmp(node n1,node n2){ return n1.id<n2.id;}int main(){ map<string,i

#include<iostream>#include<vector>#include<algorithm>using namespace std;typedef struct{ string id; string in; string out;}node;bool com1(node p1,node p2){ if((p1.in[0]-'0')*10+p1.in[1]-'0'<(p2.in[0]-'0')*10+p2.

求最晚和最早日期作者:XXX 时间限制: 1S 章节: 循环问题描述 :输入N个日期，每个以年、月、日的顺序读入，打印输出最晚的日期、最早的日期。输入说明 :你的程序需要从标准输入设备（通常为键盘）中读入多组测试数据。每组输入数据由多行组成。每组测试数据的第一行输入一个整数N(0<N<20)，表示有N个日期。其后N行每行有三个整数Y(1≤Y≤2015)，M(1≤M≤12)，D(1≤D≤31)表示一个日期。输出说明 :对每组测试数据，你的程序需要向标准输出设备（通常为启动该程序的文本

//排序题//设计一个双向冒泡排序法，即在排序过程中交替改变扫描方向void BiBubble(Sqlist &L){ int i,j; int temp; int tag = 0; int low=1, high=L->length; for (i = 1; i < L->length&&tag==0; i++) { tag = 1; if (i % 2 == 0) { for (j = high; j >low; j--

//线索化//线索二叉树typedef struct Threadnode{ int data; struct Threadnode* lchild; struct Threadnode* rchild; int ltag = 0; int rtag = 0;}*ThreadTree;//中序遍历线索化void InThreadTree(ThreadTree T, ThreadTree pre){ ThreadTree p; if (p) { InThreadTree(p-

#include<stdio.h>#include<iostream>#include<stdlib.h>using namespace std;//数据结构typedef struct BSTnode{ int data; struct BSTnode* lchild; struct BSTnode* rchild;}*BSTree;//非递归查找BSTree BST_search(BSTree T,int key){ BSTree p =

#include<stdio.h>#include<stdlib.h>#include<iostream>using namespace std;#define MAXSIZE 20//顺序表typedef struct{ int data[MAXSIZE]; int length;}Sqlist;//链表typedef struct Lnode{ int data; struct Lnode* next;}*LinkList, Lnode

#include<stdio.h>#include<stdlib.h>#include<iostream>using namespace std;#define MAXSIZE 40//顺序表typedef struct{ int data[MAXSIZE]; int length;}Sqlist;//链表typedef struct Lnode{ int data; struct Lnode* next;}*LinkList,Lnode;

#include<stdio.h>#include<stdlib.h>#include<iostream>#include<math.h>#include<conio.h>/*@hey_超级巨星*/using namespace std;#define R 8.314//普维法求压强和体积 类class puWei_PV{private : double T;//单位开尔文 double V0;//钢瓶容积m3 do

/*栈的加减乘除有关算法@hey_超级巨星*/#include <stdio.h>#include<stdlib.h>#define MAXSIZE 50typedef struct{ char data[MAXSIZE]; int top;}*Stack;void InitStack(Stack &S){ S->top = -1;...

@hey_超级巨星图的所有数据结构```cpp#include<stdio.h>#include<stdlib.h>#include<math.h>typedef int Elemtype;#define ok 1#define ERROR 0#define MAXSIZE 10typedef struct GraphNode{ Elem...

/*二叉排序树(带有链队列的层次遍历)@hey超级巨星*/#include<stdio.h>#include<stdlib.h>#include <iostream>using namespace std;#define ERROR 0#define OK 1typedef int Elemtype;typedef int Status;...

/*@hey超级巨星*/#include<stdio.h>#include<stdlib.h>#include<iostream>using namespace std;#define ERROR 0#define OK 1typedef int Elemtype;typedef int Status;//二叉树的链式存储typedef ...

/*栈的顺序存储和链栈//@hey超级巨星*/#include<stdio.h>#include<stdlib.h>typedef int Elemtype;typedef int Status;#define OK 1;#define ERROR 0;#define STACK_SIZE 10#define STACKINCREASE 10type...

/*链队列@hey超级巨星*/#include <stdio.h>#include<stdlib.h>#include <iostream>using namespace std;#define ERROR 0#define OK 1#define True 1#define False 0#define MAXSIZE 20typed...

/*顺序循环队列*/#include <stdio.h>#include<stdlib.h>#include <iostream>using namespace std;#define ERROR 0#define OK 1#define True 1#define False 0#define MAXSIZE 20typedef int...

#include <stdio.h>#include <stdlib.h>#include<iostream>using namespace std;#define OK 1#define ERROR 0typedef int Status ;typedef int Elemtype;typedef struct LNode{ Elemtyp...

/*关于数组顺序表的初始化增删改*/#include <stdlib.h>#include <stdio.h>#include <iostream>using namespace std;#define ERROR 0#define OK 1#define overflow -2#define MAXSIZE 50#define ADDS...