Aruasg的博客

进阶实验5-3.1-航空公司VIP客户查询-编程题解题代码测试结果问题整理解题代码#include<iostream>#include<string>#include<stdio.h>#include<unordered_map>using namespace std;unordered_map<string, int> m;int main(){ int N, low, temp, M, flag = 1; cin >

基础实验5-2.3-QQ帐户的申请与登陆-编程题解题代码测试结果问题整理解题代码#include<iostream>#include<string>#include<map>using namespace std;map<string, string> m;int main(){ int N; cin >> N; char c; string num, code; for (int i = 0; i < N; i++

基础实验5-2.2-电话聊天狂人-编程题解题代码测试结果问题整理解题代码#include<iostream>#include<map>#include<string>using namespace std;map<string, int> m;int main(){ int N, max = 0, cnt = 0; string ret, str; cin >> N; while (cin >> str) {

进阶实验3-3.1-求前缀表达式的值-编程题解题代码测试结果问题整理解题代码#include<iostream>#include<string>#include<stack>#include<stdio.h>using namespace std;int main(){ stack<double> s; string a[30]; int n = 0; double temp, temp1, temp2; bool fla

案例6-1.5-旅游规划-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 500#define ERROR -1#define Infinite 65534int N, M, S, D;int Dist[MAXN][MAXN], Cost[MAXN][MAXN];int dist[MAXN], cost[MAXN], visit[MAXN];void Inicialization(void);void FindTheWay(v

案例6-1.7-公路村村通-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 1000#define ERROR -1#define Infinite 65534int N, M;int G[MAXN][MAXN], dist[MAXN];void Inicialization(void);int Prim(void);int FindMinDist(void);int main(){ scanf("%d %d", &am

案例6-1.6-哈利·波特的考试-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 100#define Infinite 65534int N, M;int G[MAXN][MAXN];void BuildGraph(void);void FindAnimal(void);int FindMax(int index);void Floyd(void);int main(){ scanf("%d %d", &N,

基础实验6-2.1-列出连通集-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 10int A[MAXN][MAXN], B[MAXN], Q[MAXN];int N, rear = -1, front = -1;typedef enum { false, true } bool;void Clear(void);voi...

基础实验6-2.3-拯救007-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<math.h>#define MAXN 100#define DIA 15#define SIDE 100typedef enum { false, true } bool;bool CanJumpToSide(int index);b...

进阶实验6-3.4-拯救007（升级版）-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#include<math.h>#define MAXN 100#define SIDE 100#define DIA 15typedef enum { false, true } bool;ty...

案例4-1.7-文件传输-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 10000typedef int set_type[MAXN];void Initialization(set_type S, int N);void Input_connection(set_type S);void Check_connectio...

01-复杂度3-二分查找-函数题解题代码测试结果问题整理解题代码Position BinarySearch( List L, ElementType X ){ Position ret=NotFound; Position left=1,right=L->Last; Position loc; while(left<=right){ ...

进阶实验4-3.4-笛卡尔树-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#define MAXN 1000typedef enum { false, true } bool;typedef struct sarray* psa;struct sarray { int k1, k2, left,...

案例4-1.6-树种统计-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#include<string.h>#define MAXN 10000#define MAXS 30typedef struct tnode* pt;struct tnode { char data[MAXS+...

基础实验2-2.5-整数分解为若干项之和-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>int A[31];int K;//figure to be decomposedint cnt;int flag = 1;void Re_decompose(int demainer, int start, ...

基础实验3-2.4-出栈序列的合法性-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>typedef enum { false, true } bool;typedef struct stack* pst;struct stack { int* data; int top; int cnt; i...

进阶实验4-3.3-完全二叉搜索树-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#include<math.h>int Cmp(const void* a, const void* b);void LevelTraversal(int* CBT, int N);int* CreatCB...

进阶实验2-3.4-素因子分解-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#include<math.h>typedef enum{false,true} bool;void PrintFactorizationOfPrime(int K);int GetNextFactorOfPr...

案例3-1.9-银行业务队列简单模拟-编程题解题代码测试结果问题整理解题代码#include<stdlib.h>#include<stdio.h>typedef struct queue* pqu;struct queue { int* data; int front, rear;};void Inject(pqu A, pqu B, int N);vo...

基础实验3-2.1-一元多项式求导-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>void ReadPoly(int* A);void HandlePoly(int* A);void PrintPoly(int* A);int main(){ int A[1001] = { 0 }; Read...

01-复杂度3-二分查找-函数题解题代码测试结果问题整理解题代码#include<stdlib.h>#include<stdio.h>typedef enum{false,true} bool;typedef struct node* pnode;struct node { int data; pnode next;};pnode ReadList(pn...

基础实验4-2.1-树的同构-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>typedef enum{false,true} bool;typedef struct STNode* pST;struct STNode { char data; int left; int right;};in...

进阶实验2-3.1-海盗分赃-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>typedef enum{false,true} bool;typedef struct farray* pfa;struct farray { int data; bool flag;};int Pirate(pfa...

基础实验4-2.3-二叉树的非递归遍历-函数题解题代码测试结果问题整理解题代码void InorderTraversal(BinTree BT) { Stack S = CreateStack(); while (BT || !IsEmpty(S)) { while (BT) if (Push(S, BT)) BT = BT->Left; BT = Pop(S); pr...

基础实验3-2.5-堆栈模拟队列-函数题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>typedef struct stack* Stack;struct stack { int *data; int top; int MaxSize;};int IsFull(Stack S) { return ...

基础实验4-2.2-列出叶结点-函数题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>typedef struct queue que;struct queue { int left; int right;};int main(){ int N, i; scanf("%d", &N); ...

基础实验3-2.3-共享后缀的链表-函数题解题代码测试结果问题整理解题代码PtrToNode Suffix(List L1, List L2) { char* a = (char*)malloc(1000000 * sizeof(char)); char* b = (char*)malloc(1000000 * sizeof(char)); int top1 = -1 , top2 = ...

基础实验2-2.4-装箱问题-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>struct arr { int num; int data; int sum; int tag;};int main(){ int N, i, j, flag, cnt = 0, max = 1; scanf(...

基础实验2-2.3-组合数的和-编程题解题代码测试结果问题整理解题代码#include<stdio.h>int main(){ int N, sum = 0, i, t; scanf("%d", &N); for (i = 0; i < N; i++) { scanf("%d", &t); sum += t; } sum = sum*(N...

01-复杂度3-二分查找-函数题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ double res = 0.0; double ave = 0.0; int N, i; scanf("%d", &N); int *a = ...

基础实验2-2.1-整数的分类处理-编程题解题代码测试结果问题整理解题代码#include<stdio.h>int main() { int N; scanf("%d", &N); int i, A1max = 0, A2num = 0,t,n=0; double A3ave = 0.0; for (i = 0; i < N; i++) { scanf...

进阶实验1-3.1-两个有序序列的中位数-编程题解题代码测试结果问题整理解题代码#include<stdio.h>#include<stdlib.h>int Re(int a[], int left, int right, int K);int main(){ int N; scanf("%d", &N); int *a = (int *)mall...

基础实验3-2.2-单链表分段逆转-函数题解题代码测试结果问题整理解题代码void K_Reverse(List L, int K) { int i, len = 0, cnt; List p = L, t, r, s, q = p->Next, temp; while (q) { q = q->Next; len++; } if (K > len || l...

进阶实验1-3.1 两个有序序列的中位数解题代码-傻大粗方法测试结果-运行超时问题整理解题代码-傻大粗方法#include<stdio.h>void Transfer(int S1[],int S2[],int N);int Sort(int S1[],int n);int Insert(int k,int S1[],int n,int* pleft);int main()...