资源列表
acjanchan
- 2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^?
bigIntforc++
- C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output
EightQueen
- 八皇后问题，每次运行可以得到不同的结果。方法较容易理解。源文件C++。开发环境VC++。-Eight queens problem, each run can get different results. Method easier to understand. Source file C++. Development Environment VC++.
bestschedulestore
- 用贪心算法实现的程序存储问题和用回溯法实现的最佳调度问题-Greedy algorithm with memory problems and procedures to achieve the best use of backtracking scheduling problem
bestmatch
- 算法设计类源代码。以男女配对为例，通过男女优先表循环寻求稳定匹配或者最佳匹配。-Algorithm design class source code. Match between men and women, for example, prioritized list of men and women circulating through the match or best match for stability.
Cpp2
- c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度-c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling
shuzhuang
- 桉树状打印二叉树，对初学者来说有一定的帮助，同时在理解二叉树方面也有一定的了解。-Eucalyptus-like print binary tree, for beginners who have some help, but in understanding the binary tree also has a certain understanding.
ERCHASHU
- 二叉树的建立，插入，删除及遍历。可用于课程设计。-The establishment of a binary tree , insert, delete, and traversal. .
graph
- 对图的深度优先遍历 基于堆栈 非堆栈 两种实现
tree
- 程序说明 创建二叉树，并以前序、中序和后序进行遍历 随机产生15个0~100之间的整数，然后插入到二叉树中 2007.11.25
list
- 用C++实现的“表”（list）类，可用于多种排序法的实现。
suanshuyouxianquan
- 最短路径之贪心算法，用C语言实现，主要是参考了迪杰斯特拉算法。-The greedy algorithm for shortest path