(ง •̀_•́)ง

#include#include#includeint min;//记录最小时间int max;//记录最多解题数int time, num, t0;char c[12][22];int visit[12];int t[12];//做出该题时间int d[12];int path[12];int count;int index[12];int size;void

#include<stdio.h>typedef struct node Tree;struct node{ int element; int left; int right;};Tree tree[10]; Tree queue[10];int ans[10];int cnt=0;int front,rear;void enqueue(Tree T)...

#include<stdio.h>#include<stdlib.h> #define INF 10000int d[105][105];int visit[105];int m;int flag;int count=0;void floyd(){ int i,j,k; int min,max,index; min=INF; index=...

#include <stdio.h>#include <stdlib.h>typedef enum {false, true} bool;#define MaxVertexNum 10 /* maximum number of vertices */typedef int Vertex; /* vertices are numbered from 0...

#include <stdio.h>#include <stdlib.h>typedef int ElementType;#define MinData -1typedef struct HeapStruct *PriorityQueue;struct HeapStruct { ElementType *Elements; int Capa...

#include <stdio.h>#include <stdlib.h>typedef enum {false, true} bool;#define MaxVertexNum 10 /* maximum number of vertices */typedef int Vertex; /* vertices are numbered from 0...

#include <stdio.h>#include <stdlib.h>typedef enum {false, true} bool;#define MaxVertexNum 10 /* maximum number of vertices */typedef int Vertex; /* vertices are numbered from 0...

此题与整数划分为同一类型的题目，基本方法都是搜索+动态规划。        题意是给定总金额，硬币数值，输出恰好能够凑出总金额的硬币组合方法，由于是多解题，要求按字典序最小输出，处理这个字典序只需实现对数组进行排序，为了方便直接调用了stl::sort，然后在搜索的时候加上一些限定条件。        注意要考虑到重复金额的硬币，并由此作相应的剪枝操作，最后一个测试点估计含有大量无效重复数

 算法参考了网上资料（Tarjan算法），嫌麻烦并没有使用给出的函数指针。#include <stdio.h>#include <stdlib.h>#define MaxVertices 10  /* maximum number of vertices */typedef int Vertex;     /* vertices are numbered fr...

B+树已通过pta测试。

We can perform BuildHeap for leftist heaps by considering each element as a one-node leftist heap, placing all these heaps on a queue, and performing the following step: Until only one heap is on the

#include <stdio.h>#include <stdlib.h>typedef enum {false, true} bool;#define INFINITY 1000000#define MaxVertexNum 10  /* maximum number of vertices */typedef int Vertex;      /* ver...

#include<stdio.h>#include<stdlib.h>#include<queue>#define MAX 1000using namespace std;struct node{ int x; int i; bool operator<(const node w)const{ return x>w.x; ...

#include<stdio.h>#define MAX 10005int p[MAX];int num[MAX];int find(int x){ int k,j,r; r=x; while(r!=p[r]) r=p[r]; k=x; while(k!= r) ...

#include <stdio.h>#include <stdlib.h>typedef enum { true, false, maybe } Keys;typedef Keys ElementType;void Read( ElementType A[], int N ); /* details omitted */void MySort( Eleme...

Which one of the following is the lowest upper bound of T(n)T(n)T(n) for the following recursion T(n)=2T(n)+lognT(n) = 2T(\sqrt{n}) + \log nT(n)=2T(√​n​​​)+logn?(4分)                设 m =

2 2 4 1 5 5 6 3 1 1 5 6 2  1 2 2 2 2 2 2 2 2 2 2 2 3  1 2 2 2 2 2 2 3 3 3 3 3 1  1 2 2 3 3 3 3 3 4 5 5 5 5  1 2 2 3 4 5 5 5 5 5 6 6 6  1 2 2 3 4 5 6 6 6 6 6 7#include#include#inclu

用C++的东西写，速度比较慢，需要靠运气卡过……如果完全用C编写，速度在50ms以下。        #include#include#include#include#include#include#includeusing namespace std;#define MAX 105int weight;int n;struct character{ char

#include<stdio.h>#include<stdlib.h>#include<math.h>int a[10010];int ans[10010];int prime[10010];int m,n;void GetPrime(){ int MAX=10010; int i,j; prime[0]=0,prime[1]=0...