资源列表
tr96013[1].ps
- 关于steiner介绍，中间有ps格式，可以把其转为pdf格式-on STEINER, middle ps format can be converted to look at the pdf format
card24
- 可以进行分数的24点运算的，因为里面还额外实现了一个分数类。24点必须用VC编译，GCC编译会有问题，这个bug当时没找出来。可能是默认堆栈大小的问题。这个程序从我现在看来，写得很差。-can score 24 points in computing, because it has achieved an additional category scores. 24 points to be compiled with VC, the GCC compiler will create probl
ccccccccctc
- n牛的c语言经典例题，学好c语言在此一举-n cattle classic example c language, learn the language c one stroke
GREEDYSELECT1
- 这是一个会议安排问题,知道没个会议的开此时间跟结束时间就可以求要求的最少会议室 理论基础是谈心算法-This is an organization of the session, know that the meetings did not set a time to the end of time can be the minimum requirement in order Conference Room theoretical basis of the algorithm for he
jiangshangfei
- 该程序用于进行多项式的四则运算，其中抽象数据类型主要有栈和结构 -the procedures for conducting the four polynomial operations, which mainly abstract data type and structure of a stack
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^?
MD5suanfaJavaBeanMD5
- MD5算法Java BeanMD5，希望大家参考学习，相信您会有所收获-Java BeanMD5 MD5 algorithm, we hope to learn information, I believe that you will gain
dancinglink
- This a program to implement the so-called \"dancing link\" which is introduced in Knuth s paper. This is really a super acrobatic and I am sure that not many programmers can understand the algorithms. -This is a program to implement the so-c
vlong
- very long 整数类，可以做高精度四则运算-very long integer type, can do high-precision four Operational
linearhashing
- linearing hashing (with c++)-linearing hashing (with c)
nqueens9901
- 著名的n皇后问题。实现结果为 请输入这是一个几皇后问题:4 4皇后问题有解为: 2 4 1 3 4皇后问题有解为: 3 1 4 2 Press any key to continue -n Queen's famous question. To achieve results Please enter several This is a Queen's : 4 Queen of the solutions to these problems : 2 4
beibaowenti007
- 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n)，使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the